Cone-Beam CT (CBCT) — dental / interventional L1-038
Unclaimed Principle — open for contribution
This Principle is declared in the catalog but has no reference solver, no pinned dataset, and is not registered on-chain. There is no reward pool. Submitting a cert against this Principle today will record the cert for reproducibility but pay zero PWM.
To claim it as a Bounty #7 contribution: open a PR adding (1) a reference solver, (2) ≥1 dataset pinned to IPFS, (3) updates to the L3 manifest with dataset CIDs. After verifier-agent triple-review, the founders' 3-of-5 multisig signs PWMRegistry.register() and the Principle becomes mineable.
Forward model E
Cone-Beam CT (CBCT) — dental / interventional: xray ct produces the measurement through a 5-node primitive DAG L.xray_source -> L.cone_beam_geometry -> S.scan.angular -> L.FDK_backproject -> int.angular, with multi-angle tomographic integration and photon-shot-noise-limited (Poisson counting). Recovery is posed as a linear inverse problem that inverts the forward operator to estimate the scene-side 3D attenuation. Difficulty tier delta=5 with effective condition number kappa_eff~20; calibration-level mismatch (scatter, truncation, beam_hardening) sets the accuracy floor at the Omega boundary. See the forward_model field for the closed-form imaging equation.
L-DAG
Well-posedness W
- Existence:
- true
- Uniqueness:
- true
- Stability:
- conditional
- κ:
- 400
Existence of the recovered 3D attenuation is guaranteed within the declared Omega bounds. Uniqueness holds on the measurement-supported subspace; out-of-support modes are controlled by the declared priors. Stability is moderately conditioned (kappa_eff ~= 20); scatter dominates the stability cliff; truncation and the remaining mismatch parameters contribute higher-order bias terms. Photon-shot-noise-limited (poisson counting) sets the irreducible data-fidelity floor, while TV / wavelet-sparsity / deep priors stabilise recovery at the ill-conditioned end of Omega.
Solvability C
- Solver class:
- linear-operator + convex optimisation [FDK] | iterative projection (ADMM / GAP) + optimisation [Iterative-CBCT] | linear-operator + deep neural prior [CBCT-Net]
- Convergence rate q:
- 2
- Complexity:
- O(H * W * Z * log(...)) per iteration; learned variants: O(H W Z * F_theta_cost) per forward pass