MétaCan
Menu
Back to cohort
Record W2180731253 · doi:10.4018/ijssci.2015010103

On the Incremental Union of Relations

2015· article· en· W2180731253 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

VenueInternational Journal of Software Science and Computational Intelligence · 2015
Typearticle
Languageen
FieldComputer Science
TopicCognitive Computing and Networks
Canadian institutionsOntario Brain Institute
Fundersnot available
KeywordsProperty (philosophy)Relation (database)Computer scienceAlgebraic numberAlgebra over a fieldSet (abstract data type)Semantics (computer science)Theoretical computer scienceRelational algebraMathematicsProgramming languageEpistemologyPure mathematicsRelational database

Abstract

fetched live from OpenAlex

Relations are one of the most important conceptual models and mathematical entities in logic, discrete mathematics, computer science, software science, system science, and formal semantics. However, some fundamental and indispensable operations on formal relations were overlooked in traditional studies. This paper presents an extended relation theory with a set of novel algebraic operators on relations beyond classic operations. The algebraic operators on formal relations known as the incremental union and decremental disunion are formally elaborated. The property of relational gains is mathematically modeled, which explains the dynamic mechanism of relations generated by associations of static sets of objects in physical or abstract systems.

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.002
metaresearch head score (Gemma)0.002
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: none
Teacher disagreement score0.897
Threshold uncertainty score0.247

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0020.002
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.001
Science and technology studies0.0000.000
Scholarly communication0.0000.001
Open science0.0010.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.044
GPT teacher head0.309
Teacher spread0.265 · 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