MétaCan
Menu
Back to cohort
Record W3193900015 · doi:10.1137/22m1511801

The Typical Approximate Structure of Sets with Bounded Sumset

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

VenueSIAM Journal on Discrete Mathematics · 2023
Typearticle
Languageen
FieldMathematics
TopicLimits and Structures in Graph Theory
Canadian institutionsUniversity of Waterloo
FundersEuropean Social FundAgencia Estatal de InvestigaciónConselho Nacional de Desenvolvimento Científico e TecnológicoMinisterio de Economía y CompetitividadNederlandse Organisatie voor Wetenschappelijk Onderzoek
KeywordsMathematicsAbelian groupHypergraphCombinatoricsBounded functionDiscrete mathematicsStructured program theorem

Abstract

fetched live from OpenAlex

Let and be randomly chosen subsets of the first positive integers of cardinalities , such that their sumset has size . We show that asymptotically almost surely and are almost fully contained in arithmetic progressions and with the same common difference and cardinalities approximately . We also prove a counting theorem for such pairs of sets in arbitrary abelian groups. The results hold for and . Our main tool is an asymmetric version of the method of hypergraph containers which was recently used by Campos to prove similar results in the special case .

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.001
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: Empirical
Teacher disagreement score0.014
Threshold uncertainty score0.618

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.001
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0010.000
Scholarly communication0.0000.000
Open science0.0010.000
Research integrity0.0000.001
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.025
GPT teacher head0.303
Teacher spread0.278 · 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