{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:TT3HSCMSXOSN7JEK4ZDAQKILBT","short_pith_number":"pith:TT3HSCMS","schema_version":"1.0","canonical_sha256":"9cf6790992bba4dfa48ae64608290b0cc52f29b4e50924030161ee62f5a2dd5b","source":{"kind":"arxiv","id":"1712.06067","version":3},"attestation_state":"computed","paper":{"title":"A proof of Tomescu's graph coloring conjecture","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Freddie Manners, Jacob Fox, Xiaoyu He","submitted_at":"2017-12-17T07:20:56Z","abstract_excerpt":"In 1971, Tomescu conjectured that every connected graph $G$ on $n$ vertices with chromatic number $k\\geq4$ has at most $k!(k-1)^{n-k}$ proper $k$-colorings. Recently, Knox and Mohar proved Tomescu's conjecture for $k=4$ and $k=5$. In this paper, we complete the proof of Tomescu's conjecture for all $k\\ge 4$, and show that equality occurs if and only if $G$ is a $k$-clique with trees attached to each vertex."},"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":"1712.06067","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-12-17T07:20:56Z","cross_cats_sorted":[],"title_canon_sha256":"86021ed153b48849839c170ddf42a954b430c3d8a9f7eff470b2c2405f2724a4","abstract_canon_sha256":"88dfc105625f8c1e9bd772deac702ea8ad2dd4bc7b712ed1dcb4f4de93bb62be"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:45.363710Z","signature_b64":"l4q/FK08HL8w7NbWR++bqnDTXax3mC3fzyjG9sQ8aJCsFlgma9dFw/mSOxwIv6lMEJn5fjG/iBbZW9KfvmM1Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9cf6790992bba4dfa48ae64608290b0cc52f29b4e50924030161ee62f5a2dd5b","last_reissued_at":"2026-05-18T00:02:45.363265Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:45.363265Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A proof of Tomescu's graph coloring conjecture","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Freddie Manners, Jacob Fox, Xiaoyu He","submitted_at":"2017-12-17T07:20:56Z","abstract_excerpt":"In 1971, Tomescu conjectured that every connected graph $G$ on $n$ vertices with chromatic number $k\\geq4$ has at most $k!(k-1)^{n-k}$ proper $k$-colorings. Recently, Knox and Mohar proved Tomescu's conjecture for $k=4$ and $k=5$. In this paper, we complete the proof of Tomescu's conjecture for all $k\\ge 4$, and show that equality occurs if and only if $G$ is a $k$-clique with trees attached to each vertex."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.06067","kind":"arxiv","version":3},"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":"1712.06067","created_at":"2026-05-18T00:02:45.363345+00:00"},{"alias_kind":"arxiv_version","alias_value":"1712.06067v3","created_at":"2026-05-18T00:02:45.363345+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.06067","created_at":"2026-05-18T00:02:45.363345+00:00"},{"alias_kind":"pith_short_12","alias_value":"TT3HSCMSXOSN","created_at":"2026-05-18T12:31:46.661854+00:00"},{"alias_kind":"pith_short_16","alias_value":"TT3HSCMSXOSN7JEK","created_at":"2026-05-18T12:31:46.661854+00:00"},{"alias_kind":"pith_short_8","alias_value":"TT3HSCMS","created_at":"2026-05-18T12:31:46.661854+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/TT3HSCMSXOSN7JEK4ZDAQKILBT","json":"https://pith.science/pith/TT3HSCMSXOSN7JEK4ZDAQKILBT.json","graph_json":"https://pith.science/api/pith-number/TT3HSCMSXOSN7JEK4ZDAQKILBT/graph.json","events_json":"https://pith.science/api/pith-number/TT3HSCMSXOSN7JEK4ZDAQKILBT/events.json","paper":"https://pith.science/paper/TT3HSCMS"},"agent_actions":{"view_html":"https://pith.science/pith/TT3HSCMSXOSN7JEK4ZDAQKILBT","download_json":"https://pith.science/pith/TT3HSCMSXOSN7JEK4ZDAQKILBT.json","view_paper":"https://pith.science/paper/TT3HSCMS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1712.06067&json=true","fetch_graph":"https://pith.science/api/pith-number/TT3HSCMSXOSN7JEK4ZDAQKILBT/graph.json","fetch_events":"https://pith.science/api/pith-number/TT3HSCMSXOSN7JEK4ZDAQKILBT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TT3HSCMSXOSN7JEK4ZDAQKILBT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TT3HSCMSXOSN7JEK4ZDAQKILBT/action/storage_attestation","attest_author":"https://pith.science/pith/TT3HSCMSXOSN7JEK4ZDAQKILBT/action/author_attestation","sign_citation":"https://pith.science/pith/TT3HSCMSXOSN7JEK4ZDAQKILBT/action/citation_signature","submit_replication":"https://pith.science/pith/TT3HSCMSXOSN7JEK4ZDAQKILBT/action/replication_record"}},"created_at":"2026-05-18T00:02:45.363345+00:00","updated_at":"2026-05-18T00:02:45.363345+00:00"}