{"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-api-key","entry":"load_api_key","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":6,"n_papers_ran":6,"n_papers_ran_no_instrument_failure":3,"n_papers_ran_instrument_only":3,"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":6,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":3,"n_samples_unverified":0,"n_samples_fingerprinted":0,"n_places":6,"n_places_pointer_only":3,"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":3,"ran_fixture":0,"ran":3,"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":"2505.17612","arxiv_id_is_arxiv":true,"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":"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":"275569501ce6d570","code_sha256_prefix":"275569501ce6d570","mcp_get_code":{"code_sha256":"275569501ce6d570"}},{"arxiv_id":"2410.19818","arxiv_id_is_arxiv":true,"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":"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, xiyuanzh/unimts when it was checked","code_sha256":"c1bf9f2229ec2d0e","code_sha256_prefix":"c1bf9f2229ec2d0e","mcp_get_code":{"code_sha256":"c1bf9f2229ec2d0e"}},{"arxiv_id":"2410.16251","arxiv_id_is_arxiv":true,"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":"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, llm-editing/HalluEditBench when it was checked","code_sha256":"09477d8e8f62fe1c","code_sha256_prefix":"09477d8e8f62fe1c","mcp_get_code":{"code_sha256":"09477d8e8f62fe1c"}},{"arxiv_id":"2407.20224","arxiv_id_is_arxiv":true,"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":"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":"023650f8cf944654","code_sha256_prefix":"023650f8cf944654","mcp_get_code":{"code_sha256":"023650f8cf944654"}},{"arxiv_id":"2404.18081","arxiv_id_is_arxiv":true,"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_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, lllindsey0615/composerx when it was checked","code_sha256":"8211d66cfeb14d3d","code_sha256_prefix":"8211d66cfeb14d3d","mcp_get_code":{"code_sha256":"8211d66cfeb14d3d"}},{"arxiv_id":"2309.08960","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"564228cc0d894ea5","code_sha256_prefix":"564228cc0d894ea5","mcp_get_code":{"code_sha256":"564228cc0d894ea5"}}],"record_sha256":"4db1b56beb368dedf38effae5c55102ff489583ca6b1fdb56d5c7a20957b7b60","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}