{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:Z4DZJRKJQGMCMKYJ35WMQN4VBO","short_pith_number":"pith:Z4DZJRKJ","canonical_record":{"source":{"id":"1401.6626","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-26T08:22:11Z","cross_cats_sorted":["cs.NI","math.IT"],"title_canon_sha256":"9673e7cc227a145876dd264567ecec114fe1b485a8a4d69cb8ae51fa34b5c749","abstract_canon_sha256":"415f593ab28e53b7ca3323455296d86d17bc39af50e63579556ac67a741dc363"},"schema_version":"1.0"},"canonical_sha256":"cf0794c5498198262b09df6cc837950bbbb7df7dd7861cb1e7179e614202d897","source":{"kind":"arxiv","id":"1401.6626","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.6626","created_at":"2026-05-18T02:54:55Z"},{"alias_kind":"arxiv_version","alias_value":"1401.6626v3","created_at":"2026-05-18T02:54:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.6626","created_at":"2026-05-18T02:54:55Z"},{"alias_kind":"pith_short_12","alias_value":"Z4DZJRKJQGMC","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"Z4DZJRKJQGMCMKYJ","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"Z4DZJRKJ","created_at":"2026-05-18T12:28:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:Z4DZJRKJQGMCMKYJ35WMQN4VBO","target":"record","payload":{"canonical_record":{"source":{"id":"1401.6626","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-26T08:22:11Z","cross_cats_sorted":["cs.NI","math.IT"],"title_canon_sha256":"9673e7cc227a145876dd264567ecec114fe1b485a8a4d69cb8ae51fa34b5c749","abstract_canon_sha256":"415f593ab28e53b7ca3323455296d86d17bc39af50e63579556ac67a741dc363"},"schema_version":"1.0"},"canonical_sha256":"cf0794c5498198262b09df6cc837950bbbb7df7dd7861cb1e7179e614202d897","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:54:55.806189Z","signature_b64":"zKKwn4bTLYbE/twwEHQAG3mLBJPVGtP6DVF4jUNhHMUQqC4AK9RQM9HHoS5cr2ti43MGGeoueUWQICQDoU3QDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cf0794c5498198262b09df6cc837950bbbb7df7dd7861cb1e7179e614202d897","last_reissued_at":"2026-05-18T02:54:55.805720Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:54:55.805720Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1401.6626","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:54:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yBi30vBRLQoiS0fflNJpkEmfkTvPx9fJMPzvLW3k6ypt0HHTk2TQTdRt85VrR1+xcAqIIRkptfhZ1qBHCVZbCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T15:47:43.004744Z"},"content_sha256":"11e4430624628c2445ca557e2194282612a38faf2b8a0f2a9f9715be8e0abbee","schema_version":"1.0","event_id":"sha256:11e4430624628c2445ca557e2194282612a38faf2b8a0f2a9f9715be8e0abbee"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:Z4DZJRKJQGMCMKYJ35WMQN4VBO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Completion Time Reduction in Instantly Decodable Network Coding Through Decoding Delay Control","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI","math.IT"],"primary_cat":"cs.IT","authors_text":"Ahmed Douik, Mohamed-Slim Alouini, Sameh Sorour, Tareq Y. Al-Naffour","submitted_at":"2014-01-26T08:22:11Z","abstract_excerpt":"For several years, the completion time and decoding delay problems in Instantly Decodable Network Coding (IDNC) were considered separately and were thought to completely act against each other. Recently, some works aimed to balance the effects of these two important IDNC metrics but none of them studied a further optimization of one by controlling the other. In this paper, we study the effect of controlling the decoding delay to reduce the completion time below its currently best known solution. We first derive the decoding-delay-dependent expressions of the users' and overall completion times"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.6626","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:54:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O8E7n8jmxaJKvXinq1nc4GJSE7XdeReOedLITCM2u5w0tL3KkqGPbPmNR+J7nE4on80+gNvCxUO9RZ0xm1t2Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T15:47:43.005110Z"},"content_sha256":"04c30144998e21bfe2bc99e45286e13f0582ff677ba614c211664d9b96c2d827","schema_version":"1.0","event_id":"sha256:04c30144998e21bfe2bc99e45286e13f0582ff677ba614c211664d9b96c2d827"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Z4DZJRKJQGMCMKYJ35WMQN4VBO/bundle.json","state_url":"https://pith.science/pith/Z4DZJRKJQGMCMKYJ35WMQN4VBO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Z4DZJRKJQGMCMKYJ35WMQN4VBO/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-23T15:47:43Z","links":{"resolver":"https://pith.science/pith/Z4DZJRKJQGMCMKYJ35WMQN4VBO","bundle":"https://pith.science/pith/Z4DZJRKJQGMCMKYJ35WMQN4VBO/bundle.json","state":"https://pith.science/pith/Z4DZJRKJQGMCMKYJ35WMQN4VBO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Z4DZJRKJQGMCMKYJ35WMQN4VBO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:Z4DZJRKJQGMCMKYJ35WMQN4VBO","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":"415f593ab28e53b7ca3323455296d86d17bc39af50e63579556ac67a741dc363","cross_cats_sorted":["cs.NI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-26T08:22:11Z","title_canon_sha256":"9673e7cc227a145876dd264567ecec114fe1b485a8a4d69cb8ae51fa34b5c749"},"schema_version":"1.0","source":{"id":"1401.6626","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.6626","created_at":"2026-05-18T02:54:55Z"},{"alias_kind":"arxiv_version","alias_value":"1401.6626v3","created_at":"2026-05-18T02:54:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.6626","created_at":"2026-05-18T02:54:55Z"},{"alias_kind":"pith_short_12","alias_value":"Z4DZJRKJQGMC","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"Z4DZJRKJQGMCMKYJ","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"Z4DZJRKJ","created_at":"2026-05-18T12:28:59Z"}],"graph_snapshots":[{"event_id":"sha256:04c30144998e21bfe2bc99e45286e13f0582ff677ba614c211664d9b96c2d827","target":"graph","created_at":"2026-05-18T02:54:55Z","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":"For several years, the completion time and decoding delay problems in Instantly Decodable Network Coding (IDNC) were considered separately and were thought to completely act against each other. Recently, some works aimed to balance the effects of these two important IDNC metrics but none of them studied a further optimization of one by controlling the other. In this paper, we study the effect of controlling the decoding delay to reduce the completion time below its currently best known solution. We first derive the decoding-delay-dependent expressions of the users' and overall completion times","authors_text":"Ahmed Douik, Mohamed-Slim Alouini, Sameh Sorour, Tareq Y. Al-Naffour","cross_cats":["cs.NI","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-26T08:22:11Z","title":"Completion Time Reduction in Instantly Decodable Network Coding Through Decoding Delay Control"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.6626","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:11e4430624628c2445ca557e2194282612a38faf2b8a0f2a9f9715be8e0abbee","target":"record","created_at":"2026-05-18T02:54:55Z","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":"415f593ab28e53b7ca3323455296d86d17bc39af50e63579556ac67a741dc363","cross_cats_sorted":["cs.NI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-26T08:22:11Z","title_canon_sha256":"9673e7cc227a145876dd264567ecec114fe1b485a8a4d69cb8ae51fa34b5c749"},"schema_version":"1.0","source":{"id":"1401.6626","kind":"arxiv","version":3}},"canonical_sha256":"cf0794c5498198262b09df6cc837950bbbb7df7dd7861cb1e7179e614202d897","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cf0794c5498198262b09df6cc837950bbbb7df7dd7861cb1e7179e614202d897","first_computed_at":"2026-05-18T02:54:55.805720Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:54:55.805720Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zKKwn4bTLYbE/twwEHQAG3mLBJPVGtP6DVF4jUNhHMUQqC4AK9RQM9HHoS5cr2ti43MGGeoueUWQICQDoU3QDw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:54:55.806189Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.6626","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:11e4430624628c2445ca557e2194282612a38faf2b8a0f2a9f9715be8e0abbee","sha256:04c30144998e21bfe2bc99e45286e13f0582ff677ba614c211664d9b96c2d827"],"state_sha256":"4b570d1569adf26283302a15f54f9c416bcfa2f27cc2b50afb8f92dd29fdb51a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iRascaSOsZPtG1yo5Sp6jXhr5wYNTBrlkopCc6HPoZrChC5ZvsaSA6bJK8h0j7QqjA+XQuBsLen2VA+wbKYOAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T15:47:43.007061Z","bundle_sha256":"46aeb3132f3a7c5d4d95bda9fbdeed0eeea87951db6e02f31ce9b94c8ade25d5"}}