{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:Z6BNUUDATBN7EJLXRWMIIJNOT4","short_pith_number":"pith:Z6BNUUDA","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"},"canonical_sha256":"cf82da5060985bf225778d988425ae9f3a25a17788515a071db6354f7adf5a1c","source":{"kind":"arxiv","id":"1308.3827","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.3827","created_at":"2026-05-18T00:58:16Z"},{"alias_kind":"arxiv_version","alias_value":"1308.3827v1","created_at":"2026-05-18T00:58:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.3827","created_at":"2026-05-18T00:58:16Z"},{"alias_kind":"pith_short_12","alias_value":"Z6BNUUDATBN7","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_16","alias_value":"Z6BNUUDATBN7EJLX","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_8","alias_value":"Z6BNUUDA","created_at":"2026-05-18T12:28:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:Z6BNUUDATBN7EJLXRWMIIJNOT4","target":"record","payload":{"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"},"canonical_sha256":"cf82da5060985bf225778d988425ae9f3a25a17788515a071db6354f7adf5a1c","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"},"source_kind":"arxiv","source_id":"1308.3827","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:58:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EN+jQ2FUoVjCbZ48MJCiVrCVFtRdTVuVIAw1+GjoG64MH5Hhz+06uy2y8gTacdgzGlMsEZvOkx9zQf71E1nTBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T20:53:16.471688Z"},"content_sha256":"4f5d80e95e244a2d306bec6845f8bea116aa2297c4b8c2e2d6ee4efba5bab77b","schema_version":"1.0","event_id":"sha256:4f5d80e95e244a2d306bec6845f8bea116aa2297c4b8c2e2d6ee4efba5bab77b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:Z6BNUUDATBN7EJLXRWMIIJNOT4","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:58:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HYVS2eKo8eqIgI4Ru19eo6eiJ+DhXy6FVX3cFy+1cIFk0gKRqHr0DFf2k1DRNKKRw0VKBsQ/kiVeiLMtfMGvBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T20:53:16.472032Z"},"content_sha256":"784ba843123df0d1137df245399c387464107d5518cd5ea4fc7c7d19497140ce","schema_version":"1.0","event_id":"sha256:784ba843123df0d1137df245399c387464107d5518cd5ea4fc7c7d19497140ce"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Z6BNUUDATBN7EJLXRWMIIJNOT4/bundle.json","state_url":"https://pith.science/pith/Z6BNUUDATBN7EJLXRWMIIJNOT4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Z6BNUUDATBN7EJLXRWMIIJNOT4/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-30T20:53:16Z","links":{"resolver":"https://pith.science/pith/Z6BNUUDATBN7EJLXRWMIIJNOT4","bundle":"https://pith.science/pith/Z6BNUUDATBN7EJLXRWMIIJNOT4/bundle.json","state":"https://pith.science/pith/Z6BNUUDATBN7EJLXRWMIIJNOT4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Z6BNUUDATBN7EJLXRWMIIJNOT4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:Z6BNUUDATBN7EJLXRWMIIJNOT4","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"7069e114c2064cb606b03788471e4ed8b71e6dc02906ac0b086fa0765d6fc77a","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-08-18T03:18:44Z","title_canon_sha256":"af230e01614259d97a5e0ed7a32b67100c598d6a010d65cbb917bb3f16def7ee"},"schema_version":"1.0","source":{"id":"1308.3827","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.3827","created_at":"2026-05-18T00:58:16Z"},{"alias_kind":"arxiv_version","alias_value":"1308.3827v1","created_at":"2026-05-18T00:58:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.3827","created_at":"2026-05-18T00:58:16Z"},{"alias_kind":"pith_short_12","alias_value":"Z6BNUUDATBN7","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_16","alias_value":"Z6BNUUDATBN7EJLX","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_8","alias_value":"Z6BNUUDA","created_at":"2026-05-18T12:28:09Z"}],"graph_snapshots":[{"event_id":"sha256:784ba843123df0d1137df245399c387464107d5518cd5ea4fc7c7d19497140ce","target":"graph","created_at":"2026-05-18T00:58:16Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Ahmed Badr, Ashish Khisti, John Apostolopoulos, Pratik Patil, Wai-Tian Tan","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-08-18T03:18:44Z","title":"Layered Constructions for Low-Delay Streaming Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.3827","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:4f5d80e95e244a2d306bec6845f8bea116aa2297c4b8c2e2d6ee4efba5bab77b","target":"record","created_at":"2026-05-18T00:58:16Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"7069e114c2064cb606b03788471e4ed8b71e6dc02906ac0b086fa0765d6fc77a","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-08-18T03:18:44Z","title_canon_sha256":"af230e01614259d97a5e0ed7a32b67100c598d6a010d65cbb917bb3f16def7ee"},"schema_version":"1.0","source":{"id":"1308.3827","kind":"arxiv","version":1}},"canonical_sha256":"cf82da5060985bf225778d988425ae9f3a25a17788515a071db6354f7adf5a1c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cf82da5060985bf225778d988425ae9f3a25a17788515a071db6354f7adf5a1c","first_computed_at":"2026-05-18T00:58:16.927499Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:16.927499Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tX6kYfnHv8yBkiWlKJt6nhXC+oNmHxC2069fn5pdI9wQQijrz1Rr4EykVErAhFPE1v2gCSl5IwFoH54S0loIAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:16.928198Z","signed_message":"canonical_sha256_bytes"},"source_id":"1308.3827","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4f5d80e95e244a2d306bec6845f8bea116aa2297c4b8c2e2d6ee4efba5bab77b","sha256:784ba843123df0d1137df245399c387464107d5518cd5ea4fc7c7d19497140ce"],"state_sha256":"01f70fd1d8aa9860d9df356b4f949d64934d63ffc3e47ba757778f4813675500"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5TaNifIGF0Mont99rZ117W7VN/mAjt6RjnQaLxlLFm4f8nX4EgunKPZ9xE0t0tREigBFQ3z+SKVximbBEgCXBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T20:53:16.474072Z","bundle_sha256":"1a6cf609f523e522173e2838b5eec83b99f450f75465d19247012f73b49b14e0"}}