{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:OFKMFCKPMUTWNAMRJMPNE2HWHA","short_pith_number":"pith:OFKMFCKP","schema_version":"1.0","canonical_sha256":"7154c2894f65276681914b1ed268f63826b229accd85012e55260741479581ea","source":{"kind":"arxiv","id":"1612.00007","version":1},"attestation_state":"computed","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)$."},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1612.00007","created_at":"2026-05-18T00:56:07.028520+00:00"},{"alias_kind":"arxiv_version","alias_value":"1612.00007v1","created_at":"2026-05-18T00:56:07.028520+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.00007","created_at":"2026-05-18T00:56:07.028520+00:00"},{"alias_kind":"pith_short_12","alias_value":"OFKMFCKPMUTW","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_16","alias_value":"OFKMFCKPMUTWNAMR","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_8","alias_value":"OFKMFCKP","created_at":"2026-05-18T12:30:36.002864+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/OFKMFCKPMUTWNAMRJMPNE2HWHA","json":"https://pith.science/pith/OFKMFCKPMUTWNAMRJMPNE2HWHA.json","graph_json":"https://pith.science/api/pith-number/OFKMFCKPMUTWNAMRJMPNE2HWHA/graph.json","events_json":"https://pith.science/api/pith-number/OFKMFCKPMUTWNAMRJMPNE2HWHA/events.json","paper":"https://pith.science/paper/OFKMFCKP"},"agent_actions":{"view_html":"https://pith.science/pith/OFKMFCKPMUTWNAMRJMPNE2HWHA","download_json":"https://pith.science/pith/OFKMFCKPMUTWNAMRJMPNE2HWHA.json","view_paper":"https://pith.science/paper/OFKMFCKP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1612.00007&json=true","fetch_graph":"https://pith.science/api/pith-number/OFKMFCKPMUTWNAMRJMPNE2HWHA/graph.json","fetch_events":"https://pith.science/api/pith-number/OFKMFCKPMUTWNAMRJMPNE2HWHA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OFKMFCKPMUTWNAMRJMPNE2HWHA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OFKMFCKPMUTWNAMRJMPNE2HWHA/action/storage_attestation","attest_author":"https://pith.science/pith/OFKMFCKPMUTWNAMRJMPNE2HWHA/action/author_attestation","sign_citation":"https://pith.science/pith/OFKMFCKPMUTWNAMRJMPNE2HWHA/action/citation_signature","submit_replication":"https://pith.science/pith/OFKMFCKPMUTWNAMRJMPNE2HWHA/action/replication_record"}},"created_at":"2026-05-18T00:56:07.028520+00:00","updated_at":"2026-05-18T00:56:07.028520+00:00"}