{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/code/load-from-json","entry":"load_from_json","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-10-05T00:36:11+00:00","claim":"Names are grouped by exact entry-name string. Same-named routines are NOT asserted to be equivalent; 'ran' means executed on a synthesized fixture, not correctness. n_samples_ran = sum of by_status over every status except 'unverified' (ran_draft_wrong and ran_fixture are failures of Syntology's instrument, not of the code); n_papers_ran = papers with at least one such sample = n_papers_ran_no_instrument_failure (papers with a run with no instrument failure) + n_papers_ran_instrument_only (papers where every run was a failure of Syntology's instrument); n_samples_ran = n_samples_ran_checked (honoured, violated, no contract) + n_samples_instrument (failures of Syntology's instrument, not of the code).","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":15,"n_papers_ran":15,"n_papers_ran_no_instrument_failure":10,"n_papers_ran_instrument_only":5,"units":"n_samples, n_samples_ran, n_samples_fingerprinted and by_status count distinct code bodies (code_sha256); n_places and n_places_pointer_only count places, one per (paper, code body) pair, which is also the unit of the samples list","n_samples":14,"n_samples_ran":14,"n_samples_constructed":0,"n_samples_ran_checked":8,"n_samples_instrument":6,"n_samples_unverified":0,"n_samples_fingerprinted":0,"n_places":16,"n_places_pointer_only":6,"n_places_pointer_only_link_open":0,"inline_ok_is":"inline_ok is true only when both licence gates allow Syntology to serve this code's text: this paper's link (inline_ok_link, from the licence of this paper's copy) and the stored copy of the same code that Syntology serves, which may have been first harvested from another repository. withheld_clause is Syntology's own wording of which gate keeps the text a pointer and why, and is null when inline_ok is true. This site shows no code text either way; n_places_pointer_only_link_open counts the places where this paper's link allows the text and the stored copy does not","by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":6,"ran_fixture":0,"ran":8,"unverified":0},"key_notes":{"n_samples_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_samples_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"syntology":{"atlas_url":null,"mcp":null,"mcp_per_sample":{"tool":"get_code","arguments_in":"samples[].mcp_get_code"},"developers":"https://syntology.ai/developers"},"samples":[{"arxiv_id":"2503.08257","arxiv_id_is_arxiv":true,"paper":"/paper/dexgrasp-anything-towards-universal-robotic","title":"DexGrasp Anything: Towards Universal Robotic Dexterous Grasping with Physics Awareness","date":"2025-03-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"4DVLab/DexGrasp-Anything","path":"datasets/DexGraspNet.py","file_url":"https://github.com/4DVLab/DexGrasp-Anything/blob/HEAD/datasets/DexGraspNet.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"d818a44f97b3868d","code_sha256_prefix":"d818a44f97b3868d","mcp_get_code":{"code_sha256":"d818a44f97b3868d"}},{"arxiv_id":"2501.19201","arxiv_id_is_arxiv":true,"paper":"/paper/efficient-reasoning-with-hidden-thinking","title":"Efficient Reasoning with Hidden Thinking","date":"2025-01-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shawnricecake/Heima","path":"heima/main_python/1_1-organize_dataset-num_thinking_tokens-fix_num.py","file_url":"https://github.com/shawnricecake/Heima/blob/HEAD/heima/main_python/1_1-organize_dataset-num_thinking_tokens-fix_num.py","status":"ran_draft_wrong","verification_level":2,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, shawnricecake/Heima when it was checked","code_sha256":"054f0c94c7ad7580","code_sha256_prefix":"054f0c94c7ad7580","mcp_get_code":{"code_sha256":"054f0c94c7ad7580"}},{"arxiv_id":"2501.19201","arxiv_id_is_arxiv":true,"paper":"/paper/efficient-reasoning-with-hidden-thinking","title":"Efficient Reasoning with Hidden Thinking","date":"2025-01-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shawnricecake/Heima","path":"heima/main_python/5-demo-decode-pure_llm_decoder_lora-split_3_stages.py","file_url":"https://github.com/shawnricecake/Heima/blob/HEAD/heima/main_python/5-demo-decode-pure_llm_decoder_lora-split_3_stages.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, shawnricecake/Heima when it was checked","code_sha256":"bbaa745857cf091e","code_sha256_prefix":"bbaa745857cf091e","mcp_get_code":{"code_sha256":"bbaa745857cf091e"}},{"arxiv_id":"2411.12405","arxiv_id_is_arxiv":true,"paper":"/paper/evaluating-the-prompt-steerability-of-large","title":"Evaluating the Prompt Steerability of Large Language Models","date":"2024-11-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"IBM/prompt-steering","path":"prompt_steerability/utils/data_utils.py","file_url":"https://github.com/IBM/prompt-steering/blob/HEAD/prompt_steerability/utils/data_utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"bb004e96d00f3668","code_sha256_prefix":"bb004e96d00f3668","mcp_get_code":{"code_sha256":"bb004e96d00f3668"}},{"arxiv_id":"2402.11339","arxiv_id_is_arxiv":true,"paper":"/paper/expressive-higher-order-link-prediction","title":"Expressive Higher-Order Link Prediction through Hypergraph Symmetry Breaking","date":"2024-02-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"simonzhang00/hypergraphsymmetrybreaking","path":"hsb/datapipe/loader.py","file_url":"https://github.com/simonzhang00/hypergraphsymmetrybreaking/blob/HEAD/hsb/datapipe/loader.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"GPL-3.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GPL-3.0, as GitHub detects it on this paper's repository, simonzhang00/hypergraphsymmetrybreaking, is not in the permissive set Syntology serves inline","code_sha256":"9a18886baf12e3f9","code_sha256_prefix":"9a18886baf12e3f9","mcp_get_code":{"code_sha256":"9a18886baf12e3f9"}},{"arxiv_id":"2401.13231","arxiv_id_is_arxiv":true,"paper":"/paper/dittogym-learning-to-control-soft-shape","title":"DittoGym: Learning to Control Soft Shape-Shifting Robots","date":"2024-01-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"suninghuang19/cfp","path":"utils.py","file_url":"https://github.com/suninghuang19/cfp/blob/HEAD/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, suninghuang19/cfp when it was checked","code_sha256":"a5d74fc31e296f17","code_sha256_prefix":"a5d74fc31e296f17","mcp_get_code":{"code_sha256":"a5d74fc31e296f17"}},{"arxiv_id":"2311.12022","arxiv_id_is_arxiv":true,"paper":"/paper/gpqa-a-graduate-level-google-proof-q-a","title":"GPQA: A Graduate-Level Google-Proof Q&A Benchmark","date":"2023-11-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"idavidrein/gpqa","path":"baselines/utils.py","file_url":"https://github.com/idavidrein/gpqa/blob/HEAD/baselines/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"a5691fda5dd24a86","code_sha256_prefix":"a5691fda5dd24a86","mcp_get_code":{"code_sha256":"a5691fda5dd24a86"}},{"arxiv_id":"2309.12288","arxiv_id_is_arxiv":true,"paper":"/paper/the-reversal-curse-llms-trained-on-a-is-b","title":"The Reversal Curse: LLMs trained on \"A is B\" fail to learn \"B is A\"","date":"2023-09-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lukasberglund/reversal_curse","path":"src/common.py","file_url":"https://github.com/lukasberglund/reversal_curse/blob/HEAD/src/common.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, lukasberglund/reversal_curse when it was checked","code_sha256":"e01bde09eb15910f","code_sha256_prefix":"e01bde09eb15910f","mcp_get_code":{"code_sha256":"e01bde09eb15910f"}},{"arxiv_id":"2309.00667","arxiv_id_is_arxiv":true,"paper":"/paper/taken-out-of-context-on-measuring-situational","title":"Taken out of context: On measuring situational awareness in LLMs","date":"2023-09-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"asacooperstickland/situational-awareness-evals","path":"sitaevals/common.py","file_url":"https://github.com/asacooperstickland/situational-awareness-evals/blob/HEAD/sitaevals/common.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, asacooperstickland/situational-awareness-evals when it was checked","code_sha256":"e01bde09eb15910f","code_sha256_prefix":"e01bde09eb15910f","mcp_get_code":{"code_sha256":"e01bde09eb15910f"}},{"arxiv_id":"2211.10869","arxiv_id_is_arxiv":true,"paper":"/paper/unimask-unified-inference-in-sequential","title":"UniMASK: Unified Inference in Sequential Decision Problems","date":"2022-11-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"micahcarroll/unimask","path":"uniMASK/transformer.py","file_url":"https://github.com/micahcarroll/unimask/blob/HEAD/uniMASK/transformer.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"b195e5016e7445e1","code_sha256_prefix":"b195e5016e7445e1","mcp_get_code":{"code_sha256":"b195e5016e7445e1"}},{"arxiv_id":"2206.02341","arxiv_id_is_arxiv":true,"paper":"/paper/complex-locomotion-skill-learning-via-1","title":"Complex Locomotion Skill Learning via Differentiable Physics","date":"2022-06-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"erizmr/Complex-locomotion-skill-learning-via-differentiable-physics","path":"multitask/config_util.py","file_url":"https://github.com/erizmr/Complex-locomotion-skill-learning-via-differentiable-physics/blob/HEAD/multitask/config_util.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"cbd58c04b9451aaa","code_sha256_prefix":"cbd58c04b9451aaa","mcp_get_code":{"code_sha256":"cbd58c04b9451aaa"}},{"arxiv_id":"2110.04845","arxiv_id_is_arxiv":true,"paper":"/paper/what-makes-sentences-semantically-related-a","title":"What Makes Sentences Semantically Related: A Textual Relatedness Dataset and Empirical Study","date":"2021-10-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"binwang28/rse","path":"rse_src/data_loader.py","file_url":"https://github.com/binwang28/rse/blob/HEAD/rse_src/data_loader.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"683315c7bd2b8f4b","code_sha256_prefix":"683315c7bd2b8f4b","mcp_get_code":{"code_sha256":"683315c7bd2b8f4b"}},{"arxiv_id":"1910.06772","arxiv_id_is_arxiv":true,"paper":"/paper/counterfactual-diagnosis","title":"Counterfactual diagnosis","date":"2019-10-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"babylonhealth/counterfactual-diagnosis","path":"utils.py","file_url":"https://github.com/babylonhealth/counterfactual-diagnosis/blob/HEAD/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"dfb7370128ac17f7","code_sha256_prefix":"dfb7370128ac17f7","mcp_get_code":{"code_sha256":"dfb7370128ac17f7"}},{"arxiv_id":"1906.05895","arxiv_id_is_arxiv":true,"paper":"/paper/learning-to-forget-for-meta-learning","title":"Learning to Forget for Meta-Learning","date":"2019-06-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"baiksung/L2F","path":"utils/storage.py","file_url":"https://github.com/baiksung/L2F/blob/HEAD/utils/storage.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"1ffc7f12a771c7d6","code_sha256_prefix":"1ffc7f12a771c7d6","mcp_get_code":{"code_sha256":"1ffc7f12a771c7d6"}},{"arxiv_id":"1905.10295","arxiv_id_is_arxiv":true,"paper":"/paper/learning-to-learn-by-self-critique","title":"Learning to learn via Self-Critique","date":"2019-05-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AntreasAntoniou/Learning_to_Learn_via_Self-Critique","path":"utils/storage.py","file_url":"https://github.com/AntreasAntoniou/Learning_to_Learn_via_Self-Critique/blob/HEAD/utils/storage.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"1ffc7f12a771c7d6","code_sha256_prefix":"1ffc7f12a771c7d6","mcp_get_code":{"code_sha256":"1ffc7f12a771c7d6"}},{"arxiv_id":"openreview_sfWgUkh5Zj","arxiv_id_is_arxiv":false,"paper":null,"title":"OpenReview id openreview_sfWgUkh5Zj","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"zzzhr97/SpecBench","path":"specbench/utils.py","file_url":"https://github.com/zzzhr97/SpecBench/blob/HEAD/specbench/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"f87671ec68c9f8c7","code_sha256_prefix":"f87671ec68c9f8c7","mcp_get_code":{"code_sha256":"f87671ec68c9f8c7"}}],"record_sha256":"0cce4da9a4f2c3ab9699dd6c93c21d1b2d4514b7b5e728b71cd11edbb1fb565d","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}