{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:LT433HT3FL4LTGTLYJMWM3ZTQ2","short_pith_number":"pith:LT433HT3","canonical_record":{"source":{"id":"1802.06953","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-02-20T03:52:39Z","cross_cats_sorted":[],"title_canon_sha256":"2a4b19f8a74777c48618a0c15e17d42cd5a11e074b49469d5ea08135cbf8b75c","abstract_canon_sha256":"b1b85baab0034ce04cc21fe5896ab595b1c73b30c477caeeb33c3f920b485777"},"schema_version":"1.0"},"canonical_sha256":"5cf9bd9e7b2af8b99a6bc259666f3386ad5b724a2037a4673a55aaf4392fab95","source":{"kind":"arxiv","id":"1802.06953","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.06953","created_at":"2026-05-18T00:12:43Z"},{"alias_kind":"arxiv_version","alias_value":"1802.06953v3","created_at":"2026-05-18T00:12:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.06953","created_at":"2026-05-18T00:12:43Z"},{"alias_kind":"pith_short_12","alias_value":"LT433HT3FL4L","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"LT433HT3FL4LTGTL","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"LT433HT3","created_at":"2026-05-18T12:32:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:LT433HT3FL4LTGTLYJMWM3ZTQ2","target":"record","payload":{"canonical_record":{"source":{"id":"1802.06953","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-02-20T03:52:39Z","cross_cats_sorted":[],"title_canon_sha256":"2a4b19f8a74777c48618a0c15e17d42cd5a11e074b49469d5ea08135cbf8b75c","abstract_canon_sha256":"b1b85baab0034ce04cc21fe5896ab595b1c73b30c477caeeb33c3f920b485777"},"schema_version":"1.0"},"canonical_sha256":"5cf9bd9e7b2af8b99a6bc259666f3386ad5b724a2037a4673a55aaf4392fab95","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:12:43.422062Z","signature_b64":"WS0H26t4wY8FbEidjf7ZjqlQLKqM+ZwZydWKsjA4/MYki4eSkHzbNmu7BVLBF1cXCdexNOQvo3WVKTROVIxYDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5cf9bd9e7b2af8b99a6bc259666f3386ad5b724a2037a4673a55aaf4392fab95","last_reissued_at":"2026-05-18T00:12:43.421485Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:12:43.421485Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.06953","source_version":3,"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:12:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PLFTVf9rFBcDpt31a8FYEl/on0fxhXgV5W/zOHiWwu6cPahp8tqcSxv4SKdS/F+4/q8QJBk3ZsSTsRXsVPnpDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T15:47:20.819537Z"},"content_sha256":"d8feaac36e46b7f40596266ae95b5fd35a681aa43760922dd99d13935e62e4b6","schema_version":"1.0","event_id":"sha256:d8feaac36e46b7f40596266ae95b5fd35a681aa43760922dd99d13935e62e4b6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:LT433HT3FL4LTGTLYJMWM3ZTQ2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distributed Symmetry Breaking in Sampling (Optimal Distributed Randomly Coloring with Fewer Colors)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Thomas P. Hayes, Weiming Feng, Yitong Yin","submitted_at":"2018-02-20T03:52:39Z","abstract_excerpt":"We examine the problem of almost-uniform sampling proper $q$-colorings of a graph whose maximum degree is $\\Delta$. A famous result, discovered independently by Jerrum(1995) and Salas and Sokal(1997), is that, assuming $q > (2+\\delta) \\Delta$, the Glauber dynamics (a.k.a. single-site dynamics) for this problem has mixing time $O(n \\log n)$, where $n$ is the number of vertices, and thus provides a nearly linear time sampling algorithm for this problem. A natural question is the extent to which this algorithm can be parallelized. Previous work Feng, Sun and Yin [PODC'17] has shown that a $O(\\Del"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.06953","kind":"arxiv","version":3},"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:12:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zAsDNHjQtqB+tlj8EjSUPp8EFcPt8z4/jSRjungd3mOJndv5lY7WMPTlgX8amclp76I+Xnaj3OBzbfgrruXSDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T15:47:20.820182Z"},"content_sha256":"68a89118f2722c6cd6195216a2f42c67cc021118fc909b17795e97913dfa35f0","schema_version":"1.0","event_id":"sha256:68a89118f2722c6cd6195216a2f42c67cc021118fc909b17795e97913dfa35f0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LT433HT3FL4LTGTLYJMWM3ZTQ2/bundle.json","state_url":"https://pith.science/pith/LT433HT3FL4LTGTLYJMWM3ZTQ2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LT433HT3FL4LTGTLYJMWM3ZTQ2/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-05-28T15:47:20Z","links":{"resolver":"https://pith.science/pith/LT433HT3FL4LTGTLYJMWM3ZTQ2","bundle":"https://pith.science/pith/LT433HT3FL4LTGTLYJMWM3ZTQ2/bundle.json","state":"https://pith.science/pith/LT433HT3FL4LTGTLYJMWM3ZTQ2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LT433HT3FL4LTGTLYJMWM3ZTQ2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:LT433HT3FL4LTGTLYJMWM3ZTQ2","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":"b1b85baab0034ce04cc21fe5896ab595b1c73b30c477caeeb33c3f920b485777","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-02-20T03:52:39Z","title_canon_sha256":"2a4b19f8a74777c48618a0c15e17d42cd5a11e074b49469d5ea08135cbf8b75c"},"schema_version":"1.0","source":{"id":"1802.06953","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.06953","created_at":"2026-05-18T00:12:43Z"},{"alias_kind":"arxiv_version","alias_value":"1802.06953v3","created_at":"2026-05-18T00:12:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.06953","created_at":"2026-05-18T00:12:43Z"},{"alias_kind":"pith_short_12","alias_value":"LT433HT3FL4L","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"LT433HT3FL4LTGTL","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"LT433HT3","created_at":"2026-05-18T12:32:37Z"}],"graph_snapshots":[{"event_id":"sha256:68a89118f2722c6cd6195216a2f42c67cc021118fc909b17795e97913dfa35f0","target":"graph","created_at":"2026-05-18T00:12: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"},"paper":{"abstract_excerpt":"We examine the problem of almost-uniform sampling proper $q$-colorings of a graph whose maximum degree is $\\Delta$. A famous result, discovered independently by Jerrum(1995) and Salas and Sokal(1997), is that, assuming $q > (2+\\delta) \\Delta$, the Glauber dynamics (a.k.a. single-site dynamics) for this problem has mixing time $O(n \\log n)$, where $n$ is the number of vertices, and thus provides a nearly linear time sampling algorithm for this problem. A natural question is the extent to which this algorithm can be parallelized. Previous work Feng, Sun and Yin [PODC'17] has shown that a $O(\\Del","authors_text":"Thomas P. Hayes, Weiming Feng, Yitong Yin","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-02-20T03:52:39Z","title":"Distributed Symmetry Breaking in Sampling (Optimal Distributed Randomly Coloring with Fewer Colors)"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.06953","kind":"arxiv","version":3},"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:d8feaac36e46b7f40596266ae95b5fd35a681aa43760922dd99d13935e62e4b6","target":"record","created_at":"2026-05-18T00:12: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":"b1b85baab0034ce04cc21fe5896ab595b1c73b30c477caeeb33c3f920b485777","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-02-20T03:52:39Z","title_canon_sha256":"2a4b19f8a74777c48618a0c15e17d42cd5a11e074b49469d5ea08135cbf8b75c"},"schema_version":"1.0","source":{"id":"1802.06953","kind":"arxiv","version":3}},"canonical_sha256":"5cf9bd9e7b2af8b99a6bc259666f3386ad5b724a2037a4673a55aaf4392fab95","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5cf9bd9e7b2af8b99a6bc259666f3386ad5b724a2037a4673a55aaf4392fab95","first_computed_at":"2026-05-18T00:12:43.421485Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:12:43.421485Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WS0H26t4wY8FbEidjf7ZjqlQLKqM+ZwZydWKsjA4/MYki4eSkHzbNmu7BVLBF1cXCdexNOQvo3WVKTROVIxYDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:12:43.422062Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.06953","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d8feaac36e46b7f40596266ae95b5fd35a681aa43760922dd99d13935e62e4b6","sha256:68a89118f2722c6cd6195216a2f42c67cc021118fc909b17795e97913dfa35f0"],"state_sha256":"686a24702d694836515dcbf6c9f05dde27fbadb7656c0d2089daa54670d49e66"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gjl/ZwPi19pj4LRkZ0S5zWzkqjSk+Qk/y3T/fR9HZWblevCWtQsczmddmm6Hgg9VTxv2odo9UpMSC7D4NynCDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T15:47:20.823575Z","bundle_sha256":"7307bb4bb4057970d91c104455556edc1532520402e99f8c6287b3218860a432"}}