{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:HVID6OI7PVLAELGGCUXTRZ2IU2","short_pith_number":"pith:HVID6OI7","canonical_record":{"source":{"id":"1406.5797","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-06-23T02:32:52Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"8cfa2e2636f88671f135eb5002aa340e80e0b9d19d58d916f949e0390a1a4957","abstract_canon_sha256":"359ac963b9da19de3a239d6cdf62ee4a9129bcac4d0653eaf1ff15a834bae526"},"schema_version":"1.0"},"canonical_sha256":"3d503f391f7d56022cc6152f38e748a68b3d66ee6ed912ae7bb965e7b1d12d71","source":{"kind":"arxiv","id":"1406.5797","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.5797","created_at":"2026-05-18T02:49:10Z"},{"alias_kind":"arxiv_version","alias_value":"1406.5797v1","created_at":"2026-05-18T02:49:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.5797","created_at":"2026-05-18T02:49:10Z"},{"alias_kind":"pith_short_12","alias_value":"HVID6OI7PVLA","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"HVID6OI7PVLAELGG","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"HVID6OI7","created_at":"2026-05-18T12:28:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:HVID6OI7PVLAELGGCUXTRZ2IU2","target":"record","payload":{"canonical_record":{"source":{"id":"1406.5797","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-06-23T02:32:52Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"8cfa2e2636f88671f135eb5002aa340e80e0b9d19d58d916f949e0390a1a4957","abstract_canon_sha256":"359ac963b9da19de3a239d6cdf62ee4a9129bcac4d0653eaf1ff15a834bae526"},"schema_version":"1.0"},"canonical_sha256":"3d503f391f7d56022cc6152f38e748a68b3d66ee6ed912ae7bb965e7b1d12d71","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:49:10.734789Z","signature_b64":"iBqsLG162T/5v/teJVL0JCYxWMStTH+flzQKqoM6jj9967Faipga+EyGcz2ljOrMbAV9TD9dCsiUTVdEl85KAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3d503f391f7d56022cc6152f38e748a68b3d66ee6ed912ae7bb965e7b1d12d71","last_reissued_at":"2026-05-18T02:49:10.734357Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:49:10.734357Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1406.5797","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-18T02:49:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/ttOOpA6ef7SpynXoCZbU303PC6U1yoJzO1P0jqA7U8Eb1FCcKW8VWnLUKAseE/dQn5Mvbuh9Qn/E1e6Oz+uDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T18:58:25.593780Z"},"content_sha256":"b00170419e8f75db519c23796f5c9f31ea99348206c945549977890d5d0dbd69","schema_version":"1.0","event_id":"sha256:b00170419e8f75db519c23796f5c9f31ea99348206c945549977890d5d0dbd69"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:HVID6OI7PVLAELGGCUXTRZ2IU2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Constructions of A Large Class of Optimum Constant Weight Codes over F_2","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Masao Kasahara, Shigeichi Hirasawa","submitted_at":"2014-06-23T02:32:52Z","abstract_excerpt":"A new method of constructing optimum constant weight codes over F_2 based on a generalized $(u, u+v)$ construction is presented. We present a new method of constructing superimposed code $C_{(s_1,s_2,\\cdots,s_I)}^{(h_1, h_2, \\cdots, h_I)}$ bound. and presented a large class of optimum constant weight codes over F_2 that meet the bound due to Brouwer and Verhoeff, which will be referred to as BV . We present large classes of optimum constant weight codes over F_2 for $k=2$ and $k=3$ for $n \\leqq 128$. We also present optimum constant weight codes over F_2 that meet the BV bound for $k=2,3,4,5$ "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.5797","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-18T02:49:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CHD4NeWB4qsmksnf8qpbe6WbpDWMZUtd3U3lrGqLEveKxBz8Gm4HjmubDhVygf/79TrUONdqavnHVjJUgCodAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T18:58:25.594118Z"},"content_sha256":"1c163434215842e26805a1d1229a5b580240ab4d7bc7cf92043c15a2c78ed2d2","schema_version":"1.0","event_id":"sha256:1c163434215842e26805a1d1229a5b580240ab4d7bc7cf92043c15a2c78ed2d2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HVID6OI7PVLAELGGCUXTRZ2IU2/bundle.json","state_url":"https://pith.science/pith/HVID6OI7PVLAELGGCUXTRZ2IU2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HVID6OI7PVLAELGGCUXTRZ2IU2/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-24T18:58:25Z","links":{"resolver":"https://pith.science/pith/HVID6OI7PVLAELGGCUXTRZ2IU2","bundle":"https://pith.science/pith/HVID6OI7PVLAELGGCUXTRZ2IU2/bundle.json","state":"https://pith.science/pith/HVID6OI7PVLAELGGCUXTRZ2IU2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HVID6OI7PVLAELGGCUXTRZ2IU2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:HVID6OI7PVLAELGGCUXTRZ2IU2","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":"359ac963b9da19de3a239d6cdf62ee4a9129bcac4d0653eaf1ff15a834bae526","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-06-23T02:32:52Z","title_canon_sha256":"8cfa2e2636f88671f135eb5002aa340e80e0b9d19d58d916f949e0390a1a4957"},"schema_version":"1.0","source":{"id":"1406.5797","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.5797","created_at":"2026-05-18T02:49:10Z"},{"alias_kind":"arxiv_version","alias_value":"1406.5797v1","created_at":"2026-05-18T02:49:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.5797","created_at":"2026-05-18T02:49:10Z"},{"alias_kind":"pith_short_12","alias_value":"HVID6OI7PVLA","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"HVID6OI7PVLAELGG","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"HVID6OI7","created_at":"2026-05-18T12:28:30Z"}],"graph_snapshots":[{"event_id":"sha256:1c163434215842e26805a1d1229a5b580240ab4d7bc7cf92043c15a2c78ed2d2","target":"graph","created_at":"2026-05-18T02:49:10Z","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 method of constructing optimum constant weight codes over F_2 based on a generalized $(u, u+v)$ construction is presented. We present a new method of constructing superimposed code $C_{(s_1,s_2,\\cdots,s_I)}^{(h_1, h_2, \\cdots, h_I)}$ bound. and presented a large class of optimum constant weight codes over F_2 that meet the bound due to Brouwer and Verhoeff, which will be referred to as BV . We present large classes of optimum constant weight codes over F_2 for $k=2$ and $k=3$ for $n \\leqq 128$. We also present optimum constant weight codes over F_2 that meet the BV bound for $k=2,3,4,5$ ","authors_text":"Masao Kasahara, Shigeichi Hirasawa","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-06-23T02:32:52Z","title":"Constructions of A Large Class of Optimum Constant Weight Codes over F_2"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.5797","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:b00170419e8f75db519c23796f5c9f31ea99348206c945549977890d5d0dbd69","target":"record","created_at":"2026-05-18T02:49:10Z","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":"359ac963b9da19de3a239d6cdf62ee4a9129bcac4d0653eaf1ff15a834bae526","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-06-23T02:32:52Z","title_canon_sha256":"8cfa2e2636f88671f135eb5002aa340e80e0b9d19d58d916f949e0390a1a4957"},"schema_version":"1.0","source":{"id":"1406.5797","kind":"arxiv","version":1}},"canonical_sha256":"3d503f391f7d56022cc6152f38e748a68b3d66ee6ed912ae7bb965e7b1d12d71","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3d503f391f7d56022cc6152f38e748a68b3d66ee6ed912ae7bb965e7b1d12d71","first_computed_at":"2026-05-18T02:49:10.734357Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:49:10.734357Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iBqsLG162T/5v/teJVL0JCYxWMStTH+flzQKqoM6jj9967Faipga+EyGcz2ljOrMbAV9TD9dCsiUTVdEl85KAg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:49:10.734789Z","signed_message":"canonical_sha256_bytes"},"source_id":"1406.5797","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b00170419e8f75db519c23796f5c9f31ea99348206c945549977890d5d0dbd69","sha256:1c163434215842e26805a1d1229a5b580240ab4d7bc7cf92043c15a2c78ed2d2"],"state_sha256":"bc9f461c0a9255fa7ebd4a19b91b205fa2344c312a199f08fc572265827f8184"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kkoriJXbsIfWy7ZWMukM9QHL+djGvIshahOhpn2m2UfB/L+3IFiNBnFdPV8u5gxn4RKQ2+OSOvBkjCR5pjHyCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T18:58:25.595997Z","bundle_sha256":"14883be461ce7fd85b35ef01fd30ab21d2b5b45fd4eda59c8b4381cd3f43b66d"}}