{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:KK4ITQDMZLB57RGTPXL3PTVGUK","short_pith_number":"pith:KK4ITQDM","canonical_record":{"source":{"id":"1105.1894","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-05-10T09:51:05Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"59a893f6a71f383cb4ded6b2681b2699661932b2ded2b59d8a7de6426f25584b","abstract_canon_sha256":"2cdd67ce5767778b37b9d77e322fbb067647036c85a467da67c2827ab63cdd4f"},"schema_version":"1.0"},"canonical_sha256":"52b889c06ccac3dfc4d37dd7b7cea6a29365d705cff8ded5a48fe7d4e0409e1f","source":{"kind":"arxiv","id":"1105.1894","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1105.1894","created_at":"2026-05-18T04:00:26Z"},{"alias_kind":"arxiv_version","alias_value":"1105.1894v2","created_at":"2026-05-18T04:00:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.1894","created_at":"2026-05-18T04:00:26Z"},{"alias_kind":"pith_short_12","alias_value":"KK4ITQDMZLB5","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_16","alias_value":"KK4ITQDMZLB57RGT","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_8","alias_value":"KK4ITQDM","created_at":"2026-05-18T12:26:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:KK4ITQDMZLB57RGTPXL3PTVGUK","target":"record","payload":{"canonical_record":{"source":{"id":"1105.1894","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-05-10T09:51:05Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"59a893f6a71f383cb4ded6b2681b2699661932b2ded2b59d8a7de6426f25584b","abstract_canon_sha256":"2cdd67ce5767778b37b9d77e322fbb067647036c85a467da67c2827ab63cdd4f"},"schema_version":"1.0"},"canonical_sha256":"52b889c06ccac3dfc4d37dd7b7cea6a29365d705cff8ded5a48fe7d4e0409e1f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:00:26.788255Z","signature_b64":"3NxEcnvucHA66JKMfHxC8spAOKiXezm7ECabzweL+2ygwa4blnxPgS5Dchgx5upUMXq5TBpn5pso3O8FrJw3BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"52b889c06ccac3dfc4d37dd7b7cea6a29365d705cff8ded5a48fe7d4e0409e1f","last_reissued_at":"2026-05-18T04:00:26.787537Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:00:26.787537Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1105.1894","source_version":2,"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-18T04:00:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J4Mh2iOQ2M8EWDLTHiQm+WS1tPCBeRlbpStH3JaTCPLcdOpvqjFdgiN4T+JV5O8+Sv82XK2Zr2ljJVoudumLCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T08:40:06.983337Z"},"content_sha256":"483493dc53614d9cca35d9473733424519e5845e88285100c5056cab97cd816a","schema_version":"1.0","event_id":"sha256:483493dc53614d9cca35d9473733424519e5845e88285100c5056cab97cd816a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:KK4ITQDMZLB57RGTPXL3PTVGUK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Decoding Cyclic Codes up to a New Bound on the Minimum Distance","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alexander Zeh, Antonia Wachter, Sergey Bezzateev","submitted_at":"2011-05-10T09:51:05Z","abstract_excerpt":"A new lower bound on the minimum distance of q-ary cyclic codes is proposed. This bound improves upon the Bose-Chaudhuri-Hocquenghem (BCH) bound and, for some codes, upon the Hartmann-Tzeng (HT) bound. Several Boston bounds are special cases of our bound. For some classes of codes the bound on the minimum distance is refined. Furthermore, a quadratic-time decoding algorithm up to this new bound is developed. The determination of the error locations is based on the Euclidean Algorithm and a modified Chien search. The error evaluation is done by solving a generalization of Forney's formula."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.1894","kind":"arxiv","version":2},"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-18T04:00:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fT271+IS5gqhFC0ZZs5nmS26Tj2G8DSctJGCTKk5F1sjFka1U0TDPiMN2hGpUGY8rmTpO8EtLycdG6VZ7GCDAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T08:40:06.983687Z"},"content_sha256":"e213b463e6b629478539df3f482bd154e7bcb380b67e12e4553b2795cb4f7858","schema_version":"1.0","event_id":"sha256:e213b463e6b629478539df3f482bd154e7bcb380b67e12e4553b2795cb4f7858"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KK4ITQDMZLB57RGTPXL3PTVGUK/bundle.json","state_url":"https://pith.science/pith/KK4ITQDMZLB57RGTPXL3PTVGUK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KK4ITQDMZLB57RGTPXL3PTVGUK/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-21T08:40:06Z","links":{"resolver":"https://pith.science/pith/KK4ITQDMZLB57RGTPXL3PTVGUK","bundle":"https://pith.science/pith/KK4ITQDMZLB57RGTPXL3PTVGUK/bundle.json","state":"https://pith.science/pith/KK4ITQDMZLB57RGTPXL3PTVGUK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KK4ITQDMZLB57RGTPXL3PTVGUK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:KK4ITQDMZLB57RGTPXL3PTVGUK","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":"2cdd67ce5767778b37b9d77e322fbb067647036c85a467da67c2827ab63cdd4f","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-05-10T09:51:05Z","title_canon_sha256":"59a893f6a71f383cb4ded6b2681b2699661932b2ded2b59d8a7de6426f25584b"},"schema_version":"1.0","source":{"id":"1105.1894","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1105.1894","created_at":"2026-05-18T04:00:26Z"},{"alias_kind":"arxiv_version","alias_value":"1105.1894v2","created_at":"2026-05-18T04:00:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.1894","created_at":"2026-05-18T04:00:26Z"},{"alias_kind":"pith_short_12","alias_value":"KK4ITQDMZLB5","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_16","alias_value":"KK4ITQDMZLB57RGT","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_8","alias_value":"KK4ITQDM","created_at":"2026-05-18T12:26:32Z"}],"graph_snapshots":[{"event_id":"sha256:e213b463e6b629478539df3f482bd154e7bcb380b67e12e4553b2795cb4f7858","target":"graph","created_at":"2026-05-18T04:00:26Z","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":"A new lower bound on the minimum distance of q-ary cyclic codes is proposed. This bound improves upon the Bose-Chaudhuri-Hocquenghem (BCH) bound and, for some codes, upon the Hartmann-Tzeng (HT) bound. Several Boston bounds are special cases of our bound. For some classes of codes the bound on the minimum distance is refined. Furthermore, a quadratic-time decoding algorithm up to this new bound is developed. The determination of the error locations is based on the Euclidean Algorithm and a modified Chien search. The error evaluation is done by solving a generalization of Forney's formula.","authors_text":"Alexander Zeh, Antonia Wachter, Sergey Bezzateev","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-05-10T09:51:05Z","title":"Decoding Cyclic Codes up to a New Bound on the Minimum Distance"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.1894","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:483493dc53614d9cca35d9473733424519e5845e88285100c5056cab97cd816a","target":"record","created_at":"2026-05-18T04:00:26Z","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":"2cdd67ce5767778b37b9d77e322fbb067647036c85a467da67c2827ab63cdd4f","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-05-10T09:51:05Z","title_canon_sha256":"59a893f6a71f383cb4ded6b2681b2699661932b2ded2b59d8a7de6426f25584b"},"schema_version":"1.0","source":{"id":"1105.1894","kind":"arxiv","version":2}},"canonical_sha256":"52b889c06ccac3dfc4d37dd7b7cea6a29365d705cff8ded5a48fe7d4e0409e1f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"52b889c06ccac3dfc4d37dd7b7cea6a29365d705cff8ded5a48fe7d4e0409e1f","first_computed_at":"2026-05-18T04:00:26.787537Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:00:26.787537Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3NxEcnvucHA66JKMfHxC8spAOKiXezm7ECabzweL+2ygwa4blnxPgS5Dchgx5upUMXq5TBpn5pso3O8FrJw3BA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:00:26.788255Z","signed_message":"canonical_sha256_bytes"},"source_id":"1105.1894","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:483493dc53614d9cca35d9473733424519e5845e88285100c5056cab97cd816a","sha256:e213b463e6b629478539df3f482bd154e7bcb380b67e12e4553b2795cb4f7858"],"state_sha256":"b39a560245a93adc1e7563a83fddb5584c22863758b242b5c75f2363d7a5dd59"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3gZ3bvYcPJSV4yigEX68KrKkj6SmjCdPXSnDENA6NNIWG/dQIM/lE/V9WIfZEc8Faaj7/D9NU7zeSZ/sbNmQAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-21T08:40:06.985638Z","bundle_sha256":"2d4a48c5048f2760ada1865135837e1a2dd6212266656b1bef403ce052519083"}}