MétaCan
Menu
Back to cohort
Record W1984697505

Graph Colouring and the Probabilistic Method

2001· book· en· W1984697505 on OpenAlexaff
Bruce Reed

Bibliographic record

Venuenot available
Typebook
Languageen
FieldComputer Science
TopicModel-Driven Software Engineering Techniques
Canadian institutionsMcGill University
Fundersnot available
KeywordsProbabilistic logicComputer scienceGraphTheoretical computer scienceProbabilistic methodArtificial intelligence
DOInot available

Abstract

fetched live from OpenAlex

The term Probabilistic Method refers to the proof of deterministic statements using probabilistic tools. The method has been successfully applied to a number of problems in the field of graph colouring. We survey some of the results thereby obtained. The talk is intended to be accessible and short on details. We will first define graph colouring, explain the type of graph colouring problems which tend to attract interest. We then explain the probabilistic tools which are used to solve them, and why we would expect the type of tools that are used to be effective for solving the types of problems typically studied.

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.004
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: Theoretical or conceptual
GenreCandidate signal: Other · Consensus signal: none
Teacher disagreement score0.010
Threshold uncertainty score0.034

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.004
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0020.002
Science and technology studies0.0010.005
Scholarly communication0.0020.006
Open science0.0010.002
Research integrity0.0010.004
Insufficient payload (model declined to judge)0.0100.004

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.011
GPT teacher head0.235
Teacher spread0.224 · 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
GenreOther

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

Citations291
Published2001
Admission routes1
Has abstractyes

Explore more

Same topicModel-Driven Software Engineering TechniquesFrench-language works237,207