MétaCan
Menu
Back to cohort
Record W3103428152 · doi:10.55016/ojs/cdm.v12i1.62551

The conjugacy problem for automorphism groups of homogeneous digraphs

2017· article· en· W3103428152 on OpenAlexvenueno aff
Samuel Coskey, P.J. Ellis

Bibliographic record

VenueContributions to Discrete Mathematics · 2017
Typearticle
Languageen
FieldMathematics
TopicFinite Group Theory Research
Canadian institutionsnot available
Fundersnot available
KeywordsMathematicsConjugacy classCombinatoricsAutomorphismHomogeneousAutomorphism groupConjugacy problemOuter automorphism groupDiscrete mathematics

Abstract

fetched live from OpenAlex

We decide the Borel complexity of the conjugacy problem for automorphism groups of countable homogeneous digraphs. Many of the homogeneous digraphs, as well as several other homogeneous structures, have already been addressed in previous articles. In this article we complete the program, and establish a dichotomy theorem that this complexity is either the minimum or the maximum among relations which are classifiable by countable structures. We also discuss the possibility of extending our results beyond graphs to more general classes of countable homogeneous structures.

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 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.003
metaresearch head score (Gemma)0.014
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesMetaresearch, Science and technology studies
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: Theoretical or conceptual
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.744
Threshold uncertainty score0.999

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0030.014
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0000.000
Science and technology studies0.0020.001
Scholarly communication0.0000.000
Open science0.0020.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.048
GPT teacher head0.385
Teacher spread0.337 · 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 teacher head, not a consensus.

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

Citations1
Published2017
Admission routes1
Has abstractyes

Explore more

Same venueContributions to Discrete MathematicsSame topicFinite Group Theory ResearchFrench-language works237,207