{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:RP6X6X2DT6OG4DQ62HACGEZU4Y","short_pith_number":"pith:RP6X6X2D","canonical_record":{"source":{"id":"1708.01781","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-08-05T15:25:27Z","cross_cats_sorted":[],"title_canon_sha256":"70091755dbc378df8da810d0a4bd1517c598f6c808ee8f399fee6b3ab1b027f7","abstract_canon_sha256":"eb2de16792bae5183c85dda3fda7bbe96d540173ea6dd14dfa3ca978db32a573"},"schema_version":"1.0"},"canonical_sha256":"8bfd7f5f439f9c6e0e1ed1c0231334e6384c1cf92e2a9ccaa174dad6dfd8ffb6","source":{"kind":"arxiv","id":"1708.01781","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.01781","created_at":"2026-05-18T00:38:33Z"},{"alias_kind":"arxiv_version","alias_value":"1708.01781v1","created_at":"2026-05-18T00:38:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.01781","created_at":"2026-05-18T00:38:33Z"},{"alias_kind":"pith_short_12","alias_value":"RP6X6X2DT6OG","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"RP6X6X2DT6OG4DQ6","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"RP6X6X2D","created_at":"2026-05-18T12:31:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:RP6X6X2DT6OG4DQ62HACGEZU4Y","target":"record","payload":{"canonical_record":{"source":{"id":"1708.01781","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-08-05T15:25:27Z","cross_cats_sorted":[],"title_canon_sha256":"70091755dbc378df8da810d0a4bd1517c598f6c808ee8f399fee6b3ab1b027f7","abstract_canon_sha256":"eb2de16792bae5183c85dda3fda7bbe96d540173ea6dd14dfa3ca978db32a573"},"schema_version":"1.0"},"canonical_sha256":"8bfd7f5f439f9c6e0e1ed1c0231334e6384c1cf92e2a9ccaa174dad6dfd8ffb6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:38:33.170563Z","signature_b64":"ViMA3feFrE1JO07wozMifmDGNyUPJoL1Tq8uN0n3rHvddojzPBwBXmazLPgUheh+NESnYKq3/Fwj2YfD8ANdBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8bfd7f5f439f9c6e0e1ed1c0231334e6384c1cf92e2a9ccaa174dad6dfd8ffb6","last_reissued_at":"2026-05-18T00:38:33.170058Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:38:33.170058Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1708.01781","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:38:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r+nyqPQ22aIKs+lkWwRBk69tq1uwS7/LpKEHsqfnjtmXWmPx4444U6xDWvDAabruj5sVgq018frI4uCXjKPQDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T05:08:03.186551Z"},"content_sha256":"f0ab18e8016bfc19ac8b79227242edd21339348de9164ebc609a79b2d5665335","schema_version":"1.0","event_id":"sha256:f0ab18e8016bfc19ac8b79227242edd21339348de9164ebc609a79b2d5665335"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:RP6X6X2DT6OG4DQ62HACGEZU4Y","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Maximum number of colourings. I. 4-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-08-05T15:25:27Z","abstract_excerpt":"It is proved that every connected graph $G$ on $n$ vertices with $\\chi(G) \\geq 4$ has at most $k(k-1)^{n-3}(k-2)(k-3)$ $k$-colourings for every $k \\geq 4$. Equality holds for some (and then for every) $k$ if and only if the graph is formed from $K_4$ by repeatedly adding leaves. This confirms (a strengthening of) the $4$-chromatic case of a long-standing conjecture of Tomescu [Le nombre des graphes connexes $k$-chromatiques minimaux aux sommets etiquetes, C. R. Acad. Sci. Paris 273 (1971), 1124-1126]. Proof methods may be of independent interest. In particular, one of our auxiliary results abo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.01781","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:38:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AN9JQrednDKez35XrX2oe4/b1kKiv8qxpiEdyXN8mLYQExK9TF+AJtdLiowtzwbxx7MbWHK0gtF9e+AprlKJAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T05:08:03.186885Z"},"content_sha256":"ada81e8683dcadb67dbb147316cf1f98c50e45711c6446aeaf15f9f59ab9caf0","schema_version":"1.0","event_id":"sha256:ada81e8683dcadb67dbb147316cf1f98c50e45711c6446aeaf15f9f59ab9caf0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RP6X6X2DT6OG4DQ62HACGEZU4Y/bundle.json","state_url":"https://pith.science/pith/RP6X6X2DT6OG4DQ62HACGEZU4Y/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RP6X6X2DT6OG4DQ62HACGEZU4Y/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-05T05:08:03Z","links":{"resolver":"https://pith.science/pith/RP6X6X2DT6OG4DQ62HACGEZU4Y","bundle":"https://pith.science/pith/RP6X6X2DT6OG4DQ62HACGEZU4Y/bundle.json","state":"https://pith.science/pith/RP6X6X2DT6OG4DQ62HACGEZU4Y/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RP6X6X2DT6OG4DQ62HACGEZU4Y/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:RP6X6X2DT6OG4DQ62HACGEZU4Y","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":"eb2de16792bae5183c85dda3fda7bbe96d540173ea6dd14dfa3ca978db32a573","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-08-05T15:25:27Z","title_canon_sha256":"70091755dbc378df8da810d0a4bd1517c598f6c808ee8f399fee6b3ab1b027f7"},"schema_version":"1.0","source":{"id":"1708.01781","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.01781","created_at":"2026-05-18T00:38:33Z"},{"alias_kind":"arxiv_version","alias_value":"1708.01781v1","created_at":"2026-05-18T00:38:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.01781","created_at":"2026-05-18T00:38:33Z"},{"alias_kind":"pith_short_12","alias_value":"RP6X6X2DT6OG","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"RP6X6X2DT6OG4DQ6","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"RP6X6X2D","created_at":"2026-05-18T12:31:39Z"}],"graph_snapshots":[{"event_id":"sha256:ada81e8683dcadb67dbb147316cf1f98c50e45711c6446aeaf15f9f59ab9caf0","target":"graph","created_at":"2026-05-18T00:38: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":"It is proved that every connected graph $G$ on $n$ vertices with $\\chi(G) \\geq 4$ has at most $k(k-1)^{n-3}(k-2)(k-3)$ $k$-colourings for every $k \\geq 4$. Equality holds for some (and then for every) $k$ if and only if the graph is formed from $K_4$ by repeatedly adding leaves. This confirms (a strengthening of) the $4$-chromatic case of a long-standing conjecture of Tomescu [Le nombre des graphes connexes $k$-chromatiques minimaux aux sommets etiquetes, C. R. Acad. Sci. Paris 273 (1971), 1124-1126]. Proof methods may be of independent interest. In particular, one of our auxiliary results abo","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-08-05T15:25:27Z","title":"Maximum number of colourings. I. 4-chromatic graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.01781","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:f0ab18e8016bfc19ac8b79227242edd21339348de9164ebc609a79b2d5665335","target":"record","created_at":"2026-05-18T00:38: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":"eb2de16792bae5183c85dda3fda7bbe96d540173ea6dd14dfa3ca978db32a573","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-08-05T15:25:27Z","title_canon_sha256":"70091755dbc378df8da810d0a4bd1517c598f6c808ee8f399fee6b3ab1b027f7"},"schema_version":"1.0","source":{"id":"1708.01781","kind":"arxiv","version":1}},"canonical_sha256":"8bfd7f5f439f9c6e0e1ed1c0231334e6384c1cf92e2a9ccaa174dad6dfd8ffb6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8bfd7f5f439f9c6e0e1ed1c0231334e6384c1cf92e2a9ccaa174dad6dfd8ffb6","first_computed_at":"2026-05-18T00:38:33.170058Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:38:33.170058Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ViMA3feFrE1JO07wozMifmDGNyUPJoL1Tq8uN0n3rHvddojzPBwBXmazLPgUheh+NESnYKq3/Fwj2YfD8ANdBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:38:33.170563Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.01781","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f0ab18e8016bfc19ac8b79227242edd21339348de9164ebc609a79b2d5665335","sha256:ada81e8683dcadb67dbb147316cf1f98c50e45711c6446aeaf15f9f59ab9caf0"],"state_sha256":"d3e8ceaa20615c0c867d8ee78705654b0d2ca551db7953a276c1ac2d2cd76e4a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"61gaKzeEsfemZydnP9tkKswLV+KZU3gl6vWXzwBZo3Lv+a8RahIKckW6DUk4axLANdZq+wQH8k6lVDd6iDJpAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-05T05:08:03.188779Z","bundle_sha256":"d481ea710c04a29f785186dcd7cc60feead7960c5fa310de2f3aa596454f3685"}}