{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:EDZVNKCX4ZNOZYUMASDZ5P7WE4","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":"e74b531bc3b4802d694946c829a68063e9f99f8a434e7cddd1ffdef0de43cc7d","cross_cats_sorted":["cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2025-11-25T15:05:49Z","title_canon_sha256":"1a323bc6db0dc4829c95ab6395791d0d7e70d44644598425ba08675366b77ec9"},"schema_version":"1.0","source":{"id":"2511.20383","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2511.20383","created_at":"2026-05-18T02:44:32Z"},{"alias_kind":"arxiv_version","alias_value":"2511.20383v2","created_at":"2026-05-18T02:44:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2511.20383","created_at":"2026-05-18T02:44:32Z"},{"alias_kind":"pith_short_12","alias_value":"EDZVNKCX4ZNO","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"EDZVNKCX4ZNOZYUM","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"EDZVNKCX","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:3ae6a1d7a95773ca9900075dc4000f49721b219316a60c24fd66b9287a2112f7","target":"graph","created_at":"2026-05-18T02:44:32Z","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 trained model produces online predictions that serve as warm-starts for numerical optimization, thereby enabling rapid computation of minimal exit times and the associated feasible trajectories."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"That the graph neural network trained on offline-generated data will generalize to produce effective warm starts for previously unseen online traffic configurations without degrading the quality or feasibility of the resulting optimized trajectories."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"A graph isomorphism network with edge features is trained on offline data to provide warm starts for numerical optimization of time-optimal multi-agent trajectories in connected automated vehicles, reducing computation time while preserving performance through replanning."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"A graph neural network provides warm starts that let numerical optimizers compute time-optimal trajectories for connected automated vehicles much faster."}],"snapshot_sha256":"b503ecc374883fd7405208850d26d8555fda549487dfd3ef7f603a2fc50c8a06"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"4d8cbb882135880c505ab79ebd9778a835cc8031b52125c811332d6691efb5ac"},"paper":{"abstract_excerpt":"In this paper, we present a learning-based framework that accelerates time- and energy-optimal trajectory planning for connected and automated vehicles (CAVs) using graph neural networks (GNNs). We formulate the multi-agent coordination problem encountered in traffic scenarios as a cooperative trajectory planning problem that minimizes travel time, subject to motion primitives derived from energy-optimal solutions. The performance of this framework can be further improved through replanning at each time step, enabling the system to incorporate newly observed information. To achieve real-time e","authors_text":"Andreas A. Malikopoulos, Viet-Anh Le","cross_cats":["cs.SY"],"headline":"A graph neural network provides warm starts that let numerical optimizers compute time-optimal trajectories for connected automated vehicles much faster.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2025-11-25T15:05:49Z","title":"Accelerating Time-Optimal Trajectory Planning for Connected and Automated Vehicles with Graph Neural Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2511.20383","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-17T04:31:01.711619Z","id":"024f0873-f045-4e1c-94d1-c24cd56b9135","model_set":{"reader":"grok-4.3"},"one_line_summary":"A graph isomorphism network with edge features is trained on offline data to provide warm starts for numerical optimization of time-optimal multi-agent trajectories in connected automated vehicles, reducing computation time while preserving performance through replanning.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"A graph neural network provides warm starts that let numerical optimizers compute time-optimal trajectories for connected automated vehicles much faster.","strongest_claim":"The trained model produces online predictions that serve as warm-starts for numerical optimization, thereby enabling rapid computation of minimal exit times and the associated feasible trajectories.","weakest_assumption":"That the graph neural network trained on offline-generated data will generalize to produce effective warm starts for previously unseen online traffic configurations without degrading the quality or feasibility of the resulting optimized trajectories."}},"verdict_id":"024f0873-f045-4e1c-94d1-c24cd56b9135"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:8c9202c633ebed5b0e9e19f02e8d728794f403bc0045171112fbc985af2f1134","target":"record","created_at":"2026-05-18T02:44:32Z","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":"e74b531bc3b4802d694946c829a68063e9f99f8a434e7cddd1ffdef0de43cc7d","cross_cats_sorted":["cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2025-11-25T15:05:49Z","title_canon_sha256":"1a323bc6db0dc4829c95ab6395791d0d7e70d44644598425ba08675366b77ec9"},"schema_version":"1.0","source":{"id":"2511.20383","kind":"arxiv","version":2}},"canonical_sha256":"20f356a857e65aece28c04879ebff6272f68c601c4494f65b2aa93953989c634","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"20f356a857e65aece28c04879ebff6272f68c601c4494f65b2aa93953989c634","first_computed_at":"2026-05-18T02:44:32.334919Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:44:32.334919Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wZR3u678YwUqHmrcxwSTWkxiaBE3hyiW2kJ0lqb5fbkB0uaDs7ARMEWBhzm96BzbRzcqZVp9/gU7eU+IbwooDg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:44:32.335400Z","signed_message":"canonical_sha256_bytes"},"source_id":"2511.20383","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8c9202c633ebed5b0e9e19f02e8d728794f403bc0045171112fbc985af2f1134","sha256:3ae6a1d7a95773ca9900075dc4000f49721b219316a60c24fd66b9287a2112f7"],"state_sha256":"0a2f97772fc0b2e85f42a5075870301efe7b6f85cce1e870096bf965c7904dd6"}