MétaCan
Menu
Back to cohort
Record W2160085175 · doi:10.26493/1855-3974.170.fd8

Maximum independent sets of the 120-cell and other regular polytopes

2012· article· en· W2160085175 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

VenueArs Mathematica Contemporanea · 2012
Typearticle
Languageen
FieldEngineering
Topicgraph theory and CDMA systems
Canadian institutionsUniversity of Victoria
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsCombinatoricsMathematicsPolytopeAntipodal pointUpper and lower boundsGraphDodecahedronPairwise comparisonDiscrete mathematicsIndependent setOrder (exchange)Set (abstract data type)GeometryStatisticsComputer scienceMathematical analysis

Abstract

fetched live from OpenAlex

A d -code in a graph is a set of vertices such that all pairwise distances are at least d . As part of a study of d -codes of three-and four-dimensional regular polytopes, the maximum independent set order of the 120 -cell is calculated. A linear program based on counting arguments leads to an upper bound of 221 . An independent set of order 110 in the antipodal collapse of the 120 -cell (also known as the hemi- 120 -cell) gives a lower bound of 220 for the 120 -cell itself. The gap is closed by the computation described here, with the result that the maximum independent set order of the 120 -cell is 220 . All maximum d -code orders of the icosahedron, dodecahedron, 24 -cell, 600 -cell and 120 -cell are reported.

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: Bench or experimental · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.266
Threshold uncertainty score0.424

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.013
GPT teacher head0.199
Teacher spread0.186 · 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