{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:VD35YT2YOFU4T565W6CXNXBJHO","short_pith_number":"pith:VD35YT2Y","schema_version":"1.0","canonical_sha256":"a8f7dc4f587169c9f7ddb78576dc293b90aef9019e4198727ba67e89312b9384","source":{"kind":"arxiv","id":"1504.07831","version":1},"attestation_state":"computed","paper":{"title":"Skew Cyclic codes over $\\F_q+u\\F_q+v\\F_q+uv\\F_q$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Minjia Shi, Patrick Sol\\'e, Ting Yao","submitted_at":"2015-04-29T12:31:40Z","abstract_excerpt":"In this paper, we study skew cyclic codes over the ring $R=\\F_q+u\\F_q+v\\F_q+uv\\F_q$, where $u^{2}=u,v^{2}=v,uv=vu$, $q=p^{m}$ and $p$ is an odd prime. We investigate the structural properties of skew cyclic codes over $R$ through a decomposition theorem. Furthermore, we give a formula for the number of skew cyclic codes of length $n$ over $R.$"},"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":"1504.07831","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-04-29T12:31:40Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"31e97d6c14a2696a252ea86b42e69be164f22db6ed8478f2fd1c13b0666c1662","abstract_canon_sha256":"bbf43d50be2fb476adc7d8e5c44c3876b0c64447adcee0819358f3cbd2333dcb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:17:32.087361Z","signature_b64":"SC7869xpN3fze3VyNdOIVRmU8vx/3ggjEJWNhFxCftADUZorJXJjr58SGtDW058fc0lMR2EqHchSKrl9I09mAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a8f7dc4f587169c9f7ddb78576dc293b90aef9019e4198727ba67e89312b9384","last_reissued_at":"2026-05-18T02:17:32.086575Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:17:32.086575Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Skew Cyclic codes over $\\F_q+u\\F_q+v\\F_q+uv\\F_q$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Minjia Shi, Patrick Sol\\'e, Ting Yao","submitted_at":"2015-04-29T12:31:40Z","abstract_excerpt":"In this paper, we study skew cyclic codes over the ring $R=\\F_q+u\\F_q+v\\F_q+uv\\F_q$, where $u^{2}=u,v^{2}=v,uv=vu$, $q=p^{m}$ and $p$ is an odd prime. We investigate the structural properties of skew cyclic codes over $R$ through a decomposition theorem. Furthermore, we give a formula for the number of skew cyclic codes of length $n$ over $R.$"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.07831","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":"1504.07831","created_at":"2026-05-18T02:17:32.086698+00:00"},{"alias_kind":"arxiv_version","alias_value":"1504.07831v1","created_at":"2026-05-18T02:17:32.086698+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.07831","created_at":"2026-05-18T02:17:32.086698+00:00"},{"alias_kind":"pith_short_12","alias_value":"VD35YT2YOFU4","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_16","alias_value":"VD35YT2YOFU4T565","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_8","alias_value":"VD35YT2Y","created_at":"2026-05-18T12:29:44.643036+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/VD35YT2YOFU4T565W6CXNXBJHO","json":"https://pith.science/pith/VD35YT2YOFU4T565W6CXNXBJHO.json","graph_json":"https://pith.science/api/pith-number/VD35YT2YOFU4T565W6CXNXBJHO/graph.json","events_json":"https://pith.science/api/pith-number/VD35YT2YOFU4T565W6CXNXBJHO/events.json","paper":"https://pith.science/paper/VD35YT2Y"},"agent_actions":{"view_html":"https://pith.science/pith/VD35YT2YOFU4T565W6CXNXBJHO","download_json":"https://pith.science/pith/VD35YT2YOFU4T565W6CXNXBJHO.json","view_paper":"https://pith.science/paper/VD35YT2Y","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1504.07831&json=true","fetch_graph":"https://pith.science/api/pith-number/VD35YT2YOFU4T565W6CXNXBJHO/graph.json","fetch_events":"https://pith.science/api/pith-number/VD35YT2YOFU4T565W6CXNXBJHO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VD35YT2YOFU4T565W6CXNXBJHO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VD35YT2YOFU4T565W6CXNXBJHO/action/storage_attestation","attest_author":"https://pith.science/pith/VD35YT2YOFU4T565W6CXNXBJHO/action/author_attestation","sign_citation":"https://pith.science/pith/VD35YT2YOFU4T565W6CXNXBJHO/action/citation_signature","submit_replication":"https://pith.science/pith/VD35YT2YOFU4T565W6CXNXBJHO/action/replication_record"}},"created_at":"2026-05-18T02:17:32.086698+00:00","updated_at":"2026-05-18T02:17:32.086698+00:00"}