{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:AFLDLWQ7TMPLM7ZJNHYKU4I4EA","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":"774201a693d19ed49731729d6bf7c42b487c9edaec527e7b6879ff0fbcb44adf","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-05-07T13:30:11Z","title_canon_sha256":"63e470c3a280ba8f7986895bcf92598781a20333b4e68f093f2c062eb8bd176b"},"schema_version":"1.0","source":{"id":"1805.02519","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.02519","created_at":"2026-05-18T00:16:39Z"},{"alias_kind":"arxiv_version","alias_value":"1805.02519v1","created_at":"2026-05-18T00:16:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.02519","created_at":"2026-05-18T00:16:39Z"},{"alias_kind":"pith_short_12","alias_value":"AFLDLWQ7TMPL","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"AFLDLWQ7TMPLM7ZJ","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"AFLDLWQ7","created_at":"2026-05-18T12:32:13Z"}],"graph_snapshots":[{"event_id":"sha256:3cb4a76210a4bf0c7b54b70409d9a599f53c354b94ba50ff3c21651e6473f0b6","target":"graph","created_at":"2026-05-18T00:16:39Z","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":"We give a very short and simple proof of Zykov's generalization of Tur\\'{a}n's theorem, which implies that the number of maximum independent sets of a graph of order $n$ and independence number $\\alpha$ with $\\alpha<n$ is at most $\\left\\lceil\\frac{n}{\\alpha}\\right\\rceil^{n\\,{\\rm mod}\\,\\alpha} \\left\\lfloor\\frac{n}{\\alpha}\\right\\rfloor^{\\alpha-(n\\,{\\rm mod}\\,\\alpha)}$. Generalizing a result of Zito, we show that the number of maximum independent sets of a tree of order $n$ and independence number $\\alpha$ is at most $2^{n-\\alpha-1}+1$, if $2\\alpha=n$, and, $2^{n-\\alpha-1}$, if $2\\alpha>n$, and w","authors_text":"Dieter Rautenbach, Elena Mohr","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-05-07T13:30:11Z","title":"On the maximum number of maximum independent sets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.02519","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:8c2b690538fed4b946f851999e4a62cf8aa6504e5238b0878f5c9f166a68ee1f","target":"record","created_at":"2026-05-18T00:16:39Z","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":"774201a693d19ed49731729d6bf7c42b487c9edaec527e7b6879ff0fbcb44adf","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-05-07T13:30:11Z","title_canon_sha256":"63e470c3a280ba8f7986895bcf92598781a20333b4e68f093f2c062eb8bd176b"},"schema_version":"1.0","source":{"id":"1805.02519","kind":"arxiv","version":1}},"canonical_sha256":"015635da1f9b1eb67f2969f0aa711c201f506cd94b2dd90a16c4d42118a867fb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"015635da1f9b1eb67f2969f0aa711c201f506cd94b2dd90a16c4d42118a867fb","first_computed_at":"2026-05-18T00:16:39.722294Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:16:39.722294Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"C2+WzNm9vmk4a6eLAheXROtXe6iwj04Ee/Jw6pB1rfzU9u/PaWvThQ0GblIIoZP2QkmwxOo8PDUwX6ve9J74DA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:16:39.722752Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.02519","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8c2b690538fed4b946f851999e4a62cf8aa6504e5238b0878f5c9f166a68ee1f","sha256:3cb4a76210a4bf0c7b54b70409d9a599f53c354b94ba50ff3c21651e6473f0b6"],"state_sha256":"3e6796084f279eff3bcc81f79f90543ff269328ec3aaa1d038536e14f77991c9"}