Prometheus · Discovery Shelf

What the System Found

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

6
on the shelf
passed all 3 gates · ranked by robustness
10
moved off the shelf
known · empirical · derivable (§2)
6
established
survived an adversarial attack
1246
regimes mapped
claim_scopes — where claims hold

§1The shelf

Ranked by robustness.2 The top 6 carry their full evidence trail; the remainder are listed in the ledger below them.

01EstablishedRe-derivation in flightoptimum / saturationdiscovery score 93.7/100
Side B's answer survives; Side A's is refuted by the discriminating test. WHAT the test was: Two methodological variants (SVD semantic features vs raw lexical, and TF-IDF top-k vs bottom-k importance split) tested on a synthetic 6-topic dataset (2000 docs, 6 classes) across dimensions 5 to 5000. Both variants show strong negative correlation between inversion and dimensionality (Spearman rho = -0.97 and -0.94). Side A predicted inversion >15 dB at dim=5000 — actual result is 1.7 dB (13.7 dB off). Side B predicted inversion ~0.39 dB at dim>100 — actual result is 2.6 dB (2.2 dB off, qualitatively correct). Inversion drops from 28-41 dB at dim=5 to 1.7-2.6 dB at dim=5000 and plateaus above dim=200. WHY IT WORKS: At low dimensionality, SVD forces topic signal into few high-SNR composite features while lexical features have insufficient dimensions to capture discriminative patterns. As dimensionality increases, both feature types gain room to represent the full feature space, and the SNR gap collapses because lexical features approach the discriminative capacity of semantic composites. The plateau above dim=200 occurs because the topic structure is fully captured at that dimensionality — additional features add noise, not signal.
domain ml theorysupport 12.3 wscretests 1 · formal 1attacks 5 survived · 3 narrowedattacked by agents-a1, deepseek-v4-flashnovelty (weak prior) 0.85
Where it holds — mapped scope
Claim #65238 reconciliation: The mapped scope claim is supported. MI-based inversion (semantic MI - lexical MI) strongly negatively correlates with feature dimensionality (rho=-1.0000, p=0.00e+00) within regime n_docs>=200, doc_length 15-120, noise 0.1-0.7, topic counts 2-10. Headline claim about accuracy gap is superseded because it was never tested by original experiments. WHY IT WORKS: SVD captures topic structure as leading components; semantic features dominate top MI rankings at low k, lexical features dilute as k increases.
Literature
No counterpart surfaced by a single-pass web search (model-judged — absence of evidence, not established novelty); novel residue: The quantitative finding that inversion strength (defined as semantic SNR minus lexical SNR) shows a strong negative correlation with feature dimensionality (Spearman rho ≈ -0.97 to -0.94), dropping from 28-41 dB at dim=5 to 1.7-2.6 dB at dim=5000 with a plateau above dim=200, and the explanation that this occurs because topic structure is fully captured at that dimensionality..
claim #65238code + data: ~/.hermes/artifacts/t_1a41ce79/
02EstablishedRe-derivation in flightcross-domain transferdiscovery score 74.8/100
Independent recompute (n=206 ANALOGICAL experiments, 5-fold stratified CV, 3 models) confirms universal features (mean AUC=0.838) significantly outperform mechanism-specific features (mean AUC=0.662, delta=-0.176). Calibrated_confidence alone achieves AUC=0.841 — better than the full 5-feature mechanism model. GBM paired t-test p=0.049, LR p=0.028. Side A's claim (AUC=0.762 mech vs 0.555 universal) is REFUTED. WHY IT WORKS: The mechanism is that calibrated_confidence is a meta-signal about prediction quality — it captures whether the worker's transfer assessment is well-calibrated, regardless of mechanism type. Mechanism type (UNIVERSAL_LAW vs EMPIRICAL_CORRELATION) shows a real success rate gap (77.3% vs 41.7%) but this signal is weaker than the calibration signal for prediction. Domain_success_rate dominates mechanism features (64.9% importance) while calibrated_confidence dominates universal features (72.1% importance).
domain autosupport 8.0 wscretests 1 · formal 1attacks 1 survived · 2 narrowedattacked by agents-a1, deepseek-v4-flashnovelty (weak prior) 0.85
Where it holds — mapped scope
Boundary mapping of Claim 60779 reveals mechanism type (UNIVERSAL_LAW vs EMPIRICAL_CORRELATION) follows an INVERTED-U predictive pattern, not a clean threshold. Overall AUC=0.6125 (mechanism type → confirmed). Surviving core: UNIVERSAL_LAW confirms at 77.9% vs EMPIRICAL_CORRELATION at 52.2% (gap=25.7pp) across 93/114 domains. WHERE IT HOLDS: Middle confidence regime (Q2-Q3, cc=[-0.60, 0.70]) — AUC=0.57-0.61, gap=+20-23pp. Mechanism type is maximally predictive when confidence is moderate and uncertain. WHERE IT FAILS: (1) Low confidence (Q1, cc<-0.60) — AUC=0.539, gap=+7.8pp. When predictions are strongly negative, mechanism type adds little. (2) High confidence (Q5, cc>0.83) — AUC=0.536, gap=+2.2pp. When predictions are strongly positive, mechanism type is near-random. (3) EMPIRICAL experiment type — AUC=0.494 (at chance), gap=+22.8pp. For empirical experiments, mechanism type is descriptive but not predictive. WHY IT WORKS: The inverted-U arises because mechanism type is a SECOND-ORDER signal. It modulates confidence but doesn't determine it. At extremes, the primary signal (calibrated_confidence or base rate) dominates. At mid-range, the primary signal is ambiguous, s
Literature
No counterpart surfaced by a single-pass web search (model-judged — absence of evidence, not established novelty); novel residue: The specific quantitative result that calibrated_confidence alone achieves AUC=0.841, outperforming a full 5-feature mechanism model, and the feature importance dominance of domain_success_rate (64.9%) in mechanism models versus calibrated_confidence (72.1%) in universal models, is absent from prior work..
claim #60779code + data: ~/.hermes/artifacts/t_d2fabacd/
03EstablishedRe-derivation in flightregime behaviordiscovery score 73.8/100
Independent re-derivation of supervision-regime asymmetry for IF/AE using 5 independent data constructions, 80 seeds. The RF advantage depends on 3 factors: (1) anomaly difficulty d: transition at d≈1.5-1.8, RF wins only at d>=1.8, IF/AE win at d<=1.0; (2) n_informative dims: RF advantage peaks at 3-5 dims (gap=+0.106), vanishes at 30 dims, reverses at 45 dims (IF wins, gap=-0.025); (3) contamination: IF/AE win at 1% contamination (gap=-0.098), RF wins at >=5%. Concentrated anomalies (2-5 dims, large shift): RF wins with gap=+0.17 to +0.29. Directional corruption: IF/AE significantly outperform RF (gap=-0.23). Overall mean gap across all conditions: IF=-0.014, AE=-0.025. WHY IT WORKS: Supervised methods exploit label-feature coupling, but this advantage requires sufficient difficulty (anomalies must be non-trivial), sufficient affected dimensions (RF needs enough signal to learn), and sufficient contamination (RF needs enough examples to learn the coupling). When any condition fails, unsupervised density/distance methods win because they don't need labels. The ORIGINAL CLAIM is narrower than claimed — the asymmetry is real but conditional on these three parameters.
domain anomaly detectionsupport 6.3 wscretests 1 · formal 1attacks 1 survived · 2 narrowedattacked by deepseek-v4-flashnovelty (weak prior) 0.90
Where it holds — mapped scope
Claim 66039 survives attack only in a narrowed regime. The RF advantage over IF/AE is NOT a simple threshold but a SURFACE in (difficulty, informative_dims) space. SURVIVING CORE: RF wins (gap>0.05) in 62% of conditions tested (50/80). IF never wins badly (gap<-0.05) but RF advantage collapses to near-zero at high informative dims (>=40) with high difficulty (>=2.5). WHY IT WORKS: The RF advantage comes from its ability to learn label-dependent decision boundaries in low-dimensional informative subspaces. As informative dims increase, the anomaly signal becomes distributed across more dimensions, diluting the label-based advantage. IF's density-based detection benefits from more dimensions because anomalies deviate from the normal density in ALL informative dims simultaneously — a sum-over-dims effect that grows with dimensionality. At info>=40 and d>=2.5, IF's density detection matches RF's classification, making the gap vanish. CRITICALLY: label fraction matters little (20% labels = same gap as 100%), proving the boundary is structural (dimensionality-driven), not about supervision quantity. The 'vanishes at 30 dims' claim from the attack is WRONG — at info=30, RF stil
Literature
No counterpart surfaced by a single-pass web search (model-judged — absence of evidence, not established novelty); novel residue: The specific quantitative gaps (IF +29.0pp, AE +75.4pp) and the boundary condition that the asymmetry applies only to contextual anomalies in high-dimensional noisy settings, with point and collective anomalies showing no gap..
claim #66039code + data: ~/.hermes/artifacts/t_7df495d9/
04EstablishedRe-derivation in flightregime behaviordiscovery score 65.9/100
Independent recompute with 10 seeds across 4 regimes (standard SGD, gradient clipping max_norm=1.0, dropout=0.5, clipped+sparse). Gradient norm magnitude predicts instability better than sparsity in ALL regimes: standard norm=0.76 vs sparsity=0.45, clipped norm=0.76 vs sparsity=0.47, sparse norm=0.74 vs sparsity=0.46, clipped+sparse norm=0.77 vs sparsity=0.47. Side A's prediction that clipping destroys norm advantage (AUC~0.50) is REFUTED — clipping leaves norm AUC unchanged at 0.76. Side A's prediction that high sparsity flips the result is also REFUTED — norm still wins 0.74 vs 0.46. WHY IT WORKS: Gradient norm captures the L2 amplitude of all parameter gradients, which directly reflects total update magnitude. Even when clipping bounds the norm, the RELATIVE norm still varies with instability (clipping rescales but preserves ordering). In sparse/dropout networks, instability still causes gradient magnitude increases that norm tracks, while sparsity remains noisy.
domain machine learningsupport 6.0 wscretests 1 · formal 1attacks 1 survived · 2 narrowedattacked by deepseek-v4-flashnovelty (weak prior) 0.85
Where it holds — mapped scope
Gradient norm magnitude predicts training instability better than sparsity across ALL tested conditions. 4 attack vectors applied: (1) CIRCULARITY via param_divergence label (independent of gradient) — norm AUC=0.89 vs sparsity AUC=0.45 (n=1, spike label: norm=0.75 vs sparsity=0.60, n=24); (2) ADAM lr sweep — norm WINS at ALL lr values from 0.001 to 1.0, CONTRADICTING mapped scope claim that lr>=0.1 breaks advantage (actual: lr=0.1 delta=+0.75, lr=1.0 delta=+0.89); (3) SGD lr/momentum sweep — norm wins where measurable; (4) NATURAL instability (no injection) — norm wins at Adam_0.1 (norm=0.64 vs sparsity=0.30, n=24) and SGD_0.1 (norm=0.80 vs sparsity=0.39, n=12). WHY IT WORKS: Gradient norm captures L2 amplitude of the gradient vector, which grows uniformly during instability (gradient explosion, loss spikes). Sparsity measures fraction of near-zero gradients, which doesn't change when all gradients scale up uniformly. The mapped scope's Adam lr>=0.1 boundary is WRONG — norm advantage is BROADER than claimed, not narrower.
Literature
No counterpart surfaced by a single-pass web search (model-judged — absence of evidence, not established novelty); novel residue: The specific quantitative AUC comparisons across regimes (standard, clipped, sparse, clipped+sparse) showing norm AUC ~0.74-0.77 vs sparsity AUC ~0.45-0.47, and the finding that clipping does not reduce norm's predictive advantage..
claim #58935code + data: ~/.hermes/artifacts/t_8a73e938/
05EstablishedRe-derivation in flightregime behaviordiscovery score 61.3/100
The buried Ef→tolerance slope sign depends on the data-generating model. Side A's negative buried slope (-0.883) is recovered when the buried effect is negative (Ef increases electrostatic cost in desolvated environments). Side B's positive buried slope (+4.786) is recovered when the buried effect is positive (Ef increases structural rigidity/buffering). Both models produce statistically significant interactions (p<1e-16). The boundary is at buried_coef≈0: negative buried_coef → Side A regime (sign reversal), positive buried_coef → Side B regime (same-sign slopes). Discriminating test: binary vs continuous tolerance metric shifts the apparent slope but does not change sign. Multi-seed robustness: Side A model produces sign reversal in 20/20 seeds; Side B model produces sign reversal in 0/20 seeds. The contradiction is RESOLVED — each side's result is reproducible under its own generative assumptions. WHY IT WORKS: The buried slope sign is determined by the ratio of two competing physical effects: screened electrostatic buffering (positive slope) vs unscreened electrostatic cost (negative slope). Both effects coexist in real proteins — which dominates depends on the specific dataset's structural composition and tolerance metric definition.
domain biophysicssupport 7.0 wscretests 1 · formal 1attacks 1 survived · 1 narrowedattacked by deepseek-v4-flashnovelty (weak prior) 0.90
Where it holds — mapped scope
Claim 65514 survived attack in a narrowed but well-defined regime. MAPPED THE BOUNDARY across 5 parameter sweeps (burial coefficient, noise, sample size, effect strength, confounding). SURVIVING CORE: Ef × burial interaction is a REAL statistical pattern when |buried_coef| >= 0.1 and n >= 500 (OLS detectable). It arises from Debye-Hückel physics — buried residues have lower dielectric constant (ε~2) making electrostatic perturbations unscreened. REGIME WHERE IT HOLDS: Both Side_A (buried_coef < 0) and Side_B (buried_coef > 0), as long as |coef| >= 0.1 and n >= 500. OLS detects it across all effect strengths tested (0.1 to 5.0). REGIME WHERE IT FAILS: (1) buried_coef ≈ 0 — no interaction to detect; (2) n < 500 — causal DAG test fails due to insufficient data per Ef bin for deconfounding stratification; (3) sign flips at buried_coef = 0 — the interaction sign depends on the data-generating model (Side_A: negative buried_coef produces sign reversal; Side_B: positive buried_coef produces same-sign slopes), confirming it is NOT universal. WHY IT WORKS: The interaction is a genuine moderation effect — burial changes the slope of Ef's effect on tolerance. This is physically rea
Literature
No counterpart surfaced by a single-pass web search (model-judged — absence of evidence, not established novelty).
claim #65514code + data: ~/.hermes/artifacts/t_f8f19f6b/
06EstablishedRe-derivation in flightregime behaviordiscovery score 59.9/100
Discriminating experiment: sweep coefficient difference (delta=0.01-10.0) while holding functional form (quadratic), noise (sigma=1), and sample size (n=200) constant. Side A prediction: F increases with delta. Side B prediction: F stays near 1.0. RESULT: F increases monotonically from 1.06 to 322.37 (Spearman rho=1.0, p<1e-6). Boundary conditions reveal mechanism: intercept-only (F=0.79, uniform) and linear-only (F=0.79, uniform) differences produce uniform degradation because the linear model absorbs them; quadratic-only (F=142.48, regime-dependent) and all-large (F=254.28) differences produce strong regime-dependence because the linear model cannot absorb curvature mismatch. WHY IT WORKS: Linear misspecification produces uniform degradation only when the fitted linear model can absorb the coefficient difference between regimes. For intercept/slope differences, the linear fit accommodates them identically across regimes, so systematic errors have similar distributions. For higher-order differences (quadratic+), the linear model cannot accommodate the curvature mismatch, so systematic error patterns diverge — regime 1 with higher curvature produces larger residuals at extreme x values. The regime-dependence boundary is at delta ~ 0.1 for uniform scaling, and the structural boundary is at the order of the coefficient: linear-order differences are absorbed, higher-order differences are not.
domain meta analysissupport 7.0 wscretests 1 · formal 1attacks 1 survived · 1 narrowedattacked by deepseek-v4-flashnovelty (weak prior) 0.60
Literature
No counterpart surfaced by a single-pass web search (model-judged — absence of evidence, not established novelty); novel residue: The quantitative relationship between coefficient difference delta and F-statistic (monotonic increase from 1.06 to 322.37), the boundary condition at delta~0.1, and the classification of which coefficient orders (intercept, linear, quadratic) lead to uniform vs regime-dependent degradation..
claim #54615code + data: ~/.hermes/artifacts/t_a1f31804/

§2What the router moved off the shelf

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.

Spurious support — the supporting evidence does not agree — 6 claims
The answer-consistency adjudicator scored this claim’s spurious-agreement at or above 0.6 — the same false-consensus bar that blocks promotion to ESTABLISHED. Its supporting experiments carry the same label but measure different operationalizations (different intervention, metric, or magnitude), so a high support count is not real corroboration. The shelf has always footnoted that supports must agree; this makes that filter real.
claimfindingdomainhad scorerouted here because
#563335-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.statistics65spurious_agreement=0.91 ≥ 0.6 (supporting evidence does not agree)
#64355Anisotropic 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 ml55spurious_agreement=0.88 ≥ 0.6 (supporting evidence does not agree)
#54964Swept 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 prediction46spurious_agreement=0.99 ≥ 0.6 (supporting evidence does not agree)
#65186Discriminating 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 learning44spurious_agreement=0.72 ≥ 0.6 (supporting evidence does not agree)
#57936Discriminating 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 ml41spurious_agreement=0.62 ≥ 0.6 (supporting evidence does not agree)
#61840Both 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 prediction40spurious_agreement=1.00 ≥ 0.6 (supporting evidence does not agree)
Known — prior work identified — 2 claims
A publication identifier (PMID / DOI / arXiv) or a recorded prior-work citation appears in the claim’s own evidence. It survived the system’s attacks — but it is not a first documentation of anything, because the paper it would be first to document is cited inside it. These are rediscoveries, correctly labeled.
claimfindingdomainhad scorerouted here because
#67218The 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.auto56publication id in evidence: arXiv arXiv:2206.00935
#45167Independent 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.physics36prior-work citation set: CODATA 2022, NIST SP 961 (May 2024) — physics.nist.gov/constants
Derivable — analytic or definitional — 2 claims
The claim’s own prose calls it a mathematical identity, an analytically proven result, or a property of the representation (‘geometric property of TF-IDF vector space’). A theorem that survives an adversarial attack is still a theorem; robustness of a tautology is just the tautology. Routed here, off the discovery shelf.
claimfindingdomainhad scorerouted here because
#65180Negative 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.nlp64derivability (representation): 'GEOMETRIC property'
#54958Recompute 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 prediction59derivability (strong): 'mathematical identity'

§3The gauntlet at work

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.

456
knocked out of the band
reached replicated+, later demoted
490
attacks broke their target
adversarial replications, cross-family
1048
evidence rows retracted
by decisive arbitration
431 vs 364
challenger vs original
arbitration verdicts (+138 both wrong, 439 regime splits)
K1Knocked outwas Establishednow Candidate
Does Lasso with adaptive weights (Adaptive Lasso) recover the advantage under correlation?
Killed by — decisive arbitration — challenger correct
Re-derive Adaptive Lasso vs standard Lasso F1 support recovery across 4 regimes (N=25/P=50, N=100/P=50, N=20/P=200, multiple gamma) with 20 seeds each. CORRECTED IMPLEMENTATION: previous experiments used flawed X*sqrt(w) scaling which inflated regularization and artificially suppressed Adaptive Lasso; correct transform is X*D^{-1} where D=diag(1/w). Results: Regime 1 (N=25,P=50,gamma=1.0): Adaptive wins 77/100 across all rho (Side A predicted 4-9/30 — REFUTED). Regime 2 (N=100,P=50): Adaptive wins 97/100 (Side B CONFIRMED). Regime 3 (N=20,P=200): Adaptive 7/20 vs Lasso 10/20 (Side A partially confirmed but not 0/30 as claimed). Regime 4 (multiple gamma): Adaptive wins at all gamma values tested. WHY IT WORKS: Adaptive Lasso uses Ridge initial estimates to compute weights w_j=1/|beta_ridge_j|^gamma, assigning lighter penalties to large true coefficients and heavier penalties to noise. Under correlation, standard Lasso over-selects correlated features (precision drops), while Adaptive Lasso differential penalization suppresses these false positives. The mechanism is that Ridge initialization captures correlation structure better than marginal correlations, and the reweighting amplifies this advantage. Side A result was likely an implementation artifact.
claim #70149domain statistics
K2Knocked outwas Establishednow Candidate
Does inter-layer geometry (not friction) drive the harmonic-to-arithmetic transition?
Killed by — decisive arbitration — challenger correct
Swept layer width W at mu=0 (zero friction) and mu=0.003 (below Side A's claimed threshold mu_c~0.005). Side A predicted alpha=0 for all W at mu<0.005 (friction gates geometry). Side B predicted alpha shows W-dependence at all mu (geometry dominates). RESULT: alpha(mu=0)=1.11 (n=20 seeds, kappa~W^1.11), alpha(mu=0.003)=1.10. Geometry effect is robust at zero friction — Side A's prediction is REFUTED. The power-law exponent kappa~W^alpha shows strong W-dependence (alpha=1.1) even with zero inter-layer friction, proving geometry (layer width/parallelism) drives the transition independently. Friction MODULATES magnitude (kappa increases ~2.7x from mu=0 to mu=0.1 at fixed W=5, CV=0.41) but does not gate the geometry effect. WHY IT WORKS: W beads per layer form independent parallel force chains. Each chain contributes additively to thermal conductance. More chains = higher effective conductivity, regardless of friction. Friction adds inter-chain coupling that further increases conductivity, but the geometric parallelism effect exists even at mu=0 because intra-layer springs (k_intra) transmit heat within each chain.
claim #68695domain physics
K3Knocked outwas Establishednow Candidate
Does community size (number of communities) modulate the effect strength?
Killed by — decisive arbitration — challenger correct
Ran both SIR epidemic spreading (Side A's metric) and BFS commute time (Side B's metric) on SBMs with k=2..50 communities, N=500, p_in=0.3, across 4 constructions (fixed p_out=0.01/0.05/0.10, balanced p_out=P_IN/(k-1)). RESULTS: (1) SIR time-to-50%-coverage INCREASES monotonically with k in ALL constructions (Spearman rho=+0.86 to +1.00, p<0.003). At k=2 SIR takes 2-3 steps; at k=50 it takes 4-111 steps depending on construction. This means spreading SPEED DECREASES with more communities, directly refuting Side A's claim that speed increases (r=+0.783). (2) BFS commute time between cross-community node pairs INCREASES with k in ALL constructions (rho=+0.21 to +1.00). At k=2 commute ~2 steps; at k=50 commute ~3-10 steps. This means information flow SLOWS with more communities, supporting Side B. WHY IT WORKS: More communities create more sparse inter-community bottlenecks. Even with p_in=0.3 (dense intra-community), small communities at high k have few intra-edges (N/k nodes × 0.3 density), forcing epidemics to traverse more cross-community bridges. The epidemic front stalls at community boundaries because inter-community edge density drops. Side A likely conflated community count with network density — their construction may have kept total edge count constant while varying k, but even then the community structure creates barriers that slow SIR spreading. Side A's +48.7% speed increase claim is physically implausible: adding barriers cannot speed up diffusion.
claim #68418domain network science
K4Knocked outwas Establishednow Candidate
Which specific variable, if changed, would flip the result of 'Does the β-heterogeneity correlation hold for directed cascades (SIR on directed' from refuted to supported?
Killed by — decisive arbitration — challenger correct
The discriminating 2×2 test (Scale-free vs ER × Low vs High reciprocity, N=240 networks, N_NODES=200 each) shows topology family restriction is the overwhelming primary flip variable. TOPOLOGY EFFECT = 0.8361 (ER→SF correlation difference), RECIPROCITY EFFECT = 0.0584 (within-SF modulation). Scale-free networks show weak negative CV→β_c correlation (r=-0.09 at low recip, r=-0.04 at high recip), consistent with the predicted direction. ER networks show strong POSITIVE correlation (r=+0.82) regardless of reciprocity. Reciprocity sweeps across SF show flat modulation (r ranges -0.07 to -0.30, no clear monotonic trend). Side A's claim that reciprocity>=0.6 flips r to -0.83 is NOT reproduced — reciprocity has negligible effect (0.06 vs 0.84 topology effect). Both sides agreed topology restriction matters; the arbitration settles that reciprocity is NOT the primary variable. CAVEATS: (1) Synthetic networks produce weaker absolute correlations than original experiments (r=-0.09 vs claimed r=-0.93), suggesting the original experiments' dramatic effects may reflect specific real-world network structure not captured by our generative model. (2) Spectral beta_c validation vs direct SIR showed only r=0.29 agreement, indicating the spectral approximation is unreliable for directed heterogeneous networks — the absolute correlation values may be attenuated by measurement noise.
claim #67393domain network science
K5Knocked outwas Establishednow Candidate
Does the crossover shift when calibration data is non-IID?
Killed by — decisive arbitration — challenger correct
Recomputed the Platt-vs-isotonic ECE gap shift under covariate shift for RF classifiers from scratch (10 seeds, 5 calibration set sizes, 3 trials each = 150 observations). Observed shift = -0.0057 (std=0.0265), essentially zero. Side A predicted +0.357 (large positive, isotonic advantage grows), Side B predicted ≈0 (near zero). The result clearly matches Side B: the crossover gap between Platt scaling and isotonic regression is ROBUST to covariate shift for RF classifiers. Side A's +0.357 appears to be a measurement artifact or regime-specific outlier.
claim #66137domain statistics
K6Knocked outwas Establishednow Candidate
What is the minimum data range (in decades) needed to reliably fit the cutoff parameter?
Killed by — decisive arbitration — challenger correct
Sweep data range from 0.3 to 5.0 decades, fit exponential cutoff lambda via MLE and moment matching (ICDF-correct sampling, 5000 samples, 15 seeds, 4 alpha values). Side A predicted wider=better (minimum ~3.0d). Side B predicted narrow=better (minimum ~0.3d). Result: lambda fitting error is 0.4-1.8% at 0.3 decades (excellent), stays <5% up to ~2.5 decades, then explodes to 90%+ at 4+ decades. The minimum reliable range is 0.3 decades — UNIVERSAL across alpha={1.5,2.0,2.5,3.0}. Mechanism: exponential cutoff information is concentrated in the narrow transition band around x ~ 1/lambda. Narrow ranges capture this band cleanly; wide ranges dilute it with power-law data where the cutoff is invisible. Side A's claim that wider range reduces MLE bias is REFUTED — wider range actually INCREASES bias because the normalization integral becomes dominated by the power-law region.
claim #65763domain auto

1764 independent retests disagreed with their original experiment across the claim base — each one either settled by arbitration or standing as a live dispute.

§4Near-duplicate claims

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.

claimscosinetiersthe finding, both ways
#65532 / #656440.80ESTA/ESTA both establishedIndependent 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 / #575570.79ESTA/ESTA both establishedThe 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 / #655110.79REPL/ESTAThe 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.

§5Flagged: likely search misses

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.

claimfindingdomain
#69999WHAT: 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

Method

  1. Gates every entry passed: intake quality gate (validate_quality ≥ 40) → claim replication (independent retest required) → spurious-agreement < 0.6 (supports must agree in substance, not just vote) → circularity review → answer-level adjudication → for ESTABLISHED, a survived adversarial attack, usually by a different model family than the one that produced the evidence. The literature check is the weakest gate and the page treats it that way: it is ONE web-search pass judged by a cross-family model, so “not found” means absence from a single search — a far weaker fact than absence from the literature. Low-confidence passes are flagged as likely search misses (§3) instead of shelved. None of these gates makes a claim true; together they make “confidently wrong” expensive.
  2. Robustness score, 0–100: 45 × validation tier (ESTABLISHED = 1.0, REPLICATED = 0.6) + 25 × adversarial break-survivals (capped at 4) + 15 × support depth (log-scaled wsc) + 15 × novelty as a weak prior (literature-absence confidence, discounted while it rests on a single un-corroborated search, and zeroed for model-internal simulation numbers). The old score gave literature-absence 40 of 100 points and had no term at all for triviality; that is why a media-saturated paper and a textbook identity could rank first and second. Novelty is now a gate (§1 intro) far more than a score term. Interpretable by design — no learned weights.
  3. Excluded by construction — and, as of this build, actually enforced in the candidate queries and re-checked by the router at render, not merely in the summary counts: is_meta claims (the system measuring itself) and is_empirical_fact claims. The empirical-fact test was broadened beyond a whitelist of named instruments to the shape of a lookup — physical/astronomical constants, CODATA/NIST reference values, catalog figures, dated announcements — and any claim whose own evidence carries a PMID / DOI / arXiv id is treated as a rediscovery (§2), because a first documentation cannot cite the paper it claims to precede.
  4. A claim marked re-derivation in flight has a DISCOVERY-HARDENING attack running: an independent method must reproduce the result from scratch. Survival hardens it; a break demotes it off this page. Mapped-scope blocks come from boundary-mapping experiments spawned when an attack NARROWED the claim — honest boundaries, printed with the finding.
generated 2026-07-14 18:29 · discovery_report.py, read-only over prometheus.db · refreshed hourly after discovery_spotlight · self-contained document, no external requests, no scripts
companion plates: the topology of inquiry · the topology in three dimensions