{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:2HFAJ26FJZP5UY7OYEFXO2OBWC","short_pith_number":"pith:2HFAJ26F","schema_version":"1.0","canonical_sha256":"d1ca04ebc54e5fda63eec10b7769c1b0a8b9eb8f2ad242cdddab1f17e794984e","source":{"kind":"arxiv","id":"1303.4370","version":1},"attestation_state":"computed","paper":{"title":"Streaming-Codes for Multicast over Burst Erasure Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ahmed Badr, Ashish Khisti, Devin Lui","submitted_at":"2013-03-18T19:36:31Z","abstract_excerpt":"We study the capacity limits of real-time streaming over burst-erasure channels. A stream of source packets must be sequentially encoded and the resulting channel packets must be transmitted over a two-receiver burst-erasure broadcast channel. The source packets must be sequentially reconstructed at each receiver with a possibly different reconstruction deadline. We study the associated capacity as a function of burst-lengths and delays at the two receivers.\n  We establish that the operation of the system can be divided into two main regimes: a low-delay regime and a large-delay regime. We ful"},"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":"1303.4370","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-03-18T19:36:31Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"078f7ef21ca114393327bdc2cb326ed53b0cfc029b9100ee20db571cc6bb4887","abstract_canon_sha256":"33a35dc121be0ad4ff985891ad024516a4f70a93562314417bc0fcc80216f519"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:57:56.479074Z","signature_b64":"nhHOnvu5YWJHZjDHZld+7WK4bdacezJLlBrbsaSITiEg4E5zQCHS7OFRFGGskWUfyaDOa0bm8ah0Bdbz5lVFAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d1ca04ebc54e5fda63eec10b7769c1b0a8b9eb8f2ad242cdddab1f17e794984e","last_reissued_at":"2026-05-18T00:57:56.478525Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:57:56.478525Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Streaming-Codes for Multicast over Burst Erasure Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ahmed Badr, Ashish Khisti, Devin Lui","submitted_at":"2013-03-18T19:36:31Z","abstract_excerpt":"We study the capacity limits of real-time streaming over burst-erasure channels. A stream of source packets must be sequentially encoded and the resulting channel packets must be transmitted over a two-receiver burst-erasure broadcast channel. The source packets must be sequentially reconstructed at each receiver with a possibly different reconstruction deadline. We study the associated capacity as a function of burst-lengths and delays at the two receivers.\n  We establish that the operation of the system can be divided into two main regimes: a low-delay regime and a large-delay regime. We ful"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.4370","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":"1303.4370","created_at":"2026-05-18T00:57:56.478641+00:00"},{"alias_kind":"arxiv_version","alias_value":"1303.4370v1","created_at":"2026-05-18T00:57:56.478641+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.4370","created_at":"2026-05-18T00:57:56.478641+00:00"},{"alias_kind":"pith_short_12","alias_value":"2HFAJ26FJZP5","created_at":"2026-05-18T12:27:30.460161+00:00"},{"alias_kind":"pith_short_16","alias_value":"2HFAJ26FJZP5UY7O","created_at":"2026-05-18T12:27:30.460161+00:00"},{"alias_kind":"pith_short_8","alias_value":"2HFAJ26F","created_at":"2026-05-18T12:27:30.460161+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/2HFAJ26FJZP5UY7OYEFXO2OBWC","json":"https://pith.science/pith/2HFAJ26FJZP5UY7OYEFXO2OBWC.json","graph_json":"https://pith.science/api/pith-number/2HFAJ26FJZP5UY7OYEFXO2OBWC/graph.json","events_json":"https://pith.science/api/pith-number/2HFAJ26FJZP5UY7OYEFXO2OBWC/events.json","paper":"https://pith.science/paper/2HFAJ26F"},"agent_actions":{"view_html":"https://pith.science/pith/2HFAJ26FJZP5UY7OYEFXO2OBWC","download_json":"https://pith.science/pith/2HFAJ26FJZP5UY7OYEFXO2OBWC.json","view_paper":"https://pith.science/paper/2HFAJ26F","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1303.4370&json=true","fetch_graph":"https://pith.science/api/pith-number/2HFAJ26FJZP5UY7OYEFXO2OBWC/graph.json","fetch_events":"https://pith.science/api/pith-number/2HFAJ26FJZP5UY7OYEFXO2OBWC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2HFAJ26FJZP5UY7OYEFXO2OBWC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2HFAJ26FJZP5UY7OYEFXO2OBWC/action/storage_attestation","attest_author":"https://pith.science/pith/2HFAJ26FJZP5UY7OYEFXO2OBWC/action/author_attestation","sign_citation":"https://pith.science/pith/2HFAJ26FJZP5UY7OYEFXO2OBWC/action/citation_signature","submit_replication":"https://pith.science/pith/2HFAJ26FJZP5UY7OYEFXO2OBWC/action/replication_record"}},"created_at":"2026-05-18T00:57:56.478641+00:00","updated_at":"2026-05-18T00:57:56.478641+00:00"}