{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:SZ5CIPQS4JVDXXBQIWSKXTONUV","short_pith_number":"pith:SZ5CIPQS","canonical_record":{"source":{"id":"1810.04367","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-10-10T04:25:39Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"9c7de0e0f29c69c1f4fc6aa6acc0140aadda9b4d3331c814b3bd5639d09387c3","abstract_canon_sha256":"701459131ef0cdb9ef1b48e5d1b177805cc3ce11ede6661726d80fbe701fe7e6"},"schema_version":"1.0"},"canonical_sha256":"967a243e12e26a3bdc3045a4abcdcda54b330b4d8f50626370f3810a50c23576","source":{"kind":"arxiv","id":"1810.04367","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.04367","created_at":"2026-05-18T00:03:40Z"},{"alias_kind":"arxiv_version","alias_value":"1810.04367v1","created_at":"2026-05-18T00:03:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.04367","created_at":"2026-05-18T00:03:40Z"},{"alias_kind":"pith_short_12","alias_value":"SZ5CIPQS4JVD","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_16","alias_value":"SZ5CIPQS4JVDXXBQ","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_8","alias_value":"SZ5CIPQS","created_at":"2026-05-18T12:32:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:SZ5CIPQS4JVDXXBQIWSKXTONUV","target":"record","payload":{"canonical_record":{"source":{"id":"1810.04367","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-10-10T04:25:39Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"9c7de0e0f29c69c1f4fc6aa6acc0140aadda9b4d3331c814b3bd5639d09387c3","abstract_canon_sha256":"701459131ef0cdb9ef1b48e5d1b177805cc3ce11ede6661726d80fbe701fe7e6"},"schema_version":"1.0"},"canonical_sha256":"967a243e12e26a3bdc3045a4abcdcda54b330b4d8f50626370f3810a50c23576","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:03:40.330836Z","signature_b64":"jnEycVVpzDMdYlkpdtGn1PSwADgDTCKaLfVWZ7RGqfCZNk+fdG4DQ7+PPSgYMzzjg7Eo96vokJq1lj/C2JXbCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"967a243e12e26a3bdc3045a4abcdcda54b330b4d8f50626370f3810a50c23576","last_reissued_at":"2026-05-18T00:03:40.330397Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:03:40.330397Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1810.04367","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:03:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pSIPP+PhfA06Yj0K8hdNOH2A9ATZqvAM60nD0DJrINE1grWgpF3vhIKSPRcU1RcOcymV50BFyVtBoBVO5rK0Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T04:01:29.704146Z"},"content_sha256":"a30493b9996d5b21f9d4672f2f23986e3afb3c6aca3f264082a45801353aa78c","schema_version":"1.0","event_id":"sha256:a30493b9996d5b21f9d4672f2f23986e3afb3c6aca3f264082a45801353aa78c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:SZ5CIPQS4JVDXXBQIWSKXTONUV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On components of a Kerdock code and the dual of the BCH code $C_{1,3}$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"math.CO","authors_text":"F. I. Solov'eva, I. Yu. Mogilnykh","submitted_at":"2018-10-10T04:25:39Z","abstract_excerpt":"In the paper we investigate the structure of $i$-components of two classes of codes: Kerdock codes and the duals of the primitive cyclic BCH code with designed distance 5 of length $n=2^m-1$, for odd $m$. We prove that for any admissible length a punctured Kerdock code consists of two $i$-components and the dual of BCH code is a $i$-component for any $i$. We give an alternative proof for the fact presented by De Caen and van Dam in 1999 that the restriction of the Hamming scheme to a doubly shortened Kerdock code is an association scheme."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.04367","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:03:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RFDtamVsrnXSm28ApDLnPK/TC7UX6I0905S3bD+Yo5HZxyAnDwIbqdhXiWB2GuV14khNqba4t9KuIrohk/fDDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T04:01:29.704916Z"},"content_sha256":"e681a309f04a8d2852ba77ef4c14aa69d2f2089b815abb80735ebbb801a0a656","schema_version":"1.0","event_id":"sha256:e681a309f04a8d2852ba77ef4c14aa69d2f2089b815abb80735ebbb801a0a656"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SZ5CIPQS4JVDXXBQIWSKXTONUV/bundle.json","state_url":"https://pith.science/pith/SZ5CIPQS4JVDXXBQIWSKXTONUV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SZ5CIPQS4JVDXXBQIWSKXTONUV/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-09T04:01:29Z","links":{"resolver":"https://pith.science/pith/SZ5CIPQS4JVDXXBQIWSKXTONUV","bundle":"https://pith.science/pith/SZ5CIPQS4JVDXXBQIWSKXTONUV/bundle.json","state":"https://pith.science/pith/SZ5CIPQS4JVDXXBQIWSKXTONUV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SZ5CIPQS4JVDXXBQIWSKXTONUV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:SZ5CIPQS4JVDXXBQIWSKXTONUV","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":"701459131ef0cdb9ef1b48e5d1b177805cc3ce11ede6661726d80fbe701fe7e6","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-10-10T04:25:39Z","title_canon_sha256":"9c7de0e0f29c69c1f4fc6aa6acc0140aadda9b4d3331c814b3bd5639d09387c3"},"schema_version":"1.0","source":{"id":"1810.04367","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.04367","created_at":"2026-05-18T00:03:40Z"},{"alias_kind":"arxiv_version","alias_value":"1810.04367v1","created_at":"2026-05-18T00:03:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.04367","created_at":"2026-05-18T00:03:40Z"},{"alias_kind":"pith_short_12","alias_value":"SZ5CIPQS4JVD","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_16","alias_value":"SZ5CIPQS4JVDXXBQ","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_8","alias_value":"SZ5CIPQS","created_at":"2026-05-18T12:32:53Z"}],"graph_snapshots":[{"event_id":"sha256:e681a309f04a8d2852ba77ef4c14aa69d2f2089b815abb80735ebbb801a0a656","target":"graph","created_at":"2026-05-18T00:03:40Z","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 the paper we investigate the structure of $i$-components of two classes of codes: Kerdock codes and the duals of the primitive cyclic BCH code with designed distance 5 of length $n=2^m-1$, for odd $m$. We prove that for any admissible length a punctured Kerdock code consists of two $i$-components and the dual of BCH code is a $i$-component for any $i$. We give an alternative proof for the fact presented by De Caen and van Dam in 1999 that the restriction of the Hamming scheme to a doubly shortened Kerdock code is an association scheme.","authors_text":"F. I. Solov'eva, I. Yu. Mogilnykh","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-10-10T04:25:39Z","title":"On components of a Kerdock code and the dual of the BCH code $C_{1,3}$"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.04367","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:a30493b9996d5b21f9d4672f2f23986e3afb3c6aca3f264082a45801353aa78c","target":"record","created_at":"2026-05-18T00:03:40Z","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":"701459131ef0cdb9ef1b48e5d1b177805cc3ce11ede6661726d80fbe701fe7e6","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-10-10T04:25:39Z","title_canon_sha256":"9c7de0e0f29c69c1f4fc6aa6acc0140aadda9b4d3331c814b3bd5639d09387c3"},"schema_version":"1.0","source":{"id":"1810.04367","kind":"arxiv","version":1}},"canonical_sha256":"967a243e12e26a3bdc3045a4abcdcda54b330b4d8f50626370f3810a50c23576","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"967a243e12e26a3bdc3045a4abcdcda54b330b4d8f50626370f3810a50c23576","first_computed_at":"2026-05-18T00:03:40.330397Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:03:40.330397Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jnEycVVpzDMdYlkpdtGn1PSwADgDTCKaLfVWZ7RGqfCZNk+fdG4DQ7+PPSgYMzzjg7Eo96vokJq1lj/C2JXbCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:03:40.330836Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.04367","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a30493b9996d5b21f9d4672f2f23986e3afb3c6aca3f264082a45801353aa78c","sha256:e681a309f04a8d2852ba77ef4c14aa69d2f2089b815abb80735ebbb801a0a656"],"state_sha256":"2fd846fb73da35be9a13639389866cb6ff2e57f59eab3d910744cc5cde36256e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZkHXqR0OA21rJBsO01sRchv7Knq2e7TEc1juX1OQwNHdhXnxNkvhxEbwWXaQlpIlJu1guPkb0XnkGnuMYCT/Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T04:01:29.708743Z","bundle_sha256":"108e4c37bf497803074056c2a28587f0e760489c2bc705c99cc57f50a00d29ca"}}