{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:FS4Q2QEEBSMIW2BFIEPBLWVWWR","short_pith_number":"pith:FS4Q2QEE","canonical_record":{"source":{"id":"1803.01095","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-03-03T02:50:16Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"8faa5bb7b61c177cdfdd22a72d02096b92226d9537de39a45c482c1d82a7ca05","abstract_canon_sha256":"0d9c8ab7dbe2c8c103c9b2826769bedc3a48b1a69032db58377481ecaf470d68"},"schema_version":"1.0"},"canonical_sha256":"2cb90d40840c988b6825411e15dab6b479ee4cdd6b06cf0d4123b0168baec6ff","source":{"kind":"arxiv","id":"1803.01095","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.01095","created_at":"2026-05-18T00:22:01Z"},{"alias_kind":"arxiv_version","alias_value":"1803.01095v1","created_at":"2026-05-18T00:22:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.01095","created_at":"2026-05-18T00:22:01Z"},{"alias_kind":"pith_short_12","alias_value":"FS4Q2QEEBSMI","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"FS4Q2QEEBSMIW2BF","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"FS4Q2QEE","created_at":"2026-05-18T12:32:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:FS4Q2QEEBSMIW2BFIEPBLWVWWR","target":"record","payload":{"canonical_record":{"source":{"id":"1803.01095","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-03-03T02:50:16Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"8faa5bb7b61c177cdfdd22a72d02096b92226d9537de39a45c482c1d82a7ca05","abstract_canon_sha256":"0d9c8ab7dbe2c8c103c9b2826769bedc3a48b1a69032db58377481ecaf470d68"},"schema_version":"1.0"},"canonical_sha256":"2cb90d40840c988b6825411e15dab6b479ee4cdd6b06cf0d4123b0168baec6ff","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:01.783275Z","signature_b64":"fgxlbj33FxAbMOnJqH+g553TKb2CY1dJ6W62loatF9Ok3P0JQ+/jnT0TDiCmsJKlxvDmQ82pR0xoRUOfKYgFCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2cb90d40840c988b6825411e15dab6b479ee4cdd6b06cf0d4123b0168baec6ff","last_reissued_at":"2026-05-18T00:22:01.782739Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:01.782739Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1803.01095","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:22:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PHoPkVi97lQ2enmgJUjersgSgWKw8dnMz3nDkUzwL3ivBBV6d+Jx279tVAisH0EegTU9zoJmfNszPknnuhS7DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T22:18:26.356725Z"},"content_sha256":"1e78b7b03b61388490c74752c05763970cab1c29932ee261c8f36595111414f9","schema_version":"1.0","event_id":"sha256:1e78b7b03b61388490c74752c05763970cab1c29932ee261c8f36595111414f9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:FS4Q2QEEBSMIW2BFIEPBLWVWWR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Matrix-product structure of constacyclic codes over finite chain rings $\\mathbb{F}_{p^m}[u]/\\langle u^e\\rangle$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Fang-Wei Fu, Yonglin Cao, Yuan Cao","submitted_at":"2018-03-03T02:50:16Z","abstract_excerpt":"Let $m,e$ be positive integers, $p$ a prime number, $\\mathbb{F}_{p^m}$ be a finite field of $p^m$ elements and $R=\\mathbb{F}_{p^m}[u]/\\langle u^e\\rangle$ which is a finite chain ring. For any $\\omega\\in R^\\times$ and positive integers $k, n$ satisfying ${\\rm gcd}(p,n)=1$, we prove that any $(1+\\omega u)$-constacyclic code of length $p^kn$ over $R$ is monomially equivalent to a matrix-product code of a nested sequence of $p^k$ cyclic codes with length $n$ over $R$ and a $p^k\\times p^k$ matrix $A_{p^k}$ over $\\mathbb{F}_p$. Using the matrix-product structures, we give an iterative construction o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.01095","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:22:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HQE3Z+eypX7eU4SDrs6kToA/nn8zh4H/8ivlTDgXcvNuxTMiOgKFCoZMCQChH2kY5xsaLSK9PmR/TIVND5kCAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T22:18:26.357058Z"},"content_sha256":"25d1e4b6786da6daebcd89704cdd4def293b24b9ff1fca6fc40a124b5342628d","schema_version":"1.0","event_id":"sha256:25d1e4b6786da6daebcd89704cdd4def293b24b9ff1fca6fc40a124b5342628d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FS4Q2QEEBSMIW2BFIEPBLWVWWR/bundle.json","state_url":"https://pith.science/pith/FS4Q2QEEBSMIW2BFIEPBLWVWWR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FS4Q2QEEBSMIW2BFIEPBLWVWWR/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-01T22:18:26Z","links":{"resolver":"https://pith.science/pith/FS4Q2QEEBSMIW2BFIEPBLWVWWR","bundle":"https://pith.science/pith/FS4Q2QEEBSMIW2BFIEPBLWVWWR/bundle.json","state":"https://pith.science/pith/FS4Q2QEEBSMIW2BFIEPBLWVWWR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FS4Q2QEEBSMIW2BFIEPBLWVWWR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:FS4Q2QEEBSMIW2BFIEPBLWVWWR","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":"0d9c8ab7dbe2c8c103c9b2826769bedc3a48b1a69032db58377481ecaf470d68","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-03-03T02:50:16Z","title_canon_sha256":"8faa5bb7b61c177cdfdd22a72d02096b92226d9537de39a45c482c1d82a7ca05"},"schema_version":"1.0","source":{"id":"1803.01095","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.01095","created_at":"2026-05-18T00:22:01Z"},{"alias_kind":"arxiv_version","alias_value":"1803.01095v1","created_at":"2026-05-18T00:22:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.01095","created_at":"2026-05-18T00:22:01Z"},{"alias_kind":"pith_short_12","alias_value":"FS4Q2QEEBSMI","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"FS4Q2QEEBSMIW2BF","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"FS4Q2QEE","created_at":"2026-05-18T12:32:25Z"}],"graph_snapshots":[{"event_id":"sha256:25d1e4b6786da6daebcd89704cdd4def293b24b9ff1fca6fc40a124b5342628d","target":"graph","created_at":"2026-05-18T00:22:01Z","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 $m,e$ be positive integers, $p$ a prime number, $\\mathbb{F}_{p^m}$ be a finite field of $p^m$ elements and $R=\\mathbb{F}_{p^m}[u]/\\langle u^e\\rangle$ which is a finite chain ring. For any $\\omega\\in R^\\times$ and positive integers $k, n$ satisfying ${\\rm gcd}(p,n)=1$, we prove that any $(1+\\omega u)$-constacyclic code of length $p^kn$ over $R$ is monomially equivalent to a matrix-product code of a nested sequence of $p^k$ cyclic codes with length $n$ over $R$ and a $p^k\\times p^k$ matrix $A_{p^k}$ over $\\mathbb{F}_p$. Using the matrix-product structures, we give an iterative construction o","authors_text":"Fang-Wei Fu, Yonglin Cao, Yuan Cao","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-03-03T02:50:16Z","title":"Matrix-product structure of constacyclic codes over finite chain rings $\\mathbb{F}_{p^m}[u]/\\langle u^e\\rangle$"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.01095","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:1e78b7b03b61388490c74752c05763970cab1c29932ee261c8f36595111414f9","target":"record","created_at":"2026-05-18T00:22:01Z","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":"0d9c8ab7dbe2c8c103c9b2826769bedc3a48b1a69032db58377481ecaf470d68","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-03-03T02:50:16Z","title_canon_sha256":"8faa5bb7b61c177cdfdd22a72d02096b92226d9537de39a45c482c1d82a7ca05"},"schema_version":"1.0","source":{"id":"1803.01095","kind":"arxiv","version":1}},"canonical_sha256":"2cb90d40840c988b6825411e15dab6b479ee4cdd6b06cf0d4123b0168baec6ff","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2cb90d40840c988b6825411e15dab6b479ee4cdd6b06cf0d4123b0168baec6ff","first_computed_at":"2026-05-18T00:22:01.782739Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:22:01.782739Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fgxlbj33FxAbMOnJqH+g553TKb2CY1dJ6W62loatF9Ok3P0JQ+/jnT0TDiCmsJKlxvDmQ82pR0xoRUOfKYgFCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:22:01.783275Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.01095","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1e78b7b03b61388490c74752c05763970cab1c29932ee261c8f36595111414f9","sha256:25d1e4b6786da6daebcd89704cdd4def293b24b9ff1fca6fc40a124b5342628d"],"state_sha256":"aeee5b65bdc46da1bc58d802f376f26000baf93f0ab693f681271b7546c1ae2f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"U7FN5kw3Tc/xq4RRdPPGygCwq191TSxPn18S89WJf39j5+md91vKXJZlk/X9/vUnJl8LjrEWS31fbInRr+gkDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T22:18:26.358916Z","bundle_sha256":"b944d7e9e40c9bc73d6a17befb600550b46e54f0ee38b5af1fb0ca81f89e368b"}}