Bibliographic record
Abstract
Autonomous System batching/cbd 40 Batching/constant batching delay batching/rbd 41 Batching/request-based delay BGP 15 Boarder Gateway Protocol CBT 15 Core-Based Trees CDN 3 Content Distribution Network cyclic/cd,l 55 Cyclic/constant delay, listeners cyclic/cd,bot 57 Cyclic/constant delay, bounded on-time cyclic/l 42 Cyclic/listeners cyclic/rbd,l 60 Cyclic/request-based delay, listeners cyclic/rbd,cot 61 Cyclic/request-based delay, controlled on-time cyclic/w2,l 48 Cyclic/wait for second, listeners DNS 6 Domain Name System DVMRP 15 Distance Vector Multicast Routing Protocol EWMA 130 Expected weighted moving average FCFS 23 First Come First Serve hlb 71 Heterogeneous lower bound IGMP 14 Internet Group Membership Protocol ISP 4 Internet Service Providers KBR 19 Key-based routing LTA 130 Long term average LWF 23 Longest Wait First MBGP 15 Multiprotocol Boarder Gateway Protocol MOSPF 15 Multicast Open Shortest Path First MRF 23 Most Request First MRFL 23 Most Request First Lowest MSDP 16 Multicast Source Discovery Protocol NRU 20 Normalized Resource Usage PIM-SM 15 Protocol Independent Multicast Sparse Mode RP 15 Rendezvous point sa 50 Shifted arrivals slp 46 Send as late as possible s-cyclic/l 73 Shared cyclic/listeners xii GlossaryBatching protocol A type of service aggregation protocol, in which clients having requested a file, wait to begin receiving the file until the beginning of a multicast (or broadcast) transmission, which collectively serves a set of waiting clients. BitTorrentA peer-assisted download protocol, in which a file is split into smaller pieces that can be downloaded in parallel from different peers. Bulk dataData or files for which there is no advantageous order in which data should be retrieved. Choke algorithmAlgorithm used, by BitTorrent, to determine which peers to upload (and not to upload) pieces of a file to. Client reception rateThe rate at which data is received by the client. Content Distribution Network (CDN)Interconnected servers distributed across the network, which allows the content to be effectively replicated, clients to be served by nearby replicas, and the content distributor to maintain control over the content. Continuous media filesMedia files, such as audio and video, that continuously must be rendered at specified rates. Cyclic multicast protocolA type of service aggregation protocol, in which the file data is cyclically transmitted on a multicast channel, which clients begin listening to at an arbitrary point in time, and continue listening to until all of the file data has been received. Digital fountainA cyclic multicast protocol, in which the file data is erasure coded such that a client listening to the channel can recreate the original content after having retrieved an arbitrary set of data equal (or slightly larger) in size as the original file. Download bandwidth capacityThe maximum sustainable rate at which data can be received by the client. Download protocolProtocol used to transfer bulk data to clients.The main metric of these protocols is the time until the entire file is fully downloaded. Erasure codingCoding technique used to accommodate packet losses.Leecher BitTorrent peer which does not have a complete copy of a file, and currently is downloading pieces of the file. 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.002 | 0.006 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.002 | 0.002 |
| Science and technology studies | 0.002 | 0.001 |
| Scholarly communication | 0.003 | 0.006 |
| Open science | 0.003 | 0.006 |
| Research integrity | 0.002 | 0.002 |
| Insufficient payload (model declined to judge) | 0.027 | 0.012 |
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".