MétaCan
Menu
Back to cohort
Record W4415525844 · doi:10.61091/jcmcc128-05

Backward edge-preserving maps between graphs

2025· article· W4415525844 on OpenAlexvenueno aff
Yur-Liubomysl Dekhtiar, Sergiy Kozerenko

Bibliographic record

VenueJournal of Combinatorial Mathematics and Combinatorial Computing · 2025
Typearticle
Language
FieldComputer Science
TopicAdvanced Graph Theory Research
Canadian institutionsnot available
Fundersnot available
KeywordsGraphIntersection graphVertex (graph theory)Line graphHomomorphismClass (philosophy)Graph homomorphismComparability graph

Abstract

fetched live from OpenAlex

We introduce and investigate a new class of graph maps, called backward edge-preserving maps. These are the maps between the vertex sets of graphs such that the pre-image of every edge in the target graph is an edge in the source graph. We give a complete structural characterization of such maps for both general and connected graphs. We also explore the relationship between backward edge-preserving maps, metric maps, and graph homomorphisms, and establish criteria for the intersection of these classes. Furthermore, we study a related class of graph cohomomorphisms and establish conditions under which a map can simultaneously be a homomorphism and a cohomomorphism.

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.009
metaresearch head score (Gemma)0.003
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesMeta-epidemiology (narrow), Science and technology studies, Scholarly communication, Research integrity
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.510
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0090.003
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0030.001
Bibliometrics0.0020.003
Science and technology studies0.0010.001
Scholarly communication0.0020.001
Open science0.0050.004
Research integrity0.0010.003
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.023
GPT teacher head0.303
Teacher spread0.280 · 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.

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

Citations0
Published2025
Admission routes1
Has abstractyes

Explore more

Same venueJournal of Combinatorial Mathematics and Combinatorial ComputingSame topicAdvanced Graph Theory ResearchFrench-language works237,207