{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:JCFYYY3TOCKZVURYB2BDZBAXGA","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":"8d4395616cd463ce38d1cb5cce16d16dc200c24e3d6a61efb2c433b206b887e2","cross_cats_sorted":["math.CO","math.IT","math.NT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-01-27T01:46:03Z","title_canon_sha256":"ce071521604c4db0447bf7478243cfb9e3845d0f0ee10dee23f4c8588f3c7ebf"},"schema_version":"1.0","source":{"id":"1201.5689","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.5689","created_at":"2026-05-18T04:03:44Z"},{"alias_kind":"arxiv_version","alias_value":"1201.5689v1","created_at":"2026-05-18T04:03:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.5689","created_at":"2026-05-18T04:03:44Z"},{"alias_kind":"pith_short_12","alias_value":"JCFYYY3TOCKZ","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_16","alias_value":"JCFYYY3TOCKZVURY","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_8","alias_value":"JCFYYY3T","created_at":"2026-05-18T12:27:11Z"}],"graph_snapshots":[{"event_id":"sha256:fc2af8f41a954d4071f53226d002c726809b6be634f84589c277eb481f7d70dd","target":"graph","created_at":"2026-05-18T04:03:44Z","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":"We complete the building-up construction for self-dual codes by resolving the open cases over $GF(q)$ with $q \\equiv 3 \\pmod 4$, and over $\\Z_{p^m}$ and Galois rings $\\GR(p^m,r)$ with an odd prime $p$ satisfying $p \\equiv 3 \\pmod 4$ with $r$ odd. We also extend the building-up construction for self-dual codes to finite chain rings. Our building-up construction produces many new interesting self-dual codes. In particular, we construct 945 new extremal self-dual ternary $[32,16,9]$ codes, each of which has a trivial automorphism group. We also obtain many new self-dual codes over $\\mathbb Z_9$ o","authors_text":"Jon-Lark Kim, Yoonjin Lee","cross_cats":["math.CO","math.IT","math.NT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-01-27T01:46:03Z","title":"An Efficient Construction of Self-Dual Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.5689","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:1090f5a2c5b5874f06eb1ec28bacb606da075c957155b9045c828140447caad7","target":"record","created_at":"2026-05-18T04:03:44Z","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":"8d4395616cd463ce38d1cb5cce16d16dc200c24e3d6a61efb2c433b206b887e2","cross_cats_sorted":["math.CO","math.IT","math.NT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-01-27T01:46:03Z","title_canon_sha256":"ce071521604c4db0447bf7478243cfb9e3845d0f0ee10dee23f4c8588f3c7ebf"},"schema_version":"1.0","source":{"id":"1201.5689","kind":"arxiv","version":1}},"canonical_sha256":"488b8c637370959ad2380e823c84173002c6ff9acd39a729f9d55d7dca3c67e5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"488b8c637370959ad2380e823c84173002c6ff9acd39a729f9d55d7dca3c67e5","first_computed_at":"2026-05-18T04:03:44.797700Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:03:44.797700Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LLoQxgwrwEu8xjYsmt1KS8AgDnUfK+EPAiF3bubmviLbUg7ZGMRkbBYUiEnfUsP1pk0wqlYRs3x1UIg6qShrBw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:03:44.798355Z","signed_message":"canonical_sha256_bytes"},"source_id":"1201.5689","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1090f5a2c5b5874f06eb1ec28bacb606da075c957155b9045c828140447caad7","sha256:fc2af8f41a954d4071f53226d002c726809b6be634f84589c277eb481f7d70dd"],"state_sha256":"83c2aaac07fe3a900fbcf6c5bbf505a5acdc2f7762de47de00a4e179dce97785"}