{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:T7T5EXEEKVUGNV3UJGA6FQTSFJ","short_pith_number":"pith:T7T5EXEE","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"},"canonical_sha256":"9fe7d25c84556866d7744981e2c2722a73e5dc19f08e763007851af52c6f11aa","source":{"kind":"arxiv","id":"1002.0295","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1002.0295","created_at":"2026-05-18T01:29:30Z"},{"alias_kind":"arxiv_version","alias_value":"1002.0295v1","created_at":"2026-05-18T01:29:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1002.0295","created_at":"2026-05-18T01:29:30Z"},{"alias_kind":"pith_short_12","alias_value":"T7T5EXEEKVUG","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_16","alias_value":"T7T5EXEEKVUGNV3U","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_8","alias_value":"T7T5EXEE","created_at":"2026-05-18T12:26:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:T7T5EXEEKVUGNV3UJGA6FQTSFJ","target":"record","payload":{"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"},"canonical_sha256":"9fe7d25c84556866d7744981e2c2722a73e5dc19f08e763007851af52c6f11aa","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"},"source_kind":"arxiv","source_id":"1002.0295","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:29:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2qhxDxPcg2MgKVZ9T9YXnWf3o0FGuEmRvjN6owgv3TGSX7nDEZjysXsQzvf0td6CgtJeEYVDS6ksyvTNKbLAAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T01:00:06.502398Z"},"content_sha256":"408d3e74906010700041e360524861ddd13ad13fcf994fc977c3dc270c683e64","schema_version":"1.0","event_id":"sha256:408d3e74906010700041e360524861ddd13ad13fcf994fc977c3dc270c683e64"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:T7T5EXEEKVUGNV3UJGA6FQTSFJ","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:29:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xmi3LNhSLhpAQ2qLfmkIa9+8zvFUmHT5QzEH9j75X+ZSp2uY1Q4Ys0Yalks+3IaVEDW0hBo6ZTD17DlAIvCmAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T01:00:06.503140Z"},"content_sha256":"97ac8060954386f51c9f57b995c222b22122e1a5e6f33b1808ca7dc5d32f4181","schema_version":"1.0","event_id":"sha256:97ac8060954386f51c9f57b995c222b22122e1a5e6f33b1808ca7dc5d32f4181"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/T7T5EXEEKVUGNV3UJGA6FQTSFJ/bundle.json","state_url":"https://pith.science/pith/T7T5EXEEKVUGNV3UJGA6FQTSFJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/T7T5EXEEKVUGNV3UJGA6FQTSFJ/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-10T01:00:06Z","links":{"resolver":"https://pith.science/pith/T7T5EXEEKVUGNV3UJGA6FQTSFJ","bundle":"https://pith.science/pith/T7T5EXEEKVUGNV3UJGA6FQTSFJ/bundle.json","state":"https://pith.science/pith/T7T5EXEEKVUGNV3UJGA6FQTSFJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/T7T5EXEEKVUGNV3UJGA6FQTSFJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:T7T5EXEEKVUGNV3UJGA6FQTSFJ","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"8ceefa2c70120e09502d175baccff7c84f8ca6143b4f15264e8bcb943ad02f5c","cross_cats_sorted":["cs.DM","math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-02-01T17:54:36Z","title_canon_sha256":"88d4b6491a1f251571b0b09afc6ca0095192d6c6073e348738978adbcf5664c1"},"schema_version":"1.0","source":{"id":"1002.0295","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1002.0295","created_at":"2026-05-18T01:29:30Z"},{"alias_kind":"arxiv_version","alias_value":"1002.0295v1","created_at":"2026-05-18T01:29:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1002.0295","created_at":"2026-05-18T01:29:30Z"},{"alias_kind":"pith_short_12","alias_value":"T7T5EXEEKVUG","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_16","alias_value":"T7T5EXEEKVUGNV3U","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_8","alias_value":"T7T5EXEE","created_at":"2026-05-18T12:26:13Z"}],"graph_snapshots":[{"event_id":"sha256:97ac8060954386f51c9f57b995c222b22122e1a5e6f33b1808ca7dc5d32f4181","target":"graph","created_at":"2026-05-18T01:29:30Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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.","authors_text":"Josep Rif\\`a, Victor Zinoviev","cross_cats":["cs.DM","math.CO","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-02-01T17:54:36Z","title":"On lifting perfect codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1002.0295","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:408d3e74906010700041e360524861ddd13ad13fcf994fc977c3dc270c683e64","target":"record","created_at":"2026-05-18T01:29:30Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"8ceefa2c70120e09502d175baccff7c84f8ca6143b4f15264e8bcb943ad02f5c","cross_cats_sorted":["cs.DM","math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-02-01T17:54:36Z","title_canon_sha256":"88d4b6491a1f251571b0b09afc6ca0095192d6c6073e348738978adbcf5664c1"},"schema_version":"1.0","source":{"id":"1002.0295","kind":"arxiv","version":1}},"canonical_sha256":"9fe7d25c84556866d7744981e2c2722a73e5dc19f08e763007851af52c6f11aa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9fe7d25c84556866d7744981e2c2722a73e5dc19f08e763007851af52c6f11aa","first_computed_at":"2026-05-18T01:29:30.097376Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:29:30.097376Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"q+Rou91lcIkRZJ3aCRYzXNdWms0PMFEk44ChzRHrRJnhXiM9oKa31Abq8N9F9bpTnBdyPEv5O2ayO5e5Ud5CCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:29:30.098027Z","signed_message":"canonical_sha256_bytes"},"source_id":"1002.0295","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:408d3e74906010700041e360524861ddd13ad13fcf994fc977c3dc270c683e64","sha256:97ac8060954386f51c9f57b995c222b22122e1a5e6f33b1808ca7dc5d32f4181"],"state_sha256":"2a3047f2847d7f18ca4bcbed4fa0311db90d5149f5d84d061fcf0db23f9a8438"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A8ruK8PVtWfzbbTYnQaxWO4Qm4LzBAssC5hfC9OxejTx6xJrbRF+xyojUd3ACm/RA5O5t8c6q3wyOyMg9nINCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T01:00:06.507233Z","bundle_sha256":"786fec2eb2322079dd885781e1b6abad33fd251a83734764d2c7cf51b5acc0d1"}}