Recommendation Admissibility for Finite Computational Benchmarks under Empirical-Resampling Variability and Aggregation-Design Uncertainty

Computational benchmarks may identify a point winner even when the represented evidence does not justify releasing a stronger recommendation. C7 is an executable protocol for deciding whether a bounded algorithm recommendation is admissible on a declared finite computational-benchmark evidence surface. It evaluates two distinct components separately: empirical-resampling variability under a frozen perturbation contract and aggregation-design uncertainty over a prespecified admissible design set. Complete-portfolio support and aggregation-design behavior are then combined through the A1–A5 release grammar, with mandatory evidence or authority failures handled by fail-closed gates. In the FJSP demonstration, V1 retains MWKR as the point recommendation but no candidate achieves complete support, yielding A3 — Sampling-inconclusive. In V2, ECT is point-recommended and supported at both required endpoints; under the additive/common-calibration geometry, that support extends across the declared segment, yielding A1 — Supported and aggregation-design-stable. These conclusions remain limited to the declared finite surfaces, matched portfolios, represented conditions, replication structures, and admissible aggregation-design domains; they do not establish universal solver superiority, future-instance inference, deployment validity, or certification.

Authors

Institutions

Publication Details

Journal
MethodsX
Published
2026-11-01
DOI
https://doi.org/10.1016/j.mex.2026.104238
Primary Topic
Scheduling and Optimization Algorithms
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Recommendation Admissibility for Finite Computational Benchmarks under Empirical-Resampling Variability and Aggregation-Design Uncertainty

Krisztián Attila Bakon
MethodsX
Scheduling and Optimization Algorithms
article

Recommendation Admissibility for Finite Computational Benchmarks under Empirical-Resampling Variability and Aggregation-Design Uncertainty

Krisztián Attila Bakon
article en

Abstract

Computational benchmarks may identify a point winner even when the represented evidence does not justify releasing a stronger recommendation. C7 is an executable protocol for deciding whether a bounded algorithm recommendation is admissible on a declared finite computational-benchmark evidence surface. It evaluates two distinct components separately: empirical-resampling variability under a frozen perturbation contract and aggregation-design uncertainty over a prespecified admissible design set. Complete-portfolio support and aggregation-design behavior are then combined through the A1–A5 release grammar, with mandatory evidence or authority failures handled by fail-closed gates. In the FJSP demonstration, V1 retains MWKR as the point recommendation but no candidate achieves complete support, yielding A3 — Sampling-inconclusive. In V2, ECT is point-recommended and supported at both required endpoints; under the additive/common-calibration geometry, that support extends across the declared segment, yielding A1 — Supported and aggregation-design-stable. These conclusions remain limited to the declared finite surfaces, matched portfolios, represented conditions, replication structures, and admissible aggregation-design domains; they do not establish universal solver superiority, future-instance inference, deployment validity, or certification.

MethodsX
University of Pannonia (HU)
Openalex Percentile: Top 13%
Scheduling and Optimization Algorithms
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
Recommendation Admissibility for Finite Computational Benchmarks under Empirical-Resampling Variability and Aggregation-Design Uncertainty — Krisztián Attila Bakon · MethodsX (2026) | TGRS Research Map | TGRS