{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:ZJEWRMDW24ZMXMXRROFU5E2OCI","short_pith_number":"pith:ZJEWRMDW","schema_version":"1.0","canonical_sha256":"ca4968b076d732cbb2f18b8b4e934e1211db8a74d51e0aa86e8eba751d17e581","source":{"kind":"arxiv","id":"1507.05240","version":1},"attestation_state":"computed","paper":{"title":"Throughput-Optimal Multihop Broadcast on Directed Acyclic Wireless Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Abhishek Sinha, Chih-ping Li, Eytan Modiano, Georgios Paschos","submitted_at":"2015-07-19T02:44:30Z","abstract_excerpt":"We study the problem of efficiently broadcasting packets in multi-hop wireless networks. At each time slot the network controller activates a set of non-interfering links and forwards selected copies of packets on each activated link. A packet is considered jointly received only when all nodes in the network have obtained a copy of it. The maximum rate of jointly received packets is referred to as the broadcast capacity of the 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 "},"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":"1507.05240","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-07-19T02:44:30Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"35e99b27e6b2076289d807bbc280ae79d2b73ab9bd61cb081cf75d75e8848135","abstract_canon_sha256":"bf4b1e50121a8ed3ef47820e4a751dedd7bd49c2b18580fef59c38eb5edc613f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:36:37.450880Z","signature_b64":"ZLiqAvEv7550iUm8vJDxeR/zW1oIq77t69Q/KEMZav6P59Ej0jNoS8xqscGo5pofDD1QjSSbcAoRO5V9+26iDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ca4968b076d732cbb2f18b8b4e934e1211db8a74d51e0aa86e8eba751d17e581","last_reissued_at":"2026-05-18T01:36:37.450211Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:36:37.450211Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Throughput-Optimal Multihop Broadcast on Directed Acyclic Wireless Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Abhishek Sinha, Chih-ping Li, Eytan Modiano, Georgios Paschos","submitted_at":"2015-07-19T02:44:30Z","abstract_excerpt":"We study the problem of efficiently broadcasting packets in multi-hop wireless networks. At each time slot the network controller activates a set of non-interfering links and forwards selected copies of packets on each activated link. A packet is considered jointly received only when all nodes in the network have obtained a copy of it. The maximum rate of jointly received packets is referred to as the broadcast capacity of the 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 "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.05240","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":"1507.05240","created_at":"2026-05-18T01:36:37.450342+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.05240v1","created_at":"2026-05-18T01:36:37.450342+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.05240","created_at":"2026-05-18T01:36:37.450342+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZJEWRMDW24ZM","created_at":"2026-05-18T12:29:52.810259+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZJEWRMDW24ZMXMXR","created_at":"2026-05-18T12:29:52.810259+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZJEWRMDW","created_at":"2026-05-18T12:29:52.810259+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/ZJEWRMDW24ZMXMXRROFU5E2OCI","json":"https://pith.science/pith/ZJEWRMDW24ZMXMXRROFU5E2OCI.json","graph_json":"https://pith.science/api/pith-number/ZJEWRMDW24ZMXMXRROFU5E2OCI/graph.json","events_json":"https://pith.science/api/pith-number/ZJEWRMDW24ZMXMXRROFU5E2OCI/events.json","paper":"https://pith.science/paper/ZJEWRMDW"},"agent_actions":{"view_html":"https://pith.science/pith/ZJEWRMDW24ZMXMXRROFU5E2OCI","download_json":"https://pith.science/pith/ZJEWRMDW24ZMXMXRROFU5E2OCI.json","view_paper":"https://pith.science/paper/ZJEWRMDW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.05240&json=true","fetch_graph":"https://pith.science/api/pith-number/ZJEWRMDW24ZMXMXRROFU5E2OCI/graph.json","fetch_events":"https://pith.science/api/pith-number/ZJEWRMDW24ZMXMXRROFU5E2OCI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZJEWRMDW24ZMXMXRROFU5E2OCI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZJEWRMDW24ZMXMXRROFU5E2OCI/action/storage_attestation","attest_author":"https://pith.science/pith/ZJEWRMDW24ZMXMXRROFU5E2OCI/action/author_attestation","sign_citation":"https://pith.science/pith/ZJEWRMDW24ZMXMXRROFU5E2OCI/action/citation_signature","submit_replication":"https://pith.science/pith/ZJEWRMDW24ZMXMXRROFU5E2OCI/action/replication_record"}},"created_at":"2026-05-18T01:36:37.450342+00:00","updated_at":"2026-05-18T01:36:37.450342+00:00"}