{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:TT3HSCMSXOSN7JEK4ZDAQKILBT","short_pith_number":"pith:TT3HSCMS","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"},"canonical_sha256":"9cf6790992bba4dfa48ae64608290b0cc52f29b4e50924030161ee62f5a2dd5b","source":{"kind":"arxiv","id":"1712.06067","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.06067","created_at":"2026-05-18T00:02:45Z"},{"alias_kind":"arxiv_version","alias_value":"1712.06067v3","created_at":"2026-05-18T00:02:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.06067","created_at":"2026-05-18T00:02:45Z"},{"alias_kind":"pith_short_12","alias_value":"TT3HSCMSXOSN","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"TT3HSCMSXOSN7JEK","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"TT3HSCMS","created_at":"2026-05-18T12:31:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:TT3HSCMSXOSN7JEK4ZDAQKILBT","target":"record","payload":{"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"},"canonical_sha256":"9cf6790992bba4dfa48ae64608290b0cc52f29b4e50924030161ee62f5a2dd5b","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"},"source_kind":"arxiv","source_id":"1712.06067","source_version":3,"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-18T00:02:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Xgo0OwWSIvveXcWW4Oa4SMXm61/Vew7EsLu7n/QQfcxeBVUQVzXl4u3Beng/2NhdwenWkiLiOZSoT5zg+/8BAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T04:41:03.098020Z"},"content_sha256":"ee5e2004d20b3b8696795880d31311c9f30c7fa616eae58afd8e0ed88d724753","schema_version":"1.0","event_id":"sha256:ee5e2004d20b3b8696795880d31311c9f30c7fa616eae58afd8e0ed88d724753"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:TT3HSCMSXOSN7JEK4ZDAQKILBT","target":"graph","payload":{"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"},"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-18T00:02:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qI9zycGg1l710Y9hqn3T9fMXj0G1s13io1TREbI1QTDLxU6QNL/1RTXJVPNeIacW9oOezw5JmOLqxP8qhks8AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T04:41:03.098665Z"},"content_sha256":"4daf04fefa532a6d87dd71907410bc3f6b17b4e3b19ac1ef6435b3ba8968be90","schema_version":"1.0","event_id":"sha256:4daf04fefa532a6d87dd71907410bc3f6b17b4e3b19ac1ef6435b3ba8968be90"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TT3HSCMSXOSN7JEK4ZDAQKILBT/bundle.json","state_url":"https://pith.science/pith/TT3HSCMSXOSN7JEK4ZDAQKILBT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TT3HSCMSXOSN7JEK4ZDAQKILBT/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-30T04:41:03Z","links":{"resolver":"https://pith.science/pith/TT3HSCMSXOSN7JEK4ZDAQKILBT","bundle":"https://pith.science/pith/TT3HSCMSXOSN7JEK4ZDAQKILBT/bundle.json","state":"https://pith.science/pith/TT3HSCMSXOSN7JEK4ZDAQKILBT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TT3HSCMSXOSN7JEK4ZDAQKILBT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:TT3HSCMSXOSN7JEK4ZDAQKILBT","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":"88dfc105625f8c1e9bd772deac702ea8ad2dd4bc7b712ed1dcb4f4de93bb62be","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-12-17T07:20:56Z","title_canon_sha256":"86021ed153b48849839c170ddf42a954b430c3d8a9f7eff470b2c2405f2724a4"},"schema_version":"1.0","source":{"id":"1712.06067","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.06067","created_at":"2026-05-18T00:02:45Z"},{"alias_kind":"arxiv_version","alias_value":"1712.06067v3","created_at":"2026-05-18T00:02:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.06067","created_at":"2026-05-18T00:02:45Z"},{"alias_kind":"pith_short_12","alias_value":"TT3HSCMSXOSN","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"TT3HSCMSXOSN7JEK","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"TT3HSCMS","created_at":"2026-05-18T12:31:46Z"}],"graph_snapshots":[{"event_id":"sha256:4daf04fefa532a6d87dd71907410bc3f6b17b4e3b19ac1ef6435b3ba8968be90","target":"graph","created_at":"2026-05-18T00:02:45Z","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":"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.","authors_text":"Freddie Manners, Jacob Fox, Xiaoyu He","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-12-17T07:20:56Z","title":"A proof of Tomescu's graph coloring conjecture"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.06067","kind":"arxiv","version":3},"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:ee5e2004d20b3b8696795880d31311c9f30c7fa616eae58afd8e0ed88d724753","target":"record","created_at":"2026-05-18T00:02:45Z","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":"88dfc105625f8c1e9bd772deac702ea8ad2dd4bc7b712ed1dcb4f4de93bb62be","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-12-17T07:20:56Z","title_canon_sha256":"86021ed153b48849839c170ddf42a954b430c3d8a9f7eff470b2c2405f2724a4"},"schema_version":"1.0","source":{"id":"1712.06067","kind":"arxiv","version":3}},"canonical_sha256":"9cf6790992bba4dfa48ae64608290b0cc52f29b4e50924030161ee62f5a2dd5b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9cf6790992bba4dfa48ae64608290b0cc52f29b4e50924030161ee62f5a2dd5b","first_computed_at":"2026-05-18T00:02:45.363265Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:02:45.363265Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"l4q/FK08HL8w7NbWR++bqnDTXax3mC3fzyjG9sQ8aJCsFlgma9dFw/mSOxwIv6lMEJn5fjG/iBbZW9KfvmM1Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T00:02:45.363710Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.06067","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ee5e2004d20b3b8696795880d31311c9f30c7fa616eae58afd8e0ed88d724753","sha256:4daf04fefa532a6d87dd71907410bc3f6b17b4e3b19ac1ef6435b3ba8968be90"],"state_sha256":"b3a60ca19f19303e138b621803ddadb40c8daad4ef913e452d5023f24b8de82f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BkloxAOQdbUaM319O2HQxQ8coOgz7kq8nh01+nJdKAtdn2wxMV/F/TWcBWXtrgLupe+uPclqnvf8fP1XSDDJAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T04:41:03.102061Z","bundle_sha256":"f251075178c8c5c073793560ab971716d42f7a5fdcbf32ce8c2482eac7c2e3d7"}}