{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2007:ZQMULKREODUNLVPTV5YPHY77JH","short_pith_number":"pith:ZQMULKRE","schema_version":"1.0","canonical_sha256":"cc1945aa2470e8d5d5f3af70f3e3ff49ec5daacec10eee02891a74913f2253db","source":{"kind":"arxiv","id":"0706.1530","version":2},"attestation_state":"computed","paper":{"title":"Randomly coloring planar graphs with fewer colors than the maximum degree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"Eric Vigoda, Juan C. Vera, Thomas P. Hayes","submitted_at":"2007-06-11T17:55:42Z","abstract_excerpt":"We study Markov chains for randomly sampling $k$-colorings of a graph with maximum degree $\\Delta$. Our main result is a polynomial upper bound on the mixing time of the single-site update chain known as the Glauber dynamics for planar graphs when $k=\\Omega(\\Delta/\\log{\\Delta})$. Our results can be partially extended to the more general case where the maximum eigenvalue of the adjacency matrix of the graph is at most $\\Delta^{1-\\eps}$, for fixed $\\eps > 0$.\n  The main challenge when $k \\le \\Delta + 1$ is the possibility of \"frozen\" vertices, that is, vertices for which only one color is possib"},"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":"0706.1530","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2007-06-11T17:55:42Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"7328689124801f5151791e3da478212c028590dd54068512eae16856ae39e57d","abstract_canon_sha256":"b2d62e4e347eda977dbfa7c79e98e32af874130d9255804b62eac058b9d22b95"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:14:27.731749Z","signature_b64":"UOLL8unnvbm1Owv36rMGKIeXruZFy0f6ZAjm6i3IjjVLp/nM4XeDEEuOyxoGJgEUYAqT8xuZcg5PpM8OEdRTDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cc1945aa2470e8d5d5f3af70f3e3ff49ec5daacec10eee02891a74913f2253db","last_reissued_at":"2026-05-18T04:14:27.731116Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:14:27.731116Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Randomly coloring planar graphs with fewer colors than the maximum degree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"Eric Vigoda, Juan C. Vera, Thomas P. Hayes","submitted_at":"2007-06-11T17:55:42Z","abstract_excerpt":"We study Markov chains for randomly sampling $k$-colorings of a graph with maximum degree $\\Delta$. Our main result is a polynomial upper bound on the mixing time of the single-site update chain known as the Glauber dynamics for planar graphs when $k=\\Omega(\\Delta/\\log{\\Delta})$. Our results can be partially extended to the more general case where the maximum eigenvalue of the adjacency matrix of the graph is at most $\\Delta^{1-\\eps}$, for fixed $\\eps > 0$.\n  The main challenge when $k \\le \\Delta + 1$ is the possibility of \"frozen\" vertices, that is, vertices for which only one color is possib"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0706.1530","kind":"arxiv","version":2},"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":"0706.1530","created_at":"2026-05-18T04:14:27.731206+00:00"},{"alias_kind":"arxiv_version","alias_value":"0706.1530v2","created_at":"2026-05-18T04:14:27.731206+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0706.1530","created_at":"2026-05-18T04:14:27.731206+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZQMULKREODUN","created_at":"2026-05-18T12:25:56.245647+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZQMULKREODUNLVPT","created_at":"2026-05-18T12:25:56.245647+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZQMULKRE","created_at":"2026-05-18T12:25:56.245647+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/ZQMULKREODUNLVPTV5YPHY77JH","json":"https://pith.science/pith/ZQMULKREODUNLVPTV5YPHY77JH.json","graph_json":"https://pith.science/api/pith-number/ZQMULKREODUNLVPTV5YPHY77JH/graph.json","events_json":"https://pith.science/api/pith-number/ZQMULKREODUNLVPTV5YPHY77JH/events.json","paper":"https://pith.science/paper/ZQMULKRE"},"agent_actions":{"view_html":"https://pith.science/pith/ZQMULKREODUNLVPTV5YPHY77JH","download_json":"https://pith.science/pith/ZQMULKREODUNLVPTV5YPHY77JH.json","view_paper":"https://pith.science/paper/ZQMULKRE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0706.1530&json=true","fetch_graph":"https://pith.science/api/pith-number/ZQMULKREODUNLVPTV5YPHY77JH/graph.json","fetch_events":"https://pith.science/api/pith-number/ZQMULKREODUNLVPTV5YPHY77JH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZQMULKREODUNLVPTV5YPHY77JH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZQMULKREODUNLVPTV5YPHY77JH/action/storage_attestation","attest_author":"https://pith.science/pith/ZQMULKREODUNLVPTV5YPHY77JH/action/author_attestation","sign_citation":"https://pith.science/pith/ZQMULKREODUNLVPTV5YPHY77JH/action/citation_signature","submit_replication":"https://pith.science/pith/ZQMULKREODUNLVPTV5YPHY77JH/action/replication_record"}},"created_at":"2026-05-18T04:14:27.731206+00:00","updated_at":"2026-05-18T04:14:27.731206+00:00"}