{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:J2PA43W6KGZQ4DKVH6MPNYP42A","short_pith_number":"pith:J2PA43W6","canonical_record":{"source":{"id":"2606.13605","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-06-11T17:22:05Z","cross_cats_sorted":["cs.LG","cs.SY","eess.SY"],"title_canon_sha256":"c1588e07e800686f26d1d44705a8aa05e2feb14e8564920f44926484403f4d2a","abstract_canon_sha256":"636caab81d6abdaddbe57559dc1527f195e56bac3ba91e4e178f437f047b253c"},"schema_version":"1.0"},"canonical_sha256":"4e9e0e6ede51b30e0d553f98f6e1fcd020bee38c5548be9791bb0dd5f64ae7b0","source":{"kind":"arxiv","id":"2606.13605","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:J2PA43W6KGZQ4DKVH6MPNYP42A","target":"record","payload":{"canonical_record":{"source":{"id":"2606.13605","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-06-11T17:22:05Z","cross_cats_sorted":["cs.LG","cs.SY","eess.SY"],"title_canon_sha256":"c1588e07e800686f26d1d44705a8aa05e2feb14e8564920f44926484403f4d2a","abstract_canon_sha256":"636caab81d6abdaddbe57559dc1527f195e56bac3ba91e4e178f437f047b253c"},"schema_version":"1.0"},"canonical_sha256":"4e9e0e6ede51b30e0d553f98f6e1fcd020bee38c5548be9791bb0dd5f64ae7b0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-12T01:10:12.676945Z","signature_b64":"mShX2g5VF1inz/RGjb9mHwlh0kk+aozlavAOlV41bnZfz4R6U+KfvG5c35XyUnFxHeGvd5t9Qr8m7Tp/OLdADQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4e9e0e6ede51b30e0d553f98f6e1fcd020bee38c5548be9791bb0dd5f64ae7b0","last_reissued_at":"2026-06-12T01:10:12.676140Z","signature_status":"signed_v1","first_computed_at":"2026-06-12T01:10:12.676140Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2606.13605","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-12T01:10:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SxGAtd4lh1Wf19fR6kcBQm80+X48vaYJmnLf5GSygi/FyicMDGBIDCoruGzF6Tqo6/iLnTpzChMxHs1q+RSrAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T04:54:08.943241Z"},"content_sha256":"4aeaa451d980df406460b470e95cb368be2a98a2f4c7804beb418b055cefd860","schema_version":"1.0","event_id":"sha256:4aeaa451d980df406460b470e95cb368be2a98a2f4c7804beb418b055cefd860"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:J2PA43W6KGZQ4DKVH6MPNYP42A","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distribution-Agnostic Robust Trajectory Optimization via Chance-Constrained Reinforcement Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.SY","eess.SY"],"primary_cat":"math.OC","authors_text":"Harry Holt, Marco Sagliano, Roberto Armellin, Yashdeep Chaudhary","submitted_at":"2026-06-11T17:22:05Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.13605","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/2606.13605/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-12T01:10:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4g9g09LbyV0ebh+g/n80w25bR4XJiS5trApY8ax8NDGSmx1oSzuZZUsx9z/+qs32Mnx455sBXNHpom22eFmgAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T04:54:08.943840Z"},"content_sha256":"ed34b5d52d8a0400394c42990e1f2b7a112bbad563f918ebdd9d3a9053d5755a","schema_version":"1.0","event_id":"sha256:ed34b5d52d8a0400394c42990e1f2b7a112bbad563f918ebdd9d3a9053d5755a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/J2PA43W6KGZQ4DKVH6MPNYP42A/bundle.json","state_url":"https://pith.science/pith/J2PA43W6KGZQ4DKVH6MPNYP42A/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/J2PA43W6KGZQ4DKVH6MPNYP42A/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-30T04:54:08Z","links":{"resolver":"https://pith.science/pith/J2PA43W6KGZQ4DKVH6MPNYP42A","bundle":"https://pith.science/pith/J2PA43W6KGZQ4DKVH6MPNYP42A/bundle.json","state":"https://pith.science/pith/J2PA43W6KGZQ4DKVH6MPNYP42A/state.json","well_known_bundle":"https://pith.science/.well-known/pith/J2PA43W6KGZQ4DKVH6MPNYP42A/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Otha8o+vhwdEvghby7wNXgV73akwZc12hmLyf7u5o57RHLVZxwsm3gs6GJH9ABfH+1yjLcxvly51JXVXRsjbDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-30T04:54:08.946675Z","bundle_sha256":"a4b6ea363287df36b9b00204c2f5293f03c3d4938f46e453e635cff30d231607"}}