Research tree: B5 parked (certifier complexity), B4 wording narrowed, B1 progress

Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
This commit is contained in:
ClaudeandClaude Opus 5.5 committed 2026-11-17 05:02:46 +00:00
1 parent db715e719a
commit 4c3d4815dd
1 file changed
+6 -2
+6 -2
View File
@@ -15,7 +15,7 @@ Rules:
| 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) |
| B5 | Sheet / paired-wall decomposition on real meshes | scope a relaxed general-domain certificate on paper; then try 10 Greif parts and report coverage and false connections | Mold, then Melt | OPEN |
| B5 | Sheet / paired-wall decomposition on real meshes | scope a relaxed general-domain certificate on paper; then try 10 Greif parts and report coverage and false connections | Mold, then Melt | PARKED (coverage unknown: certifier complexity cap) |
| B6 | Intrinsic coordinates (Laplace-Beltrami / spectral) as features | 50 parts: does a spectral feature explain A's residual (partial correlation on the learning folds only)? | MeltAssist lit, Melt run | OPEN |
| B7 | Order-aware objective (pairwise or rank loss) instead of pointwise L2 | small GBRT ranker on one fold: Kendall tau and last-fill location against A | MeltAssist / Melt | OPEN |
| B8 | Fresh hold-out from Greif v2 (42 parts, 40 new source tokens) | read-only LOG/YML, field validity and near-duplicate check | MeltAssist | PARKED (missing process provenance: v2 ZIP has 723 VTU and 0 LOG/YML, so no t_set) |
@@ -27,13 +27,17 @@ Rules:
| 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: **B5 PARKED (coverage unknown).** On 10 learning parts, 5 had no candidate; on the other 5, the first candidate hit the fixed 70000-operation complexity cap and came out UNKNOWN. 0 certified and 0 rejected; only 5/10 parts have a certified union that is complete and below .20, short of the >= 6/10 threshold.
- **Learned:** the relaxed paired-wall certifier is computationally infeasible on real Greif meshes at this cap. That is not a refutation of sheet decomposition.
- Reopen only with a new certifier design (no cap extension under this gate). Cost 133.7 CPU-s. Commit 6aa7baf6.
- 2026-11-17: B1 first-cell cost gate PASS (fit projection 3610 CPU-s); fits 01-04 running.
- 2026-11-17: **B3 result** (50 learning components):
- The true-field H0(-T) events are stable under recording-precision perturbation: precision/recall .954/.921 (0.001 grid) and .947/.915 (half grid), above the 0.80 gate.
- EIK against the truth: 244 TP, 16956 FP, 416 FN, so precision .014 and recall .370; median match distance .049 Rg.
- **Learned:** the eikonal field has a very large number of spurious topological events. This supports a stable diagnostic on this panel; it is not a weld-line validation.
- New branch B11 (topological cleaning).
- 2026-11-17: **B4 PRUNED (clock-only).** The post-hoc best monotone map of the fixed D_f potential gives a component-mean relative L2 of .0916, against A's .0664 on the same full-tet domain.
- **Learned:** a clock alone on this potential cannot reach A. A's advantage must come from *changing the order* (the potential), not the timing.
- **Learned (narrowed per MeltAstra):** A is not a member of the family of monotone scalar clocks on this fixed D_f, so that family alone cannot explain A's advantage. It does not attribute the advantage solely to order changes.
- This does not prune new potentials, branch information or learned ordering. Commit a6998f72; push pending.
- 2026-11-17: B1 contract e751e5b2 approved. **Branch decision rule** (grouped protocol, 100 % pool, paired component bootstrap, signs as H1 - A):
- EXPAND: upper bound of the relative-L2 difference < 0.001, **and** either the last-fill distance/Rg difference has its upper bound < 0 or the Kendall tau difference has its lower bound > 0.