{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:WAAMQKIX7RFYFJZP4R2OEYBRKL","short_pith_number":"pith:WAAMQKIX","schema_version":"1.0","canonical_sha256":"b000c82917fc4b82a72fe474e2603152e077aca1258c71206ba475afd27cb39a","source":{"kind":"arxiv","id":"1205.4148","version":1},"attestation_state":"computed","paper":{"title":"On cyclic codes over the ring $Z_p + uZ_p + ... + u^{k-1}Z_p$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.NT"],"primary_cat":"cs.IT","authors_text":"Abhay Kumar Singh, Pramod Kumar Kewat","submitted_at":"2012-05-18T12:19:30Z","abstract_excerpt":"In this paper, we study cyclic codes over the ring $ \\Z_p + u\\Z_p +...+ u^{k-1}\\Z_p $, where $u^k =0$. We find a set of generator for these codes. We also study the rank, the dual and the Hamming distance of these codes."},"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":"1205.4148","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-05-18T12:19:30Z","cross_cats_sorted":["math.IT","math.NT"],"title_canon_sha256":"1fac05fa0560df2f01bec04570339a8a01b2f1f58f65a068f72db010a4b67015","abstract_canon_sha256":"602c3336e1428bcbbb06c60dd387021a801665d7688724c6906b80a7b8d6b48e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:55:22.620399Z","signature_b64":"FoLKQPkZ6OthZvx7sAyTi5gkb/9VD9gJM7oQFpxGBMqv7zN0OCOnkbQvRaQIS+S8uu4Nkx9z63F0/o95gfZfDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b000c82917fc4b82a72fe474e2603152e077aca1258c71206ba475afd27cb39a","last_reissued_at":"2026-05-18T03:55:22.619877Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:55:22.619877Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On cyclic codes over the ring $Z_p + uZ_p + ... + u^{k-1}Z_p$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.NT"],"primary_cat":"cs.IT","authors_text":"Abhay Kumar Singh, Pramod Kumar Kewat","submitted_at":"2012-05-18T12:19:30Z","abstract_excerpt":"In this paper, we study cyclic codes over the ring $ \\Z_p + u\\Z_p +...+ u^{k-1}\\Z_p $, where $u^k =0$. We find a set of generator for these codes. We also study the rank, the dual and the Hamming distance of these codes."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.4148","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":"1205.4148","created_at":"2026-05-18T03:55:22.619951+00:00"},{"alias_kind":"arxiv_version","alias_value":"1205.4148v1","created_at":"2026-05-18T03:55:22.619951+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.4148","created_at":"2026-05-18T03:55:22.619951+00:00"},{"alias_kind":"pith_short_12","alias_value":"WAAMQKIX7RFY","created_at":"2026-05-18T12:27:25.539911+00:00"},{"alias_kind":"pith_short_16","alias_value":"WAAMQKIX7RFYFJZP","created_at":"2026-05-18T12:27:25.539911+00:00"},{"alias_kind":"pith_short_8","alias_value":"WAAMQKIX","created_at":"2026-05-18T12:27:25.539911+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/WAAMQKIX7RFYFJZP4R2OEYBRKL","json":"https://pith.science/pith/WAAMQKIX7RFYFJZP4R2OEYBRKL.json","graph_json":"https://pith.science/api/pith-number/WAAMQKIX7RFYFJZP4R2OEYBRKL/graph.json","events_json":"https://pith.science/api/pith-number/WAAMQKIX7RFYFJZP4R2OEYBRKL/events.json","paper":"https://pith.science/paper/WAAMQKIX"},"agent_actions":{"view_html":"https://pith.science/pith/WAAMQKIX7RFYFJZP4R2OEYBRKL","download_json":"https://pith.science/pith/WAAMQKIX7RFYFJZP4R2OEYBRKL.json","view_paper":"https://pith.science/paper/WAAMQKIX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1205.4148&json=true","fetch_graph":"https://pith.science/api/pith-number/WAAMQKIX7RFYFJZP4R2OEYBRKL/graph.json","fetch_events":"https://pith.science/api/pith-number/WAAMQKIX7RFYFJZP4R2OEYBRKL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WAAMQKIX7RFYFJZP4R2OEYBRKL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WAAMQKIX7RFYFJZP4R2OEYBRKL/action/storage_attestation","attest_author":"https://pith.science/pith/WAAMQKIX7RFYFJZP4R2OEYBRKL/action/author_attestation","sign_citation":"https://pith.science/pith/WAAMQKIX7RFYFJZP4R2OEYBRKL/action/citation_signature","submit_replication":"https://pith.science/pith/WAAMQKIX7RFYFJZP4R2OEYBRKL/action/replication_record"}},"created_at":"2026-05-18T03:55:22.619951+00:00","updated_at":"2026-05-18T03:55:22.619951+00:00"}