{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:Z6BNUUDATBN7EJLXRWMIIJNOT4","short_pith_number":"pith:Z6BNUUDA","schema_version":"1.0","canonical_sha256":"cf82da5060985bf225778d988425ae9f3a25a17788515a071db6354f7adf5a1c","source":{"kind":"arxiv","id":"1308.3827","version":1},"attestation_state":"computed","paper":{"title":"Layered Constructions for Low-Delay Streaming Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ahmed Badr, Ashish Khisti, John Apostolopoulos, Pratik Patil, Wai-Tian Tan","submitted_at":"2013-08-18T03:18:44Z","abstract_excerpt":"We propose a new class of error correction codes for low-delay streaming communication. We consider an online setup where a source packet arrives at the encoder every $M$ channel uses, and needs to be decoded with a maximum delay of $T$ packets. We consider a sliding-window erasure channel --- $\\cC(N,B,W)$ --- which introduces either up to $N$ erasures in arbitrary positions, or $B$ erasures in a single burst, in any window of length $W$. When $M=1$, the case where source-arrival and channel-transmission rates are equal, we propose a class of codes --- MiDAS codes --- that achieve a near optim"},"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":"1308.3827","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-08-18T03:18:44Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"af230e01614259d97a5e0ed7a32b67100c598d6a010d65cbb917bb3f16def7ee","abstract_canon_sha256":"7069e114c2064cb606b03788471e4ed8b71e6dc02906ac0b086fa0765d6fc77a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:16.928198Z","signature_b64":"tX6kYfnHv8yBkiWlKJt6nhXC+oNmHxC2069fn5pdI9wQQijrz1Rr4EykVErAhFPE1v2gCSl5IwFoH54S0loIAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cf82da5060985bf225778d988425ae9f3a25a17788515a071db6354f7adf5a1c","last_reissued_at":"2026-05-18T00:58:16.927499Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:16.927499Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Layered Constructions for Low-Delay Streaming Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ahmed Badr, Ashish Khisti, John Apostolopoulos, Pratik Patil, Wai-Tian Tan","submitted_at":"2013-08-18T03:18:44Z","abstract_excerpt":"We propose a new class of error correction codes for low-delay streaming communication. We consider an online setup where a source packet arrives at the encoder every $M$ channel uses, and needs to be decoded with a maximum delay of $T$ packets. We consider a sliding-window erasure channel --- $\\cC(N,B,W)$ --- which introduces either up to $N$ erasures in arbitrary positions, or $B$ erasures in a single burst, in any window of length $W$. When $M=1$, the case where source-arrival and channel-transmission rates are equal, we propose a class of codes --- MiDAS codes --- that achieve a near optim"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.3827","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":"1308.3827","created_at":"2026-05-18T00:58:16.927630+00:00"},{"alias_kind":"arxiv_version","alias_value":"1308.3827v1","created_at":"2026-05-18T00:58:16.927630+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.3827","created_at":"2026-05-18T00:58:16.927630+00:00"},{"alias_kind":"pith_short_12","alias_value":"Z6BNUUDATBN7","created_at":"2026-05-18T12:28:09.283467+00:00"},{"alias_kind":"pith_short_16","alias_value":"Z6BNUUDATBN7EJLX","created_at":"2026-05-18T12:28:09.283467+00:00"},{"alias_kind":"pith_short_8","alias_value":"Z6BNUUDA","created_at":"2026-05-18T12:28:09.283467+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/Z6BNUUDATBN7EJLXRWMIIJNOT4","json":"https://pith.science/pith/Z6BNUUDATBN7EJLXRWMIIJNOT4.json","graph_json":"https://pith.science/api/pith-number/Z6BNUUDATBN7EJLXRWMIIJNOT4/graph.json","events_json":"https://pith.science/api/pith-number/Z6BNUUDATBN7EJLXRWMIIJNOT4/events.json","paper":"https://pith.science/paper/Z6BNUUDA"},"agent_actions":{"view_html":"https://pith.science/pith/Z6BNUUDATBN7EJLXRWMIIJNOT4","download_json":"https://pith.science/pith/Z6BNUUDATBN7EJLXRWMIIJNOT4.json","view_paper":"https://pith.science/paper/Z6BNUUDA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1308.3827&json=true","fetch_graph":"https://pith.science/api/pith-number/Z6BNUUDATBN7EJLXRWMIIJNOT4/graph.json","fetch_events":"https://pith.science/api/pith-number/Z6BNUUDATBN7EJLXRWMIIJNOT4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Z6BNUUDATBN7EJLXRWMIIJNOT4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Z6BNUUDATBN7EJLXRWMIIJNOT4/action/storage_attestation","attest_author":"https://pith.science/pith/Z6BNUUDATBN7EJLXRWMIIJNOT4/action/author_attestation","sign_citation":"https://pith.science/pith/Z6BNUUDATBN7EJLXRWMIIJNOT4/action/citation_signature","submit_replication":"https://pith.science/pith/Z6BNUUDATBN7EJLXRWMIIJNOT4/action/replication_record"}},"created_at":"2026-05-18T00:58:16.927630+00:00","updated_at":"2026-05-18T00:58:16.927630+00:00"}