{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:NEFGXKOS4YI4HV2UNBYK5Y6LCA","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":"0b9d8a3724c274b2a1aee523195428a4b250fe6a8bba4e6f697a1bdec1981082","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-09-29T14:48:57Z","title_canon_sha256":"66bf466fe68a5f11ccd45bed135609bd2acc256a81709b9a9acc77545c4f7034"},"schema_version":"1.0","source":{"id":"2309.17291","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2309.17291","created_at":"2026-07-05T06:55:43Z"},{"alias_kind":"arxiv_version","alias_value":"2309.17291v1","created_at":"2026-07-05T06:55:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2309.17291","created_at":"2026-07-05T06:55:43Z"},{"alias_kind":"pith_short_12","alias_value":"NEFGXKOS4YI4","created_at":"2026-07-05T06:55:43Z"},{"alias_kind":"pith_short_16","alias_value":"NEFGXKOS4YI4HV2U","created_at":"2026-07-05T06:55:43Z"},{"alias_kind":"pith_short_8","alias_value":"NEFGXKOS","created_at":"2026-07-05T06:55:43Z"}],"graph_snapshots":[{"event_id":"sha256:d5c58ba609fc0f05088d2a7dc8f229ac8254db6bddad4b5d13cf5a2592118d31","target":"graph","created_at":"2026-07-05T06:55:43Z","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/2309.17291/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We show that there exists a constant $c > 0$ such that if $G$ is a planar graph with 5-correspondence assignment $(L,M)$, then $G$ has at least $2^{c\\cdot v(G)}$ distinct $(L,M)$-colourings. This confirms a conjecture of Langhede and Thomassen. More broadly, we introduce a general method showing how hyperbolicity theorems for certain families of critical graphs can be used to derive lower bounds on the number of colourings of the associated class of planar graphs. Hence our main result follows from this method plus a technical theorem (that we proved in a previous paper) involving the hyperbol","authors_text":"Evelyne Smith-Roberge, Luke Postle","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-09-29T14:48:57Z","title":"Exponentially Many Correspondence Colourings of Planar and Locally Planar Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2309.17291","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:fb959c7f07a9338890f6ffecb26e2fbaccdb4e4e86397f1da65731294dfed6ef","target":"record","created_at":"2026-07-05T06:55:43Z","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":"0b9d8a3724c274b2a1aee523195428a4b250fe6a8bba4e6f697a1bdec1981082","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-09-29T14:48:57Z","title_canon_sha256":"66bf466fe68a5f11ccd45bed135609bd2acc256a81709b9a9acc77545c4f7034"},"schema_version":"1.0","source":{"id":"2309.17291","kind":"arxiv","version":1}},"canonical_sha256":"690a6ba9d2e611c3d7546870aee3cb1034ae8fa4379477eb38c6f577d0e22957","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"690a6ba9d2e611c3d7546870aee3cb1034ae8fa4379477eb38c6f577d0e22957","first_computed_at":"2026-07-05T06:55:43.485652Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:55:43.485652Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nSHttiw3V52DRfgln8Ntd7A3zf25dCgL6BWTvi/gLbD7yU5p3rq8eT8VEFnvxp89ZtOBH1l+oaYO/Qh8Rf0SDg==","signature_status":"signed_v1","signed_at":"2026-07-05T06:55:43.486113Z","signed_message":"canonical_sha256_bytes"},"source_id":"2309.17291","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fb959c7f07a9338890f6ffecb26e2fbaccdb4e4e86397f1da65731294dfed6ef","sha256:d5c58ba609fc0f05088d2a7dc8f229ac8254db6bddad4b5d13cf5a2592118d31"],"state_sha256":"fbae6e9765dcd0f0478300e6de5b25f88f5755400ad24d2b79b427193ef2a438"}