{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:FTAIPVZVRHWHMMLB2UTLYGUVTR","short_pith_number":"pith:FTAIPVZV","schema_version":"1.0","canonical_sha256":"2cc087d73589ec763161d526bc1a959c5f97c85322e42a55717c6b31673c4a6b","source":{"kind":"arxiv","id":"2108.06359","version":1},"attestation_state":"computed","paper":{"title":"Maximal independent sets in clique-free graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jiaxi Nie, Sam Spiro, Xiaoyu He","submitted_at":"2021-08-13T18:42:29Z","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. "},"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":"2108.06359","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2021-08-13T18:42:29Z","cross_cats_sorted":[],"title_canon_sha256":"220ee7e4ae36fcd2bae5dba0c300af9c6734524d307c19da9fd57f58e055b31c","abstract_canon_sha256":"ffced0ddbada8089038daf00d94d9223c53abbd560b423747f9e3eeecaccfeb8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:05:53.649820Z","signature_b64":"zB1q+n5dr+re7jbCym6eIE++AQdj6Gd1qkLmnYm+J8PR8lQgqIYqx6cibzesgbC1qkSi7AmuPGbfazAHMPl/Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2cc087d73589ec763161d526bc1a959c5f97c85322e42a55717c6b31673c4a6b","last_reissued_at":"2026-07-05T03:05:53.649390Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:05:53.649390Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Maximal independent sets in clique-free graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jiaxi Nie, Sam Spiro, Xiaoyu He","submitted_at":"2021-08-13T18:42:29Z","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. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2108.06359","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2108.06359/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2108.06359","created_at":"2026-07-05T03:05:53.649451+00:00"},{"alias_kind":"arxiv_version","alias_value":"2108.06359v1","created_at":"2026-07-05T03:05:53.649451+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2108.06359","created_at":"2026-07-05T03:05:53.649451+00:00"},{"alias_kind":"pith_short_12","alias_value":"FTAIPVZVRHWH","created_at":"2026-07-05T03:05:53.649451+00:00"},{"alias_kind":"pith_short_16","alias_value":"FTAIPVZVRHWHMMLB","created_at":"2026-07-05T03:05:53.649451+00:00"},{"alias_kind":"pith_short_8","alias_value":"FTAIPVZV","created_at":"2026-07-05T03:05:53.649451+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/FTAIPVZVRHWHMMLB2UTLYGUVTR","json":"https://pith.science/pith/FTAIPVZVRHWHMMLB2UTLYGUVTR.json","graph_json":"https://pith.science/api/pith-number/FTAIPVZVRHWHMMLB2UTLYGUVTR/graph.json","events_json":"https://pith.science/api/pith-number/FTAIPVZVRHWHMMLB2UTLYGUVTR/events.json","paper":"https://pith.science/paper/FTAIPVZV"},"agent_actions":{"view_html":"https://pith.science/pith/FTAIPVZVRHWHMMLB2UTLYGUVTR","download_json":"https://pith.science/pith/FTAIPVZVRHWHMMLB2UTLYGUVTR.json","view_paper":"https://pith.science/paper/FTAIPVZV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2108.06359&json=true","fetch_graph":"https://pith.science/api/pith-number/FTAIPVZVRHWHMMLB2UTLYGUVTR/graph.json","fetch_events":"https://pith.science/api/pith-number/FTAIPVZVRHWHMMLB2UTLYGUVTR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FTAIPVZVRHWHMMLB2UTLYGUVTR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FTAIPVZVRHWHMMLB2UTLYGUVTR/action/storage_attestation","attest_author":"https://pith.science/pith/FTAIPVZVRHWHMMLB2UTLYGUVTR/action/author_attestation","sign_citation":"https://pith.science/pith/FTAIPVZVRHWHMMLB2UTLYGUVTR/action/citation_signature","submit_replication":"https://pith.science/pith/FTAIPVZVRHWHMMLB2UTLYGUVTR/action/replication_record"}},"created_at":"2026-07-05T03:05:53.649451+00:00","updated_at":"2026-07-05T03:05:53.649451+00:00"}