Three-Photon Microscopy (chi-5 deep-tissue imaging) L1-023
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
Three-Photon Microscopy (chi-5 deep-tissue imaging): three photon nlo produces the measurement through a 3-node primitive DAG L.excitation.nonlinear_chi5 -> S.scan.raster -> int.temporal, with time-integrated exposure and photon-shot-noise-limited (Poisson counting). Recovery is posed as a non-convex inverse problem that inverts the forward operator to estimate the scene-side 3D intensity. Difficulty tier delta=10 with effective condition number kappa_eff~22; calibration-level mismatch (pulse_compression_drift, sample_scattering, long_wavelength_absorption) 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
- κ:
- 440
Existence of the recovered 3D intensity is guaranteed within the declared Omega bounds. Uniqueness is local rather than global (non-convex landscape); convergence depends on initialisation and priors. Stability is moderately conditioned (kappa_eff ~= 22); pulse_compression_drift dominates the stability cliff; sample_scattering 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:
- iterative maximum-likelihood (Richardson-Lucy class) [Richardson-Lucy-3P] | linear-operator + convex optimisation [TV-ADMM-3P] | linear-operator + deep neural prior [CARE-3P]
- Convergence rate q:
- 2
- Complexity:
- O(H * W * Z * log(...)) per iteration; learned variants: O(H W Z * F_theta_cost) per forward pass