{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:NK7AOSLICO4D6LOZ6CVHO6L5VT","short_pith_number":"pith:NK7AOSLI","schema_version":"1.0","canonical_sha256":"6abe07496813b83f2dd9f0aa77797dacf9bbc6709d3e7ef1e5e3b75162ba29b3","source":{"kind":"arxiv","id":"1305.3596","version":1},"attestation_state":"computed","paper":{"title":"Robust Streaming Erasure Codes based on Deterministic Channel Approximations","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, Wai-Tian Tan","submitted_at":"2013-05-15T19:44:17Z","abstract_excerpt":"We study near optimal error correction codes for real-time communication. In our setup the encoder must operate on an incoming source stream in a sequential manner, and the decoder must reconstruct each source packet within a fixed playback deadline of $T$ packets. The underlying channel is a packet erasure channel that can introduce both burst and isolated losses.\n  We first consider a class of channels that in any window of length ${T+1}$ introduce either a single erasure burst of a given maximum length $B,$ or a certain maximum number $N$ of isolated erasures. We demonstrate that for a fixe"},"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":"1305.3596","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-05-15T19:44:17Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"c2bbb03a77005d2a173dbc0b4c3aafd4159694948957c4899f3f2d932ffd1411","abstract_canon_sha256":"a0d23bab2dd236b3a4bc22489a83ec96fac2799b64adb680551aed60bd26736d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:25:35.485607Z","signature_b64":"WvSXYfizOHLf8lsAfG6WfIvWc3uqfeVb8sjd81lx/mBYXzk0muvX3ixQuBTPR1+jwuy2txiRANnaP6fJGKCjDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6abe07496813b83f2dd9f0aa77797dacf9bbc6709d3e7ef1e5e3b75162ba29b3","last_reissued_at":"2026-05-18T03:25:35.485053Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:25:35.485053Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Robust Streaming Erasure Codes based on Deterministic Channel Approximations","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, Wai-Tian Tan","submitted_at":"2013-05-15T19:44:17Z","abstract_excerpt":"We study near optimal error correction codes for real-time communication. In our setup the encoder must operate on an incoming source stream in a sequential manner, and the decoder must reconstruct each source packet within a fixed playback deadline of $T$ packets. The underlying channel is a packet erasure channel that can introduce both burst and isolated losses.\n  We first consider a class of channels that in any window of length ${T+1}$ introduce either a single erasure burst of a given maximum length $B,$ or a certain maximum number $N$ of isolated erasures. We demonstrate that for a fixe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.3596","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":"1305.3596","created_at":"2026-05-18T03:25:35.485161+00:00"},{"alias_kind":"arxiv_version","alias_value":"1305.3596v1","created_at":"2026-05-18T03:25:35.485161+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.3596","created_at":"2026-05-18T03:25:35.485161+00:00"},{"alias_kind":"pith_short_12","alias_value":"NK7AOSLICO4D","created_at":"2026-05-18T12:27:52.871228+00:00"},{"alias_kind":"pith_short_16","alias_value":"NK7AOSLICO4D6LOZ","created_at":"2026-05-18T12:27:52.871228+00:00"},{"alias_kind":"pith_short_8","alias_value":"NK7AOSLI","created_at":"2026-05-18T12:27:52.871228+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/NK7AOSLICO4D6LOZ6CVHO6L5VT","json":"https://pith.science/pith/NK7AOSLICO4D6LOZ6CVHO6L5VT.json","graph_json":"https://pith.science/api/pith-number/NK7AOSLICO4D6LOZ6CVHO6L5VT/graph.json","events_json":"https://pith.science/api/pith-number/NK7AOSLICO4D6LOZ6CVHO6L5VT/events.json","paper":"https://pith.science/paper/NK7AOSLI"},"agent_actions":{"view_html":"https://pith.science/pith/NK7AOSLICO4D6LOZ6CVHO6L5VT","download_json":"https://pith.science/pith/NK7AOSLICO4D6LOZ6CVHO6L5VT.json","view_paper":"https://pith.science/paper/NK7AOSLI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1305.3596&json=true","fetch_graph":"https://pith.science/api/pith-number/NK7AOSLICO4D6LOZ6CVHO6L5VT/graph.json","fetch_events":"https://pith.science/api/pith-number/NK7AOSLICO4D6LOZ6CVHO6L5VT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NK7AOSLICO4D6LOZ6CVHO6L5VT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NK7AOSLICO4D6LOZ6CVHO6L5VT/action/storage_attestation","attest_author":"https://pith.science/pith/NK7AOSLICO4D6LOZ6CVHO6L5VT/action/author_attestation","sign_citation":"https://pith.science/pith/NK7AOSLICO4D6LOZ6CVHO6L5VT/action/citation_signature","submit_replication":"https://pith.science/pith/NK7AOSLICO4D6LOZ6CVHO6L5VT/action/replication_record"}},"created_at":"2026-05-18T03:25:35.485161+00:00","updated_at":"2026-05-18T03:25:35.485161+00:00"}