{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:LN3EG7LKKLWJVISUZO2PR7RGHO","short_pith_number":"pith:LN3EG7LK","schema_version":"1.0","canonical_sha256":"5b76437d6a52ec9aa254cbb4f8fe263b8b9e95ed0da332ccf8435be1ba838e14","source":{"kind":"arxiv","id":"2503.10004","version":1},"attestation_state":"computed","paper":{"title":"Combining Cooperative Re-Routing with Intersection Coordination for Connected and Automated Vehicles in Urban Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"eess.SY","authors_text":"Andreas A. Malikopoulos, Panagiotis Typaldos","submitted_at":"2025-03-13T03:25:35Z","abstract_excerpt":"In this paper, we present a hierarchical framework that integrates upper-level routing with low-level optimal trajectory planning for connected and automated vehicles (CAVs) traveling in an urban network. The upper-level controller efficiently distributes traffic flows by utilizing a dynamic re-routing algorithm that leverages real-time density information and the fundamental diagrams of each network edge. This re-routing approach predicts when each edge will reach critical density and proactively adjusts the routing algorithm's weights to prevent congestion before it occurs. The low-level con"},"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":false},"canonical_record":{"source":{"id":"2503.10004","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2025-03-13T03:25:35Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"750a537056417c34b59e620fa3a54b3c62483d68225d55b4763db77399dceb06","abstract_canon_sha256":"418dfe07f10157b8b183772a0522e48c24e9757f001838a1afc35eb2cf091547"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:30:36.386069Z","signature_b64":"W+vSxGYTKDWxxR4ro/YrDawM+VNtY6Jt5itGaXdeHC4QMdxkqrZZyLmBsSoGH7mm2u6iVMfBzTV30tC5oPJRAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5b76437d6a52ec9aa254cbb4f8fe263b8b9e95ed0da332ccf8435be1ba838e14","last_reissued_at":"2026-07-05T10:30:36.385473Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:30:36.385473Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Combining Cooperative Re-Routing with Intersection Coordination for Connected and Automated Vehicles in Urban Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"eess.SY","authors_text":"Andreas A. Malikopoulos, Panagiotis Typaldos","submitted_at":"2025-03-13T03:25:35Z","abstract_excerpt":"In this paper, we present a hierarchical framework that integrates upper-level routing with low-level optimal trajectory planning for connected and automated vehicles (CAVs) traveling in an urban network. The upper-level controller efficiently distributes traffic flows by utilizing a dynamic re-routing algorithm that leverages real-time density information and the fundamental diagrams of each network edge. This re-routing approach predicts when each edge will reach critical density and proactively adjusts the routing algorithm's weights to prevent congestion before it occurs. The low-level con"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.10004","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/2503.10004/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2503.10004","created_at":"2026-07-05T10:30:36.385544+00:00"},{"alias_kind":"arxiv_version","alias_value":"2503.10004v1","created_at":"2026-07-05T10:30:36.385544+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.10004","created_at":"2026-07-05T10:30:36.385544+00:00"},{"alias_kind":"pith_short_12","alias_value":"LN3EG7LKKLWJ","created_at":"2026-07-05T10:30:36.385544+00:00"},{"alias_kind":"pith_short_16","alias_value":"LN3EG7LKKLWJVISU","created_at":"2026-07-05T10:30:36.385544+00:00"},{"alias_kind":"pith_short_8","alias_value":"LN3EG7LK","created_at":"2026-07-05T10:30:36.385544+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2508.05827","citing_title":"A United Framework for Planning Electric Vehicle Charging Accessibility","ref_index":23,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LN3EG7LKKLWJVISUZO2PR7RGHO","json":"https://pith.science/pith/LN3EG7LKKLWJVISUZO2PR7RGHO.json","graph_json":"https://pith.science/api/pith-number/LN3EG7LKKLWJVISUZO2PR7RGHO/graph.json","events_json":"https://pith.science/api/pith-number/LN3EG7LKKLWJVISUZO2PR7RGHO/events.json","paper":"https://pith.science/paper/LN3EG7LK"},"agent_actions":{"view_html":"https://pith.science/pith/LN3EG7LKKLWJVISUZO2PR7RGHO","download_json":"https://pith.science/pith/LN3EG7LKKLWJVISUZO2PR7RGHO.json","view_paper":"https://pith.science/paper/LN3EG7LK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2503.10004&json=true","fetch_graph":"https://pith.science/api/pith-number/LN3EG7LKKLWJVISUZO2PR7RGHO/graph.json","fetch_events":"https://pith.science/api/pith-number/LN3EG7LKKLWJVISUZO2PR7RGHO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LN3EG7LKKLWJVISUZO2PR7RGHO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LN3EG7LKKLWJVISUZO2PR7RGHO/action/storage_attestation","attest_author":"https://pith.science/pith/LN3EG7LKKLWJVISUZO2PR7RGHO/action/author_attestation","sign_citation":"https://pith.science/pith/LN3EG7LKKLWJVISUZO2PR7RGHO/action/citation_signature","submit_replication":"https://pith.science/pith/LN3EG7LKKLWJVISUZO2PR7RGHO/action/replication_record"}},"created_at":"2026-07-05T10:30:36.385544+00:00","updated_at":"2026-07-05T10:30:36.385544+00:00"}