{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:JLH7SQL6FEASCIRISAXZBE4FGK","short_pith_number":"pith:JLH7SQL6","schema_version":"1.0","canonical_sha256":"4acff9417e2901212228902f909385328fe5a991c489ac1771f098901bed8e51","source":{"kind":"arxiv","id":"2503.22837","version":1},"attestation_state":"computed","paper":{"title":"A Cooperative Compliance Control Framework for Socially Optimal Mixed Traffic Routing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"eess.SY","authors_text":"Andreas A. Malikopoulos, Anni Li, Christos G. Cassandras, Ting Bai, Yingqing Chen","submitted_at":"2025-03-28T19:17:03Z","abstract_excerpt":"In mixed traffic environments, where Connected and Autonomed Vehicles (CAVs) coexist with potentially non-cooperative Human-Driven Vehicles (HDVs), the self-centered behavior of human drivers may compromise the efficiency, optimality, and safety of the overall traffic network. In this paper, we propose a Cooperative Compliance Control (CCC) framework for mixed traffic routing, where a Social Planner (SP) optimizes vehicle routes for system-wide optimality while a compliance controller incentivizes human drivers to align their behavior with route guidance from the SP through a \"refundable toll\""},"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.22837","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2025-03-28T19:17:03Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"876837b7e9c5252fbb6193ae46b09d3d5f8691e38b92b032baade15b99b5b41b","abstract_canon_sha256":"d0b146dd8d510827231bbc5e646b191166cacef2b9c83196b323cd602d0edf40"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:41:26.428842Z","signature_b64":"tgmlHKxEKcX1z5mgUWCQ0PzenHIGJghzg8GSD/mAsPhN4PB4kQjbukFT3Di+oEsvhe/Wlk8dXgul8h82wM67Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4acff9417e2901212228902f909385328fe5a991c489ac1771f098901bed8e51","last_reissued_at":"2026-07-05T10:41:26.428370Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:41:26.428370Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Cooperative Compliance Control Framework for Socially Optimal Mixed Traffic Routing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"eess.SY","authors_text":"Andreas A. Malikopoulos, Anni Li, Christos G. Cassandras, Ting Bai, Yingqing Chen","submitted_at":"2025-03-28T19:17:03Z","abstract_excerpt":"In mixed traffic environments, where Connected and Autonomed Vehicles (CAVs) coexist with potentially non-cooperative Human-Driven Vehicles (HDVs), the self-centered behavior of human drivers may compromise the efficiency, optimality, and safety of the overall traffic network. In this paper, we propose a Cooperative Compliance Control (CCC) framework for mixed traffic routing, where a Social Planner (SP) optimizes vehicle routes for system-wide optimality while a compliance controller incentivizes human drivers to align their behavior with route guidance from the SP through a \"refundable toll\""},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.22837","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.22837/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.22837","created_at":"2026-07-05T10:41:26.428456+00:00"},{"alias_kind":"arxiv_version","alias_value":"2503.22837v1","created_at":"2026-07-05T10:41:26.428456+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.22837","created_at":"2026-07-05T10:41:26.428456+00:00"},{"alias_kind":"pith_short_12","alias_value":"JLH7SQL6FEAS","created_at":"2026-07-05T10:41:26.428456+00:00"},{"alias_kind":"pith_short_16","alias_value":"JLH7SQL6FEASCIRI","created_at":"2026-07-05T10:41:26.428456+00:00"},{"alias_kind":"pith_short_8","alias_value":"JLH7SQL6","created_at":"2026-07-05T10:41:26.428456+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.19675","citing_title":"Wardropian Cycles make traffic assignment both optimal and fair by eliminating price-of-anarchy with Cyclical User Equilibrium for compliant connected autonomous vehicles","ref_index":2018,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JLH7SQL6FEASCIRISAXZBE4FGK","json":"https://pith.science/pith/JLH7SQL6FEASCIRISAXZBE4FGK.json","graph_json":"https://pith.science/api/pith-number/JLH7SQL6FEASCIRISAXZBE4FGK/graph.json","events_json":"https://pith.science/api/pith-number/JLH7SQL6FEASCIRISAXZBE4FGK/events.json","paper":"https://pith.science/paper/JLH7SQL6"},"agent_actions":{"view_html":"https://pith.science/pith/JLH7SQL6FEASCIRISAXZBE4FGK","download_json":"https://pith.science/pith/JLH7SQL6FEASCIRISAXZBE4FGK.json","view_paper":"https://pith.science/paper/JLH7SQL6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2503.22837&json=true","fetch_graph":"https://pith.science/api/pith-number/JLH7SQL6FEASCIRISAXZBE4FGK/graph.json","fetch_events":"https://pith.science/api/pith-number/JLH7SQL6FEASCIRISAXZBE4FGK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JLH7SQL6FEASCIRISAXZBE4FGK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JLH7SQL6FEASCIRISAXZBE4FGK/action/storage_attestation","attest_author":"https://pith.science/pith/JLH7SQL6FEASCIRISAXZBE4FGK/action/author_attestation","sign_citation":"https://pith.science/pith/JLH7SQL6FEASCIRISAXZBE4FGK/action/citation_signature","submit_replication":"https://pith.science/pith/JLH7SQL6FEASCIRISAXZBE4FGK/action/replication_record"}},"created_at":"2026-07-05T10:41:26.428456+00:00","updated_at":"2026-07-05T10:41:26.428456+00:00"}