{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:KHXGQ5P2YXMMHCYLKUTRZOV3PR","short_pith_number":"pith:KHXGQ5P2","canonical_record":{"source":{"id":"2607.28741","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2026-07-30T18:01:50Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"a3385f5e373b6691c8b8fa4ebeb34a6416bd59a12c1233ca03071b3a446aa7ff","abstract_canon_sha256":"aef7456cf5789c81387bbc655d274362b1e732da43423dd4b134fd5f16c003ff"},"schema_version":"1.0"},"canonical_sha256":"51ee6875fac5d8c38b0b55271cbabb7c54faacd5e76dd75c954717b328316920","source":{"kind":"arxiv","id":"2607.28741","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.28741","created_at":"2026-08-03T00:12:32Z"},{"alias_kind":"arxiv_version","alias_value":"2607.28741v1","created_at":"2026-08-03T00:12:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.28741","created_at":"2026-08-03T00:12:32Z"},{"alias_kind":"pith_short_12","alias_value":"KHXGQ5P2YXMM","created_at":"2026-08-03T00:12:32Z"},{"alias_kind":"pith_short_16","alias_value":"KHXGQ5P2YXMMHCYL","created_at":"2026-08-03T00:12:32Z"},{"alias_kind":"pith_short_8","alias_value":"KHXGQ5P2","created_at":"2026-08-03T00:12:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:KHXGQ5P2YXMMHCYLKUTRZOV3PR","target":"record","payload":{"canonical_record":{"source":{"id":"2607.28741","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2026-07-30T18:01:50Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"a3385f5e373b6691c8b8fa4ebeb34a6416bd59a12c1233ca03071b3a446aa7ff","abstract_canon_sha256":"aef7456cf5789c81387bbc655d274362b1e732da43423dd4b134fd5f16c003ff"},"schema_version":"1.0"},"canonical_sha256":"51ee6875fac5d8c38b0b55271cbabb7c54faacd5e76dd75c954717b328316920","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-03T00:12:32.578760Z","signature_b64":"BYgcuc+iRVrxRWsycz5dydAK8lPzJ4GNSe04v3gOQCodgWaJyACDmVdnedNfXtQlDFSIm4eYWs2sX76BDBfcBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"51ee6875fac5d8c38b0b55271cbabb7c54faacd5e76dd75c954717b328316920","last_reissued_at":"2026-08-03T00:12:32.576417Z","signature_status":"signed_v1","first_computed_at":"2026-08-03T00:12:32.576417Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2607.28741","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-08-03T00:12:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ys9FRJedgb3z7CpCAMsTz9Tcgmgy6x4qTRiYzpHCgOQU/Pix2jWemzVq98C5EgaJf6jV4mg9dfPDw2BJPU6OAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T16:29:44.953587Z"},"content_sha256":"9a69eb177b7eb38d234758becaf8e7f9b11d4100e683a131f86dc0188ca7c716","schema_version":"1.0","event_id":"sha256:9a69eb177b7eb38d234758becaf8e7f9b11d4100e683a131f86dc0188ca7c716"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:KHXGQ5P2YXMMHCYLKUTRZOV3PR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Counterexamples to Charpin's Conjecture on BCH codes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Maosheng Xiong, Run Zheng, Yaoran Yang, Yutong Zhang","submitted_at":"2026-07-30T18:01:50Z","abstract_excerpt":"Determining the exact minimum distance of BCH codes is a longstanding and challenging problem. In this paper, we construct an infinite family of primitive narrow-sense BCH codes whose minimum distance strictly exceeds their Bose distance. Let $q$ be a prime power, let $m$ be an integer with $m \\geq 10$ and $m \\neq 12$, and set $u = \\lfloor m/4 \\rfloor$ and $t = \\lfloor (m-1)/3 \\rfloor$. For each integer $s$ with $u \\leq s < t$, we define$$\\delta = q^m - q^{m-1} - q^{m-1-u} - q^s - 1.$$We prove that the primitive narrow-sense BCH code with designed distance $\\delta$ has Bose distance $\\delta$ a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.28741","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2607.28741/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-08-03T00:12:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w0EAGDuxO9/pv6Itk5QqPgFUxHn/jRRui4ck0XapaksSyjdrPd4mAmbS3nR4+lPZ9ELHdP1xp1cE0jQXSxLGCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T16:29:44.954101Z"},"content_sha256":"3d67bbcad55753fc12e3a8a9cfe7e7fe9027b22116fafe481e2d22e99de3aa22","schema_version":"1.0","event_id":"sha256:3d67bbcad55753fc12e3a8a9cfe7e7fe9027b22116fafe481e2d22e99de3aa22"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KHXGQ5P2YXMMHCYLKUTRZOV3PR/bundle.json","state_url":"https://pith.science/pith/KHXGQ5P2YXMMHCYLKUTRZOV3PR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KHXGQ5P2YXMMHCYLKUTRZOV3PR/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-08-12T16:29:44Z","links":{"resolver":"https://pith.science/pith/KHXGQ5P2YXMMHCYLKUTRZOV3PR","bundle":"https://pith.science/pith/KHXGQ5P2YXMMHCYLKUTRZOV3PR/bundle.json","state":"https://pith.science/pith/KHXGQ5P2YXMMHCYLKUTRZOV3PR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KHXGQ5P2YXMMHCYLKUTRZOV3PR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:KHXGQ5P2YXMMHCYLKUTRZOV3PR","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":"aef7456cf5789c81387bbc655d274362b1e732da43423dd4b134fd5f16c003ff","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2026-07-30T18:01:50Z","title_canon_sha256":"a3385f5e373b6691c8b8fa4ebeb34a6416bd59a12c1233ca03071b3a446aa7ff"},"schema_version":"1.0","source":{"id":"2607.28741","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.28741","created_at":"2026-08-03T00:12:32Z"},{"alias_kind":"arxiv_version","alias_value":"2607.28741v1","created_at":"2026-08-03T00:12:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.28741","created_at":"2026-08-03T00:12:32Z"},{"alias_kind":"pith_short_12","alias_value":"KHXGQ5P2YXMM","created_at":"2026-08-03T00:12:32Z"},{"alias_kind":"pith_short_16","alias_value":"KHXGQ5P2YXMMHCYL","created_at":"2026-08-03T00:12:32Z"},{"alias_kind":"pith_short_8","alias_value":"KHXGQ5P2","created_at":"2026-08-03T00:12:32Z"}],"graph_snapshots":[{"event_id":"sha256:3d67bbcad55753fc12e3a8a9cfe7e7fe9027b22116fafe481e2d22e99de3aa22","target":"graph","created_at":"2026-08-03T00:12:32Z","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/2607.28741/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Determining the exact minimum distance of BCH codes is a longstanding and challenging problem. In this paper, we construct an infinite family of primitive narrow-sense BCH codes whose minimum distance strictly exceeds their Bose distance. Let $q$ be a prime power, let $m$ be an integer with $m \\geq 10$ and $m \\neq 12$, and set $u = \\lfloor m/4 \\rfloor$ and $t = \\lfloor (m-1)/3 \\rfloor$. For each integer $s$ with $u \\leq s < t$, we define$$\\delta = q^m - q^{m-1} - q^{m-1-u} - q^s - 1.$$We prove that the primitive narrow-sense BCH code with designed distance $\\delta$ has Bose distance $\\delta$ a","authors_text":"Maosheng Xiong, Run Zheng, Yaoran Yang, Yutong Zhang","cross_cats":["math.IT"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2026-07-30T18:01:50Z","title":"Counterexamples to Charpin's Conjecture on BCH codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.28741","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:9a69eb177b7eb38d234758becaf8e7f9b11d4100e683a131f86dc0188ca7c716","target":"record","created_at":"2026-08-03T00:12:32Z","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":"aef7456cf5789c81387bbc655d274362b1e732da43423dd4b134fd5f16c003ff","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2026-07-30T18:01:50Z","title_canon_sha256":"a3385f5e373b6691c8b8fa4ebeb34a6416bd59a12c1233ca03071b3a446aa7ff"},"schema_version":"1.0","source":{"id":"2607.28741","kind":"arxiv","version":1}},"canonical_sha256":"51ee6875fac5d8c38b0b55271cbabb7c54faacd5e76dd75c954717b328316920","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"51ee6875fac5d8c38b0b55271cbabb7c54faacd5e76dd75c954717b328316920","first_computed_at":"2026-08-03T00:12:32.576417Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-08-03T00:12:32.576417Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BYgcuc+iRVrxRWsycz5dydAK8lPzJ4GNSe04v3gOQCodgWaJyACDmVdnedNfXtQlDFSIm4eYWs2sX76BDBfcBA==","signature_status":"signed_v1","signed_at":"2026-08-03T00:12:32.578760Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.28741","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9a69eb177b7eb38d234758becaf8e7f9b11d4100e683a131f86dc0188ca7c716","sha256:3d67bbcad55753fc12e3a8a9cfe7e7fe9027b22116fafe481e2d22e99de3aa22"],"state_sha256":"3a67481a345821e631451049982fcf20910ab9f74fc430c2b698971cf521aa9e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FKDOjW7VZV8s3BxU8lMlE10ovN8icBPI7lPEtwkXvsiGALDKdX/McAOLR8Lw2c16pu7BxBEjy2jI+KmBy7ILDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-12T16:29:44.959648Z","bundle_sha256":"f2d39630046d6a3a4cc2a050b6248159bd06957d200ff0aa022c7762517dc154"}}