{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T07:25:07Z","timestamp":1649057107828},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"9","license":[{"start":{"date-parts":[[2016,8,23]],"date-time":"2016-08-23T00:00:00Z","timestamp":1471910400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Sci. China Inf. Sci."],"published-print":{"date-parts":[[2016,9]]},"DOI":"10.1007\/s11432-016-5526-8","type":"journal-article","created":{"date-parts":[[2016,9,2]],"date-time":"2016-09-02T20:06:07Z","timestamp":1472846767000},"update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["A novel weighting scheme for random k-SAT"],"prefix":"10.1007","volume":"59","author":[{"given":"Jun","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ke","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,8,23]]},"reference":[{"key":"5526_CR1","doi-asserted-by":"crossref","first-page":"947","DOI":"10.1090\/S0894-0347-04-00464-3","volume":"17","author":"D Achlioptas","year":"2004","unstructured":"Achlioptas D, Peres Y. The threshold for random k-SAT is 2k log 2 - O(k). J Amer Math Soc, 2004, 17: 947\u2013973","journal-title":"J Amer Math Soc"},{"key":"5526_CR2","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1007\/s00493-005-0017-3","volume":"25","author":"A Frieze","year":"2005","unstructured":"Frieze A, Wormald N C. Random k-SAT: a tight threshold for moderately growing k. Combinatorica, 2005, 25: 297\u2013305","journal-title":"Combinatorica"},{"key":"5526_CR3","doi-asserted-by":"crossref","first-page":"24","DOI":"10.37236\/1176","volume":"19","author":"J Liu","year":"2012","unstructured":"Liu J, Gao Z S, Xu K. A Note on Random k-SAT for Moderately Growing k. Electron J Combin, 2012, 19: 24","journal-title":"Electron J Combin"},{"key":"5526_CR4","doi-asserted-by":"crossref","first-page":"740","DOI":"10.1137\/S0097539703434231","volume":"36","author":"D Achlioptas","year":"2006","unstructured":"Achlioptas D, Moore C. Ramdom k-SAT: two moments suffice to cross a sharp threshold. SIAM J Comput, 2006, 36: 740\u2013762","journal-title":"SIAM J Comput"},{"key":"5526_CR5","first-page":"126","volume-title":"Proceeding of the 43rd Annual IEEE Symposium on Foundations of Computer Science, Vancouver","author":"D Achlioptas","year":"2002","unstructured":"Achlioptas D, Moore C. The asymptotic order of the random k-SAT threshold. In: Proceeding of the 43rd Annual IEEE Symposium on Foundations of Computer Science, Vancouver, 2002. 126\u2013127"},{"key":"5526_CR6","doi-asserted-by":"crossref","first-page":"620","DOI":"10.1109\/SFCS.1992.267789","volume-title":"Proceedings of the 33rd Annual IEEE Symposium on Foundations of Computer Science, Pittsburgh","author":"V Chv\u00e1tal","year":"1992","unstructured":"Chv\u00e1tal V, Reed B. Mick gets some (the odds are on his side). In: Proceedings of the 33rd Annual IEEE Symposium on Foundations of Computer Science, Pittsburgh, 1992. 620\u2013627"},{"key":"5526_CR7","first-page":"609","volume":"10","author":"P Erdos","year":"1973","unstructured":"Erdos P, Lov\u00e1sz L. Problems and results on 3-chromatic hypergraphs and some related questions. Colloq Math Soc J\u00e1nos Bolyai, 1973, 10: 609\u2013627","journal-title":"Colloq Math Soc J\u00e1nos Bolyai"},{"key":"5526_CR8","doi-asserted-by":"crossref","first-page":"1017","DOI":"10.1090\/S0894-0347-99-00305-7","volume":"12","author":"E Friedgut","year":"1999","unstructured":"Friedgut E. Necessary and sufficient conditions for sharp thresholds of graph properties, and the k-SAT problem. J Amer Math Soc, 1999, 12: 1017\u20131054","journal-title":"J Amer Math Soc"},{"key":"5526_CR9","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1002\/1098-2418(200009)17:2<103::AID-RSA2>3.0.CO;2-P","volume":"17","author":"S Janson","year":"2000","unstructured":"Janson S, Stamatiou Y C, Vamvakari M. Bounding the unsatisfiability threshold of random 3-SAT. Random Struct Algor, 2000, 17: 103\u2013116","journal-title":"Random Struct Algor"},{"key":"5526_CR10","unstructured":"Ding J, Sly A, Sun N. Proof of the satisfiability conjecture for large k. arXiv:1411.0650"},{"key":"5526_CR11","doi-asserted-by":"crossref","first-page":"444","DOI":"10.1002\/rsa.20104","volume":"28","author":"A C Kaporis","year":"2006","unstructured":"Kaporis A C, Kirousis L M, Lalas E G. The probabilistic analysis of a greedy satisfiability algorithm. Random Struct Algor, 2006, 28: 444\u2013480","journal-title":"Random Struct Algor"},{"key":"5526_CR12","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1515\/dma.2007.025","volume":"17","author":"F Y Vorobyev","year":"2007","unstructured":"Vorobyev F Y. A lower bound for the 4-satisfiability threshold. Discrete Math Appl, 2007, 17: 287\u2013294","journal-title":"Discrete Math Appl"},{"key":"5526_CR13","volume-title":"Asymptotic Methods in Analysis","author":"N G Bruijn de","year":"1981","unstructured":"de Bruijn N G. Asymptotic Methods in Analysis. 3rd ed. New York: Dover Publications Inc, 1981"}],"container-title":["Science China Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-016-5526-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11432-016-5526-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-016-5526-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,25]],"date-time":"2020-09-25T18:59:41Z","timestamp":1601060381000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11432-016-5526-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,8,23]]},"references-count":13,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2016,9]]}},"alternative-id":["5526"],"URL":"https:\/\/doi.org\/10.1007\/s11432-016-5526-8","relation":{},"ISSN":["1674-733X","1869-1919"],"issn-type":[{"value":"1674-733X","type":"print"},{"value":"1869-1919","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,8,23]]},"article-number":"92101"}}