{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:NV2EHG3FGWW4OSPNSPLZIZY3E4","short_pith_number":"pith:NV2EHG3F","canonical_record":{"source":{"id":"1912.03236","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-12-06T17:22:22Z","cross_cats_sorted":[],"title_canon_sha256":"ca047c8e2a66c4d1ca8702cf5de405275822af156ec3c39c851abcc747ddbc54","abstract_canon_sha256":"84f3b73e9378009a7950acd00fb58d76c59af14046d90719f3b1a610ac9ef92f"},"schema_version":"1.0"},"canonical_sha256":"6d74439b6535adc749ed93d794671b2731e5cc8056af2f01542dacbd6a91f1ae","source":{"kind":"arxiv","id":"1912.03236","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1912.03236","created_at":"2026-07-05T00:24:31Z"},{"alias_kind":"arxiv_version","alias_value":"1912.03236v1","created_at":"2026-07-05T00:24:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1912.03236","created_at":"2026-07-05T00:24:31Z"},{"alias_kind":"pith_short_12","alias_value":"NV2EHG3FGWW4","created_at":"2026-07-05T00:24:31Z"},{"alias_kind":"pith_short_16","alias_value":"NV2EHG3FGWW4OSPN","created_at":"2026-07-05T00:24:31Z"},{"alias_kind":"pith_short_8","alias_value":"NV2EHG3F","created_at":"2026-07-05T00:24:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:NV2EHG3FGWW4OSPNSPLZIZY3E4","target":"record","payload":{"canonical_record":{"source":{"id":"1912.03236","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-12-06T17:22:22Z","cross_cats_sorted":[],"title_canon_sha256":"ca047c8e2a66c4d1ca8702cf5de405275822af156ec3c39c851abcc747ddbc54","abstract_canon_sha256":"84f3b73e9378009a7950acd00fb58d76c59af14046d90719f3b1a610ac9ef92f"},"schema_version":"1.0"},"canonical_sha256":"6d74439b6535adc749ed93d794671b2731e5cc8056af2f01542dacbd6a91f1ae","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:24:31.933776Z","signature_b64":"DwhsQHqqkEoVkdL9ODdnRi+hWRQ0SYbkJIXZkbws98h3nbG3YIO14pHACloZiwP6Dld7oS5N/DDY0TH5OxJuCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6d74439b6535adc749ed93d794671b2731e5cc8056af2f01542dacbd6a91f1ae","last_reissued_at":"2026-07-05T00:24:31.933335Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:24:31.933335Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1912.03236","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-07-05T00:24:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pKDuFkLEKe+n78BNeXlRUTdflR8bQXOS0VNfZCO24/Ic9nWIpnpdfzHAf1ktqFdcXR3cePhBXIVzioxsn+rgAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T04:13:22.222353Z"},"content_sha256":"49bb40034f0c110dd6266b7973e4267836d1c0440a15742ca679707cd1ba0f0c","schema_version":"1.0","event_id":"sha256:49bb40034f0c110dd6266b7973e4267836d1c0440a15742ca679707cd1ba0f0c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:NV2EHG3FGWW4OSPNSPLZIZY3E4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Tomescu's graph coloring conjecture for $\\ell$-connected graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Aysel Erey, Jacob Fox, John Engbers, Xiaoyu He","submitted_at":"2019-12-06T17:22:22Z","abstract_excerpt":"Let $P_G(k)$ be the number of proper $k$-colorings of a finite simple graph $G$. Tomescu's conjecture, which was recently solved by Fox, He, and Manners, states that $P_G(k) \\le k!(k-1)^{n-k}$ for all connected graphs $G$ on $n$ vertices with chromatic number $k\\geq 4$. In this paper, we study the same problem with the additional constraint that $G$ is $\\ell$-connected. For $2$-connected graphs $G$, we prove a tight bound \\[ P_G(k) \\le (k-1)!((k-1)^{n-k+1} + (-1)^{n-k}), \\] and show that equality is only achieved if $G$ is a $k$-clique with an ear attached. For $\\ell \\ge 3$, we prove an asympt"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1912.03236","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/1912.03236/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"},"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-07-05T00:24:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sawpqQ/DipDiGC8dYUCelI6hWIxBpoWDzz+frvYA35Pjj38kjkByhlWec666circ9yyb3IvHanX+k5/2ItjsBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T04:13:22.222733Z"},"content_sha256":"f63ffac5e7851b460dec1984db2ab7e31488108bed027d71afbbc1891f3c8739","schema_version":"1.0","event_id":"sha256:f63ffac5e7851b460dec1984db2ab7e31488108bed027d71afbbc1891f3c8739"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NV2EHG3FGWW4OSPNSPLZIZY3E4/bundle.json","state_url":"https://pith.science/pith/NV2EHG3FGWW4OSPNSPLZIZY3E4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NV2EHG3FGWW4OSPNSPLZIZY3E4/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-07-07T04:13:22Z","links":{"resolver":"https://pith.science/pith/NV2EHG3FGWW4OSPNSPLZIZY3E4","bundle":"https://pith.science/pith/NV2EHG3FGWW4OSPNSPLZIZY3E4/bundle.json","state":"https://pith.science/pith/NV2EHG3FGWW4OSPNSPLZIZY3E4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NV2EHG3FGWW4OSPNSPLZIZY3E4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:NV2EHG3FGWW4OSPNSPLZIZY3E4","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":"84f3b73e9378009a7950acd00fb58d76c59af14046d90719f3b1a610ac9ef92f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-12-06T17:22:22Z","title_canon_sha256":"ca047c8e2a66c4d1ca8702cf5de405275822af156ec3c39c851abcc747ddbc54"},"schema_version":"1.0","source":{"id":"1912.03236","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1912.03236","created_at":"2026-07-05T00:24:31Z"},{"alias_kind":"arxiv_version","alias_value":"1912.03236v1","created_at":"2026-07-05T00:24:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1912.03236","created_at":"2026-07-05T00:24:31Z"},{"alias_kind":"pith_short_12","alias_value":"NV2EHG3FGWW4","created_at":"2026-07-05T00:24:31Z"},{"alias_kind":"pith_short_16","alias_value":"NV2EHG3FGWW4OSPN","created_at":"2026-07-05T00:24:31Z"},{"alias_kind":"pith_short_8","alias_value":"NV2EHG3F","created_at":"2026-07-05T00:24:31Z"}],"graph_snapshots":[{"event_id":"sha256:f63ffac5e7851b460dec1984db2ab7e31488108bed027d71afbbc1891f3c8739","target":"graph","created_at":"2026-07-05T00:24:31Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1912.03236/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Let $P_G(k)$ be the number of proper $k$-colorings of a finite simple graph $G$. Tomescu's conjecture, which was recently solved by Fox, He, and Manners, states that $P_G(k) \\le k!(k-1)^{n-k}$ for all connected graphs $G$ on $n$ vertices with chromatic number $k\\geq 4$. In this paper, we study the same problem with the additional constraint that $G$ is $\\ell$-connected. For $2$-connected graphs $G$, we prove a tight bound \\[ P_G(k) \\le (k-1)!((k-1)^{n-k+1} + (-1)^{n-k}), \\] and show that equality is only achieved if $G$ is a $k$-clique with an ear attached. For $\\ell \\ge 3$, we prove an asympt","authors_text":"Aysel Erey, Jacob Fox, John Engbers, Xiaoyu He","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-12-06T17:22:22Z","title":"Tomescu's graph coloring conjecture for $\\ell$-connected graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1912.03236","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:49bb40034f0c110dd6266b7973e4267836d1c0440a15742ca679707cd1ba0f0c","target":"record","created_at":"2026-07-05T00:24:31Z","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":"84f3b73e9378009a7950acd00fb58d76c59af14046d90719f3b1a610ac9ef92f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-12-06T17:22:22Z","title_canon_sha256":"ca047c8e2a66c4d1ca8702cf5de405275822af156ec3c39c851abcc747ddbc54"},"schema_version":"1.0","source":{"id":"1912.03236","kind":"arxiv","version":1}},"canonical_sha256":"6d74439b6535adc749ed93d794671b2731e5cc8056af2f01542dacbd6a91f1ae","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6d74439b6535adc749ed93d794671b2731e5cc8056af2f01542dacbd6a91f1ae","first_computed_at":"2026-07-05T00:24:31.933335Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:24:31.933335Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DwhsQHqqkEoVkdL9ODdnRi+hWRQ0SYbkJIXZkbws98h3nbG3YIO14pHACloZiwP6Dld7oS5N/DDY0TH5OxJuCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T00:24:31.933776Z","signed_message":"canonical_sha256_bytes"},"source_id":"1912.03236","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:49bb40034f0c110dd6266b7973e4267836d1c0440a15742ca679707cd1ba0f0c","sha256:f63ffac5e7851b460dec1984db2ab7e31488108bed027d71afbbc1891f3c8739"],"state_sha256":"3149646d66a1652826b1265d4b539d3e8735784b47ff3f2100c29c99e9185ba9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GnChwDNhMAry3rO8WV3EA9TNXt4z0Ck0jVRWa41p/ggAJGLhZeuj9tNsgmPRzbR492durRZKwKcQBPzPCpdeDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T04:13:22.224779Z","bundle_sha256":"67e0b9b0021143430721fab936348cced8f557f281688abb8005184f1b9831f6"}}