{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:XZFJ2BSISCNNMHW5DIRWZLRDUN","short_pith_number":"pith:XZFJ2BSI","schema_version":"1.0","canonical_sha256":"be4a9d0648909ad61edd1a236cae23a34c48b9e593980287bbb54c68d6be9fbc","source":{"kind":"arxiv","id":"1204.3060","version":1},"attestation_state":"computed","paper":{"title":"Counting independent sets of a fixed size in graphs with a given minimum degree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"David Galvin, John Engbers","submitted_at":"2012-04-13T17:41:05Z","abstract_excerpt":"Galvin showed that for all fixed $\\delta$ and sufficiently large $n$, the $n$-vertex graph with minimum degree $\\delta$ that admits the most independent sets is the complete bipartite graph $K_{\\delta,n-\\delta}$. He conjectured that except perhaps for some small values of $t$, the same graph yields the maximum count of independent sets of size $t$ for each possible $t$. Evidence for this conjecture was recently provided by Alexander, Cutler, and Mink, who showed that for all triples $(n,\\delta, t)$ with $t\\geq 3$, no $n$-vertex {\\em bipartite} graph with minimum degree $\\delta$ admits more ind"},"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":"1204.3060","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-04-13T17:41:05Z","cross_cats_sorted":[],"title_canon_sha256":"801afec93cee58b3326b19e674bcb449ad7e14cda3257119c41001c57dc71706","abstract_canon_sha256":"bb11fc53a5091603440e93d28033e471776054086006e2b26a158b162eae1e78"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:57:54.027224Z","signature_b64":"0w2p/3Q5FJF59vPNdtdUeNXSWEYKi4ebUiBPf4Q0+DI1q9E2eSrCpPkrV3jmkkd7h3NnTkA/swxZdAFfIzWCDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"be4a9d0648909ad61edd1a236cae23a34c48b9e593980287bbb54c68d6be9fbc","last_reissued_at":"2026-05-18T03:57:54.026510Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:57:54.026510Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Counting independent sets of a fixed size in graphs with a given minimum degree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"David Galvin, John Engbers","submitted_at":"2012-04-13T17:41:05Z","abstract_excerpt":"Galvin showed that for all fixed $\\delta$ and sufficiently large $n$, the $n$-vertex graph with minimum degree $\\delta$ that admits the most independent sets is the complete bipartite graph $K_{\\delta,n-\\delta}$. He conjectured that except perhaps for some small values of $t$, the same graph yields the maximum count of independent sets of size $t$ for each possible $t$. Evidence for this conjecture was recently provided by Alexander, Cutler, and Mink, who showed that for all triples $(n,\\delta, t)$ with $t\\geq 3$, no $n$-vertex {\\em bipartite} graph with minimum degree $\\delta$ admits more ind"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.3060","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":""},"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":"1204.3060","created_at":"2026-05-18T03:57:54.026625+00:00"},{"alias_kind":"arxiv_version","alias_value":"1204.3060v1","created_at":"2026-05-18T03:57:54.026625+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.3060","created_at":"2026-05-18T03:57:54.026625+00:00"},{"alias_kind":"pith_short_12","alias_value":"XZFJ2BSISCNN","created_at":"2026-05-18T12:27:27.928770+00:00"},{"alias_kind":"pith_short_16","alias_value":"XZFJ2BSISCNNMHW5","created_at":"2026-05-18T12:27:27.928770+00:00"},{"alias_kind":"pith_short_8","alias_value":"XZFJ2BSI","created_at":"2026-05-18T12:27:27.928770+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/XZFJ2BSISCNNMHW5DIRWZLRDUN","json":"https://pith.science/pith/XZFJ2BSISCNNMHW5DIRWZLRDUN.json","graph_json":"https://pith.science/api/pith-number/XZFJ2BSISCNNMHW5DIRWZLRDUN/graph.json","events_json":"https://pith.science/api/pith-number/XZFJ2BSISCNNMHW5DIRWZLRDUN/events.json","paper":"https://pith.science/paper/XZFJ2BSI"},"agent_actions":{"view_html":"https://pith.science/pith/XZFJ2BSISCNNMHW5DIRWZLRDUN","download_json":"https://pith.science/pith/XZFJ2BSISCNNMHW5DIRWZLRDUN.json","view_paper":"https://pith.science/paper/XZFJ2BSI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1204.3060&json=true","fetch_graph":"https://pith.science/api/pith-number/XZFJ2BSISCNNMHW5DIRWZLRDUN/graph.json","fetch_events":"https://pith.science/api/pith-number/XZFJ2BSISCNNMHW5DIRWZLRDUN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XZFJ2BSISCNNMHW5DIRWZLRDUN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XZFJ2BSISCNNMHW5DIRWZLRDUN/action/storage_attestation","attest_author":"https://pith.science/pith/XZFJ2BSISCNNMHW5DIRWZLRDUN/action/author_attestation","sign_citation":"https://pith.science/pith/XZFJ2BSISCNNMHW5DIRWZLRDUN/action/citation_signature","submit_replication":"https://pith.science/pith/XZFJ2BSISCNNMHW5DIRWZLRDUN/action/replication_record"}},"created_at":"2026-05-18T03:57:54.026625+00:00","updated_at":"2026-05-18T03:57:54.026625+00:00"}