{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:5VV7D3F25IIELSZNXUCJMHUYVM","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":"42889c98240e391ac4dc0bae5c076919e8b19c4d0ca4632bcf93c9186d817bed","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-03-28T18:33:06Z","title_canon_sha256":"571692f31931afb790cd1cbafd118e985d7a9c3fadf6ad56097e1ebad81bc543"},"schema_version":"1.0","source":{"id":"1303.7197","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.7197","created_at":"2026-05-18T02:52:04Z"},{"alias_kind":"arxiv_version","alias_value":"1303.7197v3","created_at":"2026-05-18T02:52:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.7197","created_at":"2026-05-18T02:52:04Z"},{"alias_kind":"pith_short_12","alias_value":"5VV7D3F25IIE","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_16","alias_value":"5VV7D3F25IIELSZN","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_8","alias_value":"5VV7D3F2","created_at":"2026-05-18T12:27:34Z"}],"graph_snapshots":[{"event_id":"sha256:6eefe2f4dee00a9eaced5bdb20138b33f77f3a022ebd7db8a682501fc644247f","target":"graph","created_at":"2026-05-18T02:52:04Z","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 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","authors_text":"Alexandros G. Dimakis, Anh Le, Arash S. Tehrani, Athina Markopoulou","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-03-28T18:33:06Z","title":"Network Codes for Real-Time Applications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.7197","kind":"arxiv","version":3},"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:9aa1f571f06e55f222e5d902e3d6bf679370e0824f45677a077557a09c4fb544","target":"record","created_at":"2026-05-18T02:52:04Z","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":"42889c98240e391ac4dc0bae5c076919e8b19c4d0ca4632bcf93c9186d817bed","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-03-28T18:33:06Z","title_canon_sha256":"571692f31931afb790cd1cbafd118e985d7a9c3fadf6ad56097e1ebad81bc543"},"schema_version":"1.0","source":{"id":"1303.7197","kind":"arxiv","version":3}},"canonical_sha256":"ed6bf1ecbaea1045cb2dbd04961e98ab1f0fa7a502c976dc3ed85c4b8a5f55ba","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ed6bf1ecbaea1045cb2dbd04961e98ab1f0fa7a502c976dc3ed85c4b8a5f55ba","first_computed_at":"2026-05-18T02:52:04.257623Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:52:04.257623Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WXRNM9s5U+qSfRZuMOPkJFZHGNDJyesQ31SX55t50Ith1krDJ85gc/IiFEk8KzDGV5vqz7wMNneVOOqRNcXvDA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:52:04.258033Z","signed_message":"canonical_sha256_bytes"},"source_id":"1303.7197","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9aa1f571f06e55f222e5d902e3d6bf679370e0824f45677a077557a09c4fb544","sha256:6eefe2f4dee00a9eaced5bdb20138b33f77f3a022ebd7db8a682501fc644247f"],"state_sha256":"83a778bf8e117b09b54052d524341c9d98102b34a4319ca7d1a6b21755b6ce61"}