{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:NK7AOSLICO4D6LOZ6CVHO6L5VT","short_pith_number":"pith:NK7AOSLI","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"},"canonical_sha256":"6abe07496813b83f2dd9f0aa77797dacf9bbc6709d3e7ef1e5e3b75162ba29b3","source":{"kind":"arxiv","id":"1305.3596","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.3596","created_at":"2026-05-18T03:25:35Z"},{"alias_kind":"arxiv_version","alias_value":"1305.3596v1","created_at":"2026-05-18T03:25:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.3596","created_at":"2026-05-18T03:25:35Z"},{"alias_kind":"pith_short_12","alias_value":"NK7AOSLICO4D","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"NK7AOSLICO4D6LOZ","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"NK7AOSLI","created_at":"2026-05-18T12:27:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:NK7AOSLICO4D6LOZ6CVHO6L5VT","target":"record","payload":{"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"},"canonical_sha256":"6abe07496813b83f2dd9f0aa77797dacf9bbc6709d3e7ef1e5e3b75162ba29b3","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"},"source_kind":"arxiv","source_id":"1305.3596","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-18T03:25:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yt3s8axrvQXlLwGYGxRxB0Frkym3QCN+d4GkMhHGbV+lcXcati6yBG1Wq6KmUB9o49SDsD6I/Np8ICgRjC+oAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T11:20:53.802291Z"},"content_sha256":"45cba4a42d7bf45005eef46f9f9b7380f4528f473be1cfd85ec9913b482a04db","schema_version":"1.0","event_id":"sha256:45cba4a42d7bf45005eef46f9f9b7380f4528f473be1cfd85ec9913b482a04db"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:NK7AOSLICO4D6LOZ6CVHO6L5VT","target":"graph","payload":{"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"},"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-18T03:25:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"e8NoeV1/1WnTUbN6xp8/aXnMBFc594pPisAWmN9UYCjpJERiAeIQMnAjKY0uVv4ZQDLMPaYfSg8ohOuZoKsKCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T11:20:53.802669Z"},"content_sha256":"0c1bdf789d73ec4b96e6d57ebf21eca6afc942a4b6785fa54c5d0e52db69e4c8","schema_version":"1.0","event_id":"sha256:0c1bdf789d73ec4b96e6d57ebf21eca6afc942a4b6785fa54c5d0e52db69e4c8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NK7AOSLICO4D6LOZ6CVHO6L5VT/bundle.json","state_url":"https://pith.science/pith/NK7AOSLICO4D6LOZ6CVHO6L5VT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NK7AOSLICO4D6LOZ6CVHO6L5VT/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-31T11:20:53Z","links":{"resolver":"https://pith.science/pith/NK7AOSLICO4D6LOZ6CVHO6L5VT","bundle":"https://pith.science/pith/NK7AOSLICO4D6LOZ6CVHO6L5VT/bundle.json","state":"https://pith.science/pith/NK7AOSLICO4D6LOZ6CVHO6L5VT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NK7AOSLICO4D6LOZ6CVHO6L5VT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:NK7AOSLICO4D6LOZ6CVHO6L5VT","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":"a0d23bab2dd236b3a4bc22489a83ec96fac2799b64adb680551aed60bd26736d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-05-15T19:44:17Z","title_canon_sha256":"c2bbb03a77005d2a173dbc0b4c3aafd4159694948957c4899f3f2d932ffd1411"},"schema_version":"1.0","source":{"id":"1305.3596","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.3596","created_at":"2026-05-18T03:25:35Z"},{"alias_kind":"arxiv_version","alias_value":"1305.3596v1","created_at":"2026-05-18T03:25:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.3596","created_at":"2026-05-18T03:25:35Z"},{"alias_kind":"pith_short_12","alias_value":"NK7AOSLICO4D","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"NK7AOSLICO4D6LOZ","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"NK7AOSLI","created_at":"2026-05-18T12:27:52Z"}],"graph_snapshots":[{"event_id":"sha256:0c1bdf789d73ec4b96e6d57ebf21eca6afc942a4b6785fa54c5d0e52db69e4c8","target":"graph","created_at":"2026-05-18T03:25:35Z","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 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","authors_text":"Ahmed Badr, Ashish Khisti, John Apostolopoulos, Wai-Tian Tan","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-05-15T19:44:17Z","title":"Robust Streaming Erasure Codes based on Deterministic Channel Approximations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.3596","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:45cba4a42d7bf45005eef46f9f9b7380f4528f473be1cfd85ec9913b482a04db","target":"record","created_at":"2026-05-18T03:25:35Z","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":"a0d23bab2dd236b3a4bc22489a83ec96fac2799b64adb680551aed60bd26736d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-05-15T19:44:17Z","title_canon_sha256":"c2bbb03a77005d2a173dbc0b4c3aafd4159694948957c4899f3f2d932ffd1411"},"schema_version":"1.0","source":{"id":"1305.3596","kind":"arxiv","version":1}},"canonical_sha256":"6abe07496813b83f2dd9f0aa77797dacf9bbc6709d3e7ef1e5e3b75162ba29b3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6abe07496813b83f2dd9f0aa77797dacf9bbc6709d3e7ef1e5e3b75162ba29b3","first_computed_at":"2026-05-18T03:25:35.485053Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:25:35.485053Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WvSXYfizOHLf8lsAfG6WfIvWc3uqfeVb8sjd81lx/mBYXzk0muvX3ixQuBTPR1+jwuy2txiRANnaP6fJGKCjDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:25:35.485607Z","signed_message":"canonical_sha256_bytes"},"source_id":"1305.3596","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:45cba4a42d7bf45005eef46f9f9b7380f4528f473be1cfd85ec9913b482a04db","sha256:0c1bdf789d73ec4b96e6d57ebf21eca6afc942a4b6785fa54c5d0e52db69e4c8"],"state_sha256":"47116ca974f9673470e164b6e04697fa7afa18150e90ae5511a5964fa35c01e4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YuSskpwBrxoQK8HvrEn5NE5QMy/79eLv5/6kL36pNuGeMo2kcLzcmQiYzvcaqjMqowJdI5DI69J/kZfxKc1yBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T11:20:53.804959Z","bundle_sha256":"64b573f33cad41c60c83356b8ff6792caa927a1a4345cdb6d30dc39d1e34ddb8"}}