{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:JCFYYY3TOCKZVURYB2BDZBAXGA","short_pith_number":"pith:JCFYYY3T","schema_version":"1.0","canonical_sha256":"488b8c637370959ad2380e823c84173002c6ff9acd39a729f9d55d7dca3c67e5","source":{"kind":"arxiv","id":"1201.5689","version":1},"attestation_state":"computed","paper":{"title":"An Efficient Construction of Self-Dual Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.IT","math.NT"],"primary_cat":"cs.IT","authors_text":"Jon-Lark Kim, Yoonjin Lee","submitted_at":"2012-01-27T01:46:03Z","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"},"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":"1201.5689","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-01-27T01:46:03Z","cross_cats_sorted":["math.CO","math.IT","math.NT"],"title_canon_sha256":"ce071521604c4db0447bf7478243cfb9e3845d0f0ee10dee23f4c8588f3c7ebf","abstract_canon_sha256":"8d4395616cd463ce38d1cb5cce16d16dc200c24e3d6a61efb2c433b206b887e2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:03:44.798355Z","signature_b64":"LLoQxgwrwEu8xjYsmt1KS8AgDnUfK+EPAiF3bubmviLbUg7ZGMRkbBYUiEnfUsP1pk0wqlYRs3x1UIg6qShrBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"488b8c637370959ad2380e823c84173002c6ff9acd39a729f9d55d7dca3c67e5","last_reissued_at":"2026-05-18T04:03:44.797700Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:03:44.797700Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Efficient Construction of Self-Dual Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.IT","math.NT"],"primary_cat":"cs.IT","authors_text":"Jon-Lark Kim, Yoonjin Lee","submitted_at":"2012-01-27T01:46:03Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.5689","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":"1201.5689","created_at":"2026-05-18T04:03:44.797815+00:00"},{"alias_kind":"arxiv_version","alias_value":"1201.5689v1","created_at":"2026-05-18T04:03:44.797815+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.5689","created_at":"2026-05-18T04:03:44.797815+00:00"},{"alias_kind":"pith_short_12","alias_value":"JCFYYY3TOCKZ","created_at":"2026-05-18T12:27:11.947152+00:00"},{"alias_kind":"pith_short_16","alias_value":"JCFYYY3TOCKZVURY","created_at":"2026-05-18T12:27:11.947152+00:00"},{"alias_kind":"pith_short_8","alias_value":"JCFYYY3T","created_at":"2026-05-18T12:27:11.947152+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/JCFYYY3TOCKZVURYB2BDZBAXGA","json":"https://pith.science/pith/JCFYYY3TOCKZVURYB2BDZBAXGA.json","graph_json":"https://pith.science/api/pith-number/JCFYYY3TOCKZVURYB2BDZBAXGA/graph.json","events_json":"https://pith.science/api/pith-number/JCFYYY3TOCKZVURYB2BDZBAXGA/events.json","paper":"https://pith.science/paper/JCFYYY3T"},"agent_actions":{"view_html":"https://pith.science/pith/JCFYYY3TOCKZVURYB2BDZBAXGA","download_json":"https://pith.science/pith/JCFYYY3TOCKZVURYB2BDZBAXGA.json","view_paper":"https://pith.science/paper/JCFYYY3T","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1201.5689&json=true","fetch_graph":"https://pith.science/api/pith-number/JCFYYY3TOCKZVURYB2BDZBAXGA/graph.json","fetch_events":"https://pith.science/api/pith-number/JCFYYY3TOCKZVURYB2BDZBAXGA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JCFYYY3TOCKZVURYB2BDZBAXGA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JCFYYY3TOCKZVURYB2BDZBAXGA/action/storage_attestation","attest_author":"https://pith.science/pith/JCFYYY3TOCKZVURYB2BDZBAXGA/action/author_attestation","sign_citation":"https://pith.science/pith/JCFYYY3TOCKZVURYB2BDZBAXGA/action/citation_signature","submit_replication":"https://pith.science/pith/JCFYYY3TOCKZVURYB2BDZBAXGA/action/replication_record"}},"created_at":"2026-05-18T04:03:44.797815+00:00","updated_at":"2026-05-18T04:03:44.797815+00:00"}