Home › Code › is_equiv

is_equiv

Syntologyentry name in harvested code

Syntology's record for this page last changed ; when this build read Syntology's graph is in the build record.

is_equiv appears in the code Syntology harvested for 22 papers, as 9 distinct code bodies found in 22 places (a place is one code body under one paper). Of the 22 papers, 21 with a sample that ran: 21 with a run with no instrument failure, 0 where every run was a failure of Syntology's instrument. 1 of the code bodies carries a behaviour fingerprint.

What this page is not. Routines are grouped here by the exact string of their function or class name. Nothing asserts that two samples named is_equiv do the same thing, share code, or are comparable; the name is a string, not an identity. Behaviour outputs (what a fingerprinted sample returned on the shared battery) are not in this export and are not shown here; get_code(code_sha256="…") returns this sample's fingerprint on the shared battery, with the battery's shuffled null and lift; not shown on this site (how to connect). "Ran" means executed on a synthesized fixture, not that the code is correct or reproduces a paper.

Samples Syntology

The 9 distinct code bodies named is_equiv: 8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 5 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified. “Where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. One tile per status, in the site's fixed vocabulary, each code body counted once:

0ran · honoured contract
5ran · violated contract
0ran · our draft was wrong
0ran; the contract check could not run
3ran
1unverified
1fingerprinted

Licence is a property of each copy, so it is counted per place: 9 of the 22 places are pointer only (Syntology does not serve that copy's text); at 2 of those this paper's copy is under a permissive licence, but the stored copy of the same code that Syntology serves is not cleared for its text (hover the licence cell for why). This site shows no code text for any sample; every row below links to the file in its repository where the record names one.

“Ran” means the sample executed on a synthesized input; it does not mean the output is correct. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “the contract check could not run” (RAISES, DEP_MISSING or TIMEOUT; hover a row's label for which) are failures of Syntology's instrument, not of the code, and those samples did run. The ran count above is every status except unverified, the same rule as each paper page; “with no instrument failure” is honoured, violated and ran with no contract checked. A metamorphic tier, where shown, is evidence of the output's shape, not that the sample implements the method.

Papers

22 papers shown of 22, newest first; 22 places in the table. A paper with no recorded date is placed by the month its arXiv id encodes, shown in the Date column as YYYY-MM (from id). One row per place: a paper whose repository defines the name more than once appears more than once, and the same code body held for several papers appears once under each, with the same status. Titles and dates are the archive's archive 2025-07-28 for papers in the archive, and the graph's for 7 papers added by Syntology; 2 papers have no page here and are shown by their id only (arXiv: for an arXiv id; an id from another venue, such as ACL Anthology or AAAI, is named as that venue's id, never as an arXiv id). Status and fingerprint are Syntology's record of each code body; licence is recorded for each place. The File cell ends with the code body's code_sha256. A sample's code_sha256 is Syntology's identity for that exact code. It is printed in full (16 hexadecimal characters for every sample in this build), and get_code(code_sha256="…") takes it exactly as printed. An agent calls it on Syntology's MCP service (how to connect); click an identity to copy that call.

PaperDateFileStatus SyntologyLicence
StudyBench: Can Self-Evolution Squeeze Textbooks for Olympiad Capability? added by Syntology 2026-09 (from id) thunlp/StudyBench/eval/math_equivalence.py 20063c675d638a77 ran · violated contract no licence file found · pointer only
Learning from the Self-future: On-policy Self-distillation for dLLMs added by Syntology 2026-06 (from id) xingzhejun/d-OPSD/d-opsd/math500_utils.py e88118a107b326d1 ran · violated contract no licence file found · pointer only
GDSD: Reinforcement Learning as Guided Denoiser Self-Distillation for Diffusion Language Models added by Syntology 2026-05 (from id) GaryBall/GDSD/gdsd/utils/math500_utils.py b2845803d938cb26 ran · violated contract Apache-2.0 (permissive)
GraphPlanner: Graph Memory-Augmented Agentic Routing for Multi-Agent LLMs added by Syntology 2026-04 (from id) ulab-uiuc/GraphPlanner/router_planner/shared/math_eval.py 34ed87891e855695 ran · violated contract no licence file found · pointer only
Training-Free Test-Time Contrastive Learning for Large Language Models added by Syntology 2026-04 (from id) KevinSCUTer/TF-TTCL/core/source/compare/selection_kernel.py 5015a8c78052f4f0 ran · violated contract MIT (permissive)
Diffusion-State Policy Optimization for Masked Diffusion Language Models added by Syntology 2026-02 (from id) dllm-reasoning/d1/diffu-grpo/math500_utils.py e88118a107b326d1 ran · violated contract Apache-2.0 (permissive) here; the stored copy is pointer only
TokenSqueeze: Performance-Preserving Compression for Reasoning LLMs added by Syntology 2025-11 (from id) zhangyx1122/TokenSqueeze/utils/math500_verify.py e88118a107b326d1 ran · violated contract no licence file found · pointer only
TinyV: Reducing False Negatives in Verification Improves RL for LLM Reasoning 20 May 2025 uw-nsl/tinyv/analysis_tool/verl_reward_score/math.py e88118a107b326d1 ran · violated contract MIT (permissive) here; the stored copy is pointer only
Seek in the Dark: Reasoning via Test-Time Instance-Level Policy Gradient in Latent Space 19 May 2025 bigai-nlco/latentseek/src/extract_judge_answer/math_equivalent_MATH.py 20063c675d638a77 ran · violated contract MIT (permissive)
Toward Evaluative Thinking: Meta Policy Optimization with Evolving Reward Models 28 Apr 2025 minnesotanlp/mpo/trl/extras/mpo/rm_math_reasoning.py 20063c675d638a77 ran · violated contract Apache-2.0 recorded; this copy not marked cleared · pointer only
PromptCoT: Synthesizing Olympiad-level Problems for Mathematical Reasoning in Large Language Models 4 Mar 2025 zhaoxlpku/promptcot/eval/math_equivalence.py 20063c675d638a77 ran · violated contract MIT (permissive)
MasRouter: Learning to Route LLMs for Multi-Agent Systems 16 Feb 2025 yanweiyue/masrouter/Datasets/math_dataset.py 20063c675d638a77 ran · violated contract Apache-2.0 (permissive)
What Do Learning Dynamics Reveal About Generalization in LLM Reasoning? 12 Nov 2024 katiekang1998/reasoning_generalization/utils.py 20063c675d638a77 ran · violated contract MIT (permissive)
Language Models are Hidden Reasoners: Unlocking Latent Reasoning Capabilities via Self-Rewarding 6 Nov 2024 salesforceairesearch/latro/LaTRO/utils/eval_utils.py 20063c675d638a77 ran · violated contract Apache-2.0 (permissive)
MARIO Eval: Evaluate Your Math LLM with your Math LLM--A mathematical dataset evaluation toolkit 22 Apr 2024 mario-math-reasoning/mario_eval/math_evaluation/core/evaluations.py 067809ee50587572 unverified no licence file found · pointer only
Advancing LLM Reasoning Generalists with Preference Trees 2 Apr 2024 openbmb/eurus/eval/utils/math_equivalence.py 20063c675d638a77 ran · violated contract Apache-2.0 (permissive)
More Agents Is All You Need 3 Feb 2024 moreagentsisallyouneed/agentforest/src/math_equivalence.py 20063c675d638a77 ran · violated contract no licence file found · pointer only
Explore-Instruct: Enhancing Domain-Specific Instruction Coverage through Active Exploration 13 Oct 2023 fanqiwan/Explore-Instruct/eval/auto_eval/math/math_equivalence.py 20063c675d638a77 ran · violated contract Apache-2.0 (permissive)
NEFTune: Noisy Embeddings Improve Instruction Finetuning 9 Oct 2023 akjindal53244/arithmo/eval/MATH/MATH_compute_metric_zero_shot_CoT.py 20063c675d638a77 ran · violated contract Apache-2.0 (permissive)
Sparks of Artificial General Intelligence: Early experiments with GPT-4 22 Mar 2023 emrgnt-cmplxty/zero-shot-replication/zero_shot_replication/core/math_helpers.py 19df601915034cc3 ran Apache-2.0 (permissive)
OpenReview id openreview_QrC8OgQyOI viiika/Prism/Dream/Dream_Prism/metrics/math500_eval.py eaf84570592463bd ran fingerprinted Apache-2.0 (permissive)
ACL Anthology id 2024.findings-emnlp.407 amayuelas/multi-agent-attack/multiagent_debate/math_equivalence.py 4fa5d4203318fbad ran MIT (permissive)

This site shows no code text; each File cell links to the file on GitHub at the repository's current default branch, which may have changed since the harvest. "Pointer only" means Syntology does not serve that copy's text, for one of six reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar); this paper's copy was not located, so its licence is not recorded; or this paper's copy is under a permissive licence, but the stored copy of the same code that Syntology serves is not cleared for its text. Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence cell for the reason. Per-sample records for a paper are on its paper page under "Code Syntology ran".

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections