{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:LF3R75N5CYXXPOOCGE52BN7BD5","short_pith_number":"pith:LF3R75N5","canonical_record":{"source":{"id":"1207.3943","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.NI","submitted_at":"2012-07-17T11:01:19Z","cross_cats_sorted":[],"title_canon_sha256":"dc22911aab0248f9f8aa5d2e3e5a26ed3e14c4963ab0081253b38984e6740f90","abstract_canon_sha256":"cb9493ecc74c0da1beaf0bc04f9d4d9e3b39d191bb7b2a60257451a845572b0a"},"schema_version":"1.0"},"canonical_sha256":"59771ff5bd162f77b9c2313ba0b7e11f4ffa654ce14405e01103e58b85f8bdb0","source":{"kind":"arxiv","id":"1207.3943","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.3943","created_at":"2026-05-18T03:50:49Z"},{"alias_kind":"arxiv_version","alias_value":"1207.3943v1","created_at":"2026-05-18T03:50:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.3943","created_at":"2026-05-18T03:50:49Z"},{"alias_kind":"pith_short_12","alias_value":"LF3R75N5CYXX","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_16","alias_value":"LF3R75N5CYXXPOOC","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_8","alias_value":"LF3R75N5","created_at":"2026-05-18T12:27:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:LF3R75N5CYXXPOOCGE52BN7BD5","target":"record","payload":{"canonical_record":{"source":{"id":"1207.3943","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.NI","submitted_at":"2012-07-17T11:01:19Z","cross_cats_sorted":[],"title_canon_sha256":"dc22911aab0248f9f8aa5d2e3e5a26ed3e14c4963ab0081253b38984e6740f90","abstract_canon_sha256":"cb9493ecc74c0da1beaf0bc04f9d4d9e3b39d191bb7b2a60257451a845572b0a"},"schema_version":"1.0"},"canonical_sha256":"59771ff5bd162f77b9c2313ba0b7e11f4ffa654ce14405e01103e58b85f8bdb0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:50:49.416896Z","signature_b64":"KiK0J8ICdsZosm3sa+pGmT4msF1Ou9g+jDdpEktFObVYZp1Mj7ZRd4jSVoLwO1j8NRyLKRWEMEpPQLHJMrklBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"59771ff5bd162f77b9c2313ba0b7e11f4ffa654ce14405e01103e58b85f8bdb0","last_reissued_at":"2026-05-18T03:50:49.416193Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:50:49.416193Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1207.3943","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-18T03:50:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gZJ8IP2nL/3x1ZSNVi3Qu9Y1sDX4gsDN9htnRM7xkdN1UYh/4MbdAKRKODVo5kFINTAMAt+Kw2MOqePm70CEAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T03:42:05.584402Z"},"content_sha256":"d4233b9e5d04509a999f2294ab35cf4c53dffbbfe55130325ae65f06208d4e62","schema_version":"1.0","event_id":"sha256:d4233b9e5d04509a999f2294ab35cf4c53dffbbfe55130325ae65f06208d4e62"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:LF3R75N5CYXXPOOCGE52BN7BD5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Taxonomy for Congestion Control Algorithms in Vehicular Ad Hoc Networks","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Hassan Keshavarz, Mohammad Reza Jabbarpour Sattari, Rafidah Md Noor","submitted_at":"2012-07-17T11:01:19Z","abstract_excerpt":"One of the main criteria in Vehicular Ad hoc Networks (VANETs) that has attracted the researchers' consideration is congestion control. Accordingly, many algorithms have been proposed to alleviate the congestion problem, although it is hard to find an appropriate algorithm for applications and safety messages among them. Safety messages encompass beacons and event-driven messages. Delay and reliability are essential requirements for event-driven messages. In crowded networks where beacon messages are broadcasted at a high number of frequencies by many vehicles, the Control Channel (CCH), which"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.3943","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-18T03:50:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"W8vaKw+3EmpF7UuQVVN6+UxjCHHo0EtzhjA6AbYxMVbSK7TNbFA+JEg3eXEI+pJdIihBGUMTtF9pILGce4udCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T03:42:05.584940Z"},"content_sha256":"d651f52aa769440af9e1c242a71e7e57a53c5ac5ee7db2c58e02e719ca8afe47","schema_version":"1.0","event_id":"sha256:d651f52aa769440af9e1c242a71e7e57a53c5ac5ee7db2c58e02e719ca8afe47"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LF3R75N5CYXXPOOCGE52BN7BD5/bundle.json","state_url":"https://pith.science/pith/LF3R75N5CYXXPOOCGE52BN7BD5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LF3R75N5CYXXPOOCGE52BN7BD5/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-07T03:42:05Z","links":{"resolver":"https://pith.science/pith/LF3R75N5CYXXPOOCGE52BN7BD5","bundle":"https://pith.science/pith/LF3R75N5CYXXPOOCGE52BN7BD5/bundle.json","state":"https://pith.science/pith/LF3R75N5CYXXPOOCGE52BN7BD5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LF3R75N5CYXXPOOCGE52BN7BD5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:LF3R75N5CYXXPOOCGE52BN7BD5","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":"cb9493ecc74c0da1beaf0bc04f9d4d9e3b39d191bb7b2a60257451a845572b0a","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.NI","submitted_at":"2012-07-17T11:01:19Z","title_canon_sha256":"dc22911aab0248f9f8aa5d2e3e5a26ed3e14c4963ab0081253b38984e6740f90"},"schema_version":"1.0","source":{"id":"1207.3943","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.3943","created_at":"2026-05-18T03:50:49Z"},{"alias_kind":"arxiv_version","alias_value":"1207.3943v1","created_at":"2026-05-18T03:50:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.3943","created_at":"2026-05-18T03:50:49Z"},{"alias_kind":"pith_short_12","alias_value":"LF3R75N5CYXX","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_16","alias_value":"LF3R75N5CYXXPOOC","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_8","alias_value":"LF3R75N5","created_at":"2026-05-18T12:27:14Z"}],"graph_snapshots":[{"event_id":"sha256:d651f52aa769440af9e1c242a71e7e57a53c5ac5ee7db2c58e02e719ca8afe47","target":"graph","created_at":"2026-05-18T03:50:49Z","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":"One of the main criteria in Vehicular Ad hoc Networks (VANETs) that has attracted the researchers' consideration is congestion control. Accordingly, many algorithms have been proposed to alleviate the congestion problem, although it is hard to find an appropriate algorithm for applications and safety messages among them. Safety messages encompass beacons and event-driven messages. Delay and reliability are essential requirements for event-driven messages. In crowded networks where beacon messages are broadcasted at a high number of frequencies by many vehicles, the Control Channel (CCH), which","authors_text":"Hassan Keshavarz, Mohammad Reza Jabbarpour Sattari, Rafidah Md Noor","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.NI","submitted_at":"2012-07-17T11:01:19Z","title":"A Taxonomy for Congestion Control Algorithms in Vehicular Ad Hoc Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.3943","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:d4233b9e5d04509a999f2294ab35cf4c53dffbbfe55130325ae65f06208d4e62","target":"record","created_at":"2026-05-18T03:50:49Z","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":"cb9493ecc74c0da1beaf0bc04f9d4d9e3b39d191bb7b2a60257451a845572b0a","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.NI","submitted_at":"2012-07-17T11:01:19Z","title_canon_sha256":"dc22911aab0248f9f8aa5d2e3e5a26ed3e14c4963ab0081253b38984e6740f90"},"schema_version":"1.0","source":{"id":"1207.3943","kind":"arxiv","version":1}},"canonical_sha256":"59771ff5bd162f77b9c2313ba0b7e11f4ffa654ce14405e01103e58b85f8bdb0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"59771ff5bd162f77b9c2313ba0b7e11f4ffa654ce14405e01103e58b85f8bdb0","first_computed_at":"2026-05-18T03:50:49.416193Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:50:49.416193Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KiK0J8ICdsZosm3sa+pGmT4msF1Ou9g+jDdpEktFObVYZp1Mj7ZRd4jSVoLwO1j8NRyLKRWEMEpPQLHJMrklBw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:50:49.416896Z","signed_message":"canonical_sha256_bytes"},"source_id":"1207.3943","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d4233b9e5d04509a999f2294ab35cf4c53dffbbfe55130325ae65f06208d4e62","sha256:d651f52aa769440af9e1c242a71e7e57a53c5ac5ee7db2c58e02e719ca8afe47"],"state_sha256":"bc32b554411857858f0881ce9e90e460ff4ca94dff0a0fc4f9205329f5843a16"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MaNizRUMEMGodUHt+b7Q4uJ8I7MfoYds60v83m6rN2WJVGtNijhfUmm+DspY9gMpoCCGZU6E6uiPDR1ppLvxDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T03:42:05.587568Z","bundle_sha256":"6d871f6f60b067f2eb9c749e8ddf6045abefa625589ab6316747857b7ce19d56"}}