{"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/sha256-bytes","entry":"sha256_bytes","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":0,"n_papers_ran_instrument_only":6,"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":4,"n_samples_ran":4,"n_samples_constructed":0,"n_samples_ran_checked":0,"n_samples_instrument":4,"n_samples_unverified":0,"n_samples_fingerprinted":0,"n_places":6,"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":4,"ran_fixture":0,"ran":0,"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":"2609.02548","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2609-02548","title":"Learn from Whoever Is Right: Answer-Verified Multi-Teacher Distillation for Multi-Domain LLMs","date":null,"month_inferred_from_arxiv_id":"2026-09","title_source":"syntology","repo":"hexixiang/MT-SDPO","path":"evaluation/evaluate.py","file_url":"https://github.com/hexixiang/MT-SDPO/blob/HEAD/evaluation/evaluate.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"f3f472b0143c5adf","code_sha256_prefix":"f3f472b0143c5adf","mcp_get_code":{"code_sha256":"f3f472b0143c5adf"}},{"arxiv_id":"2606.00579","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-00579","title":"Sandboxed Coding Agents are Competitive Omni-modal Task Solvers","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"Dongping-Chen/OmniCoding","path":"src/omnicoding/benchmarks/subsets.py","file_url":"https://github.com/Dongping-Chen/OmniCoding/blob/HEAD/src/omnicoding/benchmarks/subsets.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, Dongping-Chen/OmniCoding (NOASSERTION)","code_sha256":"09abe599f437dda7","code_sha256_prefix":"09abe599f437dda7","mcp_get_code":{"code_sha256":"09abe599f437dda7"}},{"arxiv_id":"2603.15020","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2603-15020","title":"MER-Bench: A Comprehensive Benchmark for Multimodal Meme Reappraisal","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"one-seven17/MER-Bench","path":"judge.py","file_url":"https://github.com/one-seven17/MER-Bench/blob/HEAD/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, one-seven17/MER-Bench when it was checked","code_sha256":"b3599636629687ea","code_sha256_prefix":"b3599636629687ea","mcp_get_code":{"code_sha256":"b3599636629687ea"}},{"arxiv_id":"2603.05764","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2603-05764","title":"TML-bench: Benchmark for Data Science Agents on Tabular ML Tasks","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"MykolaPinchuk/TML-bench","path":"orchestrator/provenance.py","file_url":"https://github.com/MykolaPinchuk/TML-bench/blob/HEAD/orchestrator/provenance.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"7f5ffed1f98ca2b1","code_sha256_prefix":"7f5ffed1f98ca2b1","mcp_get_code":{"code_sha256":"7f5ffed1f98ca2b1"}},{"arxiv_id":"2505.23281","arxiv_id_is_arxiv":true,"paper":"/paper/matharena-evaluating-llms-on-uncontaminated","title":"MathArena: Evaluating LLMs on Uncontaminated Math Competitions","date":"2025-05-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"eth-sri/matharena","path":"src/matharena/arxivmath_source.py","file_url":"https://github.com/eth-sri/matharena/blob/HEAD/src/matharena/arxivmath_source.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"f3f472b0143c5adf","code_sha256_prefix":"f3f472b0143c5adf","mcp_get_code":{"code_sha256":"f3f472b0143c5adf"}},{"arxiv_id":"2505.14683","arxiv_id_is_arxiv":true,"paper":"/paper/emerging-properties-in-unified-multimodal","title":"Emerging Properties in Unified Multimodal Pretraining","date":"2025-05-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"neverbiasu/ComfyUI-BAGEL","path":"modeling/bagel/converted_format.py","file_url":"https://github.com/neverbiasu/ComfyUI-BAGEL/blob/HEAD/modeling/bagel/converted_format.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"7f5ffed1f98ca2b1","code_sha256_prefix":"7f5ffed1f98ca2b1","mcp_get_code":{"code_sha256":"7f5ffed1f98ca2b1"}}],"record_sha256":"f40bbd9b21352ac95e872270cc999d805e518d2c539bbd6e720b428cda6c644c","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}