MétaCan
Menu
Back to cohort
Record W2969214740 · doi:10.1002/rsa.21032

Finitary codings for gradient models and a new graphical representation for the six‐vertex model

2021· preprint· en· W2969214740 on OpenAlexaff
Gourab Ray, Yinon Spinka

Bibliographic record

VenueRandom Structures and Algorithms · 2021
Typepreprint
Languageen
FieldMathematics
TopicStochastic processes and statistical mechanics
Canadian institutionsUniversity of British ColumbiaUniversity of Victoria
Fundersnot available
KeywordsFinitaryIsing modelPotts modelVertex (graph theory)MathematicsRepresentation (politics)Statistical physicsCombinatoricsFunction (biology)Bounded functionPure mathematicsPhysicsMathematical analysisGraph

Abstract

fetched live from OpenAlex

Abstract It is known that the Ising model on at a given temperature is a finitary factor of an i.i.d. process if and only if the temperature is at least the critical temperature. Below the critical temperature, the plus and minus states of the Ising model are distinct and differ from one another by a global flip of the spins. We show that it is only this global information which poses an obstruction to being finitary by showing that the gradient of the Ising model is a finitary factor of i.i.d. at all temperatures. As a consequence, we deduce a volume‐order large deviation estimate for the energy. Results in the same spirit are shown for the Potts model, the so‐called beach model, and the six‐vertex model. We also introduce a coupling between the six‐vertex model with and a new Edwards–Sokal type graphical representation of it, which we believe is of independent interest.

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: Methods · Consensus signal: Methods
Teacher disagreement score0.006
Threshold uncertainty score0.019

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.004
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.001
Bibliometrics0.0010.001
Science and technology studies0.0000.002
Scholarly communication0.0020.002
Open science0.0010.001
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0060.001

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.111
GPT teacher head0.350
Teacher spread0.239 · 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
GenreMethods

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

Citations3
Published2021
Admission routes1
Has abstractyes

Explore more

Same venueRandom Structures and AlgorithmsSame topicStochastic processes and statistical mechanicsFrench-language works237,207