{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:P3IXOHOA62L3WQGYQYTRQFZ7YY","short_pith_number":"pith:P3IXOHOA","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"},"canonical_sha256":"7ed1771dc0f697bb40d8862718173fc61a98d8ccf22318f3b5586ad0e93a4c9f","source":{"kind":"arxiv","id":"1404.6358","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.6358","created_at":"2026-05-18T02:53:16Z"},{"alias_kind":"arxiv_version","alias_value":"1404.6358v1","created_at":"2026-05-18T02:53:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.6358","created_at":"2026-05-18T02:53:16Z"},{"alias_kind":"pith_short_12","alias_value":"P3IXOHOA62L3","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"P3IXOHOA62L3WQGY","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"P3IXOHOA","created_at":"2026-05-18T12:28:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:P3IXOHOA62L3WQGYQYTRQFZ7YY","target":"record","payload":{"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"},"canonical_sha256":"7ed1771dc0f697bb40d8862718173fc61a98d8ccf22318f3b5586ad0e93a4c9f","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"},"source_kind":"arxiv","source_id":"1404.6358","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-18T02:53:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AlBaYedKcclrQWdBEOlu3zHUtOtOKbFwvR8q9NDYVmmJ4BqlFyYqFqYDUiC7yOonHEI67VLOfYqPo1IPUW7ECg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T00:28:59.330287Z"},"content_sha256":"c0cf3db8d0813ba30684c35f555681f82b575c46dab9354685eb1c2e4b593e10","schema_version":"1.0","event_id":"sha256:c0cf3db8d0813ba30684c35f555681f82b575c46dab9354685eb1c2e4b593e10"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:P3IXOHOA62L3WQGYQYTRQFZ7YY","target":"graph","payload":{"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"},"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-18T02:53:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/m9WR8vK24uu8dcClPn06NcOqRsHc/QcW5U70QKwhQmslBYeIq7LYXkvwKmYr60BR4TZ0+CNpcNIwtMCLrZyDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T00:28:59.330648Z"},"content_sha256":"2cff4ebce154e4d5ee26dda488171bd3763d5d25ab886cac7bda045fc5cf2efd","schema_version":"1.0","event_id":"sha256:2cff4ebce154e4d5ee26dda488171bd3763d5d25ab886cac7bda045fc5cf2efd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/P3IXOHOA62L3WQGYQYTRQFZ7YY/bundle.json","state_url":"https://pith.science/pith/P3IXOHOA62L3WQGYQYTRQFZ7YY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/P3IXOHOA62L3WQGYQYTRQFZ7YY/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:28:59Z","links":{"resolver":"https://pith.science/pith/P3IXOHOA62L3WQGYQYTRQFZ7YY","bundle":"https://pith.science/pith/P3IXOHOA62L3WQGYQYTRQFZ7YY/bundle.json","state":"https://pith.science/pith/P3IXOHOA62L3WQGYQYTRQFZ7YY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/P3IXOHOA62L3WQGYQYTRQFZ7YY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:P3IXOHOA62L3WQGYQYTRQFZ7YY","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":"f7ed4856eb95718bd28a55301cc2acc6b4562cde359bce888fe500ae1d64a97b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-04-25T09:07:57Z","title_canon_sha256":"eac98a6642e1e6b8bbb2fbe0e4abfbcf8ba14d9124ffdc3699081a4fa2ef2e84"},"schema_version":"1.0","source":{"id":"1404.6358","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.6358","created_at":"2026-05-18T02:53:16Z"},{"alias_kind":"arxiv_version","alias_value":"1404.6358v1","created_at":"2026-05-18T02:53:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.6358","created_at":"2026-05-18T02:53:16Z"},{"alias_kind":"pith_short_12","alias_value":"P3IXOHOA62L3","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"P3IXOHOA62L3WQGY","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"P3IXOHOA","created_at":"2026-05-18T12:28:43Z"}],"graph_snapshots":[{"event_id":"sha256:2cff4ebce154e4d5ee26dda488171bd3763d5d25ab886cac7bda045fc5cf2efd","target":"graph","created_at":"2026-05-18T02:53:16Z","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 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","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":"2014-04-25T09:07:57Z","title":"Families of nested completely regular codes and distance-regular graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.6358","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:c0cf3db8d0813ba30684c35f555681f82b575c46dab9354685eb1c2e4b593e10","target":"record","created_at":"2026-05-18T02:53:16Z","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":"f7ed4856eb95718bd28a55301cc2acc6b4562cde359bce888fe500ae1d64a97b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-04-25T09:07:57Z","title_canon_sha256":"eac98a6642e1e6b8bbb2fbe0e4abfbcf8ba14d9124ffdc3699081a4fa2ef2e84"},"schema_version":"1.0","source":{"id":"1404.6358","kind":"arxiv","version":1}},"canonical_sha256":"7ed1771dc0f697bb40d8862718173fc61a98d8ccf22318f3b5586ad0e93a4c9f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7ed1771dc0f697bb40d8862718173fc61a98d8ccf22318f3b5586ad0e93a4c9f","first_computed_at":"2026-05-18T02:53:16.699770Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:53:16.699770Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"eQz1CEbRGacOIYJYdLlFapoOwfMBiNuQwz75rkHx+4UJ39bHDgsSVOb1HUWgTQn5P4ai7GDafQ+eVAKJ5WDXDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:53:16.700509Z","signed_message":"canonical_sha256_bytes"},"source_id":"1404.6358","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c0cf3db8d0813ba30684c35f555681f82b575c46dab9354685eb1c2e4b593e10","sha256:2cff4ebce154e4d5ee26dda488171bd3763d5d25ab886cac7bda045fc5cf2efd"],"state_sha256":"d2d4e8dea0b49a736c1f7f5409725f7289c042a1631b6d55971c76b8352275f1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"v+Yc8xz52Xid16IfExI/e9cC35srn5EiIlwuJPO/dWYGpRccfMtSt/JnK/FopbpJ0/iL70X6KxjNBcFMltNPBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T00:28:59.332557Z","bundle_sha256":"de262c940efbc13d1c3d5e53154b5f4c95aa367d715494af0fcc0b0a3167d60b"}}