{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:UCNM6EZVA5DEWCZ3RRCALVPXVD","short_pith_number":"pith:UCNM6EZV","canonical_record":{"source":{"id":"1411.6172","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-11-22T22:07:54Z","cross_cats_sorted":[],"title_canon_sha256":"0842ae8e6404d37ad09f68b3bbe128d9801e77735f1d74d4e54e0aa4af4893ae","abstract_canon_sha256":"177c9fcce7283fef43ae1493d7354b70215fdd7eeabb193e941bc2f3ec1da911"},"schema_version":"1.0"},"canonical_sha256":"a09acf133507464b0b3b8c4405d5f7a8df7fb09da49e058f37ef55af174c7a74","source":{"kind":"arxiv","id":"1411.6172","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.6172","created_at":"2026-05-18T02:33:00Z"},{"alias_kind":"arxiv_version","alias_value":"1411.6172v1","created_at":"2026-05-18T02:33:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.6172","created_at":"2026-05-18T02:33:00Z"},{"alias_kind":"pith_short_12","alias_value":"UCNM6EZVA5DE","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"UCNM6EZVA5DEWCZ3","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"UCNM6EZV","created_at":"2026-05-18T12:28:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:UCNM6EZVA5DEWCZ3RRCALVPXVD","target":"record","payload":{"canonical_record":{"source":{"id":"1411.6172","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-11-22T22:07:54Z","cross_cats_sorted":[],"title_canon_sha256":"0842ae8e6404d37ad09f68b3bbe128d9801e77735f1d74d4e54e0aa4af4893ae","abstract_canon_sha256":"177c9fcce7283fef43ae1493d7354b70215fdd7eeabb193e941bc2f3ec1da911"},"schema_version":"1.0"},"canonical_sha256":"a09acf133507464b0b3b8c4405d5f7a8df7fb09da49e058f37ef55af174c7a74","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:33:00.577146Z","signature_b64":"q/eLv5tUAaeC5WKo9L6tpbDhuRrKqEc+oQmRQk2eagqqm/OPdm1tTVMPNcwwJYHG7gZ/ckTmbjV0humPc6WWDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a09acf133507464b0b3b8c4405d5f7a8df7fb09da49e058f37ef55af174c7a74","last_reissued_at":"2026-05-18T02:33:00.576809Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:33:00.576809Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1411.6172","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-18T02:33:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4wPYi+11W0Qn/zUEWHBjLOq0pbBVG1qkjeY+PQaXH/RkcP9v5+UVz1taptn4Sai+j9Zo6EQSDz+K2phHRBGLBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T23:47:04.467650Z"},"content_sha256":"bb610eab54a969fe73b1bb8dabf5b3c552e2b915a582d926c0ac11790a44045e","schema_version":"1.0","event_id":"sha256:bb610eab54a969fe73b1bb8dabf5b3c552e2b915a582d926c0ac11790a44045e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:UCNM6EZVA5DEWCZ3RRCALVPXVD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Throughput-Optimal Broadcast on Directed Acyclic Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Abhishek Sinha, Chih-ping Li, Eytan Modiano, Georgios Paschos","submitted_at":"2014-11-22T22:07:54Z","abstract_excerpt":"We study the problem of broadcasting packets in wireless networks. At each time slot, a network controller activates non-interfering links and forwards packets to all nodes at a common rate; the maximum rate is referred to as the broadcast capacity of the wireless network. Existing policies achieve the broadcast capacity by balancing traffic over a set of spanning trees, which are difficult to maintain in a large and time-varying wireless network. We propose a new dynamic algorithm that achieves the broadcast capacity when the underlying network topology is a directed acyclic graph (DAG). This"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.6172","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-18T02:33:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P5/NC1yYfgU3ZOlOYfz93nlYkVqaDNG4mOIfLStNoBt9tdHhIi/wnPG1fTVkOuINyttt5scLEYOvupK4cuQqAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T23:47:04.468298Z"},"content_sha256":"bad043eee84d0e70da0d4d7c87996b7a91afbbd3794786ec5f0b93530ec4be3b","schema_version":"1.0","event_id":"sha256:bad043eee84d0e70da0d4d7c87996b7a91afbbd3794786ec5f0b93530ec4be3b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UCNM6EZVA5DEWCZ3RRCALVPXVD/bundle.json","state_url":"https://pith.science/pith/UCNM6EZVA5DEWCZ3RRCALVPXVD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UCNM6EZVA5DEWCZ3RRCALVPXVD/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-27T23:47:04Z","links":{"resolver":"https://pith.science/pith/UCNM6EZVA5DEWCZ3RRCALVPXVD","bundle":"https://pith.science/pith/UCNM6EZVA5DEWCZ3RRCALVPXVD/bundle.json","state":"https://pith.science/pith/UCNM6EZVA5DEWCZ3RRCALVPXVD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UCNM6EZVA5DEWCZ3RRCALVPXVD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:UCNM6EZVA5DEWCZ3RRCALVPXVD","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":"177c9fcce7283fef43ae1493d7354b70215fdd7eeabb193e941bc2f3ec1da911","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-11-22T22:07:54Z","title_canon_sha256":"0842ae8e6404d37ad09f68b3bbe128d9801e77735f1d74d4e54e0aa4af4893ae"},"schema_version":"1.0","source":{"id":"1411.6172","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.6172","created_at":"2026-05-18T02:33:00Z"},{"alias_kind":"arxiv_version","alias_value":"1411.6172v1","created_at":"2026-05-18T02:33:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.6172","created_at":"2026-05-18T02:33:00Z"},{"alias_kind":"pith_short_12","alias_value":"UCNM6EZVA5DE","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"UCNM6EZVA5DEWCZ3","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"UCNM6EZV","created_at":"2026-05-18T12:28:52Z"}],"graph_snapshots":[{"event_id":"sha256:bad043eee84d0e70da0d4d7c87996b7a91afbbd3794786ec5f0b93530ec4be3b","target":"graph","created_at":"2026-05-18T02:33:00Z","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 study the problem of broadcasting packets in wireless networks. At each time slot, a network controller activates non-interfering links and forwards packets to all nodes at a common rate; the maximum rate is referred to as the broadcast capacity of the wireless network. Existing policies achieve the broadcast capacity by balancing traffic over a set of spanning trees, which are difficult to maintain in a large and time-varying wireless network. We propose a new dynamic algorithm that achieves the broadcast capacity when the underlying network topology is a directed acyclic graph (DAG). This","authors_text":"Abhishek Sinha, Chih-ping Li, Eytan Modiano, Georgios Paschos","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-11-22T22:07:54Z","title":"Throughput-Optimal Broadcast on Directed Acyclic Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.6172","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:bb610eab54a969fe73b1bb8dabf5b3c552e2b915a582d926c0ac11790a44045e","target":"record","created_at":"2026-05-18T02:33:00Z","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":"177c9fcce7283fef43ae1493d7354b70215fdd7eeabb193e941bc2f3ec1da911","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-11-22T22:07:54Z","title_canon_sha256":"0842ae8e6404d37ad09f68b3bbe128d9801e77735f1d74d4e54e0aa4af4893ae"},"schema_version":"1.0","source":{"id":"1411.6172","kind":"arxiv","version":1}},"canonical_sha256":"a09acf133507464b0b3b8c4405d5f7a8df7fb09da49e058f37ef55af174c7a74","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a09acf133507464b0b3b8c4405d5f7a8df7fb09da49e058f37ef55af174c7a74","first_computed_at":"2026-05-18T02:33:00.576809Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:33:00.576809Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"q/eLv5tUAaeC5WKo9L6tpbDhuRrKqEc+oQmRQk2eagqqm/OPdm1tTVMPNcwwJYHG7gZ/ckTmbjV0humPc6WWDw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:33:00.577146Z","signed_message":"canonical_sha256_bytes"},"source_id":"1411.6172","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bb610eab54a969fe73b1bb8dabf5b3c552e2b915a582d926c0ac11790a44045e","sha256:bad043eee84d0e70da0d4d7c87996b7a91afbbd3794786ec5f0b93530ec4be3b"],"state_sha256":"40674bb7378635caecee155c0084f0e21602f9b26c45915a8feb33bd881d8beb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CfEFkVCUGmx3hCyIR+pNSq4H1cRdZatveSc0IiOkCSkIRv4xpQgZgIhUupyFFfOr1eAmCHitzJGuLzmRsP8nBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T23:47:04.471533Z","bundle_sha256":"b21d60f768b7c95d42f8f219dda5a703139a43a3a6d8bc1aeb7d52ed0f2778f3"}}