{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:EDZVNKCX4ZNOZYUMASDZ5P7WE4","short_pith_number":"pith:EDZVNKCX","schema_version":"1.0","canonical_sha256":"20f356a857e65aece28c04879ebff6272f68c601c4494f65b2aa93953989c634","source":{"kind":"arxiv","id":"2511.20383","version":2},"attestation_state":"computed","paper":{"title":"Accelerating Time-Optimal Trajectory Planning for Connected and Automated Vehicles with Graph Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"A graph neural network provides warm starts that let numerical optimizers compute time-optimal trajectories for connected automated vehicles much faster.","cross_cats":["cs.SY"],"primary_cat":"eess.SY","authors_text":"Andreas A. Malikopoulos, Viet-Anh Le","submitted_at":"2025-11-25T15:05:49Z","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":true},"canonical_record":{"source":{"id":"2511.20383","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2025-11-25T15:05:49Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"1a323bc6db0dc4829c95ab6395791d0d7e70d44644598425ba08675366b77ec9","abstract_canon_sha256":"e74b531bc3b4802d694946c829a68063e9f99f8a434e7cddd1ffdef0de43cc7d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:44:32.335400Z","signature_b64":"wZR3u678YwUqHmrcxwSTWkxiaBE3hyiW2kJ0lqb5fbkB0uaDs7ARMEWBhzm96BzbRzcqZVp9/gU7eU+IbwooDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"20f356a857e65aece28c04879ebff6272f68c601c4494f65b2aa93953989c634","last_reissued_at":"2026-05-18T02:44:32.334919Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:44:32.334919Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Accelerating Time-Optimal Trajectory Planning for Connected and Automated Vehicles with Graph Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"A graph neural network provides warm starts that let numerical optimizers compute time-optimal trajectories for connected automated vehicles much faster.","cross_cats":["cs.SY"],"primary_cat":"eess.SY","authors_text":"Andreas A. Malikopoulos, Viet-Anh Le","submitted_at":"2025-11-25T15:05:49Z","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"},"claims":{"count":4,"items":[{"kind":"strongest_claim","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.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","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.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","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.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"A graph neural network provides warm starts that let numerical optimizers compute time-optimal trajectories for connected automated vehicles much faster.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"b503ecc374883fd7405208850d26d8555fda549487dfd3ef7f603a2fc50c8a06"},"source":{"id":"2511.20383","kind":"arxiv","version":2},"verdict":{"id":"024f0873-f045-4e1c-94d1-c24cd56b9135","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-17T04:31:01.711619Z","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.","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","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.","pith_extraction_headline":"A graph neural network provides warm starts that let numerical optimizers compute time-optimal trajectories for connected automated vehicles much faster."},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":2,"snapshot_sha256":"4d8cbb882135880c505ab79ebd9778a835cc8031b52125c811332d6691efb5ac"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2511.20383","created_at":"2026-05-18T02:44:32.334993+00:00"},{"alias_kind":"arxiv_version","alias_value":"2511.20383v2","created_at":"2026-05-18T02:44:32.334993+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2511.20383","created_at":"2026-05-18T02:44:32.334993+00:00"},{"alias_kind":"pith_short_12","alias_value":"EDZVNKCX4ZNO","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_16","alias_value":"EDZVNKCX4ZNOZYUM","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_8","alias_value":"EDZVNKCX","created_at":"2026-05-18T12:33:37.589309+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":2,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EDZVNKCX4ZNOZYUMASDZ5P7WE4","json":"https://pith.science/pith/EDZVNKCX4ZNOZYUMASDZ5P7WE4.json","graph_json":"https://pith.science/api/pith-number/EDZVNKCX4ZNOZYUMASDZ5P7WE4/graph.json","events_json":"https://pith.science/api/pith-number/EDZVNKCX4ZNOZYUMASDZ5P7WE4/events.json","paper":"https://pith.science/paper/EDZVNKCX"},"agent_actions":{"view_html":"https://pith.science/pith/EDZVNKCX4ZNOZYUMASDZ5P7WE4","download_json":"https://pith.science/pith/EDZVNKCX4ZNOZYUMASDZ5P7WE4.json","view_paper":"https://pith.science/paper/EDZVNKCX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2511.20383&json=true","fetch_graph":"https://pith.science/api/pith-number/EDZVNKCX4ZNOZYUMASDZ5P7WE4/graph.json","fetch_events":"https://pith.science/api/pith-number/EDZVNKCX4ZNOZYUMASDZ5P7WE4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EDZVNKCX4ZNOZYUMASDZ5P7WE4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EDZVNKCX4ZNOZYUMASDZ5P7WE4/action/storage_attestation","attest_author":"https://pith.science/pith/EDZVNKCX4ZNOZYUMASDZ5P7WE4/action/author_attestation","sign_citation":"https://pith.science/pith/EDZVNKCX4ZNOZYUMASDZ5P7WE4/action/citation_signature","submit_replication":"https://pith.science/pith/EDZVNKCX4ZNOZYUMASDZ5P7WE4/action/replication_record"}},"created_at":"2026-05-18T02:44:32.334993+00:00","updated_at":"2026-05-18T02:44:32.334993+00:00"}