{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,6]],"date-time":"2025-12-06T17:00:57Z","timestamp":1765040457482},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2014,4,4]],"date-time":"2014-04-04T00:00:00Z","timestamp":1396569600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2015,7]]},"DOI":"10.1007\/s10878-014-9731-3","type":"journal-article","created":{"date-parts":[[2014,4,3]],"date-time":"2014-04-03T10:06:44Z","timestamp":1396519604000},"page":"188-200","source":"Crossref","is-referenced-by-count":9,"title":["On the constraint length of random $$k$$ k -CSP"],"prefix":"10.1007","volume":"30","author":[{"given":"Guangyan","family":"Zhou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zongsheng","family":"Gao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jun","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,4,4]]},"reference":[{"issue":"4","key":"9731_CR1","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1023\/A:1011402324562","volume":"6","author":"D Achlioptas","year":"2001","unstructured":"Achlioptas D, Kirousis L, Kranakis E, Krizanc D, Molloy M, Stamatiou Y (2001) Random constraint satisfacton: a more accurate picture. Constraints 6(4):329\u2013344","journal-title":"Constraints"},{"key":"9731_CR2","doi-asserted-by":"crossref","unstructured":"Cook SA, Mitchell, DG (1997) Finding hard instances of the satisfiability problem: a survey, DIMACS series in discrete mathematics and theoretical computer science 35","DOI":"10.1090\/dimacs\/035\/01"},{"key":"9731_CR3","doi-asserted-by":"crossref","first-page":"914","DOI":"10.1016\/j.artint.2010.11.004","volume":"175","author":"Y Fan","year":"2011","unstructured":"Fan Y, Shen J (2011) On the phase transitions of random $$k$$ k -constraint satisfaction problems. Artif Intell 175:914\u2013927","journal-title":"Artif Intell"},{"key":"9731_CR4","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1007\/s00493-005-0017-3","volume":"25","author":"AM Friedgut","year":"2005","unstructured":"Friedgut AM, Wormald N (2005) Random $$k$$ k -SAT: a tight threshold for moderately growing $$k$$ k . Combinatorica 25:297\u2013305","journal-title":"Combinatorica"},{"key":"9731_CR5","unstructured":"Liu J, Gao Z (2010) Exploiting the power of the second moment method to prove exact phase transitions, manuscript"},{"key":"9731_CR6","doi-asserted-by":"crossref","first-page":"P24","DOI":"10.37236\/1176","volume":"19","author":"J Liu","year":"2012","unstructured":"Liu J, Gao Z, Xu K (2012) A note on the random $$k$$ k -SAT for moderately growing $$k$$ k . Electron J Comb 19:P24","journal-title":"Electron J Comb"},{"key":"9731_CR7","doi-asserted-by":"crossref","first-page":"1170","DOI":"10.1016\/j.camwa.2007.07.002","volume":"55","author":"JH Reif","year":"2008","unstructured":"Reif JH, Kasif S, Sherlekar D (2008) Formula dissection: a parallel algorithm for constraint satisfaction. Comput Math Appl 55:1170\u20131177","journal-title":"Comput Math Appl"},{"key":"9731_CR8","doi-asserted-by":"crossref","first-page":"514","DOI":"10.1016\/j.artint.2007.04.001","volume":"171","author":"K Xu","year":"2007","unstructured":"Xu K, Boussemart F, Hemery F, Lecoutre C (2007) Random constraint satisfaction: easy generation of hard (satisfiable) instances. Artif Intell 171:514\u2013534","journal-title":"Artif Intell"},{"key":"9731_CR9","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1613\/jair.696","volume":"12","author":"K Xu","year":"2000","unstructured":"Xu K, Li W (2000) Exact phase transitions in random constraint satisfaction problems. J Artif Intell Res 12:93\u2013103","journal-title":"J Artif Intell Res"},{"key":"9731_CR10","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1016\/j.tcs.2006.01.001","volume":"355","author":"K Xu","year":"2006","unstructured":"Xu K, Li W (2006) Many hard examples in exact phase transitions. Theor Comput Sci 355:291\u2013302","journal-title":"Theor Comput Sci"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-014-9731-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-014-9731-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-014-9731-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,17]],"date-time":"2020-08-17T05:18:16Z","timestamp":1597641496000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-014-9731-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,4,4]]},"references-count":10,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2015,7]]}},"alternative-id":["9731"],"URL":"https:\/\/doi.org\/10.1007\/s10878-014-9731-3","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,4,4]]}}}