{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:NAB4T5QXKWOWR6IK5UYQJL7OON","short_pith_number":"pith:NAB4T5QX","canonical_record":{"source":{"id":"1702.05197","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2017-02-17T00:50:45Z","cross_cats_sorted":["cs.IT","math.IT","math.OC"],"title_canon_sha256":"4acd020e44abe9c2992c42f37a0fa9b62fc3153ebb957ef3984f85f4659c599c","abstract_canon_sha256":"35e4e985167a950625828b78a3b734673f89e0a9403da847e139e531fbfe03fd"},"schema_version":"1.0"},"canonical_sha256":"6803c9f617559d68f90aed3104afee73438bd3241f4fcab9da5ea0aa3eb59d11","source":{"kind":"arxiv","id":"1702.05197","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.05197","created_at":"2026-05-18T00:50:34Z"},{"alias_kind":"arxiv_version","alias_value":"1702.05197v1","created_at":"2026-05-18T00:50:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.05197","created_at":"2026-05-18T00:50:34Z"},{"alias_kind":"pith_short_12","alias_value":"NAB4T5QXKWOW","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"NAB4T5QXKWOWR6IK","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"NAB4T5QX","created_at":"2026-05-18T12:31:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:NAB4T5QXKWOWR6IK5UYQJL7OON","target":"record","payload":{"canonical_record":{"source":{"id":"1702.05197","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2017-02-17T00:50:45Z","cross_cats_sorted":["cs.IT","math.IT","math.OC"],"title_canon_sha256":"4acd020e44abe9c2992c42f37a0fa9b62fc3153ebb957ef3984f85f4659c599c","abstract_canon_sha256":"35e4e985167a950625828b78a3b734673f89e0a9403da847e139e531fbfe03fd"},"schema_version":"1.0"},"canonical_sha256":"6803c9f617559d68f90aed3104afee73438bd3241f4fcab9da5ea0aa3eb59d11","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:50:34.513696Z","signature_b64":"jWmfpPDLjK8XqowDOMH4xdhvzeJbIKWcyVecUQkzNaMvzv0pEN77g9aID7PL6QRbRRse5G+rXH0bZiU2QXJtAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6803c9f617559d68f90aed3104afee73438bd3241f4fcab9da5ea0aa3eb59d11","last_reissued_at":"2026-05-18T00:50:34.513047Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:50:34.513047Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1702.05197","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-18T00:50:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bpgvdr6VEDYpzs6agItOPHwyLOhsmRTDlNMkZ9lAjslYZtZo+U0OIKFdoZu/Y3mi89ACgXnnodrglp+FjxjpDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T13:03:11.333219Z"},"content_sha256":"d8bdfd14814a7d45f9459b99ae3fdbb25a300a46bba099f014521de7494509ae","schema_version":"1.0","event_id":"sha256:d8bdfd14814a7d45f9459b99ae3fdbb25a300a46bba099f014521de7494509ae"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:NAB4T5QXKWOWR6IK5UYQJL7OON","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Throughput-Optimal Broadcast in Wireless Networks with Point-to-Multipoint Transmissions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT","math.OC"],"primary_cat":"cs.NI","authors_text":"Abhishek Sinha, Eytan Modiano","submitted_at":"2017-02-17T00:50:45Z","abstract_excerpt":"We consider the problem of efficient packet dissemination in wireless networks with point-to-multi-point wireless broadcast channels. We propose a dynamic policy, which achieves the broadcast capacity of the network. This policy is obtained by first transforming the original multi-hop network into a precedence-relaxed virtual single-hop network and then finding an optimal broadcast policy for the relaxed network. The resulting policy is shown to be throughput-optimal for the original wireless network using a sample-path argument. We also prove the NP-completeness of the finite-horizon broadcas"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.05197","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-18T00:50:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xY2OB6OvWYl9L8KtVIKyoWFfK8lu1N2dw+vw+YMgxnNnmRvkmzqhbs82BiA1TRe3U3a7fe4EF9LWQCsLROiRCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T13:03:11.333584Z"},"content_sha256":"286ebafb50145031a0880c8d517365d1e84aa93326f55b3c2709d20b3db0d1a0","schema_version":"1.0","event_id":"sha256:286ebafb50145031a0880c8d517365d1e84aa93326f55b3c2709d20b3db0d1a0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NAB4T5QXKWOWR6IK5UYQJL7OON/bundle.json","state_url":"https://pith.science/pith/NAB4T5QXKWOWR6IK5UYQJL7OON/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NAB4T5QXKWOWR6IK5UYQJL7OON/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-01T13:03:11Z","links":{"resolver":"https://pith.science/pith/NAB4T5QXKWOWR6IK5UYQJL7OON","bundle":"https://pith.science/pith/NAB4T5QXKWOWR6IK5UYQJL7OON/bundle.json","state":"https://pith.science/pith/NAB4T5QXKWOWR6IK5UYQJL7OON/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NAB4T5QXKWOWR6IK5UYQJL7OON/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:NAB4T5QXKWOWR6IK5UYQJL7OON","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":"35e4e985167a950625828b78a3b734673f89e0a9403da847e139e531fbfe03fd","cross_cats_sorted":["cs.IT","math.IT","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2017-02-17T00:50:45Z","title_canon_sha256":"4acd020e44abe9c2992c42f37a0fa9b62fc3153ebb957ef3984f85f4659c599c"},"schema_version":"1.0","source":{"id":"1702.05197","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.05197","created_at":"2026-05-18T00:50:34Z"},{"alias_kind":"arxiv_version","alias_value":"1702.05197v1","created_at":"2026-05-18T00:50:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.05197","created_at":"2026-05-18T00:50:34Z"},{"alias_kind":"pith_short_12","alias_value":"NAB4T5QXKWOW","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"NAB4T5QXKWOWR6IK","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"NAB4T5QX","created_at":"2026-05-18T12:31:31Z"}],"graph_snapshots":[{"event_id":"sha256:286ebafb50145031a0880c8d517365d1e84aa93326f55b3c2709d20b3db0d1a0","target":"graph","created_at":"2026-05-18T00:50:34Z","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 problem of efficient packet dissemination in wireless networks with point-to-multi-point wireless broadcast channels. We propose a dynamic policy, which achieves the broadcast capacity of the network. This policy is obtained by first transforming the original multi-hop network into a precedence-relaxed virtual single-hop network and then finding an optimal broadcast policy for the relaxed network. The resulting policy is shown to be throughput-optimal for the original wireless network using a sample-path argument. We also prove the NP-completeness of the finite-horizon broadcas","authors_text":"Abhishek Sinha, Eytan Modiano","cross_cats":["cs.IT","math.IT","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2017-02-17T00:50:45Z","title":"Throughput-Optimal Broadcast in Wireless Networks with Point-to-Multipoint Transmissions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.05197","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:d8bdfd14814a7d45f9459b99ae3fdbb25a300a46bba099f014521de7494509ae","target":"record","created_at":"2026-05-18T00:50:34Z","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":"35e4e985167a950625828b78a3b734673f89e0a9403da847e139e531fbfe03fd","cross_cats_sorted":["cs.IT","math.IT","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2017-02-17T00:50:45Z","title_canon_sha256":"4acd020e44abe9c2992c42f37a0fa9b62fc3153ebb957ef3984f85f4659c599c"},"schema_version":"1.0","source":{"id":"1702.05197","kind":"arxiv","version":1}},"canonical_sha256":"6803c9f617559d68f90aed3104afee73438bd3241f4fcab9da5ea0aa3eb59d11","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6803c9f617559d68f90aed3104afee73438bd3241f4fcab9da5ea0aa3eb59d11","first_computed_at":"2026-05-18T00:50:34.513047Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:50:34.513047Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jWmfpPDLjK8XqowDOMH4xdhvzeJbIKWcyVecUQkzNaMvzv0pEN77g9aID7PL6QRbRRse5G+rXH0bZiU2QXJtAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:50:34.513696Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.05197","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d8bdfd14814a7d45f9459b99ae3fdbb25a300a46bba099f014521de7494509ae","sha256:286ebafb50145031a0880c8d517365d1e84aa93326f55b3c2709d20b3db0d1a0"],"state_sha256":"5e1c3d514046f3f0855874eea316b0859663defad1ea81397f7209f6ba102619"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IOdj9CHC6iBMUzXGbThkVynnQHFUnuboh5C0tNdvQT11mxgwnzzkCjjaglAbYqvIrXzSz5GKPJ46v7M+EHHoDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T13:03:11.335590Z","bundle_sha256":"a3a4a6ccc84d72331287bcc9ab5894df6dde57ed1437e18e6d3d7ce9922be9b2"}}