MétaCan
Menu
Back to cohort
Record W2498348315 · doi:10.3233/fun-2008-861-207

Involution Solid and Join codes

2008· article· en· W2498348315 on OpenAlexaff
Nataša Jonoska, Lila Kari, Kalpana Mahalingam

Bibliographic record

VenueFundamenta Informaticae · 2008
Typearticle
Languageen
FieldBiochemistry, Genetics and Molecular Biology
TopicDNA and Biological Computing
Canadian institutionsWestern University
Fundersnot available
KeywordsJoin (topology)Computer scienceInvolution (esoterism)Discrete mathematicsMathematicsCombinatoricsLaw

Abstract

fetched live from OpenAlex

In this paper we study a generalization of the classical notions of solid codes and commafree codes: involution solid codes (�-solid) and involution join codes (�-join). These notions are motivated by DNA strand design where Watson-Crick complementarity can be formalized as an antimorphic involution. We investigate closure properties of these codes, as well as necessary conditions for �-solid codes to be maximal. We show how the concept of �-join can be utilized such that codes that are not themselves �-comma free can be split into a union of subcodes that are �-comma free.

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.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: Bench or experimental · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.425
Threshold uncertainty score0.267

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.022
GPT teacher head0.251
Teacher spread0.229 · 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 teacher head, not a consensus.

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

Citations0
Published2008
Admission routes1
Has abstractyes

Explore more

Same venueFundamenta InformaticaeSame topicDNA and Biological ComputingFrench-language works237,207