{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:WNKYIIFWOVJBPWA5RTML73LTU5","short_pith_number":"pith:WNKYIIFW","schema_version":"1.0","canonical_sha256":"b3558420b6755217d81d8cd8bfed73a75679645b4200824077b14242afe073ca","source":{"kind":"arxiv","id":"2605.03031","version":2},"attestation_state":"computed","paper":{"title":"Linear and cyclic codes over some special rings","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Linear and cyclic codes are defined over the ring Z2[u,v] modulo u squared times (1 plus u) and v squared times (1 plus v squared).","cross_cats":["math.IT","math.RA"],"primary_cat":"cs.IT","authors_text":"Bianca Liana Bercea-Straton, Cristina Flaut","submitted_at":"2026-05-04T18:02:03Z","abstract_excerpt":"In this paper, we describe linear and cyclic codes over the rings of the form $R_{s,p}=\\mathbb{Z}_{p}[u]/\\left( f\\left(u\\right) /\\left( u-s\\right) \\right)$, where $p$ is a prime number and $f\\left( u\\right) =u^{p}-u$, with $s\\in \\{0,1,...,p-1\\}$."},"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":"2605.03031","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2026-05-04T18:02:03Z","cross_cats_sorted":["math.IT","math.RA"],"title_canon_sha256":"17417fd27ddeb4ec1d1fa851f9383c3ee04fbbe176ce971eea60b28683ec5976","abstract_canon_sha256":"6e3e40c92ff681653d87795193f475b8109a5084686768b5cf4a8b12bbefcadb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-28T02:04:48.888609Z","signature_b64":"3yXWvfbO4PiqlZGKlpEzTHFqt+Mn+JP9fSP15YsSR6swHsDpdS4UANXgP0XhBQ5zvk6uNRNu94irz9f4LfaYBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b3558420b6755217d81d8cd8bfed73a75679645b4200824077b14242afe073ca","last_reissued_at":"2026-05-28T02:04:48.888014Z","signature_status":"signed_v1","first_computed_at":"2026-05-28T02:04:48.888014Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Linear and cyclic codes over some special rings","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Linear and cyclic codes are defined over the ring Z2[u,v] modulo u squared times (1 plus u) and v squared times (1 plus v squared).","cross_cats":["math.IT","math.RA"],"primary_cat":"cs.IT","authors_text":"Bianca Liana Bercea-Straton, Cristina Flaut","submitted_at":"2026-05-04T18:02:03Z","abstract_excerpt":"In this paper, we describe linear and cyclic codes over the rings of the form $R_{s,p}=\\mathbb{Z}_{p}[u]/\\left( f\\left(u\\right) /\\left( u-s\\right) \\right)$, where $p$ is a prime number and $f\\left( u\\right) =u^{p}-u$, with $s\\in \\{0,1,...,p-1\\}$."},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"In this paper, we describe linear and cyclic codes over the ring Z2[u,v](u2(1+u),v2(1+v2)).","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The given ring admits the standard definitions of linear and cyclic codes without additional compatibility conditions that would invalidate the usual generator-matrix or ideal-based constructions.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Linear and cyclic codes are described over the ring Z₂[u,v]/(u²(1+u), v²(1+v²)).","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Linear and cyclic codes are defined over the ring Z2[u,v] modulo u squared times (1 plus u) and v squared times (1 plus v squared).","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"a483a694aef3d1d1c8aa0a2b0e28fcc055c6b3f2d377ec701818eebfee0184ac"},"source":{"id":"2605.03031","kind":"arxiv","version":2},"verdict":{"id":"1d84e1bb-8dc8-48a3-8b9b-408a280ed29e","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-08T17:29:13.545970Z","strongest_claim":"In this paper, we describe linear and cyclic codes over the ring Z2[u,v](u2(1+u),v2(1+v2)).","one_line_summary":"Linear and cyclic codes are described over the ring Z₂[u,v]/(u²(1+u), v²(1+v²)).","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The given ring admits the standard definitions of linear and cyclic codes without additional compatibility conditions that would invalidate the usual generator-matrix or ideal-based constructions.","pith_extraction_headline":"Linear and cyclic codes are defined over the ring Z2[u,v] modulo u squared times (1 plus u) and v squared times (1 plus v squared)."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.03031/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"ai_meta_artifact","ran_at":"2026-05-20T14:39:25.952204Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_title_agreement","ran_at":"2026-05-20T02:01:22.196430Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T15:47:20.966932Z","status":"completed","version":"1.0.0","findings_count":0}],"snapshot_sha256":"f860dac6e9f3e9ab37bea124182844b8ee3dbc36530033daa7a55cd68c83f5e2"},"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":"2605.03031","created_at":"2026-05-28T02:04:48.888071+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.03031v2","created_at":"2026-05-28T02:04:48.888071+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.03031","created_at":"2026-05-28T02:04:48.888071+00:00"},{"alias_kind":"pith_short_12","alias_value":"WNKYIIFWOVJB","created_at":"2026-05-28T02:04:48.888071+00:00"},{"alias_kind":"pith_short_16","alias_value":"WNKYIIFWOVJBPWA5","created_at":"2026-05-28T02:04:48.888071+00:00"},{"alias_kind":"pith_short_8","alias_value":"WNKYIIFW","created_at":"2026-05-28T02:04:48.888071+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/WNKYIIFWOVJBPWA5RTML73LTU5","json":"https://pith.science/pith/WNKYIIFWOVJBPWA5RTML73LTU5.json","graph_json":"https://pith.science/api/pith-number/WNKYIIFWOVJBPWA5RTML73LTU5/graph.json","events_json":"https://pith.science/api/pith-number/WNKYIIFWOVJBPWA5RTML73LTU5/events.json","paper":"https://pith.science/paper/WNKYIIFW"},"agent_actions":{"view_html":"https://pith.science/pith/WNKYIIFWOVJBPWA5RTML73LTU5","download_json":"https://pith.science/pith/WNKYIIFWOVJBPWA5RTML73LTU5.json","view_paper":"https://pith.science/paper/WNKYIIFW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.03031&json=true","fetch_graph":"https://pith.science/api/pith-number/WNKYIIFWOVJBPWA5RTML73LTU5/graph.json","fetch_events":"https://pith.science/api/pith-number/WNKYIIFWOVJBPWA5RTML73LTU5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WNKYIIFWOVJBPWA5RTML73LTU5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WNKYIIFWOVJBPWA5RTML73LTU5/action/storage_attestation","attest_author":"https://pith.science/pith/WNKYIIFWOVJBPWA5RTML73LTU5/action/author_attestation","sign_citation":"https://pith.science/pith/WNKYIIFWOVJBPWA5RTML73LTU5/action/citation_signature","submit_replication":"https://pith.science/pith/WNKYIIFWOVJBPWA5RTML73LTU5/action/replication_record"}},"created_at":"2026-05-28T02:04:48.888071+00:00","updated_at":"2026-05-28T02:04:48.888071+00:00"}