{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:OIDWXMRI6MKDLFDNF2WWSOZ6XS","short_pith_number":"pith:OIDWXMRI","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"},"canonical_sha256":"72076bb228f31435946d2ead693b3ebc8d8809cefe137495ecfe88ac90830fc4","source":{"kind":"arxiv","id":"1806.09768","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.09768","created_at":"2026-07-05T04:03:42Z"},{"alias_kind":"arxiv_version","alias_value":"1806.09768v4","created_at":"2026-07-05T04:03:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.09768","created_at":"2026-07-05T04:03:42Z"},{"alias_kind":"pith_short_12","alias_value":"OIDWXMRI6MKD","created_at":"2026-07-05T04:03:42Z"},{"alias_kind":"pith_short_16","alias_value":"OIDWXMRI6MKDLFDN","created_at":"2026-07-05T04:03:42Z"},{"alias_kind":"pith_short_8","alias_value":"OIDWXMRI","created_at":"2026-07-05T04:03:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:OIDWXMRI6MKDLFDNF2WWSOZ6XS","target":"record","payload":{"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"},"canonical_sha256":"72076bb228f31435946d2ead693b3ebc8d8809cefe137495ecfe88ac90830fc4","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"},"source_kind":"arxiv","source_id":"1806.09768","source_version":4,"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-07-05T04:03:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uwR94U6RUZFm7CDGRN3wud1KUtaxsFwoQdTJKGC1msCYmYbykQeCQ1Nn3ojIXJCVzFklbZCU4X/+wcXwI0IvBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-31T19:32:19.010813Z"},"content_sha256":"28c54f2201b4d8d7bf2d1c1f02e8d582431d00ab49f9c46d2dd7765281550522","schema_version":"1.0","event_id":"sha256:28c54f2201b4d8d7bf2d1c1f02e8d582431d00ab49f9c46d2dd7765281550522"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:OIDWXMRI6MKDLFDNF2WWSOZ6XS","target":"graph","payload":{"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"},"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-07-05T04:03:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+1DbA2ZvNDIsMBoW9fOdOCKoRE8nQ6lJQ4AJt/43Nun/WaBWPgeMQvXA+kINNLOw6xG5auQC+j0ebh74YRy6Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-31T19:32:19.011321Z"},"content_sha256":"a2147fe38bfa503900a3582bf6fd3a45f94de516c9cf8443d32fc07bf7d8f8f1","schema_version":"1.0","event_id":"sha256:a2147fe38bfa503900a3582bf6fd3a45f94de516c9cf8443d32fc07bf7d8f8f1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OIDWXMRI6MKDLFDNF2WWSOZ6XS/bundle.json","state_url":"https://pith.science/pith/OIDWXMRI6MKDLFDNF2WWSOZ6XS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OIDWXMRI6MKDLFDNF2WWSOZ6XS/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-07-31T19:32:19Z","links":{"resolver":"https://pith.science/pith/OIDWXMRI6MKDLFDNF2WWSOZ6XS","bundle":"https://pith.science/pith/OIDWXMRI6MKDLFDNF2WWSOZ6XS/bundle.json","state":"https://pith.science/pith/OIDWXMRI6MKDLFDNF2WWSOZ6XS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OIDWXMRI6MKDLFDNF2WWSOZ6XS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:OIDWXMRI6MKDLFDNF2WWSOZ6XS","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":"a72d60a2b5d3da2a4404467d969debbd605fdd164773cce492d4c6be703ec565","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-06-26T02:40:58Z","title_canon_sha256":"da97ab02bf69b2c0ae10f87df9cc56a21038634b284446131d9a64887d63330a"},"schema_version":"1.0","source":{"id":"1806.09768","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.09768","created_at":"2026-07-05T04:03:42Z"},{"alias_kind":"arxiv_version","alias_value":"1806.09768v4","created_at":"2026-07-05T04:03:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.09768","created_at":"2026-07-05T04:03:42Z"},{"alias_kind":"pith_short_12","alias_value":"OIDWXMRI6MKD","created_at":"2026-07-05T04:03:42Z"},{"alias_kind":"pith_short_16","alias_value":"OIDWXMRI6MKDLFDN","created_at":"2026-07-05T04:03:42Z"},{"alias_kind":"pith_short_8","alias_value":"OIDWXMRI","created_at":"2026-07-05T04:03:42Z"}],"graph_snapshots":[{"event_id":"sha256:a2147fe38bfa503900a3582bf6fd3a45f94de516c9cf8443d32fc07bf7d8f8f1","target":"graph","created_at":"2026-07-05T04:03:42Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1806.09768/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Ashish Khisti, Baochun Li, John Apostolopoulos, Silas L. Fong, Wai-Tian Tan, Xiaoqing Zhu","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-06-26T02:40:58Z","title":"Optimal Streaming Erasure Codes over the Three-Node Relay Network"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.09768","kind":"arxiv","version":4},"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:28c54f2201b4d8d7bf2d1c1f02e8d582431d00ab49f9c46d2dd7765281550522","target":"record","created_at":"2026-07-05T04:03:42Z","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":"a72d60a2b5d3da2a4404467d969debbd605fdd164773cce492d4c6be703ec565","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-06-26T02:40:58Z","title_canon_sha256":"da97ab02bf69b2c0ae10f87df9cc56a21038634b284446131d9a64887d63330a"},"schema_version":"1.0","source":{"id":"1806.09768","kind":"arxiv","version":4}},"canonical_sha256":"72076bb228f31435946d2ead693b3ebc8d8809cefe137495ecfe88ac90830fc4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"72076bb228f31435946d2ead693b3ebc8d8809cefe137495ecfe88ac90830fc4","first_computed_at":"2026-07-05T04:03:42.697429Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:03:42.697429Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"a7uoPlbBfI+H0mhhkvRmfWVremF5JCNSPjZzQARM7SRbyiaBLC14BHxdTLyQrCSHqj2R3kQ5U9VbzNqb4guNBw==","signature_status":"signed_v1","signed_at":"2026-07-05T04:03:42.697827Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.09768","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:28c54f2201b4d8d7bf2d1c1f02e8d582431d00ab49f9c46d2dd7765281550522","sha256:a2147fe38bfa503900a3582bf6fd3a45f94de516c9cf8443d32fc07bf7d8f8f1"],"state_sha256":"aaee25b60d2317e5043a5c8fbf18ec65ec81dfc3c6afb72528d8cff022d6e1a6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"u+K3GIldW38HtyvGMOdvpSL8JIhXK1thgBmLDXMfBhNuOqzSI0doSUYwBG16NMvu33LRp4R1MG9ykC4kKOS7DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-31T19:32:19.014983Z","bundle_sha256":"4bb6c1f99e502eee465ec5efa779600fdc9ba244ad39b4791dfc112444bc2575"}}