{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,20]],"date-time":"2025-09-20T09:41:04Z","timestamp":1758361264274,"version":"3.44.0"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2023,12,18]],"date-time":"2023-12-18T00:00:00Z","timestamp":1702857600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,12,18]],"date-time":"2023-12-18T00:00:00Z","timestamp":1702857600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Front. Comput. Sci."],"published-print":{"date-parts":[[2024,8]]},"DOI":"10.1007\/s11704-023-2752-2","type":"journal-article","created":{"date-parts":[[2023,12,17]],"date-time":"2023-12-17T23:34:59Z","timestamp":1702856099000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On the upper bounds of (1,0)-super solutions for the regular balanced random (k,2s)-SAT problem"],"prefix":"10.1007","volume":"18","author":[{"given":"Yongping","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daoyun","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jincheng","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,12,18]]},"reference":[{"key":"2752_CR1","unstructured":"Ginsberg M L, Parkes A J, Roy A. Supermodels and robustness. In: Proceedings of the 15th National Conference on Artificial Intelligence and 10th Innovative Applications of Artificial Intelligence Conference. 1998, 334\u2013339"},{"key":"2752_CR2","doi-asserted-by":"crossref","unstructured":"Hebrard E, Hnich B, Walsh T. Super solutions in constraint programming. In: Proceedings of the 1st International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems. 2004, 157\u2013172","DOI":"10.1007\/978-3-540-24664-0_11"},{"key":"2752_CR3","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1016\/j.tcs.2016.04.041","volume":"657","author":"P Zhang","year":"2017","unstructured":"Zhang P, Gao Y. A probabilistic study of generalized solution concepts in satisfiability testing and constraint programming. Theoretical Computer Science, 2017, 657: 98\u2013110","journal-title":"Theoretical Computer Science"},{"key":"2752_CR4","doi-asserted-by":"crossref","unstructured":"Cook S A. The complexity of theorem-proving procedures. In: Proceedings of the 3rd Annual ACM Symposium on Theory of Computing. 1971, 151\u2013158","DOI":"10.1145\/800157.805047"},{"key":"2752_CR5","unstructured":"Mitchell D, Selman B, Levesque H. Hard and easy distributions of SAT problems. In: Proceedings of the 10th National Conference on Artificial Intelligence. 1992, 459\u2013465"},{"issue":"4","key":"2752_CR6","doi-asserted-by":"publisher","first-page":"1017","DOI":"10.1090\/S0894-0347-99-00305-7","volume":"12","author":"E Friedgut","year":"1999","unstructured":"Friedgut E, Bourgain J. Sharp thresholds of graph properties, and the k-SAT problem. Journal of the American Mathematical Society, 1999, 12(4): 1017\u20131054","journal-title":"Journal of the American Mathematical Society"},{"key":"2752_CR7","doi-asserted-by":"crossref","unstructured":"Chv\u00e1tal V, Reed B. Mick gets some (the odds are on his side). In: Proceedings of the 33rd Annual Symposium on Foundations of Computer Science. 1992, 620\u2013627","DOI":"10.1109\/SFCS.1992.267789"},{"issue":"4","key":"2752_CR8","doi-asserted-by":"publisher","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 Structures & Algorithms, 2006, 28(4): 444\u2013480","journal-title":"Random Structures & Algorithms"},{"issue":"30\u201332","key":"2752_CR9","doi-asserted-by":"publisher","first-page":"2920","DOI":"10.1016\/j.tcs.2009.02.020","volume":"410","author":"J D\u00edaz","year":"2009","unstructured":"D\u00edaz J, Kirousis L, Mitsche D, P\u00e9rez-Gim\u00e9nez X. On the satisfiability threshold of formulas with three literals per clause. Theoretical Computer Science, 2009, 410(30\u201332): 2920\u20132934","journal-title":"Theoretical Computer Science"},{"issue":"4","key":"2752_CR10","doi-asserted-by":"publisher","first-page":"1106","DOI":"10.1137\/0215080","volume":"15","author":"M T Chao","year":"1986","unstructured":"Chao M T, Franco J. Probabilistic analysis of two heuristics for the 3-satisfiability problem. SIAM Journal on Computing, 1986, 15(4): 1106\u20131118","journal-title":"SIAM Journal on Computing"},{"key":"2752_CR11","doi-asserted-by":"crossref","unstructured":"Achioptas D, Sorkin G B. Optimal myopic algorithms for random 3-SAT. In: Proceedings of the 41st Annual Symposium on Foundations of Computer Science. 2000, 590\u2013600","DOI":"10.1109\/SFCS.2000.892327"},{"issue":"2","key":"2752_CR12","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1002\/rsa.20057","volume":"27","author":"A Braunstein","year":"2005","unstructured":"Braunstein A, M\u00e9zard M, Zecchina R. Survey propagation: an algorithm for satisfiability. Random Structures & Algorithms, 2005, 27(2): 201\u2013226","journal-title":"Random Structures & Algorithms"},{"issue":"2","key":"2752_CR13","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1142\/S0129054119500035","volume":"30","author":"G Zhou","year":"2019","unstructured":"Zhou G, Kang R. On the lower bounds of (1,0)-super solutions for random k-SAT. International Journal of Foundations of Computer Science, 2019, 30(2): 247\u2013254","journal-title":"International Journal of Foundations of Computer Science"},{"key":"2752_CR14","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1016\/j.tcs.2019.04.015","volume":"793","author":"B Wang","year":"2019","unstructured":"Wang B, Zhou G. Super solutions of random (3+p)-SAT. Theoretical Computer Science, 2019, 793: 14\u201327","journal-title":"Theoretical Computer Science"},{"issue":"12","key":"2752_CR15","first-page":"2985","volume":"27","author":"J C Zhou","year":"2016","unstructured":"Zhou J C, Xu D Y, Lu Y J. Satisfiability threshold of the regular random (k, r)-SAT problem. Journal of Software, 2016, 27(12): 2985\u20132993","journal-title":"Journal of Software"},{"issue":"1\u20133","key":"2752_CR16","first-page":"181","volume":"35","author":"Y Boufkhad","year":"2005","unstructured":"Boufkhad Y, Dubois O, Interian Y, Selman B. Regular random k-SAT: properties of balanced formulas. Journal of Automated Reasoning, 2005, 35(1\u20133): 181\u2013200","journal-title":"Journal of Automated Reasoning"},{"key":"2752_CR17","doi-asserted-by":"crossref","unstructured":"Rathi V, Aurell E, Rasmussen L, Skoglund M. Bounds on threshold of regular random k-SAT. In: Proceedings of the 13th International Conference on Theory and Applications of Satisfiability Testing. 2010, 264\u2013277","DOI":"10.1007\/978-3-642-14186-7_22"},{"issue":"4","key":"2752_CR18","doi-asserted-by":"publisher","first-page":"042130","DOI":"10.1103\/PhysRevE.87.042130","volume":"87","author":"Sumedha","year":"2013","unstructured":"Sumedha, Krishnamurthy S, Sahoo S. Balanced K-satisfiability and biased random K-satisfiability on trees. Physical Review E, 2013, 87(4): 042130","journal-title":"Physical Review E"},{"issue":"12","key":"2752_CR19","first-page":"2563","volume":"42","author":"J Zhou","year":"2016","unstructured":"Zhou J, Xu D, Lu Y, Dai C. Strictly regular random (3,s)-SAT model and its phase transition phenomenon. Journal of Beijing University of Aeronautics and Astronautics, 2016, 42(12): 2563\u20132571","journal-title":"Journal of Beijing University of Aeronautics and Astronautics"},{"issue":"12","key":"2752_CR20","first-page":"7","volume":"45","author":"J Zhou","year":"2017","unstructured":"Zhou J, Xu D, Lu Y. Satisfiability threshold of regular (k, r)-SAT problem via 1RSB theory. Journal of Huazhong University of Science and Technology: Natural Science Edition, 2017, 45(12): 7\u201313","journal-title":"Journal of Huazhong University of Science and Technology: Natural Science Edition"},{"issue":"4","key":"2752_CR21","doi-asserted-by":"publisher","first-page":"496","DOI":"10.1017\/S0963548318000263","volume":"27","author":"A Coja-Oghlan","year":"2018","unstructured":"Coja-Oghlan A, Wormald N. The number of satisfying assignments of random regular k-SAT formulas. Combinatorics, Probability and Computing, 2018, 27(4): 496\u2013530","journal-title":"Combinatorics, Probability and Computing"},{"issue":"4","key":"2752_CR22","doi-asserted-by":"publisher","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 2klog2-O(k). Journal of the American Mathematical Society, 2004, 17(4): 947\u2013973","journal-title":"Journal of the American Mathematical Society"},{"key":"2752_CR23","doi-asserted-by":"crossref","unstructured":"Mahajan Y S, Fu Z, Malik S. Zchaff2004: an efficient SAT solver. In: Proceedings of the 7th International Conference on Theory and Applications of Satisfiability Testing. 2005, 360\u2013375","DOI":"10.1007\/11527695_27"},{"issue":"6","key":"2752_CR24","doi-asserted-by":"publisher","first-page":"146404","DOI":"10.1007\/s11704-020-9248-0","volume":"14","author":"Y Wang","year":"2020","unstructured":"Wang Y, Xu D. Properties of the satisfiability threshold of the strictly d-regular random (3,2s)-SAT problem. Frontiers of Computer Science, 2020, 14(6): 146404","journal-title":"Frontiers of Computer Science"},{"issue":"1\u20133","key":"2752_CR25","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/0012-365X(94)00133-4","volume":"139","author":"D Gardy","year":"1995","unstructured":"Gardy D. Some results on the asymptotic behaviour of coefficients of large powers of functions. Discrete Mathematics, 1995, 139(1\u20133): 189\u2013217","journal-title":"Discrete Mathematics"},{"key":"2752_CR26","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511791338","volume-title":"Modern Coding Theory","author":"T Richardson","year":"2008","unstructured":"Richardson T, Urbanke R. Modern Coding Theory. London: Cambridge University Press, 2008"}],"container-title":["Frontiers of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11704-023-2752-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11704-023-2752-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11704-023-2752-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T19:39:24Z","timestamp":1758310764000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11704-023-2752-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,18]]},"references-count":26,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2024,8]]}},"alternative-id":["2752"],"URL":"https:\/\/doi.org\/10.1007\/s11704-023-2752-2","relation":{},"ISSN":["2095-2228","2095-2236"],"issn-type":[{"type":"print","value":"2095-2228"},{"type":"electronic","value":"2095-2236"}],"subject":[],"published":{"date-parts":[[2023,12,18]]},"assertion":[{"value":"9 December 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 April 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 December 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"184403"}}