{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:5VC5XMCZ4E7BJSEYLEWZIEEKNA","short_pith_number":"pith:5VC5XMCZ","schema_version":"1.0","canonical_sha256":"ed45dbb059e13e14c898592d94108a6815ce896677dbbb22c34d1d2f917d92e5","source":{"kind":"arxiv","id":"1608.04079","version":3},"attestation_state":"computed","paper":{"title":"Twisted Centralizer Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.AC","math.IT"],"primary_cat":"math.CO","authors_text":"Adel Alahmadi, Bahattin Yildiz, Cheryl E. Praeger, Patrick Sol\\'e, S. P. Glasby","submitted_at":"2016-08-14T09:26:14Z","abstract_excerpt":"Given an $n\\times n$ matrix $A$ over a field $F$ and a scalar $a\\in F$, we consider the linear codes $C(A,a):=\\{B\\in F^{n\\times n}\\mid \\,AB=aBA\\}$ of length $n^2$. We call $C(A,a)$ a twisted centralizer code. We investigate properties of these codes including their dimensions, minimum distances, parity-check matrices, syndromes, and automorphism groups. The minimal distance of a centralizer code (when $a=1$) is at most $n$, however for $a\\ne 0,1$ the minimal distance can be much larger, as large as $n^2$."},"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":"1608.04079","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-08-14T09:26:14Z","cross_cats_sorted":["cs.IT","math.AC","math.IT"],"title_canon_sha256":"e14ab4bea223decaaf8b445af5944df853995b4df5eadf5d4da21c50e1ccc9c6","abstract_canon_sha256":"8eb63bd3b17a112555a13e816da73093aff8946e67b0ebef3a136564f3b04173"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:48:54.299504Z","signature_b64":"/VdGbzv7+q5ry7eEq663g091mkJB76UdxGlTdThwELt0psCe9icpuVAwd0pfxk8VKu7uv/0Uq3sN+XFuXjt1AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ed45dbb059e13e14c898592d94108a6815ce896677dbbb22c34d1d2f917d92e5","last_reissued_at":"2026-05-18T00:48:54.298685Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:48:54.298685Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Twisted Centralizer Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.AC","math.IT"],"primary_cat":"math.CO","authors_text":"Adel Alahmadi, Bahattin Yildiz, Cheryl E. Praeger, Patrick Sol\\'e, S. P. Glasby","submitted_at":"2016-08-14T09:26:14Z","abstract_excerpt":"Given an $n\\times n$ matrix $A$ over a field $F$ and a scalar $a\\in F$, we consider the linear codes $C(A,a):=\\{B\\in F^{n\\times n}\\mid \\,AB=aBA\\}$ of length $n^2$. We call $C(A,a)$ a twisted centralizer code. We investigate properties of these codes including their dimensions, minimum distances, parity-check matrices, syndromes, and automorphism groups. The minimal distance of a centralizer code (when $a=1$) is at most $n$, however for $a\\ne 0,1$ the minimal distance can be much larger, as large as $n^2$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.04079","kind":"arxiv","version":3},"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":"1608.04079","created_at":"2026-05-18T00:48:54.298820+00:00"},{"alias_kind":"arxiv_version","alias_value":"1608.04079v3","created_at":"2026-05-18T00:48:54.298820+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.04079","created_at":"2026-05-18T00:48:54.298820+00:00"},{"alias_kind":"pith_short_12","alias_value":"5VC5XMCZ4E7B","created_at":"2026-05-18T12:30:01.593930+00:00"},{"alias_kind":"pith_short_16","alias_value":"5VC5XMCZ4E7BJSEY","created_at":"2026-05-18T12:30:01.593930+00:00"},{"alias_kind":"pith_short_8","alias_value":"5VC5XMCZ","created_at":"2026-05-18T12:30:01.593930+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/5VC5XMCZ4E7BJSEYLEWZIEEKNA","json":"https://pith.science/pith/5VC5XMCZ4E7BJSEYLEWZIEEKNA.json","graph_json":"https://pith.science/api/pith-number/5VC5XMCZ4E7BJSEYLEWZIEEKNA/graph.json","events_json":"https://pith.science/api/pith-number/5VC5XMCZ4E7BJSEYLEWZIEEKNA/events.json","paper":"https://pith.science/paper/5VC5XMCZ"},"agent_actions":{"view_html":"https://pith.science/pith/5VC5XMCZ4E7BJSEYLEWZIEEKNA","download_json":"https://pith.science/pith/5VC5XMCZ4E7BJSEYLEWZIEEKNA.json","view_paper":"https://pith.science/paper/5VC5XMCZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1608.04079&json=true","fetch_graph":"https://pith.science/api/pith-number/5VC5XMCZ4E7BJSEYLEWZIEEKNA/graph.json","fetch_events":"https://pith.science/api/pith-number/5VC5XMCZ4E7BJSEYLEWZIEEKNA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5VC5XMCZ4E7BJSEYLEWZIEEKNA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5VC5XMCZ4E7BJSEYLEWZIEEKNA/action/storage_attestation","attest_author":"https://pith.science/pith/5VC5XMCZ4E7BJSEYLEWZIEEKNA/action/author_attestation","sign_citation":"https://pith.science/pith/5VC5XMCZ4E7BJSEYLEWZIEEKNA/action/citation_signature","submit_replication":"https://pith.science/pith/5VC5XMCZ4E7BJSEYLEWZIEEKNA/action/replication_record"}},"created_at":"2026-05-18T00:48:54.298820+00:00","updated_at":"2026-05-18T00:48:54.298820+00:00"}