Optimistic Shortest Paths on Uncertain Terrains
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
Shortest path problems are a well-studied class of problems in theoretical computer science. One particularly applicable type of shortest path problem is to find the geodesic shortest path on a terrain. This type of algorithm finds the shortest path between two points that stays on the surface of a terrain. The most popular methods for finding such a shortest path involve a variant of Dijkstra’s algorithm and run in time approximately !$#&% in the size of the terrain [5, 4]. These algorithms for calculating shortest paths on a terrain require a precise input; any errors in measuring the terrain translate into errors in the output of the algorithms. What appears to be a shortest path according to the given input may turn out to be longer than an alternate path in reality. Uncertain terrains are a new model for acknowledging and dealing with these errors. In this paper, we consider one version of the shortest path problem on uncertain terrains: the optimistic shortest path. Essentially, we would like to find the path whose length is smallest over all paths and over all possible real terrains. This seems to be a slight generalization of the traditional geodesic shortest path problem. We show that it is, in fact, more akin to the problem of finding the shortest path in three dimensions that avoids polyhedral obstacles. This problem was shown to be NP-hard by Canny and Reif [3] in 1986. It is from their proof that our work is derived.
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.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.001 |
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