{"total":13,"items":[{"citing_arxiv_id":"2607.00276","ref_index":1,"ref_count":1,"confidence":0.98,"is_internal_anchor":true,"paper_title":"Testing Frontier Large Language Models' Physics Literacy in Parallel Physical Worlds","primary_cat":"cs.LG","submitted_at":"2026-06-30T23:52:15+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":6.0,"formal_verification":"none","one_line_summary":"Introduces an auditable four-stage diagnostic for LLM physics reasoning in novel frameworks and applies it to three parallel worlds, yielding pass rates of 6/15, 6/15, and 0/15 on frontier models with noted qualitative-quantitative asymmetry.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2606.30178","ref_index":1,"ref_count":1,"confidence":0.98,"is_internal_anchor":true,"paper_title":"Rectangles, triangles and Schr\\\"{o}dinger waves","primary_cat":"math.CA","submitted_at":"2026-06-29T11:54:26+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":7.0,"formal_verification":"none","one_line_summary":"Constructs lattice point sets with many rectangles and few isosceles triangles to produce explicit counterexamples to the Mizohata-Takeuchi conjecture for the paraboloid via transference principles.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2606.29826","ref_index":17,"ref_count":1,"confidence":0.98,"is_internal_anchor":true,"paper_title":"Rethinking Collaborative Trust for Verifiably Decentralized Blockchain Systems","primary_cat":"cs.CR","submitted_at":"2026-06-29T06:12:52+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":6.0,"formal_verification":"none","one_line_summary":"A framework incentivizes inter-coalition collaboration via asymmetric Shapley values and expander graphs to achieve verifiable decentralization in blockchains.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2606.29593","ref_index":4,"ref_count":1,"confidence":0.98,"is_internal_anchor":true,"paper_title":"How AI settled the complexity of the oldest SGD algorithm","primary_cat":"cs.LG","submitted_at":"2026-06-28T20:27:52+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":3.0,"formal_verification":"none","one_line_summary":"AI models discovered the worst-case complexity of the Kaczmarz algorithm for solving linear systems.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2606.24583","ref_index":1,"ref_count":1,"confidence":0.98,"is_internal_anchor":true,"paper_title":"More sum-product type counterexamples: products with shifts and $AA+A$","primary_cat":"math.NT","submitted_at":"2026-06-23T13:45:26+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":4.0,"formal_verification":"none","one_line_summary":"Adapts known construction to prove existence of c>0 and large finite A subset R with |AA+A+A| << |A|^{2-c}, plus corollaries for other sum-product expressions.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2606.23959","ref_index":19,"ref_count":1,"confidence":0.98,"is_internal_anchor":true,"paper_title":"Does My Embedding Reflect That $A = B$? Evaluating Mathematical Equivalence in Embedding Models","primary_cat":"cs.CL","submitted_at":"2026-06-22T21:37:58+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":6.0,"formal_verification":"none","one_line_summary":"Embedding models fail to capture mathematical equivalence due to lexical bias, but contrastive training on informal-formal pairs improves performance on MELD and retrieval tasks.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2606.13619","ref_index":2,"ref_count":2,"confidence":0.98,"is_internal_anchor":true,"paper_title":"Split primes and the Elekes-R\\'onyai problem","primary_cat":"math.NT","submitted_at":"2026-06-11T17:31:36+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":8.0,"formal_verification":"none","one_line_summary":"Constructs sets A subset R with |{x+y+(x-y)^2 : x,y in A}| <= |A|^{2-c} for some c>0, giving a counterexample to the Elekes-Rónyai problem via prime-splitting amplification.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2606.05629","ref_index":3,"ref_count":1,"confidence":0.98,"is_internal_anchor":true,"paper_title":"An automated proof that R(B_8,B_10)=37","primary_cat":"math.CO","submitted_at":"2026-06-04T02:57:28+00:00","verdict":"ACCEPT","verdict_confidence":"LOW","novelty_score":7.0,"formal_verification":"full","one_line_summary":"Proves R(B_8, B_10) = 37 via an AI-assisted short proof with a Lean formalization of the upper bound.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2606.05105","ref_index":1,"ref_count":1,"confidence":0.98,"is_internal_anchor":true,"paper_title":"Stochastically evolving ellipsoids with symmetries","primary_cat":"math.MG","submitted_at":"2026-06-03T17:07:07+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":5.0,"formal_verification":"none","one_line_summary":"Proves lattice sphere packings in R^N achieve density at least c N² loglog N 2^{-N} for infinitely many N, improving Klartag's bound via stochastic ellipsoid evolution with cyclotomic symmetries.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2606.03419","ref_index":5,"ref_count":1,"confidence":0.98,"is_internal_anchor":true,"paper_title":"Optimizing Explicit Unit-Distance Lower-Bound Certificates","primary_cat":"math.OC","submitted_at":"2026-06-02T10:05:23+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":4.0,"formal_verification":"none","one_line_summary":"Optimizes integer multiplicities and a real parameter in Sawin's unit-distance certificate via an evolution strategy to obtain improved explicit lower bounds u(n) > n^{1.0152} and u(n) > n^{1.031}.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2606.01462","ref_index":3,"ref_count":1,"confidence":0.98,"is_internal_anchor":true,"paper_title":"An Enigma of Artificial Reason: Investigating the Production-Evaluation Gap in Large Reasoning Models","primary_cat":"cs.AI","submitted_at":"2026-05-31T21:46:52+00:00","verdict":"CONDITIONAL","verdict_confidence":"LOW","novelty_score":6.0,"formal_verification":"none","one_line_summary":"LRMs show a large production-evaluation gap on the VAIR dataset with valid answers but invalid reasoning, driven by answer confirmation bias as evidenced by CoT analysis, linear probes, and causal patching.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2605.28781","ref_index":2,"ref_count":1,"confidence":0.98,"is_internal_anchor":true,"paper_title":"The sum-product conjecture is false for real numbers","primary_cat":"math.NT","submitted_at":"2026-05-27T17:42:41+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":9.0,"formal_verification":"none","one_line_summary":"The sum-product conjecture is false for real numbers, disproved via constructions of sets A with max(|A+A|, |AA|) ≤ |A|^{2-c} for absolute c > 0.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2605.26145","ref_index":1,"ref_count":1,"confidence":0.98,"is_internal_anchor":true,"paper_title":"An incomplete attack on the upper bound of the unit distance problem","primary_cat":"math.GM","submitted_at":"2026-05-22T21:30:47+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":2.0,"formal_verification":"none","one_line_summary":"An incomplete attempt to show that the O(n^{4/3}) upper bound for unit distances among n points in the plane is not sharp, plus remarks on Szemerédi-Trotter incidences.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null}],"limit":50,"offset":0}