{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:20:58Z","timestamp":1759638058592,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":29,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,6,1]],"date-time":"2013-06-01T00:00:00Z","timestamp":1370044800000},"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":[[2013,6]]},"DOI":"10.1145\/2488608.2488698","type":"proceedings-article","created":{"date-parts":[[2013,5,28]],"date-time":"2013-05-28T16:35:41Z","timestamp":1369758941000},"page":"705-714","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":22,"title":["Going after the k-SAT threshold"],"prefix":"10.1145","author":[{"given":"Amin","family":"Coja-Oghlan","sequence":"first","affiliation":[{"name":"Goethe University, Mathematics Institute, Frankfurt, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Konstantinos","family":"Panagiotou","sequence":"additional","affiliation":[{"name":"University of Munich, Mathematics Institute, M\u00fcnchen, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2013,6]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2008.11"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-31594-7_1"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-31612-8_25"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539703434231"},{"key":"e_1_3_2_1_5_1","first-page":"1333","volume":"162","author":"Achlioptas D.","year":"2005","unstructured":"D. Achlioptas , A. Naor:The two possible values of the chromatic number of a random graph.Annals of Mathematics 162 ( 2005 ) 1333 -- 1349 . D. Achlioptas, A. Naor:The two possible values of the chromatic number of a random graph.Annals of Mathematics 162 (2005) 1333--1349.","journal-title":"Mathematics"},{"key":"e_1_3_2_1_6_1","first-page":"947","volume":"17","author":"Achlioptas D.","year":"2004","unstructured":"D. Achlioptas , Y. Peres:The threshold for random k-SAT is 2^k ln 2 - O(k). Journal of the AMS 17 ( 2004 ) 947 -- 973 . D. Achlioptas, Y. Peres:The threshold for random k-SAT is 2^k ln 2 - O(k). Journal of the AMS 17 (2004) 947--973.","journal-title":"AMS"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806689.1806706"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1992.267789"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1137\/09076516X"},{"volume-title":"Proc. 22nd SODA (2011)","author":"Coja-Oghlan A.","key":"e_1_3_2_1_10_1","unstructured":"A. Coja-Oghlan : On belief propagation guided decmation for random k-SAT . Proc. 22nd SODA (2011) 957--966. A. Coja-Oghlan: On belief propagation guided decmation for random k-SAT. Proc. 22nd SODA (2011) 957--966."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213977.2214058"},{"key":"e_1_3_2_1_12_1","volume-title":"241--250","author":"Coja-Oghlan A.","year":"2012","unstructured":"A. Coja-Oghlan , L. Zdeborov\u00e1:The condensation transition in random hypergraph 2-coloring. Proc . 23rd SODA ( 2012 ) 241--250 . A. Coja-Oghlan, L. Zdeborov\u00e1:The condensation transition in random hypergraph 2-coloring.Proc. 23rd SODA (2012) 241--250."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1997.0867"},{"volume-title":"Proc. 43rd FOCS (2002)","author":"Dubois O.","key":"e_1_3_2_1_14_1","unstructured":"O. Dubois , J. Mandler : The 3-XORSAT threshold . Proc. 43rd FOCS (2002) 769--778. O. Dubois, J. Mandler: The 3-XORSAT threshold. Proc. 43rd FOCS (2002) 769--778."},{"key":"e_1_3_2_1_15_1","unstructured":"M. Dyer A. Frieze C. Greenhill:On the chromatic number of a random hypergraph. Preprint (2012).  M. Dyer A. Frieze C. Greenhill:On the chromatic number of a random hypergraph. Preprint (2012)."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1022885828956"},{"key":"e_1_3_2_1_17_1","first-page":"1017","volume":"12","author":"Sharp E.","year":"1999","unstructured":"E. Friedgut: Sharp Thresholds of Graph Proprties, and the k- SAT Problem. J. AMS 12 ( 1999 ) 1017 -- 1054 . E. Friedgut:Sharp Thresholds of Graph Proprties, and the k-SAT Problem. J. AMS 12 (1999) 1017--1054.","journal-title":"SAT Problem. J. AMS"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1996.0016"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00493-005-0017-3"},{"volume-title":"A threshold for unsatisfiability.Proc. 17th MFCS (1992) 264--274","author":"Goerdt A.","key":"e_1_3_2_1_20_1","unstructured":"A. Goerdt : A threshold for unsatisfiability.Proc. 17th MFCS (1992) 264--274 . A. Goerdt: A threshold for unsatisfiability.Proc. 17th MFCS (1992) 264--274."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1126\/science.264.5163.1297"},{"key":"e_1_3_2_1_22_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_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1529282.1529596"},{"key":"e_1_3_2_1_24_1","first-page":"10318","volume":"104","author":"Krzakala F.","year":"2007","unstructured":"F. Krzakala , A. Montanari , F. Ricci-Tersenghi , G. Semerjian , L. Zdeborov\u00e1: Gibbs states and the set of solutions of random constraint satisfaction problems.Proc. National Academy of Sciences 104 ( 2007 ) 10318 -- 10323 . F. Krzakala, A. Montanari, F. Ricci-Tersenghi, G. Semerjian, L. Zdeborov\u00e1: Gibbs states and the set of solutions of random constraint satisfaction problems.Proc. National Academy of Sciences 104 (2007) 10318--10323.","journal-title":"Sciences"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1126\/science.1073287"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213977.2214060"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1137\/090755862"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/1667053.1667060"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14186-7_22"}],"event":{"name":"STOC'13: Symposium on Theory of Computing","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Palo Alto California USA","acronym":"STOC'13"},"container-title":["Proceedings of the forty-fifth annual ACM symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2488608.2488698","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2488608.2488698","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:39:20Z","timestamp":1750235960000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2488608.2488698"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,6]]},"references-count":29,"alternative-id":["10.1145\/2488608.2488698","10.1145\/2488608"],"URL":"https:\/\/doi.org\/10.1145\/2488608.2488698","relation":{},"subject":[],"published":{"date-parts":[[2013,6]]},"assertion":[{"value":"2013-06-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}