MétaCan
Menu
Back to cohort
Record W1547184395 · doi:10.14279/tuj.eceasst.29.421

Co-tabulations, Bicolimits and Van-Kampen Squares in Collagories

2024· article· en· W1547184395 on OpenAlexaff
Wolfram Kahl

Bibliographic record

VenueTechnische Universität Berlin – Universitätsbibliothek · 2024
Typearticle
Languageen
FieldComputer Science
TopicModel-Driven Software Engineering Techniques
Canadian institutionsMcMaster University
Fundersnot available
KeywordsMorphismCategorical variableGraphComputer scienceRelation (database)Transformation (genetics)Algebraic numberAlgebra over a fieldMathematicsPure mathematicsTheoretical computer scienceData miningChemistry

Abstract

fetched live from OpenAlex

We previously defined collagories essentially as “distributive allegories without zero morphisms”. Collagories are sufficient for accommodating the relation-algebraic approach to graph transformation, and closely correspond to the adhesive categories important for the categorical DPO approach to graph transformation. Heindel and Sobocinski have recently characterised the Van-Kampen colimits used in adhesive categories as bicolimits in span categories. In this paper, we study both bicolimits and lax colimits in collagories. We show that the relation-algebraic co-tabulation concept is equivalent to lax colimits of difunctional morphisms and to bipushouts, but much more concise and accessible. From this, we also obtain an interesting characterisation of Van-Kampen squares in collagories.

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.001
metaresearch head score (Gemma)0.002
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: Methods · Consensus signal: none
Teacher disagreement score0.004
Threshold uncertainty score0.013

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.002
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0020.001
Science and technology studies0.0010.003
Scholarly communication0.0020.003
Open science0.0000.003
Research integrity0.0000.001
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.244
Teacher spread0.235 · 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
GenreMethods

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

Citations1
Published2024
Admission routes1
Has abstractyes

Explore more

Same venueTechnische Universität Berlin – UniversitätsbibliothekSame topicModel-Driven Software Engineering TechniquesFrench-language works237,207