MétaCan
Menu
Back to cohort
Record W2130741280 · doi:10.5539/cis.v1n1p69

Disruption Tolerant Networking

2008· article· en· W2130741280 on OpenAlexvenueno aff
Kevin Curran, James Knox

Bibliographic record

VenueComputer and Information Science · 2008
Typearticle
Languageen
FieldComputer Science
TopicOpportunistic and Delay-Tolerant Networks
Canadian institutionsnot available
Fundersnot available
KeywordsComputer scienceDelay-tolerant networkingPath (computing)Computer networkTelecommunicationsRouting (electronic design automation)Routing protocol

Abstract

fetched live from OpenAlex

Disruption Tolerant Networking (DTN) is a technology that will provide network services for environments so extreme that no end-to-end path exists through a network. Disruption Tolerant Networking hopes to tackle the problem of communicating in areas where due to various factors normal means of communication have limited success and are unreliable. DTN is aimed specifically at networks which are subject to frequent and long lasting disruptions that destroy or severely degrade normal communications. This paper provides an overview.

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.002
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: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.013
Threshold uncertainty score0.044

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.002
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0010.001
Science and technology studies0.0010.001
Scholarly communication0.0030.003
Open science0.0020.002
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0130.007

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.022
GPT teacher head0.230
Teacher spread0.208 · 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

Citations44
Published2008
Admission routes1
Has abstractyes

Explore more

Same venueComputer and Information ScienceSame topicOpportunistic and Delay-Tolerant NetworksFrench-language works237,207