Counting Reductions and Computational Evidence for Small Two-Stage Strict Group-Testing Instances

We study deterministic two-stage strict group testing with unrestricted overlapping pools and a threshold of two positive items. We present negative-set and antichain reductions, describe a computational candidate for the minimum of ten tests at 19 items, and give a complete counting implication for 28 and 29 items. The latter implication is explicitly conditional: if at most 18 items can be handled by nine tests in two stages, then both instances require eleven tests. The 19-item exhaustive-search results are reported from project records, not newly certified here. Positive-strategy witnesses, negative-search logs and mathematical reductions are distinguished. No claim of independently certified optimality or priority is made. The work is AI-assisted and has not received independent human mathematical review or peer review. The accompanying curated source archive includes reproduction instructions, historical logs, regression checks, evidence provenance and checksums. The full 19-item search was not rerun or independently certified; the two solver implementations share enumeration and symmetry reductions. Licensing and code-provenance review remain unresolved. Version 1.0.1 corrects two ancillary documentation passages in README.md and EVIDENCE-MAP.md that retained an unnecessary nonadaptive hypothesis. The support archive checksum manifest is updated accordingly. The manuscript PDF, mathematical results, source code and computational evidence are unchanged from version 1.0.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-18
DOI
https://doi.org/10.5281/zenodo.24341706
Primary Topic
Complexity and Algorithms in Graphs
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Counting Reductions and Computational Evidence for Small Two-Stage Strict Group-Testing Instances

Steven Minh Phat Duong
Zenodo (CERN European Organization for Nuclear Research)
Complexity and Algorithms in Graphs
preprint

Counting Reductions and Computational Evidence for Small Two-Stage Strict Group-Testing Instances

Steven Minh Phat Duong
preprint en

Abstract

We study deterministic two-stage strict group testing with unrestricted overlapping pools and a threshold of two positive items. We present negative-set and antichain reductions, describe a computational candidate for the minimum of ten tests at 19 items, and give a complete counting implication for 28 and 29 items. The latter implication is explicitly conditional: if at most 18 items can be handled by nine tests in two stages, then both instances require eleven tests. The 19-item exhaustive-search results are reported from project records, not newly certified here. Positive-strategy witnesses, negative-search logs and mathematical reductions are distinguished. No claim of independently certified optimality or priority is made. The work is AI-assisted and has not received independent human mathematical review or peer review. The accompanying curated source archive includes reproduction instructions, historical logs, regression checks, evidence provenance and checksums. The full 19-item search was not rerun or independently certified; the two solver implementations share enumeration and symmetry reductions. Licensing and code-provenance review remain unresolved. Version 1.0.1 corrects two ancillary documentation passages in README.md and EVIDENCE-MAP.md that retained an unnecessary nonadaptive hypothesis. The support archive checksum manifest is updated accordingly. The manuscript PDF, mathematical results, source code and computational evidence are unchanged from version 1.0.

Zenodo (CERN European Organization for Nuclear Research)
Complexity and Algorithms in Graphs
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon