{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:M536PUFTYWAD4PXB5Y44INCZ4F","short_pith_number":"pith:M536PUFT","schema_version":"1.0","canonical_sha256":"6777e7d0b3c5803e3ee1ee39c43459e17914ac766b1f095be4908bdf9a2c59c7","source":{"kind":"arxiv","id":"1705.08819","version":2},"attestation_state":"computed","paper":{"title":"Matrix-product structure of repeated-root constacyclic codes over finite fields","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":"2017-05-24T15:33:01Z","abstract_excerpt":"For any prime number $p$, positive integers $m, k, n$ satisfying ${\\rm gcd}(p,n)=1$ and $\\lambda_0\\in \\mathbb{F}_{p^m}^\\times$, we prove that any $\\lambda_0^{p^k}$-constacyclic code of length $p^kn$ over the finite field $\\mathbb{F}_{p^m}$ is monomially equivalent to a matrix-product code of a nested sequence of $p^k$ $\\lambda_0$-constacyclic codes with length $n$ over $\\mathbb{F}_{p^m}$."},"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":"1705.08819","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-05-24T15:33:01Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"327ebf59c51d086f6d074d2996cc7fbd6f4ee28ddd01f489a515fb32bd684d93","abstract_canon_sha256":"e5eb97fccded83c7bce9a2eb4b6ee05a57f1a05023600f65c98dd935ac0b8470"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:36:31.490697Z","signature_b64":"HopmG4FpEqMG3TXamtJoHECMqOqqVn6/6pScmNzLJQrRMfLqupEPsPGAotMGU3vBHCq82XMIgM9p2UJ6jS+EAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6777e7d0b3c5803e3ee1ee39c43459e17914ac766b1f095be4908bdf9a2c59c7","last_reissued_at":"2026-05-18T00:36:31.490050Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:36:31.490050Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Matrix-product structure of repeated-root constacyclic codes over finite fields","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":"2017-05-24T15:33:01Z","abstract_excerpt":"For any prime number $p$, positive integers $m, k, n$ satisfying ${\\rm gcd}(p,n)=1$ and $\\lambda_0\\in \\mathbb{F}_{p^m}^\\times$, we prove that any $\\lambda_0^{p^k}$-constacyclic code of length $p^kn$ over the finite field $\\mathbb{F}_{p^m}$ is monomially equivalent to a matrix-product code of a nested sequence of $p^k$ $\\lambda_0$-constacyclic codes with length $n$ over $\\mathbb{F}_{p^m}$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.08819","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1705.08819","created_at":"2026-05-18T00:36:31.490147+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.08819v2","created_at":"2026-05-18T00:36:31.490147+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.08819","created_at":"2026-05-18T00:36:31.490147+00:00"},{"alias_kind":"pith_short_12","alias_value":"M536PUFTYWAD","created_at":"2026-05-18T12:31:28.150371+00:00"},{"alias_kind":"pith_short_16","alias_value":"M536PUFTYWAD4PXB","created_at":"2026-05-18T12:31:28.150371+00:00"},{"alias_kind":"pith_short_8","alias_value":"M536PUFT","created_at":"2026-05-18T12:31:28.150371+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/M536PUFTYWAD4PXB5Y44INCZ4F","json":"https://pith.science/pith/M536PUFTYWAD4PXB5Y44INCZ4F.json","graph_json":"https://pith.science/api/pith-number/M536PUFTYWAD4PXB5Y44INCZ4F/graph.json","events_json":"https://pith.science/api/pith-number/M536PUFTYWAD4PXB5Y44INCZ4F/events.json","paper":"https://pith.science/paper/M536PUFT"},"agent_actions":{"view_html":"https://pith.science/pith/M536PUFTYWAD4PXB5Y44INCZ4F","download_json":"https://pith.science/pith/M536PUFTYWAD4PXB5Y44INCZ4F.json","view_paper":"https://pith.science/paper/M536PUFT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.08819&json=true","fetch_graph":"https://pith.science/api/pith-number/M536PUFTYWAD4PXB5Y44INCZ4F/graph.json","fetch_events":"https://pith.science/api/pith-number/M536PUFTYWAD4PXB5Y44INCZ4F/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/M536PUFTYWAD4PXB5Y44INCZ4F/action/timestamp_anchor","attest_storage":"https://pith.science/pith/M536PUFTYWAD4PXB5Y44INCZ4F/action/storage_attestation","attest_author":"https://pith.science/pith/M536PUFTYWAD4PXB5Y44INCZ4F/action/author_attestation","sign_citation":"https://pith.science/pith/M536PUFTYWAD4PXB5Y44INCZ4F/action/citation_signature","submit_replication":"https://pith.science/pith/M536PUFTYWAD4PXB5Y44INCZ4F/action/replication_record"}},"created_at":"2026-05-18T00:36:31.490147+00:00","updated_at":"2026-05-18T00:36:31.490147+00:00"}