MétaCan
Menu
Back to cohort
Record W4416041048 · doi:10.61091/jcmcc128-13

k4-e supermagic labeling of triangular ladders

2025· article· W4416041048 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.

venuePublished in a venue whose home country is Canada.
no affNo Canadian affiliation: this work is invisible to an affiliation-only frame.
No Canadian affiliation. An affiliation-only frame, the usual design, would never have seen this work. It is one of the works that make the case for inverting the frame.

Bibliographic record

VenueJournal of Combinatorial Mathematics and Combinatorial Computing · 2025
Typearticle
Language
FieldComputer Science
TopicGraph Labeling and Dimension Problems
Canadian institutionsnot available
Fundersnot available
KeywordsBijectionVertex (graph theory)GraphSet (abstract data type)Integer (computer science)Edge-graceful labeling

Abstract

fetched live from OpenAlex

<p>A graph <span class="math inline">\(G=(V,E)\)</span> is <span class="math inline">\(H\)</span>-supermagic if there exists a bijection <span class="math inline">\(f\)</span> from the set <span class="math inline">\(V\cup E\)</span> to the set of integers <span class="math inline">\(\{1,2,3,\dots,|V|+|E|\}\)</span>, called <span class="math inline">\(H\)</span>-supermagic labeling such that the sum of labels of all elements of every induced subgraph of <span class="math inline">\(G\)</span> isomorphic to <span class="math inline">\(H\)</span> is equal to the same integer and all vertex labels are in <span class="math inline">\(\{1,2,3,\dots,|V|\}\)</span>. We present a <span class="math inline">\((K_4-e)\)</span>-supermagic labeling of the triangular ladder <span class="math inline">\(TL_{2n}\)</span> for any <span class="math inline">\(n\geq2\)</span>.</p>

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.006
metaresearch head score (Gemma)0.002
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesMeta-epidemiology (narrow)
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: Theoretical or conceptual
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.147
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0060.002
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0020.001
Bibliometrics0.0010.002
Science and technology studies0.0010.000
Scholarly communication0.0010.001
Open science0.0020.001
Research integrity0.0010.001
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.014
GPT teacher head0.256
Teacher spread0.242 · 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