{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:A4JTEXG2F26CK7BVJEHQBVX3EU","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":"8bc1c0702178f7bb00e6a46c3395c9e78c21b39e20616a5c45279063e31d3f63","cross_cats_sorted":["cs.NI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-04-01T14:49:41Z","title_canon_sha256":"87b0a2832eafc36bd3a03de8081a2ef4b8f3aefaa45ba28fcd4ce4c93e90ead6"},"schema_version":"1.0","source":{"id":"1404.0265","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.0265","created_at":"2026-05-18T02:55:04Z"},{"alias_kind":"arxiv_version","alias_value":"1404.0265v1","created_at":"2026-05-18T02:55:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.0265","created_at":"2026-05-18T02:55:04Z"},{"alias_kind":"pith_short_12","alias_value":"A4JTEXG2F26C","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"A4JTEXG2F26CK7BV","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"A4JTEXG2","created_at":"2026-05-18T12:28:19Z"}],"graph_snapshots":[{"event_id":"sha256:262ad08afdc0f385f42792261b3c63002d4702009bdcdd2b5f1e214e68c4c19b","target":"graph","created_at":"2026-05-18T02:55: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":"In this paper, we consider the problem of minimizing the maximum broadcast decoding delay experienced by all the receivers of generalized instantly decodable network coding (IDNC). Unlike the sum decoding delay, the maximum decoding delay as a definition of delay for IDNC allows a more equitable distribution of the delays between the different receivers and thus a better Quality of Service (QoS). In order to solve this problem, we first derive the expressions for the probability distributions of maximum decoding delay increments. Given these expressions, we formulate the problem as a maximum w","authors_text":"Ahmed Douik, Mohamed-Slim Alouini, Sameh Sorour, Tareq Y. Al-Naffouri","cross_cats":["cs.NI","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-04-01T14:49:41Z","title":"On Minimizing the Maximum Broadcast Decoding Delay for Instantly Decodable Network Coding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.0265","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:89a2f566370dafa37957e250264de6f7019557e6a54b18a1472ebf5805fde05d","target":"record","created_at":"2026-05-18T02:55: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":"8bc1c0702178f7bb00e6a46c3395c9e78c21b39e20616a5c45279063e31d3f63","cross_cats_sorted":["cs.NI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-04-01T14:49:41Z","title_canon_sha256":"87b0a2832eafc36bd3a03de8081a2ef4b8f3aefaa45ba28fcd4ce4c93e90ead6"},"schema_version":"1.0","source":{"id":"1404.0265","kind":"arxiv","version":1}},"canonical_sha256":"0713325cda2ebc257c35490f00d6fb25118c5cfae0b43fe43dc6b24a18743b78","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0713325cda2ebc257c35490f00d6fb25118c5cfae0b43fe43dc6b24a18743b78","first_computed_at":"2026-05-18T02:55:04.773991Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:55:04.773991Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NBodjRn78TwvAFmCzreo4uFlfkNFnMHSOCpRlzD0Nj2rEOxmw9ZhOXznFthxPsnh8Kb4LK0a/qaeRgcY+CftCA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:55:04.774461Z","signed_message":"canonical_sha256_bytes"},"source_id":"1404.0265","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:89a2f566370dafa37957e250264de6f7019557e6a54b18a1472ebf5805fde05d","sha256:262ad08afdc0f385f42792261b3c63002d4702009bdcdd2b5f1e214e68c4c19b"],"state_sha256":"708b156a43f05df6a722ea7a05d7892fb134e2e2a4d0f755825ac2162da05838"}