{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:7W3UHPI4XR22LXV2Q4CV6PK4E4","short_pith_number":"pith:7W3UHPI4","canonical_record":{"source":{"id":"1904.06212","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-04-11T16:45:47Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"fee987d71d3f59006a2dff349b028dd970a9f19b8d7cf874ad1da3b59c663234","abstract_canon_sha256":"7d9cf2d8117e2eed6e548117e70fb587fd9f640da65d1b5db49d91310d77560f"},"schema_version":"1.0"},"canonical_sha256":"fdb743bd1cbc75a5deba87055f3d5c27139438e17c7d060eb66179d5a3b2df6d","source":{"kind":"arxiv","id":"1904.06212","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.06212","created_at":"2026-07-05T01:02:38Z"},{"alias_kind":"arxiv_version","alias_value":"1904.06212v2","created_at":"2026-07-05T01:02:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.06212","created_at":"2026-07-05T01:02:38Z"},{"alias_kind":"pith_short_12","alias_value":"7W3UHPI4XR22","created_at":"2026-07-05T01:02:38Z"},{"alias_kind":"pith_short_16","alias_value":"7W3UHPI4XR22LXV2","created_at":"2026-07-05T01:02:38Z"},{"alias_kind":"pith_short_8","alias_value":"7W3UHPI4","created_at":"2026-07-05T01:02:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:7W3UHPI4XR22LXV2Q4CV6PK4E4","target":"record","payload":{"canonical_record":{"source":{"id":"1904.06212","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-04-11T16:45:47Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"fee987d71d3f59006a2dff349b028dd970a9f19b8d7cf874ad1da3b59c663234","abstract_canon_sha256":"7d9cf2d8117e2eed6e548117e70fb587fd9f640da65d1b5db49d91310d77560f"},"schema_version":"1.0"},"canonical_sha256":"fdb743bd1cbc75a5deba87055f3d5c27139438e17c7d060eb66179d5a3b2df6d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:02:38.860648Z","signature_b64":"A1Gerx/h4rOk3dwnpqy+TNF48wioCGLR23UkruNc0M2Hh56un+2D0IUGlMmKTMqY7crP1N24B9ywRrdrdirGAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fdb743bd1cbc75a5deba87055f3d5c27139438e17c7d060eb66179d5a3b2df6d","last_reissued_at":"2026-07-05T01:02:38.860186Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:02:38.860186Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1904.06212","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-07-05T01:02:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SpoDPyqcezWwVJgzD4vt1I8LsemTfJYJ2ZXlwPZj0at208z18/1mFev0Yxk+t1QYQsTdzwCEBKUmApsVKDISBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T05:06:20.663443Z"},"content_sha256":"e820002f147fa47f502f3b80805b05d105eb05cc4a0aaa38274cb7a8bce4e79e","schema_version":"1.0","event_id":"sha256:e820002f147fa47f502f3b80805b05d105eb05cc4a0aaa38274cb7a8bce4e79e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:7W3UHPI4XR22LXV2Q4CV6PK4E4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Explicit Rate-Optimal Streaming Code 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, Elad Domanovitz, Silas L. Fong","submitted_at":"2019-04-11T16:45:47Z","abstract_excerpt":"This paper considers the transmission of an infinite sequence of messages (a streaming source) over a packet erasure channel, where every source message must be recovered perfectly at the destination subject to a fixed decoding delay. While the capacity of a channel that introduces only bursts of erasures is well known, only recently, the capacity of a channel with either one burst of erasures or multiple arbitrary erasures in any fixed-sized sliding window has been established. However, the codes shown to achieve this capacity are either non-explicit constructions (proven to exist) or explici"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.06212","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1904.06212/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-05T01:02:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"v4hWgrdoBp1lg1+pUyeYwwDQpoEXi3IqGz+VEIBxS2eCrTmZrnZp4Uto9mSOTE/EK9JzYmAVGdSE5OzRadFiAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T05:06:20.663981Z"},"content_sha256":"fec5ef13018d98964706427a6156411a4c51869a26e171ac6aeaf90a40c1e67f","schema_version":"1.0","event_id":"sha256:fec5ef13018d98964706427a6156411a4c51869a26e171ac6aeaf90a40c1e67f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7W3UHPI4XR22LXV2Q4CV6PK4E4/bundle.json","state_url":"https://pith.science/pith/7W3UHPI4XR22LXV2Q4CV6PK4E4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7W3UHPI4XR22LXV2Q4CV6PK4E4/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-08-05T05:06:20Z","links":{"resolver":"https://pith.science/pith/7W3UHPI4XR22LXV2Q4CV6PK4E4","bundle":"https://pith.science/pith/7W3UHPI4XR22LXV2Q4CV6PK4E4/bundle.json","state":"https://pith.science/pith/7W3UHPI4XR22LXV2Q4CV6PK4E4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7W3UHPI4XR22LXV2Q4CV6PK4E4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:7W3UHPI4XR22LXV2Q4CV6PK4E4","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":"7d9cf2d8117e2eed6e548117e70fb587fd9f640da65d1b5db49d91310d77560f","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-04-11T16:45:47Z","title_canon_sha256":"fee987d71d3f59006a2dff349b028dd970a9f19b8d7cf874ad1da3b59c663234"},"schema_version":"1.0","source":{"id":"1904.06212","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.06212","created_at":"2026-07-05T01:02:38Z"},{"alias_kind":"arxiv_version","alias_value":"1904.06212v2","created_at":"2026-07-05T01:02:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.06212","created_at":"2026-07-05T01:02:38Z"},{"alias_kind":"pith_short_12","alias_value":"7W3UHPI4XR22","created_at":"2026-07-05T01:02:38Z"},{"alias_kind":"pith_short_16","alias_value":"7W3UHPI4XR22LXV2","created_at":"2026-07-05T01:02:38Z"},{"alias_kind":"pith_short_8","alias_value":"7W3UHPI4","created_at":"2026-07-05T01:02:38Z"}],"graph_snapshots":[{"event_id":"sha256:fec5ef13018d98964706427a6156411a4c51869a26e171ac6aeaf90a40c1e67f","target":"graph","created_at":"2026-07-05T01:02:38Z","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/1904.06212/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This paper considers the transmission of an infinite sequence of messages (a streaming source) over a packet erasure channel, where every source message must be recovered perfectly at the destination subject to a fixed decoding delay. While the capacity of a channel that introduces only bursts of erasures is well known, only recently, the capacity of a channel with either one burst of erasures or multiple arbitrary erasures in any fixed-sized sliding window has been established. However, the codes shown to achieve this capacity are either non-explicit constructions (proven to exist) or explici","authors_text":"Ashish Khisti, Elad Domanovitz, Silas L. Fong","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-04-11T16:45:47Z","title":"An Explicit Rate-Optimal Streaming Code for Channels with Burst and Arbitrary Erasures"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.06212","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:e820002f147fa47f502f3b80805b05d105eb05cc4a0aaa38274cb7a8bce4e79e","target":"record","created_at":"2026-07-05T01:02:38Z","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":"7d9cf2d8117e2eed6e548117e70fb587fd9f640da65d1b5db49d91310d77560f","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-04-11T16:45:47Z","title_canon_sha256":"fee987d71d3f59006a2dff349b028dd970a9f19b8d7cf874ad1da3b59c663234"},"schema_version":"1.0","source":{"id":"1904.06212","kind":"arxiv","version":2}},"canonical_sha256":"fdb743bd1cbc75a5deba87055f3d5c27139438e17c7d060eb66179d5a3b2df6d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fdb743bd1cbc75a5deba87055f3d5c27139438e17c7d060eb66179d5a3b2df6d","first_computed_at":"2026-07-05T01:02:38.860186Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:02:38.860186Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"A1Gerx/h4rOk3dwnpqy+TNF48wioCGLR23UkruNc0M2Hh56un+2D0IUGlMmKTMqY7crP1N24B9ywRrdrdirGAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T01:02:38.860648Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.06212","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e820002f147fa47f502f3b80805b05d105eb05cc4a0aaa38274cb7a8bce4e79e","sha256:fec5ef13018d98964706427a6156411a4c51869a26e171ac6aeaf90a40c1e67f"],"state_sha256":"b7e445b970634c9046357816e36ae4bedf9e4d13fcd4186010786cc8afa1af8a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Tw8Tbl7YQkKLIdwecV1t63iGzn+hhEPxxnAIAqqJo5eX/JmgATzq/UxHdIxAE/Kwdh/aD/tlI00RU6v5x4tBAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T05:06:20.667836Z","bundle_sha256":"19e5029477491e3d2bf84f9e4d640461b89b9df8b06a94ab3ce2cf87a031cbca"}}