{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:G5ZSH3CP7TSOSVY2GPJLXV22HZ","short_pith_number":"pith:G5ZSH3CP","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"},"canonical_sha256":"377323ec4ffce4e9571a33d2bbd75a3e6be26431814927290c9675ecf9ce8b64","source":{"kind":"arxiv","id":"1311.0362","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.0362","created_at":"2026-05-18T02:47:15Z"},{"alias_kind":"arxiv_version","alias_value":"1311.0362v1","created_at":"2026-05-18T02:47:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.0362","created_at":"2026-05-18T02:47:15Z"},{"alias_kind":"pith_short_12","alias_value":"G5ZSH3CP7TSO","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"G5ZSH3CP7TSOSVY2","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"G5ZSH3CP","created_at":"2026-05-18T12:27:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:G5ZSH3CP7TSOSVY2GPJLXV22HZ","target":"record","payload":{"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"},"canonical_sha256":"377323ec4ffce4e9571a33d2bbd75a3e6be26431814927290c9675ecf9ce8b64","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"},"source_kind":"arxiv","source_id":"1311.0362","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:47:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gx4Sn5FvDCCO4cpMUyqICwdoq64JjnTYHQ9aOCxKA8OcH+6rS+VU7IRf8yR/Z+F4ZobAHDONGW5SI+izpTG8Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T12:10:49.340869Z"},"content_sha256":"25bab59fccaf7a5c3dcf60dfa0d4d1ac2aff722f30bea6fa357271b48f3f4071","schema_version":"1.0","event_id":"sha256:25bab59fccaf7a5c3dcf60dfa0d4d1ac2aff722f30bea6fa357271b48f3f4071"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:G5ZSH3CP7TSOSVY2GPJLXV22HZ","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:47:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"V0juPQ45zj3LWrWyaXIJZqGYchFR+XxkmZNmoizYf6FtZXnd9Wk0WdvWf9fldyLLsCANN7M+g/CoopEC3nklCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T12:10:49.341222Z"},"content_sha256":"c3d16556ad8477f0bf6f55cbfaa73378832f502ed33b7e4c304d3ae8e8e3d011","schema_version":"1.0","event_id":"sha256:c3d16556ad8477f0bf6f55cbfaa73378832f502ed33b7e4c304d3ae8e8e3d011"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/G5ZSH3CP7TSOSVY2GPJLXV22HZ/bundle.json","state_url":"https://pith.science/pith/G5ZSH3CP7TSOSVY2GPJLXV22HZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/G5ZSH3CP7TSOSVY2GPJLXV22HZ/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-07-01T12:10:49Z","links":{"resolver":"https://pith.science/pith/G5ZSH3CP7TSOSVY2GPJLXV22HZ","bundle":"https://pith.science/pith/G5ZSH3CP7TSOSVY2GPJLXV22HZ/bundle.json","state":"https://pith.science/pith/G5ZSH3CP7TSOSVY2GPJLXV22HZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/G5ZSH3CP7TSOSVY2GPJLXV22HZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:G5ZSH3CP7TSOSVY2GPJLXV22HZ","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"00e3c44feaeb30a8d8f281d0d7b7bf4b382e1831867b1068a1c02656062ea5a0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-11-02T09:55:07Z","title_canon_sha256":"91a240961330656ffb9cf850c0d25102304ae688ab00c1e063e0aa603490cc48"},"schema_version":"1.0","source":{"id":"1311.0362","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.0362","created_at":"2026-05-18T02:47:15Z"},{"alias_kind":"arxiv_version","alias_value":"1311.0362v1","created_at":"2026-05-18T02:47:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.0362","created_at":"2026-05-18T02:47:15Z"},{"alias_kind":"pith_short_12","alias_value":"G5ZSH3CP7TSO","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"G5ZSH3CP7TSOSVY2","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"G5ZSH3CP","created_at":"2026-05-18T12:27:45Z"}],"graph_snapshots":[{"event_id":"sha256:c3d16556ad8477f0bf6f55cbfaa73378832f502ed33b7e4c304d3ae8e8e3d011","target":"graph","created_at":"2026-05-18T02:47:15Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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.","authors_text":"Ahmed El-Mahdy, Sameh Samra, Yasutaka Wada","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-11-02T09:55:07Z","title":"A Linear-Time and Space Algorithm for Optimal Traffic Signal Durations at an Intersection"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.0362","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:25bab59fccaf7a5c3dcf60dfa0d4d1ac2aff722f30bea6fa357271b48f3f4071","target":"record","created_at":"2026-05-18T02:47:15Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"00e3c44feaeb30a8d8f281d0d7b7bf4b382e1831867b1068a1c02656062ea5a0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-11-02T09:55:07Z","title_canon_sha256":"91a240961330656ffb9cf850c0d25102304ae688ab00c1e063e0aa603490cc48"},"schema_version":"1.0","source":{"id":"1311.0362","kind":"arxiv","version":1}},"canonical_sha256":"377323ec4ffce4e9571a33d2bbd75a3e6be26431814927290c9675ecf9ce8b64","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"377323ec4ffce4e9571a33d2bbd75a3e6be26431814927290c9675ecf9ce8b64","first_computed_at":"2026-05-18T02:47:15.904641Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:47:15.904641Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8ILduLAoxW74yEHaSnPE/MWJ7dZk+dsbzsm0hQbkhXibE8paQRBXIN4PO7Q7dqtk0f/JNfHtPF6rlnxrRecfDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:47:15.905302Z","signed_message":"canonical_sha256_bytes"},"source_id":"1311.0362","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:25bab59fccaf7a5c3dcf60dfa0d4d1ac2aff722f30bea6fa357271b48f3f4071","sha256:c3d16556ad8477f0bf6f55cbfaa73378832f502ed33b7e4c304d3ae8e8e3d011"],"state_sha256":"5ad394f5cb3051e49d924f59ab372f8e302a6ec1064b8178caf450edd67a8c0d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"70deYmOLXy957dWHSNmwiJpvKho6YStducrv1fwR3xPk5zbfw5KL+ltmjxJMt+nGiRdenAt7Ke0DlO1dwXlYBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-01T12:10:49.343289Z","bundle_sha256":"0754cbe08fea2af90f24b33d1d284770c224acbb8b115129a9286c65addfec2e"}}