{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:MXGEWUH3OP52NHDOFOGNLH2WQI","short_pith_number":"pith:MXGEWUH3","canonical_record":{"source":{"id":"1604.00576","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-04-03T00:09:19Z","cross_cats_sorted":["cs.DS","cs.NI","math.IT"],"title_canon_sha256":"5bbffd9d66ac415f9c6824bb526467880447c6952cf02a2519ac08c693bfb62e","abstract_canon_sha256":"131d8f49af9b0b8628808504b4080a93c46228a4b6eff721f0ac6fec5dcfd4e1"},"schema_version":"1.0"},"canonical_sha256":"65cc4b50fb73fba69c6e2b8cd59f5682239f22ea0053b1d39be095f62d0ddb97","source":{"kind":"arxiv","id":"1604.00576","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.00576","created_at":"2026-05-18T01:17:49Z"},{"alias_kind":"arxiv_version","alias_value":"1604.00576v1","created_at":"2026-05-18T01:17:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.00576","created_at":"2026-05-18T01:17:49Z"},{"alias_kind":"pith_short_12","alias_value":"MXGEWUH3OP52","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"MXGEWUH3OP52NHDO","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"MXGEWUH3","created_at":"2026-05-18T12:30:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:MXGEWUH3OP52NHDOFOGNLH2WQI","target":"record","payload":{"canonical_record":{"source":{"id":"1604.00576","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-04-03T00:09:19Z","cross_cats_sorted":["cs.DS","cs.NI","math.IT"],"title_canon_sha256":"5bbffd9d66ac415f9c6824bb526467880447c6952cf02a2519ac08c693bfb62e","abstract_canon_sha256":"131d8f49af9b0b8628808504b4080a93c46228a4b6eff721f0ac6fec5dcfd4e1"},"schema_version":"1.0"},"canonical_sha256":"65cc4b50fb73fba69c6e2b8cd59f5682239f22ea0053b1d39be095f62d0ddb97","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:17:49.077138Z","signature_b64":"GXKguc1gGhu5+q+etvDCm+w0H6MSLLSVGAo8UI9RLrL28ojs201JtAX/IBGpe0AM2sZemUM2PBVq9qMIQoFrBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"65cc4b50fb73fba69c6e2b8cd59f5682239f22ea0053b1d39be095f62d0ddb97","last_reissued_at":"2026-05-18T01:17:49.076437Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:17:49.076437Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1604.00576","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-18T01:17:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7trPuwqvsMuPcn30e0QVknjXlQuiZyX4oAEK6d7/SbwCMSSVMyDgixGb9Ud619uUJwSYaZ4W9BmUPaYcwQCTBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T23:01:32.460805Z"},"content_sha256":"4ad08a2e24ae13401441ac840e992531644c519e5d45254f48f18d730e52cf37","schema_version":"1.0","event_id":"sha256:4ad08a2e24ae13401441ac840e992531644c519e5d45254f48f18d730e52cf37"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:MXGEWUH3OP52NHDOFOGNLH2WQI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Throughput-Optimal Broadcast in Wireless Networks with Dynamic Topology","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.NI","math.IT"],"primary_cat":"cs.IT","authors_text":"Abhishek Sinha, Eytan Modiano, Leandros Tassiulas","submitted_at":"2016-04-03T00:09:19Z","abstract_excerpt":"We consider the problem of throughput-optimal broadcast- ing in time-varying wireless networks, whose underlying topology is restricted to Directed Acyclic Graphs (DAG). Previous broadcast algorithms route packets along spanning trees. In large networks with time-varying connectivities, these trees are difficult to compute and maintain. In this paper we propose a new online throughput-optimal broadcast algorithm which makes packet-by-packet scheduling and routing decisions, obviating the need for maintaining any global topological structures, such as spanning-trees. Our algorithm relies on sys"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.00576","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-18T01:17:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qaccgHpm6Sc7A8WTO4fmddlgXNhoK/tugK9wDDQfj0Um718y1CtBImUpobH47Cyr9pD1L093/QkLwer2VhBZAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T23:01:32.461187Z"},"content_sha256":"74927a60a61d97aa53d4b94241109cbb6601b166cbf80b6e874c01d1e305044d","schema_version":"1.0","event_id":"sha256:74927a60a61d97aa53d4b94241109cbb6601b166cbf80b6e874c01d1e305044d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MXGEWUH3OP52NHDOFOGNLH2WQI/bundle.json","state_url":"https://pith.science/pith/MXGEWUH3OP52NHDOFOGNLH2WQI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MXGEWUH3OP52NHDOFOGNLH2WQI/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:01:32Z","links":{"resolver":"https://pith.science/pith/MXGEWUH3OP52NHDOFOGNLH2WQI","bundle":"https://pith.science/pith/MXGEWUH3OP52NHDOFOGNLH2WQI/bundle.json","state":"https://pith.science/pith/MXGEWUH3OP52NHDOFOGNLH2WQI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MXGEWUH3OP52NHDOFOGNLH2WQI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:MXGEWUH3OP52NHDOFOGNLH2WQI","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":"131d8f49af9b0b8628808504b4080a93c46228a4b6eff721f0ac6fec5dcfd4e1","cross_cats_sorted":["cs.DS","cs.NI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-04-03T00:09:19Z","title_canon_sha256":"5bbffd9d66ac415f9c6824bb526467880447c6952cf02a2519ac08c693bfb62e"},"schema_version":"1.0","source":{"id":"1604.00576","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.00576","created_at":"2026-05-18T01:17:49Z"},{"alias_kind":"arxiv_version","alias_value":"1604.00576v1","created_at":"2026-05-18T01:17:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.00576","created_at":"2026-05-18T01:17:49Z"},{"alias_kind":"pith_short_12","alias_value":"MXGEWUH3OP52","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"MXGEWUH3OP52NHDO","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"MXGEWUH3","created_at":"2026-05-18T12:30:32Z"}],"graph_snapshots":[{"event_id":"sha256:74927a60a61d97aa53d4b94241109cbb6601b166cbf80b6e874c01d1e305044d","target":"graph","created_at":"2026-05-18T01:17: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":"We consider the problem of throughput-optimal broadcast- ing in time-varying wireless networks, whose underlying topology is restricted to Directed Acyclic Graphs (DAG). Previous broadcast algorithms route packets along spanning trees. In large networks with time-varying connectivities, these trees are difficult to compute and maintain. In this paper we propose a new online throughput-optimal broadcast algorithm which makes packet-by-packet scheduling and routing decisions, obviating the need for maintaining any global topological structures, such as spanning-trees. Our algorithm relies on sys","authors_text":"Abhishek Sinha, Eytan Modiano, Leandros Tassiulas","cross_cats":["cs.DS","cs.NI","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-04-03T00:09:19Z","title":"Throughput-Optimal Broadcast in Wireless Networks with Dynamic Topology"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.00576","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:4ad08a2e24ae13401441ac840e992531644c519e5d45254f48f18d730e52cf37","target":"record","created_at":"2026-05-18T01:17: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":"131d8f49af9b0b8628808504b4080a93c46228a4b6eff721f0ac6fec5dcfd4e1","cross_cats_sorted":["cs.DS","cs.NI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-04-03T00:09:19Z","title_canon_sha256":"5bbffd9d66ac415f9c6824bb526467880447c6952cf02a2519ac08c693bfb62e"},"schema_version":"1.0","source":{"id":"1604.00576","kind":"arxiv","version":1}},"canonical_sha256":"65cc4b50fb73fba69c6e2b8cd59f5682239f22ea0053b1d39be095f62d0ddb97","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"65cc4b50fb73fba69c6e2b8cd59f5682239f22ea0053b1d39be095f62d0ddb97","first_computed_at":"2026-05-18T01:17:49.076437Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:17:49.076437Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GXKguc1gGhu5+q+etvDCm+w0H6MSLLSVGAo8UI9RLrL28ojs201JtAX/IBGpe0AM2sZemUM2PBVq9qMIQoFrBw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:17:49.077138Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.00576","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4ad08a2e24ae13401441ac840e992531644c519e5d45254f48f18d730e52cf37","sha256:74927a60a61d97aa53d4b94241109cbb6601b166cbf80b6e874c01d1e305044d"],"state_sha256":"c6119f084a40ab41462736ba5bc19e2a9861d44fb9e0e697b17f493fbe0fd9a2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7YvfgoXLze8AEraUrpgOkNIbM32YRZyw3pl9If9XoRu37IcYl7lWbTqK9zRVZ64i541p8jz9kVC6hxKjl7QMBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T23:01:32.464433Z","bundle_sha256":"417b7ee2947c68c44726579bbae8a4e2ff1eabe3b4e73b6721e39730307fb108"}}