MétaCan
Menu
Back to cohort
Record W1562525740 · doi:10.1002/rsa.10099

One line and n points

2003· article· en· W1562525740 on OpenAlexaff
Bernd Gärtner, Falk Tschirschnitz, Emo Welzl, József Solymosi, Pável Valtr

Bibliographic record

VenueRandom Structures and Algorithms · 2003
Typearticle
Languageen
FieldComputer Science
TopicComputational Geometry and Mesh Generation
Canadian institutionsUniversity of British Columbia
Fundersnot available
KeywordsComputer scienceLine (geometry)MathematicsGeometry

Abstract

fetched live from OpenAlex

Abstract We analyze a randomized pivoting process involving one line and n points in the plane. The process models the behavior of the R ANDOM ‐E DGE simplex algorithm on simple polytopes with n facets in dimension n − 2. We obtain a tight O (log 2 n ) bound for the expected number of pivot steps. This is the first nontrivial bound for R ANDOM ‐E DGE , which goes beyond bounds for specific polytopes. The process itself can be interpreted as a simple algorithm for certain 2‐variable linear programming problems, and we prove a tight Θ( n ) bound for its expected runtime. © 2003 Wiley Periodicals, Inc. Random Struct. Alg., 2003

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.

How this classification was reachedexpand

Full frame machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.006
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.010
Threshold uncertainty score0.034

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.006
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0010.001
Science and technology studies0.0010.002
Scholarly communication0.0010.002
Open science0.0010.002
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0100.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.

Opus teacher head0.013
GPT teacher head0.239
Teacher spread0.226 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designTheoretical or conceptual
Domainnot available
GenreEmpirical

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations14
Published2003
Admission routes1
Has abstractyes

Explore more

Same venueRandom Structures and AlgorithmsSame topicComputational Geometry and Mesh GenerationFrench-language works237,207