Optimal Recovery of Cumulative Production under Decay: Sequential Convex Reduction, Window-Channel Contrasts, and Calibration Boundaries

Recovering cumulative unweighted production Q of a decaying species from finitely many noisy state readings requires balancing reciprocal survival amplification against time-ordering constraints. Although adaptive chronological policies range over infinite-dimensional trees of report-dependent query times on asymmetric monotone fibers—and even fixed survival schedules have indefinite survival-ratio Hessians—we prove that sequential adaptation confers zero worst-case advantage over fixed advance schedules under arbitrary known nonnegative integrable decay (including zero-loss plateaus) and unrestricted nonnegative synthesis. Eliminating the n − 1 intermediate nodes in closed form collapses n-step minimax design to a one-dimensional C¹ strictly convex program over the final survival coordinate v = rₙ for exact or prior-capped terminal readings (attained below saturation by an equal-additive-gap survival prefix plus a geometric survival tail), and to a two-dimensional convex polygon program over (b, v) under simultaneous interior and terminal errors (globally certified on fifteen rational instances within 1.0127 × 10⁻¹¹ B for program values and 2.9601 × 10⁻⁸ B for strictly legal schedules). Two targeted structural contrasts then delineate what breaks when either core hypothesis of this primary reduction is relaxed. First, replacing anchored state prefixes F(vᵢ) by prescribed pulse-window increments F(vᵢ) − F(uᵢ) breaks dense-sampling consistency without a synthesis cap—pooling unpulsed gaps into one blind mass unless the endpoint incidence graph is connected—while imposing a physical synthesis cap induces a three-phase dense-pulse bathtub limit, non-commuting capacity and duty limits, and certified non-monotone refinement (D₂ > D₁). Second, relaxing known decay to uncertain λ(t) preserves finite convex programs under pointwise bands or independent cell losses and O(m)-stage sweeps under pointwise-ordered families (with unconditional Lindemann–Weierstrass and Hermite–Lindemann sign certificates), whereas cross-cell cumulative-loss couplings create interior production gaps and all-rational SUBSET SUM NP-completeness.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-16
DOI
https://doi.org/10.5281/zenodo.24264577
Primary Topic
Control Systems and Identification
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Optimal Recovery of Cumulative Production under Decay: Sequential Convex Reduction, Window-Channel Contrasts, and Calibration Boundaries

Xu Cao, Wenxuan Xiao
Zenodo (CERN European Organization for Nuclear Research)
Control Systems and Identification
preprint

Optimal Recovery of Cumulative Production under Decay: Sequential Convex Reduction, Window-Channel Contrasts, and Calibration Boundaries

Xu Cao, Wenxuan Xiao
preprint en

Abstract

Recovering cumulative unweighted production Q of a decaying species from finitely many noisy state readings requires balancing reciprocal survival amplification against time-ordering constraints. Although adaptive chronological policies range over infinite-dimensional trees of report-dependent query times on asymmetric monotone fibers—and even fixed survival schedules have indefinite survival-ratio Hessians—we prove that sequential adaptation confers zero worst-case advantage over fixed advance schedules under arbitrary known nonnegative integrable decay (including zero-loss plateaus) and unrestricted nonnegative synthesis. Eliminating the n − 1 intermediate nodes in closed form collapses n-step minimax design to a one-dimensional C¹ strictly convex program over the final survival coordinate v = rₙ for exact or prior-capped terminal readings (attained below saturation by an equal-additive-gap survival prefix plus a geometric survival tail), and to a two-dimensional convex polygon program over (b, v) under simultaneous interior and terminal errors (globally certified on fifteen rational instances within 1.0127 × 10⁻¹¹ B for program values and 2.9601 × 10⁻⁸ B for strictly legal schedules). Two targeted structural contrasts then delineate what breaks when either core hypothesis of this primary reduction is relaxed. First, replacing anchored state prefixes F(vᵢ) by prescribed pulse-window increments F(vᵢ) − F(uᵢ) breaks dense-sampling consistency without a synthesis cap—pooling unpulsed gaps into one blind mass unless the endpoint incidence graph is connected—while imposing a physical synthesis cap induces a three-phase dense-pulse bathtub limit, non-commuting capacity and duty limits, and certified non-monotone refinement (D₂ > D₁). Second, relaxing known decay to uncertain λ(t) preserves finite convex programs under pointwise bands or independent cell losses and O(m)-stage sweeps under pointwise-ordered families (with unconditional Lindemann–Weierstrass and Hermite–Lindemann sign certificates), whereas cross-cell cumulative-loss couplings create interior production gaps and all-rational SUBSET SUM NP-completeness.

Zenodo (CERN European Organization for Nuclear Research)
Control Systems and Identification
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon
Optimal Recovery of Cumulative Production under Decay: Sequential Convex Reduction, Window-Channel Contrasts, and Calibration Boundaries — Xu Cao, Wenxuan Xiao · Zenodo (CERN European Organization for Nuclear Research) (2026) | TGRS Research Map | TGRS