Artifact for "Quantitative GRP for Permanental Ideals with Fully Quantified Bounds, a Connection Theorem, and Reproducible n=4 Evidence"

OverviewThis is the lightweight reproducibility artifact for the paper:“Quantitative GRP for Permanental Ideals: Fully Quantified Bounds and a Connection Theorem.”All main theorems are proved without computer algebra. The files here allow independent verificationof the minimal Macaulay2 run for n=4 and inspection of truncated Betti data.Executable code is not provided in the PDF; use these canonical files and verify via checksums. Contents- `artifact-PNP-v1.zip` — top-level bundle (see checksums below)- `CHECKSUMS.txt` — SHA-256 for each file- `LICENSE` — code: MIT; documents: CC BY 4.0- `README.md` — instructions, file map- *(optional)* `tiny_log.txt`, `betti_truncated.txt`, `bs_log.txt` (proofs do **not** depend on BS outputs). How to verifyZIP SHA256: `F083B5281A3C91EC6EEDD79C0D3A593F7C3B21BFAFE099DA887B723D3E9C3F16` Per-file hashes: see `CHECKSUMS.txt`. Windows (PowerShell): Get-FileHash .\artifact-PNP-v1.zip -Algorithm SHA256Linux/macOS: sha256sum artifact-PNP-v1.zip Reproducibility notes- Environment: Macaulay2 ≥ 1.22, base field `ZZ/32003`, `MonomialOrder => GRevLex`.- Minimal run (n=4) yields the raw line `beta_{2,3}=0` (no degree-3 second syzygies under DegreeLimit=3), hence `deg(Syz) ≥ 4` for this instance.- Boij–Söderberg decomposition is optional for this paper. CitationPlease cite the paper and this record (version DOI).