{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:CB2FI2HAAM2TXADRZ6IAG4X6TG","short_pith_number":"pith:CB2FI2HA","schema_version":"1.0","canonical_sha256":"10745468e003353b8071cf900372fe9986b21357ed5629ad1ac47d7eea3ea5f6","source":{"kind":"arxiv","id":"1602.01242","version":2},"attestation_state":"computed","paper":{"title":"Galois Correspondence on Linear Codes over Finite Chain Rings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"A. Fotue Tabue, C. Mouaha, E. Mart\\'inez-Moro","submitted_at":"2016-02-03T09:58:33Z","abstract_excerpt":"Given $\\texttt{S}|\\texttt{R}$ a finite Galois extension of finite chain rings and $\\mathcal{B}$ an $\\texttt{S}$-linear code we define two Galois operators, the closure operator and the interior operator. We proof that a linear code is Galois invariant if and only if the row standard form of its generator matrix has all entries in the fixed ring by the Galois group and show a Galois correspondence in the class of $\\texttt{S}$-linear codes. As applications some improvements of upper and lower bounds for the rank of the restriction and trace code are given and some applications to $\\texttt{S}$-li"},"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":"1602.01242","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-03T09:58:33Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"e1019e1872f5d4f5865f282df7c9555915c86918395e7c270f86169df780388a","abstract_canon_sha256":"8044046840dc9ff45a886c34a5af3610a52d2f4fe8770ba19a0667c68ecca524"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:20:21.973657Z","signature_b64":"jW1c78KADebodQ7RH/JfaAT9ZjEz3rv0IsP6fKQUrWf8mnnQmck9823HRfulhMlthI+hbJjexQqK8BEOm+3LBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"10745468e003353b8071cf900372fe9986b21357ed5629ad1ac47d7eea3ea5f6","last_reissued_at":"2026-05-18T01:20:21.973060Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:20:21.973060Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Galois Correspondence on Linear Codes over Finite Chain Rings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"A. Fotue Tabue, C. Mouaha, E. Mart\\'inez-Moro","submitted_at":"2016-02-03T09:58:33Z","abstract_excerpt":"Given $\\texttt{S}|\\texttt{R}$ a finite Galois extension of finite chain rings and $\\mathcal{B}$ an $\\texttt{S}$-linear code we define two Galois operators, the closure operator and the interior operator. We proof that a linear code is Galois invariant if and only if the row standard form of its generator matrix has all entries in the fixed ring by the Galois group and show a Galois correspondence in the class of $\\texttt{S}$-linear codes. As applications some improvements of upper and lower bounds for the rank of the restriction and trace code are given and some applications to $\\texttt{S}$-li"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.01242","kind":"arxiv","version":2},"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":"1602.01242","created_at":"2026-05-18T01:20:21.973172+00:00"},{"alias_kind":"arxiv_version","alias_value":"1602.01242v2","created_at":"2026-05-18T01:20:21.973172+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.01242","created_at":"2026-05-18T01:20:21.973172+00:00"},{"alias_kind":"pith_short_12","alias_value":"CB2FI2HAAM2T","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_16","alias_value":"CB2FI2HAAM2TXADR","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_8","alias_value":"CB2FI2HA","created_at":"2026-05-18T12:30:09.641336+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/CB2FI2HAAM2TXADRZ6IAG4X6TG","json":"https://pith.science/pith/CB2FI2HAAM2TXADRZ6IAG4X6TG.json","graph_json":"https://pith.science/api/pith-number/CB2FI2HAAM2TXADRZ6IAG4X6TG/graph.json","events_json":"https://pith.science/api/pith-number/CB2FI2HAAM2TXADRZ6IAG4X6TG/events.json","paper":"https://pith.science/paper/CB2FI2HA"},"agent_actions":{"view_html":"https://pith.science/pith/CB2FI2HAAM2TXADRZ6IAG4X6TG","download_json":"https://pith.science/pith/CB2FI2HAAM2TXADRZ6IAG4X6TG.json","view_paper":"https://pith.science/paper/CB2FI2HA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1602.01242&json=true","fetch_graph":"https://pith.science/api/pith-number/CB2FI2HAAM2TXADRZ6IAG4X6TG/graph.json","fetch_events":"https://pith.science/api/pith-number/CB2FI2HAAM2TXADRZ6IAG4X6TG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CB2FI2HAAM2TXADRZ6IAG4X6TG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CB2FI2HAAM2TXADRZ6IAG4X6TG/action/storage_attestation","attest_author":"https://pith.science/pith/CB2FI2HAAM2TXADRZ6IAG4X6TG/action/author_attestation","sign_citation":"https://pith.science/pith/CB2FI2HAAM2TXADRZ6IAG4X6TG/action/citation_signature","submit_replication":"https://pith.science/pith/CB2FI2HAAM2TXADRZ6IAG4X6TG/action/replication_record"}},"created_at":"2026-05-18T01:20:21.973172+00:00","updated_at":"2026-05-18T01:20:21.973172+00:00"}