{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:FZRY5QDMTCZRWXEHLOF5VLRSWW","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":"a14e111c7c94cee4d85498cf180c0687fe1f822be203f76be891eb90604fea52","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2012-01-23T16:59:11Z","title_canon_sha256":"5c3f70e46b263ab27fde1b0737c6f87fc4108d69843f9115b657a31fbf5a326f"},"schema_version":"1.0","source":{"id":"1201.4768","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.4768","created_at":"2026-05-18T04:04:05Z"},{"alias_kind":"arxiv_version","alias_value":"1201.4768v1","created_at":"2026-05-18T04:04:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.4768","created_at":"2026-05-18T04:04:05Z"},{"alias_kind":"pith_short_12","alias_value":"FZRY5QDMTCZR","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_16","alias_value":"FZRY5QDMTCZRWXEH","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_8","alias_value":"FZRY5QDM","created_at":"2026-05-18T12:27:06Z"}],"graph_snapshots":[{"event_id":"sha256:82b09f7e6a985f37460e7651c3cc1c4e4eb2d0be9dc282c8c2aabcd2acae9291","target":"graph","created_at":"2026-05-18T04:04:05Z","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":"In this paper, we consider the problem of minimizing the completion delay for instantly decodable network coding (IDNC), in wireless multicast and broadcast scenarios. We are interested in this class of network coding due to its numerous benefits, such as low decoding delay, low coding and decoding complexities and simple receiver requirements. We first extend the IDNC graph, which represents all feasible IDNC coding opportunities, to efficiently operate in both multicast and broadcast scenarios. We then formulate the minimum completion delay problem for IDNC as a stochastic shortest path (SSP","authors_text":"Sameh Sorour, Shahrokh Valaee","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2012-01-23T16:59:11Z","title":"Completion Delay Minimization for Instantly Decodable Network Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.4768","kind":"arxiv","version":1},"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:e4dc0e8943a45839acfb909ec29a56c8088c3901376f5a7c32a92c9069b837f0","target":"record","created_at":"2026-05-18T04:04:05Z","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":"a14e111c7c94cee4d85498cf180c0687fe1f822be203f76be891eb90604fea52","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2012-01-23T16:59:11Z","title_canon_sha256":"5c3f70e46b263ab27fde1b0737c6f87fc4108d69843f9115b657a31fbf5a326f"},"schema_version":"1.0","source":{"id":"1201.4768","kind":"arxiv","version":1}},"canonical_sha256":"2e638ec06c98b31b5c875b8bdaae32b5993328a5fb1ae2da24115fc778ec7c40","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2e638ec06c98b31b5c875b8bdaae32b5993328a5fb1ae2da24115fc778ec7c40","first_computed_at":"2026-05-18T04:04:05.228647Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:04:05.228647Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ogBQ8Aiu+zmGPiqSoZ75cUcosjeeMhaJK8waFYUI7sQ87uufiVY0N0TEanSb2f0mkThB2SE7WNda8GFAYEuMAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:04:05.229072Z","signed_message":"canonical_sha256_bytes"},"source_id":"1201.4768","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e4dc0e8943a45839acfb909ec29a56c8088c3901376f5a7c32a92c9069b837f0","sha256:82b09f7e6a985f37460e7651c3cc1c4e4eb2d0be9dc282c8c2aabcd2acae9291"],"state_sha256":"5ce7aa2de03a1e569f5482590ce54921ed181ed220e1092c032fcc66f597bc9b"}