{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:7W3UHPI4XR22LXV2Q4CV6PK4E4","short_pith_number":"pith:7W3UHPI4","schema_version":"1.0","canonical_sha256":"fdb743bd1cbc75a5deba87055f3d5c27139438e17c7d060eb66179d5a3b2df6d","source":{"kind":"arxiv","id":"1904.06212","version":2},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1904.06212","created_at":"2026-07-05T01:02:38.860243+00:00"},{"alias_kind":"arxiv_version","alias_value":"1904.06212v2","created_at":"2026-07-05T01:02:38.860243+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.06212","created_at":"2026-07-05T01:02:38.860243+00:00"},{"alias_kind":"pith_short_12","alias_value":"7W3UHPI4XR22","created_at":"2026-07-05T01:02:38.860243+00:00"},{"alias_kind":"pith_short_16","alias_value":"7W3UHPI4XR22LXV2","created_at":"2026-07-05T01:02:38.860243+00:00"},{"alias_kind":"pith_short_8","alias_value":"7W3UHPI4","created_at":"2026-07-05T01:02:38.860243+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/7W3UHPI4XR22LXV2Q4CV6PK4E4","json":"https://pith.science/pith/7W3UHPI4XR22LXV2Q4CV6PK4E4.json","graph_json":"https://pith.science/api/pith-number/7W3UHPI4XR22LXV2Q4CV6PK4E4/graph.json","events_json":"https://pith.science/api/pith-number/7W3UHPI4XR22LXV2Q4CV6PK4E4/events.json","paper":"https://pith.science/paper/7W3UHPI4"},"agent_actions":{"view_html":"https://pith.science/pith/7W3UHPI4XR22LXV2Q4CV6PK4E4","download_json":"https://pith.science/pith/7W3UHPI4XR22LXV2Q4CV6PK4E4.json","view_paper":"https://pith.science/paper/7W3UHPI4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1904.06212&json=true","fetch_graph":"https://pith.science/api/pith-number/7W3UHPI4XR22LXV2Q4CV6PK4E4/graph.json","fetch_events":"https://pith.science/api/pith-number/7W3UHPI4XR22LXV2Q4CV6PK4E4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7W3UHPI4XR22LXV2Q4CV6PK4E4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7W3UHPI4XR22LXV2Q4CV6PK4E4/action/storage_attestation","attest_author":"https://pith.science/pith/7W3UHPI4XR22LXV2Q4CV6PK4E4/action/author_attestation","sign_citation":"https://pith.science/pith/7W3UHPI4XR22LXV2Q4CV6PK4E4/action/citation_signature","submit_replication":"https://pith.science/pith/7W3UHPI4XR22LXV2Q4CV6PK4E4/action/replication_record"}},"created_at":"2026-07-05T01:02:38.860243+00:00","updated_at":"2026-07-05T01:02:38.860243+00:00"}