{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:P3IXOHOA62L3WQGYQYTRQFZ7YY","short_pith_number":"pith:P3IXOHOA","schema_version":"1.0","canonical_sha256":"7ed1771dc0f697bb40d8862718173fc61a98d8ccf22318f3b5586ad0e93a4c9f","source":{"kind":"arxiv","id":"1404.6358","version":1},"attestation_state":"computed","paper":{"title":"Families of nested completely regular codes and distance-regular graphs","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":"2014-04-25T09:07:57Z","abstract_excerpt":"In this paper infinite families of linear binary nested completely regular codes are constructed. They have covering radius $\\rho$ equal to $3$ or $4$, and are $1/2^i$-th parts, for $i\\in\\{1,\\ldots,u\\}$ of binary (respectively, extended binary) Hamming codes of length $n=2^m-1$ (respectively, $2^m$), where $m=2u$. In the usual way, i.e., as coset graphs, infinite families of embedded distance-regular coset graphs of diameter $D$ equal to $3$ or $4$ are constructed. In some cases, the constructed codes are also completely transitive codes and the corresponding coset graphs are distance-transiti"},"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":"1404.6358","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-04-25T09:07:57Z","cross_cats_sorted":[],"title_canon_sha256":"eac98a6642e1e6b8bbb2fbe0e4abfbcf8ba14d9124ffdc3699081a4fa2ef2e84","abstract_canon_sha256":"f7ed4856eb95718bd28a55301cc2acc6b4562cde359bce888fe500ae1d64a97b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:53:16.700509Z","signature_b64":"eQz1CEbRGacOIYJYdLlFapoOwfMBiNuQwz75rkHx+4UJ39bHDgsSVOb1HUWgTQn5P4ai7GDafQ+eVAKJ5WDXDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7ed1771dc0f697bb40d8862718173fc61a98d8ccf22318f3b5586ad0e93a4c9f","last_reissued_at":"2026-05-18T02:53:16.699770Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:53:16.699770Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Families of nested completely regular codes and distance-regular graphs","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":"2014-04-25T09:07:57Z","abstract_excerpt":"In this paper infinite families of linear binary nested completely regular codes are constructed. They have covering radius $\\rho$ equal to $3$ or $4$, and are $1/2^i$-th parts, for $i\\in\\{1,\\ldots,u\\}$ of binary (respectively, extended binary) Hamming codes of length $n=2^m-1$ (respectively, $2^m$), where $m=2u$. In the usual way, i.e., as coset graphs, infinite families of embedded distance-regular coset graphs of diameter $D$ equal to $3$ or $4$ are constructed. In some cases, the constructed codes are also completely transitive codes and the corresponding coset graphs are distance-transiti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.6358","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":"1404.6358","created_at":"2026-05-18T02:53:16.699884+00:00"},{"alias_kind":"arxiv_version","alias_value":"1404.6358v1","created_at":"2026-05-18T02:53:16.699884+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.6358","created_at":"2026-05-18T02:53:16.699884+00:00"},{"alias_kind":"pith_short_12","alias_value":"P3IXOHOA62L3","created_at":"2026-05-18T12:28:43.426989+00:00"},{"alias_kind":"pith_short_16","alias_value":"P3IXOHOA62L3WQGY","created_at":"2026-05-18T12:28:43.426989+00:00"},{"alias_kind":"pith_short_8","alias_value":"P3IXOHOA","created_at":"2026-05-18T12:28:43.426989+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/P3IXOHOA62L3WQGYQYTRQFZ7YY","json":"https://pith.science/pith/P3IXOHOA62L3WQGYQYTRQFZ7YY.json","graph_json":"https://pith.science/api/pith-number/P3IXOHOA62L3WQGYQYTRQFZ7YY/graph.json","events_json":"https://pith.science/api/pith-number/P3IXOHOA62L3WQGYQYTRQFZ7YY/events.json","paper":"https://pith.science/paper/P3IXOHOA"},"agent_actions":{"view_html":"https://pith.science/pith/P3IXOHOA62L3WQGYQYTRQFZ7YY","download_json":"https://pith.science/pith/P3IXOHOA62L3WQGYQYTRQFZ7YY.json","view_paper":"https://pith.science/paper/P3IXOHOA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1404.6358&json=true","fetch_graph":"https://pith.science/api/pith-number/P3IXOHOA62L3WQGYQYTRQFZ7YY/graph.json","fetch_events":"https://pith.science/api/pith-number/P3IXOHOA62L3WQGYQYTRQFZ7YY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/P3IXOHOA62L3WQGYQYTRQFZ7YY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/P3IXOHOA62L3WQGYQYTRQFZ7YY/action/storage_attestation","attest_author":"https://pith.science/pith/P3IXOHOA62L3WQGYQYTRQFZ7YY/action/author_attestation","sign_citation":"https://pith.science/pith/P3IXOHOA62L3WQGYQYTRQFZ7YY/action/citation_signature","submit_replication":"https://pith.science/pith/P3IXOHOA62L3WQGYQYTRQFZ7YY/action/replication_record"}},"created_at":"2026-05-18T02:53:16.699884+00:00","updated_at":"2026-05-18T02:53:16.699884+00:00"}