{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:35:37Z","timestamp":1750307737541,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":23,"publisher":"ACM","license":[{"start":{"date-parts":[[2009,5,31]],"date-time":"2009-05-31T00:00:00Z","timestamp":1243728000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2009,5,31]]},"DOI":"10.1145\/1536414.1536493","type":"proceedings-article","created":{"date-parts":[[2009,6,2]],"date-time":"2009-06-02T14:51:13Z","timestamp":1243954273000},"page":"581-590","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":13,"title":["Reconstruction for the Potts model"],"prefix":"10.1145","author":[{"given":"Allan","family":"Sly","sequence":"first","affiliation":[{"name":"University of California, Berkeley, Berkeley, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2009,5,31]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"crossref","unstructured":"Dimitris Achlioptas and Amin Coja-Oghlan. Algorithmic barriers from phase transition. http:\/\/front.math.ucdavis.edu\/0803.2122 2008.  Dimitris Achlioptas and Amin Coja-Oghlan. Algorithmic barriers from phase transition. http:\/\/front.math.ucdavis.edu\/0803.2122 2008.","DOI":"10.1109\/FOCS.2008.11"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00440-004-0369-4"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02179399"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2006.76"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01210926"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1132516.1132540"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2004.57"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1214\/aoap\/1019487349"},{"key":"e_1_3_2_1_9_1","unstructured":"M. Formentin and C Kuelske. On the purity of the free boundary condition potts measure on random trees. http:\/\/arxiv.org\/abs\/0810.0677 2008.  M. Formentin and C Kuelske. On the purity of the free boundary condition potts measure on random trees. http:\/\/arxiv.org\/abs\/0810.0677 2008."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2007.58"},{"key":"e_1_3_2_1_11_1","first-page":"37","article-title":"Additional limit theorems for indecomposable multidimensional Galton-Watson processes","author":"Kesten H.","year":"1966","journal-title":"Ann. Math. Statist."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0703685104"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.v31:2"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10955-006-9162-3"},{"key":"e_1_3_2_1_15_1","unstructured":"A. Montanari R. Restrepo and P. Tetali. Reconstruction and clustering in random constraint satisfaction problems. 2009.  A. Montanari R. Restrepo and P. Tetali. Reconstruction and clustering in random constraint satisfaction problems. 2009."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1214\/aoap\/998926994"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9947-03-03382-8"},{"key":"e_1_3_2_1_18_1","series-title":"DIMACS Ser","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1090\/dimacs\/063\/12","volume-title":"Graphs, morphisms and statistical physics","author":"Mossel Elchanan","year":"2004"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1214\/aoap\/1060202828"},{"key":"e_1_3_2_1_20_1","unstructured":"Elchanan Mossel and Allan Sly. Gibbs rapidly samples colorings of g(n d\/n). http:\/\/arxiv.org\/abs\/0707.3241 2007.  Elchanan Mossel and Allan Sly. Gibbs rapidly samples colorings of g(n d\/n). http:\/\/arxiv.org\/abs\/0707.3241 2007."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10955-007-9417-7"},{"key":"e_1_3_2_1_22_1","unstructured":"Allan Sly. Reconstruction of random colourings. http:\/\/front.math.ucdavis.edu\/0802.3487 2008.  Allan Sly. Reconstruction of random colourings. http:\/\/front.math.ucdavis.edu\/0802.3487 2008."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.76.031131"}],"event":{"name":"STOC '09: Symposium on Theory of Computing","sponsor":["ACM Association for Computing Machinery","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Bethesda MD USA","acronym":"STOC '09"},"container-title":["Proceedings of the forty-first annual ACM symposium on Theory of computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1536414.1536493","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1536414.1536493","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:38:51Z","timestamp":1750253931000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1536414.1536493"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,5,31]]},"references-count":23,"alternative-id":["10.1145\/1536414.1536493","10.1145\/1536414"],"URL":"https:\/\/doi.org\/10.1145\/1536414.1536493","relation":{},"subject":[],"published":{"date-parts":[[2009,5,31]]},"assertion":[{"value":"2009-05-31","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}