{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:AG4PVD6WC6BAK3ILG5AICEC6ZD","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":"800237987bbfed963ff187271a9c5805d7389134d85fc8af01d62e6518d2a918","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-11-17T11:25:23Z","title_canon_sha256":"48b7f54b68b452daf6614c2e9e5779ed6b8ffd75898ff42ea4205031ff59f748"},"schema_version":"1.0","source":{"id":"1311.4147","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.4147","created_at":"2026-05-17T23:53:35Z"},{"alias_kind":"arxiv_version","alias_value":"1311.4147v2","created_at":"2026-05-17T23:53:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.4147","created_at":"2026-05-17T23:53:35Z"},{"alias_kind":"pith_short_12","alias_value":"AG4PVD6WC6BA","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_16","alias_value":"AG4PVD6WC6BAK3IL","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_8","alias_value":"AG4PVD6W","created_at":"2026-05-18T12:27:38Z"}],"graph_snapshots":[{"event_id":"sha256:b164ba274562b6363390f027f0bff2630f2e624f39ac3e6460f2cfb53789a5e1","target":"graph","created_at":"2026-05-17T23:53:35Z","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":"Let $i_t(G)$ be the number of independent sets of size $t$ in a graph $G$. Engbers and Galvin asked how large $i_t(G)$ could be in graphs with minimum degree at least $\\delta$. They further conjectured that when $n\\geq 2\\delta$ and $t\\geq 3$, $i_t(G)$ is maximized by the complete bipartite graph $K_{\\delta, n-\\delta}$. This conjecture has drawn the attention of many researchers recently. In this short note, we prove this conjecture.","authors_text":"Benny Sudakov, Po-Shen Loh, Wenying Gan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-11-17T11:25:23Z","title":"Maximizing the number of independent sets of a fixed size"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.4147","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:4b9931883fac399cdabd26bfcec7be6db92bc71d661e5768d780b78c1ad603f9","target":"record","created_at":"2026-05-17T23:53:35Z","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":"800237987bbfed963ff187271a9c5805d7389134d85fc8af01d62e6518d2a918","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-11-17T11:25:23Z","title_canon_sha256":"48b7f54b68b452daf6614c2e9e5779ed6b8ffd75898ff42ea4205031ff59f748"},"schema_version":"1.0","source":{"id":"1311.4147","kind":"arxiv","version":2}},"canonical_sha256":"01b8fa8fd61782056d0b374081105ec8ef7ca94189ab6deefbbf3a30da65e2e0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"01b8fa8fd61782056d0b374081105ec8ef7ca94189ab6deefbbf3a30da65e2e0","first_computed_at":"2026-05-17T23:53:35.221970Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:53:35.221970Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mkLPvPVzgTEZ0/jOxRAMpyKX262zK3NxTOVSw7xJBIZgvSrQYS20jeKzKqqdKuojVK9iiKgaRxIRablMl5ztCA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:53:35.222582Z","signed_message":"canonical_sha256_bytes"},"source_id":"1311.4147","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4b9931883fac399cdabd26bfcec7be6db92bc71d661e5768d780b78c1ad603f9","sha256:b164ba274562b6363390f027f0bff2630f2e624f39ac3e6460f2cfb53789a5e1"],"state_sha256":"b3d3a88d25cf253bd730f4bef9f6fbbac0046f900d9518c3243f5fd5d98ad801"}