{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:5WFKQGC2MYM5I4WJXQKWSV6M77","short_pith_number":"pith:5WFKQGC2","schema_version":"1.0","canonical_sha256":"ed8aa8185a6619d472c9bc156957ccffe5dad82781b0d4140ac75f5ca0d0aa22","source":{"kind":"arxiv","id":"1503.03942","version":1},"attestation_state":"computed","paper":{"title":"On Minimizing the Average Packet Decoding Delay in Wireless Network Coded Broadcast","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alex Sprintson, Mingchao Yu, Parastoo Sadeghi","submitted_at":"2015-03-13T03:15:31Z","abstract_excerpt":"We consider a setting in which a sender wishes to broadcast a block of K data packets to a set of wireless receivers, where each of the receivers has a subset of the data packets already available to it (e.g., from prior transmissions) and wants the rest of the packets. Our goal is to find a linear network coding scheme that yields the minimum average packet decoding delay (APDD), i.e., the average time it takes for a receiver to decode a data packet. Our contributions can be summarized as follows. First, we prove that this problem is NP-hard by presenting a reduction from the hypergraph color"},"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":"1503.03942","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-03-13T03:15:31Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"281d568f5dac3c42cff625bae35c777bc255e71d85efcefaaea9ace074d8b508","abstract_canon_sha256":"db722e0527b47d93eddce9c3568839f2776a70d1ca4b5503dadef219ff8fba48"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:23:57.674425Z","signature_b64":"5WE6By9Ygze2X83U0Dcifi9488BqqiIAR0zvpXZyNmAaOXG783FJrEWcX50qTVYa/aLO2uEHaDtnbZYdxlbMDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ed8aa8185a6619d472c9bc156957ccffe5dad82781b0d4140ac75f5ca0d0aa22","last_reissued_at":"2026-05-18T02:23:57.673794Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:23:57.673794Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Minimizing the Average Packet Decoding Delay in Wireless Network Coded Broadcast","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alex Sprintson, Mingchao Yu, Parastoo Sadeghi","submitted_at":"2015-03-13T03:15:31Z","abstract_excerpt":"We consider a setting in which a sender wishes to broadcast a block of K data packets to a set of wireless receivers, where each of the receivers has a subset of the data packets already available to it (e.g., from prior transmissions) and wants the rest of the packets. Our goal is to find a linear network coding scheme that yields the minimum average packet decoding delay (APDD), i.e., the average time it takes for a receiver to decode a data packet. Our contributions can be summarized as follows. First, we prove that this problem is NP-hard by presenting a reduction from the hypergraph color"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.03942","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":"1503.03942","created_at":"2026-05-18T02:23:57.673896+00:00"},{"alias_kind":"arxiv_version","alias_value":"1503.03942v1","created_at":"2026-05-18T02:23:57.673896+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.03942","created_at":"2026-05-18T02:23:57.673896+00:00"},{"alias_kind":"pith_short_12","alias_value":"5WFKQGC2MYM5","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_16","alias_value":"5WFKQGC2MYM5I4WJ","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_8","alias_value":"5WFKQGC2","created_at":"2026-05-18T12:29:07.941421+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/5WFKQGC2MYM5I4WJXQKWSV6M77","json":"https://pith.science/pith/5WFKQGC2MYM5I4WJXQKWSV6M77.json","graph_json":"https://pith.science/api/pith-number/5WFKQGC2MYM5I4WJXQKWSV6M77/graph.json","events_json":"https://pith.science/api/pith-number/5WFKQGC2MYM5I4WJXQKWSV6M77/events.json","paper":"https://pith.science/paper/5WFKQGC2"},"agent_actions":{"view_html":"https://pith.science/pith/5WFKQGC2MYM5I4WJXQKWSV6M77","download_json":"https://pith.science/pith/5WFKQGC2MYM5I4WJXQKWSV6M77.json","view_paper":"https://pith.science/paper/5WFKQGC2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1503.03942&json=true","fetch_graph":"https://pith.science/api/pith-number/5WFKQGC2MYM5I4WJXQKWSV6M77/graph.json","fetch_events":"https://pith.science/api/pith-number/5WFKQGC2MYM5I4WJXQKWSV6M77/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5WFKQGC2MYM5I4WJXQKWSV6M77/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5WFKQGC2MYM5I4WJXQKWSV6M77/action/storage_attestation","attest_author":"https://pith.science/pith/5WFKQGC2MYM5I4WJXQKWSV6M77/action/author_attestation","sign_citation":"https://pith.science/pith/5WFKQGC2MYM5I4WJXQKWSV6M77/action/citation_signature","submit_replication":"https://pith.science/pith/5WFKQGC2MYM5I4WJXQKWSV6M77/action/replication_record"}},"created_at":"2026-05-18T02:23:57.673896+00:00","updated_at":"2026-05-18T02:23:57.673896+00:00"}