{"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/is-equiv","entry":"is_equiv","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":22,"n_papers_ran":21,"n_papers_ran_no_instrument_failure":21,"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":9,"n_samples_ran":8,"n_samples_constructed":0,"n_samples_ran_checked":8,"n_samples_instrument":0,"n_samples_unverified":1,"n_samples_fingerprinted":1,"n_places":22,"n_places_pointer_only":9,"n_places_pointer_only_link_open":2,"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":5,"ran_draft_wrong":0,"ran_fixture":0,"ran":3,"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":"2609.00787","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2609-00787","title":"StudyBench: Can Self-Evolution Squeeze Textbooks for Olympiad Capability?","date":null,"month_inferred_from_arxiv_id":"2026-09","title_source":"syntology","repo":"thunlp/StudyBench","path":"eval/math_equivalence.py","file_url":"https://github.com/thunlp/StudyBench/blob/HEAD/eval/math_equivalence.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, thunlp/StudyBench when it was checked","code_sha256":"20063c675d638a77","code_sha256_prefix":"20063c675d638a77","mcp_get_code":{"code_sha256":"20063c675d638a77"}},{"arxiv_id":"2606.18195","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-18195","title":"Learning from the Self-future: On-policy Self-distillation for dLLMs","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"xingzhejun/d-OPSD","path":"d-opsd/math500_utils.py","file_url":"https://github.com/xingzhejun/d-OPSD/blob/HEAD/d-opsd/math500_utils.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","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, xingzhejun/d-OPSD when it was checked","code_sha256":"e88118a107b326d1","code_sha256_prefix":"e88118a107b326d1","mcp_get_code":{"code_sha256":"e88118a107b326d1"}},{"arxiv_id":"2605.29398","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-29398","title":"GDSD: Reinforcement Learning as Guided Denoiser Self-Distillation for Diffusion Language Models","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"GaryBall/GDSD","path":"gdsd/utils/math500_utils.py","file_url":"https://github.com/GaryBall/GDSD/blob/HEAD/gdsd/utils/math500_utils.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"b2845803d938cb26","code_sha256_prefix":"b2845803d938cb26","mcp_get_code":{"code_sha256":"b2845803d938cb26"}},{"arxiv_id":"2604.23626","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2604-23626","title":"GraphPlanner: Graph Memory-Augmented Agentic Routing for Multi-Agent LLMs","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"ulab-uiuc/GraphPlanner","path":"router_planner/shared/math_eval.py","file_url":"https://github.com/ulab-uiuc/GraphPlanner/blob/HEAD/router_planner/shared/math_eval.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","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, ulab-uiuc/GraphPlanner when it was checked","code_sha256":"34ed87891e855695","code_sha256_prefix":"34ed87891e855695","mcp_get_code":{"code_sha256":"34ed87891e855695"}},{"arxiv_id":"2604.13552","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2604-13552","title":"Training-Free Test-Time Contrastive Learning for Large Language Models","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"KevinSCUTer/TF-TTCL","path":"core/source/compare/selection_kernel.py","file_url":"https://github.com/KevinSCUTer/TF-TTCL/blob/HEAD/core/source/compare/selection_kernel.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"5015a8c78052f4f0","code_sha256_prefix":"5015a8c78052f4f0","mcp_get_code":{"code_sha256":"5015a8c78052f4f0"}},{"arxiv_id":"2602.06462","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-06462","title":"Diffusion-State Policy Optimization for Masked Diffusion Language Models","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"dllm-reasoning/d1","path":"diffu-grpo/math500_utils.py","file_url":"https://github.com/dllm-reasoning/d1/blob/HEAD/diffu-grpo/math500_utils.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from xingzhejun/d-OPSD, and GitHub detected no licence in that repository when it was checked","code_sha256":"e88118a107b326d1","code_sha256_prefix":"e88118a107b326d1","mcp_get_code":{"code_sha256":"e88118a107b326d1"}},{"arxiv_id":"2511.13223","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2511-13223","title":"TokenSqueeze: Performance-Preserving Compression for Reasoning LLMs","date":null,"month_inferred_from_arxiv_id":"2025-11","title_source":"syntology","repo":"zhangyx1122/TokenSqueeze","path":"utils/math500_verify.py","file_url":"https://github.com/zhangyx1122/TokenSqueeze/blob/HEAD/utils/math500_verify.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","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, zhangyx1122/TokenSqueeze when it was checked","code_sha256":"e88118a107b326d1","code_sha256_prefix":"e88118a107b326d1","mcp_get_code":{"code_sha256":"e88118a107b326d1"}},{"arxiv_id":"2505.14625","arxiv_id_is_arxiv":true,"paper":"/paper/tinyv-reducing-false-negatives-in","title":"TinyV: Reducing False Negatives in Verification Improves RL for LLM Reasoning","date":"2025-05-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"uw-nsl/tinyv","path":"analysis_tool/verl_reward_score/math.py","file_url":"https://github.com/uw-nsl/tinyv/blob/HEAD/analysis_tool/verl_reward_score/math.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from xingzhejun/d-OPSD, and GitHub detected no licence in that repository when it was checked","code_sha256":"e88118a107b326d1","code_sha256_prefix":"e88118a107b326d1","mcp_get_code":{"code_sha256":"e88118a107b326d1"}},{"arxiv_id":"2505.13308","arxiv_id_is_arxiv":true,"paper":"/paper/seek-in-the-dark-reasoning-via-test-time","title":"Seek in the Dark: Reasoning via Test-Time Instance-Level Policy Gradient in Latent Space","date":"2025-05-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bigai-nlco/latentseek","path":"src/extract_judge_answer/math_equivalent_MATH.py","file_url":"https://github.com/bigai-nlco/latentseek/blob/HEAD/src/extract_judge_answer/math_equivalent_MATH.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"20063c675d638a77","code_sha256_prefix":"20063c675d638a77","mcp_get_code":{"code_sha256":"20063c675d638a77"}},{"arxiv_id":"2504.20157","arxiv_id_is_arxiv":true,"paper":"/paper/toward-evaluative-thinking-meta-policy","title":"Toward Evaluative Thinking: Meta Policy Optimization with Evolving Reward Models","date":"2025-04-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"minnesotanlp/mpo","path":"trl/extras/mpo/rm_math_reasoning.py","file_url":"https://github.com/minnesotanlp/mpo/blob/HEAD/trl/extras/mpo/rm_math_reasoning.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"Apache-2.0, as GitHub detects it on this paper's repository, minnesotanlp/mpo, is in the permissive set, but a licence decision keeps the body a pointer: the reason for that decision is not recorded with it","code_sha256":"20063c675d638a77","code_sha256_prefix":"20063c675d638a77","mcp_get_code":{"code_sha256":"20063c675d638a77"}},{"arxiv_id":"2503.02324","arxiv_id_is_arxiv":true,"paper":"/paper/promptcot-synthesizing-olympiad-level","title":"PromptCoT: Synthesizing Olympiad-level Problems for Mathematical Reasoning in Large Language Models","date":"2025-03-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhaoxlpku/promptcot","path":"eval/math_equivalence.py","file_url":"https://github.com/zhaoxlpku/promptcot/blob/HEAD/eval/math_equivalence.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"20063c675d638a77","code_sha256_prefix":"20063c675d638a77","mcp_get_code":{"code_sha256":"20063c675d638a77"}},{"arxiv_id":"2502.11133","arxiv_id_is_arxiv":true,"paper":"/paper/masrouter-learning-to-route-llms-for-multi","title":"MasRouter: Learning to Route LLMs for Multi-Agent Systems","date":"2025-02-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yanweiyue/masrouter","path":"Datasets/math_dataset.py","file_url":"https://github.com/yanweiyue/masrouter/blob/HEAD/Datasets/math_dataset.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"20063c675d638a77","code_sha256_prefix":"20063c675d638a77","mcp_get_code":{"code_sha256":"20063c675d638a77"}},{"arxiv_id":"2411.07681","arxiv_id_is_arxiv":true,"paper":"/paper/what-do-learning-dynamics-reveal-about","title":"What Do Learning Dynamics Reveal About Generalization in LLM Reasoning?","date":"2024-11-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"katiekang1998/reasoning_generalization","path":"utils.py","file_url":"https://github.com/katiekang1998/reasoning_generalization/blob/HEAD/utils.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"20063c675d638a77","code_sha256_prefix":"20063c675d638a77","mcp_get_code":{"code_sha256":"20063c675d638a77"}},{"arxiv_id":"2411.04282","arxiv_id_is_arxiv":true,"paper":"/paper/language-models-are-hidden-reasoners","title":"Language Models are Hidden Reasoners: Unlocking Latent Reasoning Capabilities via Self-Rewarding","date":"2024-11-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"salesforceairesearch/latro","path":"LaTRO/utils/eval_utils.py","file_url":"https://github.com/salesforceairesearch/latro/blob/HEAD/LaTRO/utils/eval_utils.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"20063c675d638a77","code_sha256_prefix":"20063c675d638a77","mcp_get_code":{"code_sha256":"20063c675d638a77"}},{"arxiv_id":"2404.13925","arxiv_id_is_arxiv":true,"paper":"/paper/mario-eval-evaluate-your-math-llm-with-your","title":"MARIO Eval: Evaluate Your Math LLM with your Math LLM--A mathematical dataset evaluation toolkit","date":"2024-04-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mario-math-reasoning/mario_eval","path":"math_evaluation/core/evaluations.py","file_url":"https://github.com/mario-math-reasoning/mario_eval/blob/HEAD/math_evaluation/core/evaluations.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, mario-math-reasoning/mario_eval when it was checked","code_sha256":"067809ee50587572","code_sha256_prefix":"067809ee50587572","mcp_get_code":{"code_sha256":"067809ee50587572"}},{"arxiv_id":"2404.02078","arxiv_id_is_arxiv":true,"paper":"/paper/advancing-llm-reasoning-generalists-with","title":"Advancing LLM Reasoning Generalists with Preference Trees","date":"2024-04-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"openbmb/eurus","path":"eval/utils/math_equivalence.py","file_url":"https://github.com/openbmb/eurus/blob/HEAD/eval/utils/math_equivalence.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"20063c675d638a77","code_sha256_prefix":"20063c675d638a77","mcp_get_code":{"code_sha256":"20063c675d638a77"}},{"arxiv_id":"2402.05120","arxiv_id_is_arxiv":true,"paper":"/paper/more-agents-is-all-you-need","title":"More Agents Is All You Need","date":"2024-02-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"moreagentsisallyouneed/agentforest","path":"src/math_equivalence.py","file_url":"https://github.com/moreagentsisallyouneed/agentforest/blob/HEAD/src/math_equivalence.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, moreagentsisallyouneed/agentforest when it was checked","code_sha256":"20063c675d638a77","code_sha256_prefix":"20063c675d638a77","mcp_get_code":{"code_sha256":"20063c675d638a77"}},{"arxiv_id":"2310.09168","arxiv_id_is_arxiv":true,"paper":"/paper/explore-instruct-enhancing-domain-specific","title":"Explore-Instruct: Enhancing Domain-Specific Instruction Coverage through Active Exploration","date":"2023-10-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"fanqiwan/Explore-Instruct","path":"eval/auto_eval/math/math_equivalence.py","file_url":"https://github.com/fanqiwan/Explore-Instruct/blob/HEAD/eval/auto_eval/math/math_equivalence.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"20063c675d638a77","code_sha256_prefix":"20063c675d638a77","mcp_get_code":{"code_sha256":"20063c675d638a77"}},{"arxiv_id":"2310.05914","arxiv_id_is_arxiv":true,"paper":"/paper/neftune-noisy-embeddings-improve-instruction","title":"NEFTune: Noisy Embeddings Improve Instruction Finetuning","date":"2023-10-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"akjindal53244/arithmo","path":"eval/MATH/MATH_compute_metric_zero_shot_CoT.py","file_url":"https://github.com/akjindal53244/arithmo/blob/HEAD/eval/MATH/MATH_compute_metric_zero_shot_CoT.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"20063c675d638a77","code_sha256_prefix":"20063c675d638a77","mcp_get_code":{"code_sha256":"20063c675d638a77"}},{"arxiv_id":"2303.12712","arxiv_id_is_arxiv":true,"paper":"/paper/sparks-of-artificial-general-intelligence","title":"Sparks of Artificial General Intelligence: Early experiments with GPT-4","date":"2023-03-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"emrgnt-cmplxty/zero-shot-replication","path":"zero_shot_replication/core/math_helpers.py","file_url":"https://github.com/emrgnt-cmplxty/zero-shot-replication/blob/HEAD/zero_shot_replication/core/math_helpers.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":"19df601915034cc3","code_sha256_prefix":"19df601915034cc3","mcp_get_code":{"code_sha256":"19df601915034cc3"}},{"arxiv_id":"openreview_QrC8OgQyOI","arxiv_id_is_arxiv":false,"paper":null,"title":"OpenReview id openreview_QrC8OgQyOI","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"viiika/Prism","path":"Dream/Dream_Prism/metrics/math500_eval.py","file_url":"https://github.com/viiika/Prism/blob/HEAD/Dream/Dream_Prism/metrics/math500_eval.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":"eaf84570592463bd","code_sha256_prefix":"eaf84570592463bd","mcp_get_code":{"code_sha256":"eaf84570592463bd"}},{"arxiv_id":"2024.findings-emnlp.407","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2024.findings-emnlp.407","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"amayuelas/multi-agent-attack","path":"multiagent_debate/math_equivalence.py","file_url":"https://github.com/amayuelas/multi-agent-attack/blob/HEAD/multiagent_debate/math_equivalence.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":"4fa5d4203318fbad","code_sha256_prefix":"4fa5d4203318fbad","mcp_get_code":{"code_sha256":"4fa5d4203318fbad"}}],"record_sha256":"aa566cb510544f5f4c051e42aeb1c3a25d4ee441f916b1a71c74ac1e214e57bf","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}