{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:WJZFTVOCRYJEYQB7SILP2RMBHM","short_pith_number":"pith:WJZFTVOC","schema_version":"1.0","canonical_sha256":"b27259d5c28e124c403f9216fd45813b0d3f43f46a5c8cd23320096a8d01f0c8","source":{"kind":"arxiv","id":"2101.08638","version":3},"attestation_state":"computed","paper":{"title":"Bounds on the Feedback Capacity of the $(d,\\infty)$-RLL Input-Constrained Binary Erasure Channel","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Navin Kashyap, V. Arvind Rameshwar","submitted_at":"2021-01-21T14:33:58Z","abstract_excerpt":"The paper considers the input-constrained binary erasure channel (BEC) with causal, noiseless feedback. The channel input sequence respects the $(d,\\infty)$-runlength limited (RLL) constraint, i.e., any pair of successive $1$s must be separated by at least $d$ $0$s. We derive upper and lower bounds on the feedback capacity of this channel, for all $d\\geq 1$, given by: $\\max\\limits_{\\delta \\in [0,\\frac{1}{d+1}]}R(\\delta) \\leq C^{\\text{fb}}_{(d\\infty)}(\\epsilon) \\leq \\max\\limits_{\\delta \\in [0,\\frac{1}{1+d\\epsilon}]}R(\\delta)$, where the function $R(\\delta) = \\frac{h_b(\\delta)}{d\\delta + \\frac{1"},"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":"2101.08638","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2021-01-21T14:33:58Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"21fe74f0e448cfb39e7976eacd35cd65fdda22bacbbbf07c820063d41aaaf65f","abstract_canon_sha256":"e52367411b45870548fd9ea4eb706fbda448e3cae974b4e41cb672db6484edb6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:16:17.341468Z","signature_b64":"rDB5LLLmSISJZB1EXUaPjedgJQApvZoH4yScN9H9CfCsldlHwAkBdBEGsJl2UlIB70ELbG25ob1O+1yDsHa4CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b27259d5c28e124c403f9216fd45813b0d3f43f46a5c8cd23320096a8d01f0c8","last_reissued_at":"2026-07-05T02:16:17.340210Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:16:17.340210Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bounds on the Feedback Capacity of the $(d,\\infty)$-RLL Input-Constrained Binary Erasure Channel","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Navin Kashyap, V. Arvind Rameshwar","submitted_at":"2021-01-21T14:33:58Z","abstract_excerpt":"The paper considers the input-constrained binary erasure channel (BEC) with causal, noiseless feedback. The channel input sequence respects the $(d,\\infty)$-runlength limited (RLL) constraint, i.e., any pair of successive $1$s must be separated by at least $d$ $0$s. We derive upper and lower bounds on the feedback capacity of this channel, for all $d\\geq 1$, given by: $\\max\\limits_{\\delta \\in [0,\\frac{1}{d+1}]}R(\\delta) \\leq C^{\\text{fb}}_{(d\\infty)}(\\epsilon) \\leq \\max\\limits_{\\delta \\in [0,\\frac{1}{1+d\\epsilon}]}R(\\delta)$, where the function $R(\\delta) = \\frac{h_b(\\delta)}{d\\delta + \\frac{1"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2101.08638","kind":"arxiv","version":3},"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/2101.08638/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":"2101.08638","created_at":"2026-07-05T02:16:17.340990+00:00"},{"alias_kind":"arxiv_version","alias_value":"2101.08638v3","created_at":"2026-07-05T02:16:17.340990+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2101.08638","created_at":"2026-07-05T02:16:17.340990+00:00"},{"alias_kind":"pith_short_12","alias_value":"WJZFTVOCRYJE","created_at":"2026-07-05T02:16:17.340990+00:00"},{"alias_kind":"pith_short_16","alias_value":"WJZFTVOCRYJEYQB7","created_at":"2026-07-05T02:16:17.340990+00:00"},{"alias_kind":"pith_short_8","alias_value":"WJZFTVOC","created_at":"2026-07-05T02:16:17.340990+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/WJZFTVOCRYJEYQB7SILP2RMBHM","json":"https://pith.science/pith/WJZFTVOCRYJEYQB7SILP2RMBHM.json","graph_json":"https://pith.science/api/pith-number/WJZFTVOCRYJEYQB7SILP2RMBHM/graph.json","events_json":"https://pith.science/api/pith-number/WJZFTVOCRYJEYQB7SILP2RMBHM/events.json","paper":"https://pith.science/paper/WJZFTVOC"},"agent_actions":{"view_html":"https://pith.science/pith/WJZFTVOCRYJEYQB7SILP2RMBHM","download_json":"https://pith.science/pith/WJZFTVOCRYJEYQB7SILP2RMBHM.json","view_paper":"https://pith.science/paper/WJZFTVOC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2101.08638&json=true","fetch_graph":"https://pith.science/api/pith-number/WJZFTVOCRYJEYQB7SILP2RMBHM/graph.json","fetch_events":"https://pith.science/api/pith-number/WJZFTVOCRYJEYQB7SILP2RMBHM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WJZFTVOCRYJEYQB7SILP2RMBHM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WJZFTVOCRYJEYQB7SILP2RMBHM/action/storage_attestation","attest_author":"https://pith.science/pith/WJZFTVOCRYJEYQB7SILP2RMBHM/action/author_attestation","sign_citation":"https://pith.science/pith/WJZFTVOCRYJEYQB7SILP2RMBHM/action/citation_signature","submit_replication":"https://pith.science/pith/WJZFTVOCRYJEYQB7SILP2RMBHM/action/replication_record"}},"created_at":"2026-07-05T02:16:17.340990+00:00","updated_at":"2026-07-05T02:16:17.340990+00:00"}