<?xml version="1.0" encoding="UTF-8" standalone="yes"?><?xml-stylesheet type="text/xsl" href="/oai-pmh-repository/static/oai2.xsl"?>
<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-10-15T11:22:44Z</responseDate>
    <request verb="GetRecord" identifier="oai:data.mendeley.com/9xbszvtvfh.1" metadataPrefix="oai_dc">https://data.mendeley.com/oai</request>
    <GetRecord>
        <record>
            <header>
                <identifier>oai:data.mendeley.com/9xbszvtvfh.1</identifier>
                <datestamp>2026-06-04T19:28:16Z</datestamp>
            </header>
            <metadata><oai_dc:dc xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd" 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">
    <dc:creator>FRYDRYCH, PIOTR</dc:creator>
    <dc:title>PSTACK-COMPRESS: Experimental Code v2</dc:title>
    <dc:publisher>Mendeley Data</dc:publisher>
    <dc:description>This dataset contains the complete Python source code accompanying the paper:
Piotr Frydrych, &quot;The Preisach Extremum Stack as an Order-2 Davenport–Schinzel Sequence: Online Compression and Sufficient Statistics for Rate-Independent Streams,&quot; Discrete Applied Mathematics, submitted May 2026.
The code implements PSTACK-COMPRESS (Algorithm 1 from the paper): an online, linear-time algorithm for lossless compression of rate-independent data streams based on the Preisach extremum stack. The extremum stack Π_n records the alternating local maxima and minima of a discrete sequence that survive the Preisach wiping-out rule. The paper proves that Π_n is the Kolmogorov-minimal sufficient statistic for the class R of all computable rate-independent functionals, and that PSTACK-COMPRESS is asymptotically optimal: no online algorithm can produce a shorter exact representation for any R-query.
The dataset includes:

pstack_dam_experiments.py — full implementation of PSTACK-COMPRESS, eight synthetic signal generators (monotone, slow sine, trend+noise, white noise, piecewise/SCADA-like, ECG-like, financial random walk, adversarial worst-case), a self-test suite verifying the Definition 4 stack invariant at every time step, and benchmark routines reproducing all numerical results reported in Sections 7.1–7.4 of the paper (compression ratios, adversarial lower bound verification, white noise k/n distribution, speedup of online vs. naive algorithm).
README.md — detailed usage instructions, description of all signal classes, code examples reproducing specific tables and figures from the paper, and citation information.

No real-world datasets are used. All signals are generated synthetically and deterministically from fixed random seeds, ensuring full reproducibility of every number reported in the paper.

Keywords
Preisach operator, extremum stack, Davenport–Schinzel sequences, rate-independent functionals, online compression, Kolmogorov complexity, sufficient statistic, time series, data streams, hysteresis

Related publication
Frydrych, P. (2026). The Preisach Extremum Stack as an Order-2 Davenport–Schinzel Sequence: Online Compression and Sufficient Statistics for Rate-Independent Streams. </dc:description>
    <dc:subject>Computer Science</dc:subject>
    <dc:subject>Signal Processing</dc:subject>
    <dc:type>Dataset</dc:type>
    <dc:identifier>doi:10.17632/9xbszvtvfh.1</dc:identifier>
    <dc:identifier>oai:data.mendeley.com/9xbszvtvfh.1</dc:identifier>
    <dc:rights>MIT License</dc:rights>
    <dc:rights>http://opensource.org/licenses/MIT</dc:rights>
    <dc:relation>https://data.mendeley.com/datasets/9xbszvtvfh</dc:relation>
    <dc:date>2026-06-04T19:28:16Z</dc:date>
</oai_dc:dc></metadata>
        </record>
    </GetRecord>
</OAI-PMH>
