{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:4DKDQFQDRRZ6IZ3PJA3YU4AWXA","short_pith_number":"pith:4DKDQFQD","canonical_record":{"source":{"id":"1512.01406","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-12-04T13:54:53Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"a07d16188d38eba76d70baabbf0a16bc10b2f814b30c3279ddbc70884f2e890a","abstract_canon_sha256":"12b2fe10c66783d039e11907af9a35921f6916ebc4343c9333956809a1432204"},"schema_version":"1.0"},"canonical_sha256":"e0d43816038c73e4676f48378a7016b8235ee3e5a50211ef2b0737034679f404","source":{"kind":"arxiv","id":"1512.01406","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.01406","created_at":"2026-05-18T00:32:15Z"},{"alias_kind":"arxiv_version","alias_value":"1512.01406v2","created_at":"2026-05-18T00:32:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.01406","created_at":"2026-05-18T00:32:15Z"},{"alias_kind":"pith_short_12","alias_value":"4DKDQFQDRRZ6","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_16","alias_value":"4DKDQFQDRRZ6IZ3P","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_8","alias_value":"4DKDQFQD","created_at":"2026-05-18T12:29:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:4DKDQFQDRRZ6IZ3PJA3YU4AWXA","target":"record","payload":{"canonical_record":{"source":{"id":"1512.01406","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-12-04T13:54:53Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"a07d16188d38eba76d70baabbf0a16bc10b2f814b30c3279ddbc70884f2e890a","abstract_canon_sha256":"12b2fe10c66783d039e11907af9a35921f6916ebc4343c9333956809a1432204"},"schema_version":"1.0"},"canonical_sha256":"e0d43816038c73e4676f48378a7016b8235ee3e5a50211ef2b0737034679f404","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:32:15.311424Z","signature_b64":"UKklNyiYcEsf/NTKH4DPaa0FK2Bf5jsozZJIuZwzdCn8hdKBIN5zr5TzRhNt4r2k8bx1/td/6yhzT6DA5oJ5BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e0d43816038c73e4676f48378a7016b8235ee3e5a50211ef2b0737034679f404","last_reissued_at":"2026-05-18T00:32:15.310810Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:32:15.310810Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1512.01406","source_version":2,"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:32:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DuZDA+vTDC/xmBqlBt0VuCpQr/jMthZJG6nektGhERPwlYKL2IzDhHrL2UFclfUPcwDxgYXYNkSSTfvGInlTDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T22:05:56.361972Z"},"content_sha256":"27aaf95bc067ec0d7e49f1c5816ae7d28065abfe5e7d0d4dec373fbede62257c","schema_version":"1.0","event_id":"sha256:27aaf95bc067ec0d7e49f1c5816ae7d28065abfe5e7d0d4dec373fbede62257c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:4DKDQFQDRRZ6IZ3PJA3YU4AWXA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Constacyclic codes of length $p^sn$ over $\\mathbb{F}_{p^m}+u\\mathbb{F}_{p^m}$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Fang-Wei Fu, Jian Gao, Yonglin Cao, Yuan Cao","submitted_at":"2015-12-04T13:54:53Z","abstract_excerpt":"Let $\\mathbb{F}_{p^m}$ be a finite field of cardinality $p^m$ and $R=\\mathbb{F}_{p^m}[u]/\\langle u^2\\rangle=\\mathbb{F}_{p^m}+u\\mathbb{F}_{p^m}$ $(u^2=0)$, where $p$ is a prime and $m$ is a positive integer. For any $\\lambda\\in \\mathbb{F}_{p^m}^{\\times}$, an explicit representation for all distinct $\\lambda$-constacyclic codes over $R$ of length $p^sn$ is given by a canonical form decomposition for each code, where $s$ and $n$ are positive integers satisfying ${\\rm gcd}(p,n)=1$. For any such code, using its canonical form decomposition the representation for the dual code of the code is provide"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.01406","kind":"arxiv","version":2},"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:32:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qVhZK4BWVv7iWSB7iu1ipXQJV4H9sIfLgMQ9jgb0bdXdxD9QtgCsHFsuYSFayJB4WXEVTLdgp0kFaPCRRfonBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T22:05:56.362338Z"},"content_sha256":"a313500f0821abd80dc645fc13358a3e4904637578df740afa7d45f02870e1ad","schema_version":"1.0","event_id":"sha256:a313500f0821abd80dc645fc13358a3e4904637578df740afa7d45f02870e1ad"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4DKDQFQDRRZ6IZ3PJA3YU4AWXA/bundle.json","state_url":"https://pith.science/pith/4DKDQFQDRRZ6IZ3PJA3YU4AWXA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4DKDQFQDRRZ6IZ3PJA3YU4AWXA/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-02T22:05:56Z","links":{"resolver":"https://pith.science/pith/4DKDQFQDRRZ6IZ3PJA3YU4AWXA","bundle":"https://pith.science/pith/4DKDQFQDRRZ6IZ3PJA3YU4AWXA/bundle.json","state":"https://pith.science/pith/4DKDQFQDRRZ6IZ3PJA3YU4AWXA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4DKDQFQDRRZ6IZ3PJA3YU4AWXA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:4DKDQFQDRRZ6IZ3PJA3YU4AWXA","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":"12b2fe10c66783d039e11907af9a35921f6916ebc4343c9333956809a1432204","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-12-04T13:54:53Z","title_canon_sha256":"a07d16188d38eba76d70baabbf0a16bc10b2f814b30c3279ddbc70884f2e890a"},"schema_version":"1.0","source":{"id":"1512.01406","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.01406","created_at":"2026-05-18T00:32:15Z"},{"alias_kind":"arxiv_version","alias_value":"1512.01406v2","created_at":"2026-05-18T00:32:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.01406","created_at":"2026-05-18T00:32:15Z"},{"alias_kind":"pith_short_12","alias_value":"4DKDQFQDRRZ6","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_16","alias_value":"4DKDQFQDRRZ6IZ3P","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_8","alias_value":"4DKDQFQD","created_at":"2026-05-18T12:29:05Z"}],"graph_snapshots":[{"event_id":"sha256:a313500f0821abd80dc645fc13358a3e4904637578df740afa7d45f02870e1ad","target":"graph","created_at":"2026-05-18T00:32:15Z","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":"Let $\\mathbb{F}_{p^m}$ be a finite field of cardinality $p^m$ and $R=\\mathbb{F}_{p^m}[u]/\\langle u^2\\rangle=\\mathbb{F}_{p^m}+u\\mathbb{F}_{p^m}$ $(u^2=0)$, where $p$ is a prime and $m$ is a positive integer. For any $\\lambda\\in \\mathbb{F}_{p^m}^{\\times}$, an explicit representation for all distinct $\\lambda$-constacyclic codes over $R$ of length $p^sn$ is given by a canonical form decomposition for each code, where $s$ and $n$ are positive integers satisfying ${\\rm gcd}(p,n)=1$. For any such code, using its canonical form decomposition the representation for the dual code of the code is provide","authors_text":"Fang-Wei Fu, Jian Gao, Yonglin Cao, Yuan Cao","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-12-04T13:54:53Z","title":"Constacyclic codes of length $p^sn$ over $\\mathbb{F}_{p^m}+u\\mathbb{F}_{p^m}$"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.01406","kind":"arxiv","version":2},"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:27aaf95bc067ec0d7e49f1c5816ae7d28065abfe5e7d0d4dec373fbede62257c","target":"record","created_at":"2026-05-18T00:32:15Z","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":"12b2fe10c66783d039e11907af9a35921f6916ebc4343c9333956809a1432204","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-12-04T13:54:53Z","title_canon_sha256":"a07d16188d38eba76d70baabbf0a16bc10b2f814b30c3279ddbc70884f2e890a"},"schema_version":"1.0","source":{"id":"1512.01406","kind":"arxiv","version":2}},"canonical_sha256":"e0d43816038c73e4676f48378a7016b8235ee3e5a50211ef2b0737034679f404","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e0d43816038c73e4676f48378a7016b8235ee3e5a50211ef2b0737034679f404","first_computed_at":"2026-05-18T00:32:15.310810Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:32:15.310810Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UKklNyiYcEsf/NTKH4DPaa0FK2Bf5jsozZJIuZwzdCn8hdKBIN5zr5TzRhNt4r2k8bx1/td/6yhzT6DA5oJ5BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:32:15.311424Z","signed_message":"canonical_sha256_bytes"},"source_id":"1512.01406","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:27aaf95bc067ec0d7e49f1c5816ae7d28065abfe5e7d0d4dec373fbede62257c","sha256:a313500f0821abd80dc645fc13358a3e4904637578df740afa7d45f02870e1ad"],"state_sha256":"8b61b2f99fb6e9057915af1bdd41b0135b192ce96601394eef406198275908de"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0g8ktToiE/9coeDtF00d9FTSzlrADNW6+yQcb6q/RB4y60mlZp87paj5j156NTOhg8bKzImFwx2lxeA9jzZ4Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T22:05:56.364965Z","bundle_sha256":"d65df05ecca4a6925a3b02e7350e46f56acb48b08be673f9b411e30516c75e30"}}