{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:IEE6RD34PVT6ZXMSKIUI2GDZAM","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":"9ee9c1004563db21b9be9e15e4135cecd7fda1e5bfcef2cf6f3bbdfdd98483c3","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-03-11T14:56:53Z","title_canon_sha256":"aa8e9f9f4d67c603547c6beb135e6bad4d1b50e9711def5039a935a23dc259d5"},"schema_version":"1.0","source":{"id":"1503.03359","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.03359","created_at":"2026-05-18T02:25:03Z"},{"alias_kind":"arxiv_version","alias_value":"1503.03359v1","created_at":"2026-05-18T02:25:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.03359","created_at":"2026-05-18T02:25:03Z"},{"alias_kind":"pith_short_12","alias_value":"IEE6RD34PVT6","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"IEE6RD34PVT6ZXMS","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"IEE6RD34","created_at":"2026-05-18T12:29:25Z"}],"graph_snapshots":[{"event_id":"sha256:a2e37cb697e794d7dd5c79f16b43360b6a974797704be2b1f748f6163964492c","target":"graph","created_at":"2026-05-18T02:25:03Z","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":"The input-constrained erasure channel with feedback is considered, where the binary input sequence contains no consecutive ones, i.e., it satisfies the $(1,\\infty)$-RLL constraint. We derive the capacity for this setting, which can be expressed as $C_{\\epsilon}=\\max_{0 \\leq p \\leq \\frac{1}{2}}\\frac{H_{b}(p)}{p+\\frac{1}{1-\\epsilon}}$, where $\\epsilon$ is the erasure probability and $ H_{b}(\\cdot)$ is the binary entropy function. Moreover, we prove that a-priori knowledge of the erasure at the encoder does not increase the feedback capacity. The feedback capacity was calculated using an equivale","authors_text":"Haim H. Permuter, Navin Kashyap, Oron Sabag","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-03-11T14:56:53Z","title":"The Feedback Capacity of the $(1,\\infty)$-RLL Input-Constrained Erasure Channel"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.03359","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:15831e41eb497dd1c96262d73f6f1bdb3702b4a010617b7d7226ff8dfe9769f3","target":"record","created_at":"2026-05-18T02:25:03Z","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":"9ee9c1004563db21b9be9e15e4135cecd7fda1e5bfcef2cf6f3bbdfdd98483c3","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-03-11T14:56:53Z","title_canon_sha256":"aa8e9f9f4d67c603547c6beb135e6bad4d1b50e9711def5039a935a23dc259d5"},"schema_version":"1.0","source":{"id":"1503.03359","kind":"arxiv","version":1}},"canonical_sha256":"4109e88f7c7d67ecdd9252288d18790304491ac7f71b2cd4f816139753bc96d9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4109e88f7c7d67ecdd9252288d18790304491ac7f71b2cd4f816139753bc96d9","first_computed_at":"2026-05-18T02:25:03.783936Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:25:03.783936Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yPCKwSt4w989XpsZEBqGQXUyxdekUxwt/Ryww528XYte46RwZ2sjWkw9V0Vvw5pls7LgdUa7tIbQnyqN4EgoAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:25:03.784276Z","signed_message":"canonical_sha256_bytes"},"source_id":"1503.03359","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:15831e41eb497dd1c96262d73f6f1bdb3702b4a010617b7d7226ff8dfe9769f3","sha256:a2e37cb697e794d7dd5c79f16b43360b6a974797704be2b1f748f6163964492c"],"state_sha256":"2b89c036d51f4f2548a51a4c007be31d03c8ee77eaa9eeb18f01e08a472ef962"}