{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:FTAIPVZVRHWHMMLB2UTLYGUVTR","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":"ffced0ddbada8089038daf00d94d9223c53abbd560b423747f9e3eeecaccfeb8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2021-08-13T18:42:29Z","title_canon_sha256":"220ee7e4ae36fcd2bae5dba0c300af9c6734524d307c19da9fd57f58e055b31c"},"schema_version":"1.0","source":{"id":"2108.06359","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2108.06359","created_at":"2026-07-05T03:05:53Z"},{"alias_kind":"arxiv_version","alias_value":"2108.06359v1","created_at":"2026-07-05T03:05:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2108.06359","created_at":"2026-07-05T03:05:53Z"},{"alias_kind":"pith_short_12","alias_value":"FTAIPVZVRHWH","created_at":"2026-07-05T03:05:53Z"},{"alias_kind":"pith_short_16","alias_value":"FTAIPVZVRHWHMMLB","created_at":"2026-07-05T03:05:53Z"},{"alias_kind":"pith_short_8","alias_value":"FTAIPVZV","created_at":"2026-07-05T03:05:53Z"}],"graph_snapshots":[{"event_id":"sha256:09007818ec613d843dfab157496d3c1e03f5cdf113ac2c6aad292911579ccccc","target":"graph","created_at":"2026-07-05T03:05:53Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2108.06359/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Nielsen proved that the maximum number of maximal independent sets (MIS's) of size $k$ in an $n$-vertex graph is asymptotic to $(n/k)^k$, with the extremal construction a disjoint union of $k$ cliques with sizes as close to $n/k$ as possible. In this paper we study how many MIS's of size $k$ an $n$-vertex graph $G$ can have if $G$ does not contain a clique $K_t$. We prove for all fixed $k$ and $t$ that there exist such graphs with $n^{\\lfloor\\frac{(t-2)k}{t-1}\\rfloor-o(1)}$ MIS's of size $k$ by utilizing recent work of Gowers and B. Janzer on a generalization of the Ruzsa-Szemer\\'edi problem. ","authors_text":"Jiaxi Nie, Sam Spiro, Xiaoyu He","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2021-08-13T18:42:29Z","title":"Maximal independent sets in clique-free graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2108.06359","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:f1a22bba76c61a98a28c312031a11d9eef5d25d14914051b5538240326f549f5","target":"record","created_at":"2026-07-05T03:05:53Z","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":"ffced0ddbada8089038daf00d94d9223c53abbd560b423747f9e3eeecaccfeb8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2021-08-13T18:42:29Z","title_canon_sha256":"220ee7e4ae36fcd2bae5dba0c300af9c6734524d307c19da9fd57f58e055b31c"},"schema_version":"1.0","source":{"id":"2108.06359","kind":"arxiv","version":1}},"canonical_sha256":"2cc087d73589ec763161d526bc1a959c5f97c85322e42a55717c6b31673c4a6b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2cc087d73589ec763161d526bc1a959c5f97c85322e42a55717c6b31673c4a6b","first_computed_at":"2026-07-05T03:05:53.649390Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:05:53.649390Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zB1q+n5dr+re7jbCym6eIE++AQdj6Gd1qkLmnYm+J8PR8lQgqIYqx6cibzesgbC1qkSi7AmuPGbfazAHMPl/Bw==","signature_status":"signed_v1","signed_at":"2026-07-05T03:05:53.649820Z","signed_message":"canonical_sha256_bytes"},"source_id":"2108.06359","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f1a22bba76c61a98a28c312031a11d9eef5d25d14914051b5538240326f549f5","sha256:09007818ec613d843dfab157496d3c1e03f5cdf113ac2c6aad292911579ccccc"],"state_sha256":"d124c2fbeb07c698b126d6e85c8445d3db920cd4e1272b8a445af2e1c46f8b78"}