MétaCan
Menu
Back to cohort
Record W2024997033 · doi:10.1109/ccece.2008.4564655

Diffusion characters: Breaking the spectral barrier

2008· article· en· W2024997033 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.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.
fundA Canadian funder is recorded on the work.
venuePublished in a venue whose home country is Canada.

Bibliographic record

VenueConference proceedings - Canadian Conference on Electrical and Computer Engineering · 2008
Typearticle
Languageen
FieldPhysics and Astronomy
TopicComplex Network Analysis Techniques
Canadian institutionsUniversity of Guelph
FundersUniversity of Guelph
KeywordsEigenvalues and eigenvectorsEuclidean geometryCombinatoricsCharacter (mathematics)GraphMathematicsWheel graphAdjacency matrixEuclidean spaceLine graphDiscrete mathematicsGraph powerPhysicsGeometry

Abstract

fetched live from OpenAlex

Combinatorial graphs are used as mathematical models of a broad variety of phenomena including communications networks, gene regulation networks, food webs, or even to map out resource conflicts. The diffusion character matrix of a graph injects the vertices of a graph into Euclidean space so that Euclidean distances between vertices are closely tied to connectivity between those vertices in the graph. In this paper diffusion characters and their associated matrices are defined, elementary properties are derived, and it is demonstrated that diffusion character matrices contain information not contained in the eigenvalues of the graph. This latter property is demonstrated by computing the diffusion character matrices of two famous co-spectral graphs, two of the three (3,10)-cages, which are cubic graphs on 70 vertices.

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

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.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.013
GPT teacher head0.193
Teacher spread0.181 · 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