{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:E7FM5BA4FTRYYKXZT2BYEU3ZXM","short_pith_number":"pith:E7FM5BA4","schema_version":"1.0","canonical_sha256":"27cace841c2ce38c2af99e83825379bb37fd80424da5dafc18d71edbca69cce4","source":{"kind":"arxiv","id":"1601.01421","version":2},"attestation_state":"computed","paper":{"title":"Repeated-root constacyclic codes of length $3lp^{s}$ and their dual codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Lanqiang Li, Li Liu, Shixin Zhu, Xiaoshan Kai","submitted_at":"2016-01-07T07:22:28Z","abstract_excerpt":"Let $p\\neq3$ be any prime and $l\\neq3$ be any odd prime with $gcd(p,l)=1$. $F_{q}^{*}=\\langle\\xi\\rangle$ is decomposed into mutually disjoint union of $gcd(q-1,3lp^{s})$ coset over the subgroup $\\langle\\xi^{3lp^{s}}\\rangle$, where $\\xi$ is a primitive $(q-1)$th root of unity. We classify all repeated-root constacyclic codes of length $3lp^{s}$ over the finite field $F_{q}$ into some equivalence classes by the decomposition, where $q=p^{m}$, $s$ and $m$ are positive integers. According to the equivalence classes, we explicitly determine the generator polynomials of all repeated-root constacycli"},"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":"1601.01421","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-07T07:22:28Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"46756a90d828e8d9d0571cc67b3c5e30f73e46483f075f13f7d465893470fb40","abstract_canon_sha256":"9526f88038bd220502d55d106b9463e398697cd03bf5742391ba0f0a63d07cd9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:22:09.957333Z","signature_b64":"WDvGo8kL37nx1Cl7+nvbvjaeF/+Vfuj8G8pPKTT17Oc7XzqStEnSYwFRQRlvRJoaJdR9EbBDA9LY7mSU4vfQCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"27cace841c2ce38c2af99e83825379bb37fd80424da5dafc18d71edbca69cce4","last_reissued_at":"2026-05-18T01:22:09.956767Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:22:09.956767Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Repeated-root constacyclic codes of length $3lp^{s}$ and their dual codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Lanqiang Li, Li Liu, Shixin Zhu, Xiaoshan Kai","submitted_at":"2016-01-07T07:22:28Z","abstract_excerpt":"Let $p\\neq3$ be any prime and $l\\neq3$ be any odd prime with $gcd(p,l)=1$. $F_{q}^{*}=\\langle\\xi\\rangle$ is decomposed into mutually disjoint union of $gcd(q-1,3lp^{s})$ coset over the subgroup $\\langle\\xi^{3lp^{s}}\\rangle$, where $\\xi$ is a primitive $(q-1)$th root of unity. We classify all repeated-root constacyclic codes of length $3lp^{s}$ over the finite field $F_{q}$ into some equivalence classes by the decomposition, where $q=p^{m}$, $s$ and $m$ are positive integers. According to the equivalence classes, we explicitly determine the generator polynomials of all repeated-root constacycli"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.01421","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":"1601.01421","created_at":"2026-05-18T01:22:09.956849+00:00"},{"alias_kind":"arxiv_version","alias_value":"1601.01421v2","created_at":"2026-05-18T01:22:09.956849+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.01421","created_at":"2026-05-18T01:22:09.956849+00:00"},{"alias_kind":"pith_short_12","alias_value":"E7FM5BA4FTRY","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_16","alias_value":"E7FM5BA4FTRYYKXZ","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_8","alias_value":"E7FM5BA4","created_at":"2026-05-18T12:30:12.583610+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/E7FM5BA4FTRYYKXZT2BYEU3ZXM","json":"https://pith.science/pith/E7FM5BA4FTRYYKXZT2BYEU3ZXM.json","graph_json":"https://pith.science/api/pith-number/E7FM5BA4FTRYYKXZT2BYEU3ZXM/graph.json","events_json":"https://pith.science/api/pith-number/E7FM5BA4FTRYYKXZT2BYEU3ZXM/events.json","paper":"https://pith.science/paper/E7FM5BA4"},"agent_actions":{"view_html":"https://pith.science/pith/E7FM5BA4FTRYYKXZT2BYEU3ZXM","download_json":"https://pith.science/pith/E7FM5BA4FTRYYKXZT2BYEU3ZXM.json","view_paper":"https://pith.science/paper/E7FM5BA4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1601.01421&json=true","fetch_graph":"https://pith.science/api/pith-number/E7FM5BA4FTRYYKXZT2BYEU3ZXM/graph.json","fetch_events":"https://pith.science/api/pith-number/E7FM5BA4FTRYYKXZT2BYEU3ZXM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/E7FM5BA4FTRYYKXZT2BYEU3ZXM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/E7FM5BA4FTRYYKXZT2BYEU3ZXM/action/storage_attestation","attest_author":"https://pith.science/pith/E7FM5BA4FTRYYKXZT2BYEU3ZXM/action/author_attestation","sign_citation":"https://pith.science/pith/E7FM5BA4FTRYYKXZT2BYEU3ZXM/action/citation_signature","submit_replication":"https://pith.science/pith/E7FM5BA4FTRYYKXZT2BYEU3ZXM/action/replication_record"}},"created_at":"2026-05-18T01:22:09.956849+00:00","updated_at":"2026-05-18T01:22:09.956849+00:00"}