{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:3LBCOOYTDBEZY5ATVQTYKQPNCB","short_pith_number":"pith:3LBCOOYT","schema_version":"1.0","canonical_sha256":"dac2273b1318499c7413ac278541ed1050bc03365688e95ed96a4616f23c0be0","source":{"kind":"arxiv","id":"2403.04062","version":3},"attestation_state":"computed","paper":{"title":"Chance-Constrained Control for Safe Spacecraft Autonomy: Convex Programming Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.RO","cs.SY","eess.SY"],"primary_cat":"math.OC","authors_text":"Kenshiro Oguri","submitted_at":"2024-03-06T21:27:31Z","abstract_excerpt":"This paper presents a robust path-planning framework for safe spacecraft autonomy under uncertainty and develops a computationally tractable formulation based on convex programming. We utilize chance-constrained control to formulate the problem. It provides a mathematical framework to solve for a sequence of control policies that minimizes a probabilistic cost under probabilistic constraints with a user-defined confidence level (e.g., safety with 99.9% confidence). The framework enables the planner to directly control state distributions under operational uncertainties while ensuring the vehic"},"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":"2403.04062","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-03-06T21:27:31Z","cross_cats_sorted":["cs.RO","cs.SY","eess.SY"],"title_canon_sha256":"ab6b2ed212e81fe6fec5212a89dde9642d77bc5b9c07054afb704607381b8f88","abstract_canon_sha256":"0801b64c9273723c885dad4552b7693c7fe741036726e7dad844cd4a2384fe0b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:09:13.298010Z","signature_b64":"NBmpCwFRJ8XMy73H56ODH+k7VY2HpFkzn2nXL9dbVdAGFQpS4ytVH0sGqpTw5xc959QxaRJ3FK7c0kQwx/ZdDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dac2273b1318499c7413ac278541ed1050bc03365688e95ed96a4616f23c0be0","last_reissued_at":"2026-07-05T08:09:13.297590Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:09:13.297590Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Chance-Constrained Control for Safe Spacecraft Autonomy: Convex Programming Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.RO","cs.SY","eess.SY"],"primary_cat":"math.OC","authors_text":"Kenshiro Oguri","submitted_at":"2024-03-06T21:27:31Z","abstract_excerpt":"This paper presents a robust path-planning framework for safe spacecraft autonomy under uncertainty and develops a computationally tractable formulation based on convex programming. We utilize chance-constrained control to formulate the problem. It provides a mathematical framework to solve for a sequence of control policies that minimizes a probabilistic cost under probabilistic constraints with a user-defined confidence level (e.g., safety with 99.9% confidence). The framework enables the planner to directly control state distributions under operational uncertainties while ensuring the vehic"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.04062","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2403.04062/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":"2403.04062","created_at":"2026-07-05T08:09:13.297646+00:00"},{"alias_kind":"arxiv_version","alias_value":"2403.04062v3","created_at":"2026-07-05T08:09:13.297646+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.04062","created_at":"2026-07-05T08:09:13.297646+00:00"},{"alias_kind":"pith_short_12","alias_value":"3LBCOOYTDBEZ","created_at":"2026-07-05T08:09:13.297646+00:00"},{"alias_kind":"pith_short_16","alias_value":"3LBCOOYTDBEZY5AT","created_at":"2026-07-05T08:09:13.297646+00:00"},{"alias_kind":"pith_short_8","alias_value":"3LBCOOYT","created_at":"2026-07-05T08:09:13.297646+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.03424","citing_title":"An Efficient Non-Gaussian Chance Constraint Method for Stochastic Nonlinear Problems in Spaceflight","ref_index":2,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3LBCOOYTDBEZY5ATVQTYKQPNCB","json":"https://pith.science/pith/3LBCOOYTDBEZY5ATVQTYKQPNCB.json","graph_json":"https://pith.science/api/pith-number/3LBCOOYTDBEZY5ATVQTYKQPNCB/graph.json","events_json":"https://pith.science/api/pith-number/3LBCOOYTDBEZY5ATVQTYKQPNCB/events.json","paper":"https://pith.science/paper/3LBCOOYT"},"agent_actions":{"view_html":"https://pith.science/pith/3LBCOOYTDBEZY5ATVQTYKQPNCB","download_json":"https://pith.science/pith/3LBCOOYTDBEZY5ATVQTYKQPNCB.json","view_paper":"https://pith.science/paper/3LBCOOYT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2403.04062&json=true","fetch_graph":"https://pith.science/api/pith-number/3LBCOOYTDBEZY5ATVQTYKQPNCB/graph.json","fetch_events":"https://pith.science/api/pith-number/3LBCOOYTDBEZY5ATVQTYKQPNCB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3LBCOOYTDBEZY5ATVQTYKQPNCB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3LBCOOYTDBEZY5ATVQTYKQPNCB/action/storage_attestation","attest_author":"https://pith.science/pith/3LBCOOYTDBEZY5ATVQTYKQPNCB/action/author_attestation","sign_citation":"https://pith.science/pith/3LBCOOYTDBEZY5ATVQTYKQPNCB/action/citation_signature","submit_replication":"https://pith.science/pith/3LBCOOYTDBEZY5ATVQTYKQPNCB/action/replication_record"}},"created_at":"2026-07-05T08:09:13.297646+00:00","updated_at":"2026-07-05T08:09:13.297646+00:00"}