Research tree: B1 parked (small field gain only), B10x/B14 parked, B15 started

Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
This commit is contained in:
ClaudeandClaude Opus 5.5 committed 2026-11-17 08:25:42 +00:00
1 parent 03f6fa2c8f
commit 0e165fc21a
1 file changed
+10 -3
+10 -3
View File
@@ -11,7 +11,7 @@ Rules:
| ID | Branch | Gate (cheapest falsifier) | Owner | Status |
|---|---|---|---|---|
| B1 | H1: residual on the eikonal volume map (t* - cF, same 19 features) | full run is cheap (<= 20 CPU-h) | spec Mold, run Melt | PROMOTED |
| B1 | H1: residual on the eikonal volume map (t* - cF, same 19 features) | full run is cheap (<= 20 CPU-h) | spec Mold, run Melt | PARKED (inconclusive under the fixed rule) |
| B2 | H2: geometry-aware operator on the H1 target | pilot <= 2 GPU-h with a cost gate | spec MeltAssist, run Melt | PROMOTED (after the B1 contract) |
| B3 | Arrival-field topology: dry-region H0(-T) maxima and saddles as last-fill / front-meeting diagnostics | on about 50 parts, compute the diagnostics from the true T and from the full-node EIK; check whether they are stable and whether EIK's critical points match the truth | spec Mold, run Melt | OPEN |
| B4 | Filling as a filtration: one scalar potential plus a monotone time map | oracle: the best per-part monotone map from the EIK potential to the true T; the remaining error is ordering error that no time map can fix | Mold / Melt | PRUNED (clock-only on a fixed potential cannot beat A) |
@@ -24,14 +24,21 @@ Rules:
| B11 | Topological cleaning of predicted fields: persistence simplification removes spurious extrema and saddles before the end-of-fill and event metrics | gate: on the B3 panel, apply a fixed persistence threshold to EIK, and later to the A/H1 full-node predictions, and check event precision, last-fill distance and tau (learning folds only) | Mold spec, Melt run | PRUNED (this fixed rule, all three arms) |
| B12 | Path-integrated flow-resistance features: along the gate-to-node path, the bottleneck (minimum) thickness, the integral of ds/h^2, and the number of junctions crossed. Flow-competition information that Gre24's 19 columns lack | gate: A plus these 3 columns on one grouped fold at the 100 % pool; field L2 and last-fill distance against A, paired CI | Mold spec, Melt run | PRUNED (this fixed recipe) |
| B13 | Region-context features without type matching (a covariate-controlled O1 precursor): means of F and D_w over generic connected regions at K = 8, added to A | gate: one fold. This is a cheap reference only: a null result does **not** close type-organised context, O1 or real connectivity, which stay independent open hypotheses | Mold spec, Melt run | EXPANDED (fold 0 field L2 improved) → E1 / E2 |
| B14 | Flow-splitting index: number of near-shortest path families (5 % of D_f) and non-largest family band-volume share | B12's fixed rule, one fold | Mold spec (c09d428d), Melt run | PROBING (parallel) |
| B14 | Flow-splitting index: number of near-shortest path families (5 % of D_f) and non-largest family band-volume share | B12's fixed rule, one fold | Mold spec (c09d428d), Melt run | PARKED (resource: projection 12672 CPU-s > 7200) |
| B15 | Learn the propagation cost, keep the solver: regress local speed f = 1/abs(grad T) (true T, learning folds only) from geometry features, then solve the eikonal with the predicted speed and map it to time with the volume clock | gate: one fold; field L2, last-fill distance and tau against A. The speed must be inferable at prediction time (no test-label velocity). Literature basis: EikoNet / Eikonal DeepONet factorisation (MeltAssist check) | Mold spec, Melt run | OPEN |
| B10x | Freeze/shrinkage validity gate (unparked as a cheap gate while compute is idle) | per-field validity on 20 v5 parts | Melt | PROBING |
| B10x | Freeze/shrinkage validity gate (unparked as a cheap gate while compute is idle) | per-field validity on 20 v5 parts | Melt | PARKED (physical definition and units missing) |
| P1 | O2 local tensor readings | — | — | PRUNED (S1, S2, S3-A: no gain on the current recipe) |
| P2 | Own graph flow-competition solver | — | — | PRUNED (infeasible: splu resource stop, GMRES numerical failure; the idea itself is untested) |
| P3 | O1 with size-matched K = 8 partitions | — | — | PRUNED (eligibility 23 %; lesson: control cut area as a covariate, do not match it) |
Log (newest first):
- 2026-11-17: **B1 / H1-RES final: PARK.** Grouped protocol, 100 % pool, 552 parts / 204 components.
- Field L2 (H1 - A): -0.00064, CI [-0.00114, -0.00016]. A small but real field improvement.
- Last-fill: +0.0065, CI crosses 0. Tau: -0.0001, CI crosses 0.
- Under the fixed rule it is neither EXPAND (no end-of-fill or order gain) nor PRUNE.
- **Learned:** a residual on c*F buys a small field gain only. Its size is similar to B13's on fold 0, so combining them is a candidate later, not now.
- Cost note: the topology diagnostics took about 11.3k CPU-s of the scoring; future contracts should budget for that.
- 2026-11-17: B10x PARKED (units and physical definition missing from the VTU attributes; 20/20 read). B14 PARKED_RESOURCE (projection 12672 CPU-s against the 7200 cap; not a refutation of the channel hypothesis). B15 started.
- 2026-11-17: **B13 EXPAND (fold 0).** Field relative L2 (new - A): -0.00163, CI [-0.00333, -0.00011]; that is .06323 against .06486, about 2.5 % relative.
- Last-fill distance/Rg: +0.082, CI [-0.036, +0.235], not improved and possibly worse.
- G coverage passes both 80 % gates; parts without a valid G keep NaN in the 2 new columns, and nothing was dropped. No Kendall tau in the frozen implementation (a gap, kept).