{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:7OBPU5SRWPKNIVRVSHAMAZAXQI","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":"fe8299bb861047540bf84927479d3b30b072ccdfa45e9cddf7940c1afe3ac3e4","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-05-29T12:40:12Z","title_canon_sha256":"ad8b16244f545071512cb4421e40ba2948b1a0fe12b95b552b1ac72601f515be"},"schema_version":"1.0","source":{"id":"1405.7538","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.7538","created_at":"2026-05-18T02:50:51Z"},{"alias_kind":"arxiv_version","alias_value":"1405.7538v1","created_at":"2026-05-18T02:50:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.7538","created_at":"2026-05-18T02:50:51Z"},{"alias_kind":"pith_short_12","alias_value":"7OBPU5SRWPKN","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"7OBPU5SRWPKNIVRV","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"7OBPU5SR","created_at":"2026-05-18T12:28:19Z"}],"graph_snapshots":[{"event_id":"sha256:0635ec384bd5b7b95a3920f530428a095fd962990daed9ca5fdece25ebc45d81","target":"graph","created_at":"2026-05-18T02:50:51Z","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":"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","authors_text":"Gennian Ge, Jerod Michel, Tao Feng, Tao Zhang","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-05-29T12:40:12Z","title":"On the Existence of Certain Optimal Self-Dual Codes with Lengths Between $74$ and $116$"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.7538","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:2e3c3bc18ec0828af327f42f88ecf1895f231e2f0d4f9f8d7ef75ad25856a691","target":"record","created_at":"2026-05-18T02:50:51Z","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":"fe8299bb861047540bf84927479d3b30b072ccdfa45e9cddf7940c1afe3ac3e4","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-05-29T12:40:12Z","title_canon_sha256":"ad8b16244f545071512cb4421e40ba2948b1a0fe12b95b552b1ac72601f515be"},"schema_version":"1.0","source":{"id":"1405.7538","kind":"arxiv","version":1}},"canonical_sha256":"fb82fa7651b3d4d4563591c0c06417820f89d6250daf6c118efbe2a42e43cbfb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fb82fa7651b3d4d4563591c0c06417820f89d6250daf6c118efbe2a42e43cbfb","first_computed_at":"2026-05-18T02:50:51.029123Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:50:51.029123Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LcpDAfCUA0Zhgl9mUvqmaK48ynP1x8AhmFN9DJx0R1eYsWaAHQY6WZisNH9IT7ptpW37zgtzfg9fl3wPTQU3Cg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:50:51.029605Z","signed_message":"canonical_sha256_bytes"},"source_id":"1405.7538","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2e3c3bc18ec0828af327f42f88ecf1895f231e2f0d4f9f8d7ef75ad25856a691","sha256:0635ec384bd5b7b95a3920f530428a095fd962990daed9ca5fdece25ebc45d81"],"state_sha256":"a07f3bcc1db15222c5b9058d2f5f9abd95dbc154dea4e227f3f9a69465e673f6"}