{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:E6U4TU76DBHAMIRC6HZ6AVIBII","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":"6b2dc2822c460271079434c4c0f7b465fd868f9205deebdd591b9869c4e83a5b","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-11-14T01:10:52Z","title_canon_sha256":"b3b6bd589cd575cff05c660f7545c5d1384fa06728b36f16b4cb7111b8f1ab9e"},"schema_version":"1.0","source":{"id":"1211.3174","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.3174","created_at":"2026-05-18T03:40:50Z"},{"alias_kind":"arxiv_version","alias_value":"1211.3174v1","created_at":"2026-05-18T03:40:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.3174","created_at":"2026-05-18T03:40:50Z"},{"alias_kind":"pith_short_12","alias_value":"E6U4TU76DBHA","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_16","alias_value":"E6U4TU76DBHAMIRC","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_8","alias_value":"E6U4TU76","created_at":"2026-05-18T12:27:04Z"}],"graph_snapshots":[{"event_id":"sha256:047fa0ac5852373df5050276cb1e29b51f8fd5a498f557547eebfe1c8e939536","target":"graph","created_at":"2026-05-18T03:40:50Z","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 delay of network coding compared to routing with retransmissions in packet erasure networks with probabilistic erasures. We investigate the sub-linear term in the block delay required for unicasting $n$ packets and show that there is an unbounded gap between network coding and routing. In particular, we show that delay benefit of network coding scales at least as $\\sqrt{n}$. Our analysis of the delay function for the routing strategy involves a major technical challenge of computing the expectation of the maximum of two negative binomial random variables. This problem has been ","authors_text":"Alexandros G. Dimakis, Michelle Effros, Theodoros K. Dikaliotis, Tracey Ho","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-11-14T01:10:52Z","title":"On the Delay Advantage of Coding in Packet Erasure Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.3174","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:ed4809a2a13b2a61d3aa8c43eb66400e5e83369876edeccac0246d5e9fbb1d0b","target":"record","created_at":"2026-05-18T03:40:50Z","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":"6b2dc2822c460271079434c4c0f7b465fd868f9205deebdd591b9869c4e83a5b","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-11-14T01:10:52Z","title_canon_sha256":"b3b6bd589cd575cff05c660f7545c5d1384fa06728b36f16b4cb7111b8f1ab9e"},"schema_version":"1.0","source":{"id":"1211.3174","kind":"arxiv","version":1}},"canonical_sha256":"27a9c9d3fe184e062222f1f3e055014212a8ef0e1d357556b4420e8123c3c10c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"27a9c9d3fe184e062222f1f3e055014212a8ef0e1d357556b4420e8123c3c10c","first_computed_at":"2026-05-18T03:40:50.693125Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:40:50.693125Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Rf/4DuzziUGrV2XL7ybuaWI1eYdWHMYbjhwz18qnDLslA1F+09PDHQyvFfc27HT7gC1fXXed5RI9jFGV1oVBDA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:40:50.693781Z","signed_message":"canonical_sha256_bytes"},"source_id":"1211.3174","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ed4809a2a13b2a61d3aa8c43eb66400e5e83369876edeccac0246d5e9fbb1d0b","sha256:047fa0ac5852373df5050276cb1e29b51f8fd5a498f557547eebfe1c8e939536"],"state_sha256":"82326530b1a61cab279f9ef9a1879cd920a3d983df49745397bb4edda73aa3a8"}