{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:N7D3UWSPFA5T564GDCJTAAQ24B","short_pith_number":"pith:N7D3UWSP","canonical_record":{"source":{"id":"1206.6584","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-06-28T07:57:04Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"d758a4d866749a89cf6338a0a7047ba727c0a330b8259bbdf2e8254f8f8344f7","abstract_canon_sha256":"58fda13dbed51fafde7afbd5550c3d9b2016d04b9b8f90c71e54bd50615833d2"},"schema_version":"1.0"},"canonical_sha256":"6fc7ba5a4f283b3efb86189330021ae05aaf51b88053b6c7c65a742fe0d6a5db","source":{"kind":"arxiv","id":"1206.6584","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.6584","created_at":"2026-05-18T03:52:25Z"},{"alias_kind":"arxiv_version","alias_value":"1206.6584v1","created_at":"2026-05-18T03:52:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.6584","created_at":"2026-05-18T03:52:25Z"},{"alias_kind":"pith_short_12","alias_value":"N7D3UWSPFA5T","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"N7D3UWSPFA5T564G","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"N7D3UWSP","created_at":"2026-05-18T12:27:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:N7D3UWSPFA5T564GDCJTAAQ24B","target":"record","payload":{"canonical_record":{"source":{"id":"1206.6584","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-06-28T07:57:04Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"d758a4d866749a89cf6338a0a7047ba727c0a330b8259bbdf2e8254f8f8344f7","abstract_canon_sha256":"58fda13dbed51fafde7afbd5550c3d9b2016d04b9b8f90c71e54bd50615833d2"},"schema_version":"1.0"},"canonical_sha256":"6fc7ba5a4f283b3efb86189330021ae05aaf51b88053b6c7c65a742fe0d6a5db","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:52:25.559310Z","signature_b64":"+jj6FfKptRlg2d5kiqryH235K3XhXJdEenfXFd7cbs5DsijgvbuJVUwjhtrHxV+ruA2SbcS689ZWPGRJU8zLCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6fc7ba5a4f283b3efb86189330021ae05aaf51b88053b6c7c65a742fe0d6a5db","last_reissued_at":"2026-05-18T03:52:25.558448Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:52:25.558448Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1206.6584","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-18T03:52:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"08oCUILSHVwTc6+2jCPyR3AKKAR4w16JkF2jK+QcrHKfJJpm2lD627SafTQctOTqKvXTfqUat5Hi6NiwWiRoAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T10:27:48.407215Z"},"content_sha256":"3e89b4d6a137b8ddc332413135cca7743cf4f2fcf2c8aa8a6a4f4354ecce2375","schema_version":"1.0","event_id":"sha256:3e89b4d6a137b8ddc332413135cca7743cf4f2fcf2c8aa8a6a4f4354ecce2375"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:N7D3UWSPFA5T564GDCJTAAQ24B","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Approximate Coding-Rate Versus Minimum Distance Formula for Binary Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Lajos Hanzo, Robert G. Maunder, Yosef Akhtman","submitted_at":"2012-06-28T07:57:04Z","abstract_excerpt":"We devise an analytically simple as well as invertible approximate expression, which describes the relation between the minimum distance of a binary code and the corresponding maximum attainable code-rate. For example, for a rate-(1/4), length-256 binary code the best known bounds limit the attainable minimum distance to 65<d(n=256,k=64)<90, while our solution yields d(n=256,k=64)=74.4. The proposed formula attains the approximation accuracy within the rounding error for ~97% of (n,k) scenarios, where the exact value of the minimum distance is known. The results provided may be utilized for th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.6584","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-18T03:52:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"08yQ7dDzAkyQ0SR7+FLvz9PFOhGfI+E5s0qwSvtq1H59YKPOR2SdSRD3urZaUqzqUra4Ia8zbUifPOsVleFWDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T10:27:48.407892Z"},"content_sha256":"ffcc344854199d2f195f4730fcf146b071aa554fda7d5d489bfafe5c5b10aaec","schema_version":"1.0","event_id":"sha256:ffcc344854199d2f195f4730fcf146b071aa554fda7d5d489bfafe5c5b10aaec"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/N7D3UWSPFA5T564GDCJTAAQ24B/bundle.json","state_url":"https://pith.science/pith/N7D3UWSPFA5T564GDCJTAAQ24B/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/N7D3UWSPFA5T564GDCJTAAQ24B/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-05-24T10:27:48Z","links":{"resolver":"https://pith.science/pith/N7D3UWSPFA5T564GDCJTAAQ24B","bundle":"https://pith.science/pith/N7D3UWSPFA5T564GDCJTAAQ24B/bundle.json","state":"https://pith.science/pith/N7D3UWSPFA5T564GDCJTAAQ24B/state.json","well_known_bundle":"https://pith.science/.well-known/pith/N7D3UWSPFA5T564GDCJTAAQ24B/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:N7D3UWSPFA5T564GDCJTAAQ24B","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":"58fda13dbed51fafde7afbd5550c3d9b2016d04b9b8f90c71e54bd50615833d2","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-06-28T07:57:04Z","title_canon_sha256":"d758a4d866749a89cf6338a0a7047ba727c0a330b8259bbdf2e8254f8f8344f7"},"schema_version":"1.0","source":{"id":"1206.6584","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.6584","created_at":"2026-05-18T03:52:25Z"},{"alias_kind":"arxiv_version","alias_value":"1206.6584v1","created_at":"2026-05-18T03:52:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.6584","created_at":"2026-05-18T03:52:25Z"},{"alias_kind":"pith_short_12","alias_value":"N7D3UWSPFA5T","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"N7D3UWSPFA5T564G","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"N7D3UWSP","created_at":"2026-05-18T12:27:16Z"}],"graph_snapshots":[{"event_id":"sha256:ffcc344854199d2f195f4730fcf146b071aa554fda7d5d489bfafe5c5b10aaec","target":"graph","created_at":"2026-05-18T03:52:25Z","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":"We devise an analytically simple as well as invertible approximate expression, which describes the relation between the minimum distance of a binary code and the corresponding maximum attainable code-rate. For example, for a rate-(1/4), length-256 binary code the best known bounds limit the attainable minimum distance to 65<d(n=256,k=64)<90, while our solution yields d(n=256,k=64)=74.4. The proposed formula attains the approximation accuracy within the rounding error for ~97% of (n,k) scenarios, where the exact value of the minimum distance is known. The results provided may be utilized for th","authors_text":"Lajos Hanzo, Robert G. Maunder, Yosef Akhtman","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-06-28T07:57:04Z","title":"An Approximate Coding-Rate Versus Minimum Distance Formula for Binary Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.6584","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:3e89b4d6a137b8ddc332413135cca7743cf4f2fcf2c8aa8a6a4f4354ecce2375","target":"record","created_at":"2026-05-18T03:52:25Z","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":"58fda13dbed51fafde7afbd5550c3d9b2016d04b9b8f90c71e54bd50615833d2","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-06-28T07:57:04Z","title_canon_sha256":"d758a4d866749a89cf6338a0a7047ba727c0a330b8259bbdf2e8254f8f8344f7"},"schema_version":"1.0","source":{"id":"1206.6584","kind":"arxiv","version":1}},"canonical_sha256":"6fc7ba5a4f283b3efb86189330021ae05aaf51b88053b6c7c65a742fe0d6a5db","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6fc7ba5a4f283b3efb86189330021ae05aaf51b88053b6c7c65a742fe0d6a5db","first_computed_at":"2026-05-18T03:52:25.558448Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:52:25.558448Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+jj6FfKptRlg2d5kiqryH235K3XhXJdEenfXFd7cbs5DsijgvbuJVUwjhtrHxV+ruA2SbcS689ZWPGRJU8zLCg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:52:25.559310Z","signed_message":"canonical_sha256_bytes"},"source_id":"1206.6584","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3e89b4d6a137b8ddc332413135cca7743cf4f2fcf2c8aa8a6a4f4354ecce2375","sha256:ffcc344854199d2f195f4730fcf146b071aa554fda7d5d489bfafe5c5b10aaec"],"state_sha256":"1744008bbb20eb26abd68f46c42f733ba818a5e0bb285e95fe4eda0e9720e18e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WfXoaE8ztdV29GbDyqnme6w3BL1DCRMbubd08VrmZzdScA26ciz/aZOXEE159brnrrJuhAvgUTI8uqvFoougBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-24T10:27:48.413395Z","bundle_sha256":"a24c3672c94f54acc6c4989068ac1cc3b44e57d23f5a8b5d19332f737bd5dd9a"}}