{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:OIDWXMRI6MKDLFDNF2WWSOZ6XS","short_pith_number":"pith:OIDWXMRI","schema_version":"1.0","canonical_sha256":"72076bb228f31435946d2ead693b3ebc8d8809cefe137495ecfe88ac90830fc4","source":{"kind":"arxiv","id":"1806.09768","version":4},"attestation_state":"computed","paper":{"title":"Optimal Streaming Erasure Codes over the Three-Node Relay Network","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ashish Khisti, Baochun Li, John Apostolopoulos, Silas L. Fong, Wai-Tian Tan, Xiaoqing Zhu","submitted_at":"2018-06-26T02:40:58Z","abstract_excerpt":"This paper investigates low-latency streaming codes for a three-node relay network. The source transmits a sequence of messages (streaming messages) to the destination through the relay between them, where the first-hop channel from the source to the relay and the second-hop channel from the relay to the destination are subject to packet erasures. Every source message must be recovered perfectly at the destination subject to a fixed decoding delay of $T$ time slots. In any sliding window of $T+1$ time slots, we assume no more than $N_1$ and $N_2$ erasures are introduced by the first-hop channe"},"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":"1806.09768","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-06-26T02:40:58Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"da97ab02bf69b2c0ae10f87df9cc56a21038634b284446131d9a64887d63330a","abstract_canon_sha256":"a72d60a2b5d3da2a4404467d969debbd605fdd164773cce492d4c6be703ec565"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:03:42.697827Z","signature_b64":"a7uoPlbBfI+H0mhhkvRmfWVremF5JCNSPjZzQARM7SRbyiaBLC14BHxdTLyQrCSHqj2R3kQ5U9VbzNqb4guNBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"72076bb228f31435946d2ead693b3ebc8d8809cefe137495ecfe88ac90830fc4","last_reissued_at":"2026-07-05T04:03:42.697429Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:03:42.697429Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Streaming Erasure Codes over the Three-Node Relay Network","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ashish Khisti, Baochun Li, John Apostolopoulos, Silas L. Fong, Wai-Tian Tan, Xiaoqing Zhu","submitted_at":"2018-06-26T02:40:58Z","abstract_excerpt":"This paper investigates low-latency streaming codes for a three-node relay network. The source transmits a sequence of messages (streaming messages) to the destination through the relay between them, where the first-hop channel from the source to the relay and the second-hop channel from the relay to the destination are subject to packet erasures. Every source message must be recovered perfectly at the destination subject to a fixed decoding delay of $T$ time slots. In any sliding window of $T+1$ time slots, we assume no more than $N_1$ and $N_2$ erasures are introduced by the first-hop channe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.09768","kind":"arxiv","version":4},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1806.09768/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1806.09768","created_at":"2026-07-05T04:03:42.697491+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.09768v4","created_at":"2026-07-05T04:03:42.697491+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.09768","created_at":"2026-07-05T04:03:42.697491+00:00"},{"alias_kind":"pith_short_12","alias_value":"OIDWXMRI6MKD","created_at":"2026-07-05T04:03:42.697491+00:00"},{"alias_kind":"pith_short_16","alias_value":"OIDWXMRI6MKDLFDN","created_at":"2026-07-05T04:03:42.697491+00:00"},{"alias_kind":"pith_short_8","alias_value":"OIDWXMRI","created_at":"2026-07-05T04:03:42.697491+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/OIDWXMRI6MKDLFDNF2WWSOZ6XS","json":"https://pith.science/pith/OIDWXMRI6MKDLFDNF2WWSOZ6XS.json","graph_json":"https://pith.science/api/pith-number/OIDWXMRI6MKDLFDNF2WWSOZ6XS/graph.json","events_json":"https://pith.science/api/pith-number/OIDWXMRI6MKDLFDNF2WWSOZ6XS/events.json","paper":"https://pith.science/paper/OIDWXMRI"},"agent_actions":{"view_html":"https://pith.science/pith/OIDWXMRI6MKDLFDNF2WWSOZ6XS","download_json":"https://pith.science/pith/OIDWXMRI6MKDLFDNF2WWSOZ6XS.json","view_paper":"https://pith.science/paper/OIDWXMRI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.09768&json=true","fetch_graph":"https://pith.science/api/pith-number/OIDWXMRI6MKDLFDNF2WWSOZ6XS/graph.json","fetch_events":"https://pith.science/api/pith-number/OIDWXMRI6MKDLFDNF2WWSOZ6XS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OIDWXMRI6MKDLFDNF2WWSOZ6XS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OIDWXMRI6MKDLFDNF2WWSOZ6XS/action/storage_attestation","attest_author":"https://pith.science/pith/OIDWXMRI6MKDLFDNF2WWSOZ6XS/action/author_attestation","sign_citation":"https://pith.science/pith/OIDWXMRI6MKDLFDNF2WWSOZ6XS/action/citation_signature","submit_replication":"https://pith.science/pith/OIDWXMRI6MKDLFDNF2WWSOZ6XS/action/replication_record"}},"created_at":"2026-07-05T04:03:42.697491+00:00","updated_at":"2026-07-05T04:03:42.697491+00:00"}