{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:6LBHPH2DCF4HRRHGVLWOHTMYFM","short_pith_number":"pith:6LBHPH2D","schema_version":"1.0","canonical_sha256":"f2c2779f43117878c4e6aaece3cd982b170de19e0759380a57d6a315de5e3721","source":{"kind":"arxiv","id":"1902.07628","version":2},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1902.07628","created_at":"2026-05-17T23:51:55.675938+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.07628v2","created_at":"2026-05-17T23:51:55.675938+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.07628","created_at":"2026-05-17T23:51:55.675938+00:00"},{"alias_kind":"pith_short_12","alias_value":"6LBHPH2DCF4H","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_16","alias_value":"6LBHPH2DCF4HRRHG","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_8","alias_value":"6LBHPH2D","created_at":"2026-05-18T12:33:10.108867+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/6LBHPH2DCF4HRRHGVLWOHTMYFM","json":"https://pith.science/pith/6LBHPH2DCF4HRRHGVLWOHTMYFM.json","graph_json":"https://pith.science/api/pith-number/6LBHPH2DCF4HRRHGVLWOHTMYFM/graph.json","events_json":"https://pith.science/api/pith-number/6LBHPH2DCF4HRRHGVLWOHTMYFM/events.json","paper":"https://pith.science/paper/6LBHPH2D"},"agent_actions":{"view_html":"https://pith.science/pith/6LBHPH2DCF4HRRHGVLWOHTMYFM","download_json":"https://pith.science/pith/6LBHPH2DCF4HRRHGVLWOHTMYFM.json","view_paper":"https://pith.science/paper/6LBHPH2D","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.07628&json=true","fetch_graph":"https://pith.science/api/pith-number/6LBHPH2DCF4HRRHGVLWOHTMYFM/graph.json","fetch_events":"https://pith.science/api/pith-number/6LBHPH2DCF4HRRHGVLWOHTMYFM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6LBHPH2DCF4HRRHGVLWOHTMYFM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6LBHPH2DCF4HRRHGVLWOHTMYFM/action/storage_attestation","attest_author":"https://pith.science/pith/6LBHPH2DCF4HRRHGVLWOHTMYFM/action/author_attestation","sign_citation":"https://pith.science/pith/6LBHPH2DCF4HRRHGVLWOHTMYFM/action/citation_signature","submit_replication":"https://pith.science/pith/6LBHPH2DCF4HRRHGVLWOHTMYFM/action/replication_record"}},"created_at":"2026-05-17T23:51:55.675938+00:00","updated_at":"2026-05-17T23:51:55.675938+00:00"}