{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:WR5BPUDHDDV6C4WGRFIHGO4AMI","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":"626fa6c05edc5f8eb3fa4dbc6255e74a9fde1f60fc7e5a04251a6c36129a61ef","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2022-11-10T12:14:51Z","title_canon_sha256":"a375a62c2b635f2b24b846e60101ceb1c7671ded146c8e83cd1df223dd124965"},"schema_version":"1.0","source":{"id":"2211.05513","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2211.05513","created_at":"2026-07-05T06:11:57Z"},{"alias_kind":"arxiv_version","alias_value":"2211.05513v2","created_at":"2026-07-05T06:11:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.05513","created_at":"2026-07-05T06:11:57Z"},{"alias_kind":"pith_short_12","alias_value":"WR5BPUDHDDV6","created_at":"2026-07-05T06:11:57Z"},{"alias_kind":"pith_short_16","alias_value":"WR5BPUDHDDV6C4WG","created_at":"2026-07-05T06:11:57Z"},{"alias_kind":"pith_short_8","alias_value":"WR5BPUDH","created_at":"2026-07-05T06:11:57Z"}],"graph_snapshots":[{"event_id":"sha256:6ce43b88981b5dcde0d7607f818df90efea87f54d5f5ce6bb977358a0cbee5b8","target":"graph","created_at":"2026-07-05T06:11:57Z","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/2211.05513/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The paper considers coding schemes derived from Reed-Muller (RM) codes, for transmission over input-constrained memoryless channels. Our focus is on the $(d,\\infty)$-runlength limited (RLL) constraint, which mandates that any pair of successive $1$s be separated by at least $d$ $0$s. In our study, we first consider $(d,\\infty)$-RLL subcodes of RM codes, taking the coordinates of the RM codes to be in the standard lexicographic ordering. We show, via a simple construction, that RM codes of rate $R$ have linear $(d,\\infty)$-RLL subcodes of rate $R\\cdot{2^{-\\left \\lceil \\log_2(d+1)\\right \\rceil}}","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-11-10T12:14:51Z","title":"Coding Schemes Based on Reed-Muller Codes for $(d,\\infty)$-RLL Input-Constrained Channels"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.05513","kind":"arxiv","version":2},"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:5a1149b303803c8ba2d54f7e5c919f130b35d47f7166555c5f83b362c4855ecf","target":"record","created_at":"2026-07-05T06:11:57Z","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":"626fa6c05edc5f8eb3fa4dbc6255e74a9fde1f60fc7e5a04251a6c36129a61ef","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2022-11-10T12:14:51Z","title_canon_sha256":"a375a62c2b635f2b24b846e60101ceb1c7671ded146c8e83cd1df223dd124965"},"schema_version":"1.0","source":{"id":"2211.05513","kind":"arxiv","version":2}},"canonical_sha256":"b47a17d06718ebe172c68950733b80620af66f39099cbcd2be261166e3efc706","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b47a17d06718ebe172c68950733b80620af66f39099cbcd2be261166e3efc706","first_computed_at":"2026-07-05T06:11:57.872410Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:11:57.872410Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fkvA+lMmRO079BlXJLOL8G7wnfpdOefoWpM/58sT5AbrJAjxTy8y26J/27wEXCYh0brgmfr931dzM8O79A7ZBA==","signature_status":"signed_v1","signed_at":"2026-07-05T06:11:57.872827Z","signed_message":"canonical_sha256_bytes"},"source_id":"2211.05513","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5a1149b303803c8ba2d54f7e5c919f130b35d47f7166555c5f83b362c4855ecf","sha256:6ce43b88981b5dcde0d7607f818df90efea87f54d5f5ce6bb977358a0cbee5b8"],"state_sha256":"e6ce1c14a6b19ad342d755ca738697e869003b9a0736a2c65d33c382ad41ea7b"}