{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:5VV7D3F25IIELSZNXUCJMHUYVM","short_pith_number":"pith:5VV7D3F2","schema_version":"1.0","canonical_sha256":"ed6bf1ecbaea1045cb2dbd04961e98ab1f0fa7a502c976dc3ed85c4b8a5f55ba","source":{"kind":"arxiv","id":"1303.7197","version":3},"attestation_state":"computed","paper":{"title":"Network Codes for Real-Time Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.NI","authors_text":"Alexandros G. Dimakis, Anh Le, Arash S. Tehrani, Athina Markopoulou","submitted_at":"2013-03-28T18:33:06Z","abstract_excerpt":"We consider the scenario of broadcasting for real-time applications and loss recovery via instantly decodable network coding. Past work focused on minimizing the completion delay, which is not the right objective for real-time applications that have strict deadlines. In this work, we are interested in finding a code that is instantly decodable by the maximum number of users. First, we prove that this problem is NP-Hard in the general case. Then we consider the practical probabilistic scenario, where users have i.i.d. loss probability and the number of packets is linear or polynomial in the num"},"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":"1303.7197","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-03-28T18:33:06Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"571692f31931afb790cd1cbafd118e985d7a9c3fadf6ad56097e1ebad81bc543","abstract_canon_sha256":"42889c98240e391ac4dc0bae5c076919e8b19c4d0ca4632bcf93c9186d817bed"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:52:04.258033Z","signature_b64":"WXRNM9s5U+qSfRZuMOPkJFZHGNDJyesQ31SX55t50Ith1krDJ85gc/IiFEk8KzDGV5vqz7wMNneVOOqRNcXvDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ed6bf1ecbaea1045cb2dbd04961e98ab1f0fa7a502c976dc3ed85c4b8a5f55ba","last_reissued_at":"2026-05-18T02:52:04.257623Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:52:04.257623Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Network Codes for Real-Time Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.NI","authors_text":"Alexandros G. Dimakis, Anh Le, Arash S. Tehrani, Athina Markopoulou","submitted_at":"2013-03-28T18:33:06Z","abstract_excerpt":"We consider the scenario of broadcasting for real-time applications and loss recovery via instantly decodable network coding. Past work focused on minimizing the completion delay, which is not the right objective for real-time applications that have strict deadlines. In this work, we are interested in finding a code that is instantly decodable by the maximum number of users. First, we prove that this problem is NP-Hard in the general case. Then we consider the practical probabilistic scenario, where users have i.i.d. loss probability and the number of packets is linear or polynomial in the num"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.7197","kind":"arxiv","version":3},"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":"1303.7197","created_at":"2026-05-18T02:52:04.257680+00:00"},{"alias_kind":"arxiv_version","alias_value":"1303.7197v3","created_at":"2026-05-18T02:52:04.257680+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.7197","created_at":"2026-05-18T02:52:04.257680+00:00"},{"alias_kind":"pith_short_12","alias_value":"5VV7D3F25IIE","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_16","alias_value":"5VV7D3F25IIELSZN","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_8","alias_value":"5VV7D3F2","created_at":"2026-05-18T12:27:34.582898+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/5VV7D3F25IIELSZNXUCJMHUYVM","json":"https://pith.science/pith/5VV7D3F25IIELSZNXUCJMHUYVM.json","graph_json":"https://pith.science/api/pith-number/5VV7D3F25IIELSZNXUCJMHUYVM/graph.json","events_json":"https://pith.science/api/pith-number/5VV7D3F25IIELSZNXUCJMHUYVM/events.json","paper":"https://pith.science/paper/5VV7D3F2"},"agent_actions":{"view_html":"https://pith.science/pith/5VV7D3F25IIELSZNXUCJMHUYVM","download_json":"https://pith.science/pith/5VV7D3F25IIELSZNXUCJMHUYVM.json","view_paper":"https://pith.science/paper/5VV7D3F2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1303.7197&json=true","fetch_graph":"https://pith.science/api/pith-number/5VV7D3F25IIELSZNXUCJMHUYVM/graph.json","fetch_events":"https://pith.science/api/pith-number/5VV7D3F25IIELSZNXUCJMHUYVM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5VV7D3F25IIELSZNXUCJMHUYVM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5VV7D3F25IIELSZNXUCJMHUYVM/action/storage_attestation","attest_author":"https://pith.science/pith/5VV7D3F25IIELSZNXUCJMHUYVM/action/author_attestation","sign_citation":"https://pith.science/pith/5VV7D3F25IIELSZNXUCJMHUYVM/action/citation_signature","submit_replication":"https://pith.science/pith/5VV7D3F25IIELSZNXUCJMHUYVM/action/replication_record"}},"created_at":"2026-05-18T02:52:04.257680+00:00","updated_at":"2026-05-18T02:52:04.257680+00:00"}