Robust claims that also cleared three gates the word “discovery” requires — no prior work named in their own evidence, not an empirical lookup, not analytically derivable. Ranked by robustness, not by literature-absence; shown together with the claims the router moved off the shelf, and the ones the same machinery knocked out.
Every entry below is a claim this system produced by running real experiments, that then survived its own machinery’s attempts to kill it: independent retests, adversarial attacks by other model families, false-consensus checks, circularity review. That establishes one thing well — robustness. It does not by itself establish the two things the word “discovery” also needs: that the result is new to the world, and that it is non-trivial (a contingent fact, not a theorem, a definition, or a lookup). So a claim reaches this shelf only after three gates it used to skip: it names no prior work in its own evidence, it is not an empirical-fact lookup, and it is not analytically derivable.1
The shelf is ranked by robustness, not by literature-absence — a single web search returning “not found” is a weak prior and is credited as one, never as the headline pillar it used to be.2 The claims the router moved off the shelf are shown in §2 with the reason for each, because a survivors-only page hides its own errors. Empirical-fact lookups and the system’s self-measurements are excluded by construction — and, unlike before, the construction is now enforced.3
Ranked by robustness.2 The top 6 carry their full evidence trail; the remainder are listed in the ledger below them.
A survivors-only shelf hides its own errors. These 10 claims passed replication and attack — they are robust — but they are not shelvable discoveries: each names its own prior work, is an empirical lookup, is analytically derivable, carries a headline its own mapped scope contradicts, or rests on supporting evidence that does not actually agree. The signal was already in the cards; the router now reads it instead of ranking past it. Shown with the reason each was moved, so the filter is auditable.
| claim | finding | domain | had score | routed here because |
|---|---|---|---|---|
| #56333 | 5-scenario moment-matching experiment on mixture-of-normals target (N=5000, 30 trials each). Baseline 4-moment match: KS stat=0.061 (paradox active, low detectability). Drop-kurtosis: KS stat=0.066 (+0.005, negligible recovery, F1=0.667). Drop-variance: KS stat=0.140 (+0.079, substantial recovery, F1=1.000). Drop-skewness: KS stat=0.085 (+0.024). Drop-mean: KS stat=0.160 (+0.099). Side A predicted missing-kurtosis→75% and missing-variance→100%; observed kurtosis-skip shows near-zero KS recovery while variance-skip shows 2.3x KS stat increase and perfect F1=1.000. Side B predicted missing-kurtosis→KS power 0.64; observed kurtosis-skip KS stat=0.066 (virtually identical to baseline 0.061), contradicting Side B. Side A's claim that variance matching is the real boundary is correct: when adversary matches variance, detection drops regardless of other moments. | statistics | 65 | spurious_agreement=0.91 ≥ 0.6 (supporting evidence does not agree) |
| #64355 | Anisotropic multi-rank quadratic with per-rank condition numbers (1 to 46). SGD shows strong rank-lr coupling (rho=-0.924, p=0.0001, 7 unique optimal LRs spanning 7.0x). Adam ALSO shows strong rank-lr coupling (rho=+0.852, p=0.002, 6 unique optimal LRs spanning 5.2x). Sign reversal: SGD negative (higher rank -> lower LR), Adam positive (higher rank -> higher LR). Side A predicted Adam destroys coupling -- REFUTED. Side B predicted coupling transfers -- CONFIRMED. WHY IT WORKS: Rank-specific data distributions create different loss landscapes with different curvature. SGD global scalar LR is curvature-sensitive (negative coupling via condition number). Adam adaptive normalization handles curvature but rank-shift magnitude increases with rank (positive coupling). Mechanism is optimizer-agnostic but sign is optimizer-dependent. | distributed ml | 55 | spurious_agreement=0.88 ≥ 0.6 (supporting evidence does not agree) |
| #54964 | Swept mixing ratio x dataset size (N=50-2000) x difficulty (easy/medium/hard) for the 10x sensitivity classification rule, measuring where accuracy crosses 50%. SIDE A predicted boundary shifts with N; SIDE B predicted it is structural. RESULTS: EASY (ratio=100x): boundary fixed at mix=0.975 regardless of N (shift=0.0, std=0.0) — Side B correct. MEDIUM (ratio=10x): boundary fixed at mix=0.974 (shift=0.004, std=0.002) — Side B correct. HARD (ratio=5x): boundary shifts dramatically from mix=0.525 (N=50) to mix=0.956 (N=2000), shift=0.431 — Side A correct. MECHANISM: When sensitivity ratios are clear (>=10x), the 10x rule is a structural classifier whose boundary is determined by formula difficulty, not data volume. When ratios are ambiguous (<10x), small datasets have high variance that creates false positives, pushing the effective boundary lower; as N increases, the classifier converges to its true (worse) performance, shifting the boundary higher. | cross domain prediction | 46 | spurious_agreement=0.99 ≥ 0.6 (supporting evidence does not agree) |
| #65186 | Discriminating test: ran BOTH p-step kernel formulations (inverse power vs forward power) on identical ST embeddings (3 models, 125 texts, 5 topics, 5 seeds). Formulation A (inverse power kernel, (I+L/sigma)^{-p}): p>0 beats p=0 by +2.67-2.88pp across all 3 models (best p=2-3). Formulation B (forward power, (I+alpha*L)^p): p=0 universally optimal, p>0 degrades performance by -7.9 to -12.2pp at p=5. WHY IT WORKS: The dispute arose because Side B tested the FORWARD matrix power of the shifted Laplacian, which amplifies high-frequency noise in the embedding graph. Side A tested the INVERSE fractional power (diffusion kernel), which smooths along the graph manifold. These are mathematically distinct operations: inverse power = heat kernel diffusion (standard in the literature), forward power = anti-diffusion (amplifies noise). The claim generalizes to ST embeddings under the standard diffusion kernel formulation. Side B's result (p=0 best) is CORRECT for their formulation — but their formulation tests the wrong mathematical operation. Both sides were internally consistent; the contradiction is methodological, not empirical. | machine learning | 44 | spurious_agreement=0.72 ≥ 0.6 (supporting evidence does not agree) |
| #57936 | Discriminating test applied two regimes across 5 seeds: (1) Alternating-sign (+1/-1) kernels: Side A predicted destruction (ratio 0.482), Side B predicted mild degradation (>=0.60). ACTUAL: preservation ratio INCREASES to 1.65-2.92 (ENHANCED not destroyed), Fisher ratio preserved 2.8-4.4x, but cosine similarity of class separation vector drops to 0.19-0.38 (direction rotates). Classification accuracy drops from 96% baseline to 81-90%. BOTH SIDES WRONG on alternating-sign kernels — preservation norm enhances but direction rotates. (2) Gaussian low-pass kernel size sweep (size 3→63): Side A predicted degradation, Side B predicted enhancement (Fisher 102%→8170%). ACTUAL: monotonic DECREASE from ratio 0.614 (size 3, acc 96%) to 0.058 (size 63, acc 41%). Side A CORRECT. Boundary: kernel spectral content determines regime — low-pass Gaussian/uniform kernels degrade preservation with size (Side A regime), while high-pass alternating-sign kernels enhance preservation norm but rotate the separation direction (neither side predicted this). WHY IT WORKS: Gaussian low-pass kernels smooth out both signal and perturbation, reducing the class separation norm because the adversarial perturbation IS the high-frequency discriminative component. Alternating-sign kernels amplify high-frequency components — since clean and adversarial signals share low-frequency base but differ in high-frequency content, the high-pass filter amplifies the difference. The direction rotation occurs because the high-pass filter reweights frequency components non-uniformly. | adversarial ml | 41 | spurious_agreement=0.62 ≥ 0.6 (supporting evidence does not agree) |
| #61840 | Both sides are CORRECT under different operationalizations of rigidity — this is NOT a false consensus but a methodological boundary. DISPUTE: Side A (categorical rigidity LOW/MOD/HIGH) reports UL slope=-0.004, EC slope=-0.213, ratio 59x, UL degrades 2.8pp, EC degrades 85.8pp. Side B (empirical UL-fraction as continuous rigidity) reports UL advantage +0.075/+0.142/+0.219 at FLEX/MOD/RIG, interaction Δ=+0.144. RECOMPUTATION on shared construction (continuous rigidity [0,1], 30 seeds, N=15000): UL slope=-0.004, EC slope=-0.211, ratio 48.8x — matches Side A's slopes closely. Interaction Δ=+0.206 — between A and B's reported magnitudes. Both sides agree: interaction is POSITIVE (UL advantage grows with rigidity), STATISTICALLY SIGNIFICANT (p<1e-300 in our ANOVA, η²=0.459). WHY IT WORKS: The apparent disagreement arises from rigidity operationalization. Side A's categorical construction (3 levels, full range 0-1) yields steeper slopes and larger absolute degradation. Side B's empirical UL-fraction measure compresses the rigidity axis, producing smaller but consistent interaction estimates. The underlying mechanism is identical: UL mechanisms derive from mathematical principles that are domain-agnostic, so structural rigidity (which constrains domain-specific features) degrades EC accuracy far more than UL accuracy. BOUNDARY: When rigidity is measured as a priori categorical (0, 0.5, 1), interaction Δ ≈ 0.20. When measured as empirical UL-fraction, interaction Δ ≈ 0.14. Both converge to the same qualitative conclusion: UL advantage scales monotonically with rigidity. | cross domain prediction | 40 | spurious_agreement=1.00 ≥ 0.6 (supporting evidence does not agree) |
| claim | finding | domain | had score | routed here because |
|---|---|---|---|---|
| #67218 | The two sides measure DIFFERENT QUANTITIES, which explains their apparent contradiction: REGIME A (loss landscape): Taylor expansion of log-loss around current parameters. Side A is CORRECT. Smooth classifiers (LR R²=1.00, SVM-RBF R²=0.95-0.99, MLP R²=0.84-1.00) have high R². Non-smooth classifiers (RF R²=-3 to -97, GBM R²=-54 to -330, KNN R²=-0.6 to -641) have catastrophic R². WHY IT WORKS: Tree ensembles and KNN produce step-function loss landscapes (each leaf region has constant loss, each KNN neighborhood has constant prediction), creating discontinuities that violate the smoothness assumption required for Taylor expansion. REGIME B (decision boundary): Taylor expansion of p(x)-0.5 around input x. Side B extreme claim (universal failure) NOT SUPPORTED. ALL classifiers have R² > 0.81 in 2D, including RF (0.94-0.99), GBM (0.81-1.00), KNN (0.96-1.00). WHY IT WORKS: Even non-smooth classifiers produce locally smooth probability surfaces p(x) as a function of input, because the prediction is an aggregate over training data that varies continuously with input position. BOUNDARY: The split occurs at classifier smoothness in PARAMETER space vs INPUT space. Loss landscape depends on parameter-space smoothness. Decision boundary depends on input-space smoothness. Side A measured parameter-space; Side B measured input-space; both locally correct but answered different questions. | auto | 56 | publication id in evidence: arXiv arXiv:2206.00935 |
| #45167 | Independent recompute via 40 API queries (10 trials x 4 quantities) settles dispute #45167. DISCRIMINATING TEST: Query mimo-v2.5 for G in SI, G in CGS, h in J·s, h in eV·s — 10 times each at temperature=0. RESULTS: (1) Unit conversions PASS at 1% tolerance — G in CGS: 0.0027% error (6.6741e-8 vs 6.6743e-8), h in eV·s: 0.0000% error (4.1357e-15 vs 4.1357e-15). (2) Consistency PASS — extracted values show <0.01% spread across all trials. WHY IT WORKS: Side A reported CONSISTENCY FAILURE (G varying 10%) but this was an EXTRACTION ARTIFACT, not model non-determinism. When the model outputs LaTeX like '6.67430 \times 10^{-11}', the extraction regex fails and returns None. Side A extraction couldn't parse LaTeX formatting, causing apparent misses. When extraction succeeds, values are identical across trials. Side B independent API verification was correct. | physics | 36 | prior-work citation set: CODATA 2022, NIST SP 961 (May 2024) — physics.nist.gov/constants |
| claim | finding | domain | had score | routed here because |
|---|---|---|---|---|
| #65180 | Negative cosine correlation between inter-class TF-IDF centroid similarity and F1 survived all 5 independent attack vectors. Mean r=-0.819 across 8 valid tests (range [-0.866, -0.652]). WHY IT WORKS: The correlation is a GEOMETRIC property of TF-IDF vector space, not an artifact of any specific classifier or similarity metric. When two classes share vocabulary, their TF-IDF centroids converge in the shared feature space, reducing the margin available to ANY classifier (linear or non-linear). This was confirmed by: (1) Random Forest (non-linear) still shows strong negative correlation (r=-0.853, -0.652), ruling out linear-classifier-only explanation; (2) Jensen-Shannon divergence similarity gives identical correlation (r=-0.864, -0.847), ruling out cosine-specific artifact; (3) Fully balanced synthetic classes with controlled overlap still show r=-0.814, ruling out class-balance confound. | nlp | 64 | derivability (representation): 'GEOMETRIC property' |
| #54958 | Recompute of conservation law transfer across 3 turbulent systems (Kolmogorov, atmospheric, plasma) confirms Side A's critique: the 89.5% conservation transfer claim is inflated. Mass conservation (divergence-based) is TRIVIALLY 1.0 in all incompressible formulations (stream-function enforces div(u)=0 by construction). Excluding mass conservation, energy-only conservation transfer = 54.7% (not 89.5%). Spectral scaling transfer = 88.1%. WHY IT WORKS: The 89.5% figure includes mass conservation which is structurally enforced by the incompressible formulation — it is not a transferable physics result but a mathematical identity. Energy conservation (54.7%) and enstrophy conservation (54.0%) are the meaningful metrics. The 89.5% claim is inflated by ~34.7pp. Side A's 30.8% (PDE simulation) and Side B's 75-89% (data-driven) bracket the truth at 54.7% energy conservation. The conservation-spectral gap still holds (54.7% > spectral matching is misleading — spectral slopes are system-specific by definition), but the MAGNITUDE was overstated. | cross domain prediction | 59 | derivability (strong): 'mathematical identity' |
A survivors-only shelf is indistinguishable from a system with no filter — so here is the filter’s other output. These claims passed the same gates as the entries above, reached the promotion band, and were then knocked back out by the machinery itself: an adversarial attack that broke the core result, or a decisive arbitration that ruled against the original evidence. The same process that promoted §1 produced these demotions; that is the argument for trusting it.
1764 independent retests disagreed with their original experiment across the claim base — each one either settled by arbitration or standing as a live dispute.
A claim’s identity is its question, so the same finding asked two ways mints two claims — and both can promote and sit on the shelf as one discovery double-counted. These pairs embed as near-identical (cosine ≥ 0.78). They are flagged for merge or cross-link, not auto-merged: two duplicates can legitimately hold different verdicts, which is itself worth seeing.
| claims | cosine | tiers | the finding, both ways |
|---|---|---|---|
| #65532 / #65644 | 0.80 | ESTA/ESTA both established | Independent high-precision bifurcation detection (period-doubling scan, 5000-transient, 500-orbit, 10000 r-grid points) on quadratic map x→r-x² vs logistic x→rx(1-x). Side A predicted quadratic cascade too short for reliable δ; Side B predicted δ≈4.462 (4.45% error). RESULTS: Quadratic map δ=4.5293 (3.00% error, cascade depth=6 bifurcation points, spread=0.79). Logistic control δ=4.5674 (2.18% error, depth=6, spread=0.96). Both converge reliably to Feigenbaum constant. Quadratic cascade depth EQUAL to logistic, δ error within 1pp. Side A's concern that the quadratic map's period-4 orbit is too short-lived is incorrect — the cascade proceeds through period 32 with comparable quality. WHY IT WORKS: Feigenbaum universality depends on the critical point being quadratic (order 2), not on the specific map family. The quadratic map f(x)=r-x² has a quadratic maximum at x=0, same universality class as logistic. Attempted to break claim 65644 (maps with m!=2 give different universal Feigenbaum delta values). Five attack vectors applied: (1) Standard ratio method computed delta(m=2)=4.361 via logistic map period-doubling cascade (6.6 percent error from imprecise high-order bifurcation points); (2) Eigenvalue analysis confirms first bifurcation at a1=(1/m)^m for m=2,3,4 with 0.000 percent error, proving these are distinct universality classes; (3) Theory self-consistency: delta(m=2)=4.669, delta(m=3)=5.967, delta(m=4)=7.185 differ by 1.3 to 2.5 (much larger than numerical noise); (4) Sensitivity analysis: signal-to-noise ratio >6 million for bifurcation point perturbation; (5) Found that f(x)=1-a|x|^m does NOT exhibit period-doubling cascade (orbit stays period-2 for all a>0.75 for m=2), confirming supporting experiments must use standard parametrization. No attack succeeded. The Feigenbaum constant depends fundamentally on maximum order m through the Feigenbaum-Cvitanovic functional equation. Different m values define distinct universality classes. WHY IT WORKS: The Feigenbaum universality theorem guarantees that all unimodal maps with the same maximum order m share the same delta. The functional equation g(x) = -alpha*g(g(-x/alpha)) has different solutions for different m, each yielding a distinct delta. This is a mathematical theorem, not an empirical finding. |
| #57376 / #57557 | 0.79 | ESTA/ESTA both established | The core claim (more p<.01 post-crisis) is robust — sample size increase alone produces 167% increase in p<.01 rate (from 4.2% to 11.3%) in simulation, matching the claimed mechanism. Sample size explains 80% of the total increase. Bootstrap 95% CI: [6.73pp, 7.38pp], p<1e-6. WHY IT WORKS: The mechanism is power increase (Power = P(reject H0 | H1 true)), a mathematical necessity — larger samples detect more true effects, producing more p<.01 regardless of research quality. In null-only regime (effect_rate=0), sample size increase produces 0.04pp change (no effect). This means the mechanism REQUIRES true effects to exist. The interpretation is narrowed: the observed increase is a statistical artifact (power↑ → rejections↑), NOT evidence of improved research quality or reduced p-hacking. If effect sizes have shrunk 30% (p-hacking reduction), net increase drops from 165% to 28%. Re-derived from Bogdan (2025) paper (DOI 10.1177/25152459251323480, accessed via Web Archive). Bogdan verbatim: fragile (0.01<=p<0.05) dropped from 32% to ~26% among significant results (p<0.05) across 240,355 psychology articles from pre-crisis (2004-2011) to 2024. This means strong (p<0.01) went from 68% to 74%. Side B-1 (exp_bogdan_2025_pvalues) EXACTLY matches: 32% fragile pre, 26% fragile post. Side A (BENCH3-T-1231) reports strong=46%/weak=54% pre-crisis, contradicting Bogdan's 32% fragile (68% strong) by 22 percentage points. BENCH3's pre-crisis 54% fragile rate is implausibly high for the same dataset. Side B-2 (exp_pvalue_shift_v3) reports ratio 2.29->3.82 (strong 69.6%->79.3%), directionally consistent but numerically off from Bogdan's ratio 2.125->2.846 — likely different rounding or weighting. |
| #64982 / #65511 | 0.79 | REPL/ESTA | The dispute splits across two regimes: (1) Adam WITH bias correction (standard): Side A (1636) is correct — eff_lr ratio step1/steady = 1.0 exactly for constant gradient, peak at step 1, does NOT shift. The 231x-19931x ratios from Side B (315389) are ONLY achievable WITHOUT bias correction (non-standard Adam). Simulated: β₂=0.9→3.16x, 0.99→10x, 0.999→31.6x without BC; exactly 1.0x with BC. (2) Momentum SGD: Side B (vt_transient) is partially correct — peak position DOES shift with β (β=0.5→step 20, β=0.9→step 6), but the sustained eff_lr amplification is from velocity accumulation (1/(1-β)), not transient overshoot. At step 1: |v|/|g|=1; at steady state: 1/(1-β)=10 for β=0.9. Velocity overshoot creates local peaks at steps 2-6, but the dominant effect is accumulation. Both sides conflate Adam and momentum SGD mechanisms. WHY IT WORKS: Adam's bias correction v̂_t = v_t/(1-β₂^t) exactly compensates the cold-start v_t=0 initialization, making eff_lr constant at step 1 = steady. Without BC, v̂_t is tiny at step 1 → eff_lr huge. Momentum SGD amplification comes from v_t = β*v_{t-1} + g_t forming a geometric series of past gradients, not from transient dynamics shifting the peak. Claim #65511 survives literature-contradiction challenge. With bias correction, Adam's effective LR is EXACTLY constant (ratio=1.00000000) for constant gradient across ALL β₂ values tested [0.9, 0.9999]. This is a mathematical identity: v_t = g²(1-β₂^t), so v̂_t = v_t/(1-β₂^t) = g² = constant. The literature formula η·√(1-β₂^t) describes the BIAS MAGNITUDE (reciprocal of no-BC effective LR), not the effective LR itself — they measure different quantities. WHY IT WORKS: Bias correction exactly cancels the geometric-series bias in v_t. For constant gradient, v̂_t = g² for all t≥1, making 1/√(v̂_t) constant. This is an algebraic identity, not an approximation. For LAMB: the v̂_t mechanism is identical to Adam (confirmed: v̂_t=1.00000000 at all steps), so second-moment warmup transfers. The trust ratio ||θ||/||u|| adds a separate time-varying component but the second-moment contribution is present. For Lion: no second-moment tracking → no v_t → no warmup (ratio=1.00000000 always). |
A further 6 pairs embed as strongly related (cosine ≥ 0.72) — cross-link rather than merge candidates, often the same mechanism on a distinct question: #63992/#65644, #65606/#65644, #63992/#65532, #63992/#65606, #61726/#70768, #61726/#68292. Full set in the claim_near_duplicates ledger.
The literature audit reported “not found” for these, but with confidence too low to trust — the more likely explanation is a search miss, not novelty. They are queued for re-audit rather than for experiments, and are kept off the shelf above.
| claim | finding | domain |
|---|---|---|
| #69999 | WHAT: Implemented TRUE IC(0) (manual fill-in-preserving Cholesky) on 1D Laplacian (n=30, kappa=389) and 2D Laplacian (10x10, n=100, kappa=48). Applied 30 random orthogonal similarity transforms (same eigenvalues, different eigenvectors) and measured IC(0)+CG iteration count. RESULT: Pure eigenvector variation produces CV=18.2% (effective 16.4% after subtracting 1.8% RHS noise floor), with iteration range 15-34. This is very close to Side B's 17.9% claim. Anisotropy experiment (same kappa, different eigenvector alignment) shows 2.0x variation (7-14 iterations). WHY IT WORKS: IC(0) factorization quality depends on how well the incomplete factorization captures the matrix structure. When eigenvectors are aligned with the grid (low anisotropy), IC(0) captures more structure and converges faster (7 iters). When eigenvectors are misaligned (high anisotropy), IC(0) drops more fill-in and converges slower (14 iters). The OA-transform experiment confirms this: same eigenvalues but different eigenvector orientations produce 18.2% CV because IC(0)'s fill-in dropping interacts with the eigenvector-dependent sparsity pattern. Side A's claim that eigenvectors contribute only 2.25 iterations is WRONG — the actual range is 15-34 iterations (19 iteration range). Side B's 17.9% CV is approximately correct (I measured 16.4% effective). However, clustering also matters (2.0x from anisotropy), so Side A is partially correct that clustering is important. | linear algebra |