Spinning Disk Confocal (Nipkow) Microscopy L1-022
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
Spinning Disk Confocal (Nipkow) Microscopy: confocal pinhole array produces the measurement through a 3-node primitive DAG K.psf.confocal -> S.scan.nipkow -> int.temporal, with time-integrated exposure and Poisson signal noise + Gaussian read noise. Recovery is posed as a linear inverse problem that inverts the forward operator to estimate the scene-side 3D intensity. Difficulty tier delta=3 with effective condition number kappa_eff~7; calibration-level mismatch (disk_pattern_registration, pinhole_crosstalk, disk_speed_jitter) 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
- κ:
- 140
Existence of the recovered 3D intensity 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 well-conditioned (kappa_eff ~= 7); disk_pattern_registration dominates the stability cliff; pinhole_crosstalk and the remaining mismatch parameters contribute higher-order bias terms. Poisson signal noise + gaussian read noise sets the irreducible data-fidelity floor, while mild Tikhonov or analytic inversion is sufficient at the nominal Omega point.
Solvability C
- Solver class:
- iterative maximum-likelihood (Richardson-Lucy class) [Richardson-Lucy] | linear-operator + convex optimisation [TV-ADMM] | linear-operator + deep neural prior [CARE-SD]
- Convergence rate q:
- 2
- Complexity:
- O(H * W * Z * log(...)) per iteration; learned variants: O(H W Z * F_theta_cost) per forward pass