<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>Fairness After Intervention: Towards a Theory of Substantial Fairness for Machine Learning</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Sebastian Zezulka</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Universität Tübingen, Cluster of Excellence "Machine Learning"</institution>
          ,
          <addr-line>Maria-von-Linden-Str. 6, 72076 Tübingen</addr-line>
        </aff>
      </contrib-group>
      <abstract>
        <p>Implementing an algorithmically-informed policy represents a significant intervention into existing social structures. How such an intervention will afect society is a “naive", but arguably central, question for fair machine learning. I argue that this question is not adequately addressed by current “backwardlooking" approaches, which focus on constraints in a historical, pre-interventional distribution. This paper makes two contributions. First, I specify two methodological challenges for answering the “naive” question, intervention and feedback efects, and suggest methods to address these challenges. Second, I introduce a detailed case study from public policy: statistical profiling of registered unemployed by public employment services, focusing especially on Germany. Thereby, I also answer the call for greater engagement in the algorithmic fairness literature with concrete and context-rich use cases.</p>
      </abstract>
      <kwd-group>
        <kwd>eol&gt;Fairness in Machine Learning</kwd>
        <kwd>Statistical Profiling of Unemployed</kwd>
        <kwd>Substantial Fairness</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Retrospective and Prospective Fairness</title>
      <p>
        The algorithmic fairness literature usually focuses on formal properties of an algorithm and its
predictions [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ], [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ]. In one typical presentation, we are concerned with learning a function that
takes as input some features  and a sensitive attribute , and outputs a risk score . Formal
fairness requires that some constraint is met on either the joint distribution 0(, , , ) or
on the causal structure 0 giving rise to it (see the left-hand graph in Figure 1). Both
groupbased and causal fairness constraints can be represented in this way. Introducing a suitable
similarity metric on (, ) allows us to understand individual fairness approaches as imposing
constraints on 0 as well. In this sense, algorithmic fairness has a retrospective perspective that
evaluates the fairness of an algorithm in the historical, pre-interventional distribution 0 from
which the training data were drawn.
      </p>
      <p>
        This retrospective perspective on fair ML, focusing only on 0, does not adequately address our
“naive” question of how society will change once we implement a policy informed by our
predictor. This is for three reasons. First, results from test-set drawn from 0 are not valid fairness
estimates because implementing an algorithmically informed policy constitutes an intervention
and, therefore, changes the joint distribution of (, , , ) and the causal structure that gives
rise to it [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ]. Take college admission as example. Algorithmically informed admissions will
difer from non-algorithmic ones—that is, after all, part of the motivation for introducing them—,
implying that some applicants that previously would not be admitted will be, and vice versa.
The induced distribution shift implies that a predictor that satisfies some fairness constraint on
0 will not necessarily satisfy it after the intervention [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ]. Second, applicants will adapt to the
new decision processes, a phenomenon commonly attributed to Goodhart’s law and studied
under the various guises of long-term fairness [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ], [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ], performative prediction [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ] and strategic
manipulation [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ]. Third, formal fairness accounts tend to conflate predictions and decisions.
Many standard case studies in fair ML encourage this equivocation. A function which predicts
whether a student is likely to graduate in four years naturally suggests, but is not identical
to, the admission policy which admits precisely those students that are classified as likely to
graduate. Beigang [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ] rightfully stresses the diferent normative requirements for prediction
and decision making, respectively.
      </p>
      <p>
        It is for these reasons that the retrospective perspective, focusing only on 0, does not answer
our original question: how will implementing an algorithmic policy impact society? and will
the algorithmic policy ameliorate or entrench the injustices present in the historical structure
0? To answer these dificult question and to move towards a substantial theory of fairness for
machine learning, we must understand the problem as an intervention on structure [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ]. In other
words, an prospective perspective on algorithmic fairness must consider the post-interventional
distribution 1(, , , , ), shown on the right in Figure 1, with a new causal structure 1
arising after the intervention. Here, predictions, , and decisions, , are conceptually separated.
Further, the predictions and decisions afect the outcome variable,  . Additionally, we must ask
whether we have suficiently accounted for (potential) feedback loops induced by the policy, or
whether we should expect further changes to the joint distribution—is 1 in a stable state, or
should we expect it to continue to evolve?
Answering the above posed “naive” question of fair ML thus requires one to specify whether
moving from a society represented by 0 to one represented by 1, with a algorithmic
(informed) policy in place, is an improvement, or at least no deterioration in standards of justice.
Doing so requires the introduction of some contextual holistic measure  of the fairness of
0 and 1 and a comparison of  (0) with  (1). For example,  could be the degree to
which membership in the disadvantaged group predicts negative outcomes. Alternatively, it
could be some suitable measure of the causal efect of the sensitive attribute on the outcome, or
the degree to which relevantly similar individuals experience similar outcomes. Crucially, this
proposal depends on comparing structural properties of 0 and 1, it cannot be adjudicated
with knowledge of 0 alone.
      </p>
      <p>
        A number of challenging methodological questions arise from this conceptual clarification. It is
natural to worry that the structure of 1 is simply underdetermined by 0 and even a detailed
algorithmic policy proposal. This dificulty is real, but not insurmountable. Simulation studies
using Markov Decision Processes [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ] or structural causal models with dynamics [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ] can be
used to explore various scenarios and quantify the extent to which formal fairness constraints
answer to our substantive fairness goals. If we are sincere in our concern about algorithmically
informed policy, we should be willing to explore their consequences in the same way we study
the potential consequences of high-stakes proposals in climate policy or public health. In this
spirit, the following case study focuses on statistical profiling of registered unemployed.
      </p>
    </sec>
    <sec id="sec-2">
      <title>2. Statistical profiling of long-term unemployed</title>
      <p>The welfare systems in OECD countries have changed drastically in the last three decades.
Public employment services (PES) have been transformed under a twofold activation regime.
One is directed towards the unemployed by making participation in active labour market
programs (ALMP) a pre-condition for receiving benefits. The other is directed towards
public administration itself and aims at cost-efective provision of public goods by introducing
organisational principles from private firms. By now, statistical profiling has been used to
inform public administration decisions in a variety of fields. These tools are often framed as
introducing objectivity and efectiveness in the provision of public goods. In their focus on
statistical methods, they align with demands for evidence-based policy and digitisation in public
administration.</p>
      <p>
        Statistical profiling of registered unemployed is current practice in various OECD countries
such as Australia, the Netherlands, and Belgium. Supervised learning techniques are employed
to identify people at risk of becoming long-term unemployed (LTU). Building on studies like
Kern et al. [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ] and Körtner and Bonoli [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ], I evaluate the prediction of the individual risk of
becoming long-term unemployed using survey data from Germany as a case study on fairness in
machine learning. I utilise the IZA Evaluation Dataset Survey1 covering 8, 915 newly registered
unemployed from Germany eligible for (type one) unemployment benefits. Using only survey
data, I achieve accuracy rates between .66 and .808. These results are similar to those reported
for statistical profiling tools used in practice [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ].
      </p>
      <p>
        This project has two parts, the first of which is already realised. First, a retrospective and
group-based fairness analysis was conducted for the sensitive attributes gender and migration
background and two exemplary allocation policies. In the first, the PES prioritises those predicted
to be long-term unemployed. In the second, access to certain ALMPs is restricted to increase
cost-efectiveness. The first policy is modelled after the example of Flanders, Belgium [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ],
the second after the proposed but so-far unrealised Austrian “AMS-Algorithm” [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ]. Focusing
on unconstrained logistic regressions as an example, the observational fairness measures
Independence and Separation are violated for gender, whereas Suficiency is almost satisfied. In
other words, women are predicted to become LTU more often than the respective base rate
suggests, and their false-positive rate is higher compared to men. For migration background,
the three group-based formal fairness constraints are approximately satisfied. Based on this, I
have further conducted a qualitative fairness evaluation discussing potential harms and benefits
for registered unemployed under the two policies. Statistical profiling of registered unemployed
is an intricate case study because the efects of ALMPs are heterogeneous across programs and
social groups [
        <xref ref-type="bibr" rid="ref16">16</xref>
        ]. Strong welfare gains are possible if allocation to ALMPs can be made more
targeted to individual needs, as shown by Goller et al. [
        <xref ref-type="bibr" rid="ref17">17</xref>
        ] and others. Utilising the empirical
evidence from the social sciences, this case study provides the relevant context for a normative
evaluation and demonstrates the relevance of the specific policies that are to be informed by
statistical profiling.
      </p>
      <p>
        The second part of this project will take a prospective view of the problem. Building on an initial
simulation study by Scher et al. [
        <xref ref-type="bibr" rid="ref18">18</xref>
        ] and utilising individualised treatment efect estimates from
Knaus et al. [
        <xref ref-type="bibr" rid="ref19">19</xref>
        ], this project aims at answering how to rigorously study the “naive” question of
fair machine learning. Thus, it must answer how diferent ALMP allocation policies informed by
fairness-constraint predictors impact labour market outcomes across demographics. Simulation
studies are promising as they allow us to study equilibrium efects and quantify the efect of
diferent retrospective fairness constraints after deployment.
      </p>
      <p>Various intervention and feedback efects are to be considered here. Diferent combinations of
(1) (fairness-constrained) risk predictors and (2) algorithmically-informed allocation policies
will induce diferent distributions of labor market outcomes. The heterogeneity in program
efects implies further variation in labour-market outcomes under diferent choices for (1) and
(2). Understanding the efects of these various combinations is essential for crafting policies
that make gains in substantive fairness.</p>
      <p>To summarise, the paper contributes a novel conceptual understanding of the
methodological requirements for substantial fairness in machine learning, fairness after intervention, and
illustrates the proposal by a case study of statistical profiling of registered unemployed.</p>
    </sec>
    <sec id="sec-3">
      <title>Acknowledgments</title>
      <p>The author is supported by the Deutsche Forschungsgemeinschaft (BE5601/4-1; Cluster of
Excellence “Machine Learning—New Perspectives for Science”, EXC 2064, project number
390727645) and the International Max Planck Research School for Intelligent Systems
(IMPRSIS).</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>S.</given-names>
            <surname>Barocas</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Hardt</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Narayanan</surname>
          </string-name>
          ,
          <article-title>Fairness and Machine Learning, fairmlbook</article-title>
          .org,
          <year>2019</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>R.</given-names>
            <surname>Berk</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. K.</given-names>
            <surname>Kuchibhotla</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E. T.</given-names>
            <surname>Tchetgen</surname>
          </string-name>
          , Fair Risk Algorithms,
          <source>Annual Review of Statistics and Its Application</source>
          <volume>10</volume>
          (
          <year>2022</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>A.</given-names>
            <surname>Mishler</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Dalmasso</surname>
          </string-name>
          , Fair When Trained,
          <source>Unfair When Deployed: Observable Fairness Measures are Unstable in Performative Prediction Settings</source>
          ,
          <year>2022</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <surname>A. D'Amour</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          <string-name>
            <surname>Srinivasan</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          <string-name>
            <surname>Atwood</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          <string-name>
            <surname>Baljekar</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          <string-name>
            <surname>Sculley</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          <string-name>
            <surname>Halpern</surname>
          </string-name>
          , Fairness Is Not Static:
          <article-title>Deeper Understanding of Long Term Fairness via Simulation Studies</article-title>
          ,
          <source>in: Proceedings of the 2020 Conference on Fairness, Accountability, and Transparency</source>
          , FAT* '20,
          <string-name>
            <surname>ACM</surname>
          </string-name>
          ,
          <year>2020</year>
          , p.
          <fpage>525</fpage>
          -
          <lpage>534</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>X.</given-names>
            <surname>Zhang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Tu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Liu</surname>
          </string-name>
          , M. Liu,
          <string-name>
            <given-names>H.</given-names>
            <surname>Kjellstrom</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Zhang</surname>
          </string-name>
          , C. Zhang,
          <article-title>How do fair decisions fare in long-term qualification?</article-title>
          ,
          <source>Advances in Neural Information Processing Systems</source>
          (
          <year>2020</year>
          )
          <fpage>1</fpage>
          -
          <lpage>13</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>J.</given-names>
            <surname>Perdomo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Zrnic</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Mendler-Dünner</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Hardt</surname>
          </string-name>
          ,
          <article-title>Performative prediction</article-title>
          ,
          <source>in: International Conference on Machine Learning, PMLR</source>
          ,
          <year>2020</year>
          , pp.
          <fpage>7599</fpage>
          -
          <lpage>7609</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>L.</given-names>
            <surname>Hu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Immorlica</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. W.</given-names>
            <surname>Vaughan</surname>
          </string-name>
          ,
          <article-title>The Disparate Efects of Strategic Manipulation</article-title>
          ,
          <source>in: Proceedings of the Conference on Fairness, Accountability, and Transparency</source>
          , FAT* '
          <volume>19</volume>
          ,
          <string-name>
            <surname>Association</surname>
          </string-name>
          for Computing Machinery, New York, NY, USA,
          <year>2019</year>
          , p.
          <fpage>259</fpage>
          -
          <lpage>268</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>F.</given-names>
            <surname>Beigang</surname>
          </string-name>
          ,
          <article-title>On the Advantages of Distinguishing Between Predictive and Allocative Fairness in Algorithmic Decision-Making</article-title>
          ,
          <source>Minds and Machines</source>
          <volume>32</volume>
          (
          <year>2022</year>
          )
          <fpage>655</fpage>
          -
          <lpage>682</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>D.</given-names>
            <surname>Malinsky</surname>
          </string-name>
          , Intervening on structure,
          <source>Synthese</source>
          <volume>195</volume>
          (
          <year>2018</year>
          )
          <fpage>2295</fpage>
          -
          <lpage>2312</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Hu</surname>
          </string-name>
          ,
          <string-name>
            <surname>L. Zhang,</surname>
          </string-name>
          <article-title>Achieving Long-Term Fairness in Sequential Decision Making</article-title>
          ,
          <source>Proceedings of the AAAI Conference on Artificial Intelligence</source>
          <volume>36</volume>
          (
          <year>2022</year>
          )
          <fpage>9549</fpage>
          -
          <lpage>9557</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>C.</given-names>
            <surname>Kern</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R. L.</given-names>
            <surname>Bach</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Mautner</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Kreuter</surname>
          </string-name>
          ,
          <article-title>Fairness in algorithmic profiling: A German case study</article-title>
          ,
          <source>arXiv preprint arXiv:2108.04134</source>
          (
          <year>2021</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>J.</given-names>
            <surname>Körtner</surname>
          </string-name>
          , G. Bonoli,
          <article-title>Predictive Algorithms in the Delivery of Public Employment Services</article-title>
          ,
          <source>SocArXiv</source>
          (
          <year>2021</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>S.</given-names>
            <surname>Desiere</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Langenbucher</surname>
          </string-name>
          , L. Struyven,
          <article-title>Statistical profiling in public employment services: An international comparison</article-title>
          ,
          <source>Employment and Migration Working Papers</source>
          <volume>224</volume>
          (
          <year>2019</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>S.</given-names>
            <surname>Desiere</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Struyven</surname>
          </string-name>
          ,
          <article-title>Using artificial intelligence to classify jobseekers: the accuracyequity trade-of</article-title>
          ,
          <source>Journal of Social Policy</source>
          <volume>50</volume>
          (
          <year>2021</year>
          )
          <fpage>367</fpage>
          -
          <lpage>385</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>D.</given-names>
            <surname>Allhutter</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Cech</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Fischer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Grill</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Mager</surname>
          </string-name>
          ,
          <article-title>Algorithmic profiling of job seekers in Austria: how austerity politics are made efective</article-title>
          ,
          <source>Frontiers in Big Data</source>
          <volume>3</volume>
          (
          <year>2020</year>
          )
          <fpage>1</fpage>
          -
          <lpage>17</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <given-names>D.</given-names>
            <surname>Card</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Kluve</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Weber</surname>
          </string-name>
          ,
          <article-title>What works? A meta analysis of recent active labor market program evaluations</article-title>
          ,
          <source>Journal of the European Economic Association</source>
          <volume>16</volume>
          (
          <year>2018</year>
          )
          <fpage>894</fpage>
          -
          <lpage>931</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <string-name>
            <given-names>D.</given-names>
            <surname>Goller</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Harrer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Lechner</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Wolf</surname>
          </string-name>
          ,
          <article-title>Active labour market policies for the long-term unemployed: New evidence from causal machine learning</article-title>
          ,
          <source>arXiv preprint arXiv:2106.10141</source>
          (
          <year>2021</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          [18]
          <string-name>
            <given-names>S.</given-names>
            <surname>Scher</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Kopeinik</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Trügler</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Kowald</surname>
          </string-name>
          ,
          <article-title>Modelling the long-term fairness dynamics of data-driven targeted help on job seekers</article-title>
          ,
          <source>Scientific Reports</source>
          <volume>13</volume>
          (
          <year>2023</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          [19]
          <string-name>
            <surname>M. C. Knaus</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Lechner</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Strittmatter</surname>
          </string-name>
          ,
          <article-title>Heterogeneous employment efects of job search programs a machine learning approach</article-title>
          ,
          <source>Journal of Human Resources</source>
          <volume>57</volume>
          (
          <year>2022</year>
          )
          <fpage>597</fpage>
          -
          <lpage>636</lpage>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>