Taxonomy-Based Routing Indices for Peer-to-Peer Networks.
Bibliographic record
Abstract
On the one hand, the lack of structure of Peer-to-Peer (P2P) networks is key to their robustness and accessibility. On the other hand, this same lack of structure creates difficulties in efficiently searching the contents of the network. This search problem must be addressed for P2P networks to grow beyond the world of file sharing. To this end, we present a novel approach for describing the documents accessible through peers as a taxonomy. We propose a scoring function which is used to route queries within the network based on such taxonomical information, as well as the number of results desired by the query. The scoring function aims to minimize the number of network messages required to answer a query. When comparing to a sequential query forwarding algorithm, our simulations have shown that our proposed technique is able to reduce the number of messages generated for a query by a factor of 10. Also, our experiments show that limiting the “time to live ” of a query is likely to make queries more expensive. 1
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.003 | 0.018 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.003 | 0.005 |
| Science and technology studies | 0.002 | 0.001 |
| Scholarly communication | 0.003 | 0.007 |
| Open science | 0.003 | 0.002 |
| Research integrity | 0.002 | 0.002 |
| Insufficient payload (model declined to judge) | 0.004 | 0.002 |
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".