{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:7OBPU5SRWPKNIVRVSHAMAZAXQI","short_pith_number":"pith:7OBPU5SR","schema_version":"1.0","canonical_sha256":"fb82fa7651b3d4d4563591c0c06417820f89d6250daf6c118efbe2a42e43cbfb","source":{"kind":"arxiv","id":"1405.7538","version":1},"attestation_state":"computed","paper":{"title":"On the Existence of Certain Optimal Self-Dual Codes with Lengths Between $74$ and $116$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Gennian Ge, Jerod Michel, Tao Feng, Tao Zhang","submitted_at":"2014-05-29T12:40:12Z","abstract_excerpt":"The existence of optimal binary self-dual codes is a long-standing research problem. In this paper, we present some results concerning the decomposition of binary self-dual codes with a dihedral automorphism group $D_{2p}$, where $p$ is a prime. These results are applied to construct new self-dual codes with length $78$ or $116$. We obtain $16$ inequivalent self-dual $[78,39,14]$ codes, four of which have new weight enumerators. We also show that there are at least $141$ inequivalent self-dual $[116,58,18]$ codes, most of which are new up to equivalence. Meanwhile, we give some restrictions on"},"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":"1405.7538","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-05-29T12:40:12Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"ad8b16244f545071512cb4421e40ba2948b1a0fe12b95b552b1ac72601f515be","abstract_canon_sha256":"fe8299bb861047540bf84927479d3b30b072ccdfa45e9cddf7940c1afe3ac3e4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:50:51.029605Z","signature_b64":"LcpDAfCUA0Zhgl9mUvqmaK48ynP1x8AhmFN9DJx0R1eYsWaAHQY6WZisNH9IT7ptpW37zgtzfg9fl3wPTQU3Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fb82fa7651b3d4d4563591c0c06417820f89d6250daf6c118efbe2a42e43cbfb","last_reissued_at":"2026-05-18T02:50:51.029123Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:50:51.029123Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Existence of Certain Optimal Self-Dual Codes with Lengths Between $74$ and $116$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Gennian Ge, Jerod Michel, Tao Feng, Tao Zhang","submitted_at":"2014-05-29T12:40:12Z","abstract_excerpt":"The existence of optimal binary self-dual codes is a long-standing research problem. In this paper, we present some results concerning the decomposition of binary self-dual codes with a dihedral automorphism group $D_{2p}$, where $p$ is a prime. These results are applied to construct new self-dual codes with length $78$ or $116$. We obtain $16$ inequivalent self-dual $[78,39,14]$ codes, four of which have new weight enumerators. We also show that there are at least $141$ inequivalent self-dual $[116,58,18]$ codes, most of which are new up to equivalence. Meanwhile, we give some restrictions on"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.7538","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":"1405.7538","created_at":"2026-05-18T02:50:51.029195+00:00"},{"alias_kind":"arxiv_version","alias_value":"1405.7538v1","created_at":"2026-05-18T02:50:51.029195+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.7538","created_at":"2026-05-18T02:50:51.029195+00:00"},{"alias_kind":"pith_short_12","alias_value":"7OBPU5SRWPKN","created_at":"2026-05-18T12:28:19.803747+00:00"},{"alias_kind":"pith_short_16","alias_value":"7OBPU5SRWPKNIVRV","created_at":"2026-05-18T12:28:19.803747+00:00"},{"alias_kind":"pith_short_8","alias_value":"7OBPU5SR","created_at":"2026-05-18T12:28:19.803747+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/7OBPU5SRWPKNIVRVSHAMAZAXQI","json":"https://pith.science/pith/7OBPU5SRWPKNIVRVSHAMAZAXQI.json","graph_json":"https://pith.science/api/pith-number/7OBPU5SRWPKNIVRVSHAMAZAXQI/graph.json","events_json":"https://pith.science/api/pith-number/7OBPU5SRWPKNIVRVSHAMAZAXQI/events.json","paper":"https://pith.science/paper/7OBPU5SR"},"agent_actions":{"view_html":"https://pith.science/pith/7OBPU5SRWPKNIVRVSHAMAZAXQI","download_json":"https://pith.science/pith/7OBPU5SRWPKNIVRVSHAMAZAXQI.json","view_paper":"https://pith.science/paper/7OBPU5SR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1405.7538&json=true","fetch_graph":"https://pith.science/api/pith-number/7OBPU5SRWPKNIVRVSHAMAZAXQI/graph.json","fetch_events":"https://pith.science/api/pith-number/7OBPU5SRWPKNIVRVSHAMAZAXQI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7OBPU5SRWPKNIVRVSHAMAZAXQI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7OBPU5SRWPKNIVRVSHAMAZAXQI/action/storage_attestation","attest_author":"https://pith.science/pith/7OBPU5SRWPKNIVRVSHAMAZAXQI/action/author_attestation","sign_citation":"https://pith.science/pith/7OBPU5SRWPKNIVRVSHAMAZAXQI/action/citation_signature","submit_replication":"https://pith.science/pith/7OBPU5SRWPKNIVRVSHAMAZAXQI/action/replication_record"}},"created_at":"2026-05-18T02:50:51.029195+00:00","updated_at":"2026-05-18T02:50:51.029195+00:00"}