{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:CSXQ7QRPIQDNHXBU5VVYFBLTZZ","short_pith_number":"pith:CSXQ7QRP","canonical_record":{"source":{"id":"1710.06535","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-10-18T00:23:39Z","cross_cats_sorted":[],"title_canon_sha256":"bd89d564cb7d1ddf7333eee22c7a8b8b5fc3140e065cae1f53309cd8a404f7d9","abstract_canon_sha256":"ef00f59ac08d280e08c07d598ac044331902baf0dc1918544cdd26642ac47aea"},"schema_version":"1.0"},"canonical_sha256":"14af0fc22f4406d3dc34ed6b828573ce506ddd14bfa5800435bdbfcbd2318b3f","source":{"kind":"arxiv","id":"1710.06535","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.06535","created_at":"2026-05-18T00:32:33Z"},{"alias_kind":"arxiv_version","alias_value":"1710.06535v1","created_at":"2026-05-18T00:32:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.06535","created_at":"2026-05-18T00:32:33Z"},{"alias_kind":"pith_short_12","alias_value":"CSXQ7QRPIQDN","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"CSXQ7QRPIQDNHXBU","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"CSXQ7QRP","created_at":"2026-05-18T12:31:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:CSXQ7QRPIQDNHXBU5VVYFBLTZZ","target":"record","payload":{"canonical_record":{"source":{"id":"1710.06535","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-10-18T00:23:39Z","cross_cats_sorted":[],"title_canon_sha256":"bd89d564cb7d1ddf7333eee22c7a8b8b5fc3140e065cae1f53309cd8a404f7d9","abstract_canon_sha256":"ef00f59ac08d280e08c07d598ac044331902baf0dc1918544cdd26642ac47aea"},"schema_version":"1.0"},"canonical_sha256":"14af0fc22f4406d3dc34ed6b828573ce506ddd14bfa5800435bdbfcbd2318b3f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:32:33.450388Z","signature_b64":"xtNW1pWf5SfdXi92FNre5ytYOYkkr0UIRkoEaNL5k8IdcLIliv+N81cAtAwNnx+ftHGzJD9UgT8H8oqinWJzAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"14af0fc22f4406d3dc34ed6b828573ce506ddd14bfa5800435bdbfcbd2318b3f","last_reissued_at":"2026-05-18T00:32:33.449766Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:32:33.449766Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1710.06535","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-18T00:32:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"t0yScmzuQQdb9rQN9hEolbsnhBaNA5tFLiWqdStqd92ric2HPhINBcBjgb8jKVX0V6UccSFU6rvHJUz1IRyZAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T15:57:39.545278Z"},"content_sha256":"653323eed23b646d296c2aebba0c57b7a8e989fa38cf2abe1cb9d916fd2685da","schema_version":"1.0","event_id":"sha256:653323eed23b646d296c2aebba0c57b7a8e989fa38cf2abe1cb9d916fd2685da"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:CSXQ7QRPIQDNHXBU5VVYFBLTZZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Maximum number of colourings. II. 5-chromatic graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bojan Mohar, Fiachra Knox","submitted_at":"2017-10-18T00:23:39Z","abstract_excerpt":"In 1971, Tomescu conjectured [Le nombre des graphes connexes $k$-chromatiques minimaux aux sommets \\'etiquet\\'es, C. R. Acad. Sci. Paris 273 (1971), 1124--1126] that every connected graph $G$ on $n$ vertices with $\\chi(G) = k \\geq 4$ has at most $k!(k-1)^{n-k}$ $k$-colourings, where equality holds if and only if the graph is formed from $K_k$ by repeatedly adding leaves. In this note we prove (a strengthening of) the conjecture of Tomescu when $k=5$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.06535","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-18T00:32:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"btuwFPG/pDnjuPJv4Gq24opiaXfCi0ITe8ftuKbbpmKCK5i9o032LJW92Y/OUtCa6YYx5gLVPaf4AioexOqdBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T15:57:39.545891Z"},"content_sha256":"0cf2684d985bbf6cd7ff56d7b2edacba4108d0d890a2a8addbeccd4e7b32e68e","schema_version":"1.0","event_id":"sha256:0cf2684d985bbf6cd7ff56d7b2edacba4108d0d890a2a8addbeccd4e7b32e68e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CSXQ7QRPIQDNHXBU5VVYFBLTZZ/bundle.json","state_url":"https://pith.science/pith/CSXQ7QRPIQDNHXBU5VVYFBLTZZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CSXQ7QRPIQDNHXBU5VVYFBLTZZ/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-05T15:57:39Z","links":{"resolver":"https://pith.science/pith/CSXQ7QRPIQDNHXBU5VVYFBLTZZ","bundle":"https://pith.science/pith/CSXQ7QRPIQDNHXBU5VVYFBLTZZ/bundle.json","state":"https://pith.science/pith/CSXQ7QRPIQDNHXBU5VVYFBLTZZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CSXQ7QRPIQDNHXBU5VVYFBLTZZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:CSXQ7QRPIQDNHXBU5VVYFBLTZZ","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":"ef00f59ac08d280e08c07d598ac044331902baf0dc1918544cdd26642ac47aea","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-10-18T00:23:39Z","title_canon_sha256":"bd89d564cb7d1ddf7333eee22c7a8b8b5fc3140e065cae1f53309cd8a404f7d9"},"schema_version":"1.0","source":{"id":"1710.06535","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.06535","created_at":"2026-05-18T00:32:33Z"},{"alias_kind":"arxiv_version","alias_value":"1710.06535v1","created_at":"2026-05-18T00:32:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.06535","created_at":"2026-05-18T00:32:33Z"},{"alias_kind":"pith_short_12","alias_value":"CSXQ7QRPIQDN","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"CSXQ7QRPIQDNHXBU","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"CSXQ7QRP","created_at":"2026-05-18T12:31:10Z"}],"graph_snapshots":[{"event_id":"sha256:0cf2684d985bbf6cd7ff56d7b2edacba4108d0d890a2a8addbeccd4e7b32e68e","target":"graph","created_at":"2026-05-18T00:32:33Z","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 [Le nombre des graphes connexes $k$-chromatiques minimaux aux sommets \\'etiquet\\'es, C. R. Acad. Sci. Paris 273 (1971), 1124--1126] that every connected graph $G$ on $n$ vertices with $\\chi(G) = k \\geq 4$ has at most $k!(k-1)^{n-k}$ $k$-colourings, where equality holds if and only if the graph is formed from $K_k$ by repeatedly adding leaves. In this note we prove (a strengthening of) the conjecture of Tomescu when $k=5$.","authors_text":"Bojan Mohar, Fiachra Knox","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-10-18T00:23:39Z","title":"Maximum number of colourings. II. 5-chromatic graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.06535","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:653323eed23b646d296c2aebba0c57b7a8e989fa38cf2abe1cb9d916fd2685da","target":"record","created_at":"2026-05-18T00:32:33Z","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":"ef00f59ac08d280e08c07d598ac044331902baf0dc1918544cdd26642ac47aea","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-10-18T00:23:39Z","title_canon_sha256":"bd89d564cb7d1ddf7333eee22c7a8b8b5fc3140e065cae1f53309cd8a404f7d9"},"schema_version":"1.0","source":{"id":"1710.06535","kind":"arxiv","version":1}},"canonical_sha256":"14af0fc22f4406d3dc34ed6b828573ce506ddd14bfa5800435bdbfcbd2318b3f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"14af0fc22f4406d3dc34ed6b828573ce506ddd14bfa5800435bdbfcbd2318b3f","first_computed_at":"2026-05-18T00:32:33.449766Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:32:33.449766Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xtNW1pWf5SfdXi92FNre5ytYOYkkr0UIRkoEaNL5k8IdcLIliv+N81cAtAwNnx+ftHGzJD9UgT8H8oqinWJzAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:32:33.450388Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.06535","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:653323eed23b646d296c2aebba0c57b7a8e989fa38cf2abe1cb9d916fd2685da","sha256:0cf2684d985bbf6cd7ff56d7b2edacba4108d0d890a2a8addbeccd4e7b32e68e"],"state_sha256":"39df216e3cc7c2bb3f3cc642b415e4d8e35fd94a06ae3f0d9235f34535e1ffed"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cpelPV7UW2pNXaMfM5E7zbQ9Z2rCCB/maRh6FhytvCwMdE++ToC3UHgvnRuLNj0EZhaTHxdEG1iYnyCXNMpoDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-05T15:57:39.549241Z","bundle_sha256":"c793dafa7284049490483a2e9a12631d88435654df04c2a06775da379f3ecdbc"}}