{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:AQ4DAD4SZU6TVDMSLHIE24XFMG","short_pith_number":"pith:AQ4DAD4S","schema_version":"1.0","canonical_sha256":"0438300f92cd3d3a8d9259d04d72e561a9804aa505f1c43f91edc02c906f34df","source":{"kind":"arxiv","id":"1202.0992","version":1},"attestation_state":"computed","paper":{"title":"Computational Results of Duadic Double Circulant Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Jon-Lark Kim, Sunghyu Han","submitted_at":"2012-02-05T19:11:55Z","abstract_excerpt":"Quadratic residue codes have been one of the most important classes of algebraic codes. They have been generalized into duadic codes and quadratic double circulant codes. In this paper we introduce a new subclass of double circulant codes, called {\\em{duadic double circulant codes}}, which is a generalization of quadratic double circulant codes for prime lengths. This class generates optimal self-dual codes, optimal linear codes, and linear codes with the best known parameters in a systematic way. We describe a method to construct duadic double circulant codes using 4-cyclotomic cosets and giv"},"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":"1202.0992","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-02-05T19:11:55Z","cross_cats_sorted":["cs.DM","math.CO","math.IT"],"title_canon_sha256":"d11e74cbe86775d17b14a370ceddf05bc57c7676970cc558d0f4f08aa2d2ce09","abstract_canon_sha256":"3c7441136d351788dd8ffb50e739164ad09affc2416b96aa021b3ff05cb4d712"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:03:05.516100Z","signature_b64":"rRL53ru7UZ6L2nml1bVqpcmOcAeuaIsLU2YxLpRicMN2QGZaKJZseDjG/Y1RV5TSUzKr61784+3VzrIp44jEDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0438300f92cd3d3a8d9259d04d72e561a9804aa505f1c43f91edc02c906f34df","last_reissued_at":"2026-05-18T04:03:05.515405Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:03:05.515405Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computational Results of Duadic Double Circulant Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Jon-Lark Kim, Sunghyu Han","submitted_at":"2012-02-05T19:11:55Z","abstract_excerpt":"Quadratic residue codes have been one of the most important classes of algebraic codes. They have been generalized into duadic codes and quadratic double circulant codes. In this paper we introduce a new subclass of double circulant codes, called {\\em{duadic double circulant codes}}, which is a generalization of quadratic double circulant codes for prime lengths. This class generates optimal self-dual codes, optimal linear codes, and linear codes with the best known parameters in a systematic way. We describe a method to construct duadic double circulant codes using 4-cyclotomic cosets and giv"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.0992","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":"1202.0992","created_at":"2026-05-18T04:03:05.515522+00:00"},{"alias_kind":"arxiv_version","alias_value":"1202.0992v1","created_at":"2026-05-18T04:03:05.515522+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.0992","created_at":"2026-05-18T04:03:05.515522+00:00"},{"alias_kind":"pith_short_12","alias_value":"AQ4DAD4SZU6T","created_at":"2026-05-18T12:26:58.693483+00:00"},{"alias_kind":"pith_short_16","alias_value":"AQ4DAD4SZU6TVDMS","created_at":"2026-05-18T12:26:58.693483+00:00"},{"alias_kind":"pith_short_8","alias_value":"AQ4DAD4S","created_at":"2026-05-18T12:26:58.693483+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/AQ4DAD4SZU6TVDMSLHIE24XFMG","json":"https://pith.science/pith/AQ4DAD4SZU6TVDMSLHIE24XFMG.json","graph_json":"https://pith.science/api/pith-number/AQ4DAD4SZU6TVDMSLHIE24XFMG/graph.json","events_json":"https://pith.science/api/pith-number/AQ4DAD4SZU6TVDMSLHIE24XFMG/events.json","paper":"https://pith.science/paper/AQ4DAD4S"},"agent_actions":{"view_html":"https://pith.science/pith/AQ4DAD4SZU6TVDMSLHIE24XFMG","download_json":"https://pith.science/pith/AQ4DAD4SZU6TVDMSLHIE24XFMG.json","view_paper":"https://pith.science/paper/AQ4DAD4S","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1202.0992&json=true","fetch_graph":"https://pith.science/api/pith-number/AQ4DAD4SZU6TVDMSLHIE24XFMG/graph.json","fetch_events":"https://pith.science/api/pith-number/AQ4DAD4SZU6TVDMSLHIE24XFMG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AQ4DAD4SZU6TVDMSLHIE24XFMG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AQ4DAD4SZU6TVDMSLHIE24XFMG/action/storage_attestation","attest_author":"https://pith.science/pith/AQ4DAD4SZU6TVDMSLHIE24XFMG/action/author_attestation","sign_citation":"https://pith.science/pith/AQ4DAD4SZU6TVDMSLHIE24XFMG/action/citation_signature","submit_replication":"https://pith.science/pith/AQ4DAD4SZU6TVDMSLHIE24XFMG/action/replication_record"}},"created_at":"2026-05-18T04:03:05.515522+00:00","updated_at":"2026-05-18T04:03:05.515522+00:00"}