{"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/compare-answers","entry":"compare_answers","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":7,"n_papers_ran_no_instrument_failure":7,"n_papers_ran_instrument_only":0,"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":8,"n_samples_ran":7,"n_samples_constructed":0,"n_samples_ran_checked":7,"n_samples_instrument":0,"n_samples_unverified":1,"n_samples_fingerprinted":2,"n_places":9,"n_places_pointer_only":1,"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":1,"ran_violates":1,"ran_draft_wrong":0,"ran_fixture":0,"ran":5,"unverified":1},"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":"2606.29424","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-29424","title":"ENTROROUTER: Learning Efficient Model Routing via Entropy Regulation","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"huggingface/Math-Verify","path":"evaluate_model_outputs.py","file_url":"https://github.com/huggingface/Math-Verify/blob/HEAD/evaluate_model_outputs.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"662b87687f2f200a","code_sha256_prefix":"662b87687f2f200a","mcp_get_code":{"code_sha256":"662b87687f2f200a"}},{"arxiv_id":"2505.20347","arxiv_id_is_arxiv":true,"paper":"/paper/serl-self-play-reinforcement-learning-for","title":"SeRL: Self-Play Reinforcement Learning for Large Language Models with Limited Data","date":"2025-05-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wantbook-book/serl","path":"evaluation/Math-Benchmarks/evaluate_outputs.py","file_url":"https://github.com/wantbook-book/serl/blob/HEAD/evaluation/Math-Benchmarks/evaluate_outputs.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"662b87687f2f200a","code_sha256_prefix":"662b87687f2f200a","mcp_get_code":{"code_sha256":"662b87687f2f200a"}},{"arxiv_id":"2502.20122","arxiv_id_is_arxiv":true,"paper":"/paper/self-training-elicits-concise-reasoning-in","title":"Self-Training Elicits Concise Reasoning in Large Language Models","date":"2025-02-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tergelmunkhbat/concise-reasoning","path":"src/preprocess.py","file_url":"https://github.com/tergelmunkhbat/concise-reasoning/blob/HEAD/src/preprocess.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":"46e84dfabd0695d0","code_sha256_prefix":"46e84dfabd0695d0","mcp_get_code":{"code_sha256":"46e84dfabd0695d0"}},{"arxiv_id":"2410.10799","arxiv_id_is_arxiv":true,"paper":"/paper/towards-foundation-models-for-3d-vision-how","title":"Towards Foundation Models for 3D Vision: How Close Are We?","date":"2024-10-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"princeton-vl/uniqa-3d","path":"Human_Study/clevr_vqa/utils.py","file_url":"https://github.com/princeton-vl/uniqa-3d/blob/HEAD/Human_Study/clevr_vqa/utils.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"c3c486bf7368e6dd","code_sha256_prefix":"c3c486bf7368e6dd","mcp_get_code":{"code_sha256":"c3c486bf7368e6dd"}},{"arxiv_id":"2406.10149","arxiv_id_is_arxiv":true,"paper":"/paper/babilong-testing-the-limits-of-llms-with-long","title":"BABILong: Testing the Limits of LLMs with Long Context Reasoning-in-a-Haystack","date":"2024-06-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"booydar/babilong","path":"babilong/babilong_utils.py","file_url":"https://github.com/booydar/babilong/blob/HEAD/babilong/babilong_utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"13c862882ed08796","code_sha256_prefix":"13c862882ed08796","mcp_get_code":{"code_sha256":"13c862882ed08796"}},{"arxiv_id":"2406.10149","arxiv_id_is_arxiv":true,"paper":"/paper/babilong-testing-the-limits-of-llms-with-long","title":"BABILong: Testing the Limits of LLMs with Long Context Reasoning-in-a-Haystack","date":"2024-06-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"booydar/babilong","path":"babilong/metrics.py","file_url":"https://github.com/booydar/babilong/blob/HEAD/babilong/metrics.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":"eebaceb4246b1413","code_sha256_prefix":"eebaceb4246b1413","mcp_get_code":{"code_sha256":"eebaceb4246b1413"}},{"arxiv_id":"2311.09603","arxiv_id_is_arxiv":true,"paper":"/paper/score-a-framework-for-self-contradictory","title":"Self-Contradictory Reasoning Evaluation and Detection","date":"2023-11-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"uscnlp-lime/Self-Contradictory","path":"auto_detection/get_metrics.py","file_url":"https://github.com/uscnlp-lime/Self-Contradictory/blob/HEAD/auto_detection/get_metrics.py","status":"ran","verification_level":1,"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, uscnlp-lime/Self-Contradictory when it was checked","code_sha256":"e31f2e11cd735813","code_sha256_prefix":"e31f2e11cd735813","mcp_get_code":{"code_sha256":"e31f2e11cd735813"}},{"arxiv_id":"2302.13814","arxiv_id_is_arxiv":true,"paper":"/paper/an-independent-evaluation-of-chatgpt-on","title":"An Independent Evaluation of ChatGPT on Mathematical Word Problems (MWP)","date":"2023-02-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lab-v2/chatgpt_mwp_eval","path":"data_with_implementation/source/JSONGPT.py","file_url":"https://github.com/lab-v2/chatgpt_mwp_eval/blob/HEAD/data_with_implementation/source/JSONGPT.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"CC0-1.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"7392bcd76e77496b","code_sha256_prefix":"7392bcd76e77496b","mcp_get_code":{"code_sha256":"7392bcd76e77496b"}},{"arxiv_id":"1804.07656","arxiv_id_is_arxiv":true,"paper":"/paper/acquisition-of-phrase-correspondences-using","title":"Acquisition of Phrase Correspondences using Natural Deduction Proofs","date":"2018-04-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mynlp/ccg2lambda","path":"en/report_results.py","file_url":"https://github.com/mynlp/ccg2lambda/blob/HEAD/en/report_results.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":"a348a12b155cc698","code_sha256_prefix":"a348a12b155cc698","mcp_get_code":{"code_sha256":"a348a12b155cc698"}}],"record_sha256":"e59dd93e037278255692f3e64e4f1e5af06633c8c0b3289ab5f67bfabe4e377e","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}