{"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/call-model","entry":"call_model","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":9,"n_papers_ran":7,"n_papers_ran_no_instrument_failure":6,"n_papers_ran_instrument_only":1,"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":11,"n_samples_ran":9,"n_samples_constructed":0,"n_samples_ran_checked":7,"n_samples_instrument":2,"n_samples_unverified":2,"n_samples_fingerprinted":0,"n_places":11,"n_places_pointer_only":5,"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":7,"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.06834","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2604-06834","title":"On the Step Length Confounding in LLM Reasoning Data Selection","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"wangbing1416/ASLEC","path":"data_syn_gptoss.py","file_url":"https://github.com/wangbing1416/ASLEC/blob/HEAD/data_syn_gptoss.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, wangbing1416/ASLEC when it was checked","code_sha256":"038676f8a60ba539","code_sha256_prefix":"038676f8a60ba539","mcp_get_code":{"code_sha256":"038676f8a60ba539"}},{"arxiv_id":"2604.06834","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2604-06834","title":"On the Step Length Confounding in LLM Reasoning Data Selection","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"wangbing1416/ASLEC","path":"data_syn_qwen3_32b.py","file_url":"https://github.com/wangbing1416/ASLEC/blob/HEAD/data_syn_qwen3_32b.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, wangbing1416/ASLEC when it was checked","code_sha256":"73a355b5b67882f5","code_sha256_prefix":"73a355b5b67882f5","mcp_get_code":{"code_sha256":"73a355b5b67882f5"}},{"arxiv_id":"2604.06834","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2604-06834","title":"On the Step Length Confounding in LLM Reasoning Data Selection","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"wangbing1416/ASLEC","path":"data_syn_qwq_32b.py","file_url":"https://github.com/wangbing1416/ASLEC/blob/HEAD/data_syn_qwq_32b.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, wangbing1416/ASLEC when it was checked","code_sha256":"dd79b2a8e07e5a49","code_sha256_prefix":"dd79b2a8e07e5a49","mcp_get_code":{"code_sha256":"dd79b2a8e07e5a49"}},{"arxiv_id":"2602.10715","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-10715","title":"Locomo-Plus: Beyond-Factual Cognitive Memory Evaluation Framework for LLM Agents","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"xjtuleeyf/Locomo-Plus","path":"evaluation_framework/task_eval/llm_as_judge.py","file_url":"https://github.com/xjtuleeyf/Locomo-Plus/blob/HEAD/evaluation_framework/task_eval/llm_as_judge.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, xjtuleeyf/Locomo-Plus when it was checked","code_sha256":"7e92aca251456902","code_sha256_prefix":"7e92aca251456902","mcp_get_code":{"code_sha256":"7e92aca251456902"}},{"arxiv_id":"2601.02578","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2601-02578","title":"DataParasite Enables Scalable and Repurposable Online Data Curation","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"mengysun/DataParasite","path":"src/data_parasite.py","file_url":"https://github.com/mengysun/DataParasite/blob/HEAD/src/data_parasite.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"85d3712a61fec456","code_sha256_prefix":"85d3712a61fec456","mcp_get_code":{"code_sha256":"85d3712a61fec456"}},{"arxiv_id":"2506.11763","arxiv_id_is_arxiv":true,"paper":"/paper/deepresearch-bench-a-comprehensive-benchmark","title":"DeepResearch Bench: A Comprehensive Benchmark for Deep Research Agents","date":"2025-06-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ayanami0730/deep_research_bench","path":"utils/api.py","file_url":"https://github.com/ayanami0730/deep_research_bench/blob/HEAD/utils/api.py","status":"unverified","verification_level":0,"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":"8c4b44ca751e88c7","code_sha256_prefix":"8c4b44ca751e88c7","mcp_get_code":{"code_sha256":"8c4b44ca751e88c7"}},{"arxiv_id":"2405.10548","arxiv_id_is_arxiv":true,"paper":"/paper/language-models-can-exploit-cross-task-in","title":"Language Models can Exploit Cross-Task In-context Learning for Data-Scarce Novel Tasks","date":"2024-05-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"C-anwoy/Cross-Task-ICL","path":"LLAMA-abalations-random.py","file_url":"https://github.com/C-anwoy/Cross-Task-ICL/blob/HEAD/LLAMA-abalations-random.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":"00eba4d4d2e34691","code_sha256_prefix":"00eba4d4d2e34691","mcp_get_code":{"code_sha256":"00eba4d4d2e34691"}},{"arxiv_id":"2402.16058","arxiv_id_is_arxiv":true,"paper":"/paper/say-more-with-less-understanding-prompt","title":"Say More with Less: Understanding Prompt Learning Behaviors through Gist Compression","date":"2024-02-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"openmatch/gist-coco","path":"src/inference/generalize/get_generalize_instruction_data.py","file_url":"https://github.com/openmatch/gist-coco/blob/HEAD/src/inference/generalize/get_generalize_instruction_data.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":"185759d79e24efed","code_sha256_prefix":"185759d79e24efed","mcp_get_code":{"code_sha256":"185759d79e24efed"}},{"arxiv_id":"2402.10811","arxiv_id_is_arxiv":true,"paper":"/paper/quantifying-the-persona-effect-in-llm","title":"Quantifying the Persona Effect in LLM Simulations","date":"2024-02-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cambridgeltl/persona_effect","path":"Dependency.py","file_url":"https://github.com/cambridgeltl/persona_effect/blob/HEAD/Dependency.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, cambridgeltl/persona_effect when it was checked","code_sha256":"04c4d6d4cb132a44","code_sha256_prefix":"04c4d6d4cb132a44","mcp_get_code":{"code_sha256":"04c4d6d4cb132a44"}},{"arxiv_id":"2305.18395","arxiv_id_is_arxiv":true,"paper":"/paper/knowledge-augmented-reasoning-distillation-1","title":"Knowledge-Augmented Reasoning Distillation for Small Language Models in Knowledge-Intensive Tasks","date":"2023-05-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nardien/kard","path":"generate_explanations.py","file_url":"https://github.com/nardien/kard/blob/HEAD/generate_explanations.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":"11adf9c948ae2a78","code_sha256_prefix":"11adf9c948ae2a78","mcp_get_code":{"code_sha256":"11adf9c948ae2a78"}},{"arxiv_id":"2212.10511","arxiv_id_is_arxiv":true,"paper":"/paper/when-not-to-trust-language-models","title":"When Not to Trust Language Models: Investigating Effectiveness of Parametric and Non-Parametric Memories","date":"2022-12-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"alextmallen/adaptive-retrieval","path":"run_model.py","file_url":"https://github.com/alextmallen/adaptive-retrieval/blob/HEAD/run_model.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":"098c21c81fd6e9e8","code_sha256_prefix":"098c21c81fd6e9e8","mcp_get_code":{"code_sha256":"098c21c81fd6e9e8"}}],"record_sha256":"60478f2982867b4dde09ff23979e5eb08a36a4f609b7efee24e9663f80596d8e","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}