{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T02:05:10Z","timestamp":1767319510158,"version":"3.48.0"},"publisher-location":"Cham","reference-count":33,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032091550","type":"print"},{"value":"9783032091567","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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-09156-7_4","type":"book-chapter","created":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T02:01:31Z","timestamp":1767319291000},"page":"52-63","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Automated Refutation with\u00a0Monte Carlo Search of\u00a0Graph Theory Conjectures on\u00a0the\u00a0Maximum Laplacian Eigenvalue"],"prefix":"10.1007","author":[{"given":"Liora","family":"Taieb","sequence":"first","affiliation":[]},{"given":"Milo","family":"Roucairol","sequence":"additional","affiliation":[]},{"given":"Tristan","family":"Cazenave","sequence":"additional","affiliation":[]},{"given":"Ararat","family":"Harutyunyan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,1,2]]},"reference":[{"key":"4_CR1","unstructured":"Latest version of \u201cwritten on the wall\u201d (2012). https:\/\/independencenumber.wordpress.com\/wp-content\/uploads\/2012\/08\/wow-july2004.pdf"},{"key":"4_CR2","unstructured":"Al-Yakoob, S., Ghebleh, M., Kanso, A., Stevanovic, D.: Reinforcement learning for graph theory, i. reimplementation of Wagner\u2019s approach. arXiv preprint arXiv:2403.18429 (2024)"},{"key":"4_CR3","unstructured":"Angileri, F., et al.: A systematization of the Wagner framework: graph theory conjectures and reinforcement learning. arXiv preprint arXiv:2406.12667 (2024)"},{"issue":"9","key":"4_CR4","doi-asserted-by":"publisher","first-page":"2293","DOI":"10.1016\/j.laa.2009.06.015","volume":"432","author":"M Aouchiche","year":"2010","unstructured":"Aouchiche, M., Hansen, P.: A survey of automated conjectures in spectral graph theory. Linear Algebra Appl. 432(9), 2293\u20132322 (2010)","journal-title":"Linear Algebra Appl."},{"issue":"2\u20133","key":"4_CR5","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1016\/j.laa.2005.10.017","volume":"414","author":"V Brankov","year":"2006","unstructured":"Brankov, V., Hansen, P., Stevanovi\u0107, D.: Automated conjectures on upper bounds for the largest Laplacian eigenvalue of graphs. Linear Algebra Appl. 414(2\u20133), 407\u2013424 (2006)","journal-title":"Linear Algebra Appl."},{"issue":"1","key":"4_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TCIAIG.2012.2186810","volume":"4","author":"CB Browne","year":"2012","unstructured":"Browne, C.B., et al.: A survey of Monte Carlo tree search methods. IEEE Trans. Comput. Intell. AI Games 4(1), 1\u201343 (2012)","journal-title":"IEEE Trans. Comput. Intell. AI Games"},{"key":"4_CR7","doi-asserted-by":"crossref","unstructured":"Cazenave, T.: Nested Monte-Carlo search. In: Twenty-First International Joint Conference on Artificial Intelligence (2009)","DOI":"10.1109\/IPDPS.2009.5161122"},{"key":"4_CR8","unstructured":"Cazenave, T.: Generalized rapid action value estimation. In: 24th International Conference on Artificial Intelligence, pp. 754\u2013760 (2015)"},{"key":"4_CR9","series-title":"Communications in Computer and Information Science","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1007\/978-3-319-57969-6_4","volume-title":"Computer Games","author":"T Cazenave","year":"2017","unstructured":"Cazenave, T.: Nested rollout policy adaptation with selective policies. In: Cazenave, T., Winands, M.H.M., Edelkamp, S., Schiffel, S., Thielscher, M., Togelius, J. (eds.) CGW\/GIGA -2016. CCIS, vol. 705, pp. 44\u201356. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-57969-6_4"},{"key":"4_CR10","series-title":"Communications in Computer and Information Science","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1007\/978-3-030-89453-5_8","volume-title":"Monte Carlo Search","author":"T Cazenave","year":"2021","unstructured":"Cazenave, T., Negrevergne, B., Sikora, F.: Monte Carlo graph coloring. In: Cazenave, T., Teytaud, O., Winands, M.H.M. (eds.) MCS 2020. CCIS, vol. 1379, pp. 100\u2013115. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-89453-5_8"},{"key":"4_CR11","unstructured":"Cvetkovi\u0107, D., Simi\u0107, S.: Graph theoretical results obtained by the support of the expert system \u201cgraph\u201d. Bulletin (Acad\u00e9mie serbe des sciences et des arts. Classe des sciences math\u00e9matiques et naturelles. Sciences math\u00e9matiques), pp. 19\u201341 (1994)"},{"key":"4_CR12","unstructured":"DeLaVina, E.: Some history of the development of graffiti. In: DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol.\u00a069, p.\u00a081 (2005)"},{"issue":"2","key":"4_CR13","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/S0747-7171(89)80048-3","volume":"7","author":"RD Dutton","year":"1989","unstructured":"Dutton, R.D., Brigham, R.C., Gomez, F.: Ingrid: a graph invariant manipulator. J. Symb. Comput. 7(2), 163\u2013177 (1989)","journal-title":"J. Symb. Comput."},{"key":"4_CR14","series-title":"Lecture Notes in Logistics","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1007\/978-3-319-21266-1_28","volume-title":"Commercial Transport","author":"S Edelkamp","year":"2016","unstructured":"Edelkamp, S., Gath, M., Greulich, C., Humann, M., Herzog, O., Lawo, M.: Monte-Carlo tree search for logistics. In: Clausen, U., Friedrich, H., Thaller, C., Geiger, C. (eds.) Commercial Transport. LNL, pp. 427\u2013440. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-21266-1_28"},{"key":"4_CR15","doi-asserted-by":"crossref","unstructured":"Edelkamp, S., Greulich, C.: Solving physical traveling salesman problems with policy adaptation. In: 2014 IEEE Conference on Computational Intelligence and Games, pp.\u00a01\u20138. IEEE (2014)","DOI":"10.1109\/CIG.2014.6932882"},{"key":"4_CR16","doi-asserted-by":"publisher","unstructured":"Singh, G.B.: Multiple sequence alignment. In: Singh, G.B. (ed.) Fundamentals of Bioinformatics and Computational Biology. MOST, vol. 6, pp. 143\u2013158. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-11403-3_7","DOI":"10.1007\/978-3-319-11403-3_7"},{"key":"4_CR17","unstructured":"Edelkamp, S., Externest, E., K\u00fchl, S., Kuske, S.: Solving graph optimization problems in a framework for Monte-Carlo search. In: Tenth Annual Symposium on Combinatorial Search (2017)"},{"key":"4_CR18","doi-asserted-by":"crossref","unstructured":"Ghebleh, M., Al-Yakoob, S., Kanso, A., Stevanovi\u0107, D.: Reinforcement learning for graph theory, ii. small ramsey numbers. arXiv preprint arXiv:2403.20055 (2024)","DOI":"10.26493\/2590-9770.1788.8af"},{"key":"4_CR19","unstructured":"Hansen, N.: The CMA evolution strategy: a tutorial. arXiv preprint arXiv:1604.00772 (2016)"},{"key":"4_CR20","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1016\/S1571-0653(05)80151-9","volume":"5","author":"P Hansen","year":"2000","unstructured":"Hansen, P., Caporossi, G.: Autographix: an automated system for finding conjectures in graph theory. Electron. Notes Discret. Math. 5, 158\u2013161 (2000)","journal-title":"Electron. Notes Discret. Math."},{"issue":"4","key":"4_CR21","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/BF02239976","volume":"39","author":"A Hertz","year":"1987","unstructured":"Hertz, A., de Werra, D.: Using Tabu search techniques for graph coloring. Computing 39(4), 345\u2013351 (1987)","journal-title":"Computing"},{"key":"4_CR22","unstructured":"Khalil, E., Dai, H., Zhang, Y., Dilkina, B., Song, L.: Learning combinatorial optimization algorithms over graphs. In: Advances in Neural Information Processing Systems, vol. 30 (2017)"},{"key":"4_CR23","doi-asserted-by":"crossref","unstructured":"Lidick\u00fd, B., McKinley, G., Pfender, F.: Small Ramsey numbers for books, wheels, and generalizations. arXiv preprint arXiv:2407.07285 (2024)","DOI":"10.37236\/13577"},{"key":"4_CR24","unstructured":"Liu, L., Ning, B.: Unsolved problems in spectral graph theory. arXiv preprint arXiv:2305.10290 (2023)"},{"key":"4_CR25","doi-asserted-by":"crossref","unstructured":"Louren\u00e7o, H.R., Martin, O.C., St\u00fctzle, T.: Iterated local search: framework and applications. In: Handbook of metaheuristics, pp. 129\u2013168 (2019)","DOI":"10.1007\/978-3-319-91086-4_5"},{"key":"4_CR26","unstructured":"Mehrabian, A., et al.: Finding increasingly large extremal graphs with Alphazero and Tabu search. arXiv preprint arXiv:2311.03583 (2023)"},{"issue":"4","key":"4_CR27","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1109\/TCIAIG.2010.2088123","volume":"2","author":"J M\u00e9hat","year":"2010","unstructured":"M\u00e9hat, J., Cazenave, T.: Combining UCT and nested Monte Carlo search for single-player general game playing. IEEE Trans. Comput. Intell. AI Games 2(4), 271\u2013277 (2010)","journal-title":"IEEE Trans. Comput. Intell. AI Games"},{"key":"4_CR28","doi-asserted-by":"crossref","unstructured":"Portela, F.: An unexpectedly effective Monte Carlo technique for the RNA inverse folding problem. bioRxiv p. 345587 (2018)","DOI":"10.1101\/345587"},{"key":"4_CR29","unstructured":"Rosin, C.D.: Nested rollout policy adaptation for Monte Carlo tree search. In: IJCAI, vol.\u00a02011, pp. 649\u2013654 (2011)"},{"key":"4_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1007\/978-3-031-22105-7_15","volume-title":"Computing and Combinatorics - COCOON 2022","author":"M Roucairol","year":"2022","unstructured":"Roucairol, M., Cazenave, T.: Refutation of spectral graph theory conjectures with Monte Carlo search. In: Zhang, Y., Miao, D., M\u00f6hring, R. (eds.) COCOON 2022. LNCS, vol. 13595, pp. 162\u2013176. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-22105-7_15"},{"key":"4_CR31","unstructured":"Roucairol, M., Cazenave, T.: Refutation of spectral graph theory conjectures with search algorithms (2024). https:\/\/arxiv.org\/abs\/2409.18626"},{"issue":"7587","key":"4_CR32","doi-asserted-by":"publisher","first-page":"484","DOI":"10.1038\/nature16961","volume":"529","author":"D Silver","year":"2016","unstructured":"Silver, D., et al.: Mastering the game of go with deep neural networks and tree search. Nature 529(7587), 484\u2013489 (2016)","journal-title":"Nature"},{"key":"4_CR33","unstructured":"Wagner, A.Z.: Constructions in combinatorics via neural networks. arXiv preprint arXiv:2104.14516 (2021)"}],"container-title":["Lecture Notes in Computer Science","Learning and Intelligent Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-09156-7_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T02:01:33Z","timestamp":1767319293000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-09156-7_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032091550","9783032091567"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-09156-7_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"2 January 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LION","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Learning and Intelligent Optimization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Prague","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Czech Republic","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":"15 June 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 June 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"lion2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/lion19.org","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}