{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:K36TQ7T2EUXWXMOQLK3TLPHVLP","short_pith_number":"pith:K36TQ7T2","schema_version":"1.0","canonical_sha256":"56fd387e7a252f6bb1d05ab735bcf55beab15797698c28d523bfd4ebfab1c51e","source":{"kind":"arxiv","id":"1506.07273","version":1},"attestation_state":"computed","paper":{"title":"$(1-2u^2)$-constacyclic codes over $\\mathbb{F}_p+u\\mathbb{F}_p+u^2\\mathbb{F}_p$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hojjat Mostafanasab, Negin Karimi","submitted_at":"2015-06-24T08:00:27Z","abstract_excerpt":"Let $\\mathbb{F}_p$ be a finite field and $u$ be an indeterminate. This article studies $(1-2u^2)$-constacyclic codes over the ring $\\mathbb{F}_p+u\\mathbb{F}_p+u^2\\mathbb{F}_p$, where $u^3=u$. We describe generator polynomials of this kind of codes and investigate the structural properties of these codes by a decomposition theorem."},"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":"1506.07273","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-06-24T08:00:27Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"592adfb39d29964c89f51ea2818abd368395f56df181f799c026fd23ee9a90c7","abstract_canon_sha256":"d4cc8e77de806d4b0415b5d18a215244fe7df1db4347bd86273d5660a318b795"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:39:54.420514Z","signature_b64":"e4Wqu2Or3LTRMpetCB2vB/f+zcUYIt1oQzJCm2uHClSVg5au6RCn0kcIR7WbPF0M3gWdRXGlEao43j/IQsYBDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"56fd387e7a252f6bb1d05ab735bcf55beab15797698c28d523bfd4ebfab1c51e","last_reissued_at":"2026-05-18T01:39:54.419981Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:39:54.419981Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"$(1-2u^2)$-constacyclic codes over $\\mathbb{F}_p+u\\mathbb{F}_p+u^2\\mathbb{F}_p$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hojjat Mostafanasab, Negin Karimi","submitted_at":"2015-06-24T08:00:27Z","abstract_excerpt":"Let $\\mathbb{F}_p$ be a finite field and $u$ be an indeterminate. This article studies $(1-2u^2)$-constacyclic codes over the ring $\\mathbb{F}_p+u\\mathbb{F}_p+u^2\\mathbb{F}_p$, where $u^3=u$. We describe generator polynomials of this kind of codes and investigate the structural properties of these codes by a decomposition theorem."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.07273","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1506.07273","created_at":"2026-05-18T01:39:54.420059+00:00"},{"alias_kind":"arxiv_version","alias_value":"1506.07273v1","created_at":"2026-05-18T01:39:54.420059+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.07273","created_at":"2026-05-18T01:39:54.420059+00:00"},{"alias_kind":"pith_short_12","alias_value":"K36TQ7T2EUXW","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_16","alias_value":"K36TQ7T2EUXWXMOQ","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_8","alias_value":"K36TQ7T2","created_at":"2026-05-18T12:29:27.538025+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/K36TQ7T2EUXWXMOQLK3TLPHVLP","json":"https://pith.science/pith/K36TQ7T2EUXWXMOQLK3TLPHVLP.json","graph_json":"https://pith.science/api/pith-number/K36TQ7T2EUXWXMOQLK3TLPHVLP/graph.json","events_json":"https://pith.science/api/pith-number/K36TQ7T2EUXWXMOQLK3TLPHVLP/events.json","paper":"https://pith.science/paper/K36TQ7T2"},"agent_actions":{"view_html":"https://pith.science/pith/K36TQ7T2EUXWXMOQLK3TLPHVLP","download_json":"https://pith.science/pith/K36TQ7T2EUXWXMOQLK3TLPHVLP.json","view_paper":"https://pith.science/paper/K36TQ7T2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1506.07273&json=true","fetch_graph":"https://pith.science/api/pith-number/K36TQ7T2EUXWXMOQLK3TLPHVLP/graph.json","fetch_events":"https://pith.science/api/pith-number/K36TQ7T2EUXWXMOQLK3TLPHVLP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/K36TQ7T2EUXWXMOQLK3TLPHVLP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/K36TQ7T2EUXWXMOQLK3TLPHVLP/action/storage_attestation","attest_author":"https://pith.science/pith/K36TQ7T2EUXWXMOQLK3TLPHVLP/action/author_attestation","sign_citation":"https://pith.science/pith/K36TQ7T2EUXWXMOQLK3TLPHVLP/action/citation_signature","submit_replication":"https://pith.science/pith/K36TQ7T2EUXWXMOQLK3TLPHVLP/action/replication_record"}},"created_at":"2026-05-18T01:39:54.420059+00:00","updated_at":"2026-05-18T01:39:54.420059+00:00"}