{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:G5ZSH3CP7TSOSVY2GPJLXV22HZ","short_pith_number":"pith:G5ZSH3CP","schema_version":"1.0","canonical_sha256":"377323ec4ffce4e9571a33d2bbd75a3e6be26431814927290c9675ecf9ce8b64","source":{"kind":"arxiv","id":"1311.0362","version":1},"attestation_state":"computed","paper":{"title":"A Linear-Time and Space Algorithm for Optimal Traffic Signal Durations at an Intersection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ahmed El-Mahdy, Sameh Samra, Yasutaka Wada","submitted_at":"2013-11-02T09:55:07Z","abstract_excerpt":"Finding an optimal solution of signal traffic control durations is a computationally intensive task. It is typically O(T3) in time, and O(T2) in space, where T is the length of the control interval in discrete time steps. In this paper, we propose a linear time and space algorithm for the same problem. The algorithm provides for an efficient dynamic programming formulation of the state space, the prunes non-optimal states, early on. The paper proves the correctness of the algorithm and provides an initial experimental validation."},"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":"1311.0362","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-11-02T09:55:07Z","cross_cats_sorted":[],"title_canon_sha256":"91a240961330656ffb9cf850c0d25102304ae688ab00c1e063e0aa603490cc48","abstract_canon_sha256":"00e3c44feaeb30a8d8f281d0d7b7bf4b382e1831867b1068a1c02656062ea5a0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:47:15.905302Z","signature_b64":"8ILduLAoxW74yEHaSnPE/MWJ7dZk+dsbzsm0hQbkhXibE8paQRBXIN4PO7Q7dqtk0f/JNfHtPF6rlnxrRecfDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"377323ec4ffce4e9571a33d2bbd75a3e6be26431814927290c9675ecf9ce8b64","last_reissued_at":"2026-05-18T02:47:15.904641Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:47:15.904641Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Linear-Time and Space Algorithm for Optimal Traffic Signal Durations at an Intersection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ahmed El-Mahdy, Sameh Samra, Yasutaka Wada","submitted_at":"2013-11-02T09:55:07Z","abstract_excerpt":"Finding an optimal solution of signal traffic control durations is a computationally intensive task. It is typically O(T3) in time, and O(T2) in space, where T is the length of the control interval in discrete time steps. In this paper, we propose a linear time and space algorithm for the same problem. The algorithm provides for an efficient dynamic programming formulation of the state space, the prunes non-optimal states, early on. The paper proves the correctness of the algorithm and provides an initial experimental validation."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.0362","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":"1311.0362","created_at":"2026-05-18T02:47:15.904744+00:00"},{"alias_kind":"arxiv_version","alias_value":"1311.0362v1","created_at":"2026-05-18T02:47:15.904744+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.0362","created_at":"2026-05-18T02:47:15.904744+00:00"},{"alias_kind":"pith_short_12","alias_value":"G5ZSH3CP7TSO","created_at":"2026-05-18T12:27:45.050594+00:00"},{"alias_kind":"pith_short_16","alias_value":"G5ZSH3CP7TSOSVY2","created_at":"2026-05-18T12:27:45.050594+00:00"},{"alias_kind":"pith_short_8","alias_value":"G5ZSH3CP","created_at":"2026-05-18T12:27:45.050594+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/G5ZSH3CP7TSOSVY2GPJLXV22HZ","json":"https://pith.science/pith/G5ZSH3CP7TSOSVY2GPJLXV22HZ.json","graph_json":"https://pith.science/api/pith-number/G5ZSH3CP7TSOSVY2GPJLXV22HZ/graph.json","events_json":"https://pith.science/api/pith-number/G5ZSH3CP7TSOSVY2GPJLXV22HZ/events.json","paper":"https://pith.science/paper/G5ZSH3CP"},"agent_actions":{"view_html":"https://pith.science/pith/G5ZSH3CP7TSOSVY2GPJLXV22HZ","download_json":"https://pith.science/pith/G5ZSH3CP7TSOSVY2GPJLXV22HZ.json","view_paper":"https://pith.science/paper/G5ZSH3CP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1311.0362&json=true","fetch_graph":"https://pith.science/api/pith-number/G5ZSH3CP7TSOSVY2GPJLXV22HZ/graph.json","fetch_events":"https://pith.science/api/pith-number/G5ZSH3CP7TSOSVY2GPJLXV22HZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/G5ZSH3CP7TSOSVY2GPJLXV22HZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/G5ZSH3CP7TSOSVY2GPJLXV22HZ/action/storage_attestation","attest_author":"https://pith.science/pith/G5ZSH3CP7TSOSVY2GPJLXV22HZ/action/author_attestation","sign_citation":"https://pith.science/pith/G5ZSH3CP7TSOSVY2GPJLXV22HZ/action/citation_signature","submit_replication":"https://pith.science/pith/G5ZSH3CP7TSOSVY2GPJLXV22HZ/action/replication_record"}},"created_at":"2026-05-18T02:47:15.904744+00:00","updated_at":"2026-05-18T02:47:15.904744+00:00"}