{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:OFKMFCKPMUTWNAMRJMPNE2HWHA","short_pith_number":"pith:OFKMFCKP","canonical_record":{"source":{"id":"1612.00007","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-30T21:00:00Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"8d75afc483e99011fa0e7eca25682075741cc571a87829844765271775b82425","abstract_canon_sha256":"c959859af575909d0a45cdf3717c36143eefdea73bd799ab8d4b63c18a422a40"},"schema_version":"1.0"},"canonical_sha256":"7154c2894f65276681914b1ed268f63826b229accd85012e55260741479581ea","source":{"kind":"arxiv","id":"1612.00007","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.00007","created_at":"2026-05-18T00:56:07Z"},{"alias_kind":"arxiv_version","alias_value":"1612.00007v1","created_at":"2026-05-18T00:56:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.00007","created_at":"2026-05-18T00:56:07Z"},{"alias_kind":"pith_short_12","alias_value":"OFKMFCKPMUTW","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"OFKMFCKPMUTWNAMR","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"OFKMFCKP","created_at":"2026-05-18T12:30:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:OFKMFCKPMUTWNAMRJMPNE2HWHA","target":"record","payload":{"canonical_record":{"source":{"id":"1612.00007","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-30T21:00:00Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"8d75afc483e99011fa0e7eca25682075741cc571a87829844765271775b82425","abstract_canon_sha256":"c959859af575909d0a45cdf3717c36143eefdea73bd799ab8d4b63c18a422a40"},"schema_version":"1.0"},"canonical_sha256":"7154c2894f65276681914b1ed268f63826b229accd85012e55260741479581ea","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:56:07.028949Z","signature_b64":"Rsvk158m1rPHI6R8vWpFpaAoUNSP1ntOeqQTzTJ6Pt82Ven+ql+lxOI7fNBZVbt4drfN8rgd3LGW6ZkwcKbUCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7154c2894f65276681914b1ed268f63826b229accd85012e55260741479581ea","last_reissued_at":"2026-05-18T00:56:07.028441Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:56:07.028441Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1612.00007","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-18T00:56:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LYTNVIJ5CDjofZFxuiF4blS6Mn+jCsRO+R3PkejBVhsylxHv6/6Xq3V+rJbYjild8RBsbY3LvUVxVuwS7f/7BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T14:30:07.082125Z"},"content_sha256":"f04d68a3a754894dd000bd743e82110d3b1cf9b9e7d485d8e38d9b6bd10f16f5","schema_version":"1.0","event_id":"sha256:f04d68a3a754894dd000bd743e82110d3b1cf9b9e7d485d8e38d9b6bd10f16f5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:OFKMFCKPMUTWNAMRJMPNE2HWHA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the number of maximum independent sets in Doob graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Denis Krotov (Sobolev Institute of Mathematics, Novosibirsk, Russia)","submitted_at":"2016-11-30T21:00:00Z","abstract_excerpt":"The Doob graph $D(m,n)$ is a distance-regular graph with the same parameters as the Hamming graph $H(2m+n,4)$. The maximum independent sets in the Doob graphs are analogs of the distance-$2$ MDS codes in the Hamming graphs. We prove that the logarithm of the number of the maximum independent sets in $D(m,n)$ grows as $2^{2m+n-1}(1+o(1))$. The main tool for the upper estimation is constructing an injective map from the class of maximum independent sets in $D(m,n)$ to the class of distance-$2$ MDS codes in $H(2m+n,4)$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.00007","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-18T00:56:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IMy8a4S1upki6xa2X3qyuV2vmZhepZEHzv19KirOgIWZ3sk3ltFJP2+VhBM1whbWlox1m2QeLW3REBXcQj16AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T14:30:07.082792Z"},"content_sha256":"078f1ef5d5919ba5e439d7ca196bdd1cadba81b6c461a45c1cea06f17f78d934","schema_version":"1.0","event_id":"sha256:078f1ef5d5919ba5e439d7ca196bdd1cadba81b6c461a45c1cea06f17f78d934"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OFKMFCKPMUTWNAMRJMPNE2HWHA/bundle.json","state_url":"https://pith.science/pith/OFKMFCKPMUTWNAMRJMPNE2HWHA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OFKMFCKPMUTWNAMRJMPNE2HWHA/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-05-29T14:30:07Z","links":{"resolver":"https://pith.science/pith/OFKMFCKPMUTWNAMRJMPNE2HWHA","bundle":"https://pith.science/pith/OFKMFCKPMUTWNAMRJMPNE2HWHA/bundle.json","state":"https://pith.science/pith/OFKMFCKPMUTWNAMRJMPNE2HWHA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OFKMFCKPMUTWNAMRJMPNE2HWHA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:OFKMFCKPMUTWNAMRJMPNE2HWHA","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":"c959859af575909d0a45cdf3717c36143eefdea73bd799ab8d4b63c18a422a40","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-30T21:00:00Z","title_canon_sha256":"8d75afc483e99011fa0e7eca25682075741cc571a87829844765271775b82425"},"schema_version":"1.0","source":{"id":"1612.00007","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.00007","created_at":"2026-05-18T00:56:07Z"},{"alias_kind":"arxiv_version","alias_value":"1612.00007v1","created_at":"2026-05-18T00:56:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.00007","created_at":"2026-05-18T00:56:07Z"},{"alias_kind":"pith_short_12","alias_value":"OFKMFCKPMUTW","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"OFKMFCKPMUTWNAMR","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"OFKMFCKP","created_at":"2026-05-18T12:30:36Z"}],"graph_snapshots":[{"event_id":"sha256:078f1ef5d5919ba5e439d7ca196bdd1cadba81b6c461a45c1cea06f17f78d934","target":"graph","created_at":"2026-05-18T00:56:07Z","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":"The Doob graph $D(m,n)$ is a distance-regular graph with the same parameters as the Hamming graph $H(2m+n,4)$. The maximum independent sets in the Doob graphs are analogs of the distance-$2$ MDS codes in the Hamming graphs. We prove that the logarithm of the number of the maximum independent sets in $D(m,n)$ grows as $2^{2m+n-1}(1+o(1))$. The main tool for the upper estimation is constructing an injective map from the class of maximum independent sets in $D(m,n)$ to the class of distance-$2$ MDS codes in $H(2m+n,4)$.","authors_text":"Denis Krotov (Sobolev Institute of Mathematics, Novosibirsk, Russia)","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-30T21:00:00Z","title":"On the number of maximum independent sets in Doob graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.00007","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:f04d68a3a754894dd000bd743e82110d3b1cf9b9e7d485d8e38d9b6bd10f16f5","target":"record","created_at":"2026-05-18T00:56:07Z","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":"c959859af575909d0a45cdf3717c36143eefdea73bd799ab8d4b63c18a422a40","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-30T21:00:00Z","title_canon_sha256":"8d75afc483e99011fa0e7eca25682075741cc571a87829844765271775b82425"},"schema_version":"1.0","source":{"id":"1612.00007","kind":"arxiv","version":1}},"canonical_sha256":"7154c2894f65276681914b1ed268f63826b229accd85012e55260741479581ea","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7154c2894f65276681914b1ed268f63826b229accd85012e55260741479581ea","first_computed_at":"2026-05-18T00:56:07.028441Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:56:07.028441Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Rsvk158m1rPHI6R8vWpFpaAoUNSP1ntOeqQTzTJ6Pt82Ven+ql+lxOI7fNBZVbt4drfN8rgd3LGW6ZkwcKbUCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:56:07.028949Z","signed_message":"canonical_sha256_bytes"},"source_id":"1612.00007","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f04d68a3a754894dd000bd743e82110d3b1cf9b9e7d485d8e38d9b6bd10f16f5","sha256:078f1ef5d5919ba5e439d7ca196bdd1cadba81b6c461a45c1cea06f17f78d934"],"state_sha256":"a003578b18af43403da7c78e33aed87884103ab772c9fdbd82c795b276b18712"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T3zqdUYUcmfFaxZWVMYwkPHWo4Wup11g6P1vKC9XXzr2jxtrTiaQd2ae71RAMPQzU2m4AnW2I9E5aF2gMG7aAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T14:30:07.086546Z","bundle_sha256":"56b7c9600752e7b678bf176c42f1e1a56a5de1bf966a76f2ebe86b1be9850d17"}}