{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:ZPPJYBPWMYSLYRN4SYW2B4QFWR","short_pith_number":"pith:ZPPJYBPW","schema_version":"1.0","canonical_sha256":"cbde9c05f66624bc45bc962da0f205b4567abbfa9f5c28ff93491d0969616591","source":{"kind":"arxiv","id":"2510.17551","version":3},"attestation_state":"computed","paper":{"title":"Towards Optimal Control and Algorithmic Structure of Decompression Schedules","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Benjamin Marsh","submitted_at":"2025-10-20T14:00:51Z","abstract_excerpt":"We formalise decompression planning as an optimal control problem with gas feasibility windows (ppO$_2$, END), affine ceilings, and convex penalties in normalised oversaturation. We prove existence, a monotone no re-descent structure and bang-bang ascents under a mild monotonicity assumption on inert fraction, and establish dwell time KKT conditions. We give pseudo-polynomial DP and label-setting algorithms with a priori error bounds, derive Lipschitz regularity of the online value function, and discuss multi-species extensions. The efficient frontier is continuous and generally nonconvex. We "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2510.17551","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-10-20T14:00:51Z","cross_cats_sorted":[],"title_canon_sha256":"a0e6b884b2fdf597b8cb1bba387a49faa504de46a3b4c10c1ebf597814310fb2","abstract_canon_sha256":"7243f586d9877eda4d0757972dde5eff39defe416984d7b39af678e52bab99d6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:44:33.050157Z","signature_b64":"e+7/r91B7zdCGFthQPoUAaqrjDC05179hN7viQQJ22Y8QCvcQAVpVicRbJjXRfKszN1BkiwSaLmhNfqhPN6LAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cbde9c05f66624bc45bc962da0f205b4567abbfa9f5c28ff93491d0969616591","last_reissued_at":"2026-05-18T02:44:33.049638Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:44:33.049638Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Towards Optimal Control and Algorithmic Structure of Decompression Schedules","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Benjamin Marsh","submitted_at":"2025-10-20T14:00:51Z","abstract_excerpt":"We formalise decompression planning as an optimal control problem with gas feasibility windows (ppO$_2$, END), affine ceilings, and convex penalties in normalised oversaturation. We prove existence, a monotone no re-descent structure and bang-bang ascents under a mild monotonicity assumption on inert fraction, and establish dwell time KKT conditions. We give pseudo-polynomial DP and label-setting algorithms with a priori error bounds, derive Lipschitz regularity of the online value function, and discuss multi-species extensions. The efficient frontier is continuous and generally nonconvex. We "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2510.17551","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2510.17551","created_at":"2026-05-18T02:44:33.049729+00:00"},{"alias_kind":"arxiv_version","alias_value":"2510.17551v3","created_at":"2026-05-18T02:44:33.049729+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2510.17551","created_at":"2026-05-18T02:44:33.049729+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZPPJYBPWMYSL","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZPPJYBPWMYSLYRN4","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZPPJYBPW","created_at":"2026-05-18T12:33:37.589309+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZPPJYBPWMYSLYRN4SYW2B4QFWR","json":"https://pith.science/pith/ZPPJYBPWMYSLYRN4SYW2B4QFWR.json","graph_json":"https://pith.science/api/pith-number/ZPPJYBPWMYSLYRN4SYW2B4QFWR/graph.json","events_json":"https://pith.science/api/pith-number/ZPPJYBPWMYSLYRN4SYW2B4QFWR/events.json","paper":"https://pith.science/paper/ZPPJYBPW"},"agent_actions":{"view_html":"https://pith.science/pith/ZPPJYBPWMYSLYRN4SYW2B4QFWR","download_json":"https://pith.science/pith/ZPPJYBPWMYSLYRN4SYW2B4QFWR.json","view_paper":"https://pith.science/paper/ZPPJYBPW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2510.17551&json=true","fetch_graph":"https://pith.science/api/pith-number/ZPPJYBPWMYSLYRN4SYW2B4QFWR/graph.json","fetch_events":"https://pith.science/api/pith-number/ZPPJYBPWMYSLYRN4SYW2B4QFWR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZPPJYBPWMYSLYRN4SYW2B4QFWR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZPPJYBPWMYSLYRN4SYW2B4QFWR/action/storage_attestation","attest_author":"https://pith.science/pith/ZPPJYBPWMYSLYRN4SYW2B4QFWR/action/author_attestation","sign_citation":"https://pith.science/pith/ZPPJYBPWMYSLYRN4SYW2B4QFWR/action/citation_signature","submit_replication":"https://pith.science/pith/ZPPJYBPWMYSLYRN4SYW2B4QFWR/action/replication_record"}},"created_at":"2026-05-18T02:44:33.049729+00:00","updated_at":"2026-05-18T02:44:33.049729+00:00"}