Sparse Quotient-Threshold Transform (SQTT): benchmark data, reference code, and reproducibility package

This version 1.0.0 research compendium supports the computational evaluation of the Sparse Quotient-Threshold Transform (SQTT), an exact method for computing all outputs of a knapsack-threshold transform and its additive generalized-assignment extension. The compendium contains the MATLAB reference implementation, declared exact comparators, instance generators, correctness checks, the frozen primary experimental protocol, analysis scripts, preservation-friendly data tables, figure-source data, rendered figures, and SHA-256 artifact manifests. The empirical data comprise 1,788 completed full-benchmark case-method trials over 610 generated cases and a balanced 30-run scalar scalability panel for k = 18 and k = 20. The balanced panel is a post-inspection exploratory supplement and is not part of the prespecified primary benchmark. Eight accepted k = 22 observations are supplied in a separate exploratory resource-boundary dataset: three completed outcomes and five verified memory-limit outcomes. These k = 22 observations are not included in the primary runtime comparisons, and no missing runtime is imputed. The statistical unit is the generated case rather than an individual timing repeat. Timing repeats are summarized within each case. Paired log-speed ratios are defined as ln(baseline time / SQTT time), and uncertainty is reported using stratified case-level percentile bootstrap 95% confidence intervals. The archive includes the derived case-level dataset, summary tables, performance-profile curves, scaling summaries, resource-boundary summaries, and an independent correctness gate covering 2,000 scalar and 500 generalized-assignment cases with zero failures. Code is released under the MIT License. Data, tables, figures, protocols, and documentation are released under Creative Commons Attribution 4.0 International. File-level provenance and SHA-256 checksums are provided in the package manifest.