Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
QoS routing has been shown to be NP-hard. A recent study of its hardness suggests that the "worst-case" may not occur in practice, and thus there may exist a fast exact algorithm. We deploy the idea of iterative deepening search and look ahead to design an exact algorithm for finding the shortest path subject to multiple constraints (the MCSP problem). The accuracy of look-ahead information determines the efficiency of a search algorithm. The higher the accuracy of the look-ahead information, the more efficient the search process. An empirical study on a wide range of topologies shows the high accuracy of look-ahead information in the studied cases. Experimental results also show that our algorithm, IDA*/spl I.bar/MCSP, is fast and, in general, significantly outperforms A*Prune, an algorithm designed for the MCSP problem. The characteristics of iterative deepening search and the high accuracy of look-ahead information make IDA*/spl I.bar/MCSP a fast exact algorithm for the MCSP problem.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.001 | 0.002 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it