{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,13]],"date-time":"2026-07-13T19:56:12Z","timestamp":1783972572189,"version":"3.55.0"},"publisher-location":"New York, NY, USA","reference-count":23,"publisher":"ACM","license":[{"start":{"date-parts":[[2006,5,21]],"date-time":"2006-05-21T00:00:00Z","timestamp":1148169600000},"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":[[2006,5,21]]},"DOI":"10.1145\/1132516.1132537","type":"proceedings-article","created":{"date-parts":[[2006,7,24]],"date-time":"2006-07-24T16:53:01Z","timestamp":1153759981000},"page":"130-139","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":76,"title":["On the solution-space geometry of random constraint satisfaction problems"],"prefix":"10.1145","author":[{"given":"Dimitris","family":"Achlioptas","sequence":"first","affiliation":[{"name":"University of California Santa Cruz"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Federico","family":"Ricci-Tersenghi","sequence":"additional","affiliation":[{"name":"University of Rome \"La Sapienza\""}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2006,5,21]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"D. Achlioptas J. Thorpe manuscript.  D. Achlioptas J. Thorpe manuscript."},{"key":"e_1_3_2_1_2_1","volume-title":"43rd FOCS, 126--127","author":"Achlioptas D.","year":"2002","unstructured":"D. Achlioptas , C. Moore , The asymptotic order of the random k-SAT threshold , In 43rd FOCS, 126--127 , 2002 . D. Achlioptas, C. Moore, The asymptotic order of the random k-SAT threshold, In 43rd FOCS, 126--127, 2002."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.4007\/annals.2005.162.1335"},{"key":"e_1_3_2_1_4_1","volume-title":"Nature, 435, June 9th","author":"Achlioptas D.","year":"2005","unstructured":"D. Achlioptas , A. Naor , and Y. Peres , Rigorous location of phase transitions in hard optimization problems , Nature, 435, June 9th 2005 , 759--764. D. Achlioptas, A. Naor, and Y. Peres, Rigorous location of phase transitions in hard optimization problems, Nature, 435, June 9th 2005, 759--764."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0894-0347-04-00464-3"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/18.825794"},{"key":"e_1_3_2_1_7_1","volume-title":"44th FOCS, 352--361","author":"Alekhnovich M.","year":"2003","unstructured":"M. Alekhnovich , E. Ben-Sasson , Linear upper bounds for random walk on small density random 3CNFs , In 44th FOCS, 352--361 , 2003 . M. Alekhnovich, E. Ben-Sasson, Linear upper bounds for random walk on small density random 3CNFs, In 44th FOCS, 352--361, 2003."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1088\/1742-5468\/2004\/06\/P06007"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1137\/0215080"},{"key":"e_1_3_2_1_10_1","volume-title":"Proc. 33th STOC, 620--627","author":"Chv\u00e1tal V.","year":"1992","unstructured":"V. Chv\u00e1tal , B. Reed . Mick gets some (the odds are on his side) , In Proc. 33th STOC, 620--627 , 1992 . V. Chv\u00e1tal, B. Reed. Mick gets some (the odds are on his side), In Proc. 33th STOC, 620--627, 1992."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1997.0867"},{"key":"e_1_3_2_1_12_1","first-page":"10","article-title":"Typical random 3-SAT formulae and the satisfiability threshold","author":"Dubois O.","year":"2003","unstructured":"O. Dubois , Y. Boufkhad , and J. Mandler . Typical random 3-SAT formulae and the satisfiability threshold , Electronic Colloquium on Computational Complexity , 10 ( 2003 ). O. Dubois, Y. Boufkhad, and J. Mandler. Typical random 3-SAT formulae and the satisfiability threshold, Electronic Colloquium on Computational Complexity, 10 (2003).","journal-title":"Electronic Colloquium on Computational Complexity"},{"key":"e_1_3_2_1_13_1","unstructured":"E. Friedgut personal communication.  E. Friedgut personal communication."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1996.0016"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.3240070105"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/647912.757248"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/S1571-0653(04)00462-7"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1098-2418(199805)12:3%3C253::AID-RSA3%3E3.0.CO;2-U"},{"key":"e_1_3_2_1_19_1","volume-title":"16th SODA, 1089--1098","author":"Maneva E.","year":"2005","unstructured":"E. Maneva , E. Mossel , and M. J. Wainwright , A New look at Survey Propogation and its Generalizations , In 16th SODA, 1089--1098 , 2005 . E. Maneva, E. Mossel, and M. J. Wainwright, A New look at Survey Propogation and its Generalizations, In 16th SODA, 1089--1098, 2005."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.94.197205"},{"key":"e_1_3_2_1_21_1","volume-title":"June 2nd","author":"M\u00e9zard M.","year":"2005","unstructured":"M. M\u00e9zard , T. Mora , and R. Zecchina , Pairs of SAT Assignments and Clustering in Random Boolean Formulae, cond-mat\/0506053 , June 2nd 2005 . M. M\u00e9zard, T. Mora, and R. Zecchina, Pairs of SAT Assignments and Clustering in Random Boolean Formulae, cond-mat\/0506053, June 2nd 2005."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1126\/science.1073287"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1214\/aoap\/1177004612"}],"event":{"name":"STOC06: Symposium on Theory of Computing","location":"Seattle WA USA","acronym":"STOC06","sponsor":["ACM Association for Computing Machinery","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1132516.1132537","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1132516.1132537","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T16:18:50Z","timestamp":1750263530000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1132516.1132537"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,5,21]]},"references-count":23,"alternative-id":["10.1145\/1132516.1132537","10.1145\/1132516"],"URL":"https:\/\/doi.org\/10.1145\/1132516.1132537","relation":{},"subject":[],"published":{"date-parts":[[2006,5,21]]},"assertion":[{"value":"2006-05-21","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}