{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:E7FM5BA4FTRYYKXZT2BYEU3ZXM","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":"9526f88038bd220502d55d106b9463e398697cd03bf5742391ba0f0a63d07cd9","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-07T07:22:28Z","title_canon_sha256":"46756a90d828e8d9d0571cc67b3c5e30f73e46483f075f13f7d465893470fb40"},"schema_version":"1.0","source":{"id":"1601.01421","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.01421","created_at":"2026-05-18T01:22:09Z"},{"alias_kind":"arxiv_version","alias_value":"1601.01421v2","created_at":"2026-05-18T01:22:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.01421","created_at":"2026-05-18T01:22:09Z"},{"alias_kind":"pith_short_12","alias_value":"E7FM5BA4FTRY","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"E7FM5BA4FTRYYKXZ","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"E7FM5BA4","created_at":"2026-05-18T12:30:12Z"}],"graph_snapshots":[{"event_id":"sha256:c1918896ac5a3fbd06a8b831f26fa1cd6c6465acf7d224819d4e35f7fb5da102","target":"graph","created_at":"2026-05-18T01:22:09Z","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 $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","authors_text":"Lanqiang Li, Li Liu, Shixin Zhu, Xiaoshan Kai","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-07T07:22:28Z","title":"Repeated-root constacyclic codes of length $3lp^{s}$ and their dual codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.01421","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:9ee0ef732061747fcce3c83aacccbb0d12448406cd6760947730203781fab4e3","target":"record","created_at":"2026-05-18T01:22:09Z","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":"9526f88038bd220502d55d106b9463e398697cd03bf5742391ba0f0a63d07cd9","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-07T07:22:28Z","title_canon_sha256":"46756a90d828e8d9d0571cc67b3c5e30f73e46483f075f13f7d465893470fb40"},"schema_version":"1.0","source":{"id":"1601.01421","kind":"arxiv","version":2}},"canonical_sha256":"27cace841c2ce38c2af99e83825379bb37fd80424da5dafc18d71edbca69cce4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"27cace841c2ce38c2af99e83825379bb37fd80424da5dafc18d71edbca69cce4","first_computed_at":"2026-05-18T01:22:09.956767Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:22:09.956767Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WDvGo8kL37nx1Cl7+nvbvjaeF/+Vfuj8G8pPKTT17Oc7XzqStEnSYwFRQRlvRJoaJdR9EbBDA9LY7mSU4vfQCw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:22:09.957333Z","signed_message":"canonical_sha256_bytes"},"source_id":"1601.01421","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9ee0ef732061747fcce3c83aacccbb0d12448406cd6760947730203781fab4e3","sha256:c1918896ac5a3fbd06a8b831f26fa1cd6c6465acf7d224819d4e35f7fb5da102"],"state_sha256":"c6e6facf4051c251b4589cdc7377d9e6d5edc9b4b1b0b3dfba857fad13d16c56"}