Unverified50% confidenceBenchmarkExact time
The target value for the Erdős minimum overlap problem is 0.38080, where lower is better; the value reported by TTT-Discover is 0.38093, and this run's result of 0.38094 is almost identical to the reported value but still has a tiny gap from the target.
1
Sources
50%
Confidence
Medium-term (~90 days)
Relevance
10/17/2026
First Seen
Valid until: 1/15/2027
Sources
Related Entities
Related Claims
UnverifiedOn the Erdős minimum overlap problem, the TTT-Discover recipe of "eight groups × 64 rollouts plus one LoRA update" reached a certified C₅ upper bound of 0.38094 within 25 steps.78% similarUnverifiedAcross a range of question sizes spanning 256x, the error judgment rate of a single run is almost unchanged: 0.531 at T=16 and 0.534 at T=4096.70% similarUnverifiedThe best-performing Edu-QuRater achieved an average accuracy of 0.917 in reproducing GPT-4.1-mini pairwise judgments on the held-out set.67% similarUnverifiedMistral Small 4 scored only 0.699 on unit conversion inputs and produced 265 errors that differed from the correct label by exactly a power of ten.67% similarUnverifiedA Reddit technical post claims that a model with only 0.8B parameters achieved a score of 42.15% on the ARC-Challenge benchmark, surpassing the untuned stock Qwen3.5-2B base model and outperforming a solution using SFT distillation with 25,000 data entries.66% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/1054052API
curl https://kongchang.com/api/v1/knowledge/claims/1054052MCP
get_claim(id=1054052)