{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T07:41:07Z","timestamp":1767339667598,"version":"3.40.3"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031221040"},{"type":"electronic","value":"9783031221057"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[[2022]]},"DOI":"10.1007\/978-3-031-22105-7_15","type":"book-chapter","created":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T05:12:32Z","timestamp":1672549952000},"page":"162-176","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Refutation of\u00a0Spectral Graph Theory Conjectures with\u00a0Monte Carlo Search"],"prefix":"10.1007","author":[{"given":"Milo","family":"Roucairol","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tristan","family":"Cazenave","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,1,1]]},"reference":[{"key":"15_CR1","doi-asserted-by":"publisher","unstructured":"Aouchiche, M., Hansen, P.: A survey of automated conjectures in spectral graph theory. Linear Algebra Appl. 432(9), 2293\u20132322 (2010). https:\/\/doi.org\/10.1016\/j.laa.2009.06.015. https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0024379509003061","DOI":"10.1016\/j.laa.2009.06.015"},{"key":"15_CR2","doi-asserted-by":"publisher","unstructured":"Aouchiche, M., Hansen, P.: Proximity, remoteness and distance eigenvalues of a graph. Discret. Appl. Math. 213, 17\u201325 (2016). https:\/\/doi.org\/10.1016\/j.dam.2016.04.031. https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0166218X16302037","DOI":"10.1016\/j.dam.2016.04.031"},{"key":"15_CR3","doi-asserted-by":"crossref","unstructured":"Bouzy, B.: Monte-Carlo fork search for cooperative path-finding. In: Computer Games Workshop at IJCAI, pp. 1\u201315 (2013)","DOI":"10.1007\/978-3-319-05428-5_1"},{"key":"15_CR4","doi-asserted-by":"crossref","unstructured":"Bouzy, B.: Burnt pancake problem: new lower bounds on the diameter and new experimental optimality ratios. In: SOCS, pp. 119\u2013120 (2016)","DOI":"10.1609\/socs.v7i1.18398"},{"issue":"1","key":"15_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TCIAIG.2012.2186810","volume":"4","author":"C Browne","year":"2012","unstructured":"Browne, C., et al.: A survey of Monte Carlo tree search methods. IEEE Trans. Comput. Intell. AI Games 4(1), 1\u201343 (2012). https:\/\/doi.org\/10.1109\/TCIAIG.2012.2186810","journal-title":"IEEE Trans. Comput. Intell. AI Games"},{"key":"15_CR6","doi-asserted-by":"crossref","unstructured":"Cazenave, T.: Nested Monte-Carlo search. In: Boutilier, C. (ed.) IJCAI, pp. 456\u2013461 (2009)","DOI":"10.1109\/IPDPS.2009.5161122"},{"key":"15_CR7","doi-asserted-by":"crossref","unstructured":"Cazenave, T., Saffidine, A., Schofield, M.J., Thielscher, M.: Nested Monte Carlo search for two-player games. In: AAAI, pp. 687\u2013693 (2016)","DOI":"10.1609\/aaai.v30i1.10073"},{"key":"15_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1007\/978-3-642-34413-8_4","volume-title":"Learning and Intelligent Optimization","author":"T Cazenave","year":"2012","unstructured":"Cazenave, T., Teytaud, F.: Application of the nested rollout policy adaptation algorithm to the traveling salesman problem with time windows. In: Hamadi, Y., Schoenauer, M. (eds.) LION 2012. LNCS, pp. 42\u201354. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-34413-8_4"},{"key":"15_CR9","doi-asserted-by":"publisher","unstructured":"Collins, K.L.: On a conjecture of Graham and Lov\u00e1sz about distance matrices. Discret. Appl. Math. 25(1), 27\u201335 (1989). https:\/\/doi.org\/10.1016\/0166-218X(89)90044-9. https:\/\/www.sciencedirect.com\/science\/article\/pii\/0166218X89900449","DOI":"10.1016\/0166-218X(89)90044-9"},{"key":"15_CR10","unstructured":"Delavina, E.: Some history of the development of Graffiti. In: DIMACS Series in Discrete Mathematics and Theoretical Computer Science 69: Graphs and Discovery, pp. 81\u2013118 (2005)"},{"key":"15_CR11","doi-asserted-by":"crossref","unstructured":"Doran, J.E., Michie, D.: Experiments with the graph traverser program. Proc. R. Soc. Lond. Series A. Math. Phys. Sci. 294(1437), 235\u2013259 (1966)","DOI":"10.1098\/rspa.1966.0205"},{"key":"15_CR12","doi-asserted-by":"crossref","unstructured":"Edelkamp, S., Gath, M., Cazenave, T., Teytaud, F.: Algorithm and knowledge engineering for the TSPTW problem. In: 2013 IEEE Symposium on Computational Intelligence in Scheduling (SCIS), pp. 44\u201351. IEEE (2013)","DOI":"10.1109\/SCIS.2013.6613251"},{"key":"15_CR13","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":"15_CR14","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/978-3-319-11206-0_28","volume-title":"KI 2014: Advances in Artificial Intelligence","author":"S Edelkamp","year":"2014","unstructured":"Edelkamp, S., Gath, M., Rohde, M.: Monte-Carlo tree search for 3D packing with object orientation. In: Lutz, C., Thielscher, M. (eds.) KI 2014. LNCS (LNAI), vol. 8736, pp. 285\u2013296. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-11206-0_28"},{"key":"15_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 (CIG), pp. 1\u20138. IEEE (2014)","DOI":"10.1109\/CIG.2014.6932882"},{"key":"15_CR16","doi-asserted-by":"crossref","unstructured":"Edelkamp, S., Tang, Z.: Monte-Carlo tree search for the multiple sequence alignment problem. In: Proceedings of the Eighth Annual Symposium on Combinatorial Search, SOCS 2015, pp. 9\u201317. AAAI Press (2015)","DOI":"10.1609\/socs.v6i1.18359"},{"key":"15_CR17","unstructured":"Finnsson, H., Bj\u00f6rnsson, Y.: Simulation-based approach to general game playing. In: AAAI, vol. 8, pp. 259\u2013264 (2008)"},{"key":"15_CR18","doi-asserted-by":"publisher","unstructured":"Hansen, P., Caporossi, G.: AutoGraphiX: an automated system for finding conjectures in graph theory. Electron. Notes Discret. Math. 5, 158\u2013161 (2000). https:\/\/doi.org\/10.1016\/S1571-0653(05)80151-9. https:\/\/www.sciencedirect.com\/science\/article\/pii\/S1571065305801519","DOI":"10.1016\/S1571-0653(05)80151-9"},{"key":"15_CR19","doi-asserted-by":"publisher","unstructured":"Holcomb, S.D., Porter, W.K., Ault, S.V., Mao, G., Wang, J.: Overview on DeepMind and its AlphaGo zero AI. In: Proceedings of the 2018 International Conference on Big Data and Education, Honolulu, HI, USA, pp. 67\u201371. ACM (2018). https:\/\/doi.org\/10.1145\/3206157.3206174. https:\/\/dl.acm.org\/doi\/10.1145\/3206157.3206174","DOI":"10.1145\/3206157.3206174"},{"issue":"4","key":"15_CR20","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":"15_CR21","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":"15_CR22","doi-asserted-by":"crossref","unstructured":"Poulding, S.M., Feldt, R.: Generating structured test data with specific properties using nested Monte-Carlo search. In: GECCO, pp. 1279\u20131286 (2014)","DOI":"10.1145\/2576768.2598339"},{"key":"15_CR23","doi-asserted-by":"crossref","unstructured":"Poulding, S.M., Feldt, R.: Heuristic model checking using a Monte-Carlo tree search algorithm. In: GECCO, pp. 1359\u20131366 (2015)","DOI":"10.1145\/2739480.2754767"},{"key":"15_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1007\/978-3-642-20520-0_51","volume-title":"Applications of Evolutionary Computation","author":"A Rimmel","year":"2011","unstructured":"Rimmel, A., Teytaud, F., Cazenave, T.: Optimization of the nested Monte-Carlo algorithm on the traveling salesman problem with time windows. In: Di Chio, C., et al. (eds.) EvoApplications 2011. LNCS, vol. 6625, pp. 501\u2013510. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-20520-0_51"},{"key":"15_CR25","unstructured":"Rosin, C.D.: Nested rollout policy adaptation for Monte Carlo Tree Search. In: IJCAI 2011, Proceedings of the 22nd International Joint Conference on Artificial Intelligence, pp. 649\u2013654 (2011)"},{"key":"15_CR26","unstructured":"Wagner, A.Z.: Constructions in combinatorics via neural networks. arXiv:2104.14516 [cs, math] (2021)"},{"issue":"3","key":"15_CR27","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/BF00992698","volume":"8","author":"CJCH Watkins","year":"1992","unstructured":"Watkins, C.J.C.H., Dayan, P.: Q-learning. Mach. Learn. 8(3), 279\u2013292 (1992). https:\/\/doi.org\/10.1007\/BF00992698","journal-title":"Mach. Learn."}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-22105-7_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,30]],"date-time":"2023-03-30T22:04:23Z","timestamp":1680213863000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-22105-7_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031221040","9783031221057"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-22105-7_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"1 January 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOON","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computing and Combinatorics Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Shenzhen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 October 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 October 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cocoon-conference.org\/2022\/","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":"EquinOCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"101","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":"39","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":"12","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":"39% - 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":"5","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)"}}]}}