{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:YIHXQFXF44VF5MEHXLC77QVRMZ","short_pith_number":"pith:YIHXQFXF","canonical_record":{"source":{"id":"1806.10424","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-06-27T11:59:00Z","cross_cats_sorted":[],"title_canon_sha256":"0a21ed8cd45bd654d85a0343de14879795419e451f3180df5f583e2e919d98ec","abstract_canon_sha256":"723157fdec9537482e7d42a1d08a7ca03a4297a96e00353dd692cc945dc18bc2"},"schema_version":"1.0"},"canonical_sha256":"c20f7816e5e72a5eb087bac5ffc2b166424340e2b0981e8dbedbc2ef78cf9567","source":{"kind":"arxiv","id":"1806.10424","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:YIHXQFXF44VF5MEHXLC77QVRMZ","target":"record","payload":{"canonical_record":{"source":{"id":"1806.10424","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-06-27T11:59:00Z","cross_cats_sorted":[],"title_canon_sha256":"0a21ed8cd45bd654d85a0343de14879795419e451f3180df5f583e2e919d98ec","abstract_canon_sha256":"723157fdec9537482e7d42a1d08a7ca03a4297a96e00353dd692cc945dc18bc2"},"schema_version":"1.0"},"canonical_sha256":"c20f7816e5e72a5eb087bac5ffc2b166424340e2b0981e8dbedbc2ef78cf9567","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:12:08.461773Z","signature_b64":"ZzLUePlr6oayFPngD2h6EXUHrOh8i2vZtNOF8juKqD82vOVPBZcOI1X9A54ycZTriO8cFv5dXfpLUN9E1d9oDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c20f7816e5e72a5eb087bac5ffc2b166424340e2b0981e8dbedbc2ef78cf9567","last_reissued_at":"2026-05-18T00:12:08.461292Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:12:08.461292Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1806.10424","source_version":2,"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:12:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sxH9qW73nfzpI0wxM5DBB65Jf/dRZRKRfrk6aQDvS5TYIJKOLqmVVMaHEyiyutoVNZc9vwnpbVEQb59KAzxeAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T21:22:42.748976Z"},"content_sha256":"621904b436acc69388946ccbece87a66bfc270355bed83394010e43380a1d179","schema_version":"1.0","event_id":"sha256:621904b436acc69388946ccbece87a66bfc270355bed83394010e43380a1d179"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:YIHXQFXF44VF5MEHXLC77QVRMZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the maximum number of maximum independent sets in connected graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"D. Rautenbach, E. Mohr","submitted_at":"2018-06-27T11:59:00Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.10424","kind":"arxiv","version":2},"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:12:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AToXBrn+BpGvlhtojEd9DfL8899D3jKzOIT/FYFkn4g9sJJJYKKFyf1vyOCT/zy24d9blcg7ANB0p7YaUpAMBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T21:22:42.749605Z"},"content_sha256":"9f1c1469a344aac83ffc85f5f160e09ff2286a80f3cee960bf98854760752918","schema_version":"1.0","event_id":"sha256:9f1c1469a344aac83ffc85f5f160e09ff2286a80f3cee960bf98854760752918"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YIHXQFXF44VF5MEHXLC77QVRMZ/bundle.json","state_url":"https://pith.science/pith/YIHXQFXF44VF5MEHXLC77QVRMZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YIHXQFXF44VF5MEHXLC77QVRMZ/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-31T21:22:42Z","links":{"resolver":"https://pith.science/pith/YIHXQFXF44VF5MEHXLC77QVRMZ","bundle":"https://pith.science/pith/YIHXQFXF44VF5MEHXLC77QVRMZ/bundle.json","state":"https://pith.science/pith/YIHXQFXF44VF5MEHXLC77QVRMZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YIHXQFXF44VF5MEHXLC77QVRMZ/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KaBoFFnsUtHa7Wm/cR4jcEzmZjhu0/tqQ5z1aAWV8BH9afQPiffINWC9PQqf+KsEXDIY9aAJ/+C2xi1qhB7iDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T21:22:42.752583Z","bundle_sha256":"dc3d7c538c17817c7436ac6f29ffba4d3576b364ac1edff831056a401e51495b"}}