{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:TR3GQNPEV6SBZ2V22Q7Z4YQEDW","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":"feb0ecf65bc15814968839977ab4964f1bbe9c36799b6ca2dd1803effdbd6368","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-03-14T18:35:08Z","title_canon_sha256":"3d5425773e8edcbb6359b3c2a76dd4809b3e2d1b912e5d57ae28eca8a969dcd6"},"schema_version":"1.0","source":{"id":"1903.06210","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.06210","created_at":"2026-05-17T23:51:11Z"},{"alias_kind":"arxiv_version","alias_value":"1903.06210v1","created_at":"2026-05-17T23:51:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.06210","created_at":"2026-05-17T23:51:11Z"},{"alias_kind":"pith_short_12","alias_value":"TR3GQNPEV6SB","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"TR3GQNPEV6SBZ2V2","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"TR3GQNPE","created_at":"2026-05-18T12:33:30Z"}],"graph_snapshots":[{"event_id":"sha256:cfc6c246448a25a0ed153ee89ae935540acc60e0f05ab2de84f7b7687a2f93c5","target":"graph","created_at":"2026-05-17T23:51:11Z","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":"In this paper, we design erasure-correcting codes for channels with burst and random erasures, when a strict decoding delay constraint is in place. We consider the sliding-window-based packet erasure model proposed by Badr et al., where any time-window of width $w$ contains either up to $a$ random erasures or an erasure burst of length at most $b$. One needs to recover any erased packet, where erasures are as per the channel model, with a strict decoding delay deadline of $\\tau$ time slots. Presently existing rate-optimal constructions in the literature require, in general, a field-size which ","authors_text":"Deeptanshu Shukla, M. Nikhil Krishnan, P. Vijay Kumar","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-03-14T18:35:08Z","title":"Low Field-size, Rate-Optimal Streaming Codes for Channels With Burst and Random Erasures"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.06210","kind":"arxiv","version":1},"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:56585d7f9d19d628f9fb9b931702fa972ecdddc04022ef75124a14a9e97218ab","target":"record","created_at":"2026-05-17T23:51:11Z","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":"feb0ecf65bc15814968839977ab4964f1bbe9c36799b6ca2dd1803effdbd6368","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-03-14T18:35:08Z","title_canon_sha256":"3d5425773e8edcbb6359b3c2a76dd4809b3e2d1b912e5d57ae28eca8a969dcd6"},"schema_version":"1.0","source":{"id":"1903.06210","kind":"arxiv","version":1}},"canonical_sha256":"9c766835e4afa41ceabad43f9e62041d823c222225e213f3c02ffbb23061c672","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9c766835e4afa41ceabad43f9e62041d823c222225e213f3c02ffbb23061c672","first_computed_at":"2026-05-17T23:51:11.473477Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:51:11.473477Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Yq3oARZRbA0txMLWg140UViTb284pNDh9B1FLkbsCXZOqRVshdDu5SDQu8QIhtCqxMFrbSInRag2GQDPSZMUBw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:51:11.473909Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.06210","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:56585d7f9d19d628f9fb9b931702fa972ecdddc04022ef75124a14a9e97218ab","sha256:cfc6c246448a25a0ed153ee89ae935540acc60e0f05ab2de84f7b7687a2f93c5"],"state_sha256":"067ca1c5853c664a0d714013bee5b742d34b05a665f2465a2359a27c4b2e736c"}