Bibliographic record
Abstract
SUMMARY Inspired by requirements traceability problems, we present a method for implementing fast and effective hypertext links to specific locations within documents. Thesesoft linksdo not depend on tags, markup, or closed tool sets, yet they can generally survive extensive edits to a document collection, allowing the targets of these links to be located in real collections after years of ongoing and frequent changes. We base our implementation of soft links on an existing passage retrieval algorithm, originally designed for question answering. The method treats the text surrounding the target of a soft link as a passage to be retrieved, creates a signature for that passage, and resolves the link by searching for the passage. The method is evaluated over a large collection of text and two large collections of source code, one written in theCprogramming language and one written in Java. Copyright © 2012 John Wiley & Sons, Ltd.
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.004 | 0.039 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.005 | 0.003 |
| Science and technology studies | 0.002 | 0.002 |
| Scholarly communication | 0.005 | 0.008 |
| Open science | 0.003 | 0.006 |
| Research integrity | 0.002 | 0.002 |
| Insufficient payload (model declined to judge) | 0.014 | 0.006 |
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".