MétaCan
Menu
Back to cohort
Record W1999938379 · doi:10.5539/jmr.v1n2p91

A Constant on a Uniform Bound of a Combinatorial Central Limit Theorem

2009· article· en· W1999938379 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.

venuePublished in a venue whose home country is Canada.
no affNo Canadian affiliation: this work is invisible to an affiliation-only frame.
No Canadian affiliation. An affiliation-only frame, the usual design, would never have seen this work. It is one of the works that make the case for inverting the frame.

Bibliographic record

VenueJournal of Mathematics Research · 2009
Typearticle
Languageen
FieldMathematics
TopicMathematical Approximation and Integration
Canadian institutionsnot available
Fundersnot available
KeywordsMathematicsCombinatoricsCentral limit theoremConstant (computer programming)Limit (mathematics)Integer (computer science)Permutation (music)Random permutationUpper and lower boundsDiscrete mathematicsMathematical analysisSymmetric groupStatistics

Abstract

fetched live from OpenAlex

Let n be a positive integer and Y(i, j), i, j = 1, ..., n, be random variables with finite fourth moments. Let ? be a randompermutation on {1, ..., n} which independent of Y(i, j)’s. In this paper, we use Stein’s method and the technique from(Laipaporn, K., 2008) to give a uniform bound in a combinatorial central limit theorem of W =n *i=1Y(i, ?(i)). For asufficient large n, we yield the rate27.72?n. This constant is better than the result in (Neammanee, K., 2005).Keywords: Uniform bound, Combinatorial central limit theorem, Stein’s method, Random permutation

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.005
metaresearch head score (Gemma)0.006
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.142
Threshold uncertainty score0.688

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0050.006
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0000.000
Science and technology studies0.0000.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.148
GPT teacher head0.422
Teacher spread0.273 · 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