MétaCan
Menu
Back to cohort
Record W2165253801 · doi:10.1145/1056808.1056978

An evaluation of landmarks for re-finding information on the web

2005· article· en· W2165253801 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldDecision Sciences
TopicPersonal Information Management and User Behavior
Canadian institutionsDalhousie University
Fundersnot available
KeywordsComputer scienceWeb pageWorld Wide WebTask (project management)Information retrievalStatic web pageWeb navigationWeb mining

Abstract

fetched live from OpenAlex

Re-finding information on the Web is a common yet often time consuming and challenging task. Even with the use of traditional bookmarks, which allow users to return to a previously visited page, it can be hard to re-find facts within that page. Furthermore, it is not uncommon for users to have long and unmanageable lists of bookmarks, making it difficult to identify the purpose of individual bookmarks. In this paper, we present an extension to traditional bookmarks called landmarks, a user-directed technique that aids users in returning to specific content within a previously visited web page. We investigate the efficiency of landmarks for re-finding information on web pages and present the findings of a study in which participants were first primed on two web pages and returned at a later date to re-find the information using both traditional bookmarks and landmarks.

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.

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.008
metaresearch head score (Gemma)0.001
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesInsufficient payload (model declined to judge)
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.828
Threshold uncertainty score0.999

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0080.001
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.002
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0020.000

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.

Opus teacher head0.509
GPT teacher head0.512
Teacher spread0.003 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it