{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:Z6V5BNBGVQ4Y75F7TUSWNSMC43","short_pith_number":"pith:Z6V5BNBG","canonical_record":{"source":{"id":"1705.01596","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-05-03T19:49:33Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"8e0b55c1c47d5df859b730a667ca8119c3d436d60d8a173fb1f881f0b0066612","abstract_canon_sha256":"b8313b9cf9ceaa5deff5a171063ac7ffb375e267a022b31e4ee7fbc4d39b6922"},"schema_version":"1.0"},"canonical_sha256":"cfabd0b426ac398ff4bf9d2566c982e6c6e87f4521c0e9c1d723ce49ddc281d7","source":{"kind":"arxiv","id":"1705.01596","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.01596","created_at":"2026-05-18T00:45:04Z"},{"alias_kind":"arxiv_version","alias_value":"1705.01596v1","created_at":"2026-05-18T00:45:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.01596","created_at":"2026-05-18T00:45:04Z"},{"alias_kind":"pith_short_12","alias_value":"Z6V5BNBGVQ4Y","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"Z6V5BNBGVQ4Y75F7","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"Z6V5BNBG","created_at":"2026-05-18T12:31:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:Z6V5BNBGVQ4Y75F7TUSWNSMC43","target":"record","payload":{"canonical_record":{"source":{"id":"1705.01596","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-05-03T19:49:33Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"8e0b55c1c47d5df859b730a667ca8119c3d436d60d8a173fb1f881f0b0066612","abstract_canon_sha256":"b8313b9cf9ceaa5deff5a171063ac7ffb375e267a022b31e4ee7fbc4d39b6922"},"schema_version":"1.0"},"canonical_sha256":"cfabd0b426ac398ff4bf9d2566c982e6c6e87f4521c0e9c1d723ce49ddc281d7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:45:04.575476Z","signature_b64":"vRTgSUyasKOCXUZ+lIhAU2FD/qxhg3X8BgtnvqqVeGBF3LSoychdQMKChgMnlviXkSMFvEoQGB2EqWmj7+6fBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cfabd0b426ac398ff4bf9d2566c982e6c6e87f4521c0e9c1d723ce49ddc281d7","last_reissued_at":"2026-05-18T00:45:04.575104Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:45:04.575104Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.01596","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:45:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iAv0o9NxgdjwT17dEmesg5Kpq9VvGW3wuBDquzxuvgK73NB/cp82V3C/43agdggePTL8G47lcGkw0BbJowzlBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T02:03:37.096781Z"},"content_sha256":"f4d9f8ddfb1e197217482ff6c200a7593d0d7f60bc167de0bb207148315d7c41","schema_version":"1.0","event_id":"sha256:f4d9f8ddfb1e197217482ff6c200a7593d0d7f60bc167de0bb207148315d7c41"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:Z6V5BNBGVQ4Y75F7TUSWNSMC43","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Capacity of Burst Noise-Erasure Channels With and Without Feedback and Input Cost","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Fady Alajaji, Lin Song, Tam\\'as Linder","submitted_at":"2017-05-03T19:49:33Z","abstract_excerpt":"A class of burst noise-erasure channels which incorporate both errors and erasures during transmission is studied. The channel, whose output is explicitly expressed in terms of its input and a stationary ergodic noise-erasure process, is shown to have a so-called \"quasi-symmetry\" property under certain invertibility conditions. As a result, it is proved that a uniformly distributed input process maximizes the channel's block mutual information, resulting in a closed-form formula for its non-feedback capacity in terms of the noise-erasure entropy rate and the entropy rate of an auxiliary erasur"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.01596","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:45:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rKPZDSkh/wtFZ/JcX4Ioqb2UZkSSqzurnkIfIhBoCOm5ifrZDtOJrNj3R6XNLcw7T3qIp6zMlXV3+49eHIc/Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T02:03:37.097162Z"},"content_sha256":"1092ce35d9163389cd73f42571e02fd346c9f5370124ac753e78f48dca930c26","schema_version":"1.0","event_id":"sha256:1092ce35d9163389cd73f42571e02fd346c9f5370124ac753e78f48dca930c26"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Z6V5BNBGVQ4Y75F7TUSWNSMC43/bundle.json","state_url":"https://pith.science/pith/Z6V5BNBGVQ4Y75F7TUSWNSMC43/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Z6V5BNBGVQ4Y75F7TUSWNSMC43/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-06-12T02:03:37Z","links":{"resolver":"https://pith.science/pith/Z6V5BNBGVQ4Y75F7TUSWNSMC43","bundle":"https://pith.science/pith/Z6V5BNBGVQ4Y75F7TUSWNSMC43/bundle.json","state":"https://pith.science/pith/Z6V5BNBGVQ4Y75F7TUSWNSMC43/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Z6V5BNBGVQ4Y75F7TUSWNSMC43/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:Z6V5BNBGVQ4Y75F7TUSWNSMC43","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":"b8313b9cf9ceaa5deff5a171063ac7ffb375e267a022b31e4ee7fbc4d39b6922","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-05-03T19:49:33Z","title_canon_sha256":"8e0b55c1c47d5df859b730a667ca8119c3d436d60d8a173fb1f881f0b0066612"},"schema_version":"1.0","source":{"id":"1705.01596","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.01596","created_at":"2026-05-18T00:45:04Z"},{"alias_kind":"arxiv_version","alias_value":"1705.01596v1","created_at":"2026-05-18T00:45:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.01596","created_at":"2026-05-18T00:45:04Z"},{"alias_kind":"pith_short_12","alias_value":"Z6V5BNBGVQ4Y","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"Z6V5BNBGVQ4Y75F7","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"Z6V5BNBG","created_at":"2026-05-18T12:31:59Z"}],"graph_snapshots":[{"event_id":"sha256:1092ce35d9163389cd73f42571e02fd346c9f5370124ac753e78f48dca930c26","target":"graph","created_at":"2026-05-18T00:45:04Z","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":"A class of burst noise-erasure channels which incorporate both errors and erasures during transmission is studied. The channel, whose output is explicitly expressed in terms of its input and a stationary ergodic noise-erasure process, is shown to have a so-called \"quasi-symmetry\" property under certain invertibility conditions. As a result, it is proved that a uniformly distributed input process maximizes the channel's block mutual information, resulting in a closed-form formula for its non-feedback capacity in terms of the noise-erasure entropy rate and the entropy rate of an auxiliary erasur","authors_text":"Fady Alajaji, Lin Song, Tam\\'as Linder","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-05-03T19:49:33Z","title":"Capacity of Burst Noise-Erasure Channels With and Without Feedback and Input Cost"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.01596","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:f4d9f8ddfb1e197217482ff6c200a7593d0d7f60bc167de0bb207148315d7c41","target":"record","created_at":"2026-05-18T00:45:04Z","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":"b8313b9cf9ceaa5deff5a171063ac7ffb375e267a022b31e4ee7fbc4d39b6922","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-05-03T19:49:33Z","title_canon_sha256":"8e0b55c1c47d5df859b730a667ca8119c3d436d60d8a173fb1f881f0b0066612"},"schema_version":"1.0","source":{"id":"1705.01596","kind":"arxiv","version":1}},"canonical_sha256":"cfabd0b426ac398ff4bf9d2566c982e6c6e87f4521c0e9c1d723ce49ddc281d7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cfabd0b426ac398ff4bf9d2566c982e6c6e87f4521c0e9c1d723ce49ddc281d7","first_computed_at":"2026-05-18T00:45:04.575104Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:45:04.575104Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vRTgSUyasKOCXUZ+lIhAU2FD/qxhg3X8BgtnvqqVeGBF3LSoychdQMKChgMnlviXkSMFvEoQGB2EqWmj7+6fBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:45:04.575476Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.01596","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f4d9f8ddfb1e197217482ff6c200a7593d0d7f60bc167de0bb207148315d7c41","sha256:1092ce35d9163389cd73f42571e02fd346c9f5370124ac753e78f48dca930c26"],"state_sha256":"a2b909fb782431ae746514580a0174851561829f192ff91ce96071285c73728a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PNrc0O4D5gOdApfuBrxoSLPBc8wQ8lFq7ZNz7GbDUgpM95pclCsNo9No/sZcfdG6E6oIdGKo8iP4Dwj3X4jtCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-12T02:03:37.104388Z","bundle_sha256":"b689ef68b384d827e2e5f3d3eadb3ea646ad8bfec8733f171aa2863f5e16a02a"}}