{"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/run-one","entry":"run_one","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":2,"n_papers_ran_no_instrument_failure":1,"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":9,"n_samples_ran":2,"n_samples_constructed":0,"n_samples_ran_checked":1,"n_samples_instrument":1,"n_samples_unverified":7,"n_samples_fingerprinted":0,"n_places":9,"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":1,"ran_fixture":0,"ran":1,"unverified":7},"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":"2609.03109","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2609-03109","title":"SLIDEFORGE: An LLM Agent for Controllable Editing of Slides as Structured Artifacts","date":null,"month_inferred_from_arxiv_id":"2026-09","title_source":"syntology","repo":"UIUC-MONET/SLIDEFORGE","path":"restyle/run_pipeline.py","file_url":"https://github.com/UIUC-MONET/SLIDEFORGE/blob/HEAD/restyle/run_pipeline.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":"b758e104779e1167","code_sha256_prefix":"b758e104779e1167","mcp_get_code":{"code_sha256":"b758e104779e1167"}},{"arxiv_id":"2608.17070","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2608-17070","title":"Certified but Private: Scalable Zero-Knowledge Proofs for Neural Network Guarantees","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"youweizhong/PANDA","path":"evaluation/run_float_crown.py","file_url":"https://github.com/youweizhong/PANDA/blob/HEAD/evaluation/run_float_crown.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":"b732abe0dd736158","code_sha256_prefix":"b732abe0dd736158","mcp_get_code":{"code_sha256":"b732abe0dd736158"}},{"arxiv_id":"2607.28877","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2607-28877","title":"Open-Source LLM-Driven Formal Verification: A Multi-Agent Pipeline for RTL Repair","date":null,"month_inferred_from_arxiv_id":"2026-07","title_source":"syntology","repo":"trunghafromvietnam/rtl-repair-framework","path":"run_n_times.py","file_url":"https://github.com/trunghafromvietnam/rtl-repair-framework/blob/HEAD/run_n_times.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":"ffd8649c41d5c1dc","code_sha256_prefix":"ffd8649c41d5c1dc","mcp_get_code":{"code_sha256":"ffd8649c41d5c1dc"}},{"arxiv_id":"2606.06302","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-06302","title":"Tangram: Unlocking Non-Uniform KV Cache Compression for Efficient Multi-turn LLM Serving","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"aiha-lab/TANGRAM","path":"benchmarks/tangram/preemption_overhead/benchmark.py","file_url":"https://github.com/aiha-lab/TANGRAM/blob/HEAD/benchmarks/tangram/preemption_overhead/benchmark.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":"2298f1ff53dfe660","code_sha256_prefix":"2298f1ff53dfe660","mcp_get_code":{"code_sha256":"2298f1ff53dfe660"}},{"arxiv_id":"2606.06302","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-06302","title":"Tangram: Unlocking Non-Uniform KV Cache Compression for Efficient Multi-turn LLM Serving","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"aiha-lab/TANGRAM","path":"benchmarks/tangram/speedup/speedup_benchmark.py","file_url":"https://github.com/aiha-lab/TANGRAM/blob/HEAD/benchmarks/tangram/speedup/speedup_benchmark.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":"8fb5af6a89b21e9b","code_sha256_prefix":"8fb5af6a89b21e9b","mcp_get_code":{"code_sha256":"8fb5af6a89b21e9b"}},{"arxiv_id":"2605.07093","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-07093","title":"The Translation Tax Is Not a Scalar: A Counterfactual Audit of English-Source Cue Inheritance in Chinese Multilingual Benchmarks","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"chi-mi-rvard/translation-tax-supplement","path":"reproduce_all.py","file_url":"https://github.com/chi-mi-rvard/translation-tax-supplement/blob/HEAD/reproduce_all.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, chi-mi-rvard/translation-tax-supplement (NOASSERTION)","code_sha256":"df014752720a332b","code_sha256_prefix":"df014752720a332b","mcp_get_code":{"code_sha256":"df014752720a332b"}},{"arxiv_id":"2604.20487","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2604-20487","title":"Knowledge Capsules: Structured Nonparametric Memory Units for LLMs","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"jubin75/KVI","path":"experiments/exp02_hallucination/code/auto_truthfulqa_kvi_iterate.py","file_url":"https://github.com/jubin75/KVI/blob/HEAD/experiments/exp02_hallucination/code/auto_truthfulqa_kvi_iterate.py","status":"unverified","verification_level":0,"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, jubin75/KVI when it was checked","code_sha256":"3e104c93479435e0","code_sha256_prefix":"3e104c93479435e0","mcp_get_code":{"code_sha256":"3e104c93479435e0"}},{"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":"1bc126c6c9079ee0","code_sha256_prefix":"1bc126c6c9079ee0","mcp_get_code":{"code_sha256":"1bc126c6c9079ee0"}},{"arxiv_id":"2006.04697","arxiv_id_is_arxiv":true,"paper":"/paper/supervised-whole-dag-causal-discovery","title":"Supervised Whole DAG Causal Discovery","date":"2020-06-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lihebi/DAG-EQ","path":"python/baseline_tetrad.py","file_url":"https://github.com/lihebi/DAG-EQ/blob/HEAD/python/baseline_tetrad.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":"db39fcd7143b6163","code_sha256_prefix":"db39fcd7143b6163","mcp_get_code":{"code_sha256":"db39fcd7143b6163"}}],"record_sha256":"ecb3f4d2a3d2043455b54d44541de395a9975dab53b86e8b458a09b07b889c68","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}