MétaCan
Menu
Back to cohort
Record W4414210256 · doi:10.1145/3766904

Parsimonious Simplicial Intersection Algorithm

2025· article· en· W4414210256 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.

Bibliographic record

VenueACM Transactions on Mathematical Software · 2025
Typearticle
Languageen
FieldEngineering
TopicAdvanced Numerical Analysis Techniques
Canadian institutionsMcMaster University
Fundersnot available
KeywordsIntersection (aeronautics)Efficient algorithmTetrahedronCombinatorial algorithmsApproximation algorithmAlgorithm design

Abstract

fetched live from OpenAlex

Intersection algorithms are crucial in many applications, but they may not be robust. Without robustness, these algorithms may fail to correctly identify large intersections. To prevent that, this article develops a parsimonious algorithm for the intersection of simplices. This generalizes earlier algorithms on triangle and tetrahedral intersections. This article outlines the algorithm and its parsimony and proves its consistency. Numerical experiments confirm its applicability.

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.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Other design · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.992
Threshold uncertainty score0.679

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.000
Research integrity0.0000.000
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.008
GPT teacher head0.257
Teacher spread0.250 · 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