MétaCan
Menu
Back to cohort
Record W7106501654 · doi:10.1016/j.procs.2025.10.337

Cops and Robbers on Token Graphs

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

VenueProcedia Computer Science · 2025
Typearticle
Languageen
FieldComputer Science
TopicAdvanced Graph Theory Research
Canadian institutionsUniversity of VictoriaBritish Columbia Institute of Technology
FundersDirección General de Asuntos del Personal Académico, Universidad Nacional Autónoma de MéxicoUniversidad Nacional Autónoma de MéxicoConsejo Nacional de Ciencia y Tecnología
KeywordsGraphVertex (graph theory)Security tokenSet (abstract data type)Integer (computer science)

Abstract

fetched live from OpenAlex

Let G = (V, E) be a graph and k a positive integer such that k ≤ | V | . The k -token graph of G is the graph F k (G) having the set of all k -sets of V as vertex set, and such that two k -sets of V , say A and B , are adjacent if and only if the symmetric difference of A and B is an edge of G. In this work we study the cop number of token graphs of graphs in some classic families, such as paths, stars, and subdivided stars. We obtain the exact cop number for k -token graphs of paths and stars. We also obtain the exact cop number for subdivided stars when the number of branches is large enough. Probably more interesting than the aforementioned results, we introduce a variant of the Cops and Robbers game where R controls a team of robbers and C controls some teams of cops. A game of Cops and Robbers with this new variant played on a graph G is equivalent to a classic game of Cops and Robbers played on F k (G). This turns out to be very useful, as F k (G) is usually very large and complex when compared to G .

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.001
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: Theoretical or conceptual · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.823
Threshold uncertainty score0.623

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0010.003
Science and technology studies0.0010.001
Scholarly communication0.0000.001
Open science0.0020.001
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.011
GPT teacher head0.284
Teacher spread0.273 · 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