{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:J2PA43W6KGZQ4DKVH6MPNYP42A","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"636caab81d6abdaddbe57559dc1527f195e56bac3ba91e4e178f437f047b253c","cross_cats_sorted":["cs.LG","cs.SY","eess.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-06-11T17:22:05Z","title_canon_sha256":"c1588e07e800686f26d1d44705a8aa05e2feb14e8564920f44926484403f4d2a"},"schema_version":"1.0","source":{"id":"2606.13605","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.13605","created_at":"2026-06-12T01:10:12Z"},{"alias_kind":"arxiv_version","alias_value":"2606.13605v1","created_at":"2026-06-12T01:10:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.13605","created_at":"2026-06-12T01:10:12Z"},{"alias_kind":"pith_short_12","alias_value":"J2PA43W6KGZQ","created_at":"2026-06-12T01:10:12Z"},{"alias_kind":"pith_short_16","alias_value":"J2PA43W6KGZQ4DKV","created_at":"2026-06-12T01:10:12Z"},{"alias_kind":"pith_short_8","alias_value":"J2PA43W6","created_at":"2026-06-12T01:10:12Z"}],"graph_snapshots":[{"event_id":"sha256:ed34b5d52d8a0400394c42990e1f2b7a112bbad563f918ebdd9d3a9053d5755a","target":"graph","created_at":"2026-06-12T01:10:12Z","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":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2606.13605/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This paper presents a distribution-agnostic robust trajectory-optimization framework based on chance-constrained reinforcement learning. The uncertainty is represented here through initial conditions and process noise, with the only requirement being that it can be sampled. A deterministic nominal trajectory is first computed offline, and reinforcement learning is then used only to robustify that baseline through a structured affine closed-loop correction law comprising a feedforward control adjustment and time-varying feedback gains. Probabilistic feasibility is enforced empirically through r","authors_text":"Harry Holt, Marco Sagliano, Roberto Armellin, Yashdeep Chaudhary","cross_cats":["cs.LG","cs.SY","eess.SY"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-06-11T17:22:05Z","title":"Distribution-Agnostic Robust Trajectory Optimization via Chance-Constrained Reinforcement Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.13605","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:4aeaa451d980df406460b470e95cb368be2a98a2f4c7804beb418b055cefd860","target":"record","created_at":"2026-06-12T01:10:12Z","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":"636caab81d6abdaddbe57559dc1527f195e56bac3ba91e4e178f437f047b253c","cross_cats_sorted":["cs.LG","cs.SY","eess.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-06-11T17:22:05Z","title_canon_sha256":"c1588e07e800686f26d1d44705a8aa05e2feb14e8564920f44926484403f4d2a"},"schema_version":"1.0","source":{"id":"2606.13605","kind":"arxiv","version":1}},"canonical_sha256":"4e9e0e6ede51b30e0d553f98f6e1fcd020bee38c5548be9791bb0dd5f64ae7b0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4e9e0e6ede51b30e0d553f98f6e1fcd020bee38c5548be9791bb0dd5f64ae7b0","first_computed_at":"2026-06-12T01:10:12.676140Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-12T01:10:12.676140Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mShX2g5VF1inz/RGjb9mHwlh0kk+aozlavAOlV41bnZfz4R6U+KfvG5c35XyUnFxHeGvd5t9Qr8m7Tp/OLdADQ==","signature_status":"signed_v1","signed_at":"2026-06-12T01:10:12.676945Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.13605","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4aeaa451d980df406460b470e95cb368be2a98a2f4c7804beb418b055cefd860","sha256:ed34b5d52d8a0400394c42990e1f2b7a112bbad563f918ebdd9d3a9053d5755a"],"state_sha256":"8b0665bef32b08e1a5197745ae2115b3df759cbd3cbf9d0b9604621c8866dd80"}