IECZ: Balanced 3XOR→3SAT — Size-Aware Artifact Bundle (v1.0.1)

Fuente: Zenodo
Salvato in:
Dettagli Bibliografici
Autore principale: Lela, Marko
Natura: Recurso digital
Lingua:inglese
Pubblicazione: Zenodo 2025
Soggetti:
Accesso online:
Tags: Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
_version_ 1866902304012107776
author Lela, Marko
author_facet Lela, Marko
contents <p><strong>Summary.</strong><br>This artifact bundle accompanies the “IECZ” note. It contains the paper PDF, the Python scripts used to generate and check instances, and a manifest for integrity checks. The bundle is meant to be citable and reproducible as a self-contained dataset.</p> <p><strong>What’s inside.</strong><br>– <code>main.pdf</code> — camera-ready manuscript.<br>– <code>scripts/</code> — Python utilities (generation, checks, manifests).<br>– <code>MANIFEST-SHA256.txt</code> — checksums for all files in the bundle.<br>– <code>README.md</code> — how to verify and how to run the scripts.</p> <p><strong>How to verify integrity.</strong></p> <ol> <li> <p>Unzip the archive.</p> </li> <li> <p>In the extracted folder, run: <code>sha256sum -c MANIFEST-SHA256.txt</code> (Linux/macOS) or <code>Get-FileHash -Algorithm SHA256</code> (Windows) and compare.</p> </li> </ol> <p><strong>How to cite.</strong><br>Please cite this dataset (Zenodo DOI) together with the paper. A BibTeX entry <code>@dataset{iecz_zenodo_v1_0_1, …}</code> is included in <code>CITATION.bib</code>.</p> <p><strong>License.</strong><br>Deposit license: CC BY 4.0.<br>Code in <code>scripts/</code> is additionally licensed under MIT (see <code>LICENSE-CODE</code>). The PDF and documentation are CC BY 4.0.</p> <p><strong>Reproducibility note.</strong><br>The artifact focuses on size-aware bounds for balanced 3XOR→3SAT via a δ=0 measure-preserving translation and includes the exact scripts used to prepare the manifests and example runs.</p>
format Recurso digital
id zenodo_https___doi_org_10_5281_zenodo_17141362
institution Zenodo
language eng
publishDate 2025
publisher Zenodo
record_format zenodo
spellingShingle IECZ: Balanced 3XOR→3SAT — Size-Aware Artifact Bundle (v1.0.1)
Lela, Marko
AC^0, switching lemma, 3XOR, 3SAT, total variation, measure-preserving reduction, MDL, description length, parity, average-case complexity, lower bounds, random hypergraph, 2-core, P-uniform circuits
Computer Science — Computational Complexity Theoretical Computer Science
<p><strong>Summary.</strong><br>This artifact bundle accompanies the “IECZ” note. It contains the paper PDF, the Python scripts used to generate and check instances, and a manifest for integrity checks. The bundle is meant to be citable and reproducible as a self-contained dataset.</p> <p><strong>What’s inside.</strong><br>– <code>main.pdf</code> — camera-ready manuscript.<br>– <code>scripts/</code> — Python utilities (generation, checks, manifests).<br>– <code>MANIFEST-SHA256.txt</code> — checksums for all files in the bundle.<br>– <code>README.md</code> — how to verify and how to run the scripts.</p> <p><strong>How to verify integrity.</strong></p> <ol> <li> <p>Unzip the archive.</p> </li> <li> <p>In the extracted folder, run: <code>sha256sum -c MANIFEST-SHA256.txt</code> (Linux/macOS) or <code>Get-FileHash -Algorithm SHA256</code> (Windows) and compare.</p> </li> </ol> <p><strong>How to cite.</strong><br>Please cite this dataset (Zenodo DOI) together with the paper. A BibTeX entry <code>@dataset{iecz_zenodo_v1_0_1, …}</code> is included in <code>CITATION.bib</code>.</p> <p><strong>License.</strong><br>Deposit license: CC BY 4.0.<br>Code in <code>scripts/</code> is additionally licensed under MIT (see <code>LICENSE-CODE</code>). The PDF and documentation are CC BY 4.0.</p> <p><strong>Reproducibility note.</strong><br>The artifact focuses on size-aware bounds for balanced 3XOR→3SAT via a δ=0 measure-preserving translation and includes the exact scripts used to prepare the manifests and example runs.</p>
title IECZ: Balanced 3XOR→3SAT — Size-Aware Artifact Bundle (v1.0.1)
topic AC^0, switching lemma, 3XOR, 3SAT, total variation, measure-preserving reduction, MDL, description length, parity, average-case complexity, lower bounds, random hypergraph, 2-core, P-uniform circuits
Computer Science — Computational Complexity Theoretical Computer Science
url https://doi.org/10.5281/zenodo.17141362