{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:VK3SLX3ZPUQIVNI2L53NSEEQ32","short_pith_number":"pith:VK3SLX3Z","canonical_record":{"source":{"id":"1905.09955","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2019-05-23T22:30:09Z","cross_cats_sorted":[],"title_canon_sha256":"f4ce3ee044cc9765ae3db1dcd803116099a20ffa69132221a65718f0d07c70a2","abstract_canon_sha256":"19dde3c6e236735abb0b5f6c2399fa96443678ad62067c150ea42e631bc2393a"},"schema_version":"1.0"},"canonical_sha256":"aab725df797d208ab51a5f76d91090de93bf5b69d56a6185fff5bd49d2a480bb","source":{"kind":"arxiv","id":"1905.09955","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.09955","created_at":"2026-05-17T23:45:13Z"},{"alias_kind":"arxiv_version","alias_value":"1905.09955v1","created_at":"2026-05-17T23:45:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.09955","created_at":"2026-05-17T23:45:13Z"},{"alias_kind":"pith_short_12","alias_value":"VK3SLX3ZPUQI","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"VK3SLX3ZPUQIVNI2","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"VK3SLX3Z","created_at":"2026-05-18T12:33:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:VK3SLX3ZPUQIVNI2L53NSEEQ32","target":"record","payload":{"canonical_record":{"source":{"id":"1905.09955","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2019-05-23T22:30:09Z","cross_cats_sorted":[],"title_canon_sha256":"f4ce3ee044cc9765ae3db1dcd803116099a20ffa69132221a65718f0d07c70a2","abstract_canon_sha256":"19dde3c6e236735abb0b5f6c2399fa96443678ad62067c150ea42e631bc2393a"},"schema_version":"1.0"},"canonical_sha256":"aab725df797d208ab51a5f76d91090de93bf5b69d56a6185fff5bd49d2a480bb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:45:13.911940Z","signature_b64":"y9P0veMgwP9HDrDfkLtdbYRc0SjMhXsIFawoF1GZVaVbTnbEU2REy++R6rkfrYiY2a/i+hCVsfaIqVzye7RMDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aab725df797d208ab51a5f76d91090de93bf5b69d56a6185fff5bd49d2a480bb","last_reissued_at":"2026-05-17T23:45:13.911331Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:45:13.911331Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.09955","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-17T23:45:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"v+mN4x0FAYf7vAZv1l39lHWCfSeJ+3diAYtVdydsphA+sYewYTVbpoLX42k3vxs6fW3g0nNCrmy8j923iY5gDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T14:15:45.438581Z"},"content_sha256":"d4e801e4579c55f44fb8738d7575864efe9ec67db85318e7d392facd82819d89","schema_version":"1.0","event_id":"sha256:d4e801e4579c55f44fb8738d7575864efe9ec67db85318e7d392facd82819d89"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:VK3SLX3ZPUQIVNI2L53NSEEQ32","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Urban Traffic Network Control in Smart Cities; a Distributed Model-based Control Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SY","authors_text":"Roja Eini, Sherif Abdelwahed","submitted_at":"2019-05-23T22:30:09Z","abstract_excerpt":"This paper proposes a distributed model predictive control (DMPC) approach for an urban traffic network (UTN) system. The control objective is to minimize the traffic congestion and the total travel time spent (TTS) in each link. The proposed DMPC algorithm considers traffic demand and disturbance predictions. The CasADi optimization tool is used to solve the constrained optimization problem. The proposed distributed control approach achieved 60% less computation time, 14.3% less TTS, and 15.1% less queue length compared to the centralized approach. Moreover, while the centralized algorithm ne"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.09955","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-17T23:45:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n/qZeCVR6jxvf0NmK/LMN8jJ2Eq9xOMxFZ3ZMcyH+UaP4KYdJqMYCM8+PigHUWRV2dbgPIM3TQ1eB/Xl+fTMDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T14:15:45.438922Z"},"content_sha256":"992408a50dacefaa9f6928508b9b7550ae3fb54c05ceaa58d5e10cffe652143d","schema_version":"1.0","event_id":"sha256:992408a50dacefaa9f6928508b9b7550ae3fb54c05ceaa58d5e10cffe652143d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VK3SLX3ZPUQIVNI2L53NSEEQ32/bundle.json","state_url":"https://pith.science/pith/VK3SLX3ZPUQIVNI2L53NSEEQ32/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VK3SLX3ZPUQIVNI2L53NSEEQ32/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-06-09T14:15:45Z","links":{"resolver":"https://pith.science/pith/VK3SLX3ZPUQIVNI2L53NSEEQ32","bundle":"https://pith.science/pith/VK3SLX3ZPUQIVNI2L53NSEEQ32/bundle.json","state":"https://pith.science/pith/VK3SLX3ZPUQIVNI2L53NSEEQ32/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VK3SLX3ZPUQIVNI2L53NSEEQ32/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:VK3SLX3ZPUQIVNI2L53NSEEQ32","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":"19dde3c6e236735abb0b5f6c2399fa96443678ad62067c150ea42e631bc2393a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2019-05-23T22:30:09Z","title_canon_sha256":"f4ce3ee044cc9765ae3db1dcd803116099a20ffa69132221a65718f0d07c70a2"},"schema_version":"1.0","source":{"id":"1905.09955","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.09955","created_at":"2026-05-17T23:45:13Z"},{"alias_kind":"arxiv_version","alias_value":"1905.09955v1","created_at":"2026-05-17T23:45:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.09955","created_at":"2026-05-17T23:45:13Z"},{"alias_kind":"pith_short_12","alias_value":"VK3SLX3ZPUQI","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"VK3SLX3ZPUQIVNI2","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"VK3SLX3Z","created_at":"2026-05-18T12:33:30Z"}],"graph_snapshots":[{"event_id":"sha256:992408a50dacefaa9f6928508b9b7550ae3fb54c05ceaa58d5e10cffe652143d","target":"graph","created_at":"2026-05-17T23:45:13Z","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":"This paper proposes a distributed model predictive control (DMPC) approach for an urban traffic network (UTN) system. The control objective is to minimize the traffic congestion and the total travel time spent (TTS) in each link. The proposed DMPC algorithm considers traffic demand and disturbance predictions. The CasADi optimization tool is used to solve the constrained optimization problem. The proposed distributed control approach achieved 60% less computation time, 14.3% less TTS, and 15.1% less queue length compared to the centralized approach. Moreover, while the centralized algorithm ne","authors_text":"Roja Eini, Sherif Abdelwahed","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2019-05-23T22:30:09Z","title":"Urban Traffic Network Control in Smart Cities; a Distributed Model-based Control Approach"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.09955","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:d4e801e4579c55f44fb8738d7575864efe9ec67db85318e7d392facd82819d89","target":"record","created_at":"2026-05-17T23:45:13Z","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":"19dde3c6e236735abb0b5f6c2399fa96443678ad62067c150ea42e631bc2393a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2019-05-23T22:30:09Z","title_canon_sha256":"f4ce3ee044cc9765ae3db1dcd803116099a20ffa69132221a65718f0d07c70a2"},"schema_version":"1.0","source":{"id":"1905.09955","kind":"arxiv","version":1}},"canonical_sha256":"aab725df797d208ab51a5f76d91090de93bf5b69d56a6185fff5bd49d2a480bb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"aab725df797d208ab51a5f76d91090de93bf5b69d56a6185fff5bd49d2a480bb","first_computed_at":"2026-05-17T23:45:13.911331Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:45:13.911331Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"y9P0veMgwP9HDrDfkLtdbYRc0SjMhXsIFawoF1GZVaVbTnbEU2REy++R6rkfrYiY2a/i+hCVsfaIqVzye7RMDQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:45:13.911940Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.09955","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d4e801e4579c55f44fb8738d7575864efe9ec67db85318e7d392facd82819d89","sha256:992408a50dacefaa9f6928508b9b7550ae3fb54c05ceaa58d5e10cffe652143d"],"state_sha256":"8eb2c5bf7290f0477f804bf526298e08e13ae4c8072867ef29698cb9909671cb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/Ty8vG0Y7cMu+eLNfSV2uwsGcw0y8aDfMkw3PBzmn4YL3h1Bgv8QS3Usw6jYJlMoAu50ANpTAzWvCp6whv4RDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T14:15:45.440785Z","bundle_sha256":"6e0fbcfd5007a096e0dbb3569b51f558b1cf19e8fe21082880e6679bd4240ded"}}