{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2004:F5NVFWFZ3BXB2MPZWOE2C46C4J","short_pith_number":"pith:F5NVFWFZ","canonical_record":{"source":{"id":"cs/0411006","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.IT","submitted_at":"2004-11-03T19:20:11Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"2f31260efe1100a13e3f6d2f7c058259ffd47d7396164a1a1317d6b03596ec10","abstract_canon_sha256":"f8d19bd303cf82021c10a9d7b75d6f19a244874f46442790bf744c169f0967e0"},"schema_version":"1.0"},"canonical_sha256":"2f5b52d8b9d86e1d31f9b389a173c2e257aafba6aa84a101d7c62da6ab934ae5","source":{"kind":"arxiv","id":"cs/0411006","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0411006","created_at":"2026-05-18T00:57:45Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0411006v1","created_at":"2026-05-18T00:57:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0411006","created_at":"2026-05-18T00:57:45Z"},{"alias_kind":"pith_short_12","alias_value":"F5NVFWFZ3BXB","created_at":"2026-05-18T12:25:52Z"},{"alias_kind":"pith_short_16","alias_value":"F5NVFWFZ3BXB2MPZ","created_at":"2026-05-18T12:25:52Z"},{"alias_kind":"pith_short_8","alias_value":"F5NVFWFZ","created_at":"2026-05-18T12:25:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2004:F5NVFWFZ3BXB2MPZWOE2C46C4J","target":"record","payload":{"canonical_record":{"source":{"id":"cs/0411006","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.IT","submitted_at":"2004-11-03T19:20:11Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"2f31260efe1100a13e3f6d2f7c058259ffd47d7396164a1a1317d6b03596ec10","abstract_canon_sha256":"f8d19bd303cf82021c10a9d7b75d6f19a244874f46442790bf744c169f0967e0"},"schema_version":"1.0"},"canonical_sha256":"2f5b52d8b9d86e1d31f9b389a173c2e257aafba6aa84a101d7c62da6ab934ae5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:57:45.184025Z","signature_b64":"7Y4kYbVBnzJFLkhNyWjNNq1lxjPB4Lzy+yVra0WajvNZAn8ZS72DEeMVb2fmOQpD9SkdMuDngT06F/VOQpH9Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2f5b52d8b9d86e1d31f9b389a173c2e257aafba6aa84a101d7c62da6ab934ae5","last_reissued_at":"2026-05-18T00:57:45.183521Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:57:45.183521Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"cs/0411006","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-05-18T00:57:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OoSL/3eKMNh1s7QHN0PcRiW9SBPKGwwS397MnblZ7epQp3ouSsTbwZKmXXjZ+C8eUacJ2bn8I5uGTEU/RKgOBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T15:35:26.328732Z"},"content_sha256":"79e5f7ba9ba04fc83b017492acf80dd9c899ece708494b87fc84cdea8e6c36a7","schema_version":"1.0","event_id":"sha256:79e5f7ba9ba04fc83b017492acf80dd9c899ece708494b87fc84cdea8e6c36a7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2004:F5NVFWFZ3BXB2MPZWOE2C46C4J","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Capacity Achieving Code Constructions for Two Classes of (d,k) Constraints","license":"","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Steven W. McLaughlin, Yogesh Sankarasubramaniam","submitted_at":"2004-11-03T19:20:11Z","abstract_excerpt":"In this paper, we present two low complexity algorithms that achieve capacity for the noiseless (d,k) constrained channel when k=2d+1, or when k-d+1 is not prime. The first algorithm, called symbol sliding, is a generalized version of the bit flipping algorithm introduced by Aviran et al. [1]. In addition to achieving capacity for (d,2d+1) constraints, it comes close to capacity in other cases. The second algorithm is based on interleaving, and is a generalized version of the bit stuffing algorithm introduced by Bender and Wolf [2]. This method uses fewer than k-d biased bit streams to achieve"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0411006","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":""},"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-05-18T00:57:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KnhUDMuxAyg6Uo3zcxIHOeWRYa8HPKZmUquGNJ9MTwiTJLbkqKOzQW8tuDuh9c7Kk3BAKG8OYnffCI9wt0xzBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T15:35:26.329079Z"},"content_sha256":"720d70623671ac2603c319ec3946a697e77d9e7dd68a976577239074e1f5d904","schema_version":"1.0","event_id":"sha256:720d70623671ac2603c319ec3946a697e77d9e7dd68a976577239074e1f5d904"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/F5NVFWFZ3BXB2MPZWOE2C46C4J/bundle.json","state_url":"https://pith.science/pith/F5NVFWFZ3BXB2MPZWOE2C46C4J/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/F5NVFWFZ3BXB2MPZWOE2C46C4J/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-06-23T15:35:26Z","links":{"resolver":"https://pith.science/pith/F5NVFWFZ3BXB2MPZWOE2C46C4J","bundle":"https://pith.science/pith/F5NVFWFZ3BXB2MPZWOE2C46C4J/bundle.json","state":"https://pith.science/pith/F5NVFWFZ3BXB2MPZWOE2C46C4J/state.json","well_known_bundle":"https://pith.science/.well-known/pith/F5NVFWFZ3BXB2MPZWOE2C46C4J/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2004:F5NVFWFZ3BXB2MPZWOE2C46C4J","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":"f8d19bd303cf82021c10a9d7b75d6f19a244874f46442790bf744c169f0967e0","cross_cats_sorted":["math.IT"],"license":"","primary_cat":"cs.IT","submitted_at":"2004-11-03T19:20:11Z","title_canon_sha256":"2f31260efe1100a13e3f6d2f7c058259ffd47d7396164a1a1317d6b03596ec10"},"schema_version":"1.0","source":{"id":"cs/0411006","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0411006","created_at":"2026-05-18T00:57:45Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0411006v1","created_at":"2026-05-18T00:57:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0411006","created_at":"2026-05-18T00:57:45Z"},{"alias_kind":"pith_short_12","alias_value":"F5NVFWFZ3BXB","created_at":"2026-05-18T12:25:52Z"},{"alias_kind":"pith_short_16","alias_value":"F5NVFWFZ3BXB2MPZ","created_at":"2026-05-18T12:25:52Z"},{"alias_kind":"pith_short_8","alias_value":"F5NVFWFZ","created_at":"2026-05-18T12:25:52Z"}],"graph_snapshots":[{"event_id":"sha256:720d70623671ac2603c319ec3946a697e77d9e7dd68a976577239074e1f5d904","target":"graph","created_at":"2026-05-18T00:57:45Z","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"},"paper":{"abstract_excerpt":"In this paper, we present two low complexity algorithms that achieve capacity for the noiseless (d,k) constrained channel when k=2d+1, or when k-d+1 is not prime. The first algorithm, called symbol sliding, is a generalized version of the bit flipping algorithm introduced by Aviran et al. [1]. In addition to achieving capacity for (d,2d+1) constraints, it comes close to capacity in other cases. The second algorithm is based on interleaving, and is a generalized version of the bit stuffing algorithm introduced by Bender and Wolf [2]. This method uses fewer than k-d biased bit streams to achieve","authors_text":"Steven W. McLaughlin, Yogesh Sankarasubramaniam","cross_cats":["math.IT"],"headline":"","license":"","primary_cat":"cs.IT","submitted_at":"2004-11-03T19:20:11Z","title":"Capacity Achieving Code Constructions for Two Classes of (d,k) Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0411006","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:79e5f7ba9ba04fc83b017492acf80dd9c899ece708494b87fc84cdea8e6c36a7","target":"record","created_at":"2026-05-18T00:57:45Z","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":"f8d19bd303cf82021c10a9d7b75d6f19a244874f46442790bf744c169f0967e0","cross_cats_sorted":["math.IT"],"license":"","primary_cat":"cs.IT","submitted_at":"2004-11-03T19:20:11Z","title_canon_sha256":"2f31260efe1100a13e3f6d2f7c058259ffd47d7396164a1a1317d6b03596ec10"},"schema_version":"1.0","source":{"id":"cs/0411006","kind":"arxiv","version":1}},"canonical_sha256":"2f5b52d8b9d86e1d31f9b389a173c2e257aafba6aa84a101d7c62da6ab934ae5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2f5b52d8b9d86e1d31f9b389a173c2e257aafba6aa84a101d7c62da6ab934ae5","first_computed_at":"2026-05-18T00:57:45.183521Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:57:45.183521Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7Y4kYbVBnzJFLkhNyWjNNq1lxjPB4Lzy+yVra0WajvNZAn8ZS72DEeMVb2fmOQpD9SkdMuDngT06F/VOQpH9Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:57:45.184025Z","signed_message":"canonical_sha256_bytes"},"source_id":"cs/0411006","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:79e5f7ba9ba04fc83b017492acf80dd9c899ece708494b87fc84cdea8e6c36a7","sha256:720d70623671ac2603c319ec3946a697e77d9e7dd68a976577239074e1f5d904"],"state_sha256":"f00baa3097f31fd7723cef205ee9e588eb92d644d7452fd6dd16c0e1ecd85673"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qzgwXWF8V59J03w1TyUozTT7nuz/tpPxv7VwqQ1isP3uVUwF1T01TOPqHorToTSZnRSqWooHJF0tXV4vl9sxBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T15:35:26.331089Z","bundle_sha256":"2b44b576f46a856c7fa44e41d0f3f3da23f702bd7d14ec84ce9c135b756b4075"}}