{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:6LBHPH2DCF4HRRHGVLWOHTMYFM","short_pith_number":"pith:6LBHPH2D","canonical_record":{"source":{"id":"1902.07628","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-02-20T16:29:24Z","cross_cats_sorted":[],"title_canon_sha256":"d9125ec17d13127f384eb6249c9544e84c4bd21beff46419ffaee2f74b7afbd4","abstract_canon_sha256":"26573631a25ad1755e3c946592a3e661bb14f3894fce9aa1e431b2554468c71e"},"schema_version":"1.0"},"canonical_sha256":"f2c2779f43117878c4e6aaece3cd982b170de19e0759380a57d6a315de5e3721","source":{"kind":"arxiv","id":"1902.07628","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.07628","created_at":"2026-05-17T23:51:55Z"},{"alias_kind":"arxiv_version","alias_value":"1902.07628v2","created_at":"2026-05-17T23:51:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.07628","created_at":"2026-05-17T23:51:55Z"},{"alias_kind":"pith_short_12","alias_value":"6LBHPH2DCF4H","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"6LBHPH2DCF4HRRHG","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"6LBHPH2D","created_at":"2026-05-18T12:33:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:6LBHPH2DCF4HRRHGVLWOHTMYFM","target":"record","payload":{"canonical_record":{"source":{"id":"1902.07628","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-02-20T16:29:24Z","cross_cats_sorted":[],"title_canon_sha256":"d9125ec17d13127f384eb6249c9544e84c4bd21beff46419ffaee2f74b7afbd4","abstract_canon_sha256":"26573631a25ad1755e3c946592a3e661bb14f3894fce9aa1e431b2554468c71e"},"schema_version":"1.0"},"canonical_sha256":"f2c2779f43117878c4e6aaece3cd982b170de19e0759380a57d6a315de5e3721","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:55.676344Z","signature_b64":"fb7vnPNi4viJOA6Dtdbx6CKYMxN6b/TvXSjJ6nBnSd7kVCuRETt2ZS2LIKa8qUWeLkL3ilLNwjJELKwrsxJUAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f2c2779f43117878c4e6aaece3cd982b170de19e0759380a57d6a315de5e3721","last_reissued_at":"2026-05-17T23:51:55.675865Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:55.675865Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1902.07628","source_version":2,"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-17T23:51:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J0EVlECYXDI0SRH+3q4ODSasMvblGmOe+uKTILIPC25tla1Y9iHBMVVfC8Tv0MJ4WkAZdwdDdckZp4Oz+BDHAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T00:38:22.305420Z"},"content_sha256":"033513dce718a4700c0f48ba75e40c936f100c5df6b91cc4373a629520e5c069","schema_version":"1.0","event_id":"sha256:033513dce718a4700c0f48ba75e40c936f100c5df6b91cc4373a629520e5c069"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:6LBHPH2DCF4HRRHGVLWOHTMYFM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On completely regular and completely transitive codes derived from Hamming codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"J. Borges, J. Rif\\`a, V. A. Zinoviev","submitted_at":"2019-02-20T16:29:24Z","abstract_excerpt":"Given a parity-check matrix $H_m$ of a $q$-ary Hamming code, we consider a partition of the columns into two subsets. Then, we consider the two codes that have these submatrices as parity-check matrices. We say that anyone of these two codes is the supplementary code of the other one.\n  We obtain that if one of these codes is a Hamming code, then the supplementary code is completely regular and completely transitive. If one of the codes is completely regular with covering radius $2$, then the supplementary code is also completely regular with covering radius at most $2$. Moreover, in this case"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.07628","kind":"arxiv","version":2},"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-17T23:51:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XfXiMl2rhxVgLRudS4fQl7VTjkFVRlMxvDft1eeHfiILZYgUA3mjJ6WElZSxxgHPPOWoPhH6Uq4dqH24FaUzCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T00:38:22.305767Z"},"content_sha256":"08008d026f345add4c093c020a50b57d46f4a02e84f48d41805f42724741092c","schema_version":"1.0","event_id":"sha256:08008d026f345add4c093c020a50b57d46f4a02e84f48d41805f42724741092c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6LBHPH2DCF4HRRHGVLWOHTMYFM/bundle.json","state_url":"https://pith.science/pith/6LBHPH2DCF4HRRHGVLWOHTMYFM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6LBHPH2DCF4HRRHGVLWOHTMYFM/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-09T00:38:22Z","links":{"resolver":"https://pith.science/pith/6LBHPH2DCF4HRRHGVLWOHTMYFM","bundle":"https://pith.science/pith/6LBHPH2DCF4HRRHGVLWOHTMYFM/bundle.json","state":"https://pith.science/pith/6LBHPH2DCF4HRRHGVLWOHTMYFM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6LBHPH2DCF4HRRHGVLWOHTMYFM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:6LBHPH2DCF4HRRHGVLWOHTMYFM","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":"26573631a25ad1755e3c946592a3e661bb14f3894fce9aa1e431b2554468c71e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-02-20T16:29:24Z","title_canon_sha256":"d9125ec17d13127f384eb6249c9544e84c4bd21beff46419ffaee2f74b7afbd4"},"schema_version":"1.0","source":{"id":"1902.07628","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.07628","created_at":"2026-05-17T23:51:55Z"},{"alias_kind":"arxiv_version","alias_value":"1902.07628v2","created_at":"2026-05-17T23:51:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.07628","created_at":"2026-05-17T23:51:55Z"},{"alias_kind":"pith_short_12","alias_value":"6LBHPH2DCF4H","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"6LBHPH2DCF4HRRHG","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"6LBHPH2D","created_at":"2026-05-18T12:33:10Z"}],"graph_snapshots":[{"event_id":"sha256:08008d026f345add4c093c020a50b57d46f4a02e84f48d41805f42724741092c","target":"graph","created_at":"2026-05-17T23:51:55Z","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":"Given a parity-check matrix $H_m$ of a $q$-ary Hamming code, we consider a partition of the columns into two subsets. Then, we consider the two codes that have these submatrices as parity-check matrices. We say that anyone of these two codes is the supplementary code of the other one.\n  We obtain that if one of these codes is a Hamming code, then the supplementary code is completely regular and completely transitive. If one of the codes is completely regular with covering radius $2$, then the supplementary code is also completely regular with covering radius at most $2$. Moreover, in this case","authors_text":"J. Borges, J. Rif\\`a, V. A. Zinoviev","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-02-20T16:29:24Z","title":"On completely regular and completely transitive codes derived from Hamming codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.07628","kind":"arxiv","version":2},"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:033513dce718a4700c0f48ba75e40c936f100c5df6b91cc4373a629520e5c069","target":"record","created_at":"2026-05-17T23:51:55Z","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":"26573631a25ad1755e3c946592a3e661bb14f3894fce9aa1e431b2554468c71e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-02-20T16:29:24Z","title_canon_sha256":"d9125ec17d13127f384eb6249c9544e84c4bd21beff46419ffaee2f74b7afbd4"},"schema_version":"1.0","source":{"id":"1902.07628","kind":"arxiv","version":2}},"canonical_sha256":"f2c2779f43117878c4e6aaece3cd982b170de19e0759380a57d6a315de5e3721","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f2c2779f43117878c4e6aaece3cd982b170de19e0759380a57d6a315de5e3721","first_computed_at":"2026-05-17T23:51:55.675865Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:51:55.675865Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fb7vnPNi4viJOA6Dtdbx6CKYMxN6b/TvXSjJ6nBnSd7kVCuRETt2ZS2LIKa8qUWeLkL3ilLNwjJELKwrsxJUAg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:51:55.676344Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.07628","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:033513dce718a4700c0f48ba75e40c936f100c5df6b91cc4373a629520e5c069","sha256:08008d026f345add4c093c020a50b57d46f4a02e84f48d41805f42724741092c"],"state_sha256":"0c28055129f727af3a7ee6c353ce82eba200223b3b94fa6c30e6d9b44db2ad45"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YFq8Yw4I1IOfS9OBaQNQD6CUJnun/sA/3NS//Q5N6mx6XNrSnvlUbKYG/2vbfwI+dpo0fPkmqZSmk1i9uksaBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T00:38:22.307664Z","bundle_sha256":"d97ff4122cb7c499ff2dc8d0994f461ad9864dc1fc41009790364b50d0399191"}}