{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:ZDNPXYTTWZXYMSTPOK5RKI3LBA","short_pith_number":"pith:ZDNPXYTT","canonical_record":{"source":{"id":"1508.03583","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2015-08-14T18:01:39Z","cross_cats_sorted":[],"title_canon_sha256":"f3abab3180c7193e6d0f9f7f4c7caf1ca6b3279493cb9e2e83a4ea3428901532","abstract_canon_sha256":"9efc89839049cef01b8c95e1e1cd3c3f77f0b1faee63a285eb733ec1c53558ff"},"schema_version":"1.0"},"canonical_sha256":"c8dafbe273b66f864a6f72bb15236b083646ef7ae2f2587743e6ddbcdc81ceb0","source":{"kind":"arxiv","id":"1508.03583","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.03583","created_at":"2026-05-18T01:35:17Z"},{"alias_kind":"arxiv_version","alias_value":"1508.03583v1","created_at":"2026-05-18T01:35:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.03583","created_at":"2026-05-18T01:35:17Z"},{"alias_kind":"pith_short_12","alias_value":"ZDNPXYTTWZXY","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"ZDNPXYTTWZXYMSTP","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"ZDNPXYTT","created_at":"2026-05-18T12:29:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:ZDNPXYTTWZXYMSTPOK5RKI3LBA","target":"record","payload":{"canonical_record":{"source":{"id":"1508.03583","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2015-08-14T18:01:39Z","cross_cats_sorted":[],"title_canon_sha256":"f3abab3180c7193e6d0f9f7f4c7caf1ca6b3279493cb9e2e83a4ea3428901532","abstract_canon_sha256":"9efc89839049cef01b8c95e1e1cd3c3f77f0b1faee63a285eb733ec1c53558ff"},"schema_version":"1.0"},"canonical_sha256":"c8dafbe273b66f864a6f72bb15236b083646ef7ae2f2587743e6ddbcdc81ceb0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:35:17.311980Z","signature_b64":"PvMMcmeA5gO5az2KdBgff/HM08u18Ljl7pHZQ7/8w/F0JsS6fWoZit4k2AoE+it45GFKo91kUGEs2J+EfBJ/Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c8dafbe273b66f864a6f72bb15236b083646ef7ae2f2587743e6ddbcdc81ceb0","last_reissued_at":"2026-05-18T01:35:17.311466Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:35:17.311466Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1508.03583","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-18T01:35:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2WA2gx7Q3wEdCABZTVNz1fHg+MWrkuw6sGnaZXklY1eZSIC5fJG48N/wMwQiHN+qSN2JDlk12cY8yI7r05wtCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T06:54:27.554115Z"},"content_sha256":"d48b0198cd21b3d5058e5e78017171bd732f060c91f60886501fad44f438f1ca","schema_version":"1.0","event_id":"sha256:d48b0198cd21b3d5058e5e78017171bd732f060c91f60886501fad44f438f1ca"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:ZDNPXYTTWZXYMSTPOK5RKI3LBA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Coverage Based Decentralised Routing Algorithm for Vehicular Traffic Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Chao Zhai, Mario di Bernardo, Timothy Barker","submitted_at":"2015-08-14T18:01:39Z","abstract_excerpt":"We present a simple yet effective routing strategy inspired by coverage control, which delays the onset of congestion on traffic networks, by introducing a control parameter. The routing algorithm allows a trade-off between the congestion level and the distance to the destination. Numerical verification of the strategy is provided on a number of representative examples in SUMO, a well known micro agent simulator used for the analysis of traffic networks. We find that it is crucial in many cases to tune the given control parameters to some optimal value in order to reduce congestion in the most"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.03583","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-18T01:35:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"C1PNHzc/RS7w0oNTL7JrfWYiGIY8qiWxZHFHhLxqtxvbBAKjY578YAoQ1ZcNUOvbe1y9rNYlHSHlUutbTRcYAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T06:54:27.554472Z"},"content_sha256":"f096c5fa9e98b3e53104916f4e96ece93d47c26aa0b718c654d65aa8ab6899cd","schema_version":"1.0","event_id":"sha256:f096c5fa9e98b3e53104916f4e96ece93d47c26aa0b718c654d65aa8ab6899cd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZDNPXYTTWZXYMSTPOK5RKI3LBA/bundle.json","state_url":"https://pith.science/pith/ZDNPXYTTWZXYMSTPOK5RKI3LBA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZDNPXYTTWZXYMSTPOK5RKI3LBA/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-05-30T06:54:27Z","links":{"resolver":"https://pith.science/pith/ZDNPXYTTWZXYMSTPOK5RKI3LBA","bundle":"https://pith.science/pith/ZDNPXYTTWZXYMSTPOK5RKI3LBA/bundle.json","state":"https://pith.science/pith/ZDNPXYTTWZXYMSTPOK5RKI3LBA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZDNPXYTTWZXYMSTPOK5RKI3LBA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:ZDNPXYTTWZXYMSTPOK5RKI3LBA","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":"9efc89839049cef01b8c95e1e1cd3c3f77f0b1faee63a285eb733ec1c53558ff","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2015-08-14T18:01:39Z","title_canon_sha256":"f3abab3180c7193e6d0f9f7f4c7caf1ca6b3279493cb9e2e83a4ea3428901532"},"schema_version":"1.0","source":{"id":"1508.03583","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.03583","created_at":"2026-05-18T01:35:17Z"},{"alias_kind":"arxiv_version","alias_value":"1508.03583v1","created_at":"2026-05-18T01:35:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.03583","created_at":"2026-05-18T01:35:17Z"},{"alias_kind":"pith_short_12","alias_value":"ZDNPXYTTWZXY","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"ZDNPXYTTWZXYMSTP","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"ZDNPXYTT","created_at":"2026-05-18T12:29:52Z"}],"graph_snapshots":[{"event_id":"sha256:f096c5fa9e98b3e53104916f4e96ece93d47c26aa0b718c654d65aa8ab6899cd","target":"graph","created_at":"2026-05-18T01:35:17Z","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":"We present a simple yet effective routing strategy inspired by coverage control, which delays the onset of congestion on traffic networks, by introducing a control parameter. The routing algorithm allows a trade-off between the congestion level and the distance to the destination. Numerical verification of the strategy is provided on a number of representative examples in SUMO, a well known micro agent simulator used for the analysis of traffic networks. We find that it is crucial in many cases to tune the given control parameters to some optimal value in order to reduce congestion in the most","authors_text":"Chao Zhai, Mario di Bernardo, Timothy Barker","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2015-08-14T18:01:39Z","title":"A Coverage Based Decentralised Routing Algorithm for Vehicular Traffic Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.03583","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:d48b0198cd21b3d5058e5e78017171bd732f060c91f60886501fad44f438f1ca","target":"record","created_at":"2026-05-18T01:35:17Z","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":"9efc89839049cef01b8c95e1e1cd3c3f77f0b1faee63a285eb733ec1c53558ff","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2015-08-14T18:01:39Z","title_canon_sha256":"f3abab3180c7193e6d0f9f7f4c7caf1ca6b3279493cb9e2e83a4ea3428901532"},"schema_version":"1.0","source":{"id":"1508.03583","kind":"arxiv","version":1}},"canonical_sha256":"c8dafbe273b66f864a6f72bb15236b083646ef7ae2f2587743e6ddbcdc81ceb0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c8dafbe273b66f864a6f72bb15236b083646ef7ae2f2587743e6ddbcdc81ceb0","first_computed_at":"2026-05-18T01:35:17.311466Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:35:17.311466Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PvMMcmeA5gO5az2KdBgff/HM08u18Ljl7pHZQ7/8w/F0JsS6fWoZit4k2AoE+it45GFKo91kUGEs2J+EfBJ/Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:35:17.311980Z","signed_message":"canonical_sha256_bytes"},"source_id":"1508.03583","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d48b0198cd21b3d5058e5e78017171bd732f060c91f60886501fad44f438f1ca","sha256:f096c5fa9e98b3e53104916f4e96ece93d47c26aa0b718c654d65aa8ab6899cd"],"state_sha256":"b73556103bd87d3ad84298bdc042bc047f5f60b161cd11cf041b7a113d903df7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rRWtdFfArGjxXQZZcJej3G6ifJv6dnXKF8e5Y3iE+uxlZ1Y6lKNBcBHNFDxPlXpw2XVqRVT637F83DmEveeyCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T06:54:27.556355Z","bundle_sha256":"fec3051be88e32a949edcff067dcae5152a2fb3068a81f3e49e2609a9e79bbb4"}}