MétaCan
Menu
Back to cohort
Record W2066877252 · doi:10.1002/net.20076

Reliable broadcasting in double loop networks

2005· article· en· W2066877252 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

VenueNetworks · 2005
Typearticle
Languageen
FieldComputer Science
TopicInterconnection Networks and Systems
Canadian institutionsSimon Fraser University
Fundersnot available
KeywordsComputer scienceBroadcasting (networking)Atomic broadcastConstruct (python library)Broadcast communication networkBroadcast domainComputer networkTree (set theory)InterconnectionDistributed computingTree networkLoop (graph theory)Port (circuit theory)Broadcast radiationMathematicsAlgorithmTime complexity

Abstract

fetched live from OpenAlex

Broadcast is the fundamental collective communication routine in which the same message is delivered from a single source to all the nodes in a network. The most efficient way to implement broadcast is through the construction of a broadcast tree. We introduce a revised definition of optimality for the i-port model broadcast tree based on fault-tolerance, and we construct optimal broadcast trees for interconnection networks modeled by Double Loop-Graphs for 1 ≤ i ≤ 4. © 2005 Wiley Periodicals, Inc. NETWORKS, Vol. 46(2), 88–97 2005

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.001
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: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.980
Threshold uncertainty score0.859

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.001
Science and technology studies0.0000.000
Scholarly communication0.0000.001
Open science0.0010.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.017
GPT teacher head0.237
Teacher spread0.220 · 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