{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:ABXPCQ4GFGFRM3DD3FVMZHZS3U","short_pith_number":"pith:ABXPCQ4G","canonical_record":{"source":{"id":"1302.0264","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-02-01T20:03:24Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"c115659b49ff6bc79a3db74fa3f3cd4b7df4ccbcc9683c52d005acab15f2b465","abstract_canon_sha256":"40aedffc5bf904c302952c70e7088dbf2b9a8b28329a1dfc57e55ce2f2bac6b9"},"schema_version":"1.0"},"canonical_sha256":"006ef14386298b166c63d96acc9f32dd27d4530a73a494490b27ddcf28fd25b6","source":{"kind":"arxiv","id":"1302.0264","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.0264","created_at":"2026-05-18T03:34:46Z"},{"alias_kind":"arxiv_version","alias_value":"1302.0264v1","created_at":"2026-05-18T03:34:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.0264","created_at":"2026-05-18T03:34:46Z"},{"alias_kind":"pith_short_12","alias_value":"ABXPCQ4GFGFR","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_16","alias_value":"ABXPCQ4GFGFRM3DD","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_8","alias_value":"ABXPCQ4G","created_at":"2026-05-18T12:27:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:ABXPCQ4GFGFRM3DD3FVMZHZS3U","target":"record","payload":{"canonical_record":{"source":{"id":"1302.0264","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-02-01T20:03:24Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"c115659b49ff6bc79a3db74fa3f3cd4b7df4ccbcc9683c52d005acab15f2b465","abstract_canon_sha256":"40aedffc5bf904c302952c70e7088dbf2b9a8b28329a1dfc57e55ce2f2bac6b9"},"schema_version":"1.0"},"canonical_sha256":"006ef14386298b166c63d96acc9f32dd27d4530a73a494490b27ddcf28fd25b6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:34:46.924302Z","signature_b64":"JGziWa9b3endJMMU+zr8R7TkEKQA7mYJgsQU3kQvprP71Thmrsr6H1c/8ZGfSCC1Cq/jziBtVpm/zdpfKmXtBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"006ef14386298b166c63d96acc9f32dd27d4530a73a494490b27ddcf28fd25b6","last_reissued_at":"2026-05-18T03:34:46.923449Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:34:46.923449Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1302.0264","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:34:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qetcfmvZga9BdeIz05kVNbOCuaHY+4LN7gEIrojBgOAOFflZjfemPzgr/U3bB9hx3sqEjZOw8hwN8IWpYf6gDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T14:47:15.618720Z"},"content_sha256":"b37612bbd5b963bbbfae15be673c76b056072c335c40aa1ab14586381be89a61","schema_version":"1.0","event_id":"sha256:b37612bbd5b963bbbfae15be673c76b056072c335c40aa1ab14586381be89a61"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:ABXPCQ4GFGFRM3DD3FVMZHZS3U","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Bound on the Throughput of Radio Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Bernhard Haeupler, Majid Khabbazian, Mohsen Ghaffari","submitted_at":"2013-02-01T20:03:24Z","abstract_excerpt":"We consider the well-studied radio network model: a synchronous model with a graph G=(V,E) with |V|=n where in each round, each node either transmits a packet, with length B=Omega(log n) bits, or listens. Each node receives a packet iff it is listening and exactly one of its neighbors is transmitting. We consider the problem of k-message broadcast, where k messages, each with Theta(B) bits, are placed in an arbitrary nodes of the graph and the goal is to deliver all messages to all the nodes. We present a simple proof showing that there exist a radio network with radius 2 where for any k, broa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.0264","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:34:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tcoSczBSY2eyir2Ypzj0LxEUJwAZWqOqDXTlpMZenU86zfuJPu8H6fh6r7R1jxGoLIdbdwdr+EViuuAg0XmyDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T14:47:15.619417Z"},"content_sha256":"2b2a4fbf5613f7970b73a72b41c55f552ebbadc37d232eef655857ee1af64300","schema_version":"1.0","event_id":"sha256:2b2a4fbf5613f7970b73a72b41c55f552ebbadc37d232eef655857ee1af64300"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ABXPCQ4GFGFRM3DD3FVMZHZS3U/bundle.json","state_url":"https://pith.science/pith/ABXPCQ4GFGFRM3DD3FVMZHZS3U/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ABXPCQ4GFGFRM3DD3FVMZHZS3U/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-31T14:47:15Z","links":{"resolver":"https://pith.science/pith/ABXPCQ4GFGFRM3DD3FVMZHZS3U","bundle":"https://pith.science/pith/ABXPCQ4GFGFRM3DD3FVMZHZS3U/bundle.json","state":"https://pith.science/pith/ABXPCQ4GFGFRM3DD3FVMZHZS3U/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ABXPCQ4GFGFRM3DD3FVMZHZS3U/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:ABXPCQ4GFGFRM3DD3FVMZHZS3U","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":"40aedffc5bf904c302952c70e7088dbf2b9a8b28329a1dfc57e55ce2f2bac6b9","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-02-01T20:03:24Z","title_canon_sha256":"c115659b49ff6bc79a3db74fa3f3cd4b7df4ccbcc9683c52d005acab15f2b465"},"schema_version":"1.0","source":{"id":"1302.0264","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.0264","created_at":"2026-05-18T03:34:46Z"},{"alias_kind":"arxiv_version","alias_value":"1302.0264v1","created_at":"2026-05-18T03:34:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.0264","created_at":"2026-05-18T03:34:46Z"},{"alias_kind":"pith_short_12","alias_value":"ABXPCQ4GFGFR","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_16","alias_value":"ABXPCQ4GFGFRM3DD","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_8","alias_value":"ABXPCQ4G","created_at":"2026-05-18T12:27:38Z"}],"graph_snapshots":[{"event_id":"sha256:2b2a4fbf5613f7970b73a72b41c55f552ebbadc37d232eef655857ee1af64300","target":"graph","created_at":"2026-05-18T03:34:46Z","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 consider the well-studied radio network model: a synchronous model with a graph G=(V,E) with |V|=n where in each round, each node either transmits a packet, with length B=Omega(log n) bits, or listens. Each node receives a packet iff it is listening and exactly one of its neighbors is transmitting. We consider the problem of k-message broadcast, where k messages, each with Theta(B) bits, are placed in an arbitrary nodes of the graph and the goal is to deliver all messages to all the nodes. We present a simple proof showing that there exist a radio network with radius 2 where for any k, broa","authors_text":"Bernhard Haeupler, Majid Khabbazian, Mohsen Ghaffari","cross_cats":["cs.DC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-02-01T20:03:24Z","title":"A Bound on the Throughput of Radio Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.0264","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:b37612bbd5b963bbbfae15be673c76b056072c335c40aa1ab14586381be89a61","target":"record","created_at":"2026-05-18T03:34:46Z","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":"40aedffc5bf904c302952c70e7088dbf2b9a8b28329a1dfc57e55ce2f2bac6b9","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-02-01T20:03:24Z","title_canon_sha256":"c115659b49ff6bc79a3db74fa3f3cd4b7df4ccbcc9683c52d005acab15f2b465"},"schema_version":"1.0","source":{"id":"1302.0264","kind":"arxiv","version":1}},"canonical_sha256":"006ef14386298b166c63d96acc9f32dd27d4530a73a494490b27ddcf28fd25b6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"006ef14386298b166c63d96acc9f32dd27d4530a73a494490b27ddcf28fd25b6","first_computed_at":"2026-05-18T03:34:46.923449Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:34:46.923449Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JGziWa9b3endJMMU+zr8R7TkEKQA7mYJgsQU3kQvprP71Thmrsr6H1c/8ZGfSCC1Cq/jziBtVpm/zdpfKmXtBw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:34:46.924302Z","signed_message":"canonical_sha256_bytes"},"source_id":"1302.0264","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b37612bbd5b963bbbfae15be673c76b056072c335c40aa1ab14586381be89a61","sha256:2b2a4fbf5613f7970b73a72b41c55f552ebbadc37d232eef655857ee1af64300"],"state_sha256":"4599ab4a487020a540d3655165646678b1ef278811d9c40400b78a49b0276058"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qszNjX7M2wm7ubeCR7ynMFgXnqaVvLzjlrWwypt9EZj/cUsi6Ucry2JD9vGXtZjMF5varxvL+1qLRDk/aByzBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T14:47:15.623106Z","bundle_sha256":"40c04021d699f1816f0a8f92a09d055e69c3a326945baad67f5d2ff5286b1676"}}