{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:3MMF5NO5TDII5PMEEAPT77TZXN","short_pith_number":"pith:3MMF5NO5","canonical_record":{"source":{"id":"1712.07783","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-12-21T03:44:58Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"86461b25abc6f737ae6f63f242c498f09263d700b1fba8e463946927e674e528","abstract_canon_sha256":"e374689409a4b2291bfe27614c85ca618999ea0eba9756bb419932f58dc300bb"},"schema_version":"1.0"},"canonical_sha256":"db185eb5dd98d08ebd84201f3ffe79bb460f235cabd68d68c25d347bd985a6da","source":{"kind":"arxiv","id":"1712.07783","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.07783","created_at":"2026-05-18T00:27:30Z"},{"alias_kind":"arxiv_version","alias_value":"1712.07783v1","created_at":"2026-05-18T00:27:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.07783","created_at":"2026-05-18T00:27:30Z"},{"alias_kind":"pith_short_12","alias_value":"3MMF5NO5TDII","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"3MMF5NO5TDII5PME","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"3MMF5NO5","created_at":"2026-05-18T12:30:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:3MMF5NO5TDII5PMEEAPT77TZXN","target":"record","payload":{"canonical_record":{"source":{"id":"1712.07783","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-12-21T03:44:58Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"86461b25abc6f737ae6f63f242c498f09263d700b1fba8e463946927e674e528","abstract_canon_sha256":"e374689409a4b2291bfe27614c85ca618999ea0eba9756bb419932f58dc300bb"},"schema_version":"1.0"},"canonical_sha256":"db185eb5dd98d08ebd84201f3ffe79bb460f235cabd68d68c25d347bd985a6da","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:27:30.880656Z","signature_b64":"dmmfWTp/LTSN/UnMUDRT+QUc6ApqyXi1YBdxi1mHczMrW5T1a6amOqke9pG9TJnFL6dNiz4htdYVCvj4ycrcCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"db185eb5dd98d08ebd84201f3ffe79bb460f235cabd68d68c25d347bd985a6da","last_reissued_at":"2026-05-18T00:27:30.879934Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:27:30.879934Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1712.07783","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:27:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/ykQm2e81h7mkdq8FGf4Z2AaBtVjxpc7yZ5BK5AXxPd308HrBnOVhmaw57jkhjvxCYQuYoljjp9bedAqASfqAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T01:02:21.298100Z"},"content_sha256":"eb40d7814e7cd81874e8bf51446c10b36911290f9e949fc0641370ed476e6c7d","schema_version":"1.0","event_id":"sha256:eb40d7814e7cd81874e8bf51446c10b36911290f9e949fc0641370ed476e6c7d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:3MMF5NO5TDII5PMEEAPT77TZXN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Skew cyclic codes over $\\mathbb{F}_{p}+u\\mathbb{F}_{p}$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Javad Haghighat, Nuh Aydin, Reza Dastbasteh, Seyyed Hamed Mousavi, Taher Abualrub","submitted_at":"2017-12-21T03:44:58Z","abstract_excerpt":"In this paper, we study skew cyclic codes with arbitrary length over the ring $R=\\mathbb{F}_{p}+u\\mathbb{F}_{p}$ where $p$ is an odd prime and $% u^{2}=0$. We characterize all skew cyclic codes of length $n$ as left $% R[x;\\theta ]$-submodules of $R_{n}=R[x;\\theta ]/\\langle x^{n}-1\\rangle $. We find all generator polynomials for these codes and describe their minimal spanning sets. Moreover, an encoding and decoding algorithm is presented for skew cyclic codes over the ring $R$. Finally, based on the theory we developed in this paper, we provide examples of codes with good parameters over $F_{"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.07783","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:27:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rMv+pBZIYoB59RRtoriysJP37rxX79y5MZfDa80y8NhqDUJnJPSkq/mVVMX6s/aVKSksxzrAFI7CR0eEehiPDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T01:02:21.298460Z"},"content_sha256":"9185daf4d407010f2ac6505eab0a335000959d4e22d290e5cd79f03f2e21f273","schema_version":"1.0","event_id":"sha256:9185daf4d407010f2ac6505eab0a335000959d4e22d290e5cd79f03f2e21f273"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3MMF5NO5TDII5PMEEAPT77TZXN/bundle.json","state_url":"https://pith.science/pith/3MMF5NO5TDII5PMEEAPT77TZXN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3MMF5NO5TDII5PMEEAPT77TZXN/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-26T01:02:21Z","links":{"resolver":"https://pith.science/pith/3MMF5NO5TDII5PMEEAPT77TZXN","bundle":"https://pith.science/pith/3MMF5NO5TDII5PMEEAPT77TZXN/bundle.json","state":"https://pith.science/pith/3MMF5NO5TDII5PMEEAPT77TZXN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3MMF5NO5TDII5PMEEAPT77TZXN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:3MMF5NO5TDII5PMEEAPT77TZXN","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":"e374689409a4b2291bfe27614c85ca618999ea0eba9756bb419932f58dc300bb","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-12-21T03:44:58Z","title_canon_sha256":"86461b25abc6f737ae6f63f242c498f09263d700b1fba8e463946927e674e528"},"schema_version":"1.0","source":{"id":"1712.07783","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.07783","created_at":"2026-05-18T00:27:30Z"},{"alias_kind":"arxiv_version","alias_value":"1712.07783v1","created_at":"2026-05-18T00:27:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.07783","created_at":"2026-05-18T00:27:30Z"},{"alias_kind":"pith_short_12","alias_value":"3MMF5NO5TDII","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"3MMF5NO5TDII5PME","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"3MMF5NO5","created_at":"2026-05-18T12:30:58Z"}],"graph_snapshots":[{"event_id":"sha256:9185daf4d407010f2ac6505eab0a335000959d4e22d290e5cd79f03f2e21f273","target":"graph","created_at":"2026-05-18T00:27:30Z","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":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"In this paper, we study skew cyclic codes with arbitrary length over the ring $R=\\mathbb{F}_{p}+u\\mathbb{F}_{p}$ where $p$ is an odd prime and $% u^{2}=0$. We characterize all skew cyclic codes of length $n$ as left $% R[x;\\theta ]$-submodules of $R_{n}=R[x;\\theta ]/\\langle x^{n}-1\\rangle $. We find all generator polynomials for these codes and describe their minimal spanning sets. Moreover, an encoding and decoding algorithm is presented for skew cyclic codes over the ring $R$. Finally, based on the theory we developed in this paper, we provide examples of codes with good parameters over $F_{","authors_text":"Javad Haghighat, Nuh Aydin, Reza Dastbasteh, Seyyed Hamed Mousavi, Taher Abualrub","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-12-21T03:44:58Z","title":"Skew cyclic codes over $\\mathbb{F}_{p}+u\\mathbb{F}_{p}$"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.07783","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:eb40d7814e7cd81874e8bf51446c10b36911290f9e949fc0641370ed476e6c7d","target":"record","created_at":"2026-05-18T00:27:30Z","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":"e374689409a4b2291bfe27614c85ca618999ea0eba9756bb419932f58dc300bb","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-12-21T03:44:58Z","title_canon_sha256":"86461b25abc6f737ae6f63f242c498f09263d700b1fba8e463946927e674e528"},"schema_version":"1.0","source":{"id":"1712.07783","kind":"arxiv","version":1}},"canonical_sha256":"db185eb5dd98d08ebd84201f3ffe79bb460f235cabd68d68c25d347bd985a6da","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"db185eb5dd98d08ebd84201f3ffe79bb460f235cabd68d68c25d347bd985a6da","first_computed_at":"2026-05-18T00:27:30.879934Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:27:30.879934Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dmmfWTp/LTSN/UnMUDRT+QUc6ApqyXi1YBdxi1mHczMrW5T1a6amOqke9pG9TJnFL6dNiz4htdYVCvj4ycrcCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:27:30.880656Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.07783","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:eb40d7814e7cd81874e8bf51446c10b36911290f9e949fc0641370ed476e6c7d","sha256:9185daf4d407010f2ac6505eab0a335000959d4e22d290e5cd79f03f2e21f273"],"state_sha256":"18af00c42a3c4499653841086e4fd1e7516199e317279fb8c782ddfbc5e2b356"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fS8RSTGfkHgyWGzTh/4KUig3lWoUrvaWxTXEtWXCj3VvjlAXGQ4jw5onPanOx9acqHr3LBhWA/Xr0YcY88HEDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T01:02:21.300399Z","bundle_sha256":"1e6d3f636fcd9f0ad9387629dd1504f9141546d228bbc82eff10e62885cfec1d"}}