MétaCan
Menu
Back to cohort
Record W2149825906 · doi:10.1109/time.1998.674143

Towards a formal characterization of temporal repetition with closed time

2002· article· en· W2149825906 on OpenAlexaff
Diana Cukierman, James P. Delgrande

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicConstraint Satisfaction and Optimization
Canadian institutionsSimon Fraser University
Fundersnot available
KeywordsRepetition (rhetorical device)Computer scienceFormalism (music)Regular polygonTemporal logicTheoretical computer scienceAlgorithmArtificial intelligenceMathematicsLinguistics

Abstract

fetched live from OpenAlex

Proposes a novel approach to formally characterize temporal repetition. This differs from what has appeared so far in the AI/temporal reasoning literature, where time and particularly temporal repetition are represented within a linear structure. We propose to model temporal objects representing repetition with a closed time structure. Based on convex intervals and J.F. Allen's (1983) convex relations, we define a new temporal object: the time loop. Such an object captures in one cycle the core of what is repeated and which relations hold between each repetition. Hence, this formalism allows one, for example, to concisely represent the scheduling of regular meetings in a university, to specify calendars and to represent repetitive processes, such as those occurring in an assembly line.

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 machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.006
metaresearch head score (Gemma)0.010
Version: metacan-v3-hybrid-931329e0061cValidation 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: none
Teacher disagreement score0.006
Threshold uncertainty score0.032

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0060.010
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.003
Bibliometrics0.0020.003
Science and technology studies0.0020.010
Scholarly communication0.0040.017
Open science0.0040.005
Research integrity0.0020.006
Insufficient payload (model declined to judge)0.0040.001

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.009
GPT teacher head0.188
Teacher spread0.178 · 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; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
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

Citations10
Published2002
Admission routes1
Has abstractyes

Explore more

Same topicConstraint Satisfaction and OptimizationFrench-language works237,207