{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:W2XVKBDZMHM3G4LAXHTWSUWVPQ","merge_version":"pith-open-graph-merge-v1","event_count":3,"valid_event_count":3,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"14dbba6f9d0c0517e71995bc8209c446ed0eb0675fc87dc4745ab1a1b70a467a","cross_cats_sorted":["cs.SY","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2026-05-08T09:57:48Z","title_canon_sha256":"a7d8f76bc4385bab06690486ee6a359101a2c4d1afbfdd5ad971587c5b66a4d1"},"schema_version":"1.0","source":{"id":"2605.07529","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.07529","created_at":"2026-06-10T01:10:03Z"},{"alias_kind":"arxiv_version","alias_value":"2605.07529v2","created_at":"2026-06-10T01:10:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.07529","created_at":"2026-06-10T01:10:03Z"},{"alias_kind":"pith_short_12","alias_value":"W2XVKBDZMHM3","created_at":"2026-06-10T01:10:03Z"},{"alias_kind":"pith_short_16","alias_value":"W2XVKBDZMHM3G4LA","created_at":"2026-06-10T01:10:03Z"},{"alias_kind":"pith_short_8","alias_value":"W2XVKBDZ","created_at":"2026-06-10T01:10:03Z"}],"graph_snapshots":[{"event_id":"sha256:3b18520396cb21d614f5967d0d025be24bfae09543e8a33e22a7414fa12b37a6","target":"graph","created_at":"2026-06-10T01:10:03Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"the proposed method can exploit the coupling between trajectory design and orbit determination to obtain navigation-aware solutions with substantially lower fuel consumption than those from deterministic local optimization starting from the same initial guess"},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The belief dynamics accurately capture the dependence of covariance propagation on the nominal trajectory and that the stochastic differential dynamic programming iterations converge to a solution that respects all general mission constraints without separation of estimation and control"},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"A new stochastic differential dynamic programming method optimizes coupled trajectory design and orbit determination under partial observability, producing navigation-aware solutions with lower fuel consumption than deterministic local optimization in examples like the circular restricted three-body"},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"A stochastic differential dynamic programming algorithm optimizes spacecraft trajectories under partial observability by jointly handling control and belief-state evolution."}],"snapshot_sha256":"4f38fb6162e4a5683227cfeae1a07852630d32d9aa9c6e5f799caa4a77385dc0"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"3265807c0282af0d6b5739d64fa1995385567804f9e96d4c8c4b81fa3dac3b41"},"integrity":{"available":true,"clean":false,"detectors_run":[{"findings_count":0,"name":"claim_evidence","ran_at":"2026-05-20T10:42:02.877116Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-20T05:41:04.340476Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_title_agreement","ran_at":"2026-05-19T16:31:18.677503Z","status":"completed","version":"1.0.0"},{"findings_count":1,"name":"doi_compliance","ran_at":"2026-05-19T11:42:48.773265Z","status":"completed","version":"1.0.0"}],"endpoint":"/pith/2605.07529/integrity.json","findings":[{"audited_at":"2026-05-19T11:42:48.773265Z","detected_arxiv_id":null,"detected_doi":"10.1061/(asce","detector":"doi_compliance","finding_type":"broken_identifier","note":"DOI '10.1061/(asce' as printed in the bibliography is syntactically invalid and cannot resolve.","ref_index":2,"severity":"critical","verdict_class":"incontrovertible"}],"snapshot_sha256":"8cb6e478a315fb154aecd19ccabcf1c2e0cdec4328e16a028e37e769e16ccb7e","summary":{"advisory":0,"by_detector":{"doi_compliance":{"advisory":0,"critical":1,"informational":0,"total":1}},"critical":1,"informational":0}},"paper":{"abstract_excerpt":"Designing spacecraft trajectories remains challenging in the presence of stochastic effects such as maneuver execution errors and observation uncertainties. Although covariance control and belief-space planning provide useful tools for designing robust control policies and information-aware trajectories under uncertainty, practical methods remain limited for partially observable trajectory optimization problems in which trajectory design, orbit determination, and correction maneuver planning are tightly coupled. This paper presents a stochastic differential dynamic programming algorithm for su","authors_text":"Masahiro Fujiwara, Naoya Ozaki","cross_cats":["cs.SY","math.OC"],"headline":"A stochastic differential dynamic programming algorithm optimizes spacecraft trajectories under partial observability by jointly handling control and belief-state evolution.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2026-05-08T09:57:48Z","title":"Stochastic Differential Dynamic Programming for Trajectory Optimization under Partial Observability"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.07529","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-11T01:55:59.543450Z","id":"9d82ed97-e775-4a0f-988f-886b12dd6848","model_set":{"reader":"grok-4.3"},"one_line_summary":"A new stochastic differential dynamic programming method optimizes coupled trajectory design and orbit determination under partial observability, producing navigation-aware solutions with lower fuel consumption than deterministic local optimization in examples like the circular restricted three-body","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"A stochastic differential dynamic programming algorithm optimizes spacecraft trajectories under partial observability by jointly handling control and belief-state evolution.","strongest_claim":"the proposed method can exploit the coupling between trajectory design and orbit determination to obtain navigation-aware solutions with substantially lower fuel consumption than those from deterministic local optimization starting from the same initial guess","weakest_assumption":"The belief dynamics accurately capture the dependence of covariance propagation on the nominal trajectory and that the stochastic differential dynamic programming iterations converge to a solution that respects all general mission constraints without separation of estimation and control"}},"verdict_id":"9d82ed97-e775-4a0f-988f-886b12dd6848"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:ad2ab3267c8a8adf1b74a10e6b45375526abddfeeb3fbce11263bc3dab4b9b4e","target":"record","created_at":"2026-06-10T01:10:03Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"14dbba6f9d0c0517e71995bc8209c446ed0eb0675fc87dc4745ab1a1b70a467a","cross_cats_sorted":["cs.SY","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2026-05-08T09:57:48Z","title_canon_sha256":"a7d8f76bc4385bab06690486ee6a359101a2c4d1afbfdd5ad971587c5b66a4d1"},"schema_version":"1.0","source":{"id":"2605.07529","kind":"arxiv","version":2}},"canonical_sha256":"b6af55047961d9b37160b9e76952d57c01aa081470e9f493f1dba75895802bdb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b6af55047961d9b37160b9e76952d57c01aa081470e9f493f1dba75895802bdb","first_computed_at":"2026-06-10T01:10:03.125782Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-10T01:10:03.125782Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vrKViI8fJcUNV2rBpeWGkAZS3Q9GZQ1GFKkYXjOwWwQWlAax5ZRaIpeG1NmnD1Ej6g8jl909hiYQyLLGhXEAAw==","signature_status":"signed_v1","signed_at":"2026-06-10T01:10:03.126714Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.07529","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c9b1795bff2a0350aa01c8a82b77238046fd1c266df3468a51eb7eb88208be9e","sha256:ad2ab3267c8a8adf1b74a10e6b45375526abddfeeb3fbce11263bc3dab4b9b4e","sha256:3b18520396cb21d614f5967d0d025be24bfae09543e8a33e22a7414fa12b37a6"],"state_sha256":"5679dcfaf6cd5c7d2ff92c11061a7dda7b7794ff4d0cd21514cbb2dd800b2c39"}