{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:RQ3673LMXLR34QMB7G7EEGQYDP","short_pith_number":"pith:RQ3673LM","schema_version":"1.0","canonical_sha256":"8c37efed6cbae3be4181f9be421a181be1cbcbe35b651531e01deff8a10e0d85","source":{"kind":"arxiv","id":"1602.07085","version":1},"attestation_state":"computed","paper":{"title":"New extremal binary self-dual codes of length 68 via short kharaghani array over f_2 + uf_2","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"math.CO","authors_text":"Abidin Kaya","submitted_at":"2016-02-23T08:32:12Z","abstract_excerpt":"In this work, new construction methods for self-dual codes are given. The methods use the short Kharaghani array and a variation of it. These are applicable to any commutative Frobenius ring. We apply the constructions over the ring F_2 + uF_2 and self-dual Type I [64, 32, 12]_2-codes with various weight enumerators obtained as Gray images. By the use of an extension theorem for self-dual codes we were able to construct 27 new extremal binary self-dual codes of length 68. The existence of the extremal binary self-dual codes with these weight enumerators was previously unknown."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1602.07085","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-02-23T08:32:12Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"4227494d181eb04a50722f24b74f1a624168555dc9baea94278443695075d0bc","abstract_canon_sha256":"1ba24268b9a99172f1ef72b41e35b50c71b6d888276461dfa4a1691e9f13c01e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:20:07.224808Z","signature_b64":"JiKYjNhaQLaPZoX8McY824TqcYs6mBRztMAWtD//9szCNBZPU+jNC/nScFhwVOhVdDhfrnt/Ow/k0HiDAcs3Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8c37efed6cbae3be4181f9be421a181be1cbcbe35b651531e01deff8a10e0d85","last_reissued_at":"2026-05-18T01:20:07.224207Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:20:07.224207Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"New extremal binary self-dual codes of length 68 via short kharaghani array over f_2 + uf_2","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"math.CO","authors_text":"Abidin Kaya","submitted_at":"2016-02-23T08:32:12Z","abstract_excerpt":"In this work, new construction methods for self-dual codes are given. The methods use the short Kharaghani array and a variation of it. These are applicable to any commutative Frobenius ring. We apply the constructions over the ring F_2 + uF_2 and self-dual Type I [64, 32, 12]_2-codes with various weight enumerators obtained as Gray images. By the use of an extension theorem for self-dual codes we were able to construct 27 new extremal binary self-dual codes of length 68. The existence of the extremal binary self-dual codes with these weight enumerators was previously unknown."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.07085","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1602.07085","created_at":"2026-05-18T01:20:07.224290+00:00"},{"alias_kind":"arxiv_version","alias_value":"1602.07085v1","created_at":"2026-05-18T01:20:07.224290+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.07085","created_at":"2026-05-18T01:20:07.224290+00:00"},{"alias_kind":"pith_short_12","alias_value":"RQ3673LMXLR3","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_16","alias_value":"RQ3673LMXLR34QMB","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_8","alias_value":"RQ3673LM","created_at":"2026-05-18T12:30:41.710351+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RQ3673LMXLR34QMB7G7EEGQYDP","json":"https://pith.science/pith/RQ3673LMXLR34QMB7G7EEGQYDP.json","graph_json":"https://pith.science/api/pith-number/RQ3673LMXLR34QMB7G7EEGQYDP/graph.json","events_json":"https://pith.science/api/pith-number/RQ3673LMXLR34QMB7G7EEGQYDP/events.json","paper":"https://pith.science/paper/RQ3673LM"},"agent_actions":{"view_html":"https://pith.science/pith/RQ3673LMXLR34QMB7G7EEGQYDP","download_json":"https://pith.science/pith/RQ3673LMXLR34QMB7G7EEGQYDP.json","view_paper":"https://pith.science/paper/RQ3673LM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1602.07085&json=true","fetch_graph":"https://pith.science/api/pith-number/RQ3673LMXLR34QMB7G7EEGQYDP/graph.json","fetch_events":"https://pith.science/api/pith-number/RQ3673LMXLR34QMB7G7EEGQYDP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RQ3673LMXLR34QMB7G7EEGQYDP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RQ3673LMXLR34QMB7G7EEGQYDP/action/storage_attestation","attest_author":"https://pith.science/pith/RQ3673LMXLR34QMB7G7EEGQYDP/action/author_attestation","sign_citation":"https://pith.science/pith/RQ3673LMXLR34QMB7G7EEGQYDP/action/citation_signature","submit_replication":"https://pith.science/pith/RQ3673LMXLR34QMB7G7EEGQYDP/action/replication_record"}},"created_at":"2026-05-18T01:20:07.224290+00:00","updated_at":"2026-05-18T01:20:07.224290+00:00"}