{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:EUTWRVLRNZR4GPBXI2I4WQ3KEC","short_pith_number":"pith:EUTWRVLR","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"},"canonical_sha256":"252768d5716e63c33c374691cb436a20befa484411785b9d857989d0c405ea06","source":{"kind":"arxiv","id":"2204.06780","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2204.06780","created_at":"2026-07-05T04:14:46Z"},{"alias_kind":"arxiv_version","alias_value":"2204.06780v1","created_at":"2026-07-05T04:14:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2204.06780","created_at":"2026-07-05T04:14:46Z"},{"alias_kind":"pith_short_12","alias_value":"EUTWRVLRNZR4","created_at":"2026-07-05T04:14:46Z"},{"alias_kind":"pith_short_16","alias_value":"EUTWRVLRNZR4GPBX","created_at":"2026-07-05T04:14:46Z"},{"alias_kind":"pith_short_8","alias_value":"EUTWRVLR","created_at":"2026-07-05T04:14:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:EUTWRVLRNZR4GPBXI2I4WQ3KEC","target":"record","payload":{"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"},"canonical_sha256":"252768d5716e63c33c374691cb436a20befa484411785b9d857989d0c405ea06","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"},"source_kind":"arxiv","source_id":"2204.06780","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-07-05T04:14:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9m4OaGcF9+vcpuSDq76abGRXL7FF/lEJHigNfg73h1ks3bv/kx4y/gGRQkfQOn+EHd3QIzdBfpAkRcXsXQkKAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-09T02:20:57.094678Z"},"content_sha256":"bc6aebcd51ebc8a6c7e364cd05786dca2ccf986180b60cf5b64480d7f0809094","schema_version":"1.0","event_id":"sha256:bc6aebcd51ebc8a6c7e364cd05786dca2ccf986180b60cf5b64480d7f0809094"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:EUTWRVLRNZR4GPBXI2I4WQ3KEC","target":"graph","payload":{"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"},"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-07-05T04:14:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9P3WvnOCBj9al5zIXE+OBsRwsT3ySBmeLxZ/rWbfxysig69VRMewMZX8zpLmKlzHpGcBMUKLpA5JknJaKeHjCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-09T02:20:57.095081Z"},"content_sha256":"01b6d9cf708323898b857e0ee7ec20e0a6866c3d93226fdd093144fea6c91652","schema_version":"1.0","event_id":"sha256:01b6d9cf708323898b857e0ee7ec20e0a6866c3d93226fdd093144fea6c91652"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EUTWRVLRNZR4GPBXI2I4WQ3KEC/bundle.json","state_url":"https://pith.science/pith/EUTWRVLRNZR4GPBXI2I4WQ3KEC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EUTWRVLRNZR4GPBXI2I4WQ3KEC/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-07-09T02:20:57Z","links":{"resolver":"https://pith.science/pith/EUTWRVLRNZR4GPBXI2I4WQ3KEC","bundle":"https://pith.science/pith/EUTWRVLRNZR4GPBXI2I4WQ3KEC/bundle.json","state":"https://pith.science/pith/EUTWRVLRNZR4GPBXI2I4WQ3KEC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EUTWRVLRNZR4GPBXI2I4WQ3KEC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:EUTWRVLRNZR4GPBXI2I4WQ3KEC","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":"424c07a05eb7cf3c76d6cf9e7e179802a1231cca16857acbad8ea7baeec876fb","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2022-04-14T06:33:03Z","title_canon_sha256":"5b47369e42c0f45fb46116dee886e9ba34f4f3b079f824f3f73ff7de3b4bd9d2"},"schema_version":"1.0","source":{"id":"2204.06780","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2204.06780","created_at":"2026-07-05T04:14:46Z"},{"alias_kind":"arxiv_version","alias_value":"2204.06780v1","created_at":"2026-07-05T04:14:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2204.06780","created_at":"2026-07-05T04:14:46Z"},{"alias_kind":"pith_short_12","alias_value":"EUTWRVLRNZR4","created_at":"2026-07-05T04:14:46Z"},{"alias_kind":"pith_short_16","alias_value":"EUTWRVLRNZR4GPBX","created_at":"2026-07-05T04:14:46Z"},{"alias_kind":"pith_short_8","alias_value":"EUTWRVLR","created_at":"2026-07-05T04:14:46Z"}],"graph_snapshots":[{"event_id":"sha256:01b6d9cf708323898b857e0ee7ec20e0a6866c3d93226fdd093144fea6c91652","target":"graph","created_at":"2026-07-05T04:14:46Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2204.06780/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Navin Kashyap, V. Arvind Rameshwar","cross_cats":["math.IT"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2022-04-14T06:33:03Z","title":"A Feedback Capacity-Achieving Coding Scheme for the $(d,\\infty)$-RLL Input-Constrained Binary Erasure Channel"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2204.06780","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:bc6aebcd51ebc8a6c7e364cd05786dca2ccf986180b60cf5b64480d7f0809094","target":"record","created_at":"2026-07-05T04:14:46Z","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":"424c07a05eb7cf3c76d6cf9e7e179802a1231cca16857acbad8ea7baeec876fb","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2022-04-14T06:33:03Z","title_canon_sha256":"5b47369e42c0f45fb46116dee886e9ba34f4f3b079f824f3f73ff7de3b4bd9d2"},"schema_version":"1.0","source":{"id":"2204.06780","kind":"arxiv","version":1}},"canonical_sha256":"252768d5716e63c33c374691cb436a20befa484411785b9d857989d0c405ea06","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"252768d5716e63c33c374691cb436a20befa484411785b9d857989d0c405ea06","first_computed_at":"2026-07-05T04:14:46.037397Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:14:46.037397Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"P6+aKbkOd8jgxAJUvQ1XCtYmjkxWUnq1PZaZ1KMjXli/c0xCCPdMiRsBtfbgSBcYem38AJgNQ1vf63sKxoYTAA==","signature_status":"signed_v1","signed_at":"2026-07-05T04:14:46.037770Z","signed_message":"canonical_sha256_bytes"},"source_id":"2204.06780","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bc6aebcd51ebc8a6c7e364cd05786dca2ccf986180b60cf5b64480d7f0809094","sha256:01b6d9cf708323898b857e0ee7ec20e0a6866c3d93226fdd093144fea6c91652"],"state_sha256":"6082817a1925810314689d8860a741115566a73a8cc7bf2426bf10220abba92d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P+nF/CN/LHPWvKkOgRrReOAVZzG0jUIZ7/Y1SpWJR7s8iSL+F7q+c6PCNrNumcwlaK2CFqCj+rekrwbJK8TlAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-09T02:20:57.097351Z","bundle_sha256":"4f2463347490b1e02733e80867d8515e85a59bae9082dec367317834d7e5ac81"}}