{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:D64RAUW7R7YAZ6W3LSXP4ZBMWV","short_pith_number":"pith:D64RAUW7","schema_version":"1.0","canonical_sha256":"1fb91052df8ff00cfadb5caefe642cb56c9d1e6fd11851577a4972273b7ca7bf","source":{"kind":"arxiv","id":"2502.06623","version":1},"attestation_state":"computed","paper":{"title":"Deferred-Decision Trajectory Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Behcet Acikmese, Purnanand Elango, Selahattin Burak Sarsilmaz","submitted_at":"2025-02-10T16:19:09Z","abstract_excerpt":"We present DDTO--deferred-decision trajectory optimization--a framework for trajectory generation with resilience to unmodeled uncertainties and contingencies. The key idea is to ensure that a collection of candidate targets is reachable for as long as possible while satisfying constraints, which provides time to quantify the uncertainties. We propose optimization-based constrained reachability formulations and construct equivalent cardinality minimization problems, which then inform the design of computationally tractable and efficient solution methods that leverage state-of-the-art convex so"},"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":"2502.06623","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-02-10T16:19:09Z","cross_cats_sorted":[],"title_canon_sha256":"44936c4e59fb1368821d31e72443dd8082c3b447cccb15a55ff2d60efa3b0254","abstract_canon_sha256":"a2404cdc20af48ba2c4e8a5e356200878c4876dc6118740bd0b5b76ce9ad1020"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:12:09.604621Z","signature_b64":"4nb97Rpq5gHa838+u7v3KL8IF7uKLVto3Fn5wl1YwtyHbfMZmyBh1ruIDGPvL5zzmt7gTO6nDlZHOI07GMnLCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1fb91052df8ff00cfadb5caefe642cb56c9d1e6fd11851577a4972273b7ca7bf","last_reissued_at":"2026-07-05T10:12:09.604097Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:12:09.604097Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Deferred-Decision Trajectory Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Behcet Acikmese, Purnanand Elango, Selahattin Burak Sarsilmaz","submitted_at":"2025-02-10T16:19:09Z","abstract_excerpt":"We present DDTO--deferred-decision trajectory optimization--a framework for trajectory generation with resilience to unmodeled uncertainties and contingencies. The key idea is to ensure that a collection of candidate targets is reachable for as long as possible while satisfying constraints, which provides time to quantify the uncertainties. We propose optimization-based constrained reachability formulations and construct equivalent cardinality minimization problems, which then inform the design of computationally tractable and efficient solution methods that leverage state-of-the-art convex so"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.06623","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2502.06623/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2502.06623","created_at":"2026-07-05T10:12:09.604157+00:00"},{"alias_kind":"arxiv_version","alias_value":"2502.06623v1","created_at":"2026-07-05T10:12:09.604157+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.06623","created_at":"2026-07-05T10:12:09.604157+00:00"},{"alias_kind":"pith_short_12","alias_value":"D64RAUW7R7YA","created_at":"2026-07-05T10:12:09.604157+00:00"},{"alias_kind":"pith_short_16","alias_value":"D64RAUW7R7YAZ6W3","created_at":"2026-07-05T10:12:09.604157+00:00"},{"alias_kind":"pith_short_8","alias_value":"D64RAUW7","created_at":"2026-07-05T10:12:09.604157+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.22277","citing_title":"Active Sensing and Deferred-Decision Trajectory Optimization for Robust Target Identification","ref_index":4,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/D64RAUW7R7YAZ6W3LSXP4ZBMWV","json":"https://pith.science/pith/D64RAUW7R7YAZ6W3LSXP4ZBMWV.json","graph_json":"https://pith.science/api/pith-number/D64RAUW7R7YAZ6W3LSXP4ZBMWV/graph.json","events_json":"https://pith.science/api/pith-number/D64RAUW7R7YAZ6W3LSXP4ZBMWV/events.json","paper":"https://pith.science/paper/D64RAUW7"},"agent_actions":{"view_html":"https://pith.science/pith/D64RAUW7R7YAZ6W3LSXP4ZBMWV","download_json":"https://pith.science/pith/D64RAUW7R7YAZ6W3LSXP4ZBMWV.json","view_paper":"https://pith.science/paper/D64RAUW7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2502.06623&json=true","fetch_graph":"https://pith.science/api/pith-number/D64RAUW7R7YAZ6W3LSXP4ZBMWV/graph.json","fetch_events":"https://pith.science/api/pith-number/D64RAUW7R7YAZ6W3LSXP4ZBMWV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/D64RAUW7R7YAZ6W3LSXP4ZBMWV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/D64RAUW7R7YAZ6W3LSXP4ZBMWV/action/storage_attestation","attest_author":"https://pith.science/pith/D64RAUW7R7YAZ6W3LSXP4ZBMWV/action/author_attestation","sign_citation":"https://pith.science/pith/D64RAUW7R7YAZ6W3LSXP4ZBMWV/action/citation_signature","submit_replication":"https://pith.science/pith/D64RAUW7R7YAZ6W3LSXP4ZBMWV/action/replication_record"}},"created_at":"2026-07-05T10:12:09.604157+00:00","updated_at":"2026-07-05T10:12:09.604157+00:00"}