{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:Z3SBSLBXPWEXQNDOWLDUZNQX7F","short_pith_number":"pith:Z3SBSLBX","schema_version":"1.0","canonical_sha256":"cee4192c377d8978346eb2c74cb617f961d6cbaa16a379fc0a6779b225a9d1c8","source":{"kind":"arxiv","id":"1907.03913","version":1},"attestation_state":"computed","paper":{"title":"Independent Sets in n-vertex k-chromatic, \\ell-connected graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"John Engbers, Lauren Keough, Taylor Short","submitted_at":"2019-07-09T00:09:55Z","abstract_excerpt":"We study the problem of maximizing the number of independent sets in $n$-vertex $k$-chromatic $\\ell$-connected graphs. First we consider maximizing the total number of independent sets in such graphs with $n$ sufficiently large, and for this problem we use a stability argument to find the unique extremal graph. We show that our result holds within the larger family of $n$-vertex $k$-chromatic graphs with minimum degree at least $\\ell$, again for $n$ sufficiently large. We also maximize the number of independent sets of each fixed size in $n$-vertex 3-chromatic 2-connected graphs. We finally ad"},"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":"1907.03913","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-07-09T00:09:55Z","cross_cats_sorted":[],"title_canon_sha256":"7e0384e669acdee766d71b91e70a428a9bdf67f58375559168db1d4f1022ed42","abstract_canon_sha256":"4228bbca3b5928ec90132a80837b70986cd573ed0725524f7c191b1900d25d94"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:06.411506Z","signature_b64":"/6U+HEkevdmZG09xqnK86/Zu7PTxRDeytMbrz6WfbvFp/Njo/aeMa/XvH1mL3mhUZGEPEPK0UbQLWVo5ZI8mCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cee4192c377d8978346eb2c74cb617f961d6cbaa16a379fc0a6779b225a9d1c8","last_reissued_at":"2026-05-17T23:41:06.410791Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:06.410791Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Independent Sets in n-vertex k-chromatic, \\ell-connected graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"John Engbers, Lauren Keough, Taylor Short","submitted_at":"2019-07-09T00:09:55Z","abstract_excerpt":"We study the problem of maximizing the number of independent sets in $n$-vertex $k$-chromatic $\\ell$-connected graphs. First we consider maximizing the total number of independent sets in such graphs with $n$ sufficiently large, and for this problem we use a stability argument to find the unique extremal graph. We show that our result holds within the larger family of $n$-vertex $k$-chromatic graphs with minimum degree at least $\\ell$, again for $n$ sufficiently large. We also maximize the number of independent sets of each fixed size in $n$-vertex 3-chromatic 2-connected graphs. We finally ad"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.03913","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":"1907.03913","created_at":"2026-05-17T23:41:06.410900+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.03913v1","created_at":"2026-05-17T23:41:06.410900+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.03913","created_at":"2026-05-17T23:41:06.410900+00:00"},{"alias_kind":"pith_short_12","alias_value":"Z3SBSLBXPWEX","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_16","alias_value":"Z3SBSLBXPWEXQNDO","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_8","alias_value":"Z3SBSLBX","created_at":"2026-05-18T12:33:33.725879+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/Z3SBSLBXPWEXQNDOWLDUZNQX7F","json":"https://pith.science/pith/Z3SBSLBXPWEXQNDOWLDUZNQX7F.json","graph_json":"https://pith.science/api/pith-number/Z3SBSLBXPWEXQNDOWLDUZNQX7F/graph.json","events_json":"https://pith.science/api/pith-number/Z3SBSLBXPWEXQNDOWLDUZNQX7F/events.json","paper":"https://pith.science/paper/Z3SBSLBX"},"agent_actions":{"view_html":"https://pith.science/pith/Z3SBSLBXPWEXQNDOWLDUZNQX7F","download_json":"https://pith.science/pith/Z3SBSLBXPWEXQNDOWLDUZNQX7F.json","view_paper":"https://pith.science/paper/Z3SBSLBX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.03913&json=true","fetch_graph":"https://pith.science/api/pith-number/Z3SBSLBXPWEXQNDOWLDUZNQX7F/graph.json","fetch_events":"https://pith.science/api/pith-number/Z3SBSLBXPWEXQNDOWLDUZNQX7F/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Z3SBSLBXPWEXQNDOWLDUZNQX7F/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Z3SBSLBXPWEXQNDOWLDUZNQX7F/action/storage_attestation","attest_author":"https://pith.science/pith/Z3SBSLBXPWEXQNDOWLDUZNQX7F/action/author_attestation","sign_citation":"https://pith.science/pith/Z3SBSLBXPWEXQNDOWLDUZNQX7F/action/citation_signature","submit_replication":"https://pith.science/pith/Z3SBSLBXPWEXQNDOWLDUZNQX7F/action/replication_record"}},"created_at":"2026-05-17T23:41:06.410900+00:00","updated_at":"2026-05-17T23:41:06.410900+00:00"}