{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:EUTWRVLRNZR4GPBXI2I4WQ3KEC","short_pith_number":"pith:EUTWRVLR","schema_version":"1.0","canonical_sha256":"252768d5716e63c33c374691cb436a20befa484411785b9d857989d0c405ea06","source":{"kind":"arxiv","id":"2204.06780","version":1},"attestation_state":"computed","paper":{"title":"A Feedback Capacity-Achieving Coding Scheme for the $(d,\\infty)$-RLL Input-Constrained Binary Erasure Channel","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Navin Kashyap, V. Arvind Rameshwar","submitted_at":"2022-04-14T06:33:03Z","abstract_excerpt":"This paper considers the memoryless input-constrained binary erasure channel (BEC). The channel input constraint is the $(d,\\infty)$-runlength limited (RLL) constraint, which mandates that any pair of successive $1$s in the input sequence be separated by at least $d$ $0$s. We consider a scenario where there is causal, noiseless feedback from the decoder. We demonstrate a simple, labelling-based, zero-error feedback coding scheme, which we prove to be feedback capacity-achieving, and, as a by-product, obtain an explicit characterization of the feedback capacity. Our proof is based on showing th"},"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":"2204.06780","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2022-04-14T06:33:03Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"5b47369e42c0f45fb46116dee886e9ba34f4f3b079f824f3f73ff7de3b4bd9d2","abstract_canon_sha256":"424c07a05eb7cf3c76d6cf9e7e179802a1231cca16857acbad8ea7baeec876fb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:14:46.037770Z","signature_b64":"P6+aKbkOd8jgxAJUvQ1XCtYmjkxWUnq1PZaZ1KMjXli/c0xCCPdMiRsBtfbgSBcYem38AJgNQ1vf63sKxoYTAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"252768d5716e63c33c374691cb436a20befa484411785b9d857989d0c405ea06","last_reissued_at":"2026-07-05T04:14:46.037397Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:14:46.037397Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Feedback Capacity-Achieving Coding Scheme for the $(d,\\infty)$-RLL Input-Constrained Binary Erasure Channel","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Navin Kashyap, V. Arvind Rameshwar","submitted_at":"2022-04-14T06:33:03Z","abstract_excerpt":"This paper considers the memoryless input-constrained binary erasure channel (BEC). The channel input constraint is the $(d,\\infty)$-runlength limited (RLL) constraint, which mandates that any pair of successive $1$s in the input sequence be separated by at least $d$ $0$s. We consider a scenario where there is causal, noiseless feedback from the decoder. We demonstrate a simple, labelling-based, zero-error feedback coding scheme, which we prove to be feedback capacity-achieving, and, as a by-product, obtain an explicit characterization of the feedback capacity. Our proof is based on showing th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2204.06780","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2204.06780/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2204.06780","created_at":"2026-07-05T04:14:46.037460+00:00"},{"alias_kind":"arxiv_version","alias_value":"2204.06780v1","created_at":"2026-07-05T04:14:46.037460+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2204.06780","created_at":"2026-07-05T04:14:46.037460+00:00"},{"alias_kind":"pith_short_12","alias_value":"EUTWRVLRNZR4","created_at":"2026-07-05T04:14:46.037460+00:00"},{"alias_kind":"pith_short_16","alias_value":"EUTWRVLRNZR4GPBX","created_at":"2026-07-05T04:14:46.037460+00:00"},{"alias_kind":"pith_short_8","alias_value":"EUTWRVLR","created_at":"2026-07-05T04:14:46.037460+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/EUTWRVLRNZR4GPBXI2I4WQ3KEC","json":"https://pith.science/pith/EUTWRVLRNZR4GPBXI2I4WQ3KEC.json","graph_json":"https://pith.science/api/pith-number/EUTWRVLRNZR4GPBXI2I4WQ3KEC/graph.json","events_json":"https://pith.science/api/pith-number/EUTWRVLRNZR4GPBXI2I4WQ3KEC/events.json","paper":"https://pith.science/paper/EUTWRVLR"},"agent_actions":{"view_html":"https://pith.science/pith/EUTWRVLRNZR4GPBXI2I4WQ3KEC","download_json":"https://pith.science/pith/EUTWRVLRNZR4GPBXI2I4WQ3KEC.json","view_paper":"https://pith.science/paper/EUTWRVLR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2204.06780&json=true","fetch_graph":"https://pith.science/api/pith-number/EUTWRVLRNZR4GPBXI2I4WQ3KEC/graph.json","fetch_events":"https://pith.science/api/pith-number/EUTWRVLRNZR4GPBXI2I4WQ3KEC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EUTWRVLRNZR4GPBXI2I4WQ3KEC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EUTWRVLRNZR4GPBXI2I4WQ3KEC/action/storage_attestation","attest_author":"https://pith.science/pith/EUTWRVLRNZR4GPBXI2I4WQ3KEC/action/author_attestation","sign_citation":"https://pith.science/pith/EUTWRVLRNZR4GPBXI2I4WQ3KEC/action/citation_signature","submit_replication":"https://pith.science/pith/EUTWRVLRNZR4GPBXI2I4WQ3KEC/action/replication_record"}},"created_at":"2026-07-05T04:14:46.037460+00:00","updated_at":"2026-07-05T04:14:46.037460+00:00"}