{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:NBDDRDAJGRE2REXEKB3YUYRXOO","short_pith_number":"pith:NBDDRDAJ","canonical_record":{"source":{"id":"1703.00761","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-03-02T12:34:35Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"5951ffcf09ed4bd5c4c88af406a096d353eb8a609c19252d488fe45c740ba5cc","abstract_canon_sha256":"5edaeb38f9965bcfb03cb7f06b9345b28bca3ff5404856d174ef4aab602ed9d9"},"schema_version":"1.0"},"canonical_sha256":"6846388c093449a892e450778a623773888b1185ce8012b95f460d978d1e75d8","source":{"kind":"arxiv","id":"1703.00761","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.00761","created_at":"2026-05-18T00:49:40Z"},{"alias_kind":"arxiv_version","alias_value":"1703.00761v1","created_at":"2026-05-18T00:49:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.00761","created_at":"2026-05-18T00:49:40Z"},{"alias_kind":"pith_short_12","alias_value":"NBDDRDAJGRE2","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"NBDDRDAJGRE2REXE","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"NBDDRDAJ","created_at":"2026-05-18T12:31:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:NBDDRDAJGRE2REXEKB3YUYRXOO","target":"record","payload":{"canonical_record":{"source":{"id":"1703.00761","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-03-02T12:34:35Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"5951ffcf09ed4bd5c4c88af406a096d353eb8a609c19252d488fe45c740ba5cc","abstract_canon_sha256":"5edaeb38f9965bcfb03cb7f06b9345b28bca3ff5404856d174ef4aab602ed9d9"},"schema_version":"1.0"},"canonical_sha256":"6846388c093449a892e450778a623773888b1185ce8012b95f460d978d1e75d8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:49:40.828908Z","signature_b64":"hI0KkIxdY0sgc6ZUOGJqEZOkuA7XVDJfp2Inot15+t0M7uC0XDKx6F4zYLkXoxfwxoGI30GbXSOIFHh69uMGCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6846388c093449a892e450778a623773888b1185ce8012b95f460d978d1e75d8","last_reissued_at":"2026-05-18T00:49:40.827962Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:49:40.827962Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1703.00761","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:49:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Eu67huBlXMxB/n7/ESECFJYEGCmuMlbi9r/A2onE4LYaLJyS7Ll3Owh0bQwYzHrToGOCQl3swjiHsrINvyHqAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T23:00:27.993445Z"},"content_sha256":"c76a559bd70942eb73875514b53a38844ae54925fdf7dc35add80456cd03c425","schema_version":"1.0","event_id":"sha256:c76a559bd70942eb73875514b53a38844ae54925fdf7dc35add80456cd03c425"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:NBDDRDAJGRE2REXEKB3YUYRXOO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On a class of constacyclic codes over the non-principal ideal ring $\\mathbb{Z}_{p^s}+u\\mathbb{Z}_{p^s}$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Yonglin Cao, Yuan Cao","submitted_at":"2017-03-02T12:34:35Z","abstract_excerpt":"$(1+pw)$-constacyclic codes of arbitrary length over the non-principal ideal ring $\\mathbb{Z}_{p^s} +u\\mathbb{Z}_{p^s}$ are studied, where $p$ is a prime, $w\\in \\mathbb{Z}_{p^s}^{\\times}$ and $s$ an integer satisfying $s\\geq 2$. First, the structure of any $(1+pw)$-constacyclic code over $\\mathbb{Z}_{p^s} +u\\mathbb{Z}_{p^s}$ are presented. Then enumerations for the number of all codes and the number of codewords in each code, and the structure of dual codes for these codes are given, respectively. Then self-dual $(1+2w)$-constacyclic codes over $\\mathbb{Z}_{2^s} +u\\mathbb{Z}_{2^s}$ are investi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.00761","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:49:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VHWW0lgA+PpfvQsurY44Di6qbT2V2vBFQOUe/koVpeTRJPiqpkoY4HnKWqlShhM6BtdKyMEiO729G94/gAl6DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T23:00:27.993797Z"},"content_sha256":"57f5d57ae63f35ec1e0de8ff8c21b3bc79d7dee6759f3f9034e37d2997e1536f","schema_version":"1.0","event_id":"sha256:57f5d57ae63f35ec1e0de8ff8c21b3bc79d7dee6759f3f9034e37d2997e1536f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NBDDRDAJGRE2REXEKB3YUYRXOO/bundle.json","state_url":"https://pith.science/pith/NBDDRDAJGRE2REXEKB3YUYRXOO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NBDDRDAJGRE2REXEKB3YUYRXOO/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-01T23:00:27Z","links":{"resolver":"https://pith.science/pith/NBDDRDAJGRE2REXEKB3YUYRXOO","bundle":"https://pith.science/pith/NBDDRDAJGRE2REXEKB3YUYRXOO/bundle.json","state":"https://pith.science/pith/NBDDRDAJGRE2REXEKB3YUYRXOO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NBDDRDAJGRE2REXEKB3YUYRXOO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:NBDDRDAJGRE2REXEKB3YUYRXOO","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":"5edaeb38f9965bcfb03cb7f06b9345b28bca3ff5404856d174ef4aab602ed9d9","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-03-02T12:34:35Z","title_canon_sha256":"5951ffcf09ed4bd5c4c88af406a096d353eb8a609c19252d488fe45c740ba5cc"},"schema_version":"1.0","source":{"id":"1703.00761","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.00761","created_at":"2026-05-18T00:49:40Z"},{"alias_kind":"arxiv_version","alias_value":"1703.00761v1","created_at":"2026-05-18T00:49:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.00761","created_at":"2026-05-18T00:49:40Z"},{"alias_kind":"pith_short_12","alias_value":"NBDDRDAJGRE2","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"NBDDRDAJGRE2REXE","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"NBDDRDAJ","created_at":"2026-05-18T12:31:31Z"}],"graph_snapshots":[{"event_id":"sha256:57f5d57ae63f35ec1e0de8ff8c21b3bc79d7dee6759f3f9034e37d2997e1536f","target":"graph","created_at":"2026-05-18T00:49:40Z","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":"$(1+pw)$-constacyclic codes of arbitrary length over the non-principal ideal ring $\\mathbb{Z}_{p^s} +u\\mathbb{Z}_{p^s}$ are studied, where $p$ is a prime, $w\\in \\mathbb{Z}_{p^s}^{\\times}$ and $s$ an integer satisfying $s\\geq 2$. First, the structure of any $(1+pw)$-constacyclic code over $\\mathbb{Z}_{p^s} +u\\mathbb{Z}_{p^s}$ are presented. Then enumerations for the number of all codes and the number of codewords in each code, and the structure of dual codes for these codes are given, respectively. Then self-dual $(1+2w)$-constacyclic codes over $\\mathbb{Z}_{2^s} +u\\mathbb{Z}_{2^s}$ are investi","authors_text":"Yonglin Cao, Yuan Cao","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-03-02T12:34:35Z","title":"On a class of constacyclic codes over the non-principal ideal ring $\\mathbb{Z}_{p^s}+u\\mathbb{Z}_{p^s}$"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.00761","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:c76a559bd70942eb73875514b53a38844ae54925fdf7dc35add80456cd03c425","target":"record","created_at":"2026-05-18T00:49:40Z","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":"5edaeb38f9965bcfb03cb7f06b9345b28bca3ff5404856d174ef4aab602ed9d9","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-03-02T12:34:35Z","title_canon_sha256":"5951ffcf09ed4bd5c4c88af406a096d353eb8a609c19252d488fe45c740ba5cc"},"schema_version":"1.0","source":{"id":"1703.00761","kind":"arxiv","version":1}},"canonical_sha256":"6846388c093449a892e450778a623773888b1185ce8012b95f460d978d1e75d8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6846388c093449a892e450778a623773888b1185ce8012b95f460d978d1e75d8","first_computed_at":"2026-05-18T00:49:40.827962Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:49:40.827962Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hI0KkIxdY0sgc6ZUOGJqEZOkuA7XVDJfp2Inot15+t0M7uC0XDKx6F4zYLkXoxfwxoGI30GbXSOIFHh69uMGCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:49:40.828908Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.00761","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c76a559bd70942eb73875514b53a38844ae54925fdf7dc35add80456cd03c425","sha256:57f5d57ae63f35ec1e0de8ff8c21b3bc79d7dee6759f3f9034e37d2997e1536f"],"state_sha256":"6c9d7f93f0c99877c4db2059a06150d553ed060aab13fddaecc30d95e833a562"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bl0E+eMlR7Mh74OafvAlBJgr/twO+96tVrGjs3grHI5YAXqjrq9noJDVOyzs597hB8XkqBfdvnlqyG2e2Y8yDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T23:00:27.995729Z","bundle_sha256":"4b14053b109399ba3a30b6d1e7d6e07fa39cf471f6e4a9941f69ea6bcac7230b"}}