MétaCan
Menu
Back to cohort
Record W2041652386 · doi:10.1109/coginf.2007.4341936

Single-Scale Measures for Randomness and Complexity

2007· article· en· W2041652386 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

Venuenot available
Typearticle
Languageen
FieldBiochemistry, Genetics and Molecular Biology
TopicFractal and DNA sequence analysis
Canadian institutionsUniversity of Manitoba
Fundersnot available
KeywordsRandomnessKolmogorov complexityEntropy (arrow of time)ChaoticComputer scienceTheoretical computer scienceAffine transformationProbabilistic logicPseudorandom number generatorAlgorithmMathematicsSequence (biology)Artificial intelligenceStatistics

Abstract

fetched live from OpenAlex

This paper describes the use of single-scale measures to determine the level of randomness and complexity of a sequence. Such sequences originate from either various pseudorandom number generators or natural sources of white and coloured broadband noise. The paper provides a study of seven classes of sequences using the algorithmic complexity measures (the Kolmogorov-Chaitin complexity) and the probabilistic entropy-based measures (Shannon entropy). The study shows the fundamental differences between the two measures. The single-scale measures are adequate to determine the relative randomness and complexity of a sequence. However, they are not capable of revealing the hidden patterns in scale-invariant (self-affine) sequences. This paper identifies the need for new measures for such self-affine stochastic and chaotic sequences, and investigates if the existing techniques could be modified for the multiscale measures.

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.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Bench or experimental · Consensus signal: Bench or experimental
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.104
Threshold uncertainty score0.204

Codex and Gemma teacher scores by category

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

Quick stats

Citations5
Published2007
Admission routes1
Has abstractyes

Explore more

Same topicFractal and DNA sequence analysisFrench-language works237,207