{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:2IYLVI46M4YQLNWLWQUJ3RCMCB","short_pith_number":"pith:2IYLVI46","schema_version":"1.0","canonical_sha256":"d230baa39e673105b6cbb4289dc44c107ad2ddc159aa40bce7e99265e1b70aaa","source":{"kind":"arxiv","id":"1503.02939","version":1},"attestation_state":"computed","paper":{"title":"Double and bordered \\$\\alpha\\$-circulant self-dual codes over finite commutative chain rings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alfred Wassermann, Michael Kiermaier","submitted_at":"2015-03-10T14:54:21Z","abstract_excerpt":"In this paper we investigate codes over finite commutative rings R, whose generator matrices are built from \\$\\alpha\\$-circulant matrices. For a non-trivial ideal I<R we give a method to lift such codes over R/I to codes over R, such that some isomorphic copies are avoided.\n  For the case where I is the minimal ideal of a finite chain ring we refine this lifting method: We impose the additional restriction that lifting preserves self-duality. It will be shown that this can be achieved by solving a linear system of equations over a finite field.\n  Finally we apply this technique to Z_4-linear d"},"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":"1503.02939","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-03-10T14:54:21Z","cross_cats_sorted":[],"title_canon_sha256":"5b00e18666d4b4393b44bb5f0b5573437da3d8bcc57a2408accd14154cc2c88e","abstract_canon_sha256":"78c62cdd7a20f1abfb41374a775e753febe7ae27eae0eec55bdae1746b3e94d9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:25:12.704398Z","signature_b64":"H5V16UL8zgv1O8KPgzQ2QfUy3BjGWCqHlQ2ZAmsAvYxITWA5oifpyxU56pvMrYlj+ilTNLgDxDT4Ok6DhHNgDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d230baa39e673105b6cbb4289dc44c107ad2ddc159aa40bce7e99265e1b70aaa","last_reissued_at":"2026-05-18T02:25:12.703873Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:25:12.703873Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Double and bordered \\$\\alpha\\$-circulant self-dual codes over finite commutative chain rings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alfred Wassermann, Michael Kiermaier","submitted_at":"2015-03-10T14:54:21Z","abstract_excerpt":"In this paper we investigate codes over finite commutative rings R, whose generator matrices are built from \\$\\alpha\\$-circulant matrices. For a non-trivial ideal I<R we give a method to lift such codes over R/I to codes over R, such that some isomorphic copies are avoided.\n  For the case where I is the minimal ideal of a finite chain ring we refine this lifting method: We impose the additional restriction that lifting preserves self-duality. It will be shown that this can be achieved by solving a linear system of equations over a finite field.\n  Finally we apply this technique to Z_4-linear d"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.02939","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":"1503.02939","created_at":"2026-05-18T02:25:12.703956+00:00"},{"alias_kind":"arxiv_version","alias_value":"1503.02939v1","created_at":"2026-05-18T02:25:12.703956+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.02939","created_at":"2026-05-18T02:25:12.703956+00:00"},{"alias_kind":"pith_short_12","alias_value":"2IYLVI46M4YQ","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_16","alias_value":"2IYLVI46M4YQLNWL","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_8","alias_value":"2IYLVI46","created_at":"2026-05-18T12:28:59.999130+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/2IYLVI46M4YQLNWLWQUJ3RCMCB","json":"https://pith.science/pith/2IYLVI46M4YQLNWLWQUJ3RCMCB.json","graph_json":"https://pith.science/api/pith-number/2IYLVI46M4YQLNWLWQUJ3RCMCB/graph.json","events_json":"https://pith.science/api/pith-number/2IYLVI46M4YQLNWLWQUJ3RCMCB/events.json","paper":"https://pith.science/paper/2IYLVI46"},"agent_actions":{"view_html":"https://pith.science/pith/2IYLVI46M4YQLNWLWQUJ3RCMCB","download_json":"https://pith.science/pith/2IYLVI46M4YQLNWLWQUJ3RCMCB.json","view_paper":"https://pith.science/paper/2IYLVI46","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1503.02939&json=true","fetch_graph":"https://pith.science/api/pith-number/2IYLVI46M4YQLNWLWQUJ3RCMCB/graph.json","fetch_events":"https://pith.science/api/pith-number/2IYLVI46M4YQLNWLWQUJ3RCMCB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2IYLVI46M4YQLNWLWQUJ3RCMCB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2IYLVI46M4YQLNWLWQUJ3RCMCB/action/storage_attestation","attest_author":"https://pith.science/pith/2IYLVI46M4YQLNWLWQUJ3RCMCB/action/author_attestation","sign_citation":"https://pith.science/pith/2IYLVI46M4YQLNWLWQUJ3RCMCB/action/citation_signature","submit_replication":"https://pith.science/pith/2IYLVI46M4YQLNWLWQUJ3RCMCB/action/replication_record"}},"created_at":"2026-05-18T02:25:12.703956+00:00","updated_at":"2026-05-18T02:25:12.703956+00:00"}