{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:JOZKMRS5RSLTBKLWNGOPAWWS2V","short_pith_number":"pith:JOZKMRS5","schema_version":"1.0","canonical_sha256":"4bb2a6465d8c9730a976699cf05ad2d57fd9931009cae2d1009b2c13e6ab01fc","source":{"kind":"arxiv","id":"1509.00167","version":2},"attestation_state":"computed","paper":{"title":"FEC for Lower In-Order Delivery Delay in Packet Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Douglas J. Leith, Jason Cloud, Mohammad Karzand, Muriel Medard","submitted_at":"2015-09-01T07:53:05Z","abstract_excerpt":"We consider use of FEC to reduce in-order delivery delay over packet erasure channels. We propose a class of streaming codes that is capacity achieving and provides a superior throughput-delay trade-off compared to block codes by introducing flexibility in where and when redundancy is placed. This flexibility results in significantly lower in-order delay for a given throughput for a wide range of network scenarios. Furthermore, a major contribution of this paper is the combination of queuing and coding theory to analyze the code's performance. Finally, we present simulation and experimental re"},"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":"1509.00167","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-09-01T07:53:05Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"92cbf17c28d9aa4a73118f47db4315d1a764327df174f6b0b861f7b7fa327c69","abstract_canon_sha256":"d1bbb6a658ecca629e6f17ccb97636200a999795d3b48b64998f77fba34e7505"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:06:24.603513Z","signature_b64":"kqpIrWSeDa2OP/3Pcb3OmhV4ipXIyDFjT4hGCho5OBxMu4Wld/FsTiZvUrsQq55qtObu4WCxYU5pHEYAZLZNBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4bb2a6465d8c9730a976699cf05ad2d57fd9931009cae2d1009b2c13e6ab01fc","last_reissued_at":"2026-05-18T01:06:24.603115Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:06:24.603115Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"FEC for Lower In-Order Delivery Delay in Packet Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Douglas J. Leith, Jason Cloud, Mohammad Karzand, Muriel Medard","submitted_at":"2015-09-01T07:53:05Z","abstract_excerpt":"We consider use of FEC to reduce in-order delivery delay over packet erasure channels. We propose a class of streaming codes that is capacity achieving and provides a superior throughput-delay trade-off compared to block codes by introducing flexibility in where and when redundancy is placed. This flexibility results in significantly lower in-order delay for a given throughput for a wide range of network scenarios. Furthermore, a major contribution of this paper is the combination of queuing and coding theory to analyze the code's performance. Finally, we present simulation and experimental re"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.00167","kind":"arxiv","version":2},"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":"1509.00167","created_at":"2026-05-18T01:06:24.603171+00:00"},{"alias_kind":"arxiv_version","alias_value":"1509.00167v2","created_at":"2026-05-18T01:06:24.603171+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.00167","created_at":"2026-05-18T01:06:24.603171+00:00"},{"alias_kind":"pith_short_12","alias_value":"JOZKMRS5RSLT","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_16","alias_value":"JOZKMRS5RSLTBKLW","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_8","alias_value":"JOZKMRS5","created_at":"2026-05-18T12:29:27.538025+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/JOZKMRS5RSLTBKLWNGOPAWWS2V","json":"https://pith.science/pith/JOZKMRS5RSLTBKLWNGOPAWWS2V.json","graph_json":"https://pith.science/api/pith-number/JOZKMRS5RSLTBKLWNGOPAWWS2V/graph.json","events_json":"https://pith.science/api/pith-number/JOZKMRS5RSLTBKLWNGOPAWWS2V/events.json","paper":"https://pith.science/paper/JOZKMRS5"},"agent_actions":{"view_html":"https://pith.science/pith/JOZKMRS5RSLTBKLWNGOPAWWS2V","download_json":"https://pith.science/pith/JOZKMRS5RSLTBKLWNGOPAWWS2V.json","view_paper":"https://pith.science/paper/JOZKMRS5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1509.00167&json=true","fetch_graph":"https://pith.science/api/pith-number/JOZKMRS5RSLTBKLWNGOPAWWS2V/graph.json","fetch_events":"https://pith.science/api/pith-number/JOZKMRS5RSLTBKLWNGOPAWWS2V/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JOZKMRS5RSLTBKLWNGOPAWWS2V/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JOZKMRS5RSLTBKLWNGOPAWWS2V/action/storage_attestation","attest_author":"https://pith.science/pith/JOZKMRS5RSLTBKLWNGOPAWWS2V/action/author_attestation","sign_citation":"https://pith.science/pith/JOZKMRS5RSLTBKLWNGOPAWWS2V/action/citation_signature","submit_replication":"https://pith.science/pith/JOZKMRS5RSLTBKLWNGOPAWWS2V/action/replication_record"}},"created_at":"2026-05-18T01:06:24.603171+00:00","updated_at":"2026-05-18T01:06:24.603171+00:00"}