MétaCan
Menu
Back to cohort
Record W2325643405 · doi:10.1142/s0129626416500055

On the Conditional Diagnosability of Hyper-Buttery Graphs and Related Networks

2016· article· en· W2325643405 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.

Bibliographic record

VenueParallel Processing Letters · 2016
Typearticle
Languageen
FieldComputer Science
TopicInterconnection Networks and Systems
Canadian institutionsBrock University
Fundersnot available
KeywordsHypercubeInterconnectionScheme (mathematics)Reliability (semiconductor)Measure (data warehouse)GraphComputer scienceMathematicsTheoretical computer scienceDiscrete mathematicsComputer networkData mining

Abstract

fetched live from OpenAlex

The conditional diagnosability is an important measure of reliability of interconnection networks. Much progress has been made in the past decade. By consolidating various results, a general scheme can be developed to solve the conditional diagnosability problem for many important classes of interconnection networks; thus eliminating various ad-hoc methods used in earlier studies. The buttery network is an important interconnection network and it has been rediscovered multiple times by different authors. The hyper-buttery network is a graph that amalgamates the buttery network and the hypercube. In this paper, we solve the conditional diagnosability problem for these hyper-buttery networks and their generalizations.

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 categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.576
Threshold uncertainty score0.249

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.012
GPT teacher head0.210
Teacher spread0.198 · 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