<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.3 20210610//EN" "JATS-journalpublishing1-3.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:mml="http://www.w3.org/1998/Math/MathML" dtd-version="1.3" article-type="research-article" xml:lang="en">
  <front>
    <journal-meta>
      <journal-title-group><journal-title>Artificial Intelligence for Sustainable Cities</journal-title></journal-title-group>
      <issn pub-type="epub">2979-1464</issn>
      <publisher><publisher-name>Caravel Press</publisher-name></publisher>
    </journal-meta>
    <article-meta>
      <article-id pub-id-type="doi">10.65582/aifsc.2026.012</article-id>
      <article-id pub-id-type="publisher-id">2026.012</article-id>
      <title-group><article-title>Quantum Sociodynamics for AI-Supported Sustainable City Transitions: A Gauge-Covariant Method for Modelling Symbolic Mediation and Public Trust</article-title></title-group>
    <contrib-group>
      <contrib contrib-type="author" corresp="yes">
        <name><surname>Talut</surname><given-names>Muhammad</given-names></name>
        <xref ref-type="aff" rid="aff1"/>
        <email>mt2u18@soton.ac.uk</email>
      </contrib>
      <aff id="aff1"><institution-wrap><institution>University of Southampton</institution><institution-id institution-id-type="ror">https://ror.org/01ryk1543</institution-id></institution-wrap></aff>
    </contrib-group>
      <pub-date publication-format="electronic" date-type="pub"><day>13</day><month>10</month><year>2026</year></pub-date>
      <volume>1</volume>
      <fpage>202</fpage>
      <lpage>220</lpage>
      <self-uri xlink:href="https://caravelpress.com/journals/aifsc/articles/2026.012"/>
      <history>
        <date date-type="received"><string-date>10 July 2026</string-date></date>
        <date date-type="rev-recd"><string-date>17 August 2026</string-date></date>
        <date date-type="accepted"><string-date>26 August 2026</string-date></date>
      </history>
      <permissions>
        <copyright-statement>© 2026 The Author(s). Published by Caravel Press.</copyright-statement>
        <copyright-year>2026</copyright-year>
        <license license-type="open-access" xlink:href="https://creativecommons.org/licenses/by/4.0/">
          <license-p>This is an open access article under the CC BY 4.0 licence.</license-p>
        </license>
      </permissions>
      <abstract><p>Quantum Sociodynamics (QSD) is introduced as a computational method for modelling symbolic influence and trust in artificial-intelligence-supported sustainable city transitions. Its central object, the Symbolic Mediation Field, represents how actor orientations, source–audience relations and communication histories shape signal effects. Actor states are encoded by complex variables ψ<sub>i</sub>, symbolic transport by U(1) link variables U<sub>ij</sub>, signed coupling by q<sub>i</sub> and external interventions by J<sub>i</sub>. Gauge-invariant measures capture local alignment, path transport and loop holonomy. Formal analysis establishes invariance under local re-description, path independence under zero holonomy and a classical DeGroot–Friedkin–Johnsen limit. Deterministic simulations demonstrate response reversal, order effects and persistent relational change after institutional shocks. A 27-record heat-pump corpus illustrates application to AI-assisted urban decarbonisation governance and identifies validation requirements.</p></abstract>
      <kwd-group kwd-group-type="author">
        <kwd>Artificial Intelligence (AI)</kwd>
        <kwd>Sustainable Building Systems</kwd>
      </kwd-group>
      <funding-group>
        <funding-statement>No specific funding was received for this study.</funding-statement>
      </funding-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec1">
      <title>Introduction</title>
      <sec id="sec2">
        <title>The unresolved problem in network models of influence</title>
        <p>Artificial intelligence is becoming embedded in energy management, urban planning, environmental monitoring, mobility, digital twins and public-service decision systems. Its contribution to sustainable development can be substantial, but its effects are not automatically beneficial: transparency, accountability, distributive consequences and institutional legitimacy shape whether technically capable systems are accepted and used responsibly (<xref ref-type="bibr" rid="ref-r2">Allam and Dhunny 2019</xref>; <xref ref-type="bibr" rid="ref-r47">Son <italic>et al.</italic> 2023</xref>; <xref ref-type="bibr" rid="ref-r50">Vinuesa <italic>et al.</italic> 2020</xref>). Recent work in the editor-suggested journal set also demonstrates the expanding use of AI, digital twins and human-centred predictive modelling in sustainable built environments, while stressing interpretability, occupant feedback and stakeholder trust (Abdalla et al., 2026; Aziz et al., 2025; Razak et al., 2025; Samaei and Riffat, 2026).</p>
        <p>Urban sustainability therefore presents a modelling problem that is simultaneously technical and relational. The same heat-transition forecast, smart-grid recommendation or automated policy message can reassure one community, fail with another and intensify distrust in a third. Model accuracy alone cannot explain this variation because responses depend on source identity, prior institutional experience, communication route, perceived fairness and the accumulated history of earlier interventions.</p>
        <p>Existing approaches address parts of the problem. Artificial-intelligence and digital-twin research provides prediction, optimisation and scenario simulation for urban systems, while network models describe influence, diffusion and trust learning (<xref ref-type="bibr" rid="ref-r6">Bibri <italic>et al.</italic> 2024</xref>; <xref ref-type="bibr" rid="ref-r48">Tzachor <italic>et al.</italic> 2022</xref>). Yet the symbolic transformation of a signal during source-to-audience transport is commonly treated as an external covariate, a message feature or a static trust weight rather than as an endogenous relational state.</p>
        <p>This Technical Article develops that missing computational object, derives its invariant properties, tests its mechanisms in deterministic simulations and demonstrates its use in an urban heat-decarbonisation controversy. The method is designed as a feature-engineering, simulation and interpretability layer for artificial-intelligence-supported sustainable-city decision systems.</p>
      </sec>
      <sec id="sec3">
        <title>The Symbolic Mediation Field</title>
        <p>Quantum Sociodynamics (QSD) is organised around the <bold>Symbolic Mediation Field</bold> (SMF):</p>
        <disp-quote><p><italic>A Symbolic Mediation Field is a dynamically evolving relational structure through which communicative signals acquire differential capacities to alter belief, affect, institutional trust and behavioural orientation. Its state is produced by accumulated interaction among actors, sources, institutions, material events and counter-messages. The effect of a signal depends jointly on the current field, the actor’s signed coupling, the source relation, the route of transmission and the ordered history of earlier interactions.</italic></p></disp-quote>
        <p>The SMF is not a synonym for context. Context is often represented as a set of background covariates. The SMF is endogenous: communication and institutional events change the field that conditions later communication. Nor is the field simply a frame. A frame is an organisation of meaning within a message or discourse; in QSD, a frame is a symbolic excitation entering a larger relational medium. The explanatory target is therefore not only message content or individual response, but the emergence of meso- and macro-level credibility structures: aligned communities, fragmented trust topologies, path-dependent institutional reputations and persistent inconsistency around communication cycles.</p>
      </sec>
      <sec id="sec4">
        <title>Why a gauge architecture?</title>
        <p>QSD draws structurally from the gauge architecture of quantum electrodynamics (QED), not from generic claims that society is uncertain, complex or “quantum”. The relevant inheritance is a rigorous interaction grammar: locally represented states, mediator variables on relations, coupling strengths, covariant transport and observables that remain unchanged under arbitrary local re-description.</p>
        <p>This choice addresses a genuine modelling problem. Different communities may code the same interpretive orientation from different baselines; a formal result should not depend on those arbitrary local choices. What is sociologically meaningful is relational alignment after transport, accumulated transformation along a route and inconsistency around a closed communication cycle. Gauge invariance separates such substantive quantities from representational conventions.</p>
        <p>QSD does not claim that people are particles, that messages are photons or that social systems literally obey quantum electrodynamics. It proposes a QED-derived, U(1)-type network method whose social correspondences are explicit and whose predictions can be compared with simpler models. In sustainable-city applications, the method can represent residents, institutions, media, utilities and AI decision systems as interacting nodes while preserving the distinction between technical recommendation, source relation and communication history.</p>
      </sec>
      <sec id="sec5">
        <title>Contribution and priority claim</title>
        <p>The article makes five linked contributions.</p>
        <list list-type="order">
          <list-item><p><bold>A new explanatory object.</bold> It defines symbolic mediation as a state-bearing and coevolving relational field rather than a message attribute or static context.</p></list-item>
          <list-item><p><bold>A new network representation.</bold> It replaces fixed scalar influence weights with meaning-bearing link variables that transform actor states during transmission.</p></list-item>
          <list-item><p><bold>New gauge-invariant observables.</bold> It introduces relational alignment, path transport and closed-loop holonomy as measures of credibility compatibility, route dependence and unresolved cycle inconsistency.</p></list-item>
          <list-item><p><bold>A nesting result.</bold> It shows that standard weighted influence dynamics arise as a flat, real-valued, static-link limit of QSD.</p></list-item>
          <list-item><p><bold>A falsifiable empirical programme.</bold> It derives conditions for response reversal, ordered exposure, field memory and route curvature and states when the additional structure should be rejected.</p></list-item>
        </list>
        <p>A targeted audit of framing theory, Science and Technology Studies, misinformation psychology, opinion dynamics, sociophysics, quantum cognition, quantum social ontology, quantum-field-inspired decision models, signed-network gauge models and AI-enabled urban modelling found no earlier framework combining a state-bearing symbolic mediator field, signed actor coupling, local gauge covariance, dynamic source–audience transport, path and loop observables, field feedback and a classical influence limit in one computational method. QSD is therefore advanced as a distinct technical contribution rather than a relabelling of existing approaches.</p>
      </sec>
    </sec>
    <sec id="sec6">
      <title>Technical Background and Methodological Gap</title>
      <sec id="sec7">
        <title>AI-supported urban transitions and public trust</title>
        <p>Artificial-intelligence-supported urban systems increasingly integrate sensor data, optimisation, forecasting and digital-twin simulation. Reviews of smart-city and urban-planning applications emphasise that wider adoption requires collaboration among government, technical experts and affected communities, while digital-twin research identifies governance, uncertainty and social representation as continuing limitations (<xref ref-type="bibr" rid="ref-r6">Bibri <italic>et al.</italic> 2024</xref>; <xref ref-type="bibr" rid="ref-r47">Son <italic>et al.</italic> 2023</xref>; <xref ref-type="bibr" rid="ref-r48">Tzachor <italic>et al.</italic> 2022</xref>). Related applications in climate-resilient infrastructure also demonstrate the use of AI-guided optimisation and digital-twin methods to assess and improve the performance of low-carbon coastal systems (<xref ref-type="bibr" rid="ref-r41">Riffat <italic>et al.</italic> 2025</xref>). Related studies report AIoT-enabled building control, digital-twin integration and AI-guided optimisation for low-carbon infrastructure, reinforcing the need to connect technical performance with user-centred governance and deployment conditions (<xref ref-type="bibr" rid="ref-r35">Onweh <italic>et al.</italic> 2025</xref>; <xref ref-type="bibr" rid="ref-r41">Riffat <italic>et al.</italic> 2025</xref>).</p>
        <p>The technical gap is not the absence of predictive models; it is the absence of a formal layer for representing how recommendations acquire different meanings as they move through institutions, platforms and communities. Conventional AI pipelines may model the probability of acceptance, but they seldom separate exposure magnitude, actor coupling, source-conditioned transformation and route inconsistency as distinct state variables.</p>
        <p>QSD addresses this gap by treating symbolic relations as time-varying transporters that can be estimated from longitudinal exposure, source-trust, media and behavioural data. Gauge-invariant features can then be supplied to machine-learning, agent-based, digital-twin or decision-support systems without allowing predictions to depend on arbitrary local coding baselines.</p>
      </sec>
      <sec id="sec8">
        <title>Network influence, trust and message interaction</title>
        <p>DeGroot and Friedkin–Johnsen models treat opinion change as repeated weighted averaging, while network-autocorrelation and dynamic-network models represent relational dependence and changing ties (<xref ref-type="bibr" rid="ref-r9">Butts 2025</xref>; <xref ref-type="bibr" rid="ref-r15">Degroot 1974</xref>; <xref ref-type="bibr" rid="ref-r20">Friedkin and Johnsen 1990</xref>; <xref ref-type="bibr" rid="ref-r27">Leenders 2002</xref>). Formal trust models increasingly treat trust as learned and socially interdependent rather than as a fixed personality attribute (<xref ref-type="bibr" rid="ref-r32">Meylahn <italic>et al.</italic> 2024</xref>).</p>
        <p>Message-interaction models also show that communication cannot always be treated as independent input (<xref ref-type="bibr" rid="ref-r30">Mai <italic>et al.</italic> 2026</xref>). QSD adds a different structure: the relation itself carries a transformation, the recipient has a signed issue-specific coupling and institutional events can update the relational medium even when network topology and message content remain unchanged.</p>
        <p>For AI-supported urban governance, this shift redirects analysis from isolated prediction to system-level interpretability. Persistent distrust, fragmented credibility and polarised response can emerge from the coevolution of actor states and communication relations, providing information that a high-accuracy classifier or optimiser may otherwise miss.</p>
      </sec>
      <sec id="sec9">
        <title>Signed networks, structural balance and cycle consistency</title>
        <p>Signed-network models distinguish positive and negative relations and use cycle structure to analyse balance. Gauge transformations can identify equivalent sign configurations, while frustrated cycles indicate incompatibility that cannot be removed by relabelling (<xref ref-type="bibr" rid="ref-r19">Facchetti <italic>et al.</italic> 2011</xref>). QSD generalises this insight from binary signs to continuous symbolic transformations. A link phase can represent more than attraction or hostility: it can encode source-conditioned reinterpretation, credibility displacement and route-specific semantic shift.</p>
        <p>The corresponding loop quantity is holonomy. In a flat field, transport between two nodes is independent of route. In a curved field, different routes accumulate different transformations. This supplies a compact mathematical representation of a common sociological phenomenon: two actors can receive the “same” proposition yet receive non-equivalent social objects because the proposition has travelled through different institutional and interpersonal chains.</p>
      </sec>
      <sec id="sec10">
        <title>Quantum-like social models and the exact boundary</title>
        <p>Quantum cognition uses Hilbert-space probability to represent contextuality and question-order effects (<xref ref-type="bibr" rid="ref-r8">Busemeyer and Bruza 2012</xref>; <xref ref-type="bibr" rid="ref-r51">Wang <italic>et al.</italic> 2014</xref>). Wendt (<xref ref-type="bibr" rid="ref-r53">2015</xref>) proposes a quantum social ontology; Bagarello, Basieva and Khrennikov (<xref ref-type="bibr" rid="ref-r4">2018</xref>) model belief stabilisation through interaction with an informational environment; Khrennikov (<xref ref-type="bibr" rid="ref-r25">2020</xref>) develops quantum-field and information analogies for social processes. These works establish legitimate precedents for quantum-derived mathematics in social inquiry.</p>
        <p>QSD is neither a restatement of those models nor a claim about macroscopic physical quantum states. Its unit of formalisation is the <bold>source–actor communication relation on a coevolving social network</bold>. The distinctive architecture combines actor states, signed coupling, dynamic link transport, local gauge freedom, route observables, loop curvature and feedback. Quantum probability is optional: it should be introduced only if non-classical constraints outperform classical alternatives. The formal novelty of QSD rests on the gauge-covariant network architecture developed below.</p>
      </sec>
      <sec id="sec11">
        <title>Novelty matrix</title>
        <p>Table 1 compares QSD with adjacent computational approaches and identifies the specific modelling gap addressed by the proposed method.</p>
        <table-wrap id="tbl1">
          <label>Table 1</label>
          <caption><p>Comparison of QSD with Adjacent Computational Approaches.</p></caption>
          <table>
            <thead>
              <tr>
                <th><bold>Approach</bold></th>
                <th><bold>Primary strength</bold></th>
                <th><bold>Structural limitation addressed by QSD</bold></th>
              </tr>
            </thead>
            <tbody>
              <tr>
                <td>DeGroot / Friedkin–Johnsen influence</td>
                <td>Weighted updating and consensus with predisposition</td>
                <td>Links are generally scalar rather than meaning-bearing transporters</td>
              </tr>
              <tr>
                <td>Network autocorrelation</td>
                <td>Relational dependence and model-based weight matrices</td>
                <td>Route transformation and cycle inconsistency are not explicit observables</td>
              </tr>
              <tr>
                <td>Dynamic-network influence</td>
                <td>Coevolution of ties and attributes</td>
                <td>A topologically stable relation can change symbolically without appearing or disappearing</td>
              </tr>
              <tr>
                <td>Formal trust models</td>
                <td>Learning whether an institution is trustworthy</td>
                <td>Trust-conditioned signal transformation is not represented as gauge transport</td>
              </tr>
              <tr>
                <td>Message-interaction models</td>
                <td>Non-independent effects of multiple messages</td>
                <td>Interaction history is not necessarily stored in a coevolving relational field</td>
              </tr>
              <tr>
                <td>Signed-network balance</td>
                <td>Positive/negative ties and frustrated cycles</td>
                <td>Binary signs are generalised to continuous symbolic phase and route holonomy</td>
              </tr>
              <tr>
                <td>Quantum cognition</td>
                <td>Contextual probability and ordered judgments</td>
                <td>Focus is primarily individual cognition rather than networked symbolic mediation</td>
              </tr>
              <tr>
                <td><bold>Quantum Sociodynamics</bold></td>
                <td><bold>Symbolic influence in coevolving social networks</bold></td>
                <td><bold>Unifies state, signed coupling, dynamic transport, local gauge freedom, route curvature and feedback</bold></td>
              </tr>
              <tr>
                <td>AI and urban digital-twin models</td>
                <td>Prediction, optimisation and real-time simulation of urban systems</td>
                <td>Trust, symbolic route transformation and communication history are often external to the computational state</td>
              </tr>
            </tbody>
          </table>
        </table-wrap>
      </sec>
    </sec>
    <sec id="sec12">
      <title>Materials and Methods</title>
      <p>All figures, equations, tables and methodological materials used in this study were created by the author; no third-party permissions were required.</p>
      <sec id="sec13">
        <title>Model entities, signals and field state</title>
        <p>Let a controversy or communication system be represented by a directed graph</p>
        <disp-formula id="eq1">
          <label>(1)</label>
          <math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>G</mi><mo>=</mo><mo stretchy="false" form="prefix">(</mo><mi>V</mi><mo>,</mo><mi>E</mi><mo stretchy="false" form="postfix">)</mo><mo>,</mo><mspace width="1.0em"></mspace><mspace width="1.0em"></mspace><mo stretchy="false" form="prefix">(</mo><mn>1</mn><mo stretchy="false" form="postfix">)</mo></mrow><annotation encoding="application/x-tex">G = (V,E),\quad\quad(1)</annotation></semantics></math>
        </disp-formula>
        <p>where <inline-formula><tex-math><![CDATA[V]]></tex-math></inline-formula> contains actors, organisations, institutions or analytically defined groups and <inline-formula><tex-math><![CDATA[E]]></tex-math></inline-formula> contains directed communication relations. A signal <inline-formula><tex-math><![CDATA[m]]></tex-math></inline-formula> is a claim, image, statistic, testimony, correction or institutional announcement. A frame is an organisation of meaning within a signal. The Symbolic Mediation Field is the joint state of actor orientations and relational transporters through which signals propagate.</p>
        <p>In an urban application, nodes may represent residents, neighbourhood groups, utilities, local authorities, technology firms, media organisations or AI-enabled decision services. An AI system is treated as a source or decision node only when it emits recommendations, rankings, forecasts or explanations that enter a social interaction; the model does not anthropomorphise the software.</p>
        <p>Each node <inline-formula><tex-math><![CDATA[i]]></tex-math></inline-formula> carries an issue-specific complex state</p>
        <disp-formula id="eq2">
          <label>(2)</label>
          <math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><msub><mi>ψ</mi><mi>i</mi></msub><mo stretchy="false" form="prefix">(</mo><mi>t</mi><mo stretchy="false" form="postfix">)</mo><mo>=</mo><msub><mi>r</mi><mi>i</mi></msub><mo stretchy="false" form="prefix">(</mo><mi>t</mi><mo stretchy="false" form="postfix">)</mo><msup><mi>e</mi><mrow><mi>i</mi><msub><mi>θ</mi><mi>i</mi></msub><mo stretchy="false" form="prefix">(</mo><mi>t</mi><mo stretchy="false" form="postfix">)</mo></mrow></msup><mo>,</mo><mspace width="1.0em"></mspace><mspace width="1.0em"></mspace><msub><mi>r</mi><mi>i</mi></msub><mo stretchy="false" form="prefix">(</mo><mi>t</mi><mo stretchy="false" form="postfix">)</mo><mo>≥</mo><mn>0</mn><mo>,</mo><mspace width="1.0em"></mspace><mspace width="1.0em"></mspace><mo stretchy="false" form="prefix">(</mo><mn>2</mn><mo stretchy="false" form="postfix">)</mo></mrow><annotation encoding="application/x-tex">\psi_{i}(t) = r_{i}(t)e^{i\theta_{i}(t)},\quad\quad r_{i}(t) \geq 0,\quad\quad(2)</annotation></semantics></math>
        </disp-formula>
        <p>where <inline-formula><tex-math><![CDATA[r_{i}]]></tex-math></inline-formula> denotes the strength, confidence or salience of the orientation and <inline-formula><tex-math><![CDATA[\theta_{i}]]></tex-math></inline-formula> its interpretive orientation relative to a local reference. These are latent constructs, not literal wavefunctions.</p>
        <p>A directed link from <inline-formula><tex-math><![CDATA[j]]></tex-math></inline-formula> to <inline-formula><tex-math><![CDATA[i]]></tex-math></inline-formula> has two components:</p>
        <disp-formula id="eq3">
          <label>(3)</label>
          <math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><msub><mi>K</mi><mrow><mi>i</mi><mi>j</mi></mrow></msub><mo stretchy="false" form="prefix">(</mo><mi>t</mi><mo stretchy="false" form="postfix">)</mo><mo>≥</mo><mn>0</mn><mo>,</mo><mspace width="1.0em"></mspace><mspace width="1.0em"></mspace><msub><mi>U</mi><mrow><mi>i</mi><mi>j</mi></mrow></msub><mo stretchy="false" form="prefix">(</mo><mi>t</mi><mo stretchy="false" form="postfix">)</mo><mo>=</mo><msup><mi>e</mi><mrow><mi>−</mi><mi>i</mi><msub><mi>A</mi><mrow><mi>i</mi><mi>j</mi></mrow></msub><mo stretchy="false" form="prefix">(</mo><mi>t</mi><mo stretchy="false" form="postfix">)</mo></mrow></msup><mo>∈</mo><mi>U</mi><mo stretchy="false" form="prefix">(</mo><mn>1</mn><mo stretchy="false" form="postfix">)</mo><mi>.</mi><mspace width="1.0em"></mspace><mspace width="1.0em"></mspace><mo stretchy="false" form="prefix">(</mo><mn>3</mn><mo stretchy="false" form="postfix">)</mo></mrow><annotation encoding="application/x-tex">K_{ij}(t) \geq 0,\quad\quad U_{ij}(t) = e^{- iA_{ij}(t)} \in U(1).\quad\quad(3)</annotation></semantics></math>
        </disp-formula>
        <p><inline-formula><tex-math><![CDATA[K_{ij}]]></tex-math></inline-formula> is the exposure or channel strength. <inline-formula><tex-math><![CDATA[U_{ij}]]></tex-math></inline-formula> is the symbolic transporter, and <inline-formula><tex-math><![CDATA[A_{ij}]]></tex-math></inline-formula> is the accumulated relational phase associated with source identity, credibility, medium and prior interaction. The field state is</p>
        <disp-formula id="eq4">
          <label>(4)</label>
          <math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi mathvariant="normal">Φ</mi><mo stretchy="false" form="prefix">(</mo><mi>t</mi><mo stretchy="false" form="postfix">)</mo><mo>=</mo><mo stretchy="false" form="prefix">{</mo><msub><mi>ψ</mi><mi>i</mi></msub><mo stretchy="false" form="prefix">(</mo><mi>t</mi><mo stretchy="false" form="postfix">)</mo><mo>,</mo><msub><mi>K</mi><mrow><mi>i</mi><mi>j</mi></mrow></msub><mo stretchy="false" form="prefix">(</mo><mi>t</mi><mo stretchy="false" form="postfix">)</mo><mo>,</mo><msub><mi>U</mi><mrow><mi>i</mi><mi>j</mi></mrow></msub><mo stretchy="false" form="prefix">(</mo><mi>t</mi><mo stretchy="false" form="postfix">)</mo><mo>:</mo><mo stretchy="false" form="prefix">(</mo><mi>i</mi><mo>,</mo><mi>j</mi><mo stretchy="false" form="postfix">)</mo><mo>∈</mo><mi>E</mi><mo stretchy="false" form="postfix">}</mo><mi>.</mi><mspace width="1.0em"></mspace><mspace width="1.0em"></mspace><mo stretchy="false" form="prefix">(</mo><mn>4</mn><mo stretchy="false" form="postfix">)</mo></mrow><annotation encoding="application/x-tex">\Phi(t) = \{\psi_{i}(t),K_{ij}(t),U_{ij}(t):(i,j) \in E\}.\quad\quad(4)</annotation></semantics></math>
        </disp-formula>
        <p>Each actor or group also has an issue-specific signed coupling coefficient <inline-formula><tex-math><![CDATA[q_{i}\mathbb{\in R}]]></tex-math></inline-formula>. Its magnitude represents responsiveness to the field; its sign represents alignment or counter-alignment. Social charge is therefore not affective intensity. Emotion may influence <inline-formula><tex-math><![CDATA[q_{i}]]></tex-math></inline-formula> empirically, but the constructs are distinct.</p>
      </sec>
      <sec id="sec14">
        <title>QSD postulates</title>
        <p>The formal postulates and their sociological interpretations are summarised in Table 2.</p>
        <table-wrap id="tbl2">
          <label>Table 2</label>
          <caption><p>Formal Postulates and Sociological Interpretation of QSD.</p></caption>
          <table>
            <thead>
              <tr>
                <th><bold>Postulate</bold></th>
                <th><bold>Formal claim</bold></th>
                <th><bold>Sociological implication</bold></th>
              </tr>
            </thead>
            <tbody>
              <tr>
                <td>P1: Field mediation</td>
                <td>Signal effects are functions of Φ(t), not content alone.</td>
                <td>Identical messages can generate different responses in different relational states.</td>
              </tr>
              <tr>
                <td>P2: Signed local coupling</td>
                <td>q<sub>i</sub> varies in magnitude and sign.</td>
                <td>The same signal may move groups in opposite directions.</td>
              </tr>
              <tr>
                <td>P3: Gauge covariance</td>
                <td>Arbitrary local phase origins do not alter observables.</td>
                <td>Conclusions cannot depend on coding baselines chosen by the analyst.</td>
              </tr>
              <tr>
                <td>P4: Dynamic transport</td>
                <td>U<sub>ij</sub>(t) is endogenous.</td>
                <td>Institutional events can change later message effects without changing network topology.</td>
              </tr>
              <tr>
                <td>P5: Route memory</td>
                <td>Transport composes along ordered paths.</td>
                <td>Source sequence can matter after message content is held constant.</td>
              </tr>
              <tr>
                <td>P6: Loop curvature</td>
                <td>Closed routes can accumulate non-zero holonomy.</td>
                <td>Contradictory credibility cycles can persist as meso-level structure.</td>
              </tr>
              <tr>
                <td>P7: Comparative nesting</td>
                <td>Simpler influence models are limiting cases.</td>
                <td>Additional QSD structure is retained only when it improves explanation or prediction.</td>
              </tr>
            </tbody>
          </table>
        </table-wrap>
      </sec>
    </sec>
    <sec id="sec15">
      <title>Gauge-Covariant Computational Method</title>
      <sec id="sec16">
        <title>Local re-description and invariance</title>
        <p>Let <inline-formula><tex-math><![CDATA[\phi_{i}\mathbb{\in R}]]></tex-math></inline-formula> denote an arbitrary local change in the phase origin used to represent node <inline-formula><tex-math><![CDATA[i]]></tex-math></inline-formula>. QSD requires covariance under</p>
        <disp-formula id="eq5">
          <label>(5)</label>
          <math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><msubsup><mi>ψ</mi><mi>i</mi><mo>′</mo></msubsup><mo>=</mo><msup><mi>e</mi><mrow><mi>i</mi><msub><mi>ϕ</mi><mi>i</mi></msub></mrow></msup><msub><mi>ψ</mi><mi>i</mi></msub><mo>,</mo><mspace width="1.0em"></mspace><mspace width="1.0em"></mspace><msubsup><mi>U</mi><mrow><mi>i</mi><mi>j</mi></mrow><mo>′</mo></msubsup><mo>=</mo><msup><mi>e</mi><mrow><mi>i</mi><msub><mi>ϕ</mi><mi>i</mi></msub></mrow></msup><msub><mi>U</mi><mrow><mi>i</mi><mi>j</mi></mrow></msub><msup><mi>e</mi><mrow><mi>−</mi><mi>i</mi><msub><mi>ϕ</mi><mi>j</mi></msub></mrow></msup><mo>,</mo><mspace width="1.0em"></mspace><mspace width="1.0em"></mspace><msubsup><mi>J</mi><mi>i</mi><mo>′</mo></msubsup><mo>=</mo><msup><mi>e</mi><mrow><mi>i</mi><msub><mi>ϕ</mi><mi>i</mi></msub></mrow></msup><msub><mi>J</mi><mi>i</mi></msub><mi>.</mi><mspace width="1.0em"></mspace><mspace width="1.0em"></mspace><mo stretchy="false" form="prefix">(</mo><mn>5</mn><mo stretchy="false" form="postfix">)</mo></mrow><annotation encoding="application/x-tex">\psi_{i}' = e^{i\phi_{i}}\psi_{i},\quad\quad U_{ij}' = e^{i\phi_{i}}U_{ij}e^{- i\phi_{j}},\quad\quad J_{i}' = e^{i\phi_{i}}J_{i}.\quad\quad(5)</annotation></semantics></math>
        </disp-formula>
        <p>Here <inline-formula><tex-math><![CDATA[J_{i}]]></tex-math></inline-formula> is an external symbolic excitation applied at node <inline-formula><tex-math><![CDATA[i]]></tex-math></inline-formula>. Writing <inline-formula><tex-math><![CDATA[\phi_{i} = q_{i}\chi_{i}]]></tex-math></inline-formula> recovers the familiar charge-weighted QED notation, but the empirical coupling coefficient <inline-formula><tex-math><![CDATA[q_{i}]]></tex-math></inline-formula> is retained explicitly in the response dynamics below. This separation prevents an arbitrary representation choice from being mistaken for an estimated social susceptibility.</p>
      </sec>
      <sec id="sec17">
        <title>Gauge-invariant observables</title>
        <p>The local magnitude is</p>
        <disp-formula id="eq6">
          <label>(6)</label>
          <math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><msub><mi>ρ</mi><mi>i</mi></msub><mo>=</mo><msup><mrow><mo stretchy="true" form="prefix">|</mo><msub><mi>ψ</mi><mi>i</mi></msub><mo stretchy="true" form="postfix">|</mo></mrow><mn>2</mn></msup><mo>=</mo><msubsup><mi>r</mi><mi>i</mi><mn>2</mn></msubsup><mi>.</mi><mspace width="1.0em"></mspace><mspace width="1.0em"></mspace><mo stretchy="false" form="prefix">(</mo><mn>6</mn><mo stretchy="false" form="postfix">)</mo></mrow><annotation encoding="application/x-tex">\rho_{i} = \left| \psi_{i} \right|^{2} = r_{i}^{2}.\quad\quad(6)</annotation></semantics></math>
        </disp-formula>
        <p>Relational alignment is</p>
        <disp-formula id="eq7">
          <label>(7)</label>
          <math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><msub><mi>C</mi><mrow><mi>i</mi><mi>j</mi></mrow></msub><mo>=</mo><mi>R</mi><mi>e</mi><mrow><mo stretchy="true" form="prefix">(</mo><msubsup><mi>ψ</mi><mi>i</mi><mo>*</mo></msubsup><msub><mi>U</mi><mrow><mi>i</mi><mi>j</mi></mrow></msub><msub><mi>ψ</mi><mi>j</mi></msub><mo stretchy="true" form="postfix">)</mo></mrow><mo>=</mo><msub><mi>r</mi><mi>i</mi></msub><msub><mi>r</mi><mi>j</mi></msub><mrow><mi mathvariant="normal">cos</mi><mo>⁡</mo></mrow><mrow><mo stretchy="true" form="prefix">(</mo><msub><mi>θ</mi><mi>j</mi></msub><mo>−</mo><msub><mi>θ</mi><mi>i</mi></msub><mo>−</mo><msub><mi>A</mi><mrow><mi>i</mi><mi>j</mi></mrow></msub><mo stretchy="true" form="postfix">)</mo></mrow><mi>.</mi><mspace width="1.0em"></mspace><mspace width="1.0em"></mspace><mo stretchy="false" form="prefix">(</mo><mn>7</mn><mo stretchy="false" form="postfix">)</mo></mrow><annotation encoding="application/x-tex">C_{ij} = Re\left( \psi_{i}^{*}U_{ij}\psi_{j} \right) = r_{i}r_{j}\cos\left( \theta_{j} - \theta_{i} - A_{ij} \right).\quad\quad(7)</annotation></semantics></math>
        </disp-formula>
        <p>For a directed path <inline-formula><tex-math><![CDATA[\mathcal{P:}s \rightarrow i]]></tex-math></inline-formula>, define</p>
        <disp-formula id="eq8">
          <label>(8)</label>
          <math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>U</mi><mrow><mo stretchy="true" form="prefix">(</mo><mi mathvariant="script">𝒫</mi><mo stretchy="true" form="postfix">)</mo></mrow><mo>=</mo><munderover><mo>∏</mo><mrow><mo stretchy="false" form="prefix">(</mo><mi>j</mi><mi>k</mi><mo stretchy="false" form="postfix">)</mo><mrow><mo mathvariant="script">∈</mo><mi mathvariant="script">𝒫</mi></mrow></mrow><mrow></mrow></munderover><msub><mi>U</mi><mrow><mi>j</mi><mi>k</mi></mrow></msub><mo>,</mo><mspace width="1.0em"></mspace><mspace width="1.0em"></mspace><msub><mi>C</mi><mi mathvariant="script">𝒫</mi></msub><mo>=</mo><mi>R</mi><mi>e</mi><mrow><mo stretchy="true" form="prefix">[</mo><msubsup><mi>ψ</mi><mi>i</mi><mo>*</mo></msubsup><mi>U</mi><mrow><mo stretchy="true" form="prefix">(</mo><mi mathvariant="script">𝒫</mi><mo stretchy="true" form="postfix">)</mo></mrow><msub><mi>ψ</mi><mi>s</mi></msub><mo stretchy="true" form="postfix">]</mo></mrow><mi>.</mi><mspace width="1.0em"></mspace><mspace width="1.0em"></mspace><mo stretchy="false" form="prefix">(</mo><mn>8</mn><mo stretchy="false" form="postfix">)</mo></mrow><annotation encoding="application/x-tex">U\left( \mathcal{P} \right) = \prod_{(jk)\mathcal{\in P}}^{}U_{jk},\quad\quad C_{\mathcal{P}} = Re\left\lbrack \psi_{i}^{*}U\left( \mathcal{P} \right)\psi_{s} \right\rbrack.\quad\quad(8)</annotation></semantics></math>
        </disp-formula>
        <p>For a closed cycle <inline-formula><tex-math><![CDATA[\mathcal{C}]]></tex-math></inline-formula>,</p>
        <disp-formula id="eq9">
          <label>(9)</label>
          <math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>W</mi><mrow><mo stretchy="true" form="prefix">(</mo><mi mathvariant="script">𝒞</mi><mo stretchy="true" form="postfix">)</mo></mrow><mo>=</mo><munderover><mo>∏</mo><mrow><mo stretchy="false" form="prefix">(</mo><mi>i</mi><mi>j</mi><mo stretchy="false" form="postfix">)</mo><mrow><mo mathvariant="script">∈</mo><mi mathvariant="script">𝒞</mi></mrow></mrow><mrow></mrow></munderover><msub><mi>U</mi><mrow><mi>i</mi><mi>j</mi></mrow></msub><mo>=</mo><msup><mi>e</mi><mrow><mi>−</mi><mi>i</mi><msub><mi mathvariant="normal">Ω</mi><mi mathvariant="script">𝒞</mi></msub></mrow></msup><mo>,</mo><mspace width="1.0em"></mspace><mspace width="1.0em"></mspace><msub><mi mathvariant="normal">Ω</mi><mi mathvariant="script">𝒞</mi></msub><mo>=</mo><munderover><mo>∑</mo><mrow><mo stretchy="false" form="prefix">(</mo><mi>i</mi><mi>j</mi><mo stretchy="false" form="postfix">)</mo><mrow><mo mathvariant="script">∈</mo><mi mathvariant="script">𝒞</mi></mrow></mrow><mrow></mrow></munderover><msub><mi>A</mi><mrow><mi>i</mi><mi>j</mi></mrow></msub><mspace width="0.222em"></mspace><mo stretchy="false" form="prefix">(</mo><mi>m</mi><mi>o</mi><mi>d</mi><mspace width="0.222em"></mspace><mn>2</mn><mi>π</mi><mo stretchy="false" form="postfix">)</mo><mi>.</mi><mspace width="1.0em"></mspace><mspace width="1.0em"></mspace><mo stretchy="false" form="prefix">(</mo><mn>9</mn><mo stretchy="false" form="postfix">)</mo></mrow><annotation encoding="application/x-tex">W\left( \mathcal{C} \right) = \prod_{(ij)\mathcal{\in C}}^{}U_{ij} = e^{- i\Omega_{\mathcal{C}}},\quad\quad\Omega_{\mathcal{C}} = \sum_{(ij)\mathcal{\in C}}^{}A_{ij}\ (mod\ 2\pi).\quad\quad(9)</annotation></semantics></math>
        </disp-formula>
        <p><inline-formula><tex-math><![CDATA[W\left( \mathcal{C} \right)]]></tex-math></inline-formula> is the Wilson-loop analogue and <inline-formula><tex-math><![CDATA[\Omega_{\mathcal{C}}]]></tex-math></inline-formula> is relational curvature. A non-zero value represents transformation accumulated around a closed communication route that cannot be removed by changing local coding origins.</p>
        <p>Figure 1 illustrates gauge-covariant symbolic transport across alternative communication routes and the closed-loop quantity used to diagnose route inconsistency.</p>
        <fig id="fig1">
          <label>Figure 1</label>
          <caption><p>Gauge-Covariant Symbolic Transport Across Alternative Communication Routes. Different routes can accumulate distinct relational phases; closed loops identify unresolved relational inconsistency. Source: Author-created figure.</p></caption>
          <graphic xlink:href="obj/3f/2a/3f2a5934c9cbea706c3f1f37901831514c8a7b68cdbfbbc85f6acc16b1ab83fc"/>
        </fig>
      </sec>
      <sec id="sec18">
        <title>Field functional</title>
        <p>A minimal gauge-invariant field functional is</p>
        <disp-formula id="eq10">
          <label>(10)</label>
          <math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mtable><mtr><mtd columnalign="center" style="text-align:center"><msub><mi mathvariant="script">ℱ</mi><mrow><mi>Q</mi><mi>S</mi><mi>D</mi></mrow></msub><mo>=</mo></mtd><mtd columnalign="center" style="text-align:center"><munderover><mo>∑</mo><mrow><mi>i</mi><mo>∈</mo><mi>V</mi></mrow><mrow></mrow></munderover><msub><mi>V</mi><mi>i</mi></msub><mrow><mo stretchy="true" form="prefix">(</mo><msup><mrow><mo stretchy="true" form="prefix">|</mo><msub><mi>ψ</mi><mi>i</mi></msub><mo stretchy="true" form="postfix">|</mo></mrow><mn>2</mn></msup><mo stretchy="true" form="postfix">)</mo></mrow><mo>+</mo><munderover><mo>∑</mo><mrow><mo stretchy="false" form="prefix">(</mo><mi>i</mi><mo>,</mo><mi>j</mi><mo stretchy="false" form="postfix">)</mo><mo>∈</mo><mi>E</mi></mrow><mrow></mrow></munderover><msub><mi>K</mi><mrow><mi>i</mi><mi>j</mi></mrow></msub><msup><mrow><mo stretchy="true" form="prefix">|</mo><msub><mi>ψ</mi><mi>i</mi></msub><mo>−</mo><msub><mi>U</mi><mrow><mi>i</mi><mi>j</mi></mrow></msub><msub><mi>ψ</mi><mi>j</mi></msub><mo stretchy="true" form="postfix">|</mo></mrow><mn>2</mn></msup></mtd></mtr><mtr><mtd columnalign="center" style="text-align:center"></mtd><mtd columnalign="center" style="text-align:center"><mi>+</mi><mi>κ</mi><munderover><mo>∑</mo><mi mathvariant="script">𝒞</mi><mrow></mrow></munderover><mrow><mo stretchy="true" form="prefix">[</mo><mn>1</mn><mo>−</mo><mi>c</mi><mi>o</mi><mi>s</mi><mrow><mo stretchy="true" form="prefix">(</mo><msub><mi mathvariant="normal">Ω</mi><mi mathvariant="script">𝒞</mi></msub><mo stretchy="true" form="postfix">)</mo></mrow><mo stretchy="true" form="postfix">]</mo></mrow><mo>−</mo><munderover><mo>∑</mo><mi>i</mi><mrow></mrow></munderover><mrow><mo stretchy="true" form="prefix">(</mo><msubsup><mi>J</mi><mi>i</mi><mo>*</mo></msubsup><msub><mi>ψ</mi><mi>i</mi></msub><mo>+</mo><msub><mi>J</mi><mi>i</mi></msub><msubsup><mi>ψ</mi><mi>i</mi><mo>*</mo></msubsup><mo stretchy="true" form="postfix">)</mo></mrow><mi>.</mi></mtd></mtr></mtable><mspace width="1.0em"></mspace><mspace width="1.0em"></mspace><mo stretchy="false" form="prefix">(</mo><mn>10</mn><mo stretchy="false" form="postfix">)</mo></mrow><annotation encoding="application/x-tex">\begin{matrix}
\mathcal{F}_{QSD} = &amp; \sum_{i \in V}^{}V_{i}\left( \left| \psi_{i} \right|^{2} \right) + \sum_{(i,j) \in E}^{}K_{ij}\left| \psi_{i} - U_{ij}\psi_{j} \right|^{2} \\
 &amp; + \kappa\sum_{\mathcal{C}}^{}\left\lbrack 1 - cos\left( \Omega_{\mathcal{C}} \right) \right\rbrack - \sum_{i}^{}\left( J_{i}^{*}\psi_{i} + J_{i}\psi_{i}^{*} \right).
\end{matrix}\quad\quad(10)</annotation></semantics></math>
        </disp-formula>
        <p><inline-formula><tex-math><![CDATA[V_{i}]]></tex-math></inline-formula> is a local stability potential, the edge term measures transported mismatch, the loop term penalises curvature and <inline-formula><tex-math><![CDATA[J_{i}]]></tex-math></inline-formula> represents external intervention. Equation (10) is a model class rather than a literal universal law. Alternative potentials and update processes can be compared empirically without changing the gauge structure.</p>
      </sec>
      <sec id="sec19">
        <title>Actor–field coevolution</title>
        <p>A dissipative dynamics is</p>
        <disp-formula id="eq11">
          <label>(11)</label>
          <math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><msub><mi>τ</mi><mi>i</mi></msub><mfrac><mrow><mi>d</mi><msub><mi>ψ</mi><mi>i</mi></msub></mrow><mrow><mi>d</mi><mi>t</mi></mrow></mfrac><mo>=</mo><mi>−</mi><mfrac><mrow><mi>∂</mi><msub><mi mathvariant="script">ℱ</mi><mrow><mi>Q</mi><mi>S</mi><mi>D</mi></mrow></msub></mrow><mrow><mi>∂</mi><msubsup><mi>ψ</mi><mi>i</mi><mo>*</mo></msubsup></mrow></mfrac><mo>+</mo><msub><mi>q</mi><mi>i</mi></msub><msub><mi>J</mi><mi>i</mi></msub><mo stretchy="false" form="prefix">(</mo><mi>t</mi><mo stretchy="false" form="postfix">)</mo><mo>+</mo><msub><mi>ξ</mi><mi>i</mi></msub><mo stretchy="false" form="prefix">(</mo><mi>t</mi><mo stretchy="false" form="postfix">)</mo><mo>,</mo><mspace width="1.0em"></mspace><mspace width="1.0em"></mspace><mo stretchy="false" form="prefix">(</mo><mn>11</mn><mo stretchy="false" form="postfix">)</mo></mrow><annotation encoding="application/x-tex">\tau_{i}\frac{d\psi_{i}}{dt} = - \frac{\partial\mathcal{F}_{QSD}}{\partial\psi_{i}^{*}} + q_{i}J_{i}(t) + \xi_{i}(t),\quad\quad(11)</annotation></semantics></math>
        </disp-formula>
        <disp-formula id="eq12">
          <label>(12)</label>
          <math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><msub><mi>τ</mi><mrow><mi>i</mi><mi>j</mi></mrow></msub><mfrac><mrow><mi>d</mi><msub><mi>A</mi><mrow><mi>i</mi><mi>j</mi></mrow></msub></mrow><mrow><mi>d</mi><mi>t</mi></mrow></mfrac><mo>=</mo><mi>−</mi><mfrac><mrow><mi>∂</mi><msub><mi mathvariant="script">ℱ</mi><mrow><mi>Q</mi><mi>S</mi><mi>D</mi></mrow></msub></mrow><mrow><mi>∂</mi><msub><mi>A</mi><mrow><mi>i</mi><mi>j</mi></mrow></msub></mrow></mfrac><mo>+</mo><msub><mi>I</mi><mrow><mi>i</mi><mi>j</mi></mrow></msub><mo stretchy="false" form="prefix">(</mo><mi>t</mi><mo stretchy="false" form="postfix">)</mo><mo>+</mo><msub><mi>ζ</mi><mrow><mi>i</mi><mi>j</mi></mrow></msub><mo stretchy="false" form="prefix">(</mo><mi>t</mi><mo stretchy="false" form="postfix">)</mo><mo>,</mo><mspace width="1.0em"></mspace><mspace width="1.0em"></mspace><mo stretchy="false" form="prefix">(</mo><mn>12</mn><mo stretchy="false" form="postfix">)</mo></mrow><annotation encoding="application/x-tex">\tau_{ij}\frac{dA_{ij}}{dt} = - \frac{\partial\mathcal{F}_{QSD}}{\partial A_{ij}} + I_{ij}(t) + \zeta_{ij}(t),\quad\quad(12)</annotation></semantics></math>
        </disp-formula>
        <p>where <inline-formula><tex-math><![CDATA[I_{ij}]]></tex-math></inline-formula> represents institutional or communicative events that directly reconfigure a relation and <inline-formula><tex-math><![CDATA[\xi_{i},\zeta_{ij}]]></tex-math></inline-formula> are disturbances. Equation (11) updates orientations; Equation (12) updates the symbolic medium. Their joint use is the formal expression of field memory.</p>
        <p>For panel, network or experimental data, a discrete version is</p>
        <disp-formula id="eq13">
          <label>(13)</label>
          <math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><msub><mover><mi>ψ</mi><mo accent="true">̃</mo></mover><mi>i</mi></msub><mo stretchy="false" form="prefix">(</mo><mi>t</mi><mo>+</mo><mn>1</mn><mo stretchy="false" form="postfix">)</mo><mo>=</mo><msub><mi>α</mi><mi>i</mi></msub><msub><mi>ψ</mi><mi>i</mi></msub><mo stretchy="false" form="prefix">(</mo><mi>t</mi><mo stretchy="false" form="postfix">)</mo><mo>+</mo><msub><mi>q</mi><mi>i</mi></msub><munderover><mo>∑</mo><mi>j</mi><mrow></mrow></munderover><msub><mi>β</mi><mrow><mi>i</mi><mi>j</mi></mrow></msub><msub><mi>K</mi><mrow><mi>i</mi><mi>j</mi></mrow></msub><mo stretchy="false" form="prefix">(</mo><mi>t</mi><mo stretchy="false" form="postfix">)</mo><msub><mi>U</mi><mrow><mi>i</mi><mi>j</mi></mrow></msub><mo stretchy="false" form="prefix">(</mo><mi>t</mi><mo stretchy="false" form="postfix">)</mo><msub><mi>ψ</mi><mi>j</mi></msub><mo stretchy="false" form="prefix">(</mo><mi>t</mi><mo stretchy="false" form="postfix">)</mo><mo>+</mo><msub><mi>q</mi><mi>i</mi></msub><msub><mi>J</mi><mi>i</mi></msub><mo stretchy="false" form="prefix">(</mo><mi>t</mi><mo stretchy="false" form="postfix">)</mo><mo>,</mo><mspace width="1.0em"></mspace><mspace width="1.0em"></mspace><mo stretchy="false" form="prefix">(</mo><mn>13</mn><mo stretchy="false" form="postfix">)</mo></mrow><annotation encoding="application/x-tex">{\widetilde{\psi}}_{i}(t + 1) = \alpha_{i}\psi_{i}(t) + q_{i}\sum_{j}^{}\beta_{ij}K_{ij}(t)U_{ij}(t)\psi_{j}(t) + q_{i}J_{i}(t),\quad\quad(13)</annotation></semantics></math>
        </disp-formula>
        <disp-formula id="eq14">
          <label>(14)</label>
          <math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><msub><mi>ψ</mi><mi>i</mi></msub><mo stretchy="false" form="prefix">(</mo><mi>t</mi><mo>+</mo><mn>1</mn><mo stretchy="false" form="postfix">)</mo><mo>=</mo><mfrac><mrow><msub><mover><mi>ψ</mi><mo accent="true">̃</mo></mover><mi>i</mi></msub><mo stretchy="false" form="prefix">(</mo><mi>t</mi><mo>+</mo><mn>1</mn><mo stretchy="false" form="postfix">)</mo></mrow><mrow><mrow><mi mathvariant="normal">max</mi><mo>⁡</mo></mrow><mrow><mo stretchy="true" form="prefix">(</mo><mn>1</mn><mo>,</mo><mrow><mo stretchy="true" form="prefix">|</mo><msub><mover><mi>ψ</mi><mo accent="true">̃</mo></mover><mi>i</mi></msub><mo stretchy="false" form="prefix">(</mo><mi>t</mi><mo>+</mo><mn>1</mn><mo stretchy="false" form="postfix">)</mo><mo stretchy="true" form="postfix">|</mo></mrow><mo stretchy="true" form="postfix">)</mo></mrow></mrow></mfrac><mo>,</mo><mspace width="1.0em"></mspace><mspace width="1.0em"></mspace><mo stretchy="false" form="prefix">(</mo><mn>14</mn><mo stretchy="false" form="postfix">)</mo></mrow><annotation encoding="application/x-tex">\psi_{i}(t + 1) = \frac{{\widetilde{\psi}}_{i}(t + 1)}{\max\left( 1,\left| {\widetilde{\psi}}_{i}(t + 1) \right| \right)},\quad\quad(14)</annotation></semantics></math>
        </disp-formula>
        <p>and</p>
        <disp-formula id="eq15">
          <label>(15)</label>
          <math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><msub><mi>A</mi><mrow><mi>i</mi><mi>j</mi></mrow></msub><mo stretchy="false" form="prefix">(</mo><mi>t</mi><mo>+</mo><mn>1</mn><mo stretchy="false" form="postfix">)</mo><mo>=</mo><mrow><mo stretchy="true" form="prefix">(</mo><mn>1</mn><mo>−</mo><msub><mi>λ</mi><mrow><mi>i</mi><mi>j</mi></mrow></msub><mo stretchy="true" form="postfix">)</mo></mrow><msub><mi>A</mi><mrow><mi>i</mi><mi>j</mi></mrow></msub><mo stretchy="false" form="prefix">(</mo><mi>t</mi><mo stretchy="false" form="postfix">)</mo><mo>+</mo><msub><mi>λ</mi><mrow><mi>i</mi><mi>j</mi></mrow></msub><msub><mover><mi>A</mi><mo accent="true">̂</mo></mover><mrow><mi>i</mi><mi>j</mi></mrow></msub><mo stretchy="false" form="prefix">(</mo><mi>t</mi><mo stretchy="false" form="postfix">)</mo><mo>+</mo><msub><mi>η</mi><mrow><mi>i</mi><mi>j</mi></mrow></msub><msub><mi>I</mi><mrow><mi>i</mi><mi>j</mi></mrow></msub><mo stretchy="false" form="prefix">(</mo><mi>t</mi><mo stretchy="false" form="postfix">)</mo><mi>.</mi><mspace width="1.0em"></mspace><mspace width="1.0em"></mspace><mo stretchy="false" form="prefix">(</mo><mn>15</mn><mo stretchy="false" form="postfix">)</mo></mrow><annotation encoding="application/x-tex">A_{ij}(t + 1) = \left( 1 - \lambda_{ij} \right)A_{ij}(t) + \lambda_{ij}{\widehat{A}}_{ij}(t) + \eta_{ij}I_{ij}(t).\quad\quad(15)</annotation></semantics></math>
        </disp-formula>
        <p>The parameter <inline-formula><tex-math><![CDATA[\lambda_{ij}]]></tex-math></inline-formula> controls relational memory. Small values imply persistent link states; large values imply rapid updating. The covariant update makes three quantities empirically separable: exposure magnitude <inline-formula><tex-math><![CDATA[K_{ij}]]></tex-math></inline-formula>, symbolic transformation <inline-formula><tex-math><![CDATA[U_{ij}]]></tex-math></inline-formula> and signed response <inline-formula><tex-math><![CDATA[q_{i}]]></tex-math></inline-formula>.</p>
      </sec>
      <sec id="sec20">
        <title>AI implementation workflow</title>
        <p>A practical implementation begins by constructing a directed source–audience graph from communication logs, institutional records, surveys or platform data. Actor states ψ<sub>i</sub> are estimated from issue-specific belief, trust, risk or acceptance indicators; exposure weights w<sub>ij</sub> are estimated from observed communication frequency or attention; signed couplings q<sub>i</sub> are estimated from heterogeneous treatment response or longitudinal sensitivity; and link phases A<sub>ij</sub> are estimated from source-conditioned deviations between message content and observed response.</p>
        <p>The computational sequence is: (1) ingest time-stamped signals and events; (2) update actor, exposure and link states; (3) calculate gauge-invariant edge alignment, path transport and loop holonomy; (4) supply these quantities to an urban digital twin, agent-based simulator, machine-learning model or decision dashboard; (5) generate counterfactual communication routes; and (6) compare the full method with flat-link, homogeneous-coupling and fixed-field ablations.</p>
        <p>For a sparse graph G = (V, E), a single actor–link update is O(|E|). Holonomy can be evaluated on a chosen fundamental cycle basis, with cost proportional to the summed lengths of those cycles. The method is therefore computationally tractable for large but sparse urban communication networks, subject to the cost of estimating latent states from data.</p>
        <p>All figures and tables in this article were created by the author. No third-party images, proprietary software, questionnaires or restricted tools were used, and no permissions are required for the proposed method.</p>
      </sec>
    </sec>
    <sec id="sec21">
      <title>Results</title>
      <sec id="sec22">
        <title>Theorem 1: gauge invariance</title>
        <p><bold>Theorem 1.</bold> Under the local transformation in Equation (5), the quantities <inline-formula><tex-math><![CDATA[\rho_{i}]]></tex-math></inline-formula>, <inline-formula><tex-math><![CDATA[C_{ij}]]></tex-math></inline-formula>, <inline-formula><tex-math><![CDATA[C_{\mathcal{P}}]]></tex-math></inline-formula>, <inline-formula><tex-math><![CDATA[W\left( \mathcal{C} \right)]]></tex-math></inline-formula> and <inline-formula><tex-math><![CDATA[\mathcal{F}_{QSD}]]></tex-math></inline-formula> are invariant.</p>
        <p><bold>Proof sketch.</bold> The node magnitude satisfies <inline-formula><tex-math><![CDATA[\left| e^{i\phi_{i}}\psi_{i} \right|^{2} = \left| \psi_{i} \right|^{2}]]></tex-math></inline-formula>. In the edge observable, the phase factors cancel:</p>
        <disp-formula id="eq16">
          <label>(16)</label>
          <math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><msup><mrow><mo stretchy="true" form="prefix">(</mo><msubsup><mi>ψ</mi><mi>i</mi><mo>′</mo></msubsup><mo stretchy="true" form="postfix">)</mo></mrow><mo>*</mo></msup><msubsup><mi>U</mi><mrow><mi>i</mi><mi>j</mi></mrow><mo>′</mo></msubsup><msubsup><mi>ψ</mi><mi>j</mi><mo>′</mo></msubsup><mo>=</mo><msubsup><mi>ψ</mi><mi>i</mi><mo>*</mo></msubsup><msup><mi>e</mi><mrow><mi>−</mi><mi>i</mi><msub><mi>ϕ</mi><mi>i</mi></msub></mrow></msup><mrow><mo stretchy="true" form="prefix">(</mo><msup><mi>e</mi><mrow><mi>i</mi><msub><mi>ϕ</mi><mi>i</mi></msub></mrow></msup><msub><mi>U</mi><mrow><mi>i</mi><mi>j</mi></mrow></msub><msup><mi>e</mi><mrow><mi>−</mi><mi>i</mi><msub><mi>ϕ</mi><mi>j</mi></msub></mrow></msup><mo stretchy="true" form="postfix">)</mo></mrow><msup><mi>e</mi><mrow><mi>i</mi><msub><mi>ϕ</mi><mi>j</mi></msub></mrow></msup><msub><mi>ψ</mi><mi>j</mi></msub><mo>=</mo><msubsup><mi>ψ</mi><mi>i</mi><mo>*</mo></msubsup><msub><mi>U</mi><mrow><mi>i</mi><mi>j</mi></mrow></msub><msub><mi>ψ</mi><mi>j</mi></msub><mi>.</mi><mspace width="1.0em"></mspace><mspace width="1.0em"></mspace><mo stretchy="false" form="prefix">(</mo><mn>16</mn><mo stretchy="false" form="postfix">)</mo></mrow><annotation encoding="application/x-tex">\left( \psi_{i}' \right)^{*}U_{ij}'\psi_{j}' = \psi_{i}^{*}e^{- i\phi_{i}}\left( e^{i\phi_{i}}U_{ij}e^{- i\phi_{j}} \right)e^{i\phi_{j}}\psi_{j} = \psi_{i}^{*}U_{ij}\psi_{j}.\quad\quad(16)</annotation></semantics></math>
        </disp-formula>
        <p>The cancellation telescopes along a path, leaving only endpoint phases, which then cancel against the transformed endpoint states. On a closed cycle every endpoint is also an intermediate point, so all local factors cancel and <inline-formula><tex-math><![CDATA[W\left( \mathcal{C} \right)]]></tex-math></inline-formula> is unchanged. Each term in Equation (10) is therefore invariant. A complete derivation is provided in Supplementary file 1, Section S1.</p>
        <p>The theorem gives the social meaning of gauge invariance: substantive conclusions depend on relations among states and links, not on arbitrary local labels chosen by communities or analysts.</p>
      </sec>
      <sec id="sec23">
        <title>Theorem 2: flatness and path independence</title>
        <p><bold>Theorem 2.</bold> Let <inline-formula><tex-math><![CDATA[G]]></tex-math></inline-formula> be connected. Symbolic transport is path independent between every ordered pair of nodes if and only if</p>
        <disp-formula id="eq17">
          <label>(17)</label>
          <math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>W</mi><mrow><mo stretchy="true" form="prefix">(</mo><mi mathvariant="script">𝒞</mi><mo stretchy="true" form="postfix">)</mo></mrow><mo>=</mo><mn>1</mn><mspace width="1.0em"></mspace><mrow><mtext mathvariant="normal">for every closed cycle </mtext><mspace width="0.333em"></mspace></mrow><mrow><mi mathvariant="script">𝒞</mi><mi mathvariant="script">.</mi></mrow><mspace width="1.0em"></mspace><mspace width="1.0em"></mspace><mo stretchy="false" form="prefix">(</mo><mn>17</mn><mo stretchy="false" form="postfix">)</mo></mrow><annotation encoding="application/x-tex">W\left( \mathcal{C} \right) = 1\quad\text{for every closed cycle }\mathcal{C.}\quad\quad(17)</annotation></semantics></math>
        </disp-formula>
        <p>Equivalently, a flat field admits node phases <inline-formula><tex-math><![CDATA[\gamma_{i}]]></tex-math></inline-formula> such that</p>
        <disp-formula id="eq18">
          <label>(18)</label>
          <math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><msub><mi>U</mi><mrow><mi>i</mi><mi>j</mi></mrow></msub><mo>=</mo><msup><mi>e</mi><mrow><mi>i</mi><msub><mi>γ</mi><mi>i</mi></msub></mrow></msup><msup><mi>e</mi><mrow><mi>−</mi><mi>i</mi><msub><mi>γ</mi><mi>j</mi></msub></mrow></msup><mspace width="1.0em"></mspace><mspace width="1.0em"></mspace><mrow><mtext mathvariant="normal">for all </mtext><mspace width="0.333em"></mspace></mrow><mo stretchy="false" form="prefix">(</mo><mi>i</mi><mo>,</mo><mi>j</mi><mo stretchy="false" form="postfix">)</mo><mo>∈</mo><mi>E</mi><mi>.</mi><mspace width="1.0em"></mspace><mspace width="1.0em"></mspace><mo stretchy="false" form="prefix">(</mo><mn>18</mn><mo stretchy="false" form="postfix">)</mo></mrow><annotation encoding="application/x-tex">U_{ij} = e^{i\gamma_{i}}e^{- i\gamma_{j}}\quad\quad\text{for all }(i,j) \in E.\quad\quad(18)</annotation></semantics></math>
        </disp-formula>
        <p><bold>Proof sketch.</bold> If path transport is independent of route, traversing any path and returning along another must yield the identity, so every cycle holonomy is one. Conversely, if every cycle holonomy is one, choose a root node and define <inline-formula><tex-math><![CDATA[e^{- i\gamma_{i}}]]></tex-math></inline-formula> as transport from the root to <inline-formula><tex-math><![CDATA[i]]></tex-math></inline-formula>. Zero cycle holonomy guarantees that this definition is independent of the selected root-to-node path, yielding Equation (18). Supplementary file 1, Section S1, provides the graph-theoretic construction.</p>
        <p><bold>Corollary 1.</bold> Non-zero holonomy is an irreducible marker of route dependence. It cannot be eliminated by relabelling local interpretive baselines.</p>
        <p>This result is central to QSD’s novelty. A standard influence matrix may assign different weights to different routes, but QSD identifies whether those differences are removable representation choices or a structural inconsistency preserved by every admissible re-description.</p>
      </sec>
      <sec id="sec24">
        <title>Proposition 1: the classical influence limit</title>
        <p><bold>Proposition 1.</bold> Suppose: (i) <inline-formula><tex-math><![CDATA[U_{ij} = 1]]></tex-math></inline-formula> for all edges; (ii) <inline-formula><tex-math><![CDATA[\psi_{i} = x_{i}\mathbb{\in R}]]></tex-math></inline-formula>; (iii) <inline-formula><tex-math><![CDATA[q_{i} \geq 0]]></tex-math></inline-formula>; (iv) link states are fixed; (v) the normalisation in Equation (14) is inactive; and (vi) coefficients are row-normalised. Then Equation (13) reduces to a weighted linear influence model. With a fixed predisposition term it yields the Friedkin–Johnsen form.</p>
        <p>In vector notation,</p>
        <disp-formula id="eq19">
          <label>(19)</label>
          <math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi mathvariant="bold-italic">𝒙</mi><mo stretchy="false" form="prefix">(</mo><mi>t</mi><mo>+</mo><mn>1</mn><mo stretchy="false" form="postfix">)</mo><mo>=</mo><mrow><mi mathvariant="bold-italic">𝑨</mi><mi mathvariant="bold-italic">𝒙</mi></mrow><mo stretchy="false" form="prefix">(</mo><mi>t</mi><mo stretchy="false" form="postfix">)</mo><mo>+</mo><mrow><mi mathvariant="bold-italic">𝑩</mi><mi mathvariant="bold-italic">𝒙</mi></mrow><mo stretchy="false" form="prefix">(</mo><mn>0</mn><mo stretchy="false" form="postfix">)</mo><mo>+</mo><mi mathvariant="bold-italic">𝒋</mi><mo stretchy="false" form="prefix">(</mo><mi>t</mi><mo stretchy="false" form="postfix">)</mo><mi>.</mi><mspace width="1.0em"></mspace><mspace width="1.0em"></mspace><mo stretchy="false" form="prefix">(</mo><mn>19</mn><mo stretchy="false" form="postfix">)</mo></mrow><annotation encoding="application/x-tex">\mathbf{x}(t + 1) = \mathbf{Ax}(t) + \mathbf{Bx}(0) + \mathbf{j}(t).\quad\quad(19)</annotation></semantics></math>
        </disp-formula>
        <p>Thus QSD does not discard the classical influence tradition. It contains it as the flat, real-valued, static-link limit. The empirical burden is correspondingly clear: dynamic transport, signed coupling or loop curvature should be retained only when they explain patterns that Equation (19) cannot.</p>
      </sec>
      <sec id="sec25">
        <title>Proposition 2: ordered exposure from field updating</title>
        <p>Let <inline-formula><tex-math><![CDATA[\mathcal{T}_{m}]]></tex-math></inline-formula> denote the joint update of actor and link states produced by message <inline-formula><tex-math><![CDATA[m]]></tex-math></inline-formula>. In general,</p>
        <disp-formula id="eq20">
          <label>(20)</label>
          <math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><msub><mi mathvariant="script">𝒯</mi><msub><mi>m</mi><mn>2</mn></msub></msub><mo>∘</mo><msub><mi mathvariant="script">𝒯</mi><msub><mi>m</mi><mn>1</mn></msub></msub><mo stretchy="false" form="prefix">(</mo><mi mathvariant="normal">Φ</mi><mo stretchy="false" form="postfix">)</mo><mo>≠</mo><msub><mi mathvariant="script">𝒯</mi><msub><mi>m</mi><mn>1</mn></msub></msub><mo>∘</mo><msub><mi mathvariant="script">𝒯</mi><msub><mi>m</mi><mn>2</mn></msub></msub><mo stretchy="false" form="prefix">(</mo><mi mathvariant="normal">Φ</mi><mo stretchy="false" form="postfix">)</mo><mspace width="1.0em"></mspace><mspace width="1.0em"></mspace><mo stretchy="false" form="prefix">(</mo><mn>20</mn><mo stretchy="false" form="postfix">)</mo></mrow><annotation encoding="application/x-tex">\mathcal{T}_{m_{2}} \circ \mathcal{T}_{m_{1}}(\Phi) \neq \mathcal{T}_{m_{1}} \circ \mathcal{T}_{m_{2}}(\Phi)\quad\quad(20)</annotation></semantics></math>
        </disp-formula>
        <p>whenever at least one message changes <inline-formula><tex-math><![CDATA[U_{ij}]]></tex-math></inline-formula>, <inline-formula><tex-math><![CDATA[K_{ij}]]></tex-math></inline-formula> or the non-linear normalisation regime. The order effect is therefore not asserted as mysterious indeterminacy; it follows from coevolution. A claim followed by a correction is processed through a field already changed by the claim, whereas the reverse sequence is processed through a different field.</p>
      </sec>
      <sec id="sec26">
        <title>Testable technical predictions</title>
        <p>The model yields five primary predictions.</p>
        <list list-type="order">
          <list-item><p><bold>Signed response:</bold> identical exposure can move groups in opposite directions when <inline-formula><tex-math><![CDATA[q_{i}q_{j} &lt; 0]]></tex-math></inline-formula>.</p></list-item>
          <list-item><p><bold>Route dependence:</bold> paths with the same endpoints can produce different alignments when the enclosed holonomy is non-zero.</p></list-item>
          <list-item><p><bold>Field memory:</bold> an institutional event changes later responses to unchanged messages through persistent <inline-formula><tex-math><![CDATA[A_{ij}(t)]]></tex-math></inline-formula>.</p></list-item>
          <list-item><p><bold>Curvature instability:</bold> networks with larger aggregate loop curvature should display lower cross-route credibility consistency and slower convergence.</p></list-item>
          <list-item><p><bold>Classical collapse:</bold> when estimated link phases are flat and static, QSD should collapse empirically to a conventional influence model without predictive loss.</p></list-item>
        </list>
      </sec>
    </sec>
    <sec id="sec27">
      <title>Computational Testing</title>
      <sec id="sec28">
        <title>Test design</title>
        <p>The computational tests evaluate internal entailment rather than population-level predictive accuracy. They ask whether the proposed update rules are sufficient to produce the distinctive patterns claimed by the method and whether those patterns disappear under structural ablation.</p>
        <p>The deterministic simulations test whether the stated mechanisms generate the patterns claimed by the theory. They are demonstrations of mathematical entailment, not estimates of population effects. Three audience groups receive a contested claim <inline-formula><tex-math><![CDATA[C = e^{i\pi}]]></tex-math></inline-formula> and a correction <inline-formula><tex-math><![CDATA[K = 1]]></tex-math></inline-formula>. The update uses Equations (13)–(15) with <inline-formula><tex-math><![CDATA[\alpha = 0.55]]></tex-math></inline-formula>, <inline-formula><tex-math><![CDATA[\beta = 0.75]]></tex-math></inline-formula> and link adaptation <inline-formula><tex-math><![CDATA[\eta = 0.90]]></tex-math></inline-formula>.</p>
        <p>The initial conditions for the deterministic order-and-coupling test are reported in Table 3.</p>
        <table-wrap id="tbl3">
          <label>Table 3</label>
          <caption><p>Initial Conditions for the Order-and-Coupling Simulation.</p></caption>
          <table>
            <thead>
              <tr>
                <th><bold>Group</bold></th>
                <th><bold>Initial state ψ<sub>i</sub>(0)</bold></th>
                <th><bold>Initial link phase A<sub>i</sub>(0)</bold></th>
                <th><bold>Coupling q<sub>i</sub></bold></th>
              </tr>
            </thead>
            <tbody>
              <tr>
                <td>Receptive</td>
                <td>0.45e<sup>i0·10</sup></td>
                <td>0.15</td>
                <td>1.00</td>
              </tr>
              <tr>
                <td>Ambivalent</td>
                <td>0.25e<sup>i0·80</sup></td>
                <td>0.70</td>
                <td>0.45</td>
              </tr>
              <tr>
                <td>Oppositional</td>
                <td>0.50e<sup>i2·60</sup></td>
                <td>1.10</td>
                <td>−0.80</td>
              </tr>
            </tbody>
          </table>
        </table-wrap>
      </sec>
      <sec id="sec29">
        <title>Coupling and order</title>
        <p>To evaluate order effects without relying on gauge-dependent components of the latent state ψ<sub>i</sub>, the simulation was reanalysed using the normalised transported alignment R<sub>i</sub> = Re(ψ<sub>i</sub>*U<sub>i</sub>K K)/(|ψ<sub>i</sub>||K|), with the correction proposition K = 1 held as the same substantive reference in both sequence conditions. This fixed reference is necessary because claim → correction and correction → claim end with different messages; evaluating each condition against its last message would compare different outcome objects rather than the effect of ordering on a common proposition. R<sub>i</sub> lies in [−1, 1], with positive values denoting transported alignment with the correction and negative values denoting counter-alignment. An order reversal is present when R<sub>i</sub>(C→K) × R<sub>i</sub>(K→C) &lt; 0.</p>
        <fig id="fig2">
          <label>Figure 2</label>
          <caption><p>Gauge-Invariant Order Effects in the QSD Simulation. Normalised transported alignment R<sub>i</sub> is evaluated against the same correction reference (K = 1) after claim → correction and correction → claim. Positive values indicate alignment and negative values counter-alignment. Values are model-generated rather than empirical estimates. Source: Author-created figure.</p></caption>
          <graphic xlink:href="obj/67/e0/67e08e0bf6f8b133ebf4ed1d7edcb99796737c106085afbbf510151f8e660523"/>
        </fig>
        <p>Figure 2 shows a large sequence-dependent reversal relative to the fixed correction reference. Claim → correction produces R<sub>i</sub> = 1.000, 1.000 and 0.953 for the receptive, ambivalent and oppositional groups, respectively; correction → claim produces −1.000, −1.000 and −0.955. The corresponding order contrasts, Δ<sub>i</sub>(order) = R<sub>i</sub>(C→K) − R<sub>i</sub>(K→C), are 2.000, 2.000 and 1.908, and the reversal products are −1.000, −1.000 and −0.910. The oppositional-group reversal therefore survives the gauge-invariant reanalysis: its initial alignment with the correction is R<sub>i</sub> = −0.848, but the final value is +0.953 after claim → correction and −0.955 when the order is reversed.</p>
        <p>The result is, however, narrower than the interpretation based on the real component of an individual complex state. Reversal is not unique to the negatively coupled group: under the strong link-adaptation setting used in this demonstration (λ = 0.90), all three groups cross zero when sequence is reversed. The simulation therefore demonstrates gauge-invariant order dependence and field-mediated history effects, not that negative coupling by itself is sufficient to produce directional reversal. Signed coupling remains a source of heterogeneous response, but its independent contribution must be established by ablation or parameter variation rather than inferred from the sign of an individual state component.</p>
        <p>As a numerical invariance check, arbitrary local phase re-descriptions were applied to the final states and links. R<sub>i</sub> remained unchanged to floating-point precision (maximum absolute deviation 5.55 × 10<sup>-16</sup>), whereas Re(ψ<sub>i</sub>) is gauge dependent. The conclusion in Figure 2 therefore does not depend on the local phase convention used to represent actor states. If alignment is instead defined relative to whichever message arrives last, both sequences end positively aligned with their respective final message; the reversal reported here is specifically a route-history effect measured against the same fixed substantive reference.</p>
      </sec>
      <sec id="sec30">
        <title>Institutional shock and field memory</title>
        <p>A second simulation repeats the same positive message while introducing a shock to the source–audience link at step 6. The link phase changes from 0.20 to 1.60 radians and relaxes toward baseline with <inline-formula><tex-math><![CDATA[\lambda = 0.12]]></tex-math></inline-formula>.</p>
        <p>Figure 3 shows the simulated persistence and gradual recovery of the relational field after an institutional shock.</p>
        <fig id="fig3">
          <label>Figure 3</label>
          <caption><p>Field Memory Following an Institutional Shock. The relational phase changes at step 6 and relaxes gradually while message alignment recovers. Source: Author-created figure.</p></caption>
          <graphic xlink:href="obj/c6/e6/c6e638addfb8045844182ee950d5be43cde4afe0c9c51dbb28a255467787711b"/>
        </fig>
        <p>Gauge-invariant alignment is 0.9998 immediately before the shock and 0.1591 immediately after it. It recovers gradually to 0.9825 by step 12. Content is held constant; the temporary response change is attributable to the altered link field.</p>
      </sec>
      <sec id="sec31">
        <title>Structural ablations</title>
        <p>Table 4 summarises the structural ablations and the consequences predicted when each QSD component is removed.</p>
        <table-wrap id="tbl4">
          <label>Table 4</label>
          <caption><p>Structural Ablations and Their Predicted Consequences.</p></caption>
          <table>
            <thead>
              <tr>
                <th><bold>Ablation</bold></th>
                <th><bold>Removed structure</bold></th>
                <th><bold>Predicted consequence</bold></th>
              </tr>
            </thead>
            <tbody>
              <tr>
                <td>q<sub>i</sub> = q &gt; 0 for all i</td>
                <td>Signed heterogeneous coupling</td>
                <td>Directional heterogeneity attributable specifically to signed coupling is removed; order effects may persist through field updating</td>
              </tr>
              <tr>
                <td>U<sub>ij</sub> = 1</td>
                <td>Symbolic transport phase</td>
                <td>Route transformation and holonomy disappear</td>
              </tr>
              <tr>
                <td>A<sub>ij</sub>(t + 1) = A<sub>ij</sub>(t)</td>
                <td>Link adaptation</td>
                <td>Institutional shocks cannot create persistent field memory</td>
              </tr>
              <tr>
                <td>W(C) = 1 for all cycles</td>
                <td>Curvature</td>
                <td>Transport becomes path independent by Theorem 2</td>
              </tr>
              <tr>
                <td>Real, static, row-normalised system</td>
                <td>Full gauge structure</td>
                <td>Model reduces to Equation (19)</td>
              </tr>
            </tbody>
          </table>
        </table-wrap>
        <p>These ablations define the comparative standard. If data show no loss when the added structures are removed, QSD is unnecessary for that application.</p>
      </sec>
    </sec>
    <sec id="sec32">
      <title>Sustainable-City Application: Urban Heat Decarbonisation</title>
      <sec id="sec33">
        <title>Application design</title>
        <p>A purposive corpus of 27 claim-records from 19 UK-relevant public documents was used as a sustainable-city application. Domestic heat decarbonisation is an urban infrastructure transition involving buildings, electricity networks, household affordability, installers, local experience and public policy. The corpus is not a prevalence sample, records are not independent, coding was single-researcher and no audience outcomes were measured. It therefore illustrates construct implementation rather than validating the gauge model.</p>
        <p>The source documents included fact-checks, news reports, opinion pieces, advocacy material, advertising controversies and consumer guidance. Records were coded for claim status, symbolic carrier, fear or grievance, institutional target, anticipated future and inferred trust implication. These fields provide candidate inputs for an AI-assisted communication-risk monitor or urban digital-twin module, but they require independent coding and audience validation before operational deployment.</p>
      </sec>
      <sec id="sec34">
        <title>Recurrent symbolic configurations</title>
        <p>Figure 4 summarises the three recurrent symbolic configurations identified in the bounded heat-pump application.</p>
        <fig id="fig4">
          <label>Figure 4</label>
          <caption><p>Recurrent Symbolic Configurations in the Heat-Pump Application. The corpus yields cold-body, fragile-system and punished-household pathways. Source: Author-created figure.</p></caption>
          <graphic xlink:href="obj/a2/5f/a25f36137d8138aed4bcc059b525257c2487679ea57d703f38631441eca4ec5b"/>
        </fig>
        <p>The cold body links a performance claim to bodily vulnerability, loss of control and policy distrust. The fragile system links a peak-demand question to blackout imagery, institutional incompetence and system distrust. The punished household links a conditional cost claim to unfair burden, elite imposition and market or policy distrust. In an AI-supported urban decision system, these configurations could be treated as structured relational features rather than as sentiment labels alone.</p>
        <p>These are not merely negative frames. In QSD terms they are candidate local field configurations: recurrent conjunctions of signal content, vulnerability, source attribution and anticipated future that may support different coupling patterns across groups. They can be converted into experimental treatments and linked to measured source relations and exposure routes.</p>
      </sec>
      <sec id="sec35">
        <title>Application results and boundaries</title>
        <p>The application supports three bounded conclusions. First, QSD variables can organise real urban-transition communication without reducing every practical concern to misinformation. Second, technically similar claims can occupy different source, vulnerability and future-oriented structures. Third, the coding produces testable inputs for route randomisation, source-specific prediction and longitudinal field updating. The application does not establish population prevalence, persuasion, trust change, field curvature or superiority over classical or machine-learning models.</p>
      </sec>
    </sec>
    <sec id="sec36">
      <title>AI Integration and Validation</title>
      <p>QSD is intended to complement, not replace, existing artificial-intelligence methods. Its role is to create interpretable relational features and counterfactual scenarios for systems that forecast adoption, optimise communication, evaluate policy risk or simulate urban transition pathways. Operational use requires transparent estimation, uncertainty reporting, data-governance controls and human oversight. This requirement is consistent with recent human-centric AI and smart-building research, which emphasises explainability, integration of subjective and objective data, data governance and occupant or stakeholder engagement as conditions for responsible deployment (<xref ref-type="bibr" rid="ref-r3">Aziz <italic>et al.</italic> 2026</xref>; <xref ref-type="bibr" rid="ref-r35">Onweh <italic>et al.</italic> 2025</xref>; <xref ref-type="bibr" rid="ref-r39">Razak <italic>et al.</italic> 2025</xref>).</p>
      <sec id="sec37">
        <title>Estimation and feature engineering</title>
        <p>Empirical estimation requires repeated measures of actor state, source relation and exposure history. A possible observation model is</p>
        <disp-formula id="eq21">
          <label>(21)</label>
          <math display="block" xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><msub><mi mathvariant="bold-italic">𝒚</mi><mi>i</mi></msub><mo stretchy="false" form="prefix">(</mo><mi>t</mi><mo stretchy="false" form="postfix">)</mo><mo>=</mo><mi mathvariant="bold-italic">𝑯</mi><mspace width="0.167em"></mspace><msub><mi mathvariant="bold-italic">𝒔</mi><mi>i</mi></msub><mo stretchy="false" form="prefix">(</mo><mi>t</mi><mo stretchy="false" form="postfix">)</mo><mo>+</mo><msub><mi mathvariant="bold-italic">𝝐</mi><mi>i</mi></msub><mo stretchy="false" form="prefix">(</mo><mi>t</mi><mo stretchy="false" form="postfix">)</mo><mo>,</mo><mspace width="1.0em"></mspace><mspace width="1.0em"></mspace><msub><mi mathvariant="bold-italic">𝒔</mi><mi>i</mi></msub><mo stretchy="false" form="prefix">(</mo><mi>t</mi><mo stretchy="false" form="postfix">)</mo><mo>=</mo><mrow><mo stretchy="true" form="prefix">[</mo><mtable><mtr><mtd columnalign="center" style="text-align:center"><mi>R</mi><mi>e</mi><msub><mi>ψ</mi><mi>i</mi></msub><mo stretchy="false" form="prefix">(</mo><mi>t</mi><mo stretchy="false" form="postfix">)</mo></mtd></mtr><mtr><mtd columnalign="center" style="text-align:center"><mi>I</mi><mi>m</mi><msub><mi>ψ</mi><mi>i</mi></msub><mo stretchy="false" form="prefix">(</mo><mi>t</mi><mo stretchy="false" form="postfix">)</mo></mtd></mtr><mtr><mtd columnalign="center" style="text-align:center"><msub><mi>A</mi><mrow><mi>i</mi><mn>1</mn></mrow></msub><mo stretchy="false" form="prefix">(</mo><mi>t</mi><mo stretchy="false" form="postfix">)</mo></mtd></mtr><mtr><mtd columnalign="center" style="text-align:center"><mi>⋮</mi></mtd></mtr></mtable><mo stretchy="true" form="postfix">]</mo></mrow><mo>,</mo><mspace width="1.0em"></mspace><mspace width="1.0em"></mspace><mo stretchy="false" form="prefix">(</mo><mn>21</mn><mo stretchy="false" form="postfix">)</mo></mrow><annotation encoding="application/x-tex">\mathbf{y}_{i}(t) = \mathbf{H}\,\mathbf{s}_{i}(t) + \mathbf{\epsilon}_{i}(t),\quad\quad\mathbf{s}_{i}(t) = \begin{bmatrix}
Re\psi_{i}(t) \\
Im\psi_{i}(t) \\
A_{i1}(t) \\
 \vdots 
\end{bmatrix},\quad\quad(21)</annotation></semantics></math>
        </disp-formula>
        <p>where <inline-formula><tex-math><![CDATA[\mathbf{y}_{i}(t)]]></tex-math></inline-formula> contains observed belief, trust, perceived risk, fairness, intention or behaviour. Link phases can be estimated from source-specific treatment responses, longitudinal credibility ratings and route-randomised exposure.</p>
      </sec>
      <sec id="sec38">
        <title>Validation design</title>
        <p>A decisive test should randomise: (i) message content; (ii) source identity; (iii) order; and (iv) prior field history. Primary outcomes should be measured before exposure, immediately afterwards and at delayed follow-up. Route dependence can be tested by delivering identical final information through different source sequences. Field memory can be tested by exposing groups to different institutional histories before giving them an identical final signal.</p>
      </sec>
      <sec id="sec39">
        <title>Model comparison</title>
        <p>QSD should be compared with:</p>
        <list list-type="bullet">
          <list-item><p>DeGroot and Friedkin–Johnsen influence models;</p></list-item>
          <list-item><p>network-autocorrelation and state-space models;</p></list-item>
          <list-item><p>dynamic-network diffusion models;</p></list-item>
          <list-item><p>conventional moderation and mediation models;</p></list-item>
          <list-item><p>signed-network or structural-balance models;</p></list-item>
          <list-item><p>Bayesian trust-learning models; and</p></list-item>
          <list-item><p>flexible machine-learning benchmarks.</p></list-item>
        </list>
        <p>The comparison should use held-out prediction, calibration, information criteria and ablation. In-sample fit is insufficient because QSD contains more structure than a scalar influence model.</p>
      </sec>
      <sec id="sec40">
        <title>Rejection criteria</title>
        <p>QSD should be reduced or rejected for a given domain if:</p>
        <list list-type="order">
          <list-item><p><inline-formula><tex-math><![CDATA[q_{i}]]></tex-math></inline-formula> cannot be distinguished from ordinary prior attitude;</p></list-item>
          <list-item><p>estimated <inline-formula><tex-math><![CDATA[U_{ij}]]></tex-math></inline-formula> adds no predictive information beyond scalar weights;</p></list-item>
          <list-item><p>route effects disappear after source trust and exposure are controlled;</p></list-item>
          <list-item><p>link history adds no delayed predictive value;</p></list-item>
          <list-item><p>holonomy cannot be estimated reliably or has no relation to cross-route inconsistency;</p></list-item>
          <list-item><p>the flat classical limit predicts held-out data equally well; or</p></list-item>
          <list-item><p>independent replications fail.</p></list-item>
        </list>
        <p>These criteria make the theory vulnerable to evidence while preserving the formal priority claim. Novelty and empirical adequacy are separate questions.</p>
      </sec>
    </sec>
    <sec id="sec41">
      <title>Discussion</title>
      <sec id="sec42">
        <title>Contribution to AI and sustainable cities</title>
        <p>QSD contributes to artificial intelligence for sustainable cities by formalising a variable that is normally left outside the urban model: the transformation of meaning and trust along communication routes. This distinction separates channel strength from symbolic transport and allows a city system to be topologically stable yet relationally reconfigured after policy reversals, service failures, misleading promotion or trusted local demonstrations.</p>
        <p>Theorem 2 provides an interpretable diagnostic. In a flat field, link phases can be removed by local re-description and the additional QSD structure is unnecessary. In a curved field, route dependence is irreducible. Holonomy therefore identifies when apparently inconsistent community responses cannot be explained solely by different coding baselines or exposure weights.</p>
        <p>For sustainable-city applications, the principal outputs are credibility communities, fragmented trust systems, source-sensitive adoption patterns, message-routing risks and persistent institutional effects. These outputs can augment predictive models and digital twins by indicating why an intervention may fail socially even when it is technically optimal.</p>
      </sec>
      <sec id="sec43">
        <title>Why the QED derivation is substantive</title>
        <p>The QED derivation contributes more than terminology. It imposes a discipline of local covariance, requires a distinction between states and mediators, identifies invariant observables, and yields loop quantities with a defined mathematical role. Without those constraints, “field”, “charge” and “mediation” could remain loose metaphors. With them, the theory specifies which quantities can change under recoding and which cannot.</p>
        <p>The theory remains an effective social model rather than a physical ontology. QED motivates the architecture; social meaning and empirical estimation determine whether the architecture is useful. This position avoids both reductionism and decorative physics.</p>
      </sec>
      <sec id="sec44">
        <title>Relation to existing computational models</title>
        <p>QSD is complementary to existing computational approaches. When phases are absent, links are static and states are real, it reduces to weighted influence. When only link signs matter, it approaches structural-balance models. When link history is central, it connects with coevolving-network methods. It can also be used upstream of machine learning as a gauge-invariant feature layer or downstream as an interpretability and counterfactual-analysis module.</p>
        <p>This nesting matters methodologically. QSD does not claim that every smart-city problem requires complex phases or holonomy. The additional structure is justified only when identical content has source- or route-dependent effects, when institutional events alter later response, or when closed communication cycles contain persistent inconsistency that scalar features cannot remove.</p>
      </sec>
      <sec id="sec45">
        <title>Scope and limitations</title>
        <p>The article establishes formal novelty, invariance properties, limiting cases and computational entailment. It does not claim population-level validation. The heat-pump corpus is small and illustrative; the simulations are deterministic; the latent-state interpretation requires measurement development; and heterogeneous coupling may be difficult to identify without randomised source and route variation.</p>
        <p>Further mathematical work should study existence, stability and convergence under alternative potentials; identifiability of <inline-formula><tex-math><![CDATA[q_{i}]]></tex-math></inline-formula> and <inline-formula><tex-math><![CDATA[A_{ij}]]></tex-math></inline-formula>; estimation on sparse and multiplex networks; non-Abelian extensions for multidimensional meaning; and statistical tests for aggregate curvature. Those extensions are consequences of an already specified architecture, not substitutes for the novelty claimed here.</p>
        <p>The current tests establish internal consistency, limiting behaviour and computational proof of concept. They do not establish external validity, operational safety or fairness in live AI systems. Before deployment, QSD requires preregistered experiments, independent coding, parameter-recovery analysis, held-out comparison with simpler models, bias assessment and governance procedures that prevent the optimisation of manipulative communication.</p>
      </sec>
    </sec>
    <sec id="sec46">
      <title>Conclusion</title>
      <p>Quantum Sociodynamics introduces a gauge-covariant computational method for representing symbolic influence and public trust in AI-supported sustainable-city transitions. The Symbolic Mediation Field separates actor orientation, source-conditioned transport, exposure strength, signed coupling and institutional history. Gauge invariance protects substantive outputs from arbitrary local coding origins; the flatness result distinguishes removable representation from irreducible route inconsistency; and the classical limit shows when standard influence models are sufficient.</p>
      <p>The novelty is specific and technically testable. QSD is not the first use of fields, complex numbers, quantum ideas, trust models or artificial intelligence in social analysis. It is, to our knowledge, the first method to integrate a state-bearing symbolic mediator field, signed coupling, local gauge covariance, dynamic source–audience transport, route and loop observables, field feedback and a classical influence limit for AI-assisted urban-transition analysis. The simulations and heat-pump application demonstrate implementation; subsequent studies must determine whether the added structure improves prediction, interpretation and responsible decision support.</p>
    </sec>
  </body>
  <back>
    <ack><p>The author acknowledges the value of informal scholarly feedback received on earlier conceptual drafts. No contributor who does not meet authorship criteria is listed as an author.</p></ack>
    <fn-group>
      <fn fn-type="con"><p>The sole author conceived the theory, developed the mathematical formulation, designed and interpreted the computational demonstrations, assembled and coded the pilot corpus, prepared the figures and wrote the manuscript.

Permissions

All figures, tables, equations and methodological materials were created by the author. No third-party images or proprietary research instruments were reproduced, and no external permissions were required.</p></fn>
      <fn fn-type="conflict"><p>The author has no competing interests to declare.</p></fn>
      <fn fn-type="data-availability"><p>Supplementary file 1 contains the formal derivations, computational specification, complete pilot-corpus inventory, claim-record map and QSD construct codebook. Supplementary file 2 contains the structured pilot claim-record data. Supplementary file 3 contains the simulation parameters. Supplementary file 4 contains the ablation definitions. Figures 1–4 are supplied separately as 300 dpi PNG files. No private human-participant data were collected. The underlying public documents remain available from their original publishers.</p></fn>
      <fn fn-type="ethics"><p>The study involved no human participants, human tissue, animals or private personal data. The bounded application used publicly accessible organisational and media documents and did not identify private individuals. Formal ethics approval and informed consent were therefore not applicable.</p></fn>
      <fn fn-type="other"><p>AI tools were used for language editing, document formatting and organisational assistance. It was not used to fabricate data, generate unverifiable references or determine the scholarly conclusions. The author verified the sources, equations, calculations, interpretations and final text and accepts full responsibility for the manuscript.</p></fn>
    </fn-group>
    <ref-list>
      <ref id="ref-r1">
        <element-citation publication-type="journal">
          <person-group person-group-type="author">
            <string-name>Abdalla, Malak Juan</string-name>
            <string-name>Aly, Menatallah</string-name>
            <string-name>Hussien, Aseel</string-name>
            <string-name>Ma'bdeh, Shouib</string-name>
            <string-name>Maksoud, Aref</string-name>
          </person-group>
          <article-title>BIM in Construction: A Bibliometric Analysis About BIM and Digital Twin</article-title>
          <source>Future Cities and Environment</source>
          <year>2026</year>
          <volume>12</volume>
          <page-range>20</page-range>
          <publisher-name>Cerebration Science Publishing Co., Limited</publisher-name>
          <pub-id pub-id-type="doi">10.70917/fce-2026-012</pub-id>
        </element-citation>
      </ref>
      <ref id="ref-r2">
        <element-citation publication-type="journal">
          <person-group person-group-type="author">
            <string-name>Allam, Zaheer</string-name>
            <string-name>Dhunny, Zaynah A.</string-name>
          </person-group>
          <article-title>On big data, artificial intelligence and smart cities</article-title>
          <source>Cities</source>
          <year>2019</year>
          <volume>89</volume>
          <page-range>80-91</page-range>
          <publisher-name>Elsevier BV</publisher-name>
          <pub-id pub-id-type="doi">10.1016/j.cities.2019.01.032</pub-id>
        </element-citation>
      </ref>
      <ref id="ref-r3">
        <element-citation publication-type="journal">
          <person-group person-group-type="author">
            <string-name>Aziz, Nurul Athirah</string-name>
            <string-name>Razak, Tajul Rosli</string-name>
            <string-name>Nordin, Sharifalillah</string-name>
            <string-name>Jarimi, Hasila</string-name>
            <string-name>Su, Yuehong</string-name>
            <string-name>Riffat, Saffa</string-name>
          </person-group>
          <article-title>AI-Based Modeling of Indoor Air Quality and Thermal Comfort: A Systematic Review of Human-Centric and Adaptive Approaches</article-title>
          <source>Journal of Climate Change</source>
          <year>2026</year>
          <volume>11</volume>
          <issue>4</issue>
          <page-range>29</page-range>
          <publisher-name>Cerebration Science Publishing Co., Limited</publisher-name>
          <pub-id pub-id-type="doi">10.70917/jcc-2025-034</pub-id>
        </element-citation>
      </ref>
      <ref id="ref-r4">
        <element-citation publication-type="journal">
          <person-group person-group-type="author">
            <string-name>Bagarello, Fabio</string-name>
            <string-name>Basieva, Irina</string-name>
            <string-name>Khrennikov, Andrei</string-name>
          </person-group>
          <article-title>Quantum field inspired model of decision making: Asymptotic stabilization of belief state via interaction with surrounding mental environment</article-title>
          <source>Journal of Mathematical Psychology</source>
          <year>2018</year>
          <volume>82</volume>
          <page-range>159-168</page-range>
          <publisher-name>Elsevier BV</publisher-name>
          <pub-id pub-id-type="doi">10.1016/j.jmp.2017.10.002</pub-id>
        </element-citation>
      </ref>
      <ref id="ref-r6">
        <element-citation publication-type="journal">
          <person-group person-group-type="author">
            <string-name>Bibri, Simon Elias</string-name>
            <string-name>Huang, Jeffrey</string-name>
            <string-name>Jagatheesaperumal, Senthil Kumar</string-name>
            <string-name>Krogstie, John</string-name>
          </person-group>
          <article-title>The synergistic interplay of artificial intelligence and digital twin in environmentally planning sustainable smart cities: A comprehensive systematic review</article-title>
          <source>Environmental Science and Ecotechnology</source>
          <year>2024</year>
          <volume>20</volume>
          <page-range>100433</page-range>
          <publisher-name>Elsevier BV</publisher-name>
          <pub-id pub-id-type="doi">10.1016/j.ese.2024.100433</pub-id>
        </element-citation>
      </ref>
      <ref id="ref-r8">
        <element-citation publication-type="book">
          <person-group person-group-type="author">
            <string-name>Busemeyer, Jerome R.</string-name>
            <string-name>Bruza, Peter D.</string-name>
          </person-group>
          <article-title>Quantum Models of Cognition and Decision</article-title>
          <year>2012</year>
          <publisher-name>Cambridge University Press</publisher-name>
          <pub-id pub-id-type="doi">10.1017/cbo9780511997716</pub-id>
        </element-citation>
      </ref>
      <ref id="ref-r9">
        <element-citation publication-type="journal">
          <person-group person-group-type="author">
            <string-name>Butts, Carter T.</string-name>
          </person-group>
          <article-title>A perturbative solution to the linear influence/network autocorrelation model under network dynamics</article-title>
          <source>The Journal of Mathematical Sociology</source>
          <year>2025</year>
          <volume>49</volume>
          <issue>3</issue>
          <page-range>192-210</page-range>
          <publisher-name>Informa UK Limited</publisher-name>
          <pub-id pub-id-type="doi">10.1080/0022250X.2025.2496146</pub-id>
        </element-citation>
      </ref>
      <ref id="ref-r13">
        <element-citation publication-type="journal">
          <person-group person-group-type="author">
            <string-name>Chan, Kit Ming Danny</string-name>
            <string-name>Duivenvoorden, Robert</string-name>
            <string-name>Flache, Andreas</string-name>
            <string-name>Mandjes, Michel</string-name>
          </person-group>
          <article-title>A relative approach to opinion formation</article-title>
          <source>The Journal of Mathematical Sociology</source>
          <year>2024</year>
          <volume>48</volume>
          <issue>1</issue>
          <page-range>1-41</page-range>
          <publisher-name>Informa UK Limited</publisher-name>
          <pub-id pub-id-type="doi">10.1080/0022250X.2022.2036142</pub-id>
        </element-citation>
      </ref>
      <ref id="ref-r15">
        <element-citation publication-type="journal">
          <person-group person-group-type="author">
            <string-name>Degroot, Morris H.</string-name>
          </person-group>
          <article-title>Reaching a Consensus</article-title>
          <source>Journal of the American Statistical Association</source>
          <year>1974</year>
          <volume>69</volume>
          <issue>345</issue>
          <page-range>118-121</page-range>
          <publisher-name>Informa UK Limited</publisher-name>
          <pub-id pub-id-type="doi">10.1080/01621459.1974.10480137</pub-id>
        </element-citation>
      </ref>
      <ref id="ref-r19">
        <element-citation publication-type="journal">
          <person-group person-group-type="author">
            <string-name>Facchetti, Giuseppe</string-name>
            <string-name>Iacono, Giovanni</string-name>
            <string-name>Altafini, Claudio</string-name>
          </person-group>
          <article-title>Computing global structural balance in large-scale signed social networks</article-title>
          <source>Proceedings of the National Academy of Sciences</source>
          <year>2011</year>
          <volume>108</volume>
          <issue>52</issue>
          <page-range>20953-20958</page-range>
          <publisher-name>National Academy of Sciences</publisher-name>
          <pub-id pub-id-type="doi">10.1073/pnas.1109521108</pub-id>
        </element-citation>
      </ref>
      <ref id="ref-r20">
        <element-citation publication-type="journal">
          <person-group person-group-type="author">
            <string-name>Friedkin, Noah E.</string-name>
            <string-name>Johnsen, Eugene C.</string-name>
          </person-group>
          <article-title>Social influence and opinions</article-title>
          <source>The Journal of Mathematical Sociology</source>
          <year>1990</year>
          <volume>15</volume>
          <issue>3-4</issue>
          <page-range>193-206</page-range>
          <publisher-name>Informa UK Limited</publisher-name>
          <pub-id pub-id-type="doi">10.1080/0022250X.1990.9990069</pub-id>
        </element-citation>
      </ref>
      <ref id="ref-r25">
        <element-citation publication-type="journal">
          <person-group person-group-type="author">
            <string-name>Khrennikov, A</string-name>
          </person-group>
          <article-title>Social Laser: Application of Quantum Information and Field Theories to Modeling of Social Processes</article-title>
          <source>Singapore: Jenny Stanford Publishing</source>
          <year>2020</year>
        </element-citation>
      </ref>
      <ref id="ref-r27">
        <element-citation publication-type="journal">
          <person-group person-group-type="author">
            <string-name>Leenders, Roger Th.A.J.</string-name>
          </person-group>
          <article-title>Modeling social influence through network autocorrelation: constructing the weight matrix</article-title>
          <source>Social Networks</source>
          <year>2002</year>
          <volume>24</volume>
          <issue>1</issue>
          <page-range>21-47</page-range>
          <publisher-name>Elsevier BV</publisher-name>
          <pub-id pub-id-type="doi">10.1016/s0378-8733(01)00049-1</pub-id>
        </element-citation>
      </ref>
      <ref id="ref-r30">
        <element-citation publication-type="journal">
          <person-group person-group-type="author">
            <string-name>Mai, Sabrina</string-name>
            <string-name>Renshaw, Scott Leo</string-name>
            <string-name>Gibson, Ben</string-name>
            <string-name>Sutton, Jeannette</string-name>
            <string-name>Butts, Carter T.</string-name>
          </person-group>
          <article-title>Hearts for hazards: A framework for understanding relationships between message interactions, with application to hazard communications</article-title>
          <source>The Journal of Mathematical Sociology</source>
          <year>2026</year>
          <volume>50</volume>
          <issue>2</issue>
          <page-range>81-112</page-range>
          <publisher-name>Informa UK Limited</publisher-name>
          <pub-id pub-id-type="doi">10.1080/0022250X.2025.2481367</pub-id>
        </element-citation>
      </ref>
      <ref id="ref-r32">
        <element-citation publication-type="journal">
          <person-group person-group-type="author">
            <string-name>Meylahn, Benedikt V.</string-name>
            <string-name>Den Boer, Arnoud V.</string-name>
            <string-name>Mandjes, Michel</string-name>
          </person-group>
          <article-title>Trusting: Alone and together</article-title>
          <source>The Journal of Mathematical Sociology</source>
          <year>2024</year>
          <volume>48</volume>
          <issue>4</issue>
          <page-range>424-478</page-range>
          <publisher-name>Informa UK Limited</publisher-name>
          <pub-id pub-id-type="doi">10.1080/0022250X.2024.2340135</pub-id>
        </element-citation>
      </ref>
      <ref id="ref-r35">
        <element-citation publication-type="journal">
          <person-group person-group-type="author">
            <string-name>Onweh, Chinedu C.</string-name>
            <string-name>Al-Habaibeh, Amin</string-name>
            <string-name>Manu, Emmanuel</string-name>
          </person-group>
          <article-title>A Review of Energy Efficiency Strategies in Smart Buildings: Integrating Occupant Comfort, HVAC Optimisation, and Building Automation</article-title>
          <source>Research and Reviews in Sustainability</source>
          <year>2025</year>
          <volume>1</volume>
          <issue>1</issue>
          <page-range>48-60</page-range>
          <publisher-name>Caravel Press</publisher-name>
          <pub-id pub-id-type="doi">10.5334/rss.9</pub-id>
        </element-citation>
      </ref>
      <ref id="ref-r39">
        <element-citation publication-type="journal">
          <person-group person-group-type="author">
            <string-name>Razak, Tajul Rosli</string-name>
            <string-name>Ismail, Mohammad Hafiz</string-name>
            <string-name>Jarimi, Hasila</string-name>
            <string-name>Nadzir, Mohd Shahrul Mohd</string-name>
            <string-name>Zheng, Tianhong</string-name>
            <string-name>Yanan, Zhang</string-name>
            <string-name>Ahmad, Emy Zairah</string-name>
            <string-name>Syafiq, Ubaidah</string-name>
            <string-name>Ludin, Norasikin Ahmad</string-name>
            <string-name>Rahman, Noor Muhamad Abd.</string-name>
            <string-name>Jamaludin, Mohd Haikal</string-name>
            <string-name>Riffat, Saffa</string-name>
          </person-group>
          <article-title>Machine Learning-Based Predictive Models for Indoor Air Quality and Thermal Comfort: Bridging Sensor Data and Human Perception in Healthcare Facilities</article-title>
          <source>Energy Catalyst</source>
          <year>2025</year>
          <volume>1</volume>
          <page-range>35-53</page-range>
          <publisher-name>Caravel Press</publisher-name>
          <pub-id pub-id-type="doi">10.61552/ec.2025.003</pub-id>
        </element-citation>
      </ref>
      <ref id="ref-r40">
        <element-citation publication-type="journal">
          <person-group person-group-type="author">
            <string-name>Reid, Louise</string-name>
            <string-name>Ellsworth-Krebs, Katherine</string-name>
          </person-group>
          <article-title>Demanding expectations: Exploring the experience of distributed heat generation in Europe</article-title>
          <source>Energy Research &amp; Social Science</source>
          <year>2021</year>
          <volume>71</volume>
          <page-range>101821</page-range>
          <publisher-name>Elsevier BV</publisher-name>
          <pub-id pub-id-type="doi">10.1016/j.erss.2020.101821</pub-id>
        </element-citation>
      </ref>
      <ref id="ref-r41">
        <element-citation publication-type="journal">
          <person-group person-group-type="author">
            <string-name>Riffat, James</string-name>
            <string-name>Samaei, Seyed Reza</string-name>
            <string-name>Ghahfarokhi, Mohammad Asadian</string-name>
          </person-group>
          <article-title>AI-Based Optimization and Hydrodynamic Performance of Floating Pontoon Breakwaters through Experimental and Numerical Modeling</article-title>
          <source>Global Decarbonisation</source>
          <year>2025</year>
          <volume>1</volume>
          <issue>1</issue>
          <page-range>1-26</page-range>
          <publisher-name>Caravel Press</publisher-name>
          <pub-id pub-id-type="doi">10.17184/eac.9847</pub-id>
        </element-citation>
      </ref>
      <ref id="ref-r44">
        <element-citation publication-type="journal">
          <person-group person-group-type="author">
            <string-name>Samaei, Seyed Reza</string-name>
            <string-name>Riffat, James</string-name>
          </person-group>
          <article-title>From Optimization to Stability Preservation: A Self-Healing, Action-Bearing Digital Twin for Climate-Stressed Building Energy Systems</article-title>
          <source>Green Technology &amp; Innovation</source>
          <year>2026</year>
          <volume>2</volume>
          <issue>1</issue>
          <page-range>150-177</page-range>
          <publisher-name>Caravel Press</publisher-name>
          <pub-id pub-id-type="doi">10.65582/gti.2026.008</pub-id>
        </element-citation>
      </ref>
      <ref id="ref-r47">
        <element-citation publication-type="journal">
          <person-group person-group-type="author">
            <string-name>Son, Tim Heinrich</string-name>
            <string-name>Weedon, Zack</string-name>
            <string-name>Yigitcanlar, Tan</string-name>
            <string-name>Sanchez, Thomas</string-name>
            <string-name>Corchado, Juan M.</string-name>
            <string-name>Mehmood, Rashid</string-name>
          </person-group>
          <article-title>Algorithmic urban planning for smart and sustainable development: Systematic review of the literature</article-title>
          <source>Sustainable Cities and Society</source>
          <year>2023</year>
          <volume>94</volume>
          <page-range>104562</page-range>
          <publisher-name>Elsevier BV</publisher-name>
          <pub-id pub-id-type="doi">10.1016/j.scs.2023.104562</pub-id>
        </element-citation>
      </ref>
      <ref id="ref-r48">
        <element-citation publication-type="journal">
          <person-group person-group-type="author">
            <string-name>Tzachor, Asaf</string-name>
            <string-name>Sabri, Soheil</string-name>
            <string-name>Richards, Catherine E.</string-name>
            <string-name>Rajabifard, Abbas</string-name>
            <string-name>Acuto, Michele</string-name>
          </person-group>
          <article-title>Potential and limitations of digital twins to achieve the Sustainable Development Goals</article-title>
          <source>Nature Sustainability</source>
          <year>2022</year>
          <volume>5</volume>
          <issue>10</issue>
          <page-range>822-829</page-range>
          <publisher-name>Springer Science and Business Media LLC</publisher-name>
          <pub-id pub-id-type="doi">10.1038/s41893-022-00923-7</pub-id>
        </element-citation>
      </ref>
      <ref id="ref-r50">
        <element-citation publication-type="journal">
          <person-group person-group-type="author">
            <string-name>Vinuesa, Ricardo</string-name>
            <string-name>Azizpour, Hossein</string-name>
            <string-name>Leite, Iolanda</string-name>
            <string-name>Balaam, Madeline</string-name>
            <string-name>Dignum, Virginia</string-name>
            <string-name>Domisch, Sami</string-name>
            <string-name>Felländer, Anna</string-name>
            <string-name>Langhans, Simone Daniela</string-name>
            <string-name>Tegmark, Max</string-name>
            <string-name>Fuso Nerini, Francesco</string-name>
          </person-group>
          <article-title>The role of artificial intelligence in achieving the Sustainable Development Goals</article-title>
          <source>Nature Communications</source>
          <year>2020</year>
          <volume>11</volume>
          <issue>1</issue>
          <publisher-name>Springer Science and Business Media LLC</publisher-name>
          <pub-id pub-id-type="doi">10.1038/s41467-019-14108-y</pub-id>
        </element-citation>
      </ref>
      <ref id="ref-r51">
        <element-citation publication-type="journal">
          <person-group person-group-type="author">
            <string-name>Wang, Zheng</string-name>
            <string-name>Solloway, Tyler</string-name>
            <string-name>Shiffrin, Richard M.</string-name>
            <string-name>Busemeyer, Jerome R.</string-name>
          </person-group>
          <article-title>Context effects produced by question orders reveal quantum nature of human judgments</article-title>
          <source>Proceedings of the National Academy of Sciences</source>
          <year>2014</year>
          <volume>111</volume>
          <issue>26</issue>
          <page-range>9431-9436</page-range>
          <publisher-name>National Academy of Sciences</publisher-name>
          <pub-id pub-id-type="doi">10.1073/pnas.1407756111</pub-id>
        </element-citation>
      </ref>
      <ref id="ref-r53">
        <element-citation publication-type="book">
          <person-group person-group-type="author">
            <string-name>Wendt, Alexander</string-name>
          </person-group>
          <article-title>Quantum Mind and Social Science</article-title>
          <year>2015</year>
          <publisher-name>Cambridge University Press</publisher-name>
          <pub-id pub-id-type="doi">10.1017/CBO9781316005163</pub-id>
        </element-citation>
      </ref>
      <ref id="ref-r54">
        <element-citation publication-type="journal">
          <person-group person-group-type="author">
            <string-name>Wilson, Kenneth G.</string-name>
          </person-group>
          <article-title>Confinement of quarks</article-title>
          <source>Physical Review D</source>
          <year>1974</year>
          <volume>10</volume>
          <issue>8</issue>
          <page-range>2445-2459</page-range>
          <publisher-name>American Physical Society (APS)</publisher-name>
          <pub-id pub-id-type="doi">10.1103/PhysRevD.10.2445</pub-id>
        </element-citation>
      </ref>
    </ref-list>
  </back>
</article>
