{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,2]],"date-time":"2025-11-02T16:53:11Z","timestamp":1762102391312,"version":"3.40.3"},"publisher-location":"Cham","reference-count":40,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030242572"},{"type":"electronic","value":"9783030242589"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-24258-9_4","type":"book-chapter","created":{"date-parts":[[2019,6,28]],"date-time":"2019-06-28T21:02:31Z","timestamp":1561755751000},"page":"53-70","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Satisfiability Threshold for Power Law Random 2-SAT in Configuration Model"],"prefix":"10.1007","author":[{"given":"Oleksii","family":"Omelchenko","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrei A.","family":"Bulatov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,6,29]]},"reference":[{"issue":"1\u20132","key":"4_CR1","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/S0304-3975(01)00159-1","volume":"265","author":"D Achlioptas","year":"2001","unstructured":"Achlioptas, D.: Lower bounds for random 3-SAT via differential equations. Theor. Comput. Sci. 265(1\u20132), 159\u2013185 (2001)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"4_CR2","doi-asserted-by":"publisher","first-page":"740","DOI":"10.1137\/S0097539703434231","volume":"36","author":"D Achlioptas","year":"2006","unstructured":"Achlioptas, D., Moore, C.: Random $$k$$ -SAT: two moments suffice to cross a sharp threshold. SIAM J. Comput. 36(3), 740\u2013762 (2006)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"4_CR3","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1080\/10586458.2001.10504428","volume":"10","author":"W Aiello","year":"2001","unstructured":"Aiello, W., Graham, F.C., Lu, L.: A random graph model for power law graphs. Exp. Math. 10(1), 53\u201366 (2001)","journal-title":"Exp. Math."},{"key":"4_CR4","unstructured":"Ans\u00f3tegui, C., Bonet, M.L., Gir\u00c1ldez-Cru, J., Levy, J.: Community structure in industrial SAT instances (2016)"},{"key":"4_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/978-3-642-04244-7_13","volume-title":"Principles and Practice of Constraint Programming - CP 2009","author":"C Ans\u00f3tegui","year":"2009","unstructured":"Ans\u00f3tegui, C., Bonet, M.L., Levy, J.: On the structure of industrial SAT instances. In: Gent, I.P. (ed.) CP 2009. LNCS, vol. 5732, pp. 127\u2013141. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-04244-7_13"},{"key":"4_CR6","unstructured":"Ans\u00f3tegui, C., Bonet, M.L., Levy, J.: Towards industrial-like random SAT instances. In: IJCAI 2009, Proceedings of the 21st International Joint Conference on Artificial Intelligence, Pasadena, California, USA, 11\u201317 July 2009, pp. 387\u2013392 (2009)"},{"key":"4_CR7","unstructured":"Ans\u00f3tegui, C., Bonet, M.L., Levy, J.: Scale-free random SAT instances (2017). https:\/\/arxiv.org\/abs\/1708.06805v2"},{"key":"4_CR8","unstructured":"Ans\u00f3tegui, C., Bonet, M.L., Levy, J., Many\u00e0, F.: Measuring the hardness of SAT instances. In: Proceedings of the 23rd National Conference on Artificial Intelligence, AAAI 2008, vol. 1, pp. 222\u2013228 (2008)"},{"issue":"3","key":"4_CR9","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/0020-0190(79)90002-4","volume":"8","author":"B Aspvall","year":"1979","unstructured":"Aspvall, B., Plass, M.F., Tarjan, R.E.: A linear-time algorithm for testing the truth of certain quantified Boolean formulas. Inf. Process. Lett. 8(3), 121\u2013123 (1979)","journal-title":"Inf. Process. Lett."},{"key":"4_CR10","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1126\/science.286.5439.509","volume":"286","author":"AL Barab\u00e1si","year":"1999","unstructured":"Barab\u00e1si, A.L., Albert, R.: Emergence of scaling in random networks. Science 286, 509\u2013512 (1999)","journal-title":"Science"},{"key":"4_CR11","doi-asserted-by":"crossref","unstructured":"Bollob\u00e1s, B., Riordan, O.: Mathematical results on scale-free random graphs. In: Handbook of Graphs and Networks, pp. 1\u201334. Wiley-VCH (2002)","DOI":"10.1002\/3527602755.ch1"},{"issue":"3","key":"4_CR12","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1002\/rsa.1009","volume":"18","author":"B Bollob\u00e1s","year":"2001","unstructured":"Bollob\u00e1s, B., Riordan, O., Spencer, J., Tusn\u00e1dy, G.E.: The degree sequence of a scale-free random graph process. Random Struct. Algorithms 18(3), 279\u2013290 (2001)","journal-title":"Random Struct. Algorithms"},{"issue":"1\u20133","key":"4_CR13","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. J. Autom. Reason. 35(1\u20133), 181\u2013200 (2005)","journal-title":"J. Autom. Reason."},{"issue":"2","key":"4_CR14","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 Struct. Algorithms 27(2), 201\u2013226 (2005)","journal-title":"Random Struct. Algorithms"},{"key":"4_CR15","doi-asserted-by":"crossref","unstructured":"Chv\u00e1tal, V., Reed, B.A.: Mick gets some (the odds are on his side). In: 33rd Annual Symposium on Foundations of Computer Science, Pittsburgh, Pennsylvania, USA, 24\u201327 October 1992, pp. 620\u2013627 (1992)","DOI":"10.1109\/SFCS.1992.267789"},{"issue":"4","key":"4_CR16","doi-asserted-by":"publisher","first-page":"661","DOI":"10.1137\/070710111","volume":"51","author":"A Clauset","year":"2009","unstructured":"Clauset, A., Shalizi, C., Newman, M.: Power-law distributions in empirical data. SIAM Rev. 51(4), 661\u2013703 (2009)","journal-title":"SIAM Rev."},{"issue":"7","key":"4_CR17","doi-asserted-by":"publisher","first-page":"2823","DOI":"10.1137\/09076516X","volume":"39","author":"A Coja-Oghlan","year":"2010","unstructured":"Coja-Oghlan, A.: A better algorithm for random $$k$$ -SAT. SIAM J. Comput. 39(7), 2823\u20132864 (2010)","journal-title":"SIAM J. Comput."},{"key":"4_CR18","doi-asserted-by":"crossref","unstructured":"Coja-Oghlan, A., Panagiotou, K.: Going after the k-SAT threshold. In: Symposium on Theory of Computing Conference, STOC 2013, Palo Alto, CA, USA, 1\u20134 June 2013, pp. 705\u2013714 (2013)","DOI":"10.1145\/2488608.2488698"},{"key":"4_CR19","doi-asserted-by":"crossref","unstructured":"Cook, S.A., Mitchell, D.G.: Finding hard instances of the satisfiability problem: a survey. In: Proceedings of a DIMACS Workshop on Satisfiability Problem: Theory and Applications, Piscataway, New Jersey, USA, 11\u201313 March 1996, pp. 1\u201318 (1996)","DOI":"10.1090\/dimacs\/035\/01"},{"issue":"3","key":"4_CR20","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/s00453-007-0082-7","volume":"48","author":"C Cooper","year":"2007","unstructured":"Cooper, C., Frieze, A., Sorkin, G.B.: Random 2-SAT with prescribed literal degrees. Algorithmica 48(3), 249\u2013265 (2007)","journal-title":"Algorithmica"},{"issue":"30\u201332","key":"4_CR21","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.M., Mitsche, D., P\u00e9rez-Gim\u00e9nez, X.: On the satisfiability threshold of formulas with three literals per clause. Theor. Comput. Sci. 410(30\u201332), 2920\u20132934 (2009)","journal-title":"Theor. Comput. Sci."},{"key":"4_CR22","doi-asserted-by":"crossref","unstructured":"Ding, J., Sly, A., Sun, N.: Proof of the satisfiability conjecture for large $$k$$ . In: Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, STOC 2015, Portland, OR, USA, 14\u201317 June 2015, pp. 59\u201368 (2015)","DOI":"10.1145\/2746539.2746619"},{"issue":"2","key":"4_CR23","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1006\/jagm.1997.0867","volume":"24","author":"O Dubios","year":"1997","unstructured":"Dubios, O., Boufkhad, Y.: A general upper bound for the satisfiability threshold of random r-SAT formulae. J. Algorithms 24(2), 395\u2013420 (1997)","journal-title":"J. Algorithms"},{"key":"4_CR24","unstructured":"Dubois, O., Boufkhad, Y., Mandler, J.: Typical random 3-SAT formulae and the satisfiability threshold. Electron. Colloq. Comput. Complex. (ECCC) 10(007) (2003)"},{"issue":"1","key":"4_CR25","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/0166-218X(83)90017-3","volume":"5","author":"J Franco","year":"1983","unstructured":"Franco, J., Paull, M.C.: Probabilistic analysis of the Davis Putnam procedure for solving the satisfiability problem. Discrete Appl. Math. 5(1), 77\u201387 (1983)","journal-title":"Discrete Appl. Math."},{"issue":"4","key":"4_CR26","first-page":"1017","volume":"12","author":"E Friedgut","year":"1999","unstructured":"Friedgut, E.: Sharp thresholds of graph properties, and the $$k$$ -SAT problem. J. ACM 12(4), 1017\u20131054 (1999)","journal-title":"J. ACM"},{"key":"4_CR27","unstructured":"Friedrich, T., Krohmer, A., Rothenberger, R., Sauerwald, T., Sutton, A.M.: Bounds on the satisfiability threshold for power law distributed random SAT. In: 25th Annual European Symposium on Algorithms, ESA 2017, Vienna, Austria, 4\u20136 September 2017, pp. 37:1\u201337:15 (2017)"},{"key":"4_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/978-3-319-94144-8_17","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2018","author":"T Friedrich","year":"2018","unstructured":"Friedrich, T., Rothenberger, R.: Sharpness of the satisfiability threshold for non-uniform random k-SAT. In: Beyersdorff, O., Wintersteiger, C.M. (eds.) SAT 2018. LNCS, vol. 10929, pp. 273\u2013291. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-94144-8_17"},{"issue":"C","key":"4_CR29","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/j.artint.2016.06.001","volume":"238","author":"J Gir\u00e1ldez-Cru","year":"2016","unstructured":"Gir\u00e1ldez-Cru, J., Levy, J.: Generating SAT instances with community structure. Artif. Intell. 238(C), 119\u2013134 (2016)","journal-title":"Artif. Intell."},{"issue":"3","key":"4_CR30","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1006\/jcss.1996.0081","volume":"53","author":"A Goerdt","year":"1996","unstructured":"Goerdt, A.: A threshold for unsatisfiability. J. Comput. Syst. Sci. 53(3), 469\u2013486 (1996)","journal-title":"J. Comput. Syst. Sci."},{"issue":"4","key":"4_CR31","doi-asserted-by":"publisher","first-page":"444","DOI":"10.1002\/rsa.20104","volume":"28","author":"AC Kaporis","year":"2006","unstructured":"Kaporis, A.C., Kirousis, L.M., Lalas, E.G.: The probabilistic analysis of a greedy satisfiability algorithm. Random Struct. Algorithms 28(4), 444\u2013480 (2006)","journal-title":"Random Struct. Algorithms"},{"key":"4_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1007\/978-3-540-27798-9_2","volume-title":"Computing and Combinatorics","author":"JH Kim","year":"2004","unstructured":"Kim, J.H.: The Poisson cloning model for random graphs, random directed graphs and random k-SAT problems. In: Chwa, K.-Y., Munro, J.I.J. (eds.) COCOON 2004. LNCS, vol. 3106, p. 2. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-27798-9_2"},{"issue":"3","key":"4_CR33","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1002\/(SICI)1098-2418(199805)12:3<253::AID-RSA3>3.0.CO;2-U","volume":"12","author":"LM Kirousis","year":"1998","unstructured":"Kirousis, L.M., Kranakis, E., Krizanc, D., Stamatiou, Y.C.: Approximating the unsatisfiability threshold of random formulas. Random Struct. Algorithms 12(3), 253\u2013269 (1998)","journal-title":"Random Struct. Algorithms"},{"key":"4_CR34","doi-asserted-by":"crossref","unstructured":"Krioukov, D.V., Papadopoulos, F., Kitsak, M., Vahdat, A., Bogu\u00f1\u00e1, M.: Hyperbolic geometry of complex networks. CoRR abs\/1006.5169 (2010)","DOI":"10.1103\/PhysRevE.82.036106"},{"issue":"25","key":"4_CR35","doi-asserted-by":"publisher","first-page":"10318","DOI":"10.1073\/pnas.0703685104","volume":"104","author":"F Krzaka\u0142a","year":"2007","unstructured":"Krzaka\u0142a, F., Montanari, A., Ricci-Tersenghi, F., Semerjian, G., Zdeborov\u00e1, L.: Gibbs states and the set of solutions of random constraint satisfaction problems. PNAS 104(25), 10318\u201310323 (2007)","journal-title":"PNAS"},{"issue":"5582","key":"4_CR36","doi-asserted-by":"publisher","first-page":"812","DOI":"10.1126\/science.1073287","volume":"297","author":"M M\u00e9zard","year":"2002","unstructured":"M\u00e9zard, M., Parisi, G., Zecchina, R.: Analytic and algorithmic solution of random satisfiability problems. Science 297(5582), 812\u2013815 (2002)","journal-title":"Science"},{"issue":"5","key":"4_CR37","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1080\/00107510500052444","volume":"46","author":"M Newman","year":"2005","unstructured":"Newman, M.: Power laws, Pareto distributions and Zipf\u2019s law. Contemp. Phys. 46(5), 323\u2013351 (2005)","journal-title":"Contemp. Phys."},{"key":"4_CR38","unstructured":"Omelchenko, O., Bulatov, A.: Concentration inequalities for sums of random variables, each having power bounded tails (2018). https:\/\/arxiv.org\/abs\/1903.02529"},{"issue":"1\u20132","key":"4_CR39","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/0004-3702(95)00045-3","volume":"81","author":"B Selman","year":"1996","unstructured":"Selman, B., Mitchell, D.G., Levesque, H.J.: Generating hard satisfiability problems. Artif. Intell. 81(1\u20132), 17\u201329 (1996)","journal-title":"Artif. Intell."},{"issue":"1\u20132","key":"4_CR40","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/S0304-3975(01)00156-6","volume":"265","author":"WF Vega de la","year":"2001","unstructured":"de la Vega, W.F.: Random 2-SAT: results and problems. Theor. Comput. Sci. 265(1\u20132), 131\u2013146 (2001)","journal-title":"Theor. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Satisfiability Testing \u2013 SAT 2019"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-24258-9_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,17]],"date-time":"2023-09-17T21:21:19Z","timestamp":1694985679000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-24258-9_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030242572","9783030242589"],"references-count":40,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-24258-9_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"29 June 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SAT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Theory and Applications of Satisfiability Testing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Lisbon","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portugal","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 July 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 July 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sat2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/sat2019.tecnico.ulisboa.pt\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"64","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"19","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"7","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"30% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"6","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}