{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2003:IPCMIEPSX2EOIKMZXPQGACP3HG","short_pith_number":"pith:IPCMIEPS","schema_version":"1.0","canonical_sha256":"43c4c411f2be88e42999bbe06009fb39a1a3c1238b1b1879572ad032c6064568","source":{"kind":"arxiv","id":"math/0308284","version":3},"attestation_state":"computed","paper":{"title":"Glauber Dynamics on Trees and Hyperbolic Graphs","license":"","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Claire Kenyon, Elchanan Mossel, Noam Berger, Yuval Peres","submitted_at":"2003-08-28T20:13:52Z","abstract_excerpt":"We study continuous time Glauber dynamics for random configurations with local constraints (e.g. proper coloring, Ising and Potts models) on finite graphs with $n$ vertices and of bounded degree. We show that the relaxation time\n (defined as the reciprocal of the spectral gap $|\\lambda_1-\\lambda_2|$) for the dynamics on trees and on planar hyperbolic graphs, is polynomial in $n$. For these hyperbolic graphs, this yields a general polynomial sampling algorithm for random configurations. We then show that if the relaxation time $\\tau_2$ satisfies $\\tau_2=O(1)$, then the correlation coefficient, "},"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":"math/0308284","kind":"arxiv","version":3},"metadata":{"license":"","primary_cat":"math.PR","submitted_at":"2003-08-28T20:13:52Z","cross_cats_sorted":[],"title_canon_sha256":"0c72dc284e943c67e00efe05f8b2b85fa1b1686875b96d8267c3ba8d549bf6f5","abstract_canon_sha256":"38556683b18202b12cfff9a1649b8094106a9b5a8ad3316bad3cbb782c5f1547"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:05:28.681428Z","signature_b64":"0O2NGABBZ4JWvcB/VRaZS90L0X5Vtbwx3/luaRh2fmVLPzm20w2RGl++AYbfOndJt/LNkjowpD/BUDn+FjxQDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"43c4c411f2be88e42999bbe06009fb39a1a3c1238b1b1879572ad032c6064568","last_reissued_at":"2026-05-18T01:05:28.680408Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:05:28.680408Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Glauber Dynamics on Trees and Hyperbolic Graphs","license":"","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Claire Kenyon, Elchanan Mossel, Noam Berger, Yuval Peres","submitted_at":"2003-08-28T20:13:52Z","abstract_excerpt":"We study continuous time Glauber dynamics for random configurations with local constraints (e.g. proper coloring, Ising and Potts models) on finite graphs with $n$ vertices and of bounded degree. We show that the relaxation time\n (defined as the reciprocal of the spectral gap $|\\lambda_1-\\lambda_2|$) for the dynamics on trees and on planar hyperbolic graphs, is polynomial in $n$. For these hyperbolic graphs, this yields a general polynomial sampling algorithm for random configurations. We then show that if the relaxation time $\\tau_2$ satisfies $\\tau_2=O(1)$, then the correlation coefficient, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0308284","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"math/0308284","created_at":"2026-05-18T01:05:28.680518+00:00"},{"alias_kind":"arxiv_version","alias_value":"math/0308284v3","created_at":"2026-05-18T01:05:28.680518+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0308284","created_at":"2026-05-18T01:05:28.680518+00:00"},{"alias_kind":"pith_short_12","alias_value":"IPCMIEPSX2EO","created_at":"2026-05-18T12:25:52.051335+00:00"},{"alias_kind":"pith_short_16","alias_value":"IPCMIEPSX2EOIKMZ","created_at":"2026-05-18T12:25:52.051335+00:00"},{"alias_kind":"pith_short_8","alias_value":"IPCMIEPS","created_at":"2026-05-18T12:25:52.051335+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/IPCMIEPSX2EOIKMZXPQGACP3HG","json":"https://pith.science/pith/IPCMIEPSX2EOIKMZXPQGACP3HG.json","graph_json":"https://pith.science/api/pith-number/IPCMIEPSX2EOIKMZXPQGACP3HG/graph.json","events_json":"https://pith.science/api/pith-number/IPCMIEPSX2EOIKMZXPQGACP3HG/events.json","paper":"https://pith.science/paper/IPCMIEPS"},"agent_actions":{"view_html":"https://pith.science/pith/IPCMIEPSX2EOIKMZXPQGACP3HG","download_json":"https://pith.science/pith/IPCMIEPSX2EOIKMZXPQGACP3HG.json","view_paper":"https://pith.science/paper/IPCMIEPS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=math/0308284&json=true","fetch_graph":"https://pith.science/api/pith-number/IPCMIEPSX2EOIKMZXPQGACP3HG/graph.json","fetch_events":"https://pith.science/api/pith-number/IPCMIEPSX2EOIKMZXPQGACP3HG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IPCMIEPSX2EOIKMZXPQGACP3HG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IPCMIEPSX2EOIKMZXPQGACP3HG/action/storage_attestation","attest_author":"https://pith.science/pith/IPCMIEPSX2EOIKMZXPQGACP3HG/action/author_attestation","sign_citation":"https://pith.science/pith/IPCMIEPSX2EOIKMZXPQGACP3HG/action/citation_signature","submit_replication":"https://pith.science/pith/IPCMIEPSX2EOIKMZXPQGACP3HG/action/replication_record"}},"created_at":"2026-05-18T01:05:28.680518+00:00","updated_at":"2026-05-18T01:05:28.680518+00:00"}