{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:A5RSBM7LBC3FWDTWCCM5ND257E","short_pith_number":"pith:A5RSBM7L","schema_version":"1.0","canonical_sha256":"076320b3eb08b65b0e761099d68f5df92375404bd2bf9360d681e2d20a963356","source":{"kind":"arxiv","id":"1712.02690","version":1},"attestation_state":"computed","paper":{"title":"Feedback Capacity and Coding for the $(0,k)$-RLL Input-Constrained BEC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Haim H. Permuter, Ori Peled, Oron Sabag","submitted_at":"2017-12-07T16:11:06Z","abstract_excerpt":"The input-constrained binary erasure channel (BEC) with strictly causal feedback is studied. The channel input sequence must satisfy the $(0,k)$-runlength limited (RLL) constraint, i.e., no more than $k$ consecutive `$0$'s are allowed. The feedback capacity of this channel is derived for all $k\\geq 1$, and is given by $$C^\\mathrm{fb}_{(0,k)}(\\varepsilon) = \\max\\frac{\\overline{\\varepsilon}H_2(\\delta_0)+\\sum_{i=1}^{k-1}\\left(\\overline{\\varepsilon}^{i+1}H_2(\\delta_i)\\prod_{m=0}^{i-1}\\delta_m\\right)}{1+\\sum_{i=0}^{k-1}\\left(\\overline{\\varepsilon}^{i+1}\n  \\prod_{m=0}^{i}\\delta_m\\right)},$$ where $\\"},"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":"1712.02690","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-12-07T16:11:06Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"d510feb62bbe1e8f8adb58f09aea537b7033ae5a8f8b60413297b12d4b132042","abstract_canon_sha256":"5219559794691dbad5dc1829799bb124a60a87fe70cb80ac73e7f52af63104dd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:28:33.157268Z","signature_b64":"Jy3ZKFJ+F2hZg4h1/y3kCNs2OgQg7nV1V9uRKyjXrr8rOzT1RM94clS/g0nLC76XNkUb8eUKqpCscPUHwyKiBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"076320b3eb08b65b0e761099d68f5df92375404bd2bf9360d681e2d20a963356","last_reissued_at":"2026-05-18T00:28:33.156509Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:28:33.156509Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Feedback Capacity and Coding for the $(0,k)$-RLL Input-Constrained BEC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Haim H. Permuter, Ori Peled, Oron Sabag","submitted_at":"2017-12-07T16:11:06Z","abstract_excerpt":"The input-constrained binary erasure channel (BEC) with strictly causal feedback is studied. The channel input sequence must satisfy the $(0,k)$-runlength limited (RLL) constraint, i.e., no more than $k$ consecutive `$0$'s are allowed. The feedback capacity of this channel is derived for all $k\\geq 1$, and is given by $$C^\\mathrm{fb}_{(0,k)}(\\varepsilon) = \\max\\frac{\\overline{\\varepsilon}H_2(\\delta_0)+\\sum_{i=1}^{k-1}\\left(\\overline{\\varepsilon}^{i+1}H_2(\\delta_i)\\prod_{m=0}^{i-1}\\delta_m\\right)}{1+\\sum_{i=0}^{k-1}\\left(\\overline{\\varepsilon}^{i+1}\n  \\prod_{m=0}^{i}\\delta_m\\right)},$$ where $\\"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.02690","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":"1712.02690","created_at":"2026-05-18T00:28:33.156646+00:00"},{"alias_kind":"arxiv_version","alias_value":"1712.02690v1","created_at":"2026-05-18T00:28:33.156646+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.02690","created_at":"2026-05-18T00:28:33.156646+00:00"},{"alias_kind":"pith_short_12","alias_value":"A5RSBM7LBC3F","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_16","alias_value":"A5RSBM7LBC3FWDTW","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_8","alias_value":"A5RSBM7L","created_at":"2026-05-18T12:31:05.417338+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/A5RSBM7LBC3FWDTWCCM5ND257E","json":"https://pith.science/pith/A5RSBM7LBC3FWDTWCCM5ND257E.json","graph_json":"https://pith.science/api/pith-number/A5RSBM7LBC3FWDTWCCM5ND257E/graph.json","events_json":"https://pith.science/api/pith-number/A5RSBM7LBC3FWDTWCCM5ND257E/events.json","paper":"https://pith.science/paper/A5RSBM7L"},"agent_actions":{"view_html":"https://pith.science/pith/A5RSBM7LBC3FWDTWCCM5ND257E","download_json":"https://pith.science/pith/A5RSBM7LBC3FWDTWCCM5ND257E.json","view_paper":"https://pith.science/paper/A5RSBM7L","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1712.02690&json=true","fetch_graph":"https://pith.science/api/pith-number/A5RSBM7LBC3FWDTWCCM5ND257E/graph.json","fetch_events":"https://pith.science/api/pith-number/A5RSBM7LBC3FWDTWCCM5ND257E/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/A5RSBM7LBC3FWDTWCCM5ND257E/action/timestamp_anchor","attest_storage":"https://pith.science/pith/A5RSBM7LBC3FWDTWCCM5ND257E/action/storage_attestation","attest_author":"https://pith.science/pith/A5RSBM7LBC3FWDTWCCM5ND257E/action/author_attestation","sign_citation":"https://pith.science/pith/A5RSBM7LBC3FWDTWCCM5ND257E/action/citation_signature","submit_replication":"https://pith.science/pith/A5RSBM7LBC3FWDTWCCM5ND257E/action/replication_record"}},"created_at":"2026-05-18T00:28:33.156646+00:00","updated_at":"2026-05-18T00:28:33.156646+00:00"}