MétaCan
Menu
Back to cohort
Record W1855112105 · doi:10.4086/cjtcs.2011.004

[no title]

2011· article· en· W1855112105 on OpenAlex

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.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.
fundA Canadian funder is recorded on the work.

Bibliographic record

VenueChicago Journal of Theoretical Computer Science · 2011
Typearticle
Languageen
FieldComputer Science
TopicComputational Geometry and Mesh Generation
Canadian institutionsCarleton University
FundersNatural Sciences and Engineering Research Council of CanadaUniversity of SydneyAustralian GovernmentAustralian Research CouncilOntario Innovation Trust
KeywordsCombinatoricsCrossing number (knot theory)GraphMathematicsDiscrete mathematics

Abstract

fetched live from OpenAlex

A geometric graph G is an angle crossing (AC) graph if every pair of crossing edges in G cross at an angle of at least . The concept of right angle crossing (RAC) graphs ( = /2) was recently introduced by Didimo et al. It was shown that any RAC graph with n vertices has at most 4n -10 edges and that there are infinitely many values of n for which there exists a RAC graph with n vertices and 4n -10 edges. In this paper, we give upper and lower bounds for the number of edges in AC graphs for all 0 < < /2.

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 imitation

Not 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.

metaresearch head score (Codex)0.006
metaresearch head score (Gemma)0.001
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesScience and technology studies, Open science
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: Theoretical or conceptual
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.329
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0060.001
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0010.003
Science and technology studies0.0010.003
Scholarly communication0.0010.004
Open science0.0070.001
Research integrity0.0000.001
Insufficient payload (model declined to judge)0.0000.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.

Opus teacher head0.020
GPT teacher head0.246
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