Loading...
Loading...
Contributors:
Dataset URI:
10.5281/zenodo.23007555Census reproduction materials accompanying Counterexamples to Aigner's majorization conjecture for star-forest search by Fedor Karpelevitch. The paper gives analytic counterexamples at every test budget from six onward. Those counterexamples require no computational evidence. This package supports the separate computer-assisted claim that the majorization condition is sufficient through five tests, establishing six as the first failure level. It contains the pinned C++ census source, build and provenance helpers, complete fresh execution records, small-control records and reproduction instructions. The full replay uses the same implementation as the original exhaustive computation; it is not independently implemented verification of a stand-alone certificate covering every partition. Quick mode checks only smaller levels and does not establish the five-test converse. This package is self-contained and does not require the finite-results paper's Pareto certificates, complete-graph refutations, solution trees or frontier-search logs. Manuscripts are distributed separately. Licensing: CC BY 4.0 applies to original evidence and documentation; MIT applies to original software. The archive specifies file-level license scope and retains applicable notices; these are not alternative licenses on every file. Funding: this research received no external funding.
Keyword(s):
combinatorial search; computer-assisted proof; exhaustive census; majorization; reproducibility.
Grants and Funding:
No Grants or Funding Data Available
Associated Publication(s):
No Associated Publication Data Available
Supplementary Data:
No Supplementary Data Available
Related Dataset(s):
No Related Dataset Data Available
The National Library of Medicine (NLM) provides information about biomedical datasets. Inclusion on an NLM Web page does not imply endorsement of, or agreement with, the contents by NLM or the National Institutes of Health. Learn more: NLM Web Policies (nih.gov)