Home › Code › count_unknown_letters_in_expr

count_unknown_letters_in_expr

Syntologyentry name in harvested coderead from the graph 2026-09-24

count_unknown_letters_in_expr appears in the code Syntology harvested for 14 papers, as 2 distinct code bodies found in 14 places (a place is one code body under one paper). At least one of them ran in 14 of the papers; 2 of the code bodies carry 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 count_unknown_letters_in_expr 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; the graph at syntology.ai holds them. "Ran" means executed on a synthesized fixture, not that the code is correct or reproduces a paper.

Samples Syntology

Syntology ran 2 of the 2 distinct code bodies named count_unknown_letters_in_expr; 0 are unverified. One tile per status, in the site's fixed vocabulary, each code body counted once:

1ran · honoured contract
0ran · violated contract
0ran · our draft was wrong
0ran · fixture could not drive it
1ran
0unverified
2fingerprinted

Licence is a property of each copy, so it is counted per place: 6 of the 14 places are pointer only (Syntology does not serve that copy's text). 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 “fixture could not drive it” 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.

Papers

14 papers shown of 14, newest first; 14 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. 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, Syntology's identity for that exact code: an agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

PaperDateFileStatus SyntologyLicence
Chopthin-Consensus Power Sampling: A Diversity-Preserving Approach to LLM Decoding added by Syntology 2026-09 (from id) MinooAhmadii/chopthin-consensus-power-sampling/ccps/graders/math_grader.py 368d3db6347269c3 ran · honoured contract fingerprinted no licence file found · pointer only
The Illusion of Reasoning: Exposing Evasive Data Contamination in LLMs via Zero-CoT Truncation added by Syntology 2026-05 (from id) Yifan-Lan/zero-cot-probe/math_grade.py 368d3db6347269c3 ran · honoured contract fingerprinted MIT (permissive)
Breaking the Reward Barrier: Accelerating Tree-of-Thought Reasoning via Speculative Exploration added by Syntology 2026-05 (from id) PKU-SEC-Lab/SPEX/evaluate/evaluate_utils/grader.py 368d3db6347269c3 ran · honoured contract fingerprinted no licence file found · pointer only
Policy Split: Incentivizing Dual-Mode Exploration in LLM Reinforcement with Dual-Mode Entropy Regularization added by Syntology 2026-04 (from id) BITHLP/PolicySplit/verl/utils/reward_score/openai_math_grade.py 368d3db6347269c3 ran · honoured contract fingerprinted no licence file found · pointer only
REAM: Merging Improves Pruning of Experts in LLMs added by Syntology 2026-04 (from id) zai-org/glm-simple-evals/evals/grading/grader.py 368d3db6347269c3 ran · honoured contract fingerprinted no licence file found · pointer only
Long Chain-of-Thought Compression via Fine-Grained Group Policy Optimization added by Syntology 2026-02 (from id) Mr-XcHan/FGO/src/open_r1/grader.py 368d3db6347269c3 ran · honoured contract fingerprinted no licence file found · pointer only
BOOTSTRAPPING LLMS TO REASON OVER LONGER HORIZONS VIA REINFORCEMENT LEARNING added by Syntology 2025-10 (from id) AlesyaIvanova/h1/math_utils.py 368d3db6347269c3 ran · honoured contract fingerprinted no licence file found · pointer only
AdaptThink: Reasoning Models Can Learn When to Think 19 May 2025 thu-keg/adaptthink/src/adapt_think_rm.py 368d3db6347269c3 ran · honoured contract fingerprinted MIT (permissive)
Thinkless: LLM Learns When to Think 19 May 2025 vainf/thinkless/deepscaler/rewards/math_utils/utils.py 368d3db6347269c3 ran · honoured contract fingerprinted Apache-2.0 (permissive)
Absolute Zero: Reinforced Self-play Reasoning with Zero Data 6 May 2025 LeapLabTHU/Absolute-Zero-Reasoner/absolute_zero_reasoner/rewards/math_utils.py 368d3db6347269c3 ran · honoured contract fingerprinted MIT (permissive)
Light-R1: Curriculum SFT, DPO and RL for Long COT from Scratch and Beyond 13 Mar 2025 Qihoo360/Light-R1/deepscaler-release/deepscaler/rewards/math_utils/utils.py 368d3db6347269c3 ran · honoured contract fingerprinted Apache-2.0 (permissive)
Can 1B LLM Surpass 405B LLM? Rethinking Compute-Optimal Test-Time Scaling 10 Feb 2025 RyanLiu112/compute-optimal-tts/src/envs/MATH/verify_utils.py 368d3db6347269c3 ran · honoured contract fingerprinted MIT (permissive)
Can Large Language Models Always Solve Easy Problems if They Can Solve Harder Ones? 18 Jun 2024 QwenLM/ConsisEval/math_check/grader.py 54417bf5eb16e81f ran fingerprinted MIT (permissive)
Let's Verify Step by Step 31 May 2023 openai/prm800k/prm800k/grading/grader.py 368d3db6347269c3 ran · honoured contract fingerprinted 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 four 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; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). 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