{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:XSKRL2TYAMLHIHVSTVOVE5LJHV","short_pith_number":"pith:XSKRL2TY","canonical_record":{"source":{"id":"2605.14332","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-05-14T03:55:39Z","cross_cats_sorted":[],"title_canon_sha256":"7a25845de548c8bf27b7ba06d96cc46780a782174e07f136fd7e2541920f61ab","abstract_canon_sha256":"d88cf1a880b74e993f9b9f789e5dde7ee158c93f8293c2587f756f8c27c29edd"},"schema_version":"1.0"},"canonical_sha256":"bc9515ea780316741eb29d5d5275693d60dd288d38234c8cf9eaee84b7bb69d6","source":{"kind":"arxiv","id":"2605.14332","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.14332","created_at":"2026-05-17T23:39:08Z"},{"alias_kind":"arxiv_version","alias_value":"2605.14332v1","created_at":"2026-05-17T23:39:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.14332","created_at":"2026-05-17T23:39:08Z"},{"alias_kind":"pith_short_12","alias_value":"XSKRL2TYAMLH","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"XSKRL2TYAMLHIHVS","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"XSKRL2TY","created_at":"2026-05-18T12:33:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:XSKRL2TYAMLHIHVSTVOVE5LJHV","target":"record","payload":{"canonical_record":{"source":{"id":"2605.14332","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-05-14T03:55:39Z","cross_cats_sorted":[],"title_canon_sha256":"7a25845de548c8bf27b7ba06d96cc46780a782174e07f136fd7e2541920f61ab","abstract_canon_sha256":"d88cf1a880b74e993f9b9f789e5dde7ee158c93f8293c2587f756f8c27c29edd"},"schema_version":"1.0"},"canonical_sha256":"bc9515ea780316741eb29d5d5275693d60dd288d38234c8cf9eaee84b7bb69d6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:08.282563Z","signature_b64":"8SLtVYSOfRVkSWzChgt3uJPzQjXa6lw++ffJboWIfRDTaun4tv93eVh5Mrh23NfLa7EBXD3YPKPCgcqVkNU6Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bc9515ea780316741eb29d5d5275693d60dd288d38234c8cf9eaee84b7bb69d6","last_reissued_at":"2026-05-17T23:39:08.281678Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:08.281678Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.14332","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-05-17T23:39:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gZbkEQkaYo7RP9WKNGTsoKok9pXiGzg3nQIt3vQ4bKDNqHXZsKysxiMPazaYZdl1WI+KOBt/89s1D3RylgfXDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T00:02:47.179616Z"},"content_sha256":"4522ffa244f5673e29d780ca56be74e92735950d5c671c7b48ab7cf8fdfbea41","schema_version":"1.0","event_id":"sha256:4522ffa244f5673e29d780ca56be74e92735950d5c671c7b48ab7cf8fdfbea41"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:XSKRL2TYAMLHIHVSTVOVE5LJHV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"PI-SONet: A Physics-Informed Symplectic Operator Network for Real-Time Optimal Control of Multi-Agent Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"A single trained conditional symplectic operator approximates the PMP solution map for families of high-dimensional optimal control problems and delivers sub-second inferences on new instances.","cross_cats":[],"primary_cat":"math.OC","authors_text":"Alan John Varghese, George Em Karniadakis, J\\'er\\^ome Darbon, Paula Chen, Shanqing Liu, Yaochen Zhu","submitted_at":"2026-05-14T03:55:39Z","abstract_excerpt":"Many real-life applications involve controlling high-dimensional multi-agent systems in real-time. Existing optimal control solvers often suffer from the curse-of-dimensionality and require complete rerunning for each new problem setting. We target nonconvex, nonlinear problems in 100s of dimensions by introducing PI-SONet (Physics-Informed Symplectic Operator Network), a structure-preserving operator learning framework for solving parameterized families of optimal control problems and their Pontraygin Maximum Principle (PMP) systems. PI-SONet combines a latent right-space solver with a condit"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"PI-SONet achieves sub-second inferences on new problem instances, equating to up to 10,000x speedup over representative baselines.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That a single trained conditional symplectic operator can reliably approximate the PMP solution map for unseen problem configurations while inherently preserving Hamiltonian structure.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"PI-SONet trains a single structure-preserving operator network to deliver sub-second approximations to Pontryagin Maximum Principle solutions for parameterized multi-agent optimal control problems.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"A single trained conditional symplectic operator approximates the PMP solution map for families of high-dimensional optimal control problems and delivers sub-second inferences on new instances.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"2453bd15d075e9044c9322ff5d2c047c6b614f8783fed4dfe086f346a31cf787"},"source":{"id":"2605.14332","kind":"arxiv","version":1},"verdict":{"id":"c429e02e-3e1e-464b-8bf6-bd960144f3b3","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-15T02:31:50.769330Z","strongest_claim":"PI-SONet achieves sub-second inferences on new problem instances, equating to up to 10,000x speedup over representative baselines.","one_line_summary":"PI-SONet trains a single structure-preserving operator network to deliver sub-second approximations to Pontryagin Maximum Principle solutions for parameterized multi-agent optimal control problems.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That a single trained conditional symplectic operator can reliably approximate the PMP solution map for unseen problem configurations while inherently preserving Hamiltonian structure.","pith_extraction_headline":"A single trained conditional symplectic operator approximates the PMP solution map for families of high-dimensional optimal control problems and delivers sub-second inferences on new instances."},"references":{"count":60,"sample":[{"doi":"","year":2005,"title":"Math´ ematiques Concr` etes","work_id":"030d0131-0895-40c1-8b3e-cab3568a61c8","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1002/9781118122631","year":2012,"title":"John Wiley & Sons, Hoboken, NJ (2012)","work_id":"fd562ea0-f3ae-4bbb-9eeb-0684aa41fd5e","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2014,"title":"Foderaro, G., Ferrari, S., Wettergren, T.A.: Distributed optimal control for multi-agent trajectory optimization. Automatica50(1), 149–154 (2014)","work_id":"c6efdf4c-31e4-4bf2-bbe3-2b73ecf44127","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2018,"title":"IEEE Robotics and Automation Letters3(2), 1215–1222 (2018)","work_id":"0ccadde9-f615-4fc5-94a6-5a1815e6c2e4","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2020,"title":"In: 2020 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS), pp","work_id":"40c304f2-825f-4b69-b078-703f2a875436","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":60,"snapshot_sha256":"ad68fd39365c67fc601487b37b8d8fdf0ce1838e6fdf5ca47f2f3e97a9c7f9e3","internal_anchors":3},"formal_canon":{"evidence_count":2,"snapshot_sha256":"8c11b3ce0942f27bcaf5f4d159ba4f37d6e531c8a0be3cb025ce4894b3f10643"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"c429e02e-3e1e-464b-8bf6-bd960144f3b3"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:39:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3EytFDoji+GoxcuE9HFgwe4oXmNK1Z4PHl9S9D2fDVRtayrY18YU2ergjhstRE7Ulk+DfKy+1TXa/HatdBW1Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T00:02:47.180795Z"},"content_sha256":"09a080255d81a0d22fc0a2c92e574923a98ca6d1c4e230843f00bc30a128cfad","schema_version":"1.0","event_id":"sha256:09a080255d81a0d22fc0a2c92e574923a98ca6d1c4e230843f00bc30a128cfad"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XSKRL2TYAMLHIHVSTVOVE5LJHV/bundle.json","state_url":"https://pith.science/pith/XSKRL2TYAMLHIHVSTVOVE5LJHV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XSKRL2TYAMLHIHVSTVOVE5LJHV/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-05-20T00:02:47Z","links":{"resolver":"https://pith.science/pith/XSKRL2TYAMLHIHVSTVOVE5LJHV","bundle":"https://pith.science/pith/XSKRL2TYAMLHIHVSTVOVE5LJHV/bundle.json","state":"https://pith.science/pith/XSKRL2TYAMLHIHVSTVOVE5LJHV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XSKRL2TYAMLHIHVSTVOVE5LJHV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:XSKRL2TYAMLHIHVSTVOVE5LJHV","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":"d88cf1a880b74e993f9b9f789e5dde7ee158c93f8293c2587f756f8c27c29edd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-05-14T03:55:39Z","title_canon_sha256":"7a25845de548c8bf27b7ba06d96cc46780a782174e07f136fd7e2541920f61ab"},"schema_version":"1.0","source":{"id":"2605.14332","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.14332","created_at":"2026-05-17T23:39:08Z"},{"alias_kind":"arxiv_version","alias_value":"2605.14332v1","created_at":"2026-05-17T23:39:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.14332","created_at":"2026-05-17T23:39:08Z"},{"alias_kind":"pith_short_12","alias_value":"XSKRL2TYAMLH","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"XSKRL2TYAMLHIHVS","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"XSKRL2TY","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:09a080255d81a0d22fc0a2c92e574923a98ca6d1c4e230843f00bc30a128cfad","target":"graph","created_at":"2026-05-17T23:39:08Z","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":"PI-SONet achieves sub-second inferences on new problem instances, equating to up to 10,000x speedup over representative baselines."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"That a single trained conditional symplectic operator can reliably approximate the PMP solution map for unseen problem configurations while inherently preserving Hamiltonian structure."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"PI-SONet trains a single structure-preserving operator network to deliver sub-second approximations to Pontryagin Maximum Principle solutions for parameterized multi-agent optimal control problems."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"A single trained conditional symplectic operator approximates the PMP solution map for families of high-dimensional optimal control problems and delivers sub-second inferences on new instances."}],"snapshot_sha256":"2453bd15d075e9044c9322ff5d2c047c6b614f8783fed4dfe086f346a31cf787"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"8c11b3ce0942f27bcaf5f4d159ba4f37d6e531c8a0be3cb025ce4894b3f10643"},"paper":{"abstract_excerpt":"Many real-life applications involve controlling high-dimensional multi-agent systems in real-time. Existing optimal control solvers often suffer from the curse-of-dimensionality and require complete rerunning for each new problem setting. We target nonconvex, nonlinear problems in 100s of dimensions by introducing PI-SONet (Physics-Informed Symplectic Operator Network), a structure-preserving operator learning framework for solving parameterized families of optimal control problems and their Pontraygin Maximum Principle (PMP) systems. PI-SONet combines a latent right-space solver with a condit","authors_text":"Alan John Varghese, George Em Karniadakis, J\\'er\\^ome Darbon, Paula Chen, Shanqing Liu, Yaochen Zhu","cross_cats":[],"headline":"A single trained conditional symplectic operator approximates the PMP solution map for families of high-dimensional optimal control problems and delivers sub-second inferences on new instances.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-05-14T03:55:39Z","title":"PI-SONet: A Physics-Informed Symplectic Operator Network for Real-Time Optimal Control of Multi-Agent Systems"},"references":{"count":60,"internal_anchors":3,"resolved_work":60,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"Math´ ematiques Concr` etes","work_id":"030d0131-0895-40c1-8b3e-cab3568a61c8","year":2005},{"cited_arxiv_id":"","doi":"10.1002/9781118122631","is_internal_anchor":false,"ref_index":2,"title":"John Wiley & Sons, Hoboken, NJ (2012)","work_id":"fd562ea0-f3ae-4bbb-9eeb-0684aa41fd5e","year":2012},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"Foderaro, G., Ferrari, S., Wettergren, T.A.: Distributed optimal control for multi-agent trajectory optimization. Automatica50(1), 149–154 (2014)","work_id":"c6efdf4c-31e4-4bf2-bbe3-2b73ecf44127","year":2014},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"IEEE Robotics and Automation Letters3(2), 1215–1222 (2018)","work_id":"0ccadde9-f615-4fc5-94a6-5a1815e6c2e4","year":2018},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"In: 2020 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS), pp","work_id":"40c304f2-825f-4b69-b078-703f2a875436","year":2020}],"snapshot_sha256":"ad68fd39365c67fc601487b37b8d8fdf0ce1838e6fdf5ca47f2f3e97a9c7f9e3"},"source":{"id":"2605.14332","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-15T02:31:50.769330Z","id":"c429e02e-3e1e-464b-8bf6-bd960144f3b3","model_set":{"reader":"grok-4.3"},"one_line_summary":"PI-SONet trains a single structure-preserving operator network to deliver sub-second approximations to Pontryagin Maximum Principle solutions for parameterized multi-agent optimal control problems.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"A single trained conditional symplectic operator approximates the PMP solution map for families of high-dimensional optimal control problems and delivers sub-second inferences on new instances.","strongest_claim":"PI-SONet achieves sub-second inferences on new problem instances, equating to up to 10,000x speedup over representative baselines.","weakest_assumption":"That a single trained conditional symplectic operator can reliably approximate the PMP solution map for unseen problem configurations while inherently preserving Hamiltonian structure."}},"verdict_id":"c429e02e-3e1e-464b-8bf6-bd960144f3b3"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:4522ffa244f5673e29d780ca56be74e92735950d5c671c7b48ab7cf8fdfbea41","target":"record","created_at":"2026-05-17T23:39:08Z","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":"d88cf1a880b74e993f9b9f789e5dde7ee158c93f8293c2587f756f8c27c29edd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-05-14T03:55:39Z","title_canon_sha256":"7a25845de548c8bf27b7ba06d96cc46780a782174e07f136fd7e2541920f61ab"},"schema_version":"1.0","source":{"id":"2605.14332","kind":"arxiv","version":1}},"canonical_sha256":"bc9515ea780316741eb29d5d5275693d60dd288d38234c8cf9eaee84b7bb69d6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bc9515ea780316741eb29d5d5275693d60dd288d38234c8cf9eaee84b7bb69d6","first_computed_at":"2026-05-17T23:39:08.281678Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:39:08.281678Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8SLtVYSOfRVkSWzChgt3uJPzQjXa6lw++ffJboWIfRDTaun4tv93eVh5Mrh23NfLa7EBXD3YPKPCgcqVkNU6Dg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:39:08.282563Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.14332","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4522ffa244f5673e29d780ca56be74e92735950d5c671c7b48ab7cf8fdfbea41","sha256:09a080255d81a0d22fc0a2c92e574923a98ca6d1c4e230843f00bc30a128cfad"],"state_sha256":"a03a3ab13be66dcd7fae99e57b7004a6a8ab207a8bd1743ac075cff19d4198ec"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4dWQlp/jOlTn6hj/6193OJA03kfE87vFzVvuO4Fpz9bXV+tfGnwVLoTrhlAPThaGL/8DEBH1LUUkII9vVMs1DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-20T00:02:47.185860Z","bundle_sha256":"0a4e4c64a987088108c7f99d34636dad3368f2e5466a6e6392413ffe3ad17ec4"}}