{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:OVY32LO6URETPWSXHTCCJQ2VCO","short_pith_number":"pith:OVY32LO6","canonical_record":{"source":{"id":"1603.07009","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-03-22T22:12:37Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"1eec86b06df8179a54ada77d0bef776e00f9cc8d375057a29c84a8e65b5c41cf","abstract_canon_sha256":"a223e866066bed1c90e73ee929067f597bc89c1070fe3ee2468b58c2fa4d68ca"},"schema_version":"1.0"},"canonical_sha256":"7571bd2ddea44937da573cc424c35513b43d6ec63dc717a2f3114796aaa4459d","source":{"kind":"arxiv","id":"1603.07009","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.07009","created_at":"2026-05-18T01:00:45Z"},{"alias_kind":"arxiv_version","alias_value":"1603.07009v2","created_at":"2026-05-18T01:00:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.07009","created_at":"2026-05-18T01:00:45Z"},{"alias_kind":"pith_short_12","alias_value":"OVY32LO6URET","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"OVY32LO6URETPWSX","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"OVY32LO6","created_at":"2026-05-18T12:30:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:OVY32LO6URETPWSXHTCCJQ2VCO","target":"record","payload":{"canonical_record":{"source":{"id":"1603.07009","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-03-22T22:12:37Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"1eec86b06df8179a54ada77d0bef776e00f9cc8d375057a29c84a8e65b5c41cf","abstract_canon_sha256":"a223e866066bed1c90e73ee929067f597bc89c1070fe3ee2468b58c2fa4d68ca"},"schema_version":"1.0"},"canonical_sha256":"7571bd2ddea44937da573cc424c35513b43d6ec63dc717a2f3114796aaa4459d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:00:45.813564Z","signature_b64":"ETPcKNEkQI/Mg+q51aHr/qzrR+Z48sq+w4X1NoLwQ3N+oHerWwHr2hDGgV7RnE8mHfhXdhl+QSWO6eh2AibEAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7571bd2ddea44937da573cc424c35513b43d6ec63dc717a2f3114796aaa4459d","last_reissued_at":"2026-05-18T01:00:45.813150Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:00:45.813150Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1603.07009","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-18T01:00:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZONZyDLQE7XxrOjboeyy4coAvnmfFG+yodzpClJvibaSCtdzdz7rcLM7LLQQic2yyLpXnblGmLRU7Lo2YB9tAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T23:28:03.120103Z"},"content_sha256":"be43fb47b37ce08c692cb998635aeb4649a1616cd6734e3f2e677ee55de32bf8","schema_version":"1.0","event_id":"sha256:be43fb47b37ce08c692cb998635aeb4649a1616cd6734e3f2e677ee55de32bf8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:OVY32LO6URETPWSXHTCCJQ2VCO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Narrow-Sense BCH Codes over $\\gf(q)$ with Length $n=\\frac{q^m-1}{q-1}$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Cunsheng Ding, Gennian Ge, Maosheng Xiong, Shuxing Li","submitted_at":"2016-03-22T22:12:37Z","abstract_excerpt":"Cyclic codes over finite fields are widely employed in communication systems, storage devices and consumer electronics, as they have efficient encoding and decoding algorithms. BCH codes, as a special subclass of cyclic codes, are in most cases among the best cyclic codes. A subclass of good BCH codes are the narrow-sense BCH codes over $\\gf(q)$ with length $n=(q^m-1)/(q-1)$. Little is known about this class of BCH codes when $q>2$. The objective of this paper is to study some of the codes within this class. In particular, the dimension, the minimum distance, and the weight distribution of som"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.07009","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-18T01:00:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P6VkHm8f8niC4M70RBSsKEUisZtGyPmsyg/eZfMHAsY1h1eSVrD1m1LKcfLuiaPA09LsDlEs0nEycF1iiPWjCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T23:28:03.120757Z"},"content_sha256":"ce5fcb17271042d0b15f9234abbec620bdf817bed4b21bdfdcb832623ab3249e","schema_version":"1.0","event_id":"sha256:ce5fcb17271042d0b15f9234abbec620bdf817bed4b21bdfdcb832623ab3249e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OVY32LO6URETPWSXHTCCJQ2VCO/bundle.json","state_url":"https://pith.science/pith/OVY32LO6URETPWSXHTCCJQ2VCO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OVY32LO6URETPWSXHTCCJQ2VCO/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-25T23:28:03Z","links":{"resolver":"https://pith.science/pith/OVY32LO6URETPWSXHTCCJQ2VCO","bundle":"https://pith.science/pith/OVY32LO6URETPWSXHTCCJQ2VCO/bundle.json","state":"https://pith.science/pith/OVY32LO6URETPWSXHTCCJQ2VCO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OVY32LO6URETPWSXHTCCJQ2VCO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:OVY32LO6URETPWSXHTCCJQ2VCO","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":"a223e866066bed1c90e73ee929067f597bc89c1070fe3ee2468b58c2fa4d68ca","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-03-22T22:12:37Z","title_canon_sha256":"1eec86b06df8179a54ada77d0bef776e00f9cc8d375057a29c84a8e65b5c41cf"},"schema_version":"1.0","source":{"id":"1603.07009","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.07009","created_at":"2026-05-18T01:00:45Z"},{"alias_kind":"arxiv_version","alias_value":"1603.07009v2","created_at":"2026-05-18T01:00:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.07009","created_at":"2026-05-18T01:00:45Z"},{"alias_kind":"pith_short_12","alias_value":"OVY32LO6URET","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"OVY32LO6URETPWSX","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"OVY32LO6","created_at":"2026-05-18T12:30:36Z"}],"graph_snapshots":[{"event_id":"sha256:ce5fcb17271042d0b15f9234abbec620bdf817bed4b21bdfdcb832623ab3249e","target":"graph","created_at":"2026-05-18T01:00: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":"Cyclic codes over finite fields are widely employed in communication systems, storage devices and consumer electronics, as they have efficient encoding and decoding algorithms. BCH codes, as a special subclass of cyclic codes, are in most cases among the best cyclic codes. A subclass of good BCH codes are the narrow-sense BCH codes over $\\gf(q)$ with length $n=(q^m-1)/(q-1)$. Little is known about this class of BCH codes when $q>2$. The objective of this paper is to study some of the codes within this class. In particular, the dimension, the minimum distance, and the weight distribution of som","authors_text":"Cunsheng Ding, Gennian Ge, Maosheng Xiong, Shuxing Li","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-03-22T22:12:37Z","title":"Narrow-Sense BCH Codes over $\\gf(q)$ with Length $n=\\frac{q^m-1}{q-1}$"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.07009","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:be43fb47b37ce08c692cb998635aeb4649a1616cd6734e3f2e677ee55de32bf8","target":"record","created_at":"2026-05-18T01:00: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":"a223e866066bed1c90e73ee929067f597bc89c1070fe3ee2468b58c2fa4d68ca","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-03-22T22:12:37Z","title_canon_sha256":"1eec86b06df8179a54ada77d0bef776e00f9cc8d375057a29c84a8e65b5c41cf"},"schema_version":"1.0","source":{"id":"1603.07009","kind":"arxiv","version":2}},"canonical_sha256":"7571bd2ddea44937da573cc424c35513b43d6ec63dc717a2f3114796aaa4459d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7571bd2ddea44937da573cc424c35513b43d6ec63dc717a2f3114796aaa4459d","first_computed_at":"2026-05-18T01:00:45.813150Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:00:45.813150Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ETPcKNEkQI/Mg+q51aHr/qzrR+Z48sq+w4X1NoLwQ3N+oHerWwHr2hDGgV7RnE8mHfhXdhl+QSWO6eh2AibEAA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:00:45.813564Z","signed_message":"canonical_sha256_bytes"},"source_id":"1603.07009","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:be43fb47b37ce08c692cb998635aeb4649a1616cd6734e3f2e677ee55de32bf8","sha256:ce5fcb17271042d0b15f9234abbec620bdf817bed4b21bdfdcb832623ab3249e"],"state_sha256":"b1cfc64244b8113c5d8ef94f0d4a94ff35dd05bd512773017db32af55d6c96d3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yJ79/E3nIhPI9q16mPSr2LeucesMkszc/xQFMIcLMQfKKEI3JprhWToH1VC0XXQg9S7j57XmJBnG6wMzkeWwBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T23:28:03.124966Z","bundle_sha256":"abb12a567104250cb66583c3b1c24d9c6c4b2cc353fac7f97836164230815fdf"}}