{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:JOZKMRS5RSLTBKLWNGOPAWWS2V","short_pith_number":"pith:JOZKMRS5","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"},"canonical_sha256":"4bb2a6465d8c9730a976699cf05ad2d57fd9931009cae2d1009b2c13e6ab01fc","source":{"kind":"arxiv","id":"1509.00167","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.00167","created_at":"2026-05-18T01:06:24Z"},{"alias_kind":"arxiv_version","alias_value":"1509.00167v2","created_at":"2026-05-18T01:06:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.00167","created_at":"2026-05-18T01:06:24Z"},{"alias_kind":"pith_short_12","alias_value":"JOZKMRS5RSLT","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"JOZKMRS5RSLTBKLW","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"JOZKMRS5","created_at":"2026-05-18T12:29:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:JOZKMRS5RSLTBKLWNGOPAWWS2V","target":"record","payload":{"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"},"canonical_sha256":"4bb2a6465d8c9730a976699cf05ad2d57fd9931009cae2d1009b2c13e6ab01fc","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"},"source_kind":"arxiv","source_id":"1509.00167","source_version":2,"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-18T01:06:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4j7os0DKpiBFzjDjQz1jgrYixfrRTjAqcBgrESyMqkyEixFgqtEc+lW/B8D49worAjykKM//zccXrsBRImhLDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T03:15:18.019306Z"},"content_sha256":"04871ea8066a9484e0a878bde77416cf8cbfba2e8e69de76de2245a8fa123785","schema_version":"1.0","event_id":"sha256:04871ea8066a9484e0a878bde77416cf8cbfba2e8e69de76de2245a8fa123785"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:JOZKMRS5RSLTBKLWNGOPAWWS2V","target":"graph","payload":{"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"},"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-18T01:06:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oKzxZmALa9ehisYg42a8W1SANMQ6oo+eXZ8vVMLUhXrNmofxi1KZLvjt4H8tzUtCklaoP3h0MU7sT+J2C3UMBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T03:15:18.020030Z"},"content_sha256":"d453b234ff98df3a4adc6ec46b69257307ae8f677ac78dd29619c092928a5e9a","schema_version":"1.0","event_id":"sha256:d453b234ff98df3a4adc6ec46b69257307ae8f677ac78dd29619c092928a5e9a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JOZKMRS5RSLTBKLWNGOPAWWS2V/bundle.json","state_url":"https://pith.science/pith/JOZKMRS5RSLTBKLWNGOPAWWS2V/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JOZKMRS5RSLTBKLWNGOPAWWS2V/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-05-25T03:15:18Z","links":{"resolver":"https://pith.science/pith/JOZKMRS5RSLTBKLWNGOPAWWS2V","bundle":"https://pith.science/pith/JOZKMRS5RSLTBKLWNGOPAWWS2V/bundle.json","state":"https://pith.science/pith/JOZKMRS5RSLTBKLWNGOPAWWS2V/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JOZKMRS5RSLTBKLWNGOPAWWS2V/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:JOZKMRS5RSLTBKLWNGOPAWWS2V","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":"d1bbb6a658ecca629e6f17ccb97636200a999795d3b48b64998f77fba34e7505","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-09-01T07:53:05Z","title_canon_sha256":"92cbf17c28d9aa4a73118f47db4315d1a764327df174f6b0b861f7b7fa327c69"},"schema_version":"1.0","source":{"id":"1509.00167","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.00167","created_at":"2026-05-18T01:06:24Z"},{"alias_kind":"arxiv_version","alias_value":"1509.00167v2","created_at":"2026-05-18T01:06:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.00167","created_at":"2026-05-18T01:06:24Z"},{"alias_kind":"pith_short_12","alias_value":"JOZKMRS5RSLT","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"JOZKMRS5RSLTBKLW","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"JOZKMRS5","created_at":"2026-05-18T12:29:27Z"}],"graph_snapshots":[{"event_id":"sha256:d453b234ff98df3a4adc6ec46b69257307ae8f677ac78dd29619c092928a5e9a","target":"graph","created_at":"2026-05-18T01:06:24Z","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 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","authors_text":"Douglas J. Leith, Jason Cloud, Mohammad Karzand, Muriel Medard","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-09-01T07:53:05Z","title":"FEC for Lower In-Order Delivery Delay in Packet Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.00167","kind":"arxiv","version":2},"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:04871ea8066a9484e0a878bde77416cf8cbfba2e8e69de76de2245a8fa123785","target":"record","created_at":"2026-05-18T01:06:24Z","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":"d1bbb6a658ecca629e6f17ccb97636200a999795d3b48b64998f77fba34e7505","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-09-01T07:53:05Z","title_canon_sha256":"92cbf17c28d9aa4a73118f47db4315d1a764327df174f6b0b861f7b7fa327c69"},"schema_version":"1.0","source":{"id":"1509.00167","kind":"arxiv","version":2}},"canonical_sha256":"4bb2a6465d8c9730a976699cf05ad2d57fd9931009cae2d1009b2c13e6ab01fc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4bb2a6465d8c9730a976699cf05ad2d57fd9931009cae2d1009b2c13e6ab01fc","first_computed_at":"2026-05-18T01:06:24.603115Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:06:24.603115Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kqpIrWSeDa2OP/3Pcb3OmhV4ipXIyDFjT4hGCho5OBxMu4Wld/FsTiZvUrsQq55qtObu4WCxYU5pHEYAZLZNBg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:06:24.603513Z","signed_message":"canonical_sha256_bytes"},"source_id":"1509.00167","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:04871ea8066a9484e0a878bde77416cf8cbfba2e8e69de76de2245a8fa123785","sha256:d453b234ff98df3a4adc6ec46b69257307ae8f677ac78dd29619c092928a5e9a"],"state_sha256":"452726d46262dd94875cfd438a0650ac1944b1a2425302de1b1ef7b372d7c452"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Kgn02APP8xLaTHIboL9yPKb8uHrwgdT3MICCAkWDB00VJ331HhXMT+5jNpC/SiRcgcYsmNeAGphD8S6qnuiBDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T03:15:18.023834Z","bundle_sha256":"90f56b55a9236e2537bff00a54d64575f90464f779a7ba6e52ba5d798f384c6e"}}