{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:YJSGZDYKQOYJC67I5FCLWVXUVO","short_pith_number":"pith:YJSGZDYK","canonical_record":{"source":{"id":"1801.04241","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-12T17:22:49Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"7a251db1857dde09a167332bbb17c8fb17b90ab2b5bccd6dd8ac5e9c439c6e45","abstract_canon_sha256":"f4c7455ff952f46d6c8919724368b6e926019d17ba43c49246b87ffbda95fe4b"},"schema_version":"1.0"},"canonical_sha256":"c2646c8f0a83b0917be8e944bb56f4abb6095e15aba3b9b492b14517ecb86e51","source":{"kind":"arxiv","id":"1801.04241","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.04241","created_at":"2026-05-17T23:58:59Z"},{"alias_kind":"arxiv_version","alias_value":"1801.04241v2","created_at":"2026-05-17T23:58:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.04241","created_at":"2026-05-17T23:58:59Z"},{"alias_kind":"pith_short_12","alias_value":"YJSGZDYKQOYJ","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"YJSGZDYKQOYJC67I","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"YJSGZDYK","created_at":"2026-05-18T12:33:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:YJSGZDYKQOYJC67I5FCLWVXUVO","target":"record","payload":{"canonical_record":{"source":{"id":"1801.04241","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-12T17:22:49Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"7a251db1857dde09a167332bbb17c8fb17b90ab2b5bccd6dd8ac5e9c439c6e45","abstract_canon_sha256":"f4c7455ff952f46d6c8919724368b6e926019d17ba43c49246b87ffbda95fe4b"},"schema_version":"1.0"},"canonical_sha256":"c2646c8f0a83b0917be8e944bb56f4abb6095e15aba3b9b492b14517ecb86e51","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:58:59.288527Z","signature_b64":"4ciyROuy7Ec7b5HtqPRjMAJripBwOmEk14ELSdMm4xp8iXVEz3EPu7HvpTuppNkh9RgMDUPmT4G5d+D/y2C1Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c2646c8f0a83b0917be8e944bb56f4abb6095e15aba3b9b492b14517ecb86e51","last_reissued_at":"2026-05-17T23:58:59.287898Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:58:59.287898Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1801.04241","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-17T23:58:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cK3BRAzv3D5l2BHuFYSADX/9S35NQD4tZuH2sf1pPzCJhHY31y4wL4HN0PTgjMYz9XMSswCIusc4eA6nwtA7Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T02:15:11.237310Z"},"content_sha256":"9914402ccfa88d331b62b561a75d1f454ab597275f0f61f8624fbbf549a305d0","schema_version":"1.0","event_id":"sha256:9914402ccfa88d331b62b561a75d1f454ab597275f0f61f8624fbbf549a305d0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:YJSGZDYKQOYJC67I5FCLWVXUVO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Streaming Codes for Channels with Burst and Arbitrary Erasures","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-01-12T17:22:49Z","abstract_excerpt":"This paper considers transmitting a sequence of messages (a streaming source) over a packet erasure channel. In each time slot, the source constructs a packet based on the current and the previous messages and transmits the packet, which may be erased when the packet travels from the source to the destination. Every source message must be recovered perfectly at the destination subject to a fixed decoding delay. We assume that the channel loss model introduces either one burst erasure or multiple arbitrary erasures in any fixed-sized sliding window. Under this channel loss assumption, we fully "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.04241","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-17T23:58:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EjITR0fi0bsg1zFzoo53ZuvTThHq6ufN76U7zbap0f/eboLTDMxUgLMMQ4ubgbAu4W//9gnT04pgCg5M6ngUBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T02:15:11.238041Z"},"content_sha256":"d0c4e1db2232c79d1a9d8b450e536c4e7c055ec2044fe64e4d4526a36c098f1e","schema_version":"1.0","event_id":"sha256:d0c4e1db2232c79d1a9d8b450e536c4e7c055ec2044fe64e4d4526a36c098f1e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YJSGZDYKQOYJC67I5FCLWVXUVO/bundle.json","state_url":"https://pith.science/pith/YJSGZDYKQOYJC67I5FCLWVXUVO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YJSGZDYKQOYJC67I5FCLWVXUVO/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-23T02:15:11Z","links":{"resolver":"https://pith.science/pith/YJSGZDYKQOYJC67I5FCLWVXUVO","bundle":"https://pith.science/pith/YJSGZDYKQOYJC67I5FCLWVXUVO/bundle.json","state":"https://pith.science/pith/YJSGZDYKQOYJC67I5FCLWVXUVO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YJSGZDYKQOYJC67I5FCLWVXUVO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:YJSGZDYKQOYJC67I5FCLWVXUVO","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":"f4c7455ff952f46d6c8919724368b6e926019d17ba43c49246b87ffbda95fe4b","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-12T17:22:49Z","title_canon_sha256":"7a251db1857dde09a167332bbb17c8fb17b90ab2b5bccd6dd8ac5e9c439c6e45"},"schema_version":"1.0","source":{"id":"1801.04241","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.04241","created_at":"2026-05-17T23:58:59Z"},{"alias_kind":"arxiv_version","alias_value":"1801.04241v2","created_at":"2026-05-17T23:58:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.04241","created_at":"2026-05-17T23:58:59Z"},{"alias_kind":"pith_short_12","alias_value":"YJSGZDYKQOYJ","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"YJSGZDYKQOYJC67I","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"YJSGZDYK","created_at":"2026-05-18T12:33:04Z"}],"graph_snapshots":[{"event_id":"sha256:d0c4e1db2232c79d1a9d8b450e536c4e7c055ec2044fe64e4d4526a36c098f1e","target":"graph","created_at":"2026-05-17T23:58:59Z","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":"This paper considers transmitting a sequence of messages (a streaming source) over a packet erasure channel. In each time slot, the source constructs a packet based on the current and the previous messages and transmits the packet, which may be erased when the packet travels from the source to the destination. Every source message must be recovered perfectly at the destination subject to a fixed decoding delay. We assume that the channel loss model introduces either one burst erasure or multiple arbitrary erasures in any fixed-sized sliding window. Under this channel loss assumption, we fully ","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-01-12T17:22:49Z","title":"Optimal Streaming Codes for Channels with Burst and Arbitrary Erasures"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.04241","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:9914402ccfa88d331b62b561a75d1f454ab597275f0f61f8624fbbf549a305d0","target":"record","created_at":"2026-05-17T23:58:59Z","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":"f4c7455ff952f46d6c8919724368b6e926019d17ba43c49246b87ffbda95fe4b","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-12T17:22:49Z","title_canon_sha256":"7a251db1857dde09a167332bbb17c8fb17b90ab2b5bccd6dd8ac5e9c439c6e45"},"schema_version":"1.0","source":{"id":"1801.04241","kind":"arxiv","version":2}},"canonical_sha256":"c2646c8f0a83b0917be8e944bb56f4abb6095e15aba3b9b492b14517ecb86e51","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c2646c8f0a83b0917be8e944bb56f4abb6095e15aba3b9b492b14517ecb86e51","first_computed_at":"2026-05-17T23:58:59.287898Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:58:59.287898Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4ciyROuy7Ec7b5HtqPRjMAJripBwOmEk14ELSdMm4xp8iXVEz3EPu7HvpTuppNkh9RgMDUPmT4G5d+D/y2C1Bg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:58:59.288527Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.04241","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9914402ccfa88d331b62b561a75d1f454ab597275f0f61f8624fbbf549a305d0","sha256:d0c4e1db2232c79d1a9d8b450e536c4e7c055ec2044fe64e4d4526a36c098f1e"],"state_sha256":"1312c357238c2735313eb9117809b22f8f625863644affbf031551d337859b4e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"11YsMELGN/CuOwKVI5ppWDoAMpGFTVLfFUy5g+AzXOMRZTOu5Flc2A5x3k/swOoSvKWHXhd1Nwz7a2yebRDuCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-23T02:15:11.242142Z","bundle_sha256":"5aad23b4a39119506643b77de0be04c360c5b4ad37ed60d8fdabc2432611cc8a"}}