{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:Z3SBSLBXPWEXQNDOWLDUZNQX7F","short_pith_number":"pith:Z3SBSLBX","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"},"canonical_sha256":"cee4192c377d8978346eb2c74cb617f961d6cbaa16a379fc0a6779b225a9d1c8","source":{"kind":"arxiv","id":"1907.03913","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.03913","created_at":"2026-05-17T23:41:06Z"},{"alias_kind":"arxiv_version","alias_value":"1907.03913v1","created_at":"2026-05-17T23:41:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.03913","created_at":"2026-05-17T23:41:06Z"},{"alias_kind":"pith_short_12","alias_value":"Z3SBSLBXPWEX","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"Z3SBSLBXPWEXQNDO","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"Z3SBSLBX","created_at":"2026-05-18T12:33:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:Z3SBSLBXPWEXQNDOWLDUZNQX7F","target":"record","payload":{"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"},"canonical_sha256":"cee4192c377d8978346eb2c74cb617f961d6cbaa16a379fc0a6779b225a9d1c8","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"},"source_kind":"arxiv","source_id":"1907.03913","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:41:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uEkXM7jNcHFPQ2sIzRbA1BPSDy40ihKeryVimfNdNPmHDYxxA0l4RbSwM2zhs+8hJn901wHe5+J16MAZ+p26Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T23:32:19.313902Z"},"content_sha256":"6af6dba13218f13adffd02f7f838452bc92980914b0fe55ebd4c3c9c088d2072","schema_version":"1.0","event_id":"sha256:6af6dba13218f13adffd02f7f838452bc92980914b0fe55ebd4c3c9c088d2072"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:Z3SBSLBXPWEXQNDOWLDUZNQX7F","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:41:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fQwxpUCAwaSx5EnT9QN8cbWGQL47JLjGQnLFPxJyHeh7svWYX0Vsi/8LY6jRJUqwTT4LEYWZ9h7UnYlJ+SB0BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T23:32:19.314569Z"},"content_sha256":"89d5797df7ab38e6f9f2051d1b5515bea5edc01ad1243cd603c46bfe8f9dfdcf","schema_version":"1.0","event_id":"sha256:89d5797df7ab38e6f9f2051d1b5515bea5edc01ad1243cd603c46bfe8f9dfdcf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Z3SBSLBXPWEXQNDOWLDUZNQX7F/bundle.json","state_url":"https://pith.science/pith/Z3SBSLBXPWEXQNDOWLDUZNQX7F/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Z3SBSLBXPWEXQNDOWLDUZNQX7F/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-25T23:32:19Z","links":{"resolver":"https://pith.science/pith/Z3SBSLBXPWEXQNDOWLDUZNQX7F","bundle":"https://pith.science/pith/Z3SBSLBXPWEXQNDOWLDUZNQX7F/bundle.json","state":"https://pith.science/pith/Z3SBSLBXPWEXQNDOWLDUZNQX7F/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Z3SBSLBXPWEXQNDOWLDUZNQX7F/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:Z3SBSLBXPWEXQNDOWLDUZNQX7F","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":"4228bbca3b5928ec90132a80837b70986cd573ed0725524f7c191b1900d25d94","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-07-09T00:09:55Z","title_canon_sha256":"7e0384e669acdee766d71b91e70a428a9bdf67f58375559168db1d4f1022ed42"},"schema_version":"1.0","source":{"id":"1907.03913","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.03913","created_at":"2026-05-17T23:41:06Z"},{"alias_kind":"arxiv_version","alias_value":"1907.03913v1","created_at":"2026-05-17T23:41:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.03913","created_at":"2026-05-17T23:41:06Z"},{"alias_kind":"pith_short_12","alias_value":"Z3SBSLBXPWEX","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"Z3SBSLBXPWEXQNDO","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"Z3SBSLBX","created_at":"2026-05-18T12:33:33Z"}],"graph_snapshots":[{"event_id":"sha256:89d5797df7ab38e6f9f2051d1b5515bea5edc01ad1243cd603c46bfe8f9dfdcf","target":"graph","created_at":"2026-05-17T23:41:06Z","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":"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","authors_text":"John Engbers, Lauren Keough, Taylor Short","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-07-09T00:09:55Z","title":"Independent Sets in n-vertex k-chromatic, \\ell-connected graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.03913","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:6af6dba13218f13adffd02f7f838452bc92980914b0fe55ebd4c3c9c088d2072","target":"record","created_at":"2026-05-17T23:41:06Z","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":"4228bbca3b5928ec90132a80837b70986cd573ed0725524f7c191b1900d25d94","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-07-09T00:09:55Z","title_canon_sha256":"7e0384e669acdee766d71b91e70a428a9bdf67f58375559168db1d4f1022ed42"},"schema_version":"1.0","source":{"id":"1907.03913","kind":"arxiv","version":1}},"canonical_sha256":"cee4192c377d8978346eb2c74cb617f961d6cbaa16a379fc0a6779b225a9d1c8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cee4192c377d8978346eb2c74cb617f961d6cbaa16a379fc0a6779b225a9d1c8","first_computed_at":"2026-05-17T23:41:06.410791Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:41:06.410791Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/6U+HEkevdmZG09xqnK86/Zu7PTxRDeytMbrz6WfbvFp/Njo/aeMa/XvH1mL3mhUZGEPEPK0UbQLWVo5ZI8mCQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:41:06.411506Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.03913","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6af6dba13218f13adffd02f7f838452bc92980914b0fe55ebd4c3c9c088d2072","sha256:89d5797df7ab38e6f9f2051d1b5515bea5edc01ad1243cd603c46bfe8f9dfdcf"],"state_sha256":"2e7c57c575a8c79042aea60c8765f4c393939063e2ef19197b5ccd2a19f2fb42"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UU41+uLi0ULCW8hslkfdeUyQnwCdHbRKVjXcz5DvKmWAxv4xpBy7VaXqWqYSmpfvzT9dJdB+Ty9c3XQJMa+MAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T23:32:19.318155Z","bundle_sha256":"b13be52561d8b6c07cd126f07b0c37ad1231e05844fd7b0b2e020036f6932d9a"}}