{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2007:ZQMULKREODUNLVPTV5YPHY77JH","short_pith_number":"pith:ZQMULKRE","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"},"canonical_sha256":"cc1945aa2470e8d5d5f3af70f3e3ff49ec5daacec10eee02891a74913f2253db","source":{"kind":"arxiv","id":"0706.1530","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0706.1530","created_at":"2026-05-18T04:14:27Z"},{"alias_kind":"arxiv_version","alias_value":"0706.1530v2","created_at":"2026-05-18T04:14:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0706.1530","created_at":"2026-05-18T04:14:27Z"},{"alias_kind":"pith_short_12","alias_value":"ZQMULKREODUN","created_at":"2026-05-18T12:25:56Z"},{"alias_kind":"pith_short_16","alias_value":"ZQMULKREODUNLVPT","created_at":"2026-05-18T12:25:56Z"},{"alias_kind":"pith_short_8","alias_value":"ZQMULKRE","created_at":"2026-05-18T12:25:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2007:ZQMULKREODUNLVPTV5YPHY77JH","target":"record","payload":{"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"},"canonical_sha256":"cc1945aa2470e8d5d5f3af70f3e3ff49ec5daacec10eee02891a74913f2253db","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"},"source_kind":"arxiv","source_id":"0706.1530","source_version":2,"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-18T04:14:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/Avok2k5/COaml6YdUU5s7xJGb46Erm7Rf5fFql09hZyMLl2CKbKr4bxNO6MHfrR6tCA5qdKfaUm0j/cFcagDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T05:26:07.348164Z"},"content_sha256":"e1730ae2de1af37d0f8f0f12634836409b186329cc047e0b9768ab0ee2a6a4ea","schema_version":"1.0","event_id":"sha256:e1730ae2de1af37d0f8f0f12634836409b186329cc047e0b9768ab0ee2a6a4ea"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2007:ZQMULKREODUNLVPTV5YPHY77JH","target":"graph","payload":{"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"},"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-18T04:14:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G9L9dUs4OY0mLHTx4RHpqutmZQhRRAPRNoWqVJnGbcUXaNAAXmnk4hz1MBYMYplaAGvch6dU5/gWI1smQFBoAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T05:26:07.348891Z"},"content_sha256":"3b0ec984522205a57ff726366f43eadac08b2f127902e162208711419ff77c62","schema_version":"1.0","event_id":"sha256:3b0ec984522205a57ff726366f43eadac08b2f127902e162208711419ff77c62"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZQMULKREODUNLVPTV5YPHY77JH/bundle.json","state_url":"https://pith.science/pith/ZQMULKREODUNLVPTV5YPHY77JH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZQMULKREODUNLVPTV5YPHY77JH/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-06-09T05:26:07Z","links":{"resolver":"https://pith.science/pith/ZQMULKREODUNLVPTV5YPHY77JH","bundle":"https://pith.science/pith/ZQMULKREODUNLVPTV5YPHY77JH/bundle.json","state":"https://pith.science/pith/ZQMULKREODUNLVPTV5YPHY77JH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZQMULKREODUNLVPTV5YPHY77JH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2007:ZQMULKREODUNLVPTV5YPHY77JH","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":"b2d62e4e347eda977dbfa7c79e98e32af874130d9255804b62eac058b9d22b95","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2007-06-11T17:55:42Z","title_canon_sha256":"7328689124801f5151791e3da478212c028590dd54068512eae16856ae39e57d"},"schema_version":"1.0","source":{"id":"0706.1530","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0706.1530","created_at":"2026-05-18T04:14:27Z"},{"alias_kind":"arxiv_version","alias_value":"0706.1530v2","created_at":"2026-05-18T04:14:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0706.1530","created_at":"2026-05-18T04:14:27Z"},{"alias_kind":"pith_short_12","alias_value":"ZQMULKREODUN","created_at":"2026-05-18T12:25:56Z"},{"alias_kind":"pith_short_16","alias_value":"ZQMULKREODUNLVPT","created_at":"2026-05-18T12:25:56Z"},{"alias_kind":"pith_short_8","alias_value":"ZQMULKRE","created_at":"2026-05-18T12:25:56Z"}],"graph_snapshots":[{"event_id":"sha256:3b0ec984522205a57ff726366f43eadac08b2f127902e162208711419ff77c62","target":"graph","created_at":"2026-05-18T04:14:27Z","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":"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","authors_text":"Eric Vigoda, Juan C. Vera, Thomas P. Hayes","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2007-06-11T17:55:42Z","title":"Randomly coloring planar graphs with fewer colors than the maximum degree"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0706.1530","kind":"arxiv","version":2},"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:e1730ae2de1af37d0f8f0f12634836409b186329cc047e0b9768ab0ee2a6a4ea","target":"record","created_at":"2026-05-18T04:14:27Z","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":"b2d62e4e347eda977dbfa7c79e98e32af874130d9255804b62eac058b9d22b95","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2007-06-11T17:55:42Z","title_canon_sha256":"7328689124801f5151791e3da478212c028590dd54068512eae16856ae39e57d"},"schema_version":"1.0","source":{"id":"0706.1530","kind":"arxiv","version":2}},"canonical_sha256":"cc1945aa2470e8d5d5f3af70f3e3ff49ec5daacec10eee02891a74913f2253db","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cc1945aa2470e8d5d5f3af70f3e3ff49ec5daacec10eee02891a74913f2253db","first_computed_at":"2026-05-18T04:14:27.731116Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:14:27.731116Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UOLL8unnvbm1Owv36rMGKIeXruZFy0f6ZAjm6i3IjjVLp/nM4XeDEEuOyxoGJgEUYAqT8xuZcg5PpM8OEdRTDg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:14:27.731749Z","signed_message":"canonical_sha256_bytes"},"source_id":"0706.1530","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e1730ae2de1af37d0f8f0f12634836409b186329cc047e0b9768ab0ee2a6a4ea","sha256:3b0ec984522205a57ff726366f43eadac08b2f127902e162208711419ff77c62"],"state_sha256":"3dc434464b3e6dda65acf39cbc6f36343562a390eabbd3c20e9fa851bff1b6ce"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"inBbss1kPaFk4OrZmTQlRh7qcYMpWhIyozKXTkP+sizDp6VJH6bZmgfeJrav0+RUuIdK7B2LiJx4/CgeOqI0Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T05:26:07.352845Z","bundle_sha256":"ab607cd040448e6c0e8a422617c683eb593d1777ac9e62b55d8e326e39e04109"}}