{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:IHGNH74HD4EI4YU4RH6UML2OSA","short_pith_number":"pith:IHGNH74H","schema_version":"1.0","canonical_sha256":"41ccd3ff871f088e629c89fd462f4e902b0cd8c0ee2e5e12ac119931d5d7e59c","source":{"kind":"arxiv","id":"1604.00446","version":1},"attestation_state":"computed","paper":{"title":"Throughput-Optimal Multi-hop Broadcast Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.NI","math.IT"],"primary_cat":"cs.DS","authors_text":"Abhishek Sinha, Eytan Modiano, Georgios Paschos","submitted_at":"2016-04-02T00:54:11Z","abstract_excerpt":"In this paper we design throughput-optimal dynamic broad- cast algorithms for multi-hop networks with arbitrary topolo- gies. Most of the previous broadcast algorithms route pack- ets along spanning trees, rooted at the source node. For large dynamic networks, computing and maintaining a set of spanning trees is not efficient, as the network-topology may change frequently. In this paper we design a class of dynamic algorithms which makes packet-by-packet schedul- ing and routing decisions and thus obviates the need for maintaining any global topological structures, such as span- ning trees. Ou"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1604.00446","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-04-02T00:54:11Z","cross_cats_sorted":["cs.IT","cs.NI","math.IT"],"title_canon_sha256":"bb9e4d316c455995a404382207404a9a60b7943d037951b30aa1685e1b6a41ba","abstract_canon_sha256":"5ead8a4b81ef7400909a77587a0dc20d2e2e0e40f6abdc69c8c0d6bded4104dc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:17:49.582293Z","signature_b64":"1ONO4jeI26wi1VE8LrCb8pjaOVC7aS437gJPvGLRj6UPUx/YWFbnH1hmJ3RFVpH+tJrlEW7aZaJhdie7yk5wBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"41ccd3ff871f088e629c89fd462f4e902b0cd8c0ee2e5e12ac119931d5d7e59c","last_reissued_at":"2026-05-18T01:17:49.581610Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:17:49.581610Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Throughput-Optimal Multi-hop Broadcast Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.NI","math.IT"],"primary_cat":"cs.DS","authors_text":"Abhishek Sinha, Eytan Modiano, Georgios Paschos","submitted_at":"2016-04-02T00:54:11Z","abstract_excerpt":"In this paper we design throughput-optimal dynamic broad- cast algorithms for multi-hop networks with arbitrary topolo- gies. Most of the previous broadcast algorithms route pack- ets along spanning trees, rooted at the source node. For large dynamic networks, computing and maintaining a set of spanning trees is not efficient, as the network-topology may change frequently. In this paper we design a class of dynamic algorithms which makes packet-by-packet schedul- ing and routing decisions and thus obviates the need for maintaining any global topological structures, such as span- ning trees. Ou"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.00446","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1604.00446","created_at":"2026-05-18T01:17:49.581726+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.00446v1","created_at":"2026-05-18T01:17:49.581726+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.00446","created_at":"2026-05-18T01:17:49.581726+00:00"},{"alias_kind":"pith_short_12","alias_value":"IHGNH74HD4EI","created_at":"2026-05-18T12:30:22.444734+00:00"},{"alias_kind":"pith_short_16","alias_value":"IHGNH74HD4EI4YU4","created_at":"2026-05-18T12:30:22.444734+00:00"},{"alias_kind":"pith_short_8","alias_value":"IHGNH74H","created_at":"2026-05-18T12:30:22.444734+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IHGNH74HD4EI4YU4RH6UML2OSA","json":"https://pith.science/pith/IHGNH74HD4EI4YU4RH6UML2OSA.json","graph_json":"https://pith.science/api/pith-number/IHGNH74HD4EI4YU4RH6UML2OSA/graph.json","events_json":"https://pith.science/api/pith-number/IHGNH74HD4EI4YU4RH6UML2OSA/events.json","paper":"https://pith.science/paper/IHGNH74H"},"agent_actions":{"view_html":"https://pith.science/pith/IHGNH74HD4EI4YU4RH6UML2OSA","download_json":"https://pith.science/pith/IHGNH74HD4EI4YU4RH6UML2OSA.json","view_paper":"https://pith.science/paper/IHGNH74H","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.00446&json=true","fetch_graph":"https://pith.science/api/pith-number/IHGNH74HD4EI4YU4RH6UML2OSA/graph.json","fetch_events":"https://pith.science/api/pith-number/IHGNH74HD4EI4YU4RH6UML2OSA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IHGNH74HD4EI4YU4RH6UML2OSA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IHGNH74HD4EI4YU4RH6UML2OSA/action/storage_attestation","attest_author":"https://pith.science/pith/IHGNH74HD4EI4YU4RH6UML2OSA/action/author_attestation","sign_citation":"https://pith.science/pith/IHGNH74HD4EI4YU4RH6UML2OSA/action/citation_signature","submit_replication":"https://pith.science/pith/IHGNH74HD4EI4YU4RH6UML2OSA/action/replication_record"}},"created_at":"2026-05-18T01:17:49.581726+00:00","updated_at":"2026-05-18T01:17:49.581726+00:00"}