{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:E6U4TU76DBHAMIRC6HZ6AVIBII","short_pith_number":"pith:E6U4TU76","schema_version":"1.0","canonical_sha256":"27a9c9d3fe184e062222f1f3e055014212a8ef0e1d357556b4420e8123c3c10c","source":{"kind":"arxiv","id":"1211.3174","version":1},"attestation_state":"computed","paper":{"title":"On the Delay Advantage of Coding in Packet Erasure Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alexandros G. Dimakis, Michelle Effros, Theodoros K. Dikaliotis, Tracey Ho","submitted_at":"2012-11-14T01:10:52Z","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 "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1211.3174","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-11-14T01:10:52Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"b3b6bd589cd575cff05c660f7545c5d1384fa06728b36f16b4cb7111b8f1ab9e","abstract_canon_sha256":"6b2dc2822c460271079434c4c0f7b465fd868f9205deebdd591b9869c4e83a5b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:40:50.693781Z","signature_b64":"Rf/4DuzziUGrV2XL7ybuaWI1eYdWHMYbjhwz18qnDLslA1F+09PDHQyvFfc27HT7gC1fXXed5RI9jFGV1oVBDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"27a9c9d3fe184e062222f1f3e055014212a8ef0e1d357556b4420e8123c3c10c","last_reissued_at":"2026-05-18T03:40:50.693125Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:40:50.693125Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Delay Advantage of Coding in Packet Erasure Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alexandros G. Dimakis, Michelle Effros, Theodoros K. Dikaliotis, Tracey Ho","submitted_at":"2012-11-14T01:10:52Z","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 "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.3174","kind":"arxiv","version":1},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1211.3174","created_at":"2026-05-18T03:40:50.693248+00:00"},{"alias_kind":"arxiv_version","alias_value":"1211.3174v1","created_at":"2026-05-18T03:40:50.693248+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.3174","created_at":"2026-05-18T03:40:50.693248+00:00"},{"alias_kind":"pith_short_12","alias_value":"E6U4TU76DBHA","created_at":"2026-05-18T12:27:04.183437+00:00"},{"alias_kind":"pith_short_16","alias_value":"E6U4TU76DBHAMIRC","created_at":"2026-05-18T12:27:04.183437+00:00"},{"alias_kind":"pith_short_8","alias_value":"E6U4TU76","created_at":"2026-05-18T12:27:04.183437+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/E6U4TU76DBHAMIRC6HZ6AVIBII","json":"https://pith.science/pith/E6U4TU76DBHAMIRC6HZ6AVIBII.json","graph_json":"https://pith.science/api/pith-number/E6U4TU76DBHAMIRC6HZ6AVIBII/graph.json","events_json":"https://pith.science/api/pith-number/E6U4TU76DBHAMIRC6HZ6AVIBII/events.json","paper":"https://pith.science/paper/E6U4TU76"},"agent_actions":{"view_html":"https://pith.science/pith/E6U4TU76DBHAMIRC6HZ6AVIBII","download_json":"https://pith.science/pith/E6U4TU76DBHAMIRC6HZ6AVIBII.json","view_paper":"https://pith.science/paper/E6U4TU76","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1211.3174&json=true","fetch_graph":"https://pith.science/api/pith-number/E6U4TU76DBHAMIRC6HZ6AVIBII/graph.json","fetch_events":"https://pith.science/api/pith-number/E6U4TU76DBHAMIRC6HZ6AVIBII/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/E6U4TU76DBHAMIRC6HZ6AVIBII/action/timestamp_anchor","attest_storage":"https://pith.science/pith/E6U4TU76DBHAMIRC6HZ6AVIBII/action/storage_attestation","attest_author":"https://pith.science/pith/E6U4TU76DBHAMIRC6HZ6AVIBII/action/author_attestation","sign_citation":"https://pith.science/pith/E6U4TU76DBHAMIRC6HZ6AVIBII/action/citation_signature","submit_replication":"https://pith.science/pith/E6U4TU76DBHAMIRC6HZ6AVIBII/action/replication_record"}},"created_at":"2026-05-18T03:40:50.693248+00:00","updated_at":"2026-05-18T03:40:50.693248+00:00"}