{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:T7T5EXEEKVUGNV3UJGA6FQTSFJ","short_pith_number":"pith:T7T5EXEE","schema_version":"1.0","canonical_sha256":"9fe7d25c84556866d7744981e2c2722a73e5dc19f08e763007851af52c6f11aa","source":{"kind":"arxiv","id":"1002.0295","version":1},"attestation_state":"computed","paper":{"title":"On lifting perfect codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Josep Rif\\`a, Victor Zinoviev","submitted_at":"2010-02-01T17:54:36Z","abstract_excerpt":"In this paper we consider completely regular codes, obtained from perfect (Hamming) codes by lifting the ground field. More exactly, for a given perfect code C of length n=(q^m-1)/(q-1) over F_q with a parity check matrix H_m, we define a new code C_{(m,r)} of length n over F_{q^r}, r > 1, with this parity check matrix H_m. The resulting code C_{(m,r)} is completely regular with covering radius R = min{r,m}. We compute the intersection numbers of such codes and, finally, we prove that Hamming codes are the only codes that, after lifting the ground field, result in completely regular 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":"1002.0295","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-02-01T17:54:36Z","cross_cats_sorted":["cs.DM","math.CO","math.IT"],"title_canon_sha256":"88d4b6491a1f251571b0b09afc6ca0095192d6c6073e348738978adbcf5664c1","abstract_canon_sha256":"8ceefa2c70120e09502d175baccff7c84f8ca6143b4f15264e8bcb943ad02f5c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:29:30.098027Z","signature_b64":"q+Rou91lcIkRZJ3aCRYzXNdWms0PMFEk44ChzRHrRJnhXiM9oKa31Abq8N9F9bpTnBdyPEv5O2ayO5e5Ud5CCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9fe7d25c84556866d7744981e2c2722a73e5dc19f08e763007851af52c6f11aa","last_reissued_at":"2026-05-18T01:29:30.097376Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:29:30.097376Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On lifting perfect codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Josep Rif\\`a, Victor Zinoviev","submitted_at":"2010-02-01T17:54:36Z","abstract_excerpt":"In this paper we consider completely regular codes, obtained from perfect (Hamming) codes by lifting the ground field. More exactly, for a given perfect code C of length n=(q^m-1)/(q-1) over F_q with a parity check matrix H_m, we define a new code C_{(m,r)} of length n over F_{q^r}, r > 1, with this parity check matrix H_m. The resulting code C_{(m,r)} is completely regular with covering radius R = min{r,m}. We compute the intersection numbers of such codes and, finally, we prove that Hamming codes are the only codes that, after lifting the ground field, result in completely regular codes."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1002.0295","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":"1002.0295","created_at":"2026-05-18T01:29:30.097507+00:00"},{"alias_kind":"arxiv_version","alias_value":"1002.0295v1","created_at":"2026-05-18T01:29:30.097507+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1002.0295","created_at":"2026-05-18T01:29:30.097507+00:00"},{"alias_kind":"pith_short_12","alias_value":"T7T5EXEEKVUG","created_at":"2026-05-18T12:26:13.927090+00:00"},{"alias_kind":"pith_short_16","alias_value":"T7T5EXEEKVUGNV3U","created_at":"2026-05-18T12:26:13.927090+00:00"},{"alias_kind":"pith_short_8","alias_value":"T7T5EXEE","created_at":"2026-05-18T12:26:13.927090+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/T7T5EXEEKVUGNV3UJGA6FQTSFJ","json":"https://pith.science/pith/T7T5EXEEKVUGNV3UJGA6FQTSFJ.json","graph_json":"https://pith.science/api/pith-number/T7T5EXEEKVUGNV3UJGA6FQTSFJ/graph.json","events_json":"https://pith.science/api/pith-number/T7T5EXEEKVUGNV3UJGA6FQTSFJ/events.json","paper":"https://pith.science/paper/T7T5EXEE"},"agent_actions":{"view_html":"https://pith.science/pith/T7T5EXEEKVUGNV3UJGA6FQTSFJ","download_json":"https://pith.science/pith/T7T5EXEEKVUGNV3UJGA6FQTSFJ.json","view_paper":"https://pith.science/paper/T7T5EXEE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1002.0295&json=true","fetch_graph":"https://pith.science/api/pith-number/T7T5EXEEKVUGNV3UJGA6FQTSFJ/graph.json","fetch_events":"https://pith.science/api/pith-number/T7T5EXEEKVUGNV3UJGA6FQTSFJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/T7T5EXEEKVUGNV3UJGA6FQTSFJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/T7T5EXEEKVUGNV3UJGA6FQTSFJ/action/storage_attestation","attest_author":"https://pith.science/pith/T7T5EXEEKVUGNV3UJGA6FQTSFJ/action/author_attestation","sign_citation":"https://pith.science/pith/T7T5EXEEKVUGNV3UJGA6FQTSFJ/action/citation_signature","submit_replication":"https://pith.science/pith/T7T5EXEEKVUGNV3UJGA6FQTSFJ/action/replication_record"}},"created_at":"2026-05-18T01:29:30.097507+00:00","updated_at":"2026-05-18T01:29:30.097507+00:00"}