MétaCan
Menu
Back to cohort
Record W4386848811 · doi:10.1137/22m1534195

Extremal Bounds for 3-Neighbor Bootstrap Percolation in Dimensions Two and Three

2023· article· en· W4386848811 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

VenueSIAM Journal on Discrete Mathematics · 2023
Typearticle
Languageen
FieldMathematics
TopicStochastic processes and statistical mechanics
Canadian institutionsUniversity of Victoria
FundersNatural Sciences and Engineering Research Council of CanadaUniversity of Victoria
KeywordsCombinatoricsMathematicsVertex (graph theory)Cardinality (data modeling)Gridk-nearest neighbors algorithmGraphPercolation (cognitive psychology)Discrete mathematicsSet (abstract data type)Computer science

Abstract

fetched live from OpenAlex

For , the -neighbor bootstrap process in a graph starts with a set of infected vertices and, in each time step, every vertex with at least infected neighbors becomes infected. The initial infection percolates if every vertex of is eventually infected. We exactly determine the minimum cardinality of a set that percolates for the 3-neighbor bootstrap process when is a three-dimensional grid with minimum side-length at least 11. We also characterize the integers and for which there is a set of cardinality that percolates for the 3-neighbor bootstrap process in the grid; this solves a problem raised by Benevides et al. [HAL Research Report 03161419v4, 2021].

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.002
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: Theoretical or conceptual
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.687
Threshold uncertainty score0.789

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.002
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.108
GPT teacher head0.386
Teacher spread0.279 · 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