Bibliographic record
Abstract
Routing is the process of finding a path from a source node to a destination node. Since each node has a limited transmission range, the message is normally forwarded by other nodes in an ad hoc or sensor network. Therefore routes normally consist of several hops. Proposed routing schemes can be divided into topological and position based, depending on the availability of geographic location for nodes. Topological routing may be proactive or reactive. Position based routing consists of greedy approaches applied when a neighbor closer to the destination (than the node currently holding the packet) exists, and recovery schemes otherwise. In order to preserve bandwidth and power which are critical resources in ad hoc and sensor networks, localized approaches are proposed, where each node acts based solely on the location of itself, its neighbors, and the destination. There are various measures of optimality which lead to various schemes which optimize hop count, power, network lifetime, delay, or other metrics. A uniform solution based on ratio of cost and progress is described here
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 imitationNot 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.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.001 |
| Meta-epidemiology (narrow) | 0.002 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.002 | 0.006 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.004 | 0.004 |
| Open science | 0.002 | 0.002 |
| Research integrity | 0.002 | 0.002 |
| Insufficient payload (model declined to judge) | 0.030 | 0.034 |
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.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
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".