{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:WNKYIIFWOVJBPWA5RTML73LTU5","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"6e3e40c92ff681653d87795193f475b8109a5084686768b5cf4a8b12bbefcadb","cross_cats_sorted":["math.IT","math.RA"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2026-05-04T18:02:03Z","title_canon_sha256":"17417fd27ddeb4ec1d1fa851f9383c3ee04fbbe176ce971eea60b28683ec5976"},"schema_version":"1.0","source":{"id":"2605.03031","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.03031","created_at":"2026-05-28T02:04:48Z"},{"alias_kind":"arxiv_version","alias_value":"2605.03031v2","created_at":"2026-05-28T02:04:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.03031","created_at":"2026-05-28T02:04:48Z"},{"alias_kind":"pith_short_12","alias_value":"WNKYIIFWOVJB","created_at":"2026-05-28T02:04:48Z"},{"alias_kind":"pith_short_16","alias_value":"WNKYIIFWOVJBPWA5","created_at":"2026-05-28T02:04:48Z"},{"alias_kind":"pith_short_8","alias_value":"WNKYIIFW","created_at":"2026-05-28T02:04:48Z"}],"graph_snapshots":[{"event_id":"sha256:b89f517960d320694c11a9db1d98356c5824f00380833e52b20e69c525609e53","target":"graph","created_at":"2026-05-28T02:04:48Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"In this paper, we describe linear and cyclic codes over the ring Z2[u,v](u2(1+u),v2(1+v2))."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","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."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Linear and cyclic codes are described over the ring Z₂[u,v]/(u²(1+u), v²(1+v²))."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","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)."}],"snapshot_sha256":"a483a694aef3d1d1c8aa0a2b0e28fcc055c6b3f2d377ec701818eebfee0184ac"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"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"}],"endpoint":"/pith/2605.03031/integrity.json","findings":[],"snapshot_sha256":"f860dac6e9f3e9ab37bea124182844b8ee3dbc36530033daa7a55cd68c83f5e2","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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\\}$.","authors_text":"Bianca Liana Bercea-Straton, Cristina Flaut","cross_cats":["math.IT","math.RA"],"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).","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2026-05-04T18:02:03Z","title":"Linear and cyclic codes over some special rings"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.03031","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-08T17:29:13.545970Z","id":"1d84e1bb-8dc8-48a3-8b9b-408a280ed29e","model_set":{"reader":"grok-4.3"},"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","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).","strongest_claim":"In this paper, we describe linear and cyclic codes over the ring Z2[u,v](u2(1+u),v2(1+v2)).","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."}},"verdict_id":"1d84e1bb-8dc8-48a3-8b9b-408a280ed29e"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:e345d90ad0fbcb84f0d352601ac2273dcb990e4e15d6a12d56bf3a42f2650da7","target":"record","created_at":"2026-05-28T02:04:48Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"6e3e40c92ff681653d87795193f475b8109a5084686768b5cf4a8b12bbefcadb","cross_cats_sorted":["math.IT","math.RA"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2026-05-04T18:02:03Z","title_canon_sha256":"17417fd27ddeb4ec1d1fa851f9383c3ee04fbbe176ce971eea60b28683ec5976"},"schema_version":"1.0","source":{"id":"2605.03031","kind":"arxiv","version":2}},"canonical_sha256":"b3558420b6755217d81d8cd8bfed73a75679645b4200824077b14242afe073ca","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b3558420b6755217d81d8cd8bfed73a75679645b4200824077b14242afe073ca","first_computed_at":"2026-05-28T02:04:48.888014Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-28T02:04:48.888014Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3yXWvfbO4PiqlZGKlpEzTHFqt+Mn+JP9fSP15YsSR6swHsDpdS4UANXgP0XhBQ5zvk6uNRNu94irz9f4LfaYBQ==","signature_status":"signed_v1","signed_at":"2026-05-28T02:04:48.888609Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.03031","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e345d90ad0fbcb84f0d352601ac2273dcb990e4e15d6a12d56bf3a42f2650da7","sha256:b89f517960d320694c11a9db1d98356c5824f00380833e52b20e69c525609e53"],"state_sha256":"e2b66f43e03285cdc33ba66f630fea4e25c4fdd817f6106a7e79d1177d22d186"}