{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/code/load-api-key","entry":"load_api_key","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-09-24T18:15:14+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.","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; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":6,"n_papers_ran":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":6,"n_samples_ran":2,"n_samples_fingerprinted":0,"n_places":6,"n_places_pointer_only":3,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":2,"unverified":4},"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":"2505.17612","paper":"/paper/distilling-llm-agent-into-small-models-with","title":"Distilling LLM Agent into Small Models with Retrieval and Code Tools","date":"2025-05-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Nardien/agent-distillation","path":"exps_research/unified_framework/models.py","file_url":"https://github.com/Nardien/agent-distillation/blob/HEAD/exps_research/unified_framework/models.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"275569501ce6d570","mcp_get_code":{"code_sha256":"275569501ce6d570"}},{"arxiv_id":"2410.19818","paper":"/paper/unimts-unified-pre-training-for-motion-time","title":"UniMTS: Unified Pre-training for Motion Time Series","date":"2024-10-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xiyuanzh/unimts","path":"text_aug.py","file_url":"https://github.com/xiyuanzh/unimts/blob/HEAD/text_aug.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"c1bf9f2229ec2d0e","mcp_get_code":{"code_sha256":"c1bf9f2229ec2d0e"}},{"arxiv_id":"2410.16251","paper":"/paper/can-knowledge-editing-really-correct","title":"Can Knowledge Editing Really Correct Hallucinations?","date":"2024-10-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"llm-editing/HalluEditBench","path":"code/util.py","file_url":"https://github.com/llm-editing/HalluEditBench/blob/HEAD/code/util.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"09477d8e8f62fe1c","mcp_get_code":{"code_sha256":"09477d8e8f62fe1c"}},{"arxiv_id":"2407.20224","paper":"/paper/can-editing-llms-inject-harm","title":"Can Editing LLMs Inject Harm?","date":"2024-07-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"llm-editing/editing-attack","path":"code/editor_new_eval.py","file_url":"https://github.com/llm-editing/editing-attack/blob/HEAD/code/editor_new_eval.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"023650f8cf944654","mcp_get_code":{"code_sha256":"023650f8cf944654"}},{"arxiv_id":"2404.18081","paper":"/paper/composerx-multi-agent-symbolic-music","title":"ComposerX: Multi-Agent Symbolic Music Composition with LLMs","date":"2024-04-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lllindsey0615/composerx","path":"music_generation/Single_agent.py","file_url":"https://github.com/lllindsey0615/composerx/blob/HEAD/music_generation/Single_agent.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"8211d66cfeb14d3d","mcp_get_code":{"code_sha256":"8211d66cfeb14d3d"}},{"arxiv_id":"2309.08960","paper":"/paper/odsum-new-benchmarks-for-open-domain-multi","title":"ODSum: New Benchmarks for Open Domain Multi-Document Summarization","date":"2023-09-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yale-nlp/odsum","path":"code/ablation/refine.py","file_url":"https://github.com/yale-nlp/odsum/blob/HEAD/code/ablation/refine.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"564228cc0d894ea5","mcp_get_code":{"code_sha256":"564228cc0d894ea5"}}]}