Bibliographic record
Abstract
You are watching the World Series and Matt Williams of the Diamondbacks is at bat. The count is 3 and 2, two out, and the bases are loaded. The phone rings and the ring indicates a long-distance call. Obviously, the caller is not watching the game. You answer the phone, only to find no one there. You curse and slam down the phone. Several seconds later, it hap-pens again. You repeat the process. This series of events occurs several more times until, out of frustration, you turn off the ringer and let all the calls go to voicemail. At work the next morning, your buddy says, “Where were you? I tried to call last night to make sure you were watching the game.” (If you are a Canadian, substitute Stanley Cup finals for World Series, Mats Sundin for Matt Williams, and Toronto Maple Leafs for Diamondbacks, etc. If you live anywhere else, sub-stitute World Cup, Reynaldo, etc.) The point is that the unknown caller was tying up your phone line and denying access to you. It got so bad you had to take your phone off-line. You can see that it is very difficult to protect against this type of attack, save going off-line. Well, you could take this story and create a simple analogy using your router. Someone starts flooding your router or network with dubious packets. The packets cause the system to crash or consume all avail-able resources. Your legitimate clients cannot get through or do anything. When someone hits your router with a denial-of-service attack, he or she holds up critical resources by block-ing the door to lawful business activity. A denial-of-service (DoS) attack is an attack against your network availability.
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.008 |
| Meta-epidemiology (narrow) | 0.002 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.002 | 0.000 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.003 | 0.004 |
| Open science | 0.002 | 0.003 |
| Research integrity | 0.001 | 0.002 |
| Insufficient payload (model declined to judge) | 0.017 | 0.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.
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".