{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:CJ34D25T7TMXTYGXZW44E2LEO5","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":"e35b47ad1682cc5606c4e9d2f83d058fdcc259445e589d852de8b0f49095944d","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2023-01-12T15:55:04Z","title_canon_sha256":"515ff76a4cbdb4871249d7afea3387bfe84f921cd9c7628672bfa67034c375b4"},"schema_version":"1.0","source":{"id":"2301.05098","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2301.05098","created_at":"2026-07-05T06:02:31Z"},{"alias_kind":"arxiv_version","alias_value":"2301.05098v4","created_at":"2026-07-05T06:02:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2301.05098","created_at":"2026-07-05T06:02:31Z"},{"alias_kind":"pith_short_12","alias_value":"CJ34D25T7TMX","created_at":"2026-07-05T06:02:31Z"},{"alias_kind":"pith_short_16","alias_value":"CJ34D25T7TMXTYGX","created_at":"2026-07-05T06:02:31Z"},{"alias_kind":"pith_short_8","alias_value":"CJ34D25T","created_at":"2026-07-05T06:02:31Z"}],"graph_snapshots":[{"event_id":"sha256:3dc6533b80050676a3722dfc07741956dca4059fa5361c05d4a53f9d02e4ab7f","target":"graph","created_at":"2026-07-05T06:02:31Z","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/2301.05098/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper, we study binary constrained codes that are resilient to bit-flip errors and erasures. In our first approach, we compute the sizes of constrained subcodes of linear codes. Since there exist well-known linear codes that achieve vanishing probabilities of error over the binary symmetric channel (which causes bit-flip errors) and the binary erasure channel, constrained subcodes of such linear codes are also resilient to random bit-flip errors and erasures. We employ a simple identity from the Fourier analysis of Boolean functions, which transforms the problem of counting constrained","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":"2023-01-12T15:55:04Z","title":"Estimating the Sizes of Binary Error-Correcting Constrained Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2301.05098","kind":"arxiv","version":4},"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:683f89b23aacc9021894e729e0d9672bed6f0713b6a9f28b088e75840288fccf","target":"record","created_at":"2026-07-05T06:02:31Z","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":"e35b47ad1682cc5606c4e9d2f83d058fdcc259445e589d852de8b0f49095944d","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2023-01-12T15:55:04Z","title_canon_sha256":"515ff76a4cbdb4871249d7afea3387bfe84f921cd9c7628672bfa67034c375b4"},"schema_version":"1.0","source":{"id":"2301.05098","kind":"arxiv","version":4}},"canonical_sha256":"1277c1ebb3fcd979e0d7cdb9c2696477653d66587402c31c4f046173441ecd12","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1277c1ebb3fcd979e0d7cdb9c2696477653d66587402c31c4f046173441ecd12","first_computed_at":"2026-07-05T06:02:31.890628Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:02:31.890628Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cVq+XoafCegGn3FTjYjFMbVQMRZwkqADlJrBgunnXcMsT5gILsGrVXy78Ou2NPaIq98mNMWMRAL10vVZKhFzAw==","signature_status":"signed_v1","signed_at":"2026-07-05T06:02:31.891088Z","signed_message":"canonical_sha256_bytes"},"source_id":"2301.05098","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:683f89b23aacc9021894e729e0d9672bed6f0713b6a9f28b088e75840288fccf","sha256:3dc6533b80050676a3722dfc07741956dca4059fa5361c05d4a53f9d02e4ab7f"],"state_sha256":"b6fc86125092cee7d87ebce5254ce0ab9dede90bfae43993c8ec2e4714d58765"}