{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:26MKDBTVB2LPNNZIQX5UEWKPI7","short_pith_number":"pith:26MKDBTV","schema_version":"1.0","canonical_sha256":"d798a186750e96f6b72885fb42594f47d5538cf0100e2e73c83f8852d1f8dd17","source":{"kind":"arxiv","id":"1210.0140","version":1},"attestation_state":"computed","paper":{"title":"Polycyclic codes over Galois rings with applications to repeated-root constacyclic codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"math.RA","authors_text":"Ferruh Ozbudak, Hakan Ozadam, Sergio R. Lopez-Permouth, Steve Szabo","submitted_at":"2012-09-29T18:30:13Z","abstract_excerpt":"Cyclic, negacyclic and constacyclic codes are part of a larger class of codes called polycyclic codes; namely, those codes which can be viewed as ideals of a factor ring of a polynomial ring. The structure of the ambient ring of polycyclic codes over GR(p^a,m) and generating sets for its ideals are considered. Along with some structure details of the ambient ring, the existance of a certain type of generating set for an ideal is proven."},"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":"1210.0140","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.RA","submitted_at":"2012-09-29T18:30:13Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"2e9b1cbc3ff66ca61e045ad9f3ca54ceb6db43bd2f1269f0b5d4bbd54b951563","abstract_canon_sha256":"3ad8d051ffb7959277366f8850c6fc9973dabf458b2a6d7ff8a47ae76339c9a5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:44:23.209300Z","signature_b64":"A3av5xpwJYQWpf9kddD5l/ZgI3t2h+UwnS2uc+P4z2LgZbuooqeoXZiia5yCL3WO/+uUJyR+PW/wS9UTiv6kDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d798a186750e96f6b72885fb42594f47d5538cf0100e2e73c83f8852d1f8dd17","last_reissued_at":"2026-05-18T03:44:23.208752Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:44:23.208752Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Polycyclic codes over Galois rings with applications to repeated-root constacyclic codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"math.RA","authors_text":"Ferruh Ozbudak, Hakan Ozadam, Sergio R. Lopez-Permouth, Steve Szabo","submitted_at":"2012-09-29T18:30:13Z","abstract_excerpt":"Cyclic, negacyclic and constacyclic codes are part of a larger class of codes called polycyclic codes; namely, those codes which can be viewed as ideals of a factor ring of a polynomial ring. The structure of the ambient ring of polycyclic codes over GR(p^a,m) and generating sets for its ideals are considered. Along with some structure details of the ambient ring, the existance of a certain type of generating set for an ideal is proven."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.0140","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":"1210.0140","created_at":"2026-05-18T03:44:23.208840+00:00"},{"alias_kind":"arxiv_version","alias_value":"1210.0140v1","created_at":"2026-05-18T03:44:23.208840+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.0140","created_at":"2026-05-18T03:44:23.208840+00:00"},{"alias_kind":"pith_short_12","alias_value":"26MKDBTVB2LP","created_at":"2026-05-18T12:26:50.516681+00:00"},{"alias_kind":"pith_short_16","alias_value":"26MKDBTVB2LPNNZI","created_at":"2026-05-18T12:26:50.516681+00:00"},{"alias_kind":"pith_short_8","alias_value":"26MKDBTV","created_at":"2026-05-18T12:26:50.516681+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/26MKDBTVB2LPNNZIQX5UEWKPI7","json":"https://pith.science/pith/26MKDBTVB2LPNNZIQX5UEWKPI7.json","graph_json":"https://pith.science/api/pith-number/26MKDBTVB2LPNNZIQX5UEWKPI7/graph.json","events_json":"https://pith.science/api/pith-number/26MKDBTVB2LPNNZIQX5UEWKPI7/events.json","paper":"https://pith.science/paper/26MKDBTV"},"agent_actions":{"view_html":"https://pith.science/pith/26MKDBTVB2LPNNZIQX5UEWKPI7","download_json":"https://pith.science/pith/26MKDBTVB2LPNNZIQX5UEWKPI7.json","view_paper":"https://pith.science/paper/26MKDBTV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1210.0140&json=true","fetch_graph":"https://pith.science/api/pith-number/26MKDBTVB2LPNNZIQX5UEWKPI7/graph.json","fetch_events":"https://pith.science/api/pith-number/26MKDBTVB2LPNNZIQX5UEWKPI7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/26MKDBTVB2LPNNZIQX5UEWKPI7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/26MKDBTVB2LPNNZIQX5UEWKPI7/action/storage_attestation","attest_author":"https://pith.science/pith/26MKDBTVB2LPNNZIQX5UEWKPI7/action/author_attestation","sign_citation":"https://pith.science/pith/26MKDBTVB2LPNNZIQX5UEWKPI7/action/citation_signature","submit_replication":"https://pith.science/pith/26MKDBTVB2LPNNZIQX5UEWKPI7/action/replication_record"}},"created_at":"2026-05-18T03:44:23.208840+00:00","updated_at":"2026-05-18T03:44:23.208840+00:00"}