MétaCan
Menu
Back to cohort
Record W2096780831 · doi:10.11575/prism/30667

CONTRASTING STACK-BASED AND RECENCY-BASED BACK BUTTONS ON WEB BROWSERS

2000· article· en· W2096780831 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.
fundA Canadian funder is recorded on the work.

Bibliographic record

VenuePRISM (University of Calgary) · 2000
Typearticle
Languageen
FieldComputer Science
TopicWeb Data Mining and Analysis
Canadian institutionsUniversity of Calgary
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsStack (abstract data type)Computer scienceWorld Wide WebInformation retrievalWeb pageArtificial intelligenceOperating system

Abstract

fetched live from OpenAlex

People frequently use the ubiquitous Back button found in most Web browsers to return to recently visited pages. Because all commercial browsers implement Back as a stack, previously visited branches of the tree are pruned; this means that people can quickly navigate back up the tree. The problem is that previously seen pages on alternate child branches are no longer reachable through Back. An alternate method is to implement Back on a recency model, where all visited pages are placed on a recency-ordered list with duplicates removed. This means that all previously seen pages are now available via Back. Because advantages and trade-offs exist in both methods, we performed a study that contrasted how people used stack vs recency-based Back. We found that people have a naïve mental model of how the conventional stack-based Back works, typically perceiving it as a recency list. People are also poor predictors of what pages will be displayed with both types of Back buttons. Finally, people seem evenly split over their preference of a stack vs recency-based Back button.

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.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Other design · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.982
Threshold uncertainty score0.533

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0010.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.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.011
GPT teacher head0.186
Teacher spread0.175 · 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