{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:CI3UQOUS7BMSQIIFAGL3IK6NBZ","short_pith_number":"pith:CI3UQOUS","canonical_record":{"source":{"id":"2201.02035","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2022-01-06T13:04:18Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"bf181026ee66ee5cf83279d383d51117f41663072b8d3ae59edc384508539964","abstract_canon_sha256":"a44e3701f3170408c459f11cd602392a394927e98a23662bccdebddac3e70f8c"},"schema_version":"1.0"},"canonical_sha256":"1237483a92f8592821050197b42bcd0e7f429ea6e734c3421361ef95e47b1217","source":{"kind":"arxiv","id":"2201.02035","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2201.02035","created_at":"2026-07-05T03:46:29Z"},{"alias_kind":"arxiv_version","alias_value":"2201.02035v1","created_at":"2026-07-05T03:46:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2201.02035","created_at":"2026-07-05T03:46:29Z"},{"alias_kind":"pith_short_12","alias_value":"CI3UQOUS7BMS","created_at":"2026-07-05T03:46:29Z"},{"alias_kind":"pith_short_16","alias_value":"CI3UQOUS7BMSQIIF","created_at":"2026-07-05T03:46:29Z"},{"alias_kind":"pith_short_8","alias_value":"CI3UQOUS","created_at":"2026-07-05T03:46:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:CI3UQOUS7BMSQIIFAGL3IK6NBZ","target":"record","payload":{"canonical_record":{"source":{"id":"2201.02035","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2022-01-06T13:04:18Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"bf181026ee66ee5cf83279d383d51117f41663072b8d3ae59edc384508539964","abstract_canon_sha256":"a44e3701f3170408c459f11cd602392a394927e98a23662bccdebddac3e70f8c"},"schema_version":"1.0"},"canonical_sha256":"1237483a92f8592821050197b42bcd0e7f429ea6e734c3421361ef95e47b1217","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:46:29.209915Z","signature_b64":"HyFjDlRFXsQgjcu36hvpM57m8v8hbxA/UZTp2Rcp+/XaVKvIkndOJ9dtDHPGjetNKeMx57fcEwd/4NIDihADDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1237483a92f8592821050197b42bcd0e7f429ea6e734c3421361ef95e47b1217","last_reissued_at":"2026-07-05T03:46:29.209543Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:46:29.209543Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2201.02035","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-05T03:46:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dmZ4CDhK0UcTWKGOEZCkkFpc2WEPuBboEyxlJDfUS1J7nFc35IevpBNLaxADagp4obaLFKcMJDEzSndfP8cHBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-13T10:23:56.917619Z"},"content_sha256":"473472ed356ec3d0aae34344d2babb95ab68464de995b430f1358d468c1e5e4d","schema_version":"1.0","event_id":"sha256:473472ed356ec3d0aae34344d2babb95ab68464de995b430f1358d468c1e5e4d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:CI3UQOUS7BMSQIIFAGL3IK6NBZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Performance of Reed-Muller Codes Over $(d,\\infty)$-RLL Input-Constrained BMS Channels","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-01-06T13:04:18Z","abstract_excerpt":"This paper considers the input-constrained binary memoryless symmetric (BMS) channel, without feedback. The channel input sequence respects the $(d,\\infty)$-runlength limited (RLL) constraint, which mandates that any pair of successive $1$s be separated by at least $d$ $0$s. We consider the problem of designing explicit codes for such channels. In particular, we work with the Reed-Muller (RM) family of codes, which were shown by Reeves and Pfister (2021) to achieve the capacity of any unconstrained BMS channel, under bit-MAP decoding. We show that it is possible to pick $(d,\\infty)$-RLL subcod"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2201.02035","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/2201.02035/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-05T03:46:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZdTNoGuyspIC/36QayYg93GRuDV7crflYesLhfC/PJDc8nO44G7qfMAj4xVfvsv75XSsgrwdEfs7t6IDSkH0Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-13T10:23:56.918064Z"},"content_sha256":"8d8396c059a1b007b5ffb47e1c23a70d28aa0bbdd3ff560aae2376c25654f0ed","schema_version":"1.0","event_id":"sha256:8d8396c059a1b007b5ffb47e1c23a70d28aa0bbdd3ff560aae2376c25654f0ed"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CI3UQOUS7BMSQIIFAGL3IK6NBZ/bundle.json","state_url":"https://pith.science/pith/CI3UQOUS7BMSQIIFAGL3IK6NBZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CI3UQOUS7BMSQIIFAGL3IK6NBZ/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-13T10:23:56Z","links":{"resolver":"https://pith.science/pith/CI3UQOUS7BMSQIIFAGL3IK6NBZ","bundle":"https://pith.science/pith/CI3UQOUS7BMSQIIFAGL3IK6NBZ/bundle.json","state":"https://pith.science/pith/CI3UQOUS7BMSQIIFAGL3IK6NBZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CI3UQOUS7BMSQIIFAGL3IK6NBZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:CI3UQOUS7BMSQIIFAGL3IK6NBZ","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":"a44e3701f3170408c459f11cd602392a394927e98a23662bccdebddac3e70f8c","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2022-01-06T13:04:18Z","title_canon_sha256":"bf181026ee66ee5cf83279d383d51117f41663072b8d3ae59edc384508539964"},"schema_version":"1.0","source":{"id":"2201.02035","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2201.02035","created_at":"2026-07-05T03:46:29Z"},{"alias_kind":"arxiv_version","alias_value":"2201.02035v1","created_at":"2026-07-05T03:46:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2201.02035","created_at":"2026-07-05T03:46:29Z"},{"alias_kind":"pith_short_12","alias_value":"CI3UQOUS7BMS","created_at":"2026-07-05T03:46:29Z"},{"alias_kind":"pith_short_16","alias_value":"CI3UQOUS7BMSQIIF","created_at":"2026-07-05T03:46:29Z"},{"alias_kind":"pith_short_8","alias_value":"CI3UQOUS","created_at":"2026-07-05T03:46:29Z"}],"graph_snapshots":[{"event_id":"sha256:8d8396c059a1b007b5ffb47e1c23a70d28aa0bbdd3ff560aae2376c25654f0ed","target":"graph","created_at":"2026-07-05T03:46:29Z","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/2201.02035/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This paper considers the input-constrained binary memoryless symmetric (BMS) channel, without feedback. The channel input sequence respects the $(d,\\infty)$-runlength limited (RLL) constraint, which mandates that any pair of successive $1$s be separated by at least $d$ $0$s. We consider the problem of designing explicit codes for such channels. In particular, we work with the Reed-Muller (RM) family of codes, which were shown by Reeves and Pfister (2021) to achieve the capacity of any unconstrained BMS channel, under bit-MAP decoding. We show that it is possible to pick $(d,\\infty)$-RLL subcod","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-01-06T13:04:18Z","title":"On the Performance of Reed-Muller Codes Over $(d,\\infty)$-RLL Input-Constrained BMS Channels"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2201.02035","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:473472ed356ec3d0aae34344d2babb95ab68464de995b430f1358d468c1e5e4d","target":"record","created_at":"2026-07-05T03:46:29Z","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":"a44e3701f3170408c459f11cd602392a394927e98a23662bccdebddac3e70f8c","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2022-01-06T13:04:18Z","title_canon_sha256":"bf181026ee66ee5cf83279d383d51117f41663072b8d3ae59edc384508539964"},"schema_version":"1.0","source":{"id":"2201.02035","kind":"arxiv","version":1}},"canonical_sha256":"1237483a92f8592821050197b42bcd0e7f429ea6e734c3421361ef95e47b1217","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1237483a92f8592821050197b42bcd0e7f429ea6e734c3421361ef95e47b1217","first_computed_at":"2026-07-05T03:46:29.209543Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:46:29.209543Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HyFjDlRFXsQgjcu36hvpM57m8v8hbxA/UZTp2Rcp+/XaVKvIkndOJ9dtDHPGjetNKeMx57fcEwd/4NIDihADDg==","signature_status":"signed_v1","signed_at":"2026-07-05T03:46:29.209915Z","signed_message":"canonical_sha256_bytes"},"source_id":"2201.02035","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:473472ed356ec3d0aae34344d2babb95ab68464de995b430f1358d468c1e5e4d","sha256:8d8396c059a1b007b5ffb47e1c23a70d28aa0bbdd3ff560aae2376c25654f0ed"],"state_sha256":"43cd850492a0c1ed065d5ad6c528dd1c3d62f9298f52fb5546b6d2bc7a2146d1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r/R9ppOr/rP3QJb0UQpgJ41SBPn18h78jIAoadnCUa8mIO/yM97QsJE3p1XSqmmMiw28EoqIRSuXqBD/5CagBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-13T10:23:56.920583Z","bundle_sha256":"bb4f051a57b9247c60621899b0da9a1a6b6996b9ce5bb7f6c5730884d29d0a47"}}