{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:ELXHFQIGXU656E5BWA6YB72NUS","short_pith_number":"pith:ELXHFQIG","schema_version":"1.0","canonical_sha256":"22ee72c106bd3ddf13a1b03d80ff4da49fa5ce1f314c3b2af59cd571449e0e89","source":{"kind":"arxiv","id":"1208.0072","version":1},"attestation_state":"computed","paper":{"title":"Streaming Codes for Channels with Burst and Isolated Erasures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MM","math.IT"],"primary_cat":"cs.IT","authors_text":"Ahmed Badr, Ashish Khisti, John Apostolopoulos, Wai-Tian Tan","submitted_at":"2012-08-01T03:36:44Z","abstract_excerpt":"We study low-delay error correction codes for streaming recovery over a class of packet-erasure channels that introduce both burst-erasures and isolated erasures. We propose a simple, yet effective class of codes whose parameters can be tuned to obtain a tradeoff between the capability to correct burst and isolated erasures. Our construction generalizes previously proposed low-delay codes which are effective only against burst erasures. We establish an information theoretic upper bound on the capability of any code to simultaneously correct burst and isolated erasures and show that our propose"},"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":"1208.0072","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-08-01T03:36:44Z","cross_cats_sorted":["cs.MM","math.IT"],"title_canon_sha256":"3ddc90668d84d5ef94ea3c706c1bade8d6f126877ee92fdcd6c5140b008de656","abstract_canon_sha256":"819bc20c39ab1f906658348754078a3b6d39a7798df9ac72288b7f6314ba970e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:49:45.119136Z","signature_b64":"rt76D9EHSmrcUKodN5VAF3S1J7ReJ4/Ysjbnw3/0v+UJJvNRIAOdkbssEa4jeOZqsitR/INlMat6w0a3EHWRAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"22ee72c106bd3ddf13a1b03d80ff4da49fa5ce1f314c3b2af59cd571449e0e89","last_reissued_at":"2026-05-18T03:49:45.118466Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:49:45.118466Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Streaming Codes for Channels with Burst and Isolated Erasures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MM","math.IT"],"primary_cat":"cs.IT","authors_text":"Ahmed Badr, Ashish Khisti, John Apostolopoulos, Wai-Tian Tan","submitted_at":"2012-08-01T03:36:44Z","abstract_excerpt":"We study low-delay error correction codes for streaming recovery over a class of packet-erasure channels that introduce both burst-erasures and isolated erasures. We propose a simple, yet effective class of codes whose parameters can be tuned to obtain a tradeoff between the capability to correct burst and isolated erasures. Our construction generalizes previously proposed low-delay codes which are effective only against burst erasures. We establish an information theoretic upper bound on the capability of any code to simultaneously correct burst and isolated erasures and show that our propose"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.0072","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":"1208.0072","created_at":"2026-05-18T03:49:45.118584+00:00"},{"alias_kind":"arxiv_version","alias_value":"1208.0072v1","created_at":"2026-05-18T03:49:45.118584+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.0072","created_at":"2026-05-18T03:49:45.118584+00:00"},{"alias_kind":"pith_short_12","alias_value":"ELXHFQIGXU65","created_at":"2026-05-18T12:27:04.183437+00:00"},{"alias_kind":"pith_short_16","alias_value":"ELXHFQIGXU656E5B","created_at":"2026-05-18T12:27:04.183437+00:00"},{"alias_kind":"pith_short_8","alias_value":"ELXHFQIG","created_at":"2026-05-18T12:27:04.183437+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/ELXHFQIGXU656E5BWA6YB72NUS","json":"https://pith.science/pith/ELXHFQIGXU656E5BWA6YB72NUS.json","graph_json":"https://pith.science/api/pith-number/ELXHFQIGXU656E5BWA6YB72NUS/graph.json","events_json":"https://pith.science/api/pith-number/ELXHFQIGXU656E5BWA6YB72NUS/events.json","paper":"https://pith.science/paper/ELXHFQIG"},"agent_actions":{"view_html":"https://pith.science/pith/ELXHFQIGXU656E5BWA6YB72NUS","download_json":"https://pith.science/pith/ELXHFQIGXU656E5BWA6YB72NUS.json","view_paper":"https://pith.science/paper/ELXHFQIG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1208.0072&json=true","fetch_graph":"https://pith.science/api/pith-number/ELXHFQIGXU656E5BWA6YB72NUS/graph.json","fetch_events":"https://pith.science/api/pith-number/ELXHFQIGXU656E5BWA6YB72NUS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ELXHFQIGXU656E5BWA6YB72NUS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ELXHFQIGXU656E5BWA6YB72NUS/action/storage_attestation","attest_author":"https://pith.science/pith/ELXHFQIGXU656E5BWA6YB72NUS/action/author_attestation","sign_citation":"https://pith.science/pith/ELXHFQIGXU656E5BWA6YB72NUS/action/citation_signature","submit_replication":"https://pith.science/pith/ELXHFQIGXU656E5BWA6YB72NUS/action/replication_record"}},"created_at":"2026-05-18T03:49:45.118584+00:00","updated_at":"2026-05-18T03:49:45.118584+00:00"}