{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,2]],"date-time":"2025-12-02T14:34:05Z","timestamp":1764686045302,"version":"3.46.0"},"reference-count":43,"publisher":"Springer Science and Business Media LLC","issue":"11","license":[{"start":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T00:00:00Z","timestamp":1759276800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T00:00:00Z","timestamp":1759276800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100021856","name":"Ministero dell\u2019Universit\u00e0 e della Ricerca","doi-asserted-by":"publisher","award":["FSE REACT-EU, PON Ricerca e Innovazione 2014-2020","PRIN project GRAFIA, the MURExcellence Department Project MatMod@TOV awarded to the Department of Mathematics, University of Rome Tor Vergata, CUP E83C18000100006"],"award-info":[{"award-number":["FSE REACT-EU, PON Ricerca e Innovazione 2014-2020","PRIN project GRAFIA, the MURExcellence Department Project MatMod@TOV awarded to the Department of Mathematics, University of Rome Tor Vergata, CUP E83C18000100006"]}],"id":[{"id":"10.13039\/501100021856","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100012740","name":"Gruppo Nazionale per l\u2019Analisi Matematica, la Probabilit\u00e0 e le loro Applicazioni","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100012740","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100010661","name":"Horizon 2020 Framework Programme","doi-asserted-by":"publisher","award":["EU Horizon 2020: G.A.\\ 871042 SoBig-Data++, NextGenEU - PNRR-PEAI (M4C2, investment 1.3) FAIR and \u201cSoBigData.it\u201d"],"award-info":[{"award-number":["EU Horizon 2020: G.A.\\ 871042 SoBig-Data++, NextGenEU - PNRR-PEAI (M4C2, investment 1.3) FAIR and \u201cSoBigData.it\u201d"]}],"id":[{"id":"10.13039\/100010661","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100016973","name":"Gruppo Nazionale per le Strutture Algebriche, Geometriche e le loro Applicazioni","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100016973","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Mach Learn"],"published-print":{"date-parts":[[2025,11]]},"DOI":"10.1007\/s10994-025-06890-2","type":"journal-article","created":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T01:31:50Z","timestamp":1759282310000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Analyzing RL components for Wagner\u2019s framework via Brouwer\u2019s conjecture"],"prefix":"10.1007","volume":"114","author":[{"given":"Flora","family":"Angileri","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giulia","family":"Lombardi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrea","family":"Fois","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Renato","family":"Faraone","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carlo","family":"Metta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michele","family":"Salvi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luigi Amedeo","family":"Bianchi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marco","family":"Fantozzi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Silvia Giulia","family":"Galfr\u00e8","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniele","family":"Pavesi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maurizio","family":"Parton","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Francesco","family":"Morandin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,10,1]]},"reference":[{"key":"6890_CR1","unstructured":"Amato, G., Amelio, A., Caroprese, L., Chiacchiaretta, P., Fioravanti, F., Ippoliti, L., Meo, M. C., Monaco, G., Morbidoni, C., Moscardelli, L., Parton, M., Scozzari, F. (2024). AI for sustainability: Research at Ud\u2019A node. In CEUR workshop proceedings (Vol. 3762, pp. 494\u2013498)."},{"key":"6890_CR2","doi-asserted-by":"publisher","unstructured":"Angileri, F., Lombardi, G., Fois, A., Faraone, R., Metta, C., Salvi, M., Bianchi, L. A., Fantozzi, M., Galfr\u00e8, S. G., Pavesi, D., Parton, M., Morandin, F. (2025). A systematization of the Wagner framework: Graph theory conjectures and reinforcement learning. In Lecture notes in computer science 15243 LNAI (pp. 325\u2013338). https:\/\/doi.org\/10.1007\/978-3-031-78977-9_21","DOI":"10.1007\/978-3-031-78977-9_21"},{"issue":"8","key":"6890_CR3","doi-asserted-by":"publisher","first-page":"4463","DOI":"10.1090\/S0002-9947-2011-05393-6","volume":"363","author":"H Bai","year":"2011","unstructured":"Bai, H. (2011). The grone-merris conjecture. Transactions of the American Mathematical Society, 363(8), 4463\u20134474. https:\/\/doi.org\/10.1090\/S0002-9947-2011-05393-6","journal-title":"Transactions of the American Mathematical Society"},{"key":"6890_CR4","volume-title":"Three problems in algebraic combinatorics","author":"J Berndsen","year":"2012","unstructured":"Berndsen, J., & Blokhuis, A. (2012). Three problems in algebraic combinatorics. Disserta\u00e7\u00e3o de Mestrado: Eindhoven University of Technology."},{"key":"6890_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-1939-6","author":"AE Brouwer","year":"2012","unstructured":"Brouwer, A. E., & Haemers, W. H. (2012). Spectra of graphs. https:\/\/doi.org\/10.1007\/978-1-4614-1939-6","journal-title":"Spectra of graphs."},{"key":"6890_CR6","unstructured":"Charton, F., Ellenberg, J. S., Wagner, A. Z., & Williamson, G. (2024). PatternBoost: Constructions in mathematics with a little help from AI. https:\/\/arxiv.org\/abs\/2411.00566"},{"key":"6890_CR8","doi-asserted-by":"crossref","unstructured":"Chen, X. (2019). On Brouwer\u2019s conjecture for the sum of k largest Laplacian eigenvalues of graphs. Linear Algebra and its Applications, 578, 402\u2013410.","DOI":"10.1016\/j.laa.2019.05.029"},{"key":"6890_CR9","doi-asserted-by":"crossref","unstructured":"Davies, A., Gupta, P., Racaniere, S., Swirszcz, G., Wagner, A. Z., Weber, T., & Williamson, G. (2025). Drums of high width. https:\/\/arxiv.org\/abs\/2503.09919","DOI":"10.1112\/plms.70031"},{"issue":"7887","key":"6890_CR10","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1038\/s41586-021-04086-x","volume":"600","author":"A Davies","year":"2021","unstructured":"Davies, A., Velickovic, P., Buesing, L., Blackwell, S., Zheng, D., Toma\u0161ev, N., Tanburn, R., Battaglia, P., Blundell, C., Juh\u00e1sz, A., Lackenby, M., Williamson, G., Hassabis, D., Kohli, P. (2021). Advancing mathematics by guiding human intuition with AI. Nature, 600(7887), 70\u201374. https:\/\/doi.org\/10.1038\/s41586-021-04086-x","journal-title":"Nature"},{"key":"6890_CR11","doi-asserted-by":"publisher","unstructured":"Di\u00a0Cecco, A., Metta, C., Fantozzi, M., Morandin, F., Parton, M. (2024). GloNets: Globally connected neural networks. In IDA 2024. Lecture notes in computer science (Vol. 14641, pp. 53\u201364). https:\/\/doi.org\/10.1007\/978-3-031-58547-0_5","DOI":"10.1007\/978-3-031-58547-0_5"},{"key":"6890_CR12","doi-asserted-by":"publisher","unstructured":"Di\u00a0Cecco, A., Papini, A., Metta, C., Fantozzi, M., Galfr\u00e8, S. G., Morandin, F., Parton, M. (2025a). SwitchPath: Enhancing exploration in neural networks learning dynamics. In Lecture notes in computer science 15243 LNAI (pp. 275\u2013291). https:\/\/doi.org\/10.1007\/978-3-031-78977-9_18","DOI":"10.1007\/978-3-031-78977-9_18"},{"key":"6890_CR44","doi-asserted-by":"publisher","unstructured":"Di Cecco, A., Papini, A., Metta, C., Fantozzi, M., Galfr\u00e8, S. G., Morandin, F., Parton, M. (2025b). Exploration and generalization in deeplearning with SwitchPath activations. Machine Learning, 114(9), 200. https:\/\/doi.org\/10.1007\/s10994-025-06840-y","DOI":"10.1007\/s10994-025-06840-y"},{"issue":"9","key":"6890_CR13","doi-asserted-by":"publisher","first-page":"3672","DOI":"10.1016\/j.laa.2012.01.007","volume":"436","author":"Z Du","year":"2012","unstructured":"Du, Z., & Zhou, B. (2012). Upper bounds for the sum of laplacian eigenvalues of graphs. Linear Algebra and its Applications, 436(9), 3672\u20133683. https:\/\/doi.org\/10.1016\/j.laa.2012.01.007","journal-title":"Linear Algebra and its Applications"},{"key":"6890_CR14","unstructured":"Fey, M., & Lenssen, J. E. (2019). Fast graph representation learning with PyTorch geometric. arXiv PreprintarXiv:1903.02428"},{"key":"6890_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.laa.2019.11.020","volume":"588","author":"HA Ganie","year":"2020","unstructured":"Ganie, H. A., Pirzada, S., Rather, B. A., & Trevisan, V. (2020). Further developments on brouwer\u2019s conjecture for the sum of laplacian eigenvalues of graphs. Linear Algebra and its Applications, 588, 1\u201318.","journal-title":"Linear Algebra and its Applications"},{"key":"6890_CR16","unstructured":"Ghebleh, M., Al-Yakoob, S., Kanso, A., & Stevanovi\u0107, D. (2024a). Reinforcement learning for graph theory, I. Reimplementation of Wagner\u2019s approach. https:\/\/arxiv.org\/abs\/2403.18429"},{"key":"6890_CR17","unstructured":"Ghebleh, M., Al-Yakoob, S., Kanso, A., & Stevanovi\u0107, D. (2024b). Reinforcement learning for graph theory, II. Small Ramsey numbers. https:\/\/arxiv.org\/abs\/2403.20055"},{"key":"6890_CR18","doi-asserted-by":"crossref","unstructured":"Gladkov, N., Pak, I., & Zimin, A. (2024). The bunkbed conjecture is false. https:\/\/arxiv.org\/abs\/2410.02545","DOI":"10.1073\/pnas.2420725122"},{"key":"6890_CR19","doi-asserted-by":"publisher","unstructured":"Godsil, C., & Royle, G. F. (2001). Algebraic graph theory. Graduate texts in mathematics (Vol. 207). https:\/\/doi.org\/10.1007\/978-1-4613-0163-9","DOI":"10.1007\/978-1-4613-0163-9"},{"issue":"9","key":"6890_CR20","doi-asserted-by":"publisher","first-page":"2214","DOI":"10.1016\/j.laa.2009.03.038","volume":"432","author":"WH Haemers","year":"2010","unstructured":"Haemers, W. H., Mohammadian, A., & Tayfeh-Rezaie, B. (2010). On the sum of laplacian eigenvalues of graphs. Linear Algebra and its Applications, 432(9), 2214\u20132221. https:\/\/doi.org\/10.1016\/j.laa.2009.03.038","journal-title":"Linear Algebra and its Applications"},{"key":"6890_CR21","unstructured":"Hamilton, W. L., Ying, Z., & Leskovec, J. (2017). Inductive representation learning on large graphs. In NeurIPS (pp. 1024\u20131034)."},{"key":"6890_CR22","unstructured":"Hu, W., Liu, B., Gomes, J., Zitnik, M., Liang, P., Pande, V., Leskovec, J. (2020). Strategies for pre-training graph neural networks. In International conference on learning representations. https:\/\/openreview.net\/forum?id=HJlWWJSFDH"},{"key":"6890_CR23","unstructured":"Kipf, T. N., & Welling, M. (2016). Semi-supervised classification with graph convolutional networks. arXiv PreprintarXiv:1609.02907"},{"key":"6890_CR24","doi-asserted-by":"publisher","unstructured":"Mehrabian, A., Anand, A., Kim, H., Sonnerat, N., Balog, M., Comanici, G., Berariu, T., Lee, A., Ruoss, A., Bulanova, A., Toyama, D., Blackwell, S., Paredes, B. R., Veli\u010dkovi\u0107, P., Orseau, L., Lee, J., Naredla, A. M., Precup, D., Wagner, A. Z. (2024). Finding increasingly large extremal graphs with AlphaZero and Tabu search. In IJCAI-24 (pp. 6985\u20136993). https:\/\/doi.org\/10.24963\/ijcai.2024\/772","DOI":"10.24963\/ijcai.2024\/772"},{"key":"6890_CR25","doi-asserted-by":"publisher","unstructured":"Metta, C., Fantozzi, M., Papini, A., Amato, G., Bergamaschi, M., Galfr\u00e8, S. G., Marchetti, A., Vegli\u00f2, M., Parton, M., Morandin, F. (2024). Increasing biases can be more efficient than increasing weights. In IEEE\/CVF, winter conference on applications of computer vision WACV (pp. 2798\u20132807). https:\/\/doi.org\/10.1109\/WACV57701.2024.00279","DOI":"10.1109\/WACV57701.2024.00279"},{"key":"6890_CR26","doi-asserted-by":"publisher","unstructured":"Metta, C., Fantozzi, M., Papini, A., Amato, G., Bergamaschi, M., Andrea, F., Galfr\u00e8, S. G., Marchetti, A., Vegli\u00f2, M., Parton, M., Morandin, F. (2025). Increasing biases can be more efficient than increasing weights. Advances in Data Analysis and Classification. https:\/\/doi.org\/10.1007\/s11634-025-00649-2","DOI":"10.1007\/s11634-025-00649-2"},{"key":"6890_CR27","doi-asserted-by":"crossref","unstructured":"Parczyk, O., Pokutta, S., Spiegel, C., & Szab\u00f3, T. (2024). New Ramsey multiplicity bounds and search heuristics. Foundations of Computational Mathematics.","DOI":"10.1007\/s10208-024-09675-6"},{"key":"6890_CR28","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1016\/j.laa.2020.03.019","volume":"597","author":"I Rocha","year":"2020","unstructured":"Rocha, I. (2020). Brouwer\u2019s conjecture holds asymptotically almost surely. Linear Algebra and its Applications, 597, 198\u2013205. https:\/\/doi.org\/10.1016\/j.laa.2020.03.019","journal-title":"Linear Algebra and its Applications"},{"key":"6890_CR29","doi-asserted-by":"crossref","unstructured":"Roucairol, M., & Cazenave, T. (2022). Refutation of spectral graph theory conjectures with Monte Carlo Search. In Computing and combinatorics (pp. 162\u2013176).","DOI":"10.1007\/978-3-031-22105-7_15"},{"key":"6890_CR30","unstructured":"Roucairol, M., & Cazenave, T. (2024). Refutation of spectral graph theory conjectures with search algorithms. https:\/\/arxiv.org\/abs\/2409.18626"},{"key":"6890_CR31","unstructured":"Schulman, J., Wolski, F., Dhariwal, P., Radford, A., & Klimov, O. (2017). Proximal policy optimization algorithms. CoRRarXiv:1707.06347"},{"key":"6890_CR32","unstructured":"Stevanovi\u0107, \u0110., Damnjanovi\u0107, I., & Stevanovi\u0107, D. (2021). Finding counterexamples for a conjecture of Akbari, Alazemi and An\u0111eli\u0107. https:\/\/arxiv.org\/abs\/2111.15303"},{"key":"6890_CR33","unstructured":"Swirszcz, G., & Wagner, A. Z., Williamson, G.,  Blackwell, S., Georgiev, B., Davies, A., Eslami, A., Racaniere, S., Weber, T., Kohli, P. (2025). Advancing geometry with AI: Multi-agent generation of polytopes. https:\/\/arxiv.org\/abs\/2502.05199"},{"key":"6890_CR34","unstructured":"Tao, T. (2025a). Machine-assisted proofs. Simons Foundation \/ American Mathematical Society. AMS Presidential Address. https:\/\/www.simonsfoundation.org\/event\/machine-assisted-proofs\/"},{"key":"6890_CR35","unstructured":"Tao, T. (2025b). Machine-assisted proof. In Notices of the American Mathematical Society (Vol. 72) (pp 6\u201313) https:\/\/www.ams.org\/\/journals\/notices\/202501\/noti3041\/noti3041.html"},{"key":"6890_CR36","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1016\/j.laa.2023.12.019","volume":"685","author":"GS Torres","year":"2024","unstructured":"Torres, G. S., & Trevisan, V. (2024). Brouwer\u2019s conjecture for the cartesian product of graphs. Linear Algebra and its Applications, 685, 66\u201376.","journal-title":"Linear Algebra and its Applications"},{"key":"6890_CR37","unstructured":"Velickovic, P., Cucurull, G., Casanova, A., Romero, A., Li\u00f2, P., & Bengio, Y. (2018). Graph attention networks. In ICLR"},{"key":"6890_CR38","unstructured":"Vito, V., & Stefanus, L. Y. (2023). Adaptive Monte Carlo search for conjecture refutation in graph theory. https:\/\/arxiv.org\/abs\/2306.07956"},{"key":"6890_CR39","unstructured":"Vott, S., & Lehavi, A. M. (2023). RamseyRL: A framework for intelligent Ramsey number counterexample searching. https:\/\/arxiv.org\/abs\/2308.11943"},{"key":"6890_CR40","unstructured":"Wagner, A. Z. (2021). Constructions in combinatorics via neural networks. https:\/\/arxiv.org\/abs\/2104.14516"},{"key":"6890_CR41","unstructured":"Xu, K., Hu, W., Leskovec, J., & Jegelka, S. (2019). How powerful are graph neural networks? In ICLR. https:\/\/openreview.net\/forum?id=ryGs6iA5Km"},{"key":"6890_CR42","unstructured":"Xu, K., Li, C., Tian, Y.,  Sonobe, T., Kawarabayashi, K., Jegelka, S. (2018). Representation learning on graphs with jumping knowledge networks. In ICML-18 (pp. 5453\u20135462). https:\/\/proceedings.mlr.press\/v80\/xu18c.html"},{"key":"6890_CR43","unstructured":"Zhang, X. D. (2011). The Laplacian eigenvalues of a graph: A survey. https:\/\/arxiv.org\/abs\/1111.2897"}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-025-06890-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10994-025-06890-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-025-06890-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,2]],"date-time":"2025-12-02T14:30:16Z","timestamp":1764685816000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10994-025-06890-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,1]]},"references-count":43,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2025,11]]}},"alternative-id":["6890"],"URL":"https:\/\/doi.org\/10.1007\/s10994-025-06890-2","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"type":"print","value":"0885-6125"},{"type":"electronic","value":"1573-0565"}],"subject":[],"published":{"date-parts":[[2025,10,1]]},"assertion":[{"value":"3 April 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 July 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 September 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 October 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"242"}}