{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:IYF2HFRBSVAHM75GSYESW2XSTT","short_pith_number":"pith:IYF2HFRB","schema_version":"1.0","canonical_sha256":"460ba396219540767fa696092b6af29cf519d9e8bcd65326e15c770e0a8e1b79","source":{"kind":"arxiv","id":"1801.05919","version":1},"attestation_state":"computed","paper":{"title":"Rate-Optimal Streaming Codes for Channels with Burst and Isolated Erasures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"M. Nikhil Krishnan, P. Vijay Kumar","submitted_at":"2018-01-18T03:06:54Z","abstract_excerpt":"Recovery of data packets from packet erasures in a timely manner is critical for many streaming applications. An early paper by Martinian and Sundberg introduced a framework for streaming codes and designed rate-optimal codes that permit delay-constrained recovery from an erasure burst of length up to $B$. A recent work by Badr et al. extended this result and introduced a sliding-window channel model $\\mathcal{C}(N,B,W)$. Under this model, in a sliding-window of width $W$, one of the following erasure patterns are possible (i) a burst of length at most $B$ or (ii) at most $N$ (possibly non-con"},"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":"1801.05919","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-18T03:06:54Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"3b5cbcdddfa750b53fb110c0feaf266be41c936bb298e5db6bbdb7b4799f1f3d","abstract_canon_sha256":"ba35d074911fcaf11bfbbb6197c50b60838bda61cd3bd088ffd5c3debd73693d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:25:36.134779Z","signature_b64":"SU5YJni5jjOpzYy+n41JVRbZSJ1uyqmAvHhB8sG4/IISL5LSKCHk1DgmktSHxHcHLoCGxZtIpp7QUU3qynHBAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"460ba396219540767fa696092b6af29cf519d9e8bcd65326e15c770e0a8e1b79","last_reissued_at":"2026-05-18T00:25:36.134041Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:25:36.134041Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Rate-Optimal Streaming Codes for Channels with Burst and Isolated Erasures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"M. Nikhil Krishnan, P. Vijay Kumar","submitted_at":"2018-01-18T03:06:54Z","abstract_excerpt":"Recovery of data packets from packet erasures in a timely manner is critical for many streaming applications. An early paper by Martinian and Sundberg introduced a framework for streaming codes and designed rate-optimal codes that permit delay-constrained recovery from an erasure burst of length up to $B$. A recent work by Badr et al. extended this result and introduced a sliding-window channel model $\\mathcal{C}(N,B,W)$. Under this model, in a sliding-window of width $W$, one of the following erasure patterns are possible (i) a burst of length at most $B$ or (ii) at most $N$ (possibly non-con"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.05919","kind":"arxiv","version":1},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1801.05919","created_at":"2026-05-18T00:25:36.134161+00:00"},{"alias_kind":"arxiv_version","alias_value":"1801.05919v1","created_at":"2026-05-18T00:25:36.134161+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.05919","created_at":"2026-05-18T00:25:36.134161+00:00"},{"alias_kind":"pith_short_12","alias_value":"IYF2HFRBSVAH","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_16","alias_value":"IYF2HFRBSVAHM75G","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_8","alias_value":"IYF2HFRB","created_at":"2026-05-18T12:32:31.084164+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/IYF2HFRBSVAHM75GSYESW2XSTT","json":"https://pith.science/pith/IYF2HFRBSVAHM75GSYESW2XSTT.json","graph_json":"https://pith.science/api/pith-number/IYF2HFRBSVAHM75GSYESW2XSTT/graph.json","events_json":"https://pith.science/api/pith-number/IYF2HFRBSVAHM75GSYESW2XSTT/events.json","paper":"https://pith.science/paper/IYF2HFRB"},"agent_actions":{"view_html":"https://pith.science/pith/IYF2HFRBSVAHM75GSYESW2XSTT","download_json":"https://pith.science/pith/IYF2HFRBSVAHM75GSYESW2XSTT.json","view_paper":"https://pith.science/paper/IYF2HFRB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1801.05919&json=true","fetch_graph":"https://pith.science/api/pith-number/IYF2HFRBSVAHM75GSYESW2XSTT/graph.json","fetch_events":"https://pith.science/api/pith-number/IYF2HFRBSVAHM75GSYESW2XSTT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IYF2HFRBSVAHM75GSYESW2XSTT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IYF2HFRBSVAHM75GSYESW2XSTT/action/storage_attestation","attest_author":"https://pith.science/pith/IYF2HFRBSVAHM75GSYESW2XSTT/action/author_attestation","sign_citation":"https://pith.science/pith/IYF2HFRBSVAHM75GSYESW2XSTT/action/citation_signature","submit_replication":"https://pith.science/pith/IYF2HFRBSVAHM75GSYESW2XSTT/action/replication_record"}},"created_at":"2026-05-18T00:25:36.134161+00:00","updated_at":"2026-05-18T00:25:36.134161+00:00"}