{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:I7I7UWNCKKD6Z7RUVZ2UMPVMPV","short_pith_number":"pith:I7I7UWNC","schema_version":"1.0","canonical_sha256":"47d1fa59a25287ecfe34ae75463eac7d77c729623d5aa49fff272ab68d80c667","source":{"kind":"arxiv","id":"1501.03924","version":4},"attestation_state":"computed","paper":{"title":"On cyclic codes over $\\mathbb{Z}_q+u\\mathbb{Z}_q$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Fang-Wei Fu, Jian Gao, Ling Xiao, Rama Krishna Bandi","submitted_at":"2015-01-16T09:36:11Z","abstract_excerpt":"Let $R=\\mathbb{Z}_q+u\\mathbb{Z}_q$, where $q=p^s$ and $u^2=0$. In this paper, some structural properties of cyclic codes over the ring $R$ are considered. A necessary and sufficient condition for cyclic codes over the ring $R$ to be free is obtained and a BCH-type bound on the minimum Hamming distance for them is also given."},"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":"1501.03924","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-01-16T09:36:11Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"939c649dd1274e6447c2c5e46b2cdb70b38f7e298bcea1f19c340b2c6470fe90","abstract_canon_sha256":"c64d0ba121311d160772881abb5a8501351f662992ce6f624c77438b599d0881"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:17:51.413662Z","signature_b64":"YEFksMQYtq6KhxgE1oVwxWvZ5w84y/d3v9aw0B8D6WA6gVcaPhPKLtbG+WPkwiNaG98XM2/X/Ce6k8PKLNRkAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"47d1fa59a25287ecfe34ae75463eac7d77c729623d5aa49fff272ab68d80c667","last_reissued_at":"2026-05-18T02:17:51.412948Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:17:51.412948Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On cyclic codes over $\\mathbb{Z}_q+u\\mathbb{Z}_q$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Fang-Wei Fu, Jian Gao, Ling Xiao, Rama Krishna Bandi","submitted_at":"2015-01-16T09:36:11Z","abstract_excerpt":"Let $R=\\mathbb{Z}_q+u\\mathbb{Z}_q$, where $q=p^s$ and $u^2=0$. In this paper, some structural properties of cyclic codes over the ring $R$ are considered. A necessary and sufficient condition for cyclic codes over the ring $R$ to be free is obtained and a BCH-type bound on the minimum Hamming distance for them is also given."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.03924","kind":"arxiv","version":4},"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":"1501.03924","created_at":"2026-05-18T02:17:51.413061+00:00"},{"alias_kind":"arxiv_version","alias_value":"1501.03924v4","created_at":"2026-05-18T02:17:51.413061+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.03924","created_at":"2026-05-18T02:17:51.413061+00:00"},{"alias_kind":"pith_short_12","alias_value":"I7I7UWNCKKD6","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_16","alias_value":"I7I7UWNCKKD6Z7RU","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_8","alias_value":"I7I7UWNC","created_at":"2026-05-18T12:29:25.134429+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/I7I7UWNCKKD6Z7RUVZ2UMPVMPV","json":"https://pith.science/pith/I7I7UWNCKKD6Z7RUVZ2UMPVMPV.json","graph_json":"https://pith.science/api/pith-number/I7I7UWNCKKD6Z7RUVZ2UMPVMPV/graph.json","events_json":"https://pith.science/api/pith-number/I7I7UWNCKKD6Z7RUVZ2UMPVMPV/events.json","paper":"https://pith.science/paper/I7I7UWNC"},"agent_actions":{"view_html":"https://pith.science/pith/I7I7UWNCKKD6Z7RUVZ2UMPVMPV","download_json":"https://pith.science/pith/I7I7UWNCKKD6Z7RUVZ2UMPVMPV.json","view_paper":"https://pith.science/paper/I7I7UWNC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1501.03924&json=true","fetch_graph":"https://pith.science/api/pith-number/I7I7UWNCKKD6Z7RUVZ2UMPVMPV/graph.json","fetch_events":"https://pith.science/api/pith-number/I7I7UWNCKKD6Z7RUVZ2UMPVMPV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/I7I7UWNCKKD6Z7RUVZ2UMPVMPV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/I7I7UWNCKKD6Z7RUVZ2UMPVMPV/action/storage_attestation","attest_author":"https://pith.science/pith/I7I7UWNCKKD6Z7RUVZ2UMPVMPV/action/author_attestation","sign_citation":"https://pith.science/pith/I7I7UWNCKKD6Z7RUVZ2UMPVMPV/action/citation_signature","submit_replication":"https://pith.science/pith/I7I7UWNCKKD6Z7RUVZ2UMPVMPV/action/replication_record"}},"created_at":"2026-05-18T02:17:51.413061+00:00","updated_at":"2026-05-18T02:17:51.413061+00:00"}