MétaCan
Menu
Back to cohort
Record W3189397579 · doi:10.1002/rsa.21117

Self‐avoiding walk on the hypercube

2022· article· en· W3189397579 on OpenAlexafffund
Gordon Slade

Bibliographic record

VenueRandom Structures and Algorithms · 2022
Typearticle
Languageen
FieldMathematics
TopicStochastic processes and statistical mechanics
Canadian institutionsUniversity of British Columbia
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsConstant (computer programming)HypercubeInteger (computer science)Mathematical proofMathematicsFunction (biology)Dimension (graph theory)CombinatoricsComputer scienceGeometry

Abstract

fetched live from OpenAlex

Abstract We study the number of ‐step self‐avoiding walks on the ‐dimensional hypercube, and identify an ‐dependentconnective constantand amplitude such that is for all and , and is asymptotically as long as for any fixed . We refer to the regime as thedilute phase. We discuss conjectures concerning different behaviors of when reaches and exceeds , corresponding to a critical window and a dense phase. In addition, we prove that the connective constant has an asymptotic expansion to all orders in , with integer coefficients, and we compute the first five coefficients . The proofs are based on generating function and Tauberian methods implemented via the lace expansion, for which an introductory account is provided.

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.002
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: Empirical · Consensus signal: Empirical
Teacher disagreement score0.004
Threshold uncertainty score0.012

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.002
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0010.001
Science and technology studies0.0010.001
Scholarly communication0.0010.001
Open science0.0010.001
Research integrity0.0010.000
Insufficient payload (model declined to judge)0.0040.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.032
GPT teacher head0.280
Teacher spread0.249 · 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
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

Citations4
Published2022
Admission routes2
Has abstractyes

Explore more

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