{"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/run-one","entry":"run_one","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":8,"n_papers_ran":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":1,"n_samples_fingerprinted":0,"n_places":9,"n_places_pointer_only":2,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":1,"unverified":8},"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","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":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"b758e104779e1167","mcp_get_code":{"code_sha256":"b758e104779e1167"}},{"arxiv_id":"2608.17070","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,"code_sha256_prefix":"b732abe0dd736158","mcp_get_code":{"code_sha256":"b732abe0dd736158"}},{"arxiv_id":"2607.28877","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,"code_sha256_prefix":"ffd8649c41d5c1dc","mcp_get_code":{"code_sha256":"ffd8649c41d5c1dc"}},{"arxiv_id":"2606.06302","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,"code_sha256_prefix":"2298f1ff53dfe660","mcp_get_code":{"code_sha256":"2298f1ff53dfe660"}},{"arxiv_id":"2606.06302","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,"code_sha256_prefix":"8fb5af6a89b21e9b","mcp_get_code":{"code_sha256":"8fb5af6a89b21e9b"}},{"arxiv_id":"2605.07093","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","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"df014752720a332b","mcp_get_code":{"code_sha256":"df014752720a332b"}},{"arxiv_id":"2604.20487","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,"code_sha256_prefix":"3e104c93479435e0","mcp_get_code":{"code_sha256":"3e104c93479435e0"}},{"arxiv_id":"2601.02578","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,"code_sha256_prefix":"1bc126c6c9079ee0","mcp_get_code":{"code_sha256":"1bc126c6c9079ee0"}},{"arxiv_id":"2006.04697","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,"code_sha256_prefix":"db39fcd7143b6163","mcp_get_code":{"code_sha256":"db39fcd7143b6163"}}]}