MétaCan
Menu
Back to cohort
Record W3214736048 · doi:10.31390/josa.2.4.03

Recursive and Viterbi Estimation for Semi-Markov Chains

2021· article· en· W3214736048 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.

fundA Canadian funder is recorded on the work.
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 Stochastic Analysis · 2021
Typearticle
Languageen
FieldEngineering
TopicFault Detection and Control Systems
Canadian institutionsnot available
FundersAustralian Research CouncilNatural Sciences and Engineering Research Council of Canada
KeywordsViterbi algorithmMarkov chainComputer scienceEstimationIterative Viterbi decodingMarkov modelSoft output Viterbi algorithmAlgorithmArtificial intelligenceHidden Markov modelMachine learningEconomicsDecoding methodsSequential decoding

Abstract

fetched live from OpenAlex

Recursive and Viterbi filters and smoothers are found for a semi-Markov chain observed in Gaussian noise. As is well known, the sojourn times of all states in first-order time-homogeneous Markov chain are necessarily geometrically distributed. A semi-Markov chain can have one, more than one, or all state sojourns distributed by general probability distributions. In this article the filters and smoothers presented are all exact, that is, they are not based upon any approximations to the semi-Markov chain dynamics.

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: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.957
Threshold uncertainty score0.283

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.005
GPT teacher head0.223
Teacher spread0.218 · 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