{"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/fill-template","entry":"fill_template","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":8,"n_papers_ran":7,"n_papers_ran_no_instrument_failure":5,"n_papers_ran_instrument_only":2,"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":9,"n_samples_ran":7,"n_samples_constructed":0,"n_samples_ran_checked":5,"n_samples_instrument":2,"n_samples_unverified":2,"n_samples_fingerprinted":0,"n_places":10,"n_places_pointer_only":2,"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":2,"ran_fixture":0,"ran":5,"unverified":2},"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":"2512.21323","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2512-21323","title":"Parallel Token Prediction for Language Models","date":null,"month_inferred_from_arxiv_id":"2025-12","title_source":"syntology","repo":"mandt-lab/ptp","path":"src/ptp/cli/distill.py","file_url":"https://github.com/mandt-lab/ptp/blob/HEAD/src/ptp/cli/distill.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, mandt-lab/ptp when it was checked","code_sha256":"c875f40581fa6262","code_sha256_prefix":"c875f40581fa6262","mcp_get_code":{"code_sha256":"c875f40581fa6262"}},{"arxiv_id":"2410.02162","arxiv_id_is_arxiv":true,"paper":"/paper/planning-in-strawberry-fields-evaluating-and","title":"Planning in Strawberry Fields: Evaluating and Improving the Planning and Scheduling Capabilities of LRM o1","date":"2024-10-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"karthikv792/gpt-plan-benchmark","path":"plan-bench/utils/pddl_to_text.py","file_url":"https://github.com/karthikv792/gpt-plan-benchmark/blob/HEAD/plan-bench/utils/pddl_to_text.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":"8221b37cc068b36a","code_sha256_prefix":"8221b37cc068b36a","mcp_get_code":{"code_sha256":"8221b37cc068b36a"}},{"arxiv_id":"2410.01707","arxiv_id_is_arxiv":true,"paper":"/paper/interpretable-contrastive-monte-carlo-tree","title":"Interpretable Contrastive Monte Carlo Tree Search Reasoning","date":"2024-10-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zitian-gao/sc-mcts","path":"reasoners/bw_utils.py","file_url":"https://github.com/zitian-gao/sc-mcts/blob/HEAD/reasoners/bw_utils.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, zitian-gao/sc-mcts when it was checked","code_sha256":"d90672da961a8499","code_sha256_prefix":"d90672da961a8499","mcp_get_code":{"code_sha256":"d90672da961a8499"}},{"arxiv_id":"2305.17331","arxiv_id_is_arxiv":true,"paper":"/paper/augmentation-adapted-retriever-improves","title":"Augmentation-Adapted Retriever Improves Generalization of Language Models as Generic Plug-In","date":"2023-05-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"OpenMatch/Augmentation-Adapted-Retriever","path":"src/Retriever/utils.py","file_url":"https://github.com/OpenMatch/Augmentation-Adapted-Retriever/blob/HEAD/src/Retriever/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":"d6bb2b70f0c01eb0","code_sha256_prefix":"d6bb2b70f0c01eb0","mcp_get_code":{"code_sha256":"d6bb2b70f0c01eb0"}},{"arxiv_id":"2210.03094","arxiv_id_is_arxiv":true,"paper":"/paper/vima-general-robot-manipulation-with","title":"VIMA: General Robot Manipulation with Multimodal Prompts","date":"2022-10-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vimalabs/VIMABench","path":"vima_bench/tasks/utils/pybullet_utils.py","file_url":"https://github.com/vimalabs/VIMABench/blob/HEAD/vima_bench/tasks/utils/pybullet_utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"dd0a33da55a387fb","code_sha256_prefix":"dd0a33da55a387fb","mcp_get_code":{"code_sha256":"dd0a33da55a387fb"}},{"arxiv_id":"2110.03331","arxiv_id_is_arxiv":true,"paper":"/paper/cleva-compass-a-continual-learning-evaluation","title":"CLEVA-Compass: A Continual Learning EValuation Assessment Compass to Promote Research Transparency and Comparability","date":"2021-10-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ml-research/CLEVA-Compass","path":"create_compass.py","file_url":"https://github.com/ml-research/CLEVA-Compass/blob/HEAD/create_compass.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"7893ea67beb14fee","code_sha256_prefix":"7893ea67beb14fee","mcp_get_code":{"code_sha256":"7893ea67beb14fee"}},{"arxiv_id":"2006.03806","arxiv_id_is_arxiv":true,"paper":"/paper/leveraging-the-feature-distribution-in","title":"Leveraging the Feature Distribution in Transfer-based Few-Shot Learning","date":"2020-06-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mbonto/fewshot_neuroimaging_classification","path":"MAML_plus_plus/script_generation_tools/generate_scripts.py","file_url":"https://github.com/mbonto/fewshot_neuroimaging_classification/blob/HEAD/MAML_plus_plus/script_generation_tools/generate_scripts.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":"d25adfe464700ae6","code_sha256_prefix":"d25adfe464700ae6","mcp_get_code":{"code_sha256":"d25adfe464700ae6"}},{"arxiv_id":"2006.03806","arxiv_id_is_arxiv":true,"paper":"/paper/leveraging-the-feature-distribution-in","title":"Leveraging the Feature Distribution in Transfer-based Few-Shot Learning","date":"2020-06-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mbonto/fewshot_neuroimaging_classification","path":"MAML_plus_plus/script_generation_tools/generate_configs.py","file_url":"https://github.com/mbonto/fewshot_neuroimaging_classification/blob/HEAD/MAML_plus_plus/script_generation_tools/generate_configs.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"6ef99887903cd30a","code_sha256_prefix":"6ef99887903cd30a","mcp_get_code":{"code_sha256":"6ef99887903cd30a"}},{"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":"script_generation_tools/generate_scripts.py","file_url":"https://github.com/AntreasAntoniou/Learning_to_Learn_via_Self-Critique/blob/HEAD/script_generation_tools/generate_scripts.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":"d25adfe464700ae6","code_sha256_prefix":"d25adfe464700ae6","mcp_get_code":{"code_sha256":"d25adfe464700ae6"}},{"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":"script_generation_tools/generate_configs.py","file_url":"https://github.com/AntreasAntoniou/Learning_to_Learn_via_Self-Critique/blob/HEAD/script_generation_tools/generate_configs.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":"e842ea037f1a6ac1","code_sha256_prefix":"e842ea037f1a6ac1","mcp_get_code":{"code_sha256":"e842ea037f1a6ac1"}}],"record_sha256":"75f5daa4624eafc3af5f605780c7e72c9742dec192fd08c1fa99f00f31a3bfd9","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}