MétaCan
Menu
Back to cohort
Record W2066376202 · doi:10.1145/1923947.1923959

LLS

2010· article· en· W2066376202 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

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicAdvanced Database Systems and Queries
Canadian institutionsQueen's University
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsComputer scienceXMLPrefixScheme (mathematics)Search engine indexingInterval (graph theory)Tree (set theory)Set (abstract data type)Information retrievalData miningProgramming languageMathematicsWorld Wide WebCombinatorics

Abstract

fetched live from OpenAlex

Labeling nodes of XML trees to reflect the structure is useful for indexing and retrieving XML data. Current labeling schemes can be divided into two groups: interval labeling and prefix labeling schemes. In this paper we first discuss the advantages and disadvantages of the two groups. We then propose a novel labeling scheme, Level-based Labeling Scheme (LLS), which has the advantages of the two types of schemes while eliminating the main disadvantages. The LLS is based on the levels of the nodes in XML trees and the summary of an XML tree. We provide a set of experiments that indicate the performance benefits of our proposed scheme compared with interval labeling schemes using different mappings to relational tables to implement the indices.

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: Not applicable · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.981
Threshold uncertainty score0.282

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.0000.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.005
GPT teacher head0.223
Teacher spread0.218 · 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

Quick stats

Citations4
Published2010
Admission routes2
Has abstractyes

Explore more

Same topicAdvanced Database Systems and QueriesFrench-language works237,207