{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:YIHXQFXF44VF5MEHXLC77QVRMZ","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":"723157fdec9537482e7d42a1d08a7ca03a4297a96e00353dd692cc945dc18bc2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-06-27T11:59:00Z","title_canon_sha256":"0a21ed8cd45bd654d85a0343de14879795419e451f3180df5f583e2e919d98ec"},"schema_version":"1.0","source":{"id":"1806.10424","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.10424","created_at":"2026-05-18T00:12:08Z"},{"alias_kind":"arxiv_version","alias_value":"1806.10424v2","created_at":"2026-05-18T00:12:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.10424","created_at":"2026-05-18T00:12:08Z"},{"alias_kind":"pith_short_12","alias_value":"YIHXQFXF44VF","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"YIHXQFXF44VF5MEH","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"YIHXQFXF","created_at":"2026-05-18T12:33:04Z"}],"graph_snapshots":[{"event_id":"sha256:9f1c1469a344aac83ffc85f5f160e09ff2286a80f3cee960bf98854760752918","target":"graph","created_at":"2026-05-18T00:12:08Z","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 characterize the connected graphs of given order $n$ and given independence number $\\alpha$ that maximize the number of maximum independent sets. For $3\\leq \\alpha\\leq n/2$, there is a unique such graph that arises from the disjoint union of $\\alpha$ cliques of orders $\\left\\lceil\\frac{n}{\\alpha}\\right\\rceil$ and $\\left\\lfloor\\frac{n}{\\alpha}\\right\\rfloor$, by selecting a vertex $x$ in a largest clique and adding an edge between $x$ and a vertex in each of the remaining $\\alpha-1$ cliques. Our result confirms a conjecture of Derikvand and Oboudi [On the number of maximum independent sets of","authors_text":"D. Rautenbach, E. Mohr","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-06-27T11:59:00Z","title":"On the maximum number of maximum independent sets in connected graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.10424","kind":"arxiv","version":2},"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:621904b436acc69388946ccbece87a66bfc270355bed83394010e43380a1d179","target":"record","created_at":"2026-05-18T00:12:08Z","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":"723157fdec9537482e7d42a1d08a7ca03a4297a96e00353dd692cc945dc18bc2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-06-27T11:59:00Z","title_canon_sha256":"0a21ed8cd45bd654d85a0343de14879795419e451f3180df5f583e2e919d98ec"},"schema_version":"1.0","source":{"id":"1806.10424","kind":"arxiv","version":2}},"canonical_sha256":"c20f7816e5e72a5eb087bac5ffc2b166424340e2b0981e8dbedbc2ef78cf9567","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c20f7816e5e72a5eb087bac5ffc2b166424340e2b0981e8dbedbc2ef78cf9567","first_computed_at":"2026-05-18T00:12:08.461292Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:12:08.461292Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZzLUePlr6oayFPngD2h6EXUHrOh8i2vZtNOF8juKqD82vOVPBZcOI1X9A54ycZTriO8cFv5dXfpLUN9E1d9oDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:12:08.461773Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.10424","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:621904b436acc69388946ccbece87a66bfc270355bed83394010e43380a1d179","sha256:9f1c1469a344aac83ffc85f5f160e09ff2286a80f3cee960bf98854760752918"],"state_sha256":"f64c065ac56e0ae50499cc4d98b8b80fd207be0db11a86e58f8278e4e6a33294"}