MétaCan
Menu
Back to cohort
Record W4391127498 · doi:10.61091/ars157-10

On Vertex-Edge Resolvability for the Web Graph and Prism Related Graph

2023· article· en· W4391127498 on OpenAlexvenueno aff
Sunny Kumar Sharma, Vijay Kumar Bhat

Bibliographic record

VenueArs Combinatoria · 2023
Typearticle
Languageen
FieldComputer Science
TopicGraph Labeling and Dimension Problems
Canadian institutionsnot available
Fundersnot available
KeywordsMathematicsCombinatoricsVertex (graph theory)GraphNeighbourhood (mathematics)Discrete mathematicsMathematical analysis

Abstract

fetched live from OpenAlex

Let E ( H ) and V ( H ) denote the edge set and the vertex set of the simple connected graph H , respectively. The mixed metric dimension of the graph H is the graph invariant, which is the mixture of two important graph parameters, the edge metric dimension and the metric dimension. In this article, we compute the mixed metric dimension for the two families of the plane graphs viz., the Web graph W n and the Prism allied graph D t n . We show that the mixed metric dimension is non-constant unbounded for these two families of the plane graph. Moreover, for the Web graph W n and the Prism allied graph D t n , we unveil that the mixed metric basis set M m G is independent.

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.006
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: Empirical · Consensus signal: Empirical
Teacher disagreement score0.006
Threshold uncertainty score0.022

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.006
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0020.001
Science and technology studies0.0020.003
Scholarly communication0.0020.004
Open science0.0020.002
Research integrity0.0010.002
Insufficient payload (model declined to judge)0.0060.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.015
GPT teacher head0.237
Teacher spread0.222 · 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
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

Citations2
Published2023
Admission routes1
Has abstractyes

Explore more

Same venueArs CombinatoriaSame topicGraph Labeling and Dimension ProblemsFrench-language works237,207