{"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-template","entry":"load_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":6,"n_papers_ran_no_instrument_failure":2,"n_papers_ran_instrument_only":4,"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":8,"n_samples_ran":6,"n_samples_constructed":0,"n_samples_ran_checked":2,"n_samples_instrument":4,"n_samples_unverified":2,"n_samples_fingerprinted":0,"n_places":10,"n_places_pointer_only":0,"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":4,"ran_fixture":0,"ran":2,"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":"2604.27599","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2604-27599","title":"One Pass, Any Order: Position-Invariant Listwise Reranking for LLM-Based Recommendation","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"ejbito/InvariRank","path":"invarirank/prompts.py","file_url":"https://github.com/ejbito/InvariRank/blob/HEAD/invarirank/prompts.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":"235d0ccc9ee9dd9b","code_sha256_prefix":"235d0ccc9ee9dd9b","mcp_get_code":{"code_sha256":"235d0ccc9ee9dd9b"}},{"arxiv_id":"2507.00828","arxiv_id_is_arxiv":true,"paper":null,"title":"arXiv:2507.00828","date":null,"month_inferred_from_arxiv_id":"2025-07","title_source":null,"repo":"ahoho/proxann","path":"src/proxann/llm_annotations/utils.py","file_url":"https://github.com/ahoho/proxann/blob/HEAD/src/proxann/llm_annotations/utils.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":"793ae48e8d154071","code_sha256_prefix":"793ae48e8d154071","mcp_get_code":{"code_sha256":"793ae48e8d154071"}},{"arxiv_id":"2411.06839","arxiv_id_is_arxiv":true,"paper":"/paper/llm-neo-parameter-efficient-knowledge","title":"LLM-Neo: Parameter Efficient Knowledge Distillation for Large Language Models","date":"2024-11-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yang3121099/LLM-Neo","path":"script_Neo.py","file_url":"https://github.com/yang3121099/LLM-Neo/blob/HEAD/script_Neo.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"db48bb761b48a5cc","code_sha256_prefix":"db48bb761b48a5cc","mcp_get_code":{"code_sha256":"db48bb761b48a5cc"}},{"arxiv_id":"2403.13372","arxiv_id_is_arxiv":true,"paper":"/paper/llamafactory-unified-efficient-fine-tuning-of","title":"LlamaFactory: Unified Efficient Fine-Tuning of 100+ Language Models","date":"2024-03-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Rcrossmeister/RLQG","path":"dataset/utils/loader.py","file_url":"https://github.com/Rcrossmeister/RLQG/blob/HEAD/dataset/utils/loader.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":"0c5d5a49e28081e7","code_sha256_prefix":"0c5d5a49e28081e7","mcp_get_code":{"code_sha256":"0c5d5a49e28081e7"}},{"arxiv_id":"2306.12509","arxiv_id_is_arxiv":true,"paper":"/paper/deep-language-networks-joint-prompt-training","title":"Joint Prompt Optimization of Stacked LLMs using Variational Inference","date":"2023-06-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"microsoft/deep-language-networks","path":"dln/vi/model.py","file_url":"https://github.com/microsoft/deep-language-networks/blob/HEAD/dln/vi/model.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":"d843b5eea08b3a77","code_sha256_prefix":"d843b5eea08b3a77","mcp_get_code":{"code_sha256":"d843b5eea08b3a77"}},{"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":"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":"27fabd65989ead1f","code_sha256_prefix":"27fabd65989ead1f","mcp_get_code":{"code_sha256":"27fabd65989ead1f"}},{"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":"4a41646d1d2da5a6","code_sha256_prefix":"4a41646d1d2da5a6","mcp_get_code":{"code_sha256":"4a41646d1d2da5a6"}},{"arxiv_id":"2002.12212","arxiv_id_is_arxiv":true,"paper":"/paper/total3dunderstanding-joint-layout-object-pose","title":"Total3DUnderstanding: Joint Layout, Object Pose and Mesh Reconstruction for Indoor Scenes from a Single Image","date":"2020-02-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yinyunie/Total3DUnderstanding","path":"net_utils/misc.py","file_url":"https://github.com/yinyunie/Total3DUnderstanding/blob/HEAD/net_utils/misc.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":"23eae901d43d45b9","code_sha256_prefix":"23eae901d43d45b9","mcp_get_code":{"code_sha256":"23eae901d43d45b9"}},{"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":"27fabd65989ead1f","code_sha256_prefix":"27fabd65989ead1f","mcp_get_code":{"code_sha256":"27fabd65989ead1f"}},{"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":"4a41646d1d2da5a6","code_sha256_prefix":"4a41646d1d2da5a6","mcp_get_code":{"code_sha256":"4a41646d1d2da5a6"}}],"record_sha256":"b6ac5af4c1dd834584e4a6d70d497849e04bd8ec2dbbf89a573e6d8e0866eaa0","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}