{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:3BFUGRBZEDJXIP4A73JWATD6YJ","short_pith_number":"pith:3BFUGRBZ","schema_version":"1.0","canonical_sha256":"d84b43443920d3743f80fed3604c7ec27a21d509bf4fe407bb3ff1b5cc54883e","source":{"kind":"arxiv","id":"1705.05231","version":1},"attestation_state":"computed","paper":{"title":"Autonomous and Connected Intersection Crossing Traffic Management using Discrete-Time Occupancies Trajectory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NE"],"primary_cat":"cs.SY","authors_text":"Kyoung-Dae Kim, Qiang Lu","submitted_at":"2017-05-12T13:40:54Z","abstract_excerpt":"In this paper, we address a problem of safe and efficient intersection crossing traffic management of autonomous and connected ground traffic. Toward this objective, we propose an algorithm that is called the Discrete-time occupancies trajectory based Intersection traffic Coordination Algorithm (DICA). We first prove that the basic DICA is deadlock free and also starvation free. Then, we show that the basic DICA has a computational complexity of $\\mathcal{O}(n^2 L_m^3)$ where $n$ is the number of vehicles granted to cross an intersection and $L_m$ is the maximum length of intersection crossing"},"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":"1705.05231","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2017-05-12T13:40:54Z","cross_cats_sorted":["cs.NE"],"title_canon_sha256":"9e0fabf12ca4460b72bc4741a22f4efe5948f3b5b26ac1abd4e2ac9b69426d4b","abstract_canon_sha256":"85b9f62cf7a7f6e496e51a5d45f4f04e7a513ff9bd5cf54062ff097c47e4e999"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:31.052631Z","signature_b64":"fAWdbBjvWO+gfwI1lAPMCSNplC95b+M0GWbUVcPqN0BBdj4gBC4SmtuGvbOUkHIFzSanTd5gAyHGR5Ve7sgRCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d84b43443920d3743f80fed3604c7ec27a21d509bf4fe407bb3ff1b5cc54883e","last_reissued_at":"2026-05-18T00:44:31.052255Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:31.052255Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Autonomous and Connected Intersection Crossing Traffic Management using Discrete-Time Occupancies Trajectory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NE"],"primary_cat":"cs.SY","authors_text":"Kyoung-Dae Kim, Qiang Lu","submitted_at":"2017-05-12T13:40:54Z","abstract_excerpt":"In this paper, we address a problem of safe and efficient intersection crossing traffic management of autonomous and connected ground traffic. Toward this objective, we propose an algorithm that is called the Discrete-time occupancies trajectory based Intersection traffic Coordination Algorithm (DICA). We first prove that the basic DICA is deadlock free and also starvation free. Then, we show that the basic DICA has a computational complexity of $\\mathcal{O}(n^2 L_m^3)$ where $n$ is the number of vehicles granted to cross an intersection and $L_m$ is the maximum length of intersection crossing"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.05231","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":""},"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":"1705.05231","created_at":"2026-05-18T00:44:31.052308+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.05231v1","created_at":"2026-05-18T00:44:31.052308+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.05231","created_at":"2026-05-18T00:44:31.052308+00:00"},{"alias_kind":"pith_short_12","alias_value":"3BFUGRBZEDJX","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_16","alias_value":"3BFUGRBZEDJXIP4A","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_8","alias_value":"3BFUGRBZ","created_at":"2026-05-18T12:30:58.224056+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3BFUGRBZEDJXIP4A73JWATD6YJ","json":"https://pith.science/pith/3BFUGRBZEDJXIP4A73JWATD6YJ.json","graph_json":"https://pith.science/api/pith-number/3BFUGRBZEDJXIP4A73JWATD6YJ/graph.json","events_json":"https://pith.science/api/pith-number/3BFUGRBZEDJXIP4A73JWATD6YJ/events.json","paper":"https://pith.science/paper/3BFUGRBZ"},"agent_actions":{"view_html":"https://pith.science/pith/3BFUGRBZEDJXIP4A73JWATD6YJ","download_json":"https://pith.science/pith/3BFUGRBZEDJXIP4A73JWATD6YJ.json","view_paper":"https://pith.science/paper/3BFUGRBZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.05231&json=true","fetch_graph":"https://pith.science/api/pith-number/3BFUGRBZEDJXIP4A73JWATD6YJ/graph.json","fetch_events":"https://pith.science/api/pith-number/3BFUGRBZEDJXIP4A73JWATD6YJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3BFUGRBZEDJXIP4A73JWATD6YJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3BFUGRBZEDJXIP4A73JWATD6YJ/action/storage_attestation","attest_author":"https://pith.science/pith/3BFUGRBZEDJXIP4A73JWATD6YJ/action/author_attestation","sign_citation":"https://pith.science/pith/3BFUGRBZEDJXIP4A73JWATD6YJ/action/citation_signature","submit_replication":"https://pith.science/pith/3BFUGRBZEDJXIP4A73JWATD6YJ/action/replication_record"}},"created_at":"2026-05-18T00:44:31.052308+00:00","updated_at":"2026-05-18T00:44:31.052308+00:00"}