{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,8]],"date-time":"2026-07-08T14:20:17Z","timestamp":1783520417072,"version":"3.55.0"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032107589","type":"print"},{"value":"9783032107596","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,11,24]],"date-time":"2025-11-24T00:00:00Z","timestamp":1763942400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,11,24]],"date-time":"2025-11-24T00:00:00Z","timestamp":1763942400000},"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":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-10759-6_18","type":"book-chapter","created":{"date-parts":[[2025,11,23]],"date-time":"2025-11-23T19:22:24Z","timestamp":1763925744000},"page":"284-293","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Kolmogorov Complexity Based Analysis of\u00a0the\u00a0Zeros Distribution in\u00a0Locally Maximal Satisfying Truth Assignments of\u00a0Random K-SAT Formulas"],"prefix":"10.1007","author":[{"given":"V.","family":"Liagkou","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"P.\u00a0E.","family":"Nastou","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"P.","family":"Spirakis","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Y.\u00a0C.","family":"Stamatiou","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,11,24]]},"reference":[{"key":"18_CR1","doi-asserted-by":"crossref","unstructured":"Achlioptas, D..: Lower bounds for random 3-SAT via differential equations. Theor. Comput. Sci. 265, 159\u2013185 (2001)","DOI":"10.1016\/S0304-3975(01)00159-1"},{"key":"18_CR2","doi-asserted-by":"crossref","unstructured":"Achlioptas, D.: Setting two variables at a time yields a new lower bound for random 3-SAT, In: Proceedings of STOC 2000,pp. 28\u201337 (ACM, 2000)","DOI":"10.1145\/335305.335309"},{"issue":"7","key":"18_CR3","first-page":"1431","volume":"23","author":"H Antonopoulou","year":"2020","unstructured":"Antonopoulou, H.: Kolmogorov complexity based upper bounds for the unsatisfiability threshold of random K-SAT. J. Discrete Math. Sci. Crypt. 23(7), 1431\u20131438 (2020)","journal-title":"J. Discrete Math. Sci. Crypt."},{"key":"18_CR4","doi-asserted-by":"crossref","unstructured":"Biere, A., Heule, M.\u00a0J.\u00a0H., van, H., Maaren, T.: Walsh.: Handbook of Satisfiability, 2nd edn., IOS Press, F. Artifi. Intell. Appl. 336 (2021)","DOI":"10.3233\/FAIA336"},{"key":"18_CR5","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1145\/321356.321363","volume":"13","author":"GH Chaitin","year":"1966","unstructured":"Chaitin, G.H.: On the length of programs for computing finite binary sequences. J. ACM 13, 547\u2013570 (1966)","journal-title":"J. ACM"},{"key":"18_CR6","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1002\/rsa.20015","volume":"24","author":"D Coppersmith","year":"2004","unstructured":"Coppersmith, D., Gamarnik, D., Hajiaghayi, M.T., Sorkin, G.: Random Max SAT, Random Max Cut, and their phase transitions. Random Struct. Algorithms 24, 502\u2013545 (2004)","journal-title":"Random Struct. Algorithms"},{"key":"18_CR7","unstructured":"Diaz, J., Kirousis, L., Mitsche, D., Perez-Gimenez, X.: A new upper bound for 3-SAT. In: FSTTCS 2008 (2008)"},{"key":"18_CR8","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1006\/jagm.1997.0867","volume":"24","author":"O Dubois","year":"1997","unstructured":"Dubois, O., Boufkhad, Y.: A general upper bound for the satisfiability threshold of random $$r$$-SAT. J. Algorithms 24, 395\u2013420 (1997)","journal-title":"J. Algorithms"},{"key":"18_CR9","unstructured":"Eder, J., Scholl, C.: SAT-based analysis of block-cipher structures. In: SAT 2015 (LNCS 9340),pp. 160\u2013177 (2015)"},{"key":"18_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/978-3-540-79719-7_7","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2008","author":"T Eibach","year":"2008","unstructured":"Eibach, T., Pilz, E., V\u00f6lkel, G.: Attacking Bivium Using SAT Solvers. In: Kleine B\u00fcning, H., Zhao, X. (eds.) SAT 2008. LNCS, vol. 4996, pp. 63\u201376. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-79719-7_7"},{"key":"18_CR11","doi-asserted-by":"crossref","unstructured":"Friedgut, E., J. Bourgain.: Sharp thresholds of graph properties, and the $$k$$-SAT problem. J. Amer. Math. Soc.12, 1017\u20131054 (1999)","DOI":"10.1090\/S0894-0347-99-00305-7"},{"key":"18_CR12","doi-asserted-by":"publisher","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. Algorithms 17, 103\u2013116 (2000)","journal-title":"Random Struct. Algorithms"},{"key":"18_CR13","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1002\/rsa.3240070105","volume":"7","author":"A Kamath","year":"1995","unstructured":"Kamath, A., Motwani, R., Palem, K., Spirakis, P.: Tail bounds for occupancy and the satisfiability threshold conjecture. Random Struc. Algorithms 7, 59\u201380 (1995)","journal-title":"Random Struc. Algorithms"},{"key":"18_CR14","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 Struc. Algorithms 12, 253\u2013269 (1998)","journal-title":"Random Struc. Algorithms"},{"key":"18_CR15","unstructured":"Kolmogorov, A.\u00a0N.: Three approaches to the concept of the amount of information. Probl. Inf. Trans. 1(1) (1965)"},{"key":"18_CR16","doi-asserted-by":"crossref","unstructured":"Li, M., Vitanyi, P.: An introduction to kolmogorov complexity and its applications, 3rd edn., Springer (2008)","DOI":"10.1007\/978-0-387-49820-1"},{"key":"18_CR17","unstructured":"Massacci, F., Marraro, A.: Logical cryptanalysis of DES. In: CADE 2000 (LNCS 1831),pp. 374\u2013388 (2000)"},{"issue":"1","key":"18_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0019-9958(64)90223-2","volume":"7","author":"RJ Solomonoff","year":"1964","unstructured":"Solomonoff, R.J.: A formal theory of inductive inference. Inf. Control 7(1), 1\u201322 (1964)","journal-title":"Inf. Control"},{"key":"18_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1007\/978-3-642-02777-2_24","volume-title":"Theory and Applications of Satisfiability Testing - SAT 2009","author":"M Soos","year":"2009","unstructured":"Soos, M., Nohl, K., Castelluccia, C.: Extending SAT Solvers to Cryptographic Problems. In: Kullmann, O. (ed.) SAT 2009. LNCS, vol. 5584, pp. 244\u2013257. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-02777-2_24"},{"key":"18_CR20","unstructured":"Spirakis, P., Stamatiou, Y.\u00a0C.: Kolmogorov complexity arguments in propositional logic. In: Proceeding 7th Panhellenic Logic Symposium (PLS07) (2009)"},{"key":"18_CR21","doi-asserted-by":"crossref","unstructured":"Tseitin, G.\u00a0S.: On the complexity of derivation in propositional calculus. In: Automation of Reasoning: Classical Papers on Computational Logic, Vol.\u00a02, Springer, pp. 466\u2013483 (1983)","DOI":"10.1007\/978-3-642-81955-1_28"}],"container-title":["Lecture Notes in Computer Science","Cyber Security, Cryptology, and Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-10759-6_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,8]],"date-time":"2026-07-08T13:44:13Z","timestamp":1783518253000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-10759-6_18"}},"subtitle":["(Short Paper)"],"short-title":[],"issued":{"date-parts":[[2025,11,24]]},"ISBN":["9783032107589","9783032107596"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-10759-6_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,11,24]]},"assertion":[{"value":"24 November 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CSCML","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Cyber Security, Cryptology, and Machine Learning","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Be'er Sheva","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Israel","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 December 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 December 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cscml2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.cscml.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}