<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD Journal Publishing DTD v2.3 20070202//EN" "journalpublishing.dtd">
<article article-type="research-article" dtd-version="2.3" xml:lang="EN" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">
<front>
<journal-meta>
<journal-id journal-id-type="publisher-id">Front. Complex Syst.</journal-id>
<journal-title>Frontiers in Complex Systems</journal-title>
<abbrev-journal-title abbrev-type="pubmed">Front. Complex Syst.</abbrev-journal-title>
<issn pub-type="epub">2813-6187</issn>
<publisher>
<publisher-name>Frontiers Media S.A.</publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id pub-id-type="publisher-id">1604132</article-id>
<article-id pub-id-type="doi">10.3389/fcpxs.2025.1604132</article-id>
<article-categories>
<subj-group subj-group-type="heading">
<subject>Complex Systems</subject>
<subj-group>
<subject>Hypothesis and Theory</subject>
</subj-group>
</subj-group>
</article-categories>
<title-group>
<article-title>Exploring interconnections among atoms, brain, society, and cosmos with network science and explainable machine learning</article-title>
<alt-title alt-title-type="left-running-head">Caligiore et al.</alt-title>
<alt-title alt-title-type="right-running-head">
<ext-link ext-link-type="uri" xlink:href="https://doi.org/10.3389/fcpxs.2025.1604132">10.3389/fcpxs.2025.1604132</ext-link>
</alt-title>
</title-group>
<contrib-group>
<contrib contrib-type="author" corresp="yes">
<name>
<surname>Caligiore</surname>
<given-names>Daniele</given-names>
</name>
<xref ref-type="aff" rid="aff1">
<sup>1</sup>
</xref>
<xref ref-type="aff" rid="aff2">
<sup>2</sup>
</xref>
<xref ref-type="corresp" rid="c001">&#x2a;</xref>
<uri xlink:href="https://loop.frontiersin.org/people/12517/overview"/>
<role content-type="https://credit.niso.org/contributor-roles/conceptualization/"/>
<role content-type="https://credit.niso.org/contributor-roles/formal-analysis/"/>
<role content-type="https://credit.niso.org/contributor-roles/investigation/"/>
<role content-type="https://credit.niso.org/contributor-roles/methodology/"/>
<role content-type="https://credit.niso.org/contributor-roles/project-administration/"/>
<role content-type="https://credit.niso.org/contributor-roles/resources/"/>
<role content-type="https://credit.niso.org/contributor-roles/supervision/"/>
<role content-type="https://credit.niso.org/contributor-roles/validation/"/>
<role content-type="https://credit.niso.org/contributor-roles/visualization/"/>
<role content-type="https://credit.niso.org/contributor-roles/writing-original-draft/"/>
<role content-type="https://credit.niso.org/contributor-roles/Writing - review &#x26; editing/"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname>Monreale</surname>
<given-names>Anna</given-names>
</name>
<xref ref-type="aff" rid="aff3">
<sup>3</sup>
</xref>
<xref ref-type="aff" rid="aff4">
<sup>4</sup>
</xref>
<uri xlink:href="https://loop.frontiersin.org/people/1157434/overview"/>
<role content-type="https://credit.niso.org/contributor-roles/validation/"/>
<role content-type="https://credit.niso.org/contributor-roles/Writing - review &#x26; editing/"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname>Rossetti</surname>
<given-names>Giulio</given-names>
</name>
<xref ref-type="aff" rid="aff3">
<sup>3</sup>
</xref>
<uri xlink:href="https://loop.frontiersin.org/people/1945780/overview"/>
<role content-type="https://credit.niso.org/contributor-roles/validation/"/>
<role content-type="https://credit.niso.org/contributor-roles/Writing - review &#x26; editing/"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname>Bongiorno</surname>
<given-names>Angela</given-names>
</name>
<xref ref-type="aff" rid="aff5">
<sup>5</sup>
</xref>
<uri xlink:href="https://loop.frontiersin.org/people/472981/overview"/>
<role content-type="https://credit.niso.org/contributor-roles/validation/"/>
<role content-type="https://credit.niso.org/contributor-roles/Writing - review &#x26; editing/"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname>Fisicaro</surname>
<given-names>Giuseppe</given-names>
</name>
<xref ref-type="aff" rid="aff6">
<sup>6</sup>
</xref>
<uri xlink:href="https://loop.frontiersin.org/people/3023768/overview"/>
<role content-type="https://credit.niso.org/contributor-roles/resources/"/>
<role content-type="https://credit.niso.org/contributor-roles/validation/"/>
<role content-type="https://credit.niso.org/contributor-roles/Writing - review &#x26; editing/"/>
</contrib>
</contrib-group>
<aff id="aff1">
<sup>1</sup>
<institution>Computational and Translational Neuroscience Laboratory</institution>, <institution>Institute of Cognitive Sciences and Technologies</institution>, <institution>National Research Council (CTNLab-ISTC-CNR)</institution>, <addr-line>Rome</addr-line>, <country>Italy</country>
</aff>
<aff id="aff2">
<sup>2</sup>
<institution>AI2Life s.r.l.</institution>, <institution>Innovative Start-Up, ISTC-CNR Spin-Off</institution>, <addr-line>Rome</addr-line>, <country>Italy</country>
</aff>
<aff id="aff3">
<sup>3</sup>
<institution>Institute of Information Science and Technologies &#x201c;Alessandro Faedo&#x201d;</institution>, <institution>CNR Research Area in Pisa</institution>, <addr-line>Pisa</addr-line>, <country>Italy</country>
</aff>
<aff id="aff4">
<sup>4</sup>
<institution>Computer Science Department</institution>, <institution>University of Pisa</institution>, <addr-line>Pisa</addr-line>, <country>Italy</country>
</aff>
<aff id="aff5">
<sup>5</sup>
<institution>Italian National Institute for Astrophysics</institution>, <addr-line>Rome</addr-line>, <country>Italy</country>
</aff>
<aff id="aff6">
<sup>6</sup>
<institution>Institute for Microelectronics and Microsystems</institution>, <institution>National Research Council (IMM-CNR)</institution>, <addr-line>Catania</addr-line>, <country>Italy</country>
</aff>
<author-notes>
<fn fn-type="edited-by">
<p>
<bold>Edited by:</bold> <ext-link ext-link-type="uri" xlink:href="https://loop.frontiersin.org/people/2051677/overview">Panos Argyrakis</ext-link>, Aristotle University of Thessaloniki, Greece</p>
</fn>
<fn fn-type="edited-by">
<p>
<bold>Reviewed by:</bold> <ext-link ext-link-type="uri" xlink:href="https://loop.frontiersin.org/people/2323206/overview">Sabina Rossi</ext-link>, Ca&#x2019; Foscari University of Venice, Italy</p>
<p>
<ext-link ext-link-type="uri" xlink:href="https://loop.frontiersin.org/people/2582344/overview">Ioannis P. Antoniades</ext-link>, Aristotle University of Thessaloniki, Greece</p>
</fn>
<corresp id="c001">&#x2a;Correspondence: Daniele Caligiore, <email>daniele.caligiore@istc.cnr.it</email>
</corresp>
</author-notes>
<pub-date pub-type="epub">
<day>30</day>
<month>06</month>
<year>2025</year>
</pub-date>
<pub-date pub-type="collection">
<year>2025</year>
</pub-date>
<volume>3</volume>
<elocation-id>1604132</elocation-id>
<history>
<date date-type="received">
<day>01</day>
<month>04</month>
<year>2025</year>
</date>
<date date-type="accepted">
<day>18</day>
<month>06</month>
<year>2025</year>
</date>
</history>
<permissions>
<copyright-statement>Copyright &#xa9; 2025 Caligiore, Monreale, Rossetti, Bongiorno and Fisicaro.</copyright-statement>
<copyright-year>2025</copyright-year>
<copyright-holder>Caligiore, Monreale, Rossetti, Bongiorno and Fisicaro</copyright-holder>
<license xlink:href="http://creativecommons.org/licenses/by/4.0/">
<p>This is an open-access article distributed under the terms of the Creative Commons Attribution License (CC BY). The use, distribution or reproduction in other forums is permitted, provided the original author(s) and the copyright owner(s) are credited and that the original publication in this journal is cited, in accordance with accepted academic practice. No use, distribution or reproduction is permitted which does not comply with these terms.</p>
</license>
</permissions>
<abstract>
<p>This paper presents a methodology combining Network Science (NS) and Explainable Machine Learning (XML) that could hypothetically uncover shared principles across seemingly disparate scientific domains. As an example, it presents how the approach could be applied to four fields: materials science, neuroscience, social science, and cosmology. The study focuses on criticality, a phenomenon associated with the transition of complex systems between states, characterized by sudden and significant behavioral shifts. By proposing a five-step methodology&#x2014;ranging from relational data collection to cross-domain analysis with XML&#x2014;the paper offers a hypothetical framework for potentially identifying criticality-related features in these fields and transferring insights across disciplines. The results of domains cross-fertilization could support practical applications, such as improving neuroprosthetics and brain-machine interfaces by leveraging criticality in materials science and neuroscience or developing advanced materials for space exploration. The parallels between neural and social networks could deepen our understanding of human behavior, while studying cosmic and social systems may reveal shared dynamics in large-scale, interconnected structures. A key benefit could be the possibility of using transfer learning, that is XML models trained in one domain might be adapted for use in another with limited data. For instance, if common aspects of criticality in neuroscience and cosmology are identified, an algorithm trained on brain data could be repurposed to detect critical states in cosmic systems, even with limited cosmic data. This interdisciplinary approach advances theoretical frameworks and fosters practical innovations, laying the groundwork for future research that could transform our understanding of complex systems across diverse scientific fields.</p>
</abstract>
<kwd-group>
<kwd>artificial intelligence</kwd>
<kwd>complex systems</kwd>
<kwd>criticality</kwd>
<kwd>cross-domain knowledge transfer</kwd>
<kwd>interdisciplinary approaches to complex systems</kwd>
<kwd>phase transitions</kwd>
<kwd>shared principles across scientific disciplines</kwd>
<kwd>theory of everything</kwd>
</kwd-group>
<custom-meta-wrap>
<custom-meta>
<meta-name>section-at-acceptance</meta-name>
<meta-value>Complex Systems Theory</meta-value>
</custom-meta>
</custom-meta-wrap>
</article-meta>
</front>
<body>
<sec id="s1">
<title>1 Introduction</title>
<p>
<italic>&#x201c;Things are linked by invisible ties, you cannot pick a flower without disturbing a star.&#x201d;</italic> &#x2013; Galileo Galilei.</p>
<p>Throughout the centuries, humanity has consistently sought to find connections between various phenomena to uncover underlying universal principles. This desire for cohesion has driven scientific research and philosophical reflection, with historical examples such as the ancient Greeks&#x2019; interest in the arch&#xe9; and Newton&#x2019;s laws unifying celestial and terrestrial motion. The search for a &#x201c;theory of everything&#x201d; in physics represents the latest effort to unite all the fundamental forces and particles of the universe into a single formulation (<xref ref-type="bibr" rid="B49">Hawking, 2006</xref>; <xref ref-type="bibr" rid="B53">Huang et al., 2018</xref>; <xref ref-type="bibr" rid="B59">Kirk et al., 1983</xref>; <xref ref-type="bibr" rid="B101">Wilson, 1999</xref>).</p>
<p>Despite the desire to uncover unifying principles, progress in this area has been limited, primarily due to the lack of adequate theoretical and computational tools (<xref ref-type="bibr" rid="B52">Holland, 1995</xref>; <xref ref-type="bibr" rid="B70">Mitchell, 2009</xref>). However, in recent decades, significant changes have occurred. The rise of interdisciplinary collaboration across scientific fields has fostered a powerful synergy, advancing innovative theoretical frameworks and computational methodologies. The complex systems approach, central to this development, focuses on understanding the interactions and emergent behaviors of system components rather than isolating them (<xref ref-type="bibr" rid="B76">Parisi, 1999</xref>; <xref ref-type="bibr" rid="B63">Ladyman et al., 2013</xref>; <xref ref-type="bibr" rid="B33">Estrada, 2024</xref>). This contrasts with the reductionist method, which seeks to explain phenomena by breaking them down into their smallest parts. While reductionism excels in studying individual components, the complex systems approach abstracts fundamental principles governing diverse systems, regardless of context, providing deeper and more unified models (<xref ref-type="bibr" rid="B30">Denning, 2017</xref>; <xref ref-type="bibr" rid="B104">Zorzo et al., 2024</xref>).</p>
<p>In this scenario, two foundational tools - network science (NS) and machine learning (ML) - have the potential, when effectively integrated, to significantly advance the discovery of shared principles across diverse domains. NS focuses on studying complex systems modeled as networks, which consist of nodes (representing entities or elements) and edges (representing the connections or relationships between nodes). This framework allows us to analyze the structure, dynamics, and behavior of interconnected systems across various fields. By representing entities and their interactions as nodes and edges, network science enables researchers to apply graph theory to reveal common patterns and principles that transcend individual disciplines (<xref ref-type="bibr" rid="B54">I&#xf1;iguez et al., 2020</xref>; <xref ref-type="bibr" rid="B29">Das and Soylu, 2023</xref>). For example, it has been applied across a wide range of domains&#x2014;including materials science, cosmology, social sciences, biology, and technology&#x2014;to analyze phenomena such as phase transitions, information flow, disease transmission, social dynamics, and technological innovation (<xref ref-type="bibr" rid="B79">Patel et al., 2024</xref>; <xref ref-type="bibr" rid="B26">Choudhary and DeCost, 2021</xref>; <xref ref-type="bibr" rid="B12">Batzner et al., 2022</xref>; <xref ref-type="bibr" rid="B5">Aroboto et al., 2023</xref>; <xref ref-type="bibr" rid="B11">Batatia et al., 2025</xref>; <xref ref-type="bibr" rid="B93">Strey et al., 2023</xref>; <xref ref-type="bibr" rid="B6">Artime et al., 2024</xref>; <xref ref-type="bibr" rid="B82">P&#xf3;sfai and Barab&#xe1;si, 2016</xref>; <xref ref-type="bibr" rid="B85">Rosato et al., 2008</xref>). ML is a key aspect of Artificial Intelligence (AI), enabling systems to perform tasks requiring human-like intelligence, such as learning and problem-solving. ML could help researchers to extract insights from diverse data, uncovering hidden patterns and potential universal principles across various fields. It enables the automated discovery of correlations, associations, and causal relationships, facilitating cross-domain comparisons (<xref ref-type="bibr" rid="B58">Khetani et al., 2023</xref>; <xref ref-type="bibr" rid="B67">Longo et al., 2024</xref>). This paper focuses on Explainable ML systems (XML) as they offer several key advantages, including greater transparency, enabling users to understand model decisions and build trust (<xref ref-type="bibr" rid="B3">Angelini et al., 2024</xref>; <xref ref-type="bibr" rid="B28">D&#x2019;Amore et al., 2024</xref>; <xref ref-type="bibr" rid="B55">Islam et al., 2022</xref>; <xref ref-type="bibr" rid="B66">Linardatos et al., 2020</xref>; <xref ref-type="bibr" rid="B47">Guidotti et al., 2019b</xref>; <xref ref-type="bibr" rid="B18">Bodria et al., 2023</xref>). XML ability to analyze <italic>feature importance</italic> is especially valuable for comparing different domains. NS and XML offer complementary approaches for studying shared principles across different domains through computer simulations and big data analytics. By integrating these methodologies, researchers can harness the strengths of each to address interdisciplinary challenges, uncover hidden patterns, and deepen our understanding of complex systems in science and beyond.</p>
<p>This article introduces a highly interdisciplinary methodological approach that, for the first time, combines NS and XML to explore the possibility of uncovering shared organizational and functional principles across scientific domains. As an example, it discusses how the methodology could be applied to four seemingly unrelated areas: atomic structures in materials science, neuroscience, social science, and cosmology. These four domains were chosen because they represent distinct yet fundamental scales of organization, ranging from the microscopic to the cosmic. By examining atomic structures, we gain insights into the fundamental building blocks of matter. Neuroscience allows us to explore complex biological systems and cognitive processes. Social science offers a lens into the behavior of human networks, while cosmology extends our understanding to the vast structures of the universe. Despite their differences, these domains could share underlying patterns and principles that reveal universal organizational dynamics, making them ideal for comparative analysis. The study focuses on criticality, a crucial concept for understanding how complex systems transition between states, why they exhibit sudden shifts in behavior, and how universal patterns emerge across different scales. Criticality, a phenomenon extensively studied, serves as a representative phenomenon for analyzing the dynamics of complex systems.</p>
<p>The integration of NS and XML could represent a significant methodological advancement, offering new insights into cross-domain similarities that have not been previously explored in the literature. By applying this approach, the paper seeks to go beyond existing studies and provide a deeper understanding of the fundamental organizational principles shared across these domains, thus offering both a fresh research perspective and new contributions to the field. The significance of our research lies in its potential to foster unprecedented collaboration across disciplinary boundaries, paving the way for innovative discoveries. A key advantage of identifying common principles across domains is the use of <italic>transfer learning</italic>, an ML technique that adapts models from one domain to another, reducing the need for extensive training data (<xref ref-type="bibr" rid="B75">Pan and Yang, 2009</xref>; <xref ref-type="bibr" rid="B100">Weiss et al., 2016</xref>). In cases where data collection is challenging, such as in the observation of cosmic phenomena, transfer learning can exploit similarities between complex systems to enhance the efficiency of training. The proposed approach could also offer practical benefits by advancing theoretical understanding and enabling cross-domain applications. Insights from one field can inspire breakthroughs in another. For example, connections between atomic structures and brain activity might lead to advanced neurotechnology materials, while parallels between social and cosmic networks could inform models of collective behavior, impacting fields like sociology and astrophysics.</p>
</sec>
<sec id="s2">
<title>2 Criticality across different domains</title>
<p>Criticality refers to continuous (second-order) phase transitions, where a system undergoes a smooth but profound change in state characterized by diverging correlation lengths, scale invariance, and critical fluctuations. This is distinct from first-order transitions, which involve abrupt changes and latent heat, such as melting or boiling. Criticality occurs across fields, such as in materials science, where, near critical temperature or pressure, small fluctuations can cause significant changes, such as the emergence of superconductivity or superfluidity, showcasing criticality role in material behavior (<xref ref-type="bibr" rid="B92">Stanley, 1971</xref>; <xref ref-type="bibr" rid="B73">Nishimori and Ortiz, 2011</xref>; <xref ref-type="bibr" rid="B80">Petrucci et al., 2017</xref>; <xref ref-type="bibr" rid="B77">Parisi et al., 2017</xref>; <xref ref-type="bibr" rid="B40">Fultz, 2020</xref>). In neuroscience, phase transitions occur in neural dynamics, such as shifts between unconscious and conscious states or non-REM and REM sleep (<xref ref-type="bibr" rid="B1">Allegrini et al., 2015</xref>). Criticality emerges when small disturbances in neural networks cause large-scale changes, driving cognitive or brain state shifts. Alterations in criticality, rather than its complete loss, are linked to neurodegenerative disorders, where deviations from optimal critical states disrupt brain function (<xref ref-type="bibr" rid="B14">Beggs and Plenz, 2003</xref>; <xref ref-type="bibr" rid="B13">Beggs, 2008</xref>; <xref ref-type="bibr" rid="B25">Chialvo, 2010</xref>). In social science, phase transitions occur during sudden societal shifts or market changes, such as rapid smartphone adoption or financial crises, where small fluctuations in behavior or confidence trigger large transformations (<xref ref-type="bibr" rid="B64">Levy, 2005</xref>; <xref ref-type="bibr" rid="B27">Contucci et al., 2008</xref>; <xref ref-type="bibr" rid="B39">Fukami and Nakajima, 2011</xref>). In cosmic science, phase transitions include events like the early universe cooling after the Big Bang or gas clouds collapsing into stars. Criticality is key in these processes, where small energy density fluctuations near critical points shape the universe&#x2019;s structure, influencing galaxy and star formation (<xref ref-type="bibr" rid="B43">Guardo et al., 2014</xref>; <xref ref-type="bibr" rid="B9">Barrow and Scherrer, 2018</xref>).</p>
<p>Criticality offers a powerful lens to explore interconnected phenomena across scales, from atoms to the brain, society, and the cosmos. It marks tipping points where systems undergo transformative changes, uncovering universal principles that govern complex behaviors. From atomic reorganization and neural shifts to societal changes and cosmic events, criticality shows how small fluctuations can trigger large-scale effects, revealing fundamental mechanisms that link diverse domains.</p>
</sec>
<sec id="s3">
<title>3 A five-steps computational method to study criticality across different domains</title>
<p>This section introduces a five-steps computational method for quantitatively analyzing the mechanisms governing criticality across materials science, neuroscience, social sciences, and cosmology. <xref ref-type="fig" rid="F1">Figure 1</xref> shows the proposed framework. The procedure is explained with theoretical and computational justifications for the choices made and examples illustrating its application to specific cases. While the method is applied to the case of criticality in this work, it is general and can be extended to investigate other shared phenomena.</p>
<fig id="F1" position="float">
<label>FIGURE 1</label>
<caption>
<p>Proposed framework to unveil shared and organizational principles among seemingly unrelated domains. The approach can be unpacked in five steps: 1) Collection of domain-specific relational data (represented by the database icons); 2) Data transformation into a neutral domain via graph representation (blue arrows and graph icons); 3) Data inspection and labeling; 4) Explainable Machine Learning (XML) and feature importance analysis using Graph Metrics (GM1, GM2, GM3); 5) Translating insights from the neutral domain back to specific domains through Transfer Learning (TL) (yellow arrows). GM1, GM2, and GM3 are illustrative examples of graph metrics; the actual number and identity of relevant metrics may vary depending on the domain and dataset.</p>
</caption>
<graphic xlink:href="fcpxs-03-1604132-g001.tif">
<alt-text content-type="machine-generated">Diagram illustrating the integration of network science and artificial intelligence with various scientific domains: neuroscience, cosmology, materials science, and social science. Arrows labeled &#x22;Graph&#x22; and &#x22;TL&#x22; indicate data flow between these fields and a central AI hub, which features icons for gears, XML, and bar graphs labeled &#x22;Feature Importance.&#x22; Each domain shows representative images: a brain, a cosmic scene, crystalline structures, and a social network map. The diagram highlights the role of AI in extracting insights across disciplines.</alt-text>
</graphic>
</fig>
<sec id="s3-1">
<title>3.1 Step one: collecting relational data</title>
<p>The first step involves gathering data that describes relationships between elements in each domain. Large-scale ML datasets from numerical simulations across various physical systems could be valuable for accelerating research and for supporting the creation of multi-disciplinary foundation models (<xref ref-type="bibr" rid="B74">Ohana et al., 2024</xref>; <xref ref-type="bibr" rid="B95">The Multimodal Universe Collaboration et al., 2025</xref>). In materials science, relational data refers to the network of atoms in a crystalline structure, where nodes represent atoms and links represent chemical bonds, essential for analyzing stability, mechanical properties, and material stress response (<xref ref-type="bibr" rid="B71">Mrdjenovich et al., 2020</xref>; <xref ref-type="bibr" rid="B89">Shi et al., 2024</xref>). In neuroscience, relational data could map the human connectome, where nodes are neurons and links are synapses, aiding the study of cognition and neurological disorders (<xref ref-type="bibr" rid="B91">Sporns, 2011</xref>; <xref ref-type="bibr" rid="B50">Heged&#x171;s and Grolmusz, 2025</xref>). In social sciences, it could capture connections within social networks, with nodes as people and links as interactions like friendships, useful for studying influence and group dynamics (<xref ref-type="bibr" rid="B86">Rossetti and Cazabet, 2018</xref>; <xref ref-type="bibr" rid="B35">Failla et al., 2024</xref>). In cosmology, relational data could describe the galaxy network, with nodes as galaxies and links as gravitational relationships, essential for understanding cosmic evolution (<xref ref-type="bibr" rid="B93">Strey et al., 2023</xref>; <xref ref-type="bibr" rid="B102">Zhou and Li, 2025</xref>).</p>
<p>Collecting relational data is crucial for comparing common phenomena across domains. One key benefit is tracking how interactions change over time (<xref ref-type="bibr" rid="B69">Milo et al., 2002</xref>) &#x2013; such as the evolution of crystal structures, brain synapses, social group dynamics, or galaxies. Relational data also help analyze system functionality by showing how interactions shape overall behavior (<xref ref-type="bibr" rid="B17">Boccaletti et al., 2006</xref>). Graphs could represent complex structures, allowing for quantitative analysis of nodes and connections. This approach is crucial for Step Two of the proposed method (see below), which involves representing data from various domains using a system neutral to the origin of the data. A neutral mathematical formalism, such as graphs, allows the application of common theories and algorithms to analyze and compare cross-domain phenomena, facilitating the identification of universal principles that govern interactions in complex systems. For example, neural networks in the brain may share properties similar to social networks and galaxy networks, such as the presence of hubs (highly connected nodes) and power-law distributions (<xref ref-type="bibr" rid="B82">P&#xf3;sfai and Barab&#xe1;si, 2016</xref>; <xref ref-type="bibr" rid="B97">Vazza and Feletti, 2020</xref>).</p>
</sec>
<sec id="s3-2">
<title>3.2 Step two: transforming specific domain data into a neutral domain</title>
<p>After collecting relational data from various domains, the next step is to represent this data using a neutral mathematical framework (blu arrows in <xref ref-type="fig" rid="F1">Figure 1</xref>). This abstract framework is independent of the specific contexts of materials science, neuroscience, social science, or cosmology, enabling a standardized approach that could facilitate comparison and analysis. Several computational approaches can transform data from different domains into a common neutral framework. For example, Bayesian networks model probabilistic dependencies to capture causal relationships in systems like synaptic connections or social interactions (<xref ref-type="bibr" rid="B37">Friedman and Koller, 2003</xref>; <xref ref-type="bibr" rid="B60">Koller and Friedman, 2009</xref>). Agent-based models simulate actions and interactions to study emergent phenomena, such as collective behavior or structure formation (<xref ref-type="bibr" rid="B19">Bonabeau, 2002</xref>). Time series analysis tracks how variables evolve in dynamic systems, predicting future values (<xref ref-type="bibr" rid="B38">Fu, 2011</xref>), while PCA reduces dimensionality to highlight key components in large datasets, useful in fields like genetics or neuroscience (<xref ref-type="bibr" rid="B42">Greenacre et al., 2022</xref>). Together, these techniques provide complementary insights into relational data.</p>
<p>These approaches are well-suited for representing data across domains in a neutral format. This article will focus on graphs, mathematical structures made of nodes (elements of the system) and connections (relations between them). There are several compelling reasons for using graphs (<xref ref-type="bibr" rid="B54">I&#xf1;iguez et al., 2020</xref>; <xref ref-type="bibr" rid="B29">Das and Soylu, 2023</xref>). A first advantage of using graphs is the availability of a vast range of well-established algorithms and tools for network analysis. These include algorithms for community detection, centrality measures, and pattern recognition. Graphs are also highly scalable and flexible, representing systems at varying scales-from atomic interactions in materials to networks of galaxies in the universe. This scalability makes them applicable to several scenarios, offering greater flexibility than other computational methods. Finally, graphical visualization of networks is particularly effective for exploring and interpreting complex structures, providing a significant advantage over methods such as time series analysis or principal component analysis, which can be less intuitive to visualize.</p>
<p>Graphs have indices that describe their structural and functional properties. For example, the degree indicates the number of edges connected to a vertex, while order and size refer to the total number of vertices and edges. The diameter measures the maximum distance between two vertices, and the radius measures the minimum distance from a vertex. The clustering coefficient quantifies vertex neighbor interconnectivity, while path length refers to the average distance between all pairs of vertices in the graph. Researchers analyze criticality in graphs using various metrics which are pivotal to understanding phase transitions (<xref ref-type="bibr" rid="B31">Dorogovtsev et al., 2008</xref>). For example, the degree distribution of critical graphs often follows a power-law, with a few hubs having many connections and most nodes few. This behavior is typical of scale-free networks, which remain resilient to random node removal but become vulnerable when hubs are lost (<xref ref-type="bibr" rid="B8">Barab&#xe1;si, 2009</xref>). <xref ref-type="fig" rid="F2">Figure 2</xref> illustrates the transformation of four domain-specific relational datasets into neutral domains through graph representations. This process provides a foundation for exploring shared aspects across the domains.</p>
<fig id="F2" position="float">
<label>FIGURE 2</label>
<caption>
<p>Transforming the four domain relational datasets (Step One, left) into their corresponding neutral domains using graph representations (Step Two, right). This transformation lays the groundwork for constructing a framework to explore common aspects across the different domains. The reduced thickness of the cross dividing the four domains in the neutral representation signifies the potential convergence in the study of them.</p>
</caption>
<graphic xlink:href="fcpxs-03-1604132-g002.tif">
<alt-text content-type="machine-generated">Please use the following text: Diagram illustrating the transformation of four domain-specific relational datasets (Step One, left) into neutral domain representations using graphs (Step Two, right). The thinner cross dividing the four neutral domains indicates potential convergence for studying shared features across these domains.</alt-text>
</graphic>
</fig>
</sec>
<sec id="s3-3">
<title>3.3 Step three: building datasets for training explainable machine learning with graph-based indices</title>
<p>This phase aims at constructing four datasets, each linking graph index values (graph metrics) from a given domain to two possible states: critical and non-critical. These datasets are used in the next stage to train a machine learning algorithm to classify graphs as either critical or non-critical based on their index values. Consider specific examples for each domain. In materials science, criticality refers to the point where a material experiences a drastic change in properties due to factors like temperature, pressure, or composition, as seen in phase transitions. For example, water solid-liquid and liquid-gas transitions near critical points (<xref ref-type="bibr" rid="B20">Bore and Paesani, 2023</xref>; <xref ref-type="bibr" rid="B24">Cheng et al., 2019</xref>). In superconducting materials, criticality occurs at the critical temperature, when a material transitions to a superconducting state (<xref ref-type="bibr" rid="B96">Tinkham, 2004</xref>; <xref ref-type="bibr" rid="B4">Annett, 2004</xref>; <xref ref-type="bibr" rid="B36">Flores-Livas et al., 2020</xref>). Data from atomistic configurations at critical and non-critical points can help construct graphs with indices reflecting these states. In neuroscience, criticality reflects proper brain function, while non-critical states are linked to pathological conditions (<xref ref-type="bibr" rid="B25">Chialvo, 2010</xref>; <xref ref-type="bibr" rid="B103">Zimmern, 2020a</xref>; <xref ref-type="bibr" rid="B88">Shi et al., 2022</xref>). Connectome data from healthy individuals represent a critical state, while data from neurodegenerative patients represent a non-critical state. Using data from healthy and diseased subjects, graphs can be constructed to represent critical and non-critical states, respectively. In social sciences, data from stable communities (critical state) and communities in crisis (non-critical state) generate graphs for analysis (<xref ref-type="bibr" rid="B64">Levy, 2005</xref>; <xref ref-type="bibr" rid="B27">Contucci et al., 2008</xref>; <xref ref-type="bibr" rid="B39">Fukami and Nakajima, 2011</xref>). Similarly, in cosmology, criticality relates to galaxy structures formation, while non-critical states represent equilibrium. Researchers can use observations of galaxy distribution in the extragalactic sky (<xref ref-type="bibr" rid="B34">Euclid Collaboration et al., 2024</xref>; <xref ref-type="bibr" rid="B2">Amendola et al., 2018</xref>) and set a critical density to distinguish the structures that will collapse (critical) from the one in equilibrium (non-critical) (<xref ref-type="bibr" rid="B61">Kravtsov and Borgani, 2012</xref>) and create corresponding graphs for further study. This approach allows us the creation of four datasets that associate the indices of graphs in a critical state with the label &#x201c;critical state&#x201d; and those in a non-critical state with the label &#x201c;non-critical state&#x201d; (<xref ref-type="fig" rid="F3">Figure 3</xref>).</p>
<fig id="F3" position="float">
<label>FIGURE 3</label>
<caption>
<p>Datasets for training explainable machine learning using graph-based index values (graph metrics). These datasets link graph indices in a critical state to the label &#x201c;Critical&#x201d; and those in a non-critical state to the label &#x201c;Non-Critical.&#x201d; The thinner cross dividing the four domain datasets (compared to the thickness shown in <xref ref-type="fig" rid="F2">Figure 2</xref>) highlights how the construction of these datasets represents a further step toward the potential convergence in the study of the four domains.</p>
</caption>
<graphic xlink:href="fcpxs-03-1604132-g003.tif">
<alt-text content-type="machine-generated">Please use the following text: Diagram showing datasets used for training explainable machine learning with graph-based metrics. Each dataset links graph indices labeled as &#x201c;Critical&#x201d; or &#x201c;Non-Critical.&#x201d; A thinner cross dividing the four domain datasets emphasizes this step toward convergence in studying the four domains.</alt-text>
</graphic>
</fig>
</sec>
<sec id="s3-4">
<title>3.4 Step four: comparing criticality-related features across domains with explainable machine learning</title>
<p>It is possible to train XML classifiers with supervised learning to determine whether a system is in a critical or non-critical state based on the values of the graph indices. Explainable techniques can identify the most relevant features for each domain to establish the criticality of a system (<xref ref-type="fig" rid="F4">Figure 4</xref>). Algorithms such as Extreme Gradient Boosting (XGBoost), known for its efficiency and accuracy in classification tasks, could be suitable for this purpose (<xref ref-type="bibr" rid="B23">Chen and Guestrin, 2016</xref>). SHAP (SHapley Additive exPlanations) values provide a robust and interpretable method for understanding feature importance, offering both global and local perspectives. While SHAP often provides a more complete picture, LIME (Local Interpretable Model-agnostic Explanations) is a valuable tool for specific use cases where its simplicity or particular visualization methods are preferred (<xref ref-type="bibr" rid="B84">Ribeiro et al., 2016</xref>; <xref ref-type="bibr" rid="B68">Lundberg and Lee, 2017</xref>).</p>
<fig id="F4" position="float">
<label>FIGURE 4</label>
<caption>
<p>Comparing graph criticality-related features across domains with XML. In <bold>(a)</bold>, four XML algorithms are applied to datasets obtained from Step Three, using graph-based index values (graph metrics) to train explainable models. The magnifying glass represents the use of explainable techniques like SHAP and LIME. The dashed cross dividing the four domains XML indicates how this step advances beyond Step Three, allowing comparisons across different domains. In <bold>(b)</bold>, an hypothetical feature importance analysis highlights the graph metrics that are most critical for identifying key states across different domains. In the provided example, &#x201c;Graph Metric 1&#x201d; is assumed to be a significant feature for determining criticality in both material science and cosmology.</p>
</caption>
<graphic xlink:href="fcpxs-03-1604132-g004.tif">
<alt-text content-type="machine-generated">Please use the following text: Diagram illustrating the comparison of graph criticality-related features across domains using explainable machine learning (XML). Panel (a) shows four XML algorithms applied to datasets from Step Three, with graph metrics used to train models. A magnifying glass symbolizes explainable methods like SHAP and LIME. A dashed cross divides the four domains, highlighting cross-domain comparison progress. Panel (b) depicts a hypothetical feature importance analysis, emphasizing &#x201c;Graph Metric 1&#x201c; as a key indicator of criticality in material science and cosmology.</alt-text>
</graphic>
</fig>
<p>In materials science, XGBoost could classify graphs representing materials state as critical or non-critical, with SHAP identifying key structural features (e.g., atomic arrangement) that are most important in determining these states. LIME could further explain the model decisions for each sample, highlighting local arrangements of atoms or relevant variations of particular physical quantities that contribute to a non-critical state. In neuroscience, XGBoost could classify graph data from connectome analysis, with SHAP values identifying the most relevant neural connections (graph features) that differentiate between healthy (critical state) and diseased (non-critical state) individuals. LIME provides detailed, local explanations for model predictions, showing which connections most strongly influence the critical state for individual subjects. In social sciences, XGBoost could distinguish between stable (critical state) and crisis (non-critical state) communities using social interaction graphs. SHAP values could reveal the most influential interactions, such as connection density or the centrality of nodes, in determining criticality. LIME could provide detailed insights into model predictions, pinpointing specific social relationships that drive either stability or crisis in a community. In cosmology, data on the distribution of galaxies in extragalactic surveys, e.g., Euclid (<xref ref-type="bibr" rid="B34">Euclid Collaboration et al., 2024</xref>) could be used. XGBoost could analyze graph indices related to these distributions to classify observations as critical or equilibrium. SHAP values would identify the features of these fluctuations or distributions that most strongly indicate critical phenomena, such as the Big Bang or galaxy formation. LIME could further explain individual observations, highlighting which aspects of dark matter distributions significantly influence the critical vs non-critical classification.</p>
<p>In each of these examples, the use of XML tools provides deeper insights into the fundamental characteristics that define whether a state is critical or non-critical across various scientific domains. Importantly, this approach facilitates comparisons of the most significant features among different domains, helping to identify potential similarities.</p>
<p>In more detail, after identifying the most important graph metrics (features) for determining criticality across the four domains, it is possible to compare the results to identify possible similar dynamics that define when a system is in a critical or non-critical state (<xref ref-type="fig" rid="F4">Figure 4b</xref>). This comparison can be done by studying feature correlations or analyzing causality. In the first approach, Correlational AI could identify statistical relationships between critical features across domains. However, correlation alone does not explain the direction or nature of these relationships. Causal AI goes beyond correlation to establish cause-and-effect links. Techniques such as causal inference and counterfactual reasoning clarify how changes in one variable directly impact another, providing deeper insights. These approaches complement each other. Correlational AI uncovers potential relationships, while Causal AI identifies the underlying causal mechanisms. This synergy proves valuable across domains, enabling the discovery of shared principles that drive criticality (<xref ref-type="bibr" rid="B72">Neuberg, 2003</xref>; <xref ref-type="bibr" rid="B98">Weinberg et al., 2024</xref>). For example, in neuroscience, Correlational AI might uncover relationships between neural connections and brain criticality, while in cosmology, it could reveal links between cosmic fluctuations and critical phenomena like structure formation. Causal AI can determine if similar causal mechanisms drive these transitions in both domains.</p>
</sec>
<sec id="s3-5">
<title>3.5 Step five: translating criticality insights from the neutral domain (graphs) to specific domains</title>
<p>This final step translates insights into the most important features for establishing criticality, derived from the neutral domain (graphs), into specific domains such as materials science, neuroscience, social sciences, and cosmology (orange arrows in <xref ref-type="fig" rid="F1">Figure 1</xref>). By mapping key graph features to domain-specific elements, abstract criticality analysis results are transformed into practical interpretations, leading to actionable conclusions. For example, graph features like centrality and clustering coefficient correspond to specific properties in the original dataset. Centrality identifies key nodes &#x2013; whether atoms in a crystal, neurons in a brain, people in a social network, or galaxies in a cosmic structure. The clustering coefficient reveals local interconnectedness, such as tightly bonded atoms, strongly connected neurons, close-knit social groups, or galaxy clusters. Mapping these graph metrics to domain-specific entities clarifies which metrics are critical for establishing domain-specific criticality. Linking these graph-based insights to domain-specific data bridges abstract analysis with real-world entities and their interactions. For example, if centrality is a key feature for determining criticality in neuroscience, neurons with high centrality may be crucial for cognitive processes, guiding interventions for neurodegenerative diseases. Similarly, if high connectivity between nodes is important for criticality in other domains, in materials science, central atoms with high connectivity may reveal key atomic bonds for material strength; in social sciences, individuals with high social centrality may be influential figures within a community; and in cosmology, central galaxies may offer insights into the gravitational dynamics of large-scale structures.</p>
</sec>
</sec>
<sec id="s4">
<title>4 Computational feasibility and technical considerations</title>
<p>The practical implementation of the proposed methodology involves several key technical aspects that warrant detailed discussion, particularly regarding the selection of graph metrics, the scalability of XML models, and the computational cost of transfer learning across domains.</p>
<sec id="s4-1">
<title>4.1 Selection criteria for graph metrics</title>
<p>Choosing appropriate graph metrics is fundamental for effective cross-domain analysis. To generate meaningful and comparable insights, the methodology emphasizes graph metrics that are interpretable and relevant across a broad range of disciplines&#x2014;such as, in our case, materials science, neuroscience, social science, and cosmology&#x2014;and suited to the specific phenomenon under investigation, which in our case is criticality. For example, key metrics could include clustering coefficient, average path length, degree distribution, and various centrality measures, all well supported by literature as markers of structural transitions near critical points (<xref ref-type="bibr" rid="B56">Jensen, 1998</xref>; <xref ref-type="bibr" rid="B16">Bigdeli et al., 2009</xref>; <xref ref-type="bibr" rid="B41">Gaur et al., 2019</xref>; <xref ref-type="bibr" rid="B103">Zimmern, 2020a</xref>; <xref ref-type="bibr" rid="B81">Ponti et al., 2021</xref>). Additional criteria guiding metric selection involve robustness to noise, the ability to discriminate between critical and non-critical states, computational efficiency on large-scale graphs, and empirical validation from previous studies within each domain. Furthermore, filtering out highly correlated metrics could improve XML performance while significantly reducing dataset dimensionality and computational overhead (see <xref ref-type="sec" rid="s4-2">Section. 4.2</xref>). Expert knowledge plays a crucial role in the initial selection of metrics to ensure domain-specific relevance and scientific coherence. Applying these criteria ensures the approach preserves interpretability and reliability while supporting scalable analysis.</p>
</sec>
<sec id="s4-2">
<title>4.2 Scalability of graph and XML models</title>
<p>Scalability plays a critical role when dealing with a large collection of graphs, each potentially containing thousands of nodes and edges. To manage this complexity, the methodology relies on efficient graph processing techniques that allow reliable extraction of structural features without incurring excessive computational costs. Handling numerous or intricate graphs may require optimization methods such as batching, parallel execution, or selective feature computation, yet these demands generally remain within the capabilities of standard computing resources. On the XML side, the analysis operates on a compact set of graph-derived metrics, keeping the input dimensionality low. This focus enables interpretable and computationally efficient modeling, even across large or diverse datasets. To address issues of missing or unreliable data, the framework can incorporate imputation techniques and uncertainty quantification methods, enhancing robustness and ensuring more reliable model predictions in the presence of noise or incomplete information (<xref ref-type="bibr" rid="B48">Gupta and Gupta, 2019</xref>; <xref ref-type="bibr" rid="B32">Emmanuel et al., 2021</xref>).</p>
</sec>
<sec id="s4-3">
<title>4.3 Computational cost of transfer learning</title>
<p>Transfer learning facilitates knowledge sharing between domains by fine-tuning pre-trained models on target domain data, reducing the need for extensive retraining. The computational overhead depends largely on the similarity between source and target domains and the size of the datasets involved (<xref ref-type="bibr" rid="B22">Caccia et al., 2023</xref>). To manage costs, the methodology incorporates selective fine-tuning focused on key graph metrics identified through feature importance analysis, limiting training time while preserving cross-domain generalization. Additionally, domain adaptation techniques such as careful fine-tuning schedules and feature alignment help maintain the relevance of learned representations across domains with differing data distributions. Moreover, since the data is represented as graphs, the models can isolate and reuse specific structural patterns learned from one domain when analyzing another. This modular reuse means that instead of retraining the entire model from scratch, only relevant components or features require adjustment. Such an approach reduces computational effort and accelerates learning during adaptation to new domains, enhancing overall efficiency.</p>
</sec>
</sec>
<sec id="s5">
<title>5 Exploiting cross-domain synergies</title>
<p>The proposed framework aims to generalize across disciplines, but a brief comparison with traditional methods used in each example domain helps clarify its distinct contribution. In materials science, conventional studies of phase transitions often rely on atomistic simulations&#x2014;such as molecular dynamics or Monte Carlo methods&#x2014;or thermodynamic models. While these offer high-fidelity representations, they are computationally intensive and tailored to specific physical systems (<xref ref-type="bibr" rid="B94">Tavenner et al., 2023</xref>; <xref ref-type="bibr" rid="B62">&#x141;ach, 2025</xref>). Abstracting material systems as interaction networks could enable the detection of structural patterns associated with critical behavior in a more generalizable and scalable form. Crucially, combining NS with XML could enhance this framework by providing not only predictive capabilities but also interpretability. XML models could identify which network features most influence phase behavior, offering insights that are both actionable and transferable across materials. This synergy could facilitate the development of lightweight, interpretable tools that complement traditional simulations while broadening the scope for cross-domain generalization. Brain activity is typically analyzed using statistical and signal processing techniques such as spectral analysis, dynamic causal modeling, or multivariate pattern analysis. While these methods yield valuable insights into specific neural processes, they seldom capture system-level organization or dynamics associated with criticality (<xref ref-type="bibr" rid="B83">Razi and Friston, 2016</xref>; <xref ref-type="bibr" rid="B7">Bahrami et al., 2023</xref>). The proposed approach shifts focus toward modeling brain function as a complex network, using graph-based features that characterize large-scale connectivity patterns. When combined with XML, this representation could enable interpretable analyses that highlight which structural properties most influence emergent neural behavior. This integrative methodology may support cross-domain generalization and contribute to identifying potential common principles underlying critical dynamics in both biological and artificial systems. Social systems are often explored through statistical models, agent-based simulations, or qualitative analysis. While NS has gained traction in this domain, its application typically remains confined to specific tasks such as community detection or information diffusion (<xref ref-type="bibr" rid="B21">Borgatti et al., 2009</xref>; <xref ref-type="bibr" rid="B99">Weisburd et al., 2024</xref>). The proposed framework takes a broader approach by leveraging generalizable graph features to enable structural comparisons across domains and identify shared patterns underlying complex social behaviors. By integrating NS with XML, the methodology may support predictive modeling while offering insights into which topological properties are most likely to influence system dynamics. This combination could enable interpretable and scalable analyses that extend beyond isolated use cases, potentially facilitating the identification of shared principles across social and other complex systems. Finally, large-scale simulations of the universe&#x2014;such as N-body or lattice field models&#x2014;serve as the standard tools for studying cosmic structure and phase transitions. These simulations are grounded in physical laws but do not typically support interpretability or cross-domain comparison (<xref ref-type="bibr" rid="B15">Bertschinger, 1998</xref>; <xref ref-type="bibr" rid="B78">Partmann et al., 2020</xref>). Representing cosmological systems as graphs may help identify structural markers (e.g., critical points) that resemble patterns observed in other complex systems. In addition, combining NS with XML could offer added interpretability and potential for generalization. While NS can highlight topological signatures of complex dynamics, XML techniques might help trace how specific features contribute to model predictions. This integrated approach may support hypothesis generation across domains and promote transparency&#x2014;an important consideration when modeling phenomena as intricate and data-intensive as cosmology. From this comparative perspective, the proposed methodology has the potential to shift the focus from domain-specific optimization toward uncovering shared mechanisms&#x2014;such as criticality&#x2014;through unified NS representations and XML-based analysis.</p>
<p>This section highlights the potential benefits of identifying common principles across domains, which may enable transfer learning&#x2014;a machine learning technique that adapts a model trained in one domain for use in a related one. This approach could potentially reduce training time and resource demands, especially when data is limited. For instance, recognizing critical states in cosmic systems with sparse data could be facilitated by first training a model on more accessible neuroscience data. Transfer learning would then adapt the model for application in cosmology, helping it detect critical states in less monitored systems.</p>
<p>Beyond this example, the proposed framework could provide a structured approach for identifying analogies between phenomena in seemingly unrelated fields. Detecting similar patterns of criticality through graph metrics&#x2014;such as phase transitions in materials and neural activity in the brain&#x2014;could help generate hypotheses about how structural features shape functional behavior across systems. These cross-domain parallels could potentially offer a foundation for designing interfaces that better align with the brain natural dynamics, enhancing both adaptability and performance. The key connection lies in the shared dynamics of criticality observed across domains, which could, for example, inform the design of neuroprosthetic devices by enhancing their timing and responsiveness. In this respect, studying how materials undergo phase transitions that alter electrical conductivity near critical points may support the development of biocompatible materials optimized for stable and efficient neural interfaces. Feature importance analysis can help identify the structural or functional properties that most influence criticality in both materials and neural networks. By manipulating these key features, it may become possible to modulate critical behavior in both systems, thereby enhancing the efficiency and stability of interactions between engineered materials and the brain, particularly near critical thresholds. Within this framework, causal AI could explore how properties like flexibility and biocompatibility influence neuroprosthetic integration near critical thresholds. Meanwhile, correlational AI could detect links between material microstructure and electrical performance, and in neuroscience, between material characteristics and neural tissue compatibility. Overall, these integrated insights could support the co-design of materials and devices tailored for reliable performance at key points of interaction. More broadly, the same approach could be extended to other domains&#x2014;such as linking behavioral tipping points in society with neural state transitions, or comparing stress propagation in engineered structures with energy distribution during cosmological phase transitions&#x2014;to leverage shared principles of criticality. This could enable a deeper understanding of how complex behaviors emerge and stabilize across fields.</p>
</sec>
<sec id="s6">
<title>6 Conclusion and future work</title>
<p>This paper explores an interdisciplinary, system-level approach that could potentially be used to uncover common principles across different scientific domains. As an example, the paper focuses on materials science, neuroscience, social science, and cosmology, with an emphasis on criticality. It combines NS and XML to propose a five-step method: gathering relational data, converting it into a neutral framework, building graph-based datasets, using XML to compare criticality across fields, and applying findings back to specific domains. This approach could potentially enable XML models to work in fields with limited data, such as applying neuroscience insights to detect critical states in cosmology.</p>
<p>In the future, extending explainability by incorporating rule-based and counterfactual-based explanations could enhance model interpretability, especially in complex domains (<xref ref-type="bibr" rid="B44">Guidotti et al., 2019a</xref>; <xref ref-type="bibr" rid="B45">Guidotti et al., 2021</xref>). This would broaden the scope beyond feature importance methods and shift towards a more comprehensive Explainable AI (XAI) framework, offering more intuitive and actionable insights, thus increasing transparency and trust across various applications (<xref ref-type="bibr" rid="B87">Samek et al., 2019</xref>; <xref ref-type="bibr" rid="B46">Guidotti et al., 2024</xref>). Additionally, exploring the integration of explainable machine learning (XML) techniques with graph-based neural networks&#x2014;such as Graph Convolutional Networks and Graph Attention Networks&#x2014;may offer valuable insights. Such a comparison could clarify trade-offs between interpretability and performance, and inform hybrid strategies that effectively balance explanatory depth with predictive accuracy (<xref ref-type="bibr" rid="B57">Khemani et al., 2024</xref>; <xref ref-type="bibr" rid="B65">Li et al., 2024</xref>).</p>
<p>By integrating NS and XML, the proposed framework offers a structured and interpretable approach for cross-domain analysis. While this study focused on four exemplary domains&#x2014;materials science, neuroscience, social science, and cosmology&#x2014;and on the phenomenon of criticality, the methodology is generalizable and designed to accommodate other scientific areas and complex phenomena. In particular, it can be extended to investigate additional emergent behaviors, such as synchronization, resilience, and adaptation, which are prevalent in many natural and artificial systems (<xref ref-type="bibr" rid="B51">Holland, 1992</xref>; <xref ref-type="bibr" rid="B10">Bar-Yam, 2002</xref>; <xref ref-type="bibr" rid="B90">Siegenfeld and Bar-Yam, 2020</xref>; <xref ref-type="bibr" rid="B6">Artime et al., 2024</xref>). Shared properties across domains&#x2014;such as hierarchical organization, feedback loops, and nonlinear dynamics&#x2014;give rise to complex behaviors including crystallization in materials, neural synchronization in the brain, and structure formation in the cosmos. Recognizing and systematically comparing these patterns through a unified analytical lens could drive breakthroughs not only in neurotechnology and materials science, but also in fields like ecology, epidemiology, and economics, ultimately fostering both theoretical insight and practical innovation through interdisciplinary collaboration. Future research will focus on implementing and testing the framework on real-world datasets (<xref ref-type="bibr" rid="B93">Strey et al., 2023</xref>; <xref ref-type="bibr" rid="B35">Failla et al., 2024</xref>; <xref ref-type="bibr" rid="B74">Ohana et al., 2024</xref>; <xref ref-type="bibr" rid="B95">The Multimodal Universe Collaboration et al., 2025</xref>; <xref ref-type="bibr" rid="B11">Batatia et al., 2025</xref>). Initial experiments on selected domain-specific data could provide evidence of practical performance and manageable computational requirements. However, quantitative benchmarking across diverse datasets, systematic performance evaluation, and scalability testing will be essential to validate the framework robustness and generalizability. For example, comparing the model ability to identify critical states against established benchmarks&#x2014;such as known phase transition models in materials science or cosmological simulations&#x2014;could help assess the scientific validity of the detected patterns. This next phase will be key to establishing the practical viability of the approach in applied scientific and engineering contexts.</p>
</sec>
</body>
<back>
<sec sec-type="data-availability" id="s7">
<title>Data availability statement</title>
<p>The original contributions presented in the study are included in the article/supplementary material, further inquiries can be directed to the corresponding author.</p>
</sec>
<sec sec-type="author-contributions" id="s8">
<title>Author contributions</title>
<p>DC: Conceptualization, Formal Analysis, Investigation, Methodology, Project administration, Resources, Supervision, Validation, Visualization, Writing &#x2013; original draft, Writing &#x2013; review and editing. AM: Validation, Writing &#x2013; review and editing. GR: Validation, Writing &#x2013; review and editing. AB: Validation, Writing &#x2013; review and editing. GF: Resources, Validation, Writing &#x2013; review and editing.</p>
</sec>
<sec sec-type="funding-information" id="s9">
<title>Funding</title>
<p>The author(s) declare that financial support was received for the research and/or publication of this article. Funded by the European Union -Next Generation EU -NRRP M6C2 -Investment 2.1 Enhancement and strengthening of biomedical research in the NHS and by FISM -Fondazione Italiana Sclerosi Multiplacod. 2022/R-Multi/040 and financed or co-financed with the &#x201c;5 per mille&#x201d; public funding.</p>
</sec>
<sec sec-type="COI-statement" id="s10">
<title>Conflict of interest</title>
<p>Author DC was employed by AI2Life s.r.l., Innovative Start-Up, ISTC-CNR Spin-Off.</p>
<p>The remaining authors declare that the research was conducted in the absence of any commercial or financial relationships that could be construed as a potential conflict of interest.</p>
</sec>
<sec sec-type="ai-statement" id="s11">
<title>Generative AI statement</title>
<p>The author(s) declare that no Generative AI was used in the creation of this manuscript.</p>
</sec>
<sec sec-type="disclaimer" id="s12">
<title>Publisher&#x2019;s note</title>
<p>All claims expressed in this article are solely those of the authors and do not necessarily represent those of their affiliated organizations, or those of the publisher, the editors and the reviewers. Any product that may be evaluated in this article, or claim that may be made by its manufacturer, is not guaranteed or endorsed by the publisher.</p>
</sec>
<ref-list>
<title>References</title>
<ref id="B1">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Allegrini</surname>
<given-names>P.</given-names>
</name>
<name>
<surname>Paradisi</surname>
<given-names>P.</given-names>
</name>
<name>
<surname>Menicucci</surname>
<given-names>D.</given-names>
</name>
<name>
<surname>Laurino</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Piarulli</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Gemignani</surname>
<given-names>A.</given-names>
</name>
</person-group> (<year>2015</year>). <article-title>Self-organized dynamical complexity in human wakefulness and sleep: different critical brain-activity feedback for conscious and unconscious states</article-title>. <source>Phys. Rev. E. Stat. Nonlin. Soft. Matter. Phys.</source> <volume>92</volume>, <fpage>032808</fpage>. <pub-id pub-id-type="doi">10.1103/physreve.92.032808</pub-id>
</citation>
</ref>
<ref id="B2">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Amendola</surname>
<given-names>L.</given-names>
</name>
<name>
<surname>Appleby</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Avgoustidis</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Bacon</surname>
<given-names>D.</given-names>
</name>
<name>
<surname>Baker</surname>
<given-names>T.</given-names>
</name>
<name>
<surname>Baldi</surname>
<given-names>M.</given-names>
</name>
<etal/>
</person-group> (<year>2018</year>). <article-title>Cosmology and fundamental physics with the Euclid satellite</article-title>. <source>Living Rev. Relativ.</source> <volume>21</volume>, <fpage>2</fpage>. <pub-id pub-id-type="doi">10.1007/s41114-017-0010-3</pub-id>
</citation>
</ref>
<ref id="B3">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Angelini</surname>
<given-names>G.</given-names>
</name>
<name>
<surname>Malvaso</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Schirripa</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Campione</surname>
<given-names>F.</given-names>
</name>
<name>
<surname>D&#x2019;Addario</surname>
<given-names>S. L.</given-names>
</name>
<name>
<surname>Toschi</surname>
<given-names>N.</given-names>
</name>
<etal/>
</person-group> (<year>2024</year>). <article-title>Unraveling sex differences in Parkinson&#x2019;s disease through explainable machine learning</article-title>. <source>J. Neurological Sci.</source> <volume>462</volume>, <fpage>123091</fpage>. <pub-id pub-id-type="doi">10.1016/j.jns.2024.123091</pub-id>
</citation>
</ref>
<ref id="B4">
<citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname>Annett</surname>
<given-names>J.</given-names>
</name>
</person-group> (<year>2004</year>). <source>Superconductivity, superfluids and condensates</source>. In: <source>Oxford Master Series in Physics</source>. <publisher-loc>Oxford, England</publisher-loc>: <publisher-name>OUP Oxford</publisher-name>.</citation>
</ref>
<ref id="B5">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Aroboto</surname>
<given-names>B.</given-names>
</name>
<name>
<surname>Chen</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Hsu</surname>
<given-names>T.</given-names>
</name>
<name>
<surname>Wood</surname>
<given-names>B. C.</given-names>
</name>
<name>
<surname>Jiao</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Chapman</surname>
<given-names>J.</given-names>
</name>
</person-group> (<year>2023</year>). <article-title>Universal and interpretable classification of atomistic structural transitions via unsupervised graph learning</article-title>. <source>Appl. Phys. Lett.</source> <volume>123</volume>, <fpage>094103</fpage>. <pub-id pub-id-type="doi">10.1063/5.0156682</pub-id>
</citation>
</ref>
<ref id="B6">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Artime</surname>
<given-names>O.</given-names>
</name>
<name>
<surname>Grassia</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>De Domenico</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Gleeson</surname>
<given-names>J. P.</given-names>
</name>
<name>
<surname>Makse</surname>
<given-names>H. A.</given-names>
</name>
<name>
<surname>Mangioni</surname>
<given-names>G.</given-names>
</name>
<etal/>
</person-group> (<year>2024</year>). <article-title>Robustness and resilience of complex networks</article-title>. <source>Nat. Rev. Phys.</source> <volume>6</volume>, <fpage>114</fpage>&#x2013;<lpage>131</lpage>. <pub-id pub-id-type="doi">10.1038/s42254-023-00676-y</pub-id>
</citation>
</ref>
<ref id="B7">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Bahrami</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Laurienti</surname>
<given-names>P. J.</given-names>
</name>
<name>
<surname>Shappell</surname>
<given-names>H. M.</given-names>
</name>
<name>
<surname>Simpson</surname>
<given-names>S. L.</given-names>
</name>
</person-group> (<year>2023</year>). <article-title>Brain network analysis: a review on multivariate analytical methods</article-title>. <source>Brain. Connect.</source> <volume>13</volume>, <fpage>64</fpage>&#x2013;<lpage>79</lpage>. <pub-id pub-id-type="doi">10.1089/brain.2022.0007</pub-id>
</citation>
</ref>
<ref id="B8">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Barab&#xe1;si</surname>
<given-names>A. L.</given-names>
</name>
</person-group> (<year>2009</year>). <article-title>Scale-free networks: a decade and beyond</article-title>. <source>Science</source> <volume>325</volume>, <fpage>412</fpage>&#x2013;<lpage>413</lpage>. <pub-id pub-id-type="doi">10.1126/science.1173299</pub-id>
</citation>
</ref>
<ref id="B9">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Barrow</surname>
<given-names>J. D.</given-names>
</name>
<name>
<surname>Scherrer</surname>
<given-names>R. J.</given-names>
</name>
</person-group> (<year>2018</year>). <article-title>Constraining density fluctuations with big bang nucleosynthesis in the era of precision cosmology</article-title>. <source>Phys. Rev. D.</source> <volume>98</volume>, <fpage>043534</fpage>. <pub-id pub-id-type="doi">10.1103/physrevd.98.043534</pub-id>
</citation>
</ref>
<ref id="B10">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Bar-Yam</surname>
<given-names>Y.</given-names>
</name>
</person-group> (<year>2002</year>). <article-title>General features of complex systems</article-title>. <source>Knowl. Manag. Organ. Intell. Learn. Complex.</source> <volume>1</volume>, <fpage>43</fpage>&#x2013;<lpage>95</lpage>.</citation>
</ref>
<ref id="B11">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Batatia</surname>
<given-names>I.</given-names>
</name>
<name>
<surname>Batzner</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Kov&#xe1;cs</surname>
<given-names>D. P.</given-names>
</name>
<name>
<surname>Musaelian</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Simm</surname>
<given-names>G. N. C.</given-names>
</name>
<name>
<surname>Drautz</surname>
<given-names>R.</given-names>
</name>
<etal/>
</person-group> (<year>2025</year>). <article-title>The design space of e(3)-equivariant atom-centred interatomic potentials</article-title>. <source>Nat. Mach. Intell.</source> <volume>7</volume>, <fpage>56</fpage>&#x2013;<lpage>67</lpage>.</citation>
</ref>
<ref id="B12">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Batzner</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Musaelian</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Sun</surname>
<given-names>L.</given-names>
</name>
<name>
<surname>Geiger</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Mailoa</surname>
<given-names>J. P.</given-names>
</name>
<name>
<surname>Kornbluth</surname>
<given-names>M.</given-names>
</name>
<etal/>
</person-group> (<year>2022</year>). <article-title>E(3)-equivariant graph neural networks for data-efficient and accurate interatomic potentials</article-title>. <source>Nat. Commun.</source> <volume>13</volume>, <fpage>2453</fpage>. <pub-id pub-id-type="doi">10.1038/s41467-022-29939-5</pub-id>
</citation>
</ref>
<ref id="B13">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Beggs</surname>
<given-names>J. M.</given-names>
</name>
</person-group> (<year>2008</year>). <article-title>The criticality hypothesis: how local cortical networks might optimize information processing</article-title>. <source>Phil. Trans. R. Soc. A.</source> <volume>366</volume>, <fpage>329</fpage>&#x2013;<lpage>343</lpage>. <pub-id pub-id-type="doi">10.1098/rsta.2007.2092</pub-id>
</citation>
</ref>
<ref id="B14">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Beggs</surname>
<given-names>J. M.</given-names>
</name>
<name>
<surname>Plenz</surname>
<given-names>D.</given-names>
</name>
</person-group> (<year>2003</year>). <article-title>Neuronal avalanches in neocortical circuits</article-title>. <source>J. Neurosci.</source> <volume>23</volume>, <fpage>11167</fpage>&#x2013;<lpage>11177</lpage>. <pub-id pub-id-type="doi">10.1523/jneurosci.23-35-11167.2003</pub-id>
</citation>
</ref>
<ref id="B15">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Bertschinger</surname>
<given-names>E.</given-names>
</name>
</person-group> (<year>1998</year>). <article-title>Simulations of structure formation in the universe</article-title>. <source>Annu. Rev. Astronomy Astrophysics</source> <volume>36</volume>, <fpage>599</fpage>&#x2013;<lpage>654</lpage>. <pub-id pub-id-type="doi">10.1146/annurev.astro.36.1.599</pub-id>
</citation>
</ref>
<ref id="B16">
<citation citation-type="confproc">
<person-group person-group-type="author">
<name>
<surname>Bigdeli</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Tizghadam</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Leon-Garcia</surname>
<given-names>A.</given-names>
</name>
</person-group> (<year>2009</year>). <article-title>Comparison of network criticality, algebraic connectivity, and other graph metrics</article-title>. In: <conf-name>Proceedings of the 1st annual workshop on simplifying complex network for practitioners</conf-name>; <conf-date>2009 July 01</conf-date>; <conf-loc>Venice, Italy</conf-loc>. <publisher-loc>New York, NY</publisher-loc>: <publisher-name>Association for Computing Machinery</publisher-name>. p. <fpage>1</fpage>&#x2013;<lpage>6</lpage>.</citation>
</ref>
<ref id="B17">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Boccaletti</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Latora</surname>
<given-names>V.</given-names>
</name>
<name>
<surname>Moreno</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Chavez</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Hwang</surname>
<given-names>D. U.</given-names>
</name>
</person-group> (<year>2006</year>). <article-title>Complex networks: structure and dynamics</article-title>. <source>Phys. Rep.</source> <volume>424</volume>, <fpage>175</fpage>&#x2013;<lpage>308</lpage>. <pub-id pub-id-type="doi">10.1016/j.physrep.2005.10.009</pub-id>
</citation>
</ref>
<ref id="B18">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Bodria</surname>
<given-names>F.</given-names>
</name>
<name>
<surname>Giannotti</surname>
<given-names>F.</given-names>
</name>
<name>
<surname>Guidotti</surname>
<given-names>R.</given-names>
</name>
<name>
<surname>Naretto</surname>
<given-names>F.</given-names>
</name>
<name>
<surname>Pedreschi</surname>
<given-names>D.</given-names>
</name>
<name>
<surname>Rinzivillo</surname>
<given-names>S.</given-names>
</name>
</person-group> (<year>2023</year>). <article-title>Benchmarking and survey of explanation methods for black box models</article-title>. <source>Data Min. Knowl. Discov.</source> <volume>37</volume>, <fpage>1719</fpage>&#x2013;<lpage>1778</lpage>. <pub-id pub-id-type="doi">10.1007/s10618-023-00933-9</pub-id>
</citation>
</ref>
<ref id="B19">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Bonabeau</surname>
<given-names>E.</given-names>
</name>
</person-group> (<year>2002</year>). <article-title>Agent-based modeling: methods and techniques for simulating human systems</article-title>. <source>Proc. Natl. Acad. Sci.</source> <volume>99</volume>, <fpage>7280</fpage>&#x2013;<lpage>7287</lpage>. <pub-id pub-id-type="doi">10.1073/pnas.082080899</pub-id>
</citation>
</ref>
<ref id="B20">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Bore</surname>
<given-names>S. L.</given-names>
</name>
<name>
<surname>Paesani</surname>
<given-names>F.</given-names>
</name>
</person-group> (<year>2023</year>). <article-title>Realistic phase diagram of water from &#x201c;first principles&#x201d; data-driven quantum simulations</article-title>. <source>Nat. Commun.</source> <volume>14</volume>, <fpage>3349</fpage>. <pub-id pub-id-type="doi">10.1038/s41467-023-38855-1</pub-id>
</citation>
</ref>
<ref id="B21">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Borgatti</surname>
<given-names>S. P.</given-names>
</name>
<name>
<surname>Mehra</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Brass</surname>
<given-names>D. J.</given-names>
</name>
<name>
<surname>Labianca</surname>
<given-names>G.</given-names>
</name>
</person-group> (<year>2009</year>). <article-title>Network analysis in the social sciences</article-title>. <source>science</source> <volume>323</volume>, <fpage>892</fpage>&#x2013;<lpage>895</lpage>. <pub-id pub-id-type="doi">10.1126/science.1165821</pub-id>
</citation>
</ref>
<ref id="B22">
<citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname>Caccia</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Galashov</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Douillard</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Rannen-Triki</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Rao</surname>
<given-names>D.</given-names>
</name>
<name>
<surname>Paganini</surname>
<given-names>M.</given-names>
</name>
<etal/>
</person-group> (<year>2023</year>). <source>Towards compute-optimal transfer learning</source>. <publisher-loc>New York, NY</publisher-loc>: <publisher-name>Cornell University</publisher-name>. <comment>arXiv preprint <italic>arXiv:2304.13164</italic>
</comment>.</citation>
</ref>
<ref id="B23">
<citation citation-type="confproc">
<person-group person-group-type="author">
<name>
<surname>Chen</surname>
<given-names>T.</given-names>
</name>
<name>
<surname>Guestrin</surname>
<given-names>C.</given-names>
</name>
</person-group> (<year>2016</year>). <article-title>Xgboost: a scalable tree boosting system</article-title>. In: <conf-name>Proceedings of the 22nd ACM SIGKDD international conference on knowledge discovery and data mining</conf-name>; <conf-date>2016 August 13&#x2013;17</conf-date>; <conf-loc>San Francisco, California</conf-loc>. <publisher-loc>New York, NY</publisher-loc>: <publisher-name>Association for Computing Machinery</publisher-name>. p. <fpage>785</fpage>&#x2013;<lpage>794</lpage>.</citation>
</ref>
<ref id="B24">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Cheng</surname>
<given-names>B.</given-names>
</name>
<name>
<surname>Engel</surname>
<given-names>E. A.</given-names>
</name>
<name>
<surname>Behler</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Dellago</surname>
<given-names>C.</given-names>
</name>
<name>
<surname>Ceriotti</surname>
<given-names>M.</given-names>
</name>
</person-group> (<year>2019</year>). <article-title>
<italic>Ab initio</italic> thermodynamics of liquid and solid water</article-title>. <source>Proc. Natl. Acad. Sci.</source> <volume>116</volume>, <fpage>1110</fpage>&#x2013;<lpage>1115</lpage>. <pub-id pub-id-type="doi">10.1073/pnas.1815117116</pub-id>
</citation>
</ref>
<ref id="B25">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Chialvo</surname>
<given-names>D. R.</given-names>
</name>
</person-group> (<year>2010</year>). <article-title>Emergent complex neural dynamics</article-title>. <source>Nat. Phys.</source> <volume>6</volume>, <fpage>744</fpage>&#x2013;<lpage>750</lpage>. <pub-id pub-id-type="doi">10.1038/nphys1803</pub-id>
</citation>
</ref>
<ref id="B26">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Choudhary</surname>
<given-names>K.</given-names>
</name>
<name>
<surname>DeCost</surname>
<given-names>B.</given-names>
</name>
</person-group> (<year>2021</year>). <article-title>Atomistic line graph neural network for improved materials property predictions</article-title>. <source>npj Comput. Mater.</source> <volume>7</volume>, <fpage>185</fpage>. <pub-id pub-id-type="doi">10.1038/s41524-021-00650-1</pub-id>
</citation>
</ref>
<ref id="B27">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Contucci</surname>
<given-names>P.</given-names>
</name>
<name>
<surname>Gallo</surname>
<given-names>I.</given-names>
</name>
<name>
<surname>Menconi</surname>
<given-names>G.</given-names>
</name>
</person-group> (<year>2008</year>). <article-title>Phase transitions in social sciences: two-population mean field theory</article-title>. <source>Int. J. Mod. Phys. B</source> <volume>22</volume>, <fpage>2199</fpage>&#x2013;<lpage>2212</lpage>. <pub-id pub-id-type="doi">10.1142/s0217979208039423</pub-id>
</citation>
</ref>
<ref id="B28">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>D&#x2019;Amore</surname>
<given-names>F. M.</given-names>
</name>
<name>
<surname>Moscatelli</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Malvaso</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>D&#x2019;Antonio</surname>
<given-names>F.</given-names>
</name>
<name>
<surname>Rodini</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Panigutti</surname>
<given-names>M.</given-names>
</name>
<etal/>
</person-group> (<year>2025</year>). <article-title>Explainable machine learning on clinical features to predict and differentiate alzheimer&#x2019;s progression by sex: toward a clinician-tailored web interface</article-title>. <source>J. Neurological Sci.</source> <volume>468</volume>, <fpage>123361</fpage>. <pub-id pub-id-type="doi">10.1016/j.jns.2024.123361</pub-id>
</citation>
</ref>
<ref id="B29">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Das</surname>
<given-names>R.</given-names>
</name>
<name>
<surname>Soylu</surname>
<given-names>M.</given-names>
</name>
</person-group> (<year>2023</year>). <article-title>A key review on graph data science: the power of graphs in scientific studies</article-title>. <source>Chemom. Intelligent. Laboratory. Syst.</source> <volume>240</volume>, <fpage>104896</fpage>. <pub-id pub-id-type="doi">10.1016/j.chemolab.2023.104896</pub-id>
</citation>
</ref>
<ref id="B30">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Denning</surname>
<given-names>P. J.</given-names>
</name>
</person-group> (<year>2017</year>). <article-title>Computational thinking in science</article-title>. <source>Am. Sci.</source> <volume>105</volume>, <fpage>13</fpage>&#x2013;<lpage>17</lpage>. <pub-id pub-id-type="doi">10.1511/2017.124.13</pub-id>
</citation>
</ref>
<ref id="B31">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Dorogovtsev</surname>
<given-names>S. N.</given-names>
</name>
<name>
<surname>Goltsev</surname>
<given-names>A. V.</given-names>
</name>
<name>
<surname>Mendes</surname>
<given-names>J. F.</given-names>
</name>
</person-group> (<year>2008</year>). <article-title>Critical phenomena in complex networks</article-title>. <source>Rev. Mod. Phys.</source> <volume>80</volume>, <fpage>1275</fpage>&#x2013;<lpage>1335</lpage>. <pub-id pub-id-type="doi">10.1103/revmodphys.80.1275</pub-id>
</citation>
</ref>
<ref id="B32">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Emmanuel</surname>
<given-names>T.</given-names>
</name>
<name>
<surname>Maupong</surname>
<given-names>T.</given-names>
</name>
<name>
<surname>Mpoeleng</surname>
<given-names>D.</given-names>
</name>
<name>
<surname>Semong</surname>
<given-names>T.</given-names>
</name>
<name>
<surname>Mphago</surname>
<given-names>B.</given-names>
</name>
<name>
<surname>Tabona</surname>
<given-names>O.</given-names>
</name>
</person-group> (<year>2021</year>). <article-title>A survey on missing data in machine learning</article-title>. <source>J. Big data</source> <volume>8</volume>, <fpage>140</fpage>&#x2013;<lpage>37</lpage>. <pub-id pub-id-type="doi">10.1186/s40537-021-00516-9</pub-id>
</citation>
</ref>
<ref id="B33">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Estrada</surname>
<given-names>E.</given-names>
</name>
</person-group> (<year>2024</year>). <article-title>What is a complex system, after all?</article-title> <source>Found. Sci.</source> <volume>29</volume>, <fpage>1143</fpage>&#x2013;<lpage>1170</lpage>. <pub-id pub-id-type="doi">10.1007/s10699-023-09917-w</pub-id>
</citation>
</ref>
<ref id="B34">
<citation citation-type="book">
<collab>Euclid Collaboration</collab>
<person-group person-group-type="author">
<name>
<surname>Mellier</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Abdurro&#x27;uf</surname>
<given-names>C.</given-names>
</name>
<name>
<surname>Acevedo Barroso</surname>
<given-names>J. A.</given-names>
</name>
<name>
<surname>Ach&#xfa;carro</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Adamek</surname>
<given-names>J.</given-names>
</name>
<etal/>
</person-group> (<year>2024</year>). <source>Euclid. I. Overview of the euclid mission</source>. <publisher-loc>New York, NY</publisher-loc>: <publisher-name>Cornell University</publisher-name>. <comment>arXiv e-prints</comment>. <pub-id pub-id-type="doi">10.48550/arXiv.2405.13491</pub-id>
</citation>
</ref>
<ref id="B35">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Failla</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Cazabet</surname>
<given-names>R.</given-names>
</name>
<name>
<surname>Rossetti</surname>
<given-names>G.</given-names>
</name>
<name>
<surname>Citraro</surname>
<given-names>S.</given-names>
</name>
</person-group> (<year>2024</year>). <article-title>Describing group evolution in temporal data using multi-faceted events</article-title>. <source>Mach. Learn.</source> <volume>113</volume>, <fpage>7591</fpage>&#x2013;<lpage>7615</lpage>. <pub-id pub-id-type="doi">10.1007/s10994-024-06600-4</pub-id>
</citation>
</ref>
<ref id="B36">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Flores-Livas</surname>
<given-names>J. A.</given-names>
</name>
<name>
<surname>Boeri</surname>
<given-names>L.</given-names>
</name>
<name>
<surname>Sanna</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Profeta</surname>
<given-names>G.</given-names>
</name>
<name>
<surname>Arita</surname>
<given-names>R.</given-names>
</name>
<name>
<surname>Eremets</surname>
<given-names>M.</given-names>
</name>
</person-group> (<year>2020</year>). <article-title>A perspective on conventional high-temperature superconductors at high pressure: methods and materials</article-title>. <source>Phys. Rep.</source> <volume>856</volume>, <fpage>1</fpage>&#x2013;<lpage>78</lpage>. <pub-id pub-id-type="doi">10.1016/j.physrep.2020.02.003</pub-id>
</citation>
</ref>
<ref id="B37">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Friedman</surname>
<given-names>N.</given-names>
</name>
<name>
<surname>Koller</surname>
<given-names>D.</given-names>
</name>
</person-group> (<year>2003</year>). <article-title>Being bayesian about network structure. a bayesian approach to structure discovery in bayesian networks</article-title>. <source>Mach. Learn.</source> <volume>50</volume>, <fpage>95</fpage>&#x2013;<lpage>125</lpage>. <pub-id pub-id-type="doi">10.1023/a:1020249912095</pub-id>
</citation>
</ref>
<ref id="B38">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Fu</surname>
<given-names>T.-c.</given-names>
</name>
</person-group> (<year>2011</year>). <article-title>A review on time series data mining</article-title>. <source>Eng. Appl. Artif. Intell.</source> <volume>24</volume>, <fpage>164</fpage>&#x2013;<lpage>181</lpage>. <pub-id pub-id-type="doi">10.1016/j.engappai.2010.09.007</pub-id>
</citation>
</ref>
<ref id="B39">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Fukami</surname>
<given-names>T.</given-names>
</name>
<name>
<surname>Nakajima</surname>
<given-names>M.</given-names>
</name>
</person-group> (<year>2011</year>). <article-title>Community assembly: alternative stable states or alternative transient states?</article-title> <source>Ecol. Lett.</source> <volume>14</volume>, <fpage>973</fpage>&#x2013;<lpage>984</lpage>. <pub-id pub-id-type="doi">10.1111/j.1461-0248.2011.01663.x</pub-id>
</citation>
</ref>
<ref id="B40">
<citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname>Fultz</surname>
<given-names>B.</given-names>
</name>
</person-group> (<year>2020</year>). <source>Phase transitions in materials</source>. <edition>2 edn</edition>. <publisher-loc>Cambridge, England</publisher-loc>: <publisher-name>Cambridge University Press</publisher-name>.</citation>
</ref>
<ref id="B41">
<citation citation-type="confproc">
<person-group person-group-type="author">
<name>
<surname>Gaur</surname>
<given-names>V.</given-names>
</name>
<name>
<surname>Yadav</surname>
<given-names>O. P.</given-names>
</name>
<name>
<surname>Soni</surname>
<given-names>G.</given-names>
</name>
<name>
<surname>Rathore</surname>
<given-names>A. P. S.</given-names>
</name>
</person-group> (<year>2019</year>). <article-title>A review of metrics, algorithms and methodologies for network reliability</article-title>. In: <conf-name>2019 IEEE international conference on industrial engineering and engineering management (IEEM)</conf-name>; <conf-date>2019 December 15&#x2013;18</conf-date>. <publisher-loc>Manhattan, NY</publisher-loc>: <publisher-name>IEEE</publisher-name>. p. <fpage>1129</fpage>&#x2013;<lpage>1133</lpage>.</citation>
</ref>
<ref id="B42">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Greenacre</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Groenen</surname>
<given-names>P. J.</given-names>
</name>
<name>
<surname>Hastie</surname>
<given-names>T.</given-names>
</name>
<name>
<surname>D&#x2019;Enza</surname>
<given-names>A. I.</given-names>
</name>
<name>
<surname>Markos</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Tuzhilina</surname>
<given-names>E.</given-names>
</name>
</person-group> (<year>2022</year>). <article-title>Principal component analysis</article-title>. <source>Nat. Rev. Methods Prim.</source> <volume>2</volume>, <fpage>100</fpage>. <pub-id pub-id-type="doi">10.1038/s43586-022-00184-w</pub-id>
</citation>
</ref>
<ref id="B43">
<citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname>Guardo</surname>
<given-names>G.</given-names>
</name>
<name>
<surname>Greco</surname>
<given-names>V.</given-names>
</name>
<name>
<surname>Ruggieri</surname>
<given-names>M.</given-names>
</name>
</person-group> (<year>2014</year>). <source>Energy density fluctuations in early universe</source>. <publisher-loc>Melville, NY</publisher-loc>: <publisher-name>AIP Conference Proceedings</publisher-name>, <volume>Vol. 1595</volume>. p. <fpage>224</fpage>&#x2013;<lpage>227</lpage>. <pub-id pub-id-type="doi">10.1063/1.4875317</pub-id>
</citation>
</ref>
<ref id="B44">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Guidotti</surname>
<given-names>R.</given-names>
</name>
<name>
<surname>Monreale</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Giannotti</surname>
<given-names>F.</given-names>
</name>
<name>
<surname>Pedreschi</surname>
<given-names>D.</given-names>
</name>
<name>
<surname>Ruggieri</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Turini</surname>
<given-names>F.</given-names>
</name>
</person-group> (<year>2019a</year>). <article-title>Factual and counterfactual explanations for black box decision making</article-title>. <source>IEEE Intell. Syst.</source> <volume>34</volume>, <fpage>14</fpage>&#x2013;<lpage>23</lpage>. <pub-id pub-id-type="doi">10.1109/mis.2019.2957223</pub-id>
</citation>
</ref>
<ref id="B45">
<citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname>Guidotti</surname>
<given-names>R.</given-names>
</name>
<name>
<surname>Monreale</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Pedreschi</surname>
<given-names>D.</given-names>
</name>
<name>
<surname>Giannotti</surname>
<given-names>F.</given-names>
</name>
</person-group> (<year>2021</year>). <source>Principles of explainable artificial intelligence</source>. <publisher-loc>Cham, Switzerland</publisher-loc>: <publisher-name>Springer</publisher-name>. <pub-id pub-id-type="doi">10.1007/978-3-030-76409-8_2</pub-id>
</citation>
</ref>
<ref id="B46">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Guidotti</surname>
<given-names>R.</given-names>
</name>
<name>
<surname>Monreale</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Ruggieri</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Naretto</surname>
<given-names>F.</given-names>
</name>
<name>
<surname>Turini</surname>
<given-names>F.</given-names>
</name>
<name>
<surname>Pedreschi</surname>
<given-names>D.</given-names>
</name>
<etal/>
</person-group> (<year>2024</year>). <article-title>Stable and actionable explanations of black-box models through factual and counterfactual rules</article-title>. <source>Data Min. Knowl. Discov.</source> <volume>38</volume>, <fpage>2825</fpage>&#x2013;<lpage>2862</lpage>. <pub-id pub-id-type="doi">10.1007/s10618-022-00878-5</pub-id>
</citation>
</ref>
<ref id="B47">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Guidotti</surname>
<given-names>R.</given-names>
</name>
<name>
<surname>Monreale</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Ruggieri</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Turini</surname>
<given-names>F.</given-names>
</name>
<name>
<surname>Giannotti</surname>
<given-names>F.</given-names>
</name>
<name>
<surname>Pedreschi</surname>
<given-names>D.</given-names>
</name>
</person-group> (<year>2019b</year>). <article-title>A survey of methods for explaining black box models</article-title>. <source>ACM Comput. Surv.</source> <volume>51</volume> (<issue>93</issue>), <fpage>1</fpage>&#x2013;<lpage>42</lpage>. <pub-id pub-id-type="doi">10.1145/3236009</pub-id>
</citation>
</ref>
<ref id="B48">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Gupta</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Gupta</surname>
<given-names>A.</given-names>
</name>
</person-group> (<year>2019</year>). <article-title>Dealing with noise problem in machine learning data-sets: a systematic review</article-title>. <source>Procedia Comput. Sci.</source> <volume>161</volume>, <fpage>466</fpage>&#x2013;<lpage>474</lpage>. <pub-id pub-id-type="doi">10.1016/j.procs.2019.11.146</pub-id>
</citation>
</ref>
<ref id="B49">
<citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname>Hawking</surname>
<given-names>S. W.</given-names>
</name>
</person-group> (<year>2006</year>). <source>The theory of everything: the origin and fate of the universe</source>. <publisher-loc>London, UK</publisher-loc>: <publisher-name>New Millennium Press</publisher-name>.</citation>
</ref>
<ref id="B50">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Heged&#x171;s</surname>
<given-names>D.</given-names>
</name>
<name>
<surname>Grolmusz</surname>
<given-names>V.</given-names>
</name>
</person-group> (<year>2025</year>). <article-title>The length and the width of the human brain circuit connections are strongly correlated</article-title>. <source>Cogn. Neurodynamics</source> <volume>19</volume>, <fpage>21</fpage>. <pub-id pub-id-type="doi">10.1007/s11571-024-10201-1</pub-id>
</citation>
</ref>
<ref id="B51">
<citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname>Holland</surname>
<given-names>J. H.</given-names>
</name>
</person-group> (<year>1992</year>). <article-title>Adaptation in natural and artificial systems: an introductory analysis with applications to biology</article-title>. In: <source>Control, and artificial intelligence</source>. <publisher-loc>Cambridge, Massachusetts</publisher-loc>: <publisher-name>MIT press</publisher-name>.</citation>
</ref>
<ref id="B52">
<citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname>Holland</surname>
<given-names>J. H.</given-names>
</name>
</person-group> (<year>1995</year>). <source>Hidden order: how adaptation builds complexity</source>. <publisher-loc>Boston, Massachusetts</publisher-loc>: <publisher-name>Addison Wesley</publisher-name>.</citation>
</ref>
<ref id="B53">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Huang</surname>
<given-names>W.</given-names>
</name>
<name>
<surname>Li</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Edwards</surname>
<given-names>P. P.</given-names>
</name>
</person-group> (<year>2018</year>). <article-title>Mesoscience: exploring the common principle at mesoscales</article-title>. <source>Natl. Sci. Rev.</source> <volume>5</volume>, <fpage>321</fpage>&#x2013;<lpage>326</lpage>. <pub-id pub-id-type="doi">10.1093/nsr/nwx083</pub-id>
</citation>
</ref>
<ref id="B54">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>I&#xf1;iguez</surname>
<given-names>G.</given-names>
</name>
<name>
<surname>Battiston</surname>
<given-names>F.</given-names>
</name>
<name>
<surname>Karsai</surname>
<given-names>M.</given-names>
</name>
</person-group> (<year>2020</year>). <article-title>Bridging the gap between graphs and networks</article-title>. <source>Commun. Phys.</source> <volume>3</volume>, <fpage>88</fpage>. <pub-id pub-id-type="doi">10.1038/s42005-020-0359-6</pub-id>
</citation>
</ref>
<ref id="B55">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Islam</surname>
<given-names>M. R.</given-names>
</name>
<name>
<surname>Ahmed</surname>
<given-names>M. U.</given-names>
</name>
<name>
<surname>Barua</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Begum</surname>
<given-names>S.</given-names>
</name>
</person-group> (<year>2022</year>). <article-title>A systematic review of explainable artificial intelligence in terms of different application domains and tasks</article-title>. <source>Appl. Sci.</source> <volume>12</volume>, <fpage>1353</fpage>. <pub-id pub-id-type="doi">10.3390/app12031353</pub-id>
</citation>
</ref>
<ref id="B56">
<citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname>Jensen</surname>
<given-names>H. J.</given-names>
</name>
</person-group> (<year>1998</year>). <source>Self-organized criticality: emergent complex behavior in physical and biological systems</source>. <publisher-loc>Cambridge, England</publisher-loc>: <publisher-name>Cambridge University Press</publisher-name>, <volume>Vol. 10</volume>.</citation>
</ref>
<ref id="B57">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Khemani</surname>
<given-names>B.</given-names>
</name>
<name>
<surname>Patil</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Kotecha</surname>
<given-names>K.</given-names>
</name>
<name>
<surname>Tanwar</surname>
<given-names>S.</given-names>
</name>
</person-group> (<year>2024</year>). <article-title>A review of graph neural networks: concepts, architectures, techniques, challenges, datasets, applications, and future directions</article-title>. <source>J. Big. Data.</source> <volume>11</volume>, <fpage>18</fpage>. <pub-id pub-id-type="doi">10.1186/s40537-023-00876-4</pub-id>
</citation>
</ref>
<ref id="B58">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Khetani</surname>
<given-names>V.</given-names>
</name>
<name>
<surname>Gandhi</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Bhattacharya</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Ajani</surname>
<given-names>S. N.</given-names>
</name>
<name>
<surname>Limkar</surname>
<given-names>S.</given-names>
</name>
</person-group> (<year>2023</year>). <article-title>Cross-domain analysis of ml and dl: evaluating their impact in diverse domains</article-title>. <source>Int. J. Intelligent Syst. Appl. Eng.</source> <volume>11</volume>, <fpage>253</fpage>&#x2013;<lpage>262</lpage>.</citation>
</ref>
<ref id="B59">
<citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname>Kirk</surname>
<given-names>G. S.</given-names>
</name>
<name>
<surname>Raven</surname>
<given-names>J. E.</given-names>
</name>
<name>
<surname>Schofield</surname>
<given-names>M.</given-names>
</name>
</person-group> (<year>1983</year>). <source>The presocratic philosophers: a critical history with a selection of texts</source>. <publisher-loc>Cambridge, England</publisher-loc>: <publisher-name>Cambridge University Press</publisher-name>.</citation>
</ref>
<ref id="B60">
<citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname>Koller</surname>
<given-names>D.</given-names>
</name>
<name>
<surname>Friedman</surname>
<given-names>N.</given-names>
</name>
</person-group> (<year>2009</year>). <source>Probabilistic graphical models: principles and techniques</source>. <publisher-loc>Cambridge, Massachusetts</publisher-loc>: <publisher-name>MIT press</publisher-name>.</citation>
</ref>
<ref id="B61">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Kravtsov</surname>
<given-names>A. V.</given-names>
</name>
<name>
<surname>Borgani</surname>
<given-names>S.</given-names>
</name>
</person-group> (<year>2012</year>). <article-title>Formation of galaxy clusters</article-title>. <source>Annu. Rev. Astronomy Astrophysics. Form. Galaxy Clust.</source> <volume>50</volume>, <fpage>353</fpage>&#x2013;<lpage>409</lpage>. <pub-id pub-id-type="doi">10.1146/annurev-astro-081811-125502</pub-id>
</citation>
</ref>
<ref id="B62">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>&#x141;ach</surname>
<given-names>&#x141;.</given-names>
</name>
</person-group> (<year>2025</year>). <article-title>Phase stability and transitions in high-entropy alloys: insights from lattice gas models, computational simulations, and experimental validation</article-title>. <source>Entropy</source> <volume>27</volume>, <fpage>464</fpage>. <pub-id pub-id-type="doi">10.3390/e27050464</pub-id>
</citation>
</ref>
<ref id="B63">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Ladyman</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Lambert</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Wiesner</surname>
<given-names>K.</given-names>
</name>
</person-group> (<year>2013</year>). <article-title>What is a complex system?</article-title> <source>Eur. J. Philosophy Sci.</source> <volume>3</volume>, <fpage>33</fpage>&#x2013;<lpage>67</lpage>. <pub-id pub-id-type="doi">10.1007/s13194-012-0056-8</pub-id>
</citation>
</ref>
<ref id="B64">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Levy</surname>
<given-names>M.</given-names>
</name>
</person-group> (<year>2005</year>). <article-title>Social phase transitions</article-title>. <source>J. Econ. Behav. and Organ.</source> <volume>57</volume>, <fpage>71</fpage>&#x2013;<lpage>87</lpage>. <pub-id pub-id-type="doi">10.1016/j.jebo.2003.11.013</pub-id>
</citation>
</ref>
<ref id="B65">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Li</surname>
<given-names>H.</given-names>
</name>
<name>
<surname>Han</surname>
<given-names>Z.</given-names>
</name>
<name>
<surname>Sun</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Wang</surname>
<given-names>F.</given-names>
</name>
<name>
<surname>Hu</surname>
<given-names>P.</given-names>
</name>
<name>
<surname>Gao</surname>
<given-names>Y.</given-names>
</name>
<etal/>
</person-group> (<year>2024</year>). <article-title>Cgmega: explainable graph neural network framework with attention mechanisms for cancer gene module dissection</article-title>. <source>Nat. Commun.</source> <volume>15</volume>, <fpage>5997</fpage>. <pub-id pub-id-type="doi">10.1038/s41467-024-50426-6</pub-id>
</citation>
</ref>
<ref id="B66">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Linardatos</surname>
<given-names>P.</given-names>
</name>
<name>
<surname>Papastefanopoulos</surname>
<given-names>V.</given-names>
</name>
<name>
<surname>Kotsiantis</surname>
<given-names>S.</given-names>
</name>
</person-group> (<year>2020</year>). <article-title>Explainable ai: a review of machine learning interpretability methods</article-title>. <source>Entropy</source> <volume>23</volume>, <fpage>18</fpage>. <pub-id pub-id-type="doi">10.3390/e23010018</pub-id>
</citation>
</ref>
<ref id="B67">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Longo</surname>
<given-names>L.</given-names>
</name>
<name>
<surname>Brcic</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Cabitza</surname>
<given-names>F.</given-names>
</name>
<name>
<surname>Choi</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Confalonieri</surname>
<given-names>R.</given-names>
</name>
<name>
<surname>Ser</surname>
<given-names>J. D.</given-names>
</name>
<etal/>
</person-group> (<year>2024</year>). <article-title>Explainable artificial intelligence (xai) 2.0: a manifesto of open challenges and interdisciplinary research directions</article-title>. <source>Inf. Fusion</source> <volume>106</volume>, <fpage>102301</fpage>. <pub-id pub-id-type="doi">10.1016/j.inffus.2024.102301</pub-id>
</citation>
</ref>
<ref id="B68">
<citation citation-type="confproc">
<person-group person-group-type="author">
<name>
<surname>Lundberg</surname>
<given-names>S. M.</given-names>
</name>
<name>
<surname>Lee</surname>
<given-names>S.-I.</given-names>
</name>
</person-group> (<year>2017</year>). <article-title>A unified approach to interpreting model predictions</article-title>. In: <conf-name>Proceedings of the 31st international conference on neural information processing systems</conf-name>; <conf-date>2017 December 4&#x2013;9</conf-date>; <conf-loc>Long Beach, California</conf-loc>. <publisher-loc>Red Hook, NY</publisher-loc>: <publisher-name>Curran Associates Inc</publisher-name>, <volume>Vol. 30</volume>.</citation>
</ref>
<ref id="B69">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Milo</surname>
<given-names>R.</given-names>
</name>
<name>
<surname>Shen-Orr</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Itzkovitz</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Kashtan</surname>
<given-names>N.</given-names>
</name>
<name>
<surname>Chklovskii</surname>
<given-names>D.</given-names>
</name>
<name>
<surname>Alon</surname>
<given-names>U.</given-names>
</name>
</person-group> (<year>2002</year>). <article-title>Network motifs: simple building blocks of complex networks</article-title>. <source>Science</source> <volume>298</volume>, <fpage>824</fpage>&#x2013;<lpage>827</lpage>. <pub-id pub-id-type="doi">10.1126/science.298.5594.824</pub-id>
</citation>
</ref>
<ref id="B70">
<citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname>Mitchell</surname>
<given-names>M.</given-names>
</name>
</person-group> (<year>2009</year>). <source>Complexity: a guided tour</source>. <publisher-loc>Oxford, England</publisher-loc>: <publisher-name>Oxford University Press</publisher-name>.</citation>
</ref>
<ref id="B71">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Mrdjenovich</surname>
<given-names>D.</given-names>
</name>
<name>
<surname>Horton</surname>
<given-names>M. K.</given-names>
</name>
<name>
<surname>Montoya</surname>
<given-names>J. H.</given-names>
</name>
<name>
<surname>Legaspi</surname>
<given-names>C. M.</given-names>
</name>
<name>
<surname>Dwaraknath</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Tshitoyan</surname>
<given-names>V.</given-names>
</name>
<etal/>
</person-group> (<year>2020</year>). <article-title>Propnet: a knowledge graph for materials science</article-title>. <source>Matter</source> <volume>2</volume>, <fpage>464</fpage>&#x2013;<lpage>480</lpage>. <pub-id pub-id-type="doi">10.1016/j.matt.2019.11.013</pub-id>
</citation>
</ref>
<ref id="B72">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Neuberg</surname>
<given-names>L. G.</given-names>
</name>
</person-group> (<year>2003</year>). <article-title>Causality: models, reasoning, and inference, by judea pearl, cambridge university press, 2000</article-title>. <source>Econ. Theory</source> <volume>19</volume>, <fpage>675</fpage>&#x2013;<lpage>685</lpage>. <pub-id pub-id-type="doi">10.1017/s0266466603004109</pub-id>
</citation>
</ref>
<ref id="B73">
<citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname>Nishimori</surname>
<given-names>H.</given-names>
</name>
<name>
<surname>Ortiz</surname>
<given-names>G.</given-names>
</name>
</person-group> (<year>2011</year>). <source>Elements of phase transitions and critical phenomena</source>. <publisher-loc>Oxford, England</publisher-loc>: <publisher-name>Oxford University Press</publisher-name>.</citation>
</ref>
<ref id="B74">
<citation citation-type="confproc">
<person-group person-group-type="author">
<name>
<surname>Ohana</surname>
<given-names>R.</given-names>
</name>
<name>
<surname>McCabe</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Meyer</surname>
<given-names>L. T.</given-names>
</name>
<name>
<surname>Morel</surname>
<given-names>R.</given-names>
</name>
<name>
<surname>Agocs</surname>
<given-names>F. J.</given-names>
</name>
<name>
<surname>Beneitez</surname>
<given-names>M.</given-names>
</name>
<etal/>
</person-group> (<year>2024</year>). <article-title>The well: a large-scale collection of diverse physics simulations for machine learning</article-title>. In: <conf-name>The thirty-eight conference on neural information processing systems datasets and benchmarks track</conf-name>; <conf-date>2024 December 10&#x2013;15</conf-date>; <conf-loc>Vancouver BC Canada</conf-loc>. <publisher-loc>Red Hook, NY</publisher-loc>: <publisher-name>Curran Associates Inc</publisher-name>.</citation>
</ref>
<ref id="B75">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Pan</surname>
<given-names>S. J.</given-names>
</name>
<name>
<surname>Yang</surname>
<given-names>Q.</given-names>
</name>
</person-group> (<year>2010</year>). <article-title>A survey on transfer learning</article-title>. <source>IEEE Trans. Knowl. Data Eng.</source> <volume>22</volume>, <fpage>1345</fpage>&#x2013;<lpage>1359</lpage>. <pub-id pub-id-type="doi">10.1109/TKDE.2009.191</pub-id>
</citation>
</ref>
<ref id="B76">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Parisi</surname>
<given-names>G.</given-names>
</name>
</person-group> (<year>1999</year>). <article-title>Complex systems: a physicist&#x2019;s viewpoint</article-title>. <source>Phys. A Stat. Mech. its Appl.</source> <volume>263</volume>, <fpage>557</fpage>&#x2013;<lpage>564</lpage>. <pub-id pub-id-type="doi">10.1016/S0378-4371(98)00524-X</pub-id>
</citation>
</ref>
<ref id="B77">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Parisi</surname>
<given-names>G.</given-names>
</name>
<name>
<surname>Procaccia</surname>
<given-names>I.</given-names>
</name>
<name>
<surname>Rainone</surname>
<given-names>C.</given-names>
</name>
<name>
<surname>Singh</surname>
<given-names>M.</given-names>
</name>
</person-group> (<year>2017</year>). <article-title>Shear bands as manifestation of a criticality in yielding amorphous solids</article-title>, <source>Proc. Natl. Acad. Sci. U. S. A.</source> <volume>114</volume>, <fpage>5577</fpage>&#x2013;<lpage>5582</lpage>. <pub-id pub-id-type="doi">10.1073/pnas.1700075114</pub-id>
</citation>
</ref>
<ref id="B78">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Partmann</surname>
<given-names>C.</given-names>
</name>
<name>
<surname>Fidler</surname>
<given-names>C.</given-names>
</name>
<name>
<surname>Rampf</surname>
<given-names>C.</given-names>
</name>
<name>
<surname>Hahn</surname>
<given-names>O.</given-names>
</name>
</person-group> (<year>2020</year>). <article-title>Fast simulations of cosmic large-scale structure with massive neutrinos</article-title>. <source>J. Cosmol. Astropart. Phys.</source> <volume>2020</volume>, <fpage>018</fpage>. <pub-id pub-id-type="doi">10.1088/1475-7516/2020/09/018</pub-id>
</citation>
</ref>
<ref id="B79">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Patel</surname>
<given-names>A. C.</given-names>
</name>
<name>
<surname>Sinha</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Palermo</surname>
<given-names>G.</given-names>
</name>
</person-group> (<year>2024</year>). <article-title>Graph theory approaches for molecular dynamics simulations</article-title>. <source>Q. Rev. Biophysics</source> <volume>57</volume>, <fpage>e15</fpage>. <pub-id pub-id-type="doi">10.1017/S0033583524000143</pub-id>
</citation>
</ref>
<ref id="B80">
<citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname>Petrucci</surname>
<given-names>R.</given-names>
</name>
<name>
<surname>Herring</surname>
<given-names>F.</given-names>
</name>
<name>
<surname>Madura</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Bissonnette</surname>
<given-names>C.</given-names>
</name>
</person-group> (<year>2017</year>). <source>General chemistry: principles and modern applications</source>. <publisher-loc>London, UK</publisher-loc>: <publisher-name>Pearson Education</publisher-name>.</citation>
</ref>
<ref id="B81">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Ponti</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Candelieri</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Giordani</surname>
<given-names>I.</given-names>
</name>
<name>
<surname>Archetti</surname>
<given-names>F.</given-names>
</name>
</person-group> (<year>2021</year>). <article-title>Probabilistic measures of edge criticality in graphs: a study in water distribution networks</article-title>. <source>Appl. Netw. Sci.</source> <volume>6</volume>, <fpage>81</fpage>. <pub-id pub-id-type="doi">10.1007/s41109-021-00427-x</pub-id>
</citation>
</ref>
<ref id="B82">
<citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname>P&#xf3;sfai</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Barab&#xe1;si</surname>
<given-names>A. L.</given-names>
</name>
</person-group> (<year>2016</year>). <source>Network science</source>. <publisher-loc>Cambridge, England</publisher-loc>: <publisher-name>Cambridge University Press</publisher-name>.</citation>
</ref>
<ref id="B83">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Razi</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Friston</surname>
<given-names>K. J.</given-names>
</name>
</person-group> (<year>2016</year>). <article-title>The connected brain: causality, models, and intrinsic dynamics</article-title>. <source>IEEE Signal Process. Mag.</source> <volume>33</volume>, <fpage>14</fpage>&#x2013;<lpage>35</lpage>. <pub-id pub-id-type="doi">10.1109/msp.2015.2482121</pub-id>
</citation>
</ref>
<ref id="B84">
<citation citation-type="confproc">
<person-group person-group-type="author">
<name>
<surname>Ribeiro</surname>
<given-names>M. T.</given-names>
</name>
<name>
<surname>Singh</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Guestrin</surname>
<given-names>C.</given-names>
</name>
</person-group> (<year>2016</year>). <article-title>&#x201c;why should i trust you?&#x201d;: explaining the predictions of any classifier</article-title>. In <conf-name>Proceedings of the 22nd ACM SIGKDD international conference on knowledge discovery and data mining</conf-name>. <publisher-loc>New York, NY</publisher-loc>: <publisher-name>Association for Computing Machinery</publisher-name>. p. <fpage>1135</fpage>&#x2013;<lpage>1144</lpage>.</citation>
</ref>
<ref id="B85">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Rosato</surname>
<given-names>V.</given-names>
</name>
<name>
<surname>Issacharoff</surname>
<given-names>L.</given-names>
</name>
<name>
<surname>Meloni</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Caligiore</surname>
<given-names>D.</given-names>
</name>
<name>
<surname>Tiriticco</surname>
<given-names>F.</given-names>
</name>
</person-group> (<year>2008</year>). <article-title>Is the topology of the internet network really fit to sustain its function?</article-title> <source>Phys. A Stat. Mech. its Appl.</source> <volume>387</volume>, <fpage>1689</fpage>&#x2013;<lpage>1704</lpage>. <pub-id pub-id-type="doi">10.1016/j.physa.2007.10.065</pub-id>
</citation>
</ref>
<ref id="B86">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Rossetti</surname>
<given-names>G.</given-names>
</name>
<name>
<surname>Cazabet</surname>
<given-names>R.</given-names>
</name>
</person-group> (<year>2018</year>). <article-title>Community discovery in dynamic networks: a survey</article-title>. <source>ACM Comput. Surv. (CSUR)</source> <volume>51</volume>, <fpage>1</fpage>&#x2013;<lpage>37</lpage>. <pub-id pub-id-type="doi">10.1145/3172867</pub-id>
</citation>
</ref>
<ref id="B87">
<citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname>Samek</surname>
<given-names>W.</given-names>
</name>
<name>
<surname>Wiegand</surname>
<given-names>T.</given-names>
</name>
<name>
<surname>M&#xfc;ller</surname>
<given-names>K.-R.</given-names>
</name>
</person-group> (<year>2019</year>). <source>Explainable AI: interpreting, explaining and visualizing deep learning</source>. <publisher-loc>Cham, Switzerland</publisher-loc>: <publisher-name>Springer</publisher-name>.</citation>
</ref>
<ref id="B88">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Shi</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Kirihara</surname>
<given-names>K.</given-names>
</name>
<name>
<surname>Tada</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Fujioka</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Usui</surname>
<given-names>K.</given-names>
</name>
<name>
<surname>Koshiyama</surname>
<given-names>D.</given-names>
</name>
<etal/>
</person-group> (<year>2021</year>). <article-title>Criticality in the healthy brain</article-title>. <source>Front. Netw. Physiology</source> <volume>1</volume>, <fpage>755685</fpage>. <pub-id pub-id-type="doi">10.3389/fnetp.2021.755685</pub-id>
</citation>
</ref>
<ref id="B89">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Shi</surname>
<given-names>X.</given-names>
</name>
<name>
<surname>Zhou</surname>
<given-names>L.</given-names>
</name>
<name>
<surname>Huang</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Wu</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Hong</surname>
<given-names>Z.</given-names>
</name>
</person-group> (<year>2024</year>). <article-title>A review on the applications of graph neural networks in materials science at the atomic scale</article-title>. <source>Mater. Genome Eng. Adv.</source> <volume>2</volume>, <fpage>e50</fpage>. <pub-id pub-id-type="doi">10.1002/mgea.50</pub-id>
</citation>
</ref>
<ref id="B90">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Siegenfeld</surname>
<given-names>A. F.</given-names>
</name>
<name>
<surname>Bar-Yam</surname>
<given-names>Y.</given-names>
</name>
</person-group> (<year>2020</year>). <article-title>An introduction to complex systems science and its applications</article-title>. <source>Complexity</source> <volume>2020</volume>, <fpage>1</fpage>&#x2013;<lpage>16</lpage>. <pub-id pub-id-type="doi">10.1155/2020/6105872</pub-id>
</citation>
</ref>
<ref id="B91">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Sporns</surname>
<given-names>O.</given-names>
</name>
</person-group> (<year>2011</year>). <article-title>The human connectome: a complex network</article-title>. <source>Ann. N. Y. Acad. Sci.</source> <volume>1224</volume>, <fpage>109</fpage>&#x2013;<lpage>125</lpage>. <pub-id pub-id-type="doi">10.1111/j.1749-6632.2010.05888.x</pub-id>
</citation>
</ref>
<ref id="B92">
<citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname>Stanley</surname>
<given-names>H. E.</given-names>
</name>
</person-group> (<year>1971</year>). <article-title>Introduction to phase transitions and critical phenomena</article-title>. In: <source>International series of monographs on physics</source>. <publisher-loc>Oxford, England</publisher-loc>: <publisher-name>Oxford University Press</publisher-name>.</citation>
</ref>
<ref id="B93">
<citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname>Strey</surname>
<given-names>S.-G.</given-names>
</name>
<name>
<surname>Castronovo</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Elumalai</surname>
<given-names>K.</given-names>
</name>
</person-group> (<year>2023</year>). <source>Graph theoretic approach identifies critical thresholds at which galaxy filamentary structures form</source>. <publisher-loc>New York, NY</publisher-loc>: <publisher-name>Cornell University</publisher-name>. <comment>
<italic>arXiv preprint arXiv:2310.20184</italic>
</comment>
</citation>
</ref>
<ref id="B94">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Tavenner</surname>
<given-names>J. P.</given-names>
</name>
<name>
<surname>Mendelev</surname>
<given-names>M. I.</given-names>
</name>
<name>
<surname>Lawson</surname>
<given-names>J. W.</given-names>
</name>
</person-group> (<year>2023</year>). <article-title>Molecular dynamics based kinetic Monte Carlo simulation for accelerated diffusion</article-title>. <source>Comput. Mater. Sci.</source> <volume>218</volume>, <fpage>111929</fpage>. <pub-id pub-id-type="doi">10.1016/j.commatsci.2022.111929</pub-id>
</citation>
</ref>
<ref id="B95">
<citation citation-type="book">
<collab>The Multimodal Universe Collaboration</collab>
<person-group person-group-type="author">
<name>
<surname>Angeloudi</surname>
<given-names>E.</given-names>
</name>
<name>
<surname>Audenaert</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Bowles</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Boyd</surname>
<given-names>B. M.</given-names>
</name>
<name>
<surname>Chemaly</surname>
<given-names>D.</given-names>
</name>
</person-group> (<year>2025</year>). <source>Multimodal universe: enabling large-scale machine learning with 100tbs of astronomical scientific data</source>. <publisher-loc>New York, NY</publisher-loc>: <publisher-name>Cornell University</publisher-name>. <comment>Available online at: <ext-link ext-link-type="uri" xlink:href="https://github.com/MultimodalUniverse/MultimodalUniverse">https://github.com/MultimodalUniverse/MultimodalUniverse</ext-link>.</comment>
</citation>
</ref>
<ref id="B96">
<citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname>Tinkham</surname>
<given-names>M.</given-names>
</name>
</person-group> (<year>2004</year>). <source>Introduction to superconductivity</source>. <publisher-loc>Mineola, New York</publisher-loc>: <publisher-name>Dover Books on Physics Series (Dover Publications</publisher-name>.</citation>
</ref>
<ref id="B97">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Vazza</surname>
<given-names>F.</given-names>
</name>
<name>
<surname>Feletti</surname>
<given-names>A.</given-names>
</name>
</person-group> (<year>2020</year>). <article-title>The quantitative comparison between the neuronal network and the cosmic web</article-title>. <source>Front. Phys.</source> <volume>8</volume>, <fpage>525731</fpage>. <pub-id pub-id-type="doi">10.3389/fphy.2020.525731</pub-id>
</citation>
</ref>
<ref id="B98">
<citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname>Weinberg</surname>
<given-names>A. I.</given-names>
</name>
<name>
<surname>Premebida</surname>
<given-names>C.</given-names>
</name>
<name>
<surname>Faria</surname>
<given-names>D. R.</given-names>
</name>
</person-group> (<year>2024</year>). <source>Causality from bottom to top: a survey</source>. <publisher-loc>New York, NY</publisher-loc>: <publisher-name>Cornell University</publisher-name>. <comment>
<italic>arXiv preprint arXiv:2403.11219</italic>
</comment>
</citation>
</ref>
<ref id="B99">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Weisburd</surname>
<given-names>D.</given-names>
</name>
<name>
<surname>Wolfowicz</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Hasisi</surname>
<given-names>B.</given-names>
</name>
<name>
<surname>Paolucci</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Andrighetto</surname>
<given-names>G.</given-names>
</name>
</person-group> (<year>2024</year>). <article-title>Using agent based modelling to advance evaluation research in radicalization and recruitment to terrorism: prospects and problems</article-title>. <source>Stud. Confl. Terror.</source>, <fpage>1</fpage>&#x2013;<lpage>24</lpage>. <pub-id pub-id-type="doi">10.1080/1057610x.2024.2361956</pub-id>
</citation>
</ref>
<ref id="B100">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Weiss</surname>
<given-names>K.</given-names>
</name>
<name>
<surname>Khoshgoftaar</surname>
<given-names>T. M.</given-names>
</name>
<name>
<surname>Wang</surname>
<given-names>D.</given-names>
</name>
</person-group> (<year>2016</year>). <article-title>A survey of transfer learning</article-title>. <source>J. Big Data</source> <volume>3</volume>, <fpage>9</fpage>&#x2013;<lpage>40</lpage>. <pub-id pub-id-type="doi">10.1186/s40537-016-0043-6</pub-id>
</citation>
</ref>
<ref id="B101">
<citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname>Wilson</surname>
<given-names>E. O.</given-names>
</name>
</person-group> (<year>1999</year>). <source>Consilience: the unity of knowledge</source>. <publisher-loc>NewYork,NY</publisher-loc>: <publisher-name>Vintage</publisher-name>, <volume>Vol. 31</volume>.</citation>
</ref>
<ref id="B102">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Zhou</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Li</surname>
<given-names>G.-X.</given-names>
</name>
</person-group> (<year>2025</year>). <article-title>Evolution of molecular clouds on galaxy-cloud scale revealed by gravitational network analysis: high-mass clouds may deplete nearby gas via accretion or merging</article-title>. <source>Mon. Notices R. Astronomical Soc.</source> <volume>537</volume>, <fpage>2630</fpage>&#x2013;<lpage>2634</lpage>. <pub-id pub-id-type="doi">10.1093/mnras/staf199</pub-id>
</citation>
</ref>
<ref id="B103">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Zimmern</surname>
<given-names>V.</given-names>
</name>
</person-group> (<year>2020a</year>). <article-title>Why brain criticality is clinically relevant: a scoping review</article-title>. <source>Front. Neural Circuits</source> <volume>14</volume>, <fpage>54</fpage>. <pub-id pub-id-type="doi">10.3389/fncir.2020.00054</pub-id>
</citation>
</ref>
<ref id="B104">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Zorzo</surname>
<given-names>A. F.</given-names>
</name>
<name>
<surname>Motta</surname>
<given-names>C. L. R. D.</given-names>
</name>
<name>
<surname>Ribeiro</surname>
<given-names>L.</given-names>
</name>
<name>
<surname>Granville</surname>
<given-names>L. Z.</given-names>
</name>
</person-group> (<year>2024</year>). <article-title>Computing everywhere, for everyone, at any level</article-title>. <source>Commun. ACM</source> <volume>67</volume>, <fpage>80</fpage>&#x2013;<lpage>82</lpage>. <pub-id pub-id-type="doi">10.1145/3653308</pub-id>
</citation>
</ref>
</ref-list>
</back>
</article>