<?xml version="1.0" encoding="UTF-8"?>
<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/"
  xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
  xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
  <responseDate>2026-11-04T23:29:22Z</responseDate>
  <request metadataPrefix="oai_dc" verb="ListRecords">https://edapress.org/oai</request>
  <ListRecords>
  <record>
    <header>
      <identifier>oai:edapress.org:eda-2026-0142</identifier>
      <datestamp>2026-06-24</datestamp>
      <setSpec>cs</setSpec>
    </header>
    <metadata>
      <oai_dc:dc xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
        xmlns:dc="http://purl.org/dc/elements/1.1/"
        xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
        xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
        <dc:title>Attention Sparsity Patterns in Small Transformers Trained on Low-Resource Languages</dc:title>
        <dc:creator>A. Mekonnen</dc:creator>
        <dc:creator>J. Park</dc:creator>
        <dc:subject>Computer Science</dc:subject>
        <dc:subject>transformers</dc:subject>
        <dc:subject>interpretability</dc:subject>
        <dc:subject>low-resource NLP</dc:subject>
        <dc:description>We study how attention heads specialise when transformer models under 50M parameters are trained on corpora of fewer than 10 million tokens. Across five low-resource languages we find that induction heads emerge later and remain measurably sparser than in high-resource baselines, and that this sparsity predicts downstream transfer accuracy. We release our training code, checkpoints and evaluation harness.</dc:description>
        <dc:publisher>EDA</dc:publisher>
        <dc:date>2026-06-24</dc:date>
        <dc:type>Text</dc:type>
        <dc:type>info:eu-repo/semantics/article</dc:type>
        <dc:format>application/pdf</dc:format>
        <dc:identifier>https://doi.org/10.0000/eda.2026.0142</dc:identifier>
        <dc:identifier>https://edapress.org/paper/eda-2026-0142</dc:identifier>
        <dc:language>en</dc:language>
        <dc:rights>CC BY 4.0</dc:rights>
      </oai_dc:dc>
    </metadata>
  </record>
  <record>
    <header>
      <identifier>oai:edapress.org:eda-2026-0138</identifier>
      <datestamp>2026-06-02</datestamp>
      <setSpec>earth</setSpec>
    </header>
    <metadata>
      <oai_dc:dc xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
        xmlns:dc="http://purl.org/dc/elements/1.1/"
        xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
        xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
        <dc:title>Mapping Urban Heat Islands with a Low-Cost Sensor Network Built by Secondary Students</dc:title>
        <dc:creator>R. Osei</dc:creator>
        <dc:creator>M. Chen</dc:creator>
        <dc:creator>S. Villanueva</dc:creator>
        <dc:subject>Earth &amp; Climate</dc:subject>
        <dc:subject>urban heat island</dc:subject>
        <dc:subject>open hardware</dc:subject>
        <dc:subject>citizen science</dc:subject>
        <dc:description>Forty students deployed 96 open-hardware temperature sensors across a mid-sized city over one summer. We describe the calibration protocol, quantify drift against a reference station, and show the network resolves intra-city temperature differences of up to 4.2 degrees Celsius. Total hardware cost was under 900 USD.</dc:description>
        <dc:publisher>EDA</dc:publisher>
        <dc:date>2026-06-02</dc:date>
        <dc:type>Text</dc:type>
        <dc:type>info:eu-repo/semantics/article</dc:type>
        <dc:format>application/pdf</dc:format>
        <dc:identifier>https://doi.org/10.0000/eda.2026.0138</dc:identifier>
        <dc:identifier>https://edapress.org/paper/eda-2026-0138</dc:identifier>
        <dc:language>en</dc:language>
        <dc:rights>CC BY 4.0</dc:rights>
      </oai_dc:dc>
    </metadata>
  </record>
  <record>
    <header>
      <identifier>oai:edapress.org:eda-2026-0151</identifier>
      <datestamp>2026-07-09</datestamp>
      <setSpec>quant</setSpec>
    </header>
    <metadata>
      <oai_dc:dc xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
        xmlns:dc="http://purl.org/dc/elements/1.1/"
        xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
        xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
        <dc:title>Shallow Variational Circuits for Constrained Portfolio Selection</dc:title>
        <dc:creator>T. Fernandes</dc:creator>
        <dc:subject>Quantum</dc:subject>
        <dc:subject>variational algorithms</dc:subject>
        <dc:subject>QAOA</dc:subject>
        <dc:subject>finance</dc:subject>
        <dc:description>We benchmark a depth-4 variational quantum circuit against classical solvers on constrained portfolio selection with up to 18 assets. On simulator and on trapped-ion hardware the quantum approach matches classical solutions for small instances but shows no advantage at this scale. We report full circuit definitions, seeds and device calibration so results can be reproduced.</dc:description>
        <dc:publisher>EDA</dc:publisher>
        <dc:date>2026-07-09</dc:date>
        <dc:type>Text</dc:type>
        <dc:type>info:eu-repo/semantics/article</dc:type>
        <dc:format>application/pdf</dc:format>
        <dc:identifier>https://doi.org/10.0000/eda.2026.0151</dc:identifier>
        <dc:identifier>https://edapress.org/paper/eda-2026-0151</dc:identifier>
        <dc:language>en</dc:language>
        <dc:rights>CC BY 4.0</dc:rights>
      </oai_dc:dc>
    </metadata>
  </record>
  <record>
    <header>
      <identifier>oai:edapress.org:eda-2026-0159</identifier>
      <datestamp>2026-08-14</datestamp>
      <setSpec>soc</setSpec>
    </header>
    <metadata>
      <oai_dc:dc xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
        xmlns:dc="http://purl.org/dc/elements/1.1/"
        xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
        xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
        <dc:title>Cross-Age Peer Tutoring and Mathematics Anxiety: A Preregistered Field Study</dc:title>
        <dc:creator>P. Okonkwo</dc:creator>
        <dc:creator>H. Lindqvist</dc:creator>
        <dc:subject>Social Science</dc:subject>
        <dc:subject>education</dc:subject>
        <dc:subject>preregistration</dc:subject>
        <dc:subject>maths anxiety</dc:subject>
        <dc:description>In a preregistered study across four schools (n = 268), we test whether cross-age peer tutoring reduces self-reported mathematics anxiety. We find a small but robust effect concentrated in students starting in the lowest quartile, and no detectable effect on test scores within one term.</dc:description>
        <dc:publisher>EDA</dc:publisher>
        <dc:date>2026-08-14</dc:date>
        <dc:type>Text</dc:type>
        <dc:type>info:eu-repo/semantics/article</dc:type>
        <dc:format>application/pdf</dc:format>
        <dc:identifier>https://doi.org/10.0000/eda.2026.0159</dc:identifier>
        <dc:identifier>https://edapress.org/paper/eda-2026-0159</dc:identifier>
        <dc:language>en</dc:language>
        <dc:rights>CC BY 4.0</dc:rights>
      </oai_dc:dc>
    </metadata>
  </record>
  </ListRecords>
</OAI-PMH>
