{"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/collect-results","entry":"collect_results","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":4,"n_papers_ran_no_instrument_failure":3,"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":6,"n_samples_ran":4,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":1,"n_samples_unverified":2,"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":1,"ran_fixture":0,"ran":3,"unverified":2},"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":"2608.30768","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2608-30768","title":"CORAL: A Benchmark for Structure-aware and Brain-wide Neuron Reconstruction in Light Microscopy","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"yang-ze-kang/CORAL","path":"calculate_metrics.py","file_url":"https://github.com/yang-ze-kang/CORAL/blob/HEAD/calculate_metrics.py","status":"ran","verification_level":1,"contract_check":null,"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, yang-ze-kang/CORAL (NOASSERTION)","code_sha256":"f1604f2bf6b03522","code_sha256_prefix":"f1604f2bf6b03522","mcp_get_code":{"code_sha256":"f1604f2bf6b03522"}},{"arxiv_id":"2605.11388","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-11388","title":"Deep Reasoning in General Purpose Agents via Structured Meta-Cognition","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"DeanLight/dolores","path":"analysis/dr_analysis.py","file_url":"https://github.com/DeanLight/dolores/blob/HEAD/analysis/dr_analysis.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":"cfeb5ccc75ffe9f9","code_sha256_prefix":"cfeb5ccc75ffe9f9","mcp_get_code":{"code_sha256":"cfeb5ccc75ffe9f9"}},{"arxiv_id":"2505.21866","arxiv_id_is_arxiv":true,"paper":"/paper/csi-bench-a-large-scale-in-the-wild-dataset","title":"CSI-Bench: A Large-Scale In-the-Wild Dataset for Multi-task WiFi Sensing","date":"2025-05-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Jenny-Zhu/CSI-Bench-Real-WiFi-Sensing-Benchmark","path":"result_analysis/all_result_summary.py","file_url":"https://github.com/Jenny-Zhu/CSI-Bench-Real-WiFi-Sensing-Benchmark/blob/HEAD/result_analysis/all_result_summary.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":"ba3123c0e55663e7","code_sha256_prefix":"ba3123c0e55663e7","mcp_get_code":{"code_sha256":"ba3123c0e55663e7"}},{"arxiv_id":"2406.12624","arxiv_id_is_arxiv":true,"paper":"/paper/judging-the-judges-evaluating-alignment-and","title":"Judging the Judges: Evaluating Alignment and Vulnerabilities in LLMs-as-Judges","date":"2024-06-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"UMass-Meta-LLM-Eval/llm_eval","path":"src/llm_eval/analysis/import_data.py","file_url":"https://github.com/UMass-Meta-LLM-Eval/llm_eval/blob/HEAD/src/llm_eval/analysis/import_data.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, UMass-Meta-LLM-Eval/llm_eval when it was checked","code_sha256":"c4cd0f2b59806fd9","code_sha256_prefix":"c4cd0f2b59806fd9","mcp_get_code":{"code_sha256":"c4cd0f2b59806fd9"}},{"arxiv_id":"2401.17044","arxiv_id_is_arxiv":true,"paper":"/paper/scalable-mechanism-design-for-multi-agent","title":"Scalable Mechanism Design for Multi-Agent Path Finding","date":"2024-01-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lunjohnzhang/MAPF-Mechanism","path":"analysis/plot_stats_vs_n_agents.py","file_url":"https://github.com/lunjohnzhang/MAPF-Mechanism/blob/HEAD/analysis/plot_stats_vs_n_agents.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, lunjohnzhang/MAPF-Mechanism when it was checked","code_sha256":"7aaaa9025161e745","code_sha256_prefix":"7aaaa9025161e745","mcp_get_code":{"code_sha256":"7aaaa9025161e745"}},{"arxiv_id":"2311.07633","arxiv_id_is_arxiv":true,"paper":"/paper/rethinking-and-benchmarking-predict-then","title":"Benchmarking PtO and PnO Methods in the Predictive Combinatorial Optimization Regime","date":"2023-11-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Thinklab-SJTU/PredictiveCO-Benchmark","path":"rethink_exp/collect_results.py","file_url":"https://github.com/Thinklab-SJTU/PredictiveCO-Benchmark/blob/HEAD/rethink_exp/collect_results.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":"dde3bb6970d2d582","code_sha256_prefix":"dde3bb6970d2d582","mcp_get_code":{"code_sha256":"dde3bb6970d2d582"}}],"record_sha256":"857fda22300a1d5a60f7387d2f0b29bbe7b1b64cf0f01e905a2e41c4d3cb6741","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}