{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:DTPBXI7J7OHFLMXABM4IN2N57U","short_pith_number":"pith:DTPBXI7J","canonical_record":{"source":{"id":"1205.7014","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-05-31T15:03:58Z","cross_cats_sorted":["cs.DC","math.CO"],"title_canon_sha256":"f9741c8b6dcc799b5cda02e26de4d20e94c824f2892452d9cd587cd086741ab3","abstract_canon_sha256":"bebbacd2da9a178a2a9020dd437a93836c822d4b312266901b1e496b122916cd"},"schema_version":"1.0"},"canonical_sha256":"1cde1ba3e9fb8e55b2e00b3886e9bdfd3d24a1890e226ca3e56cd2e7dceeb6fe","source":{"kind":"arxiv","id":"1205.7014","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.7014","created_at":"2026-05-18T02:44:07Z"},{"alias_kind":"arxiv_version","alias_value":"1205.7014v3","created_at":"2026-05-18T02:44:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.7014","created_at":"2026-05-18T02:44:07Z"},{"alias_kind":"pith_short_12","alias_value":"DTPBXI7J7OHF","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_16","alias_value":"DTPBXI7J7OHFLMXA","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_8","alias_value":"DTPBXI7J","created_at":"2026-05-18T12:27:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:DTPBXI7J7OHFLMXABM4IN2N57U","target":"record","payload":{"canonical_record":{"source":{"id":"1205.7014","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-05-31T15:03:58Z","cross_cats_sorted":["cs.DC","math.CO"],"title_canon_sha256":"f9741c8b6dcc799b5cda02e26de4d20e94c824f2892452d9cd587cd086741ab3","abstract_canon_sha256":"bebbacd2da9a178a2a9020dd437a93836c822d4b312266901b1e496b122916cd"},"schema_version":"1.0"},"canonical_sha256":"1cde1ba3e9fb8e55b2e00b3886e9bdfd3d24a1890e226ca3e56cd2e7dceeb6fe","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:44:07.202973Z","signature_b64":"4OwZyfBi2OgvsIP8vZS9s5dsEtDngh/2c4a7XL5o+MBLo9kkfPfT/m5xazA7KtFWODhYkAJt7HIzCr4EEhjDDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1cde1ba3e9fb8e55b2e00b3886e9bdfd3d24a1890e226ca3e56cd2e7dceeb6fe","last_reissued_at":"2026-05-18T02:44:07.202441Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:44:07.202441Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1205.7014","source_version":3,"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:44:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TU6+Hu+uH7aezTfdEH8tuOthdooiUVjq1mP9GZnktxAuUKTJuP4+tnSeVzXxdQ3xvLG3inHZ8I9bW5As/vHeBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T09:23:44.684723Z"},"content_sha256":"44c468c13ed4204ce4afd0d67adb04164acf618b8ade58417b27190d36f76c01","schema_version":"1.0","event_id":"sha256:44c468c13ed4204ce4afd0d67adb04164acf618b8ade58417b27190d36f76c01"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:DTPBXI7J7OHFLMXABM4IN2N57U","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Broadcast Throughput in Radio Networks: Routing vs. Network Coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","math.CO"],"primary_cat":"cs.DS","authors_text":"Bernhard Haeupler, Majid Khabbazian, Mohsen Ghaffari, Noga Alon","submitted_at":"2012-05-31T15:03:58Z","abstract_excerpt":"The broadcast throughput in a network is defined as the average number of messages that can be transmitted per unit time from a given source to all other nodes when time goes to infinity.\n  Classical broadcast algorithms treat messages as atomic tokens and route them from the source to the receivers by making intermediate nodes store and forward messages. The more recent network coding approach, in contrast, prompts intermediate nodes to mix and code together messages. It has been shown that certain wired networks have an asymptotic network coding gap, that is, they have asymptotically higher "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.7014","kind":"arxiv","version":3},"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:44:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o341CcbbJScoAn70+cIfpttaynquHJAkbuZTLlzyPtaVRYsSl5SUF7rXCTZwd0x4kB2SYDny8qPRfXE18OfBDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T09:23:44.685381Z"},"content_sha256":"e784d357aa6af0148885d887a175a5c4193a72d1721c1aaa57a7c09c70b4abda","schema_version":"1.0","event_id":"sha256:e784d357aa6af0148885d887a175a5c4193a72d1721c1aaa57a7c09c70b4abda"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DTPBXI7J7OHFLMXABM4IN2N57U/bundle.json","state_url":"https://pith.science/pith/DTPBXI7J7OHFLMXABM4IN2N57U/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DTPBXI7J7OHFLMXABM4IN2N57U/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-31T09:23:44Z","links":{"resolver":"https://pith.science/pith/DTPBXI7J7OHFLMXABM4IN2N57U","bundle":"https://pith.science/pith/DTPBXI7J7OHFLMXABM4IN2N57U/bundle.json","state":"https://pith.science/pith/DTPBXI7J7OHFLMXABM4IN2N57U/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DTPBXI7J7OHFLMXABM4IN2N57U/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:DTPBXI7J7OHFLMXABM4IN2N57U","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":"bebbacd2da9a178a2a9020dd437a93836c822d4b312266901b1e496b122916cd","cross_cats_sorted":["cs.DC","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-05-31T15:03:58Z","title_canon_sha256":"f9741c8b6dcc799b5cda02e26de4d20e94c824f2892452d9cd587cd086741ab3"},"schema_version":"1.0","source":{"id":"1205.7014","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.7014","created_at":"2026-05-18T02:44:07Z"},{"alias_kind":"arxiv_version","alias_value":"1205.7014v3","created_at":"2026-05-18T02:44:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.7014","created_at":"2026-05-18T02:44:07Z"},{"alias_kind":"pith_short_12","alias_value":"DTPBXI7J7OHF","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_16","alias_value":"DTPBXI7J7OHFLMXA","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_8","alias_value":"DTPBXI7J","created_at":"2026-05-18T12:27:04Z"}],"graph_snapshots":[{"event_id":"sha256:e784d357aa6af0148885d887a175a5c4193a72d1721c1aaa57a7c09c70b4abda","target":"graph","created_at":"2026-05-18T02:44:07Z","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":"The broadcast throughput in a network is defined as the average number of messages that can be transmitted per unit time from a given source to all other nodes when time goes to infinity.\n  Classical broadcast algorithms treat messages as atomic tokens and route them from the source to the receivers by making intermediate nodes store and forward messages. The more recent network coding approach, in contrast, prompts intermediate nodes to mix and code together messages. It has been shown that certain wired networks have an asymptotic network coding gap, that is, they have asymptotically higher ","authors_text":"Bernhard Haeupler, Majid Khabbazian, Mohsen Ghaffari, Noga Alon","cross_cats":["cs.DC","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-05-31T15:03:58Z","title":"Broadcast Throughput in Radio Networks: Routing vs. Network Coding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.7014","kind":"arxiv","version":3},"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:44c468c13ed4204ce4afd0d67adb04164acf618b8ade58417b27190d36f76c01","target":"record","created_at":"2026-05-18T02:44:07Z","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":"bebbacd2da9a178a2a9020dd437a93836c822d4b312266901b1e496b122916cd","cross_cats_sorted":["cs.DC","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-05-31T15:03:58Z","title_canon_sha256":"f9741c8b6dcc799b5cda02e26de4d20e94c824f2892452d9cd587cd086741ab3"},"schema_version":"1.0","source":{"id":"1205.7014","kind":"arxiv","version":3}},"canonical_sha256":"1cde1ba3e9fb8e55b2e00b3886e9bdfd3d24a1890e226ca3e56cd2e7dceeb6fe","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1cde1ba3e9fb8e55b2e00b3886e9bdfd3d24a1890e226ca3e56cd2e7dceeb6fe","first_computed_at":"2026-05-18T02:44:07.202441Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:44:07.202441Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4OwZyfBi2OgvsIP8vZS9s5dsEtDngh/2c4a7XL5o+MBLo9kkfPfT/m5xazA7KtFWODhYkAJt7HIzCr4EEhjDDA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:44:07.202973Z","signed_message":"canonical_sha256_bytes"},"source_id":"1205.7014","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:44c468c13ed4204ce4afd0d67adb04164acf618b8ade58417b27190d36f76c01","sha256:e784d357aa6af0148885d887a175a5c4193a72d1721c1aaa57a7c09c70b4abda"],"state_sha256":"a9af04e7551fe0b4af8572aa88a1c36e4f5a9883558151c6fd78c927f82e5f90"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MxcJc3QE66jTTsLqOseas19X4ce+JqDll1BZKsp3hpPagvk9J6CSPo7m5A37ylz2vl2Yg/OEppIODDM+PRHhAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T09:23:44.688900Z","bundle_sha256":"9ef5efedd49eed3a7922702e6938a7dfd16f6c9b32abc27890f03fb5f3998ade"}}