Computational aspects of disks enclosing many points
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
Let S be a set of n points in the plane. We present four different algorithms for finding a pair of points in S such that any disk that contains that pair must contain at least cn points of S , for some constant c > 0. The first is a randomized algorithm that finds a pair in O(n log n) expected time for points in general position and c = 1/2 − 1/√6 ≈ 1/10.9. The second algorithm, also for points in general position, takes O(n 2 ) time but the constant c is improved to 1/2 − 1/√12 ≈ 1/4.7. Using this algorithm and applying binary search, we find the pair that achieves the optimal c in O(n 2 log n ) time. The final algorithm finds in linear time a pair of points such that any disk through them contains at least n/3 of the points of S when S is in convex position. We also adapt these algorithms to find a pair of points of S in a polygon P such that any geodesic disk that contains that pair must contain at least cn points of S for some constant c > 0.
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.001 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.001 | 0.003 |
| 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.000 | 0.000 |
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