{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:PA24INLNZ4QJTUNO6S4THU4DYQ","short_pith_number":"pith:PA24INLN","schema_version":"1.0","canonical_sha256":"7835c4356dcf2099d1aef4b933d383c431ac9c1a86d198085250bb8443a55f42","source":{"kind":"arxiv","id":"1711.01803","version":1},"attestation_state":"computed","paper":{"title":"On Codes over $\\mathbb{Z}_{p^2}$ and its Covering Radius","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"C. Durairajan, N. Annamalai","submitted_at":"2017-11-06T09:39:03Z","abstract_excerpt":"This paper gives lower and upper bounds on the covering radius of codes over $\\mathbb{Z}_{p^2}$ with respect to Lee distance. We also determine the covering radius of various Repetition codes over $\\mathbb{Z}_{p^2}.$"},"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":"1711.01803","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-11-06T09:39:03Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"0ef41331aa3c875595b21469c84fa425bc1e7625c3dcbbade46378526f440094","abstract_canon_sha256":"8fab2078da768bc350b9c843e531579d79a023f5fc5f9ba6ab430394149ec6a3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:16.813846Z","signature_b64":"xA/F6fX1K08xYWrGxwt04bx9lOJehbhTUZcPdFkP+viT0ndVrkXFvIBiz0nV2BuHXh67Jaoq/0h+LXmCJlTACg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7835c4356dcf2099d1aef4b933d383c431ac9c1a86d198085250bb8443a55f42","last_reissued_at":"2026-05-18T00:31:16.813374Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:16.813374Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Codes over $\\mathbb{Z}_{p^2}$ and its Covering Radius","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"C. Durairajan, N. Annamalai","submitted_at":"2017-11-06T09:39:03Z","abstract_excerpt":"This paper gives lower and upper bounds on the covering radius of codes over $\\mathbb{Z}_{p^2}$ with respect to Lee distance. We also determine the covering radius of various Repetition codes over $\\mathbb{Z}_{p^2}.$"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.01803","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":"1711.01803","created_at":"2026-05-18T00:31:16.813452+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.01803v1","created_at":"2026-05-18T00:31:16.813452+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.01803","created_at":"2026-05-18T00:31:16.813452+00:00"},{"alias_kind":"pith_short_12","alias_value":"PA24INLNZ4QJ","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_16","alias_value":"PA24INLNZ4QJTUNO","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_8","alias_value":"PA24INLN","created_at":"2026-05-18T12:31:37.085036+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/PA24INLNZ4QJTUNO6S4THU4DYQ","json":"https://pith.science/pith/PA24INLNZ4QJTUNO6S4THU4DYQ.json","graph_json":"https://pith.science/api/pith-number/PA24INLNZ4QJTUNO6S4THU4DYQ/graph.json","events_json":"https://pith.science/api/pith-number/PA24INLNZ4QJTUNO6S4THU4DYQ/events.json","paper":"https://pith.science/paper/PA24INLN"},"agent_actions":{"view_html":"https://pith.science/pith/PA24INLNZ4QJTUNO6S4THU4DYQ","download_json":"https://pith.science/pith/PA24INLNZ4QJTUNO6S4THU4DYQ.json","view_paper":"https://pith.science/paper/PA24INLN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.01803&json=true","fetch_graph":"https://pith.science/api/pith-number/PA24INLNZ4QJTUNO6S4THU4DYQ/graph.json","fetch_events":"https://pith.science/api/pith-number/PA24INLNZ4QJTUNO6S4THU4DYQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PA24INLNZ4QJTUNO6S4THU4DYQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PA24INLNZ4QJTUNO6S4THU4DYQ/action/storage_attestation","attest_author":"https://pith.science/pith/PA24INLNZ4QJTUNO6S4THU4DYQ/action/author_attestation","sign_citation":"https://pith.science/pith/PA24INLNZ4QJTUNO6S4THU4DYQ/action/citation_signature","submit_replication":"https://pith.science/pith/PA24INLNZ4QJTUNO6S4THU4DYQ/action/replication_record"}},"created_at":"2026-05-18T00:31:16.813452+00:00","updated_at":"2026-05-18T00:31:16.813452+00:00"}