MétaCan
Menu
Back to cohort
Record W4403821441 · doi:10.48550/arxiv.2410.00802

A practical guide to fitting correlation functions from lattice data

2024· preprint· en· W4403821441 on OpenAlexfundno aff
W. G. Parrott

Bibliographic record

VenuearXiv (Cornell University) · 2024
Typepreprint
Languageen
FieldComputer Science
TopicAdvanced Clustering Algorithms Research
Canadian institutionsnot available
FundersScience and Technology Facilities CouncilNatural Sciences and Engineering Research Council of Canada
KeywordsCorrelationStatistical physicsLattice (music)Computer scienceMathematicsPhysicsGeometry

Abstract

fetched live from OpenAlex

This guide contains a collection of the tips, tricks, and techniques that we have found to be useful when performing very large, correlated Bayesian fits of two, and three-point correlation functions for semileptonic decays, in this case $B\to K$ and $D\to K$. It is written explicitly with the use of gvar, lsqfit and corrfitter in mind, but many techniques are transferable to other fitting software, and other correlator fits. The guide is by no means comprehensive, and many problems can be approached from different angles and points of view. The intention here is simply to present ideas which may be useful to others.

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.003
metaresearch head score (Gemma)0.019
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: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.197
Threshold uncertainty score0.660

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0030.019
Meta-epidemiology (narrow)0.0020.002
Meta-epidemiology (broad)0.0020.001
Bibliometrics0.0030.004
Science and technology studies0.0010.001
Scholarly communication0.0030.003
Open science0.0040.002
Research integrity0.0020.005
Insufficient payload (model declined to judge)0.1970.165

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.203
GPT teacher head0.309
Teacher spread0.107 · 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

Citations0
Published2024
Admission routes1
Has abstractyes

Explore more

Same venuearXiv (Cornell University)Same topicAdvanced Clustering Algorithms ResearchFrench-language works237,207