{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:UNYI6OYCDAHMPOPEBH567OSJLL","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":"1133eca7b3db5978ec4b71b021c6058c3975e1408f233e3a476e5b5a2e8164c4","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-08T15:34:47Z","title_canon_sha256":"2e3679f5b468faba4af2009b7be97aeae09cdfeba32929052587ec41df139783"},"schema_version":"1.0","source":{"id":"1601.01909","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.01909","created_at":"2026-05-18T01:23:11Z"},{"alias_kind":"arxiv_version","alias_value":"1601.01909v1","created_at":"2026-05-18T01:23:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.01909","created_at":"2026-05-18T01:23:11Z"},{"alias_kind":"pith_short_12","alias_value":"UNYI6OYCDAHM","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"UNYI6OYCDAHMPOPE","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"UNYI6OYC","created_at":"2026-05-18T12:30:46Z"}],"graph_snapshots":[{"event_id":"sha256:22a81ccfa64f1b182de28244b640a91fd416ce9d3fb01f85ac85f51a78a67f42","target":"graph","created_at":"2026-05-18T01:23:11Z","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":"Consider a radio access network wherein a base-station is required to deliver a set of order-constrained messages to a set of users over independent erasure channels. This paper studies the delivery time reduction problem using instantly decodable network coding (IDNC). Motivated by time-critical and order-constrained applications, the delivery time is defined, at each transmission, as the number of undelivered messages. The delivery time minimization problem being computationally intractable, most of the existing literature on IDNC propose sub-optimal online solutions. This paper suggests a n","authors_text":"Ahmed Douik, Mohammad S. Karim, Parastoo Sadeghi, Sameh Sorour","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-08T15:34:47Z","title":"Delivery Time Reduction for Order-Constrained Applications using Binary Network Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.01909","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:694e76a743ded92fef12bbf869e3acd2dd9c42909ba03a632e332bf0a11a2b38","target":"record","created_at":"2026-05-18T01:23:11Z","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":"1133eca7b3db5978ec4b71b021c6058c3975e1408f233e3a476e5b5a2e8164c4","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-08T15:34:47Z","title_canon_sha256":"2e3679f5b468faba4af2009b7be97aeae09cdfeba32929052587ec41df139783"},"schema_version":"1.0","source":{"id":"1601.01909","kind":"arxiv","version":1}},"canonical_sha256":"a3708f3b02180ec7b9e409fbefba495ade6dfafdde21fe6b50ff2050a5d698cd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a3708f3b02180ec7b9e409fbefba495ade6dfafdde21fe6b50ff2050a5d698cd","first_computed_at":"2026-05-18T01:23:11.110429Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:23:11.110429Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OGIWXOY4FWam1ESxQBfS6JIGuHQCJ/iCdaeIRMi3/6LRZvt0NUfYkzGgGA8lc5GL7P8yzoP07RiUS8lQg/Y8Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:23:11.110850Z","signed_message":"canonical_sha256_bytes"},"source_id":"1601.01909","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:694e76a743ded92fef12bbf869e3acd2dd9c42909ba03a632e332bf0a11a2b38","sha256:22a81ccfa64f1b182de28244b640a91fd416ce9d3fb01f85ac85f51a78a67f42"],"state_sha256":"0e5f20ca606fb18df9cc8efd5aa5ea96fdc36f949be8c7a93a038ae24812bf06"}