MétaCan
Menu
Back to cohort

A Quantum of Continuous Simulated Time

2016· article· en· W2535735789 on OpenAlexaff
Rhys Goldstein, Simon Breslav, Azam Khan

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldDecision Sciences
TopicSimulation Techniques and Applications
Canadian institutionsAutodesk (Canada)
Fundersnot available
KeywordsSimultaneityComputer scienceRepresentation (politics)Set (abstract data type)RoundingContext (archaeology)Property (philosophy)Event (particle physics)Discrete time and continuous timeTheoretical computer scienceAlgorithmMathematics

Abstract

fetched live from OpenAlex

In the context of discrete-event simulation, time resolution pertains to the time points at which events actually occur, whereas time precision constrains the time points at which events may possibly occur. Time precision is generally associated with the rounding of time values that takes place when a simulation is executed on a computer, yet here we study precision on a theoretical level. We find that while some models truly require a continuous representation of simulated time, a surprisingly diverse set of continuous-time models can be regarded as having an inherent level of time precision. We explore this concept by introducing the notion of an optimal time quantum, a simulation model property useful for establishing the set of durations which evenly divide all mathematically possible event times. A hierarchical method is presented for deriving the optimal time quantum from a model specification. The proposed theory complements past and ongoing research on simultaneity, time representation, and formal reasoning.

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 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 categoriesInsufficient payload (model declined to judge)
Consensus categoriesInsufficient payload (model declined to judge)
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.331
Threshold uncertainty score0.999

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.0000.000
Scholarly communication0.0000.000
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0060.002

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.080
GPT teacher head0.402
Teacher spread0.321 · 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; both teacher heads agree on what is shown here.

Study designTheoretical or conceptual
Domainnot available
GenreEmpirical

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

Citations3
Published2016
Admission routes1
Has abstractyes

Explore more

Same topicSimulation Techniques and ApplicationsFrench-language works237,207