MétaCan
Menu
Cohort builder

4,299,418 works, Canadian by any of four routes.

Every filter state is a URL; the URL is the query; the query is citable via /q/⟨hash⟩. The page, the API and the export parse the same parameters.

The current cohort, streamed from the database: every work column, the machine labels, the provisional scores, and the per-row validation status. Exports are capped at 100,000 rows. Mints a permanent /q/ link for this exact query. The same filters always produce the same link, whoever asks.

Search term
Year range
Sort
Language
Type
Field
Venue
Topic
Advanced Database Systems and Queries
Retraction
Abstract
Evidence source
Study design
Label agreement
Label status

Direct Codex and Gemma labels are unvalidated and sparse. Distilled predictions cover the full frame and are also unvalidated. Choose the evidence source explicitly; absence of a direct label is never a negative label.

affaffiliation
fundfunder
venuejournal
aboutaboutness

The four routes compose: require the funder route and exclude affiliation to get the funder-only stratum no affiliation-based frame ever sees.

1,036 results · 1 filter active ·
Categories
Machine labels · sparse coverage
Evidence
An unlabeled work is unknown, not a negative. Label coverage is reported on every query.
1,036 works in the cohort · of 4,299,418page 2 of 21

Labels cover 2 of 1,036 works in this cohort. The rest are unlabeled, which is not a negative label: the label table is sparse today and grows as labeling rounds land.

Distilled predictions cover 1,036 of 1,036 works in this cohort. Predictions are machine_predicted_unvalidated teacher distillation outputs. Candidate is the union; consensus is the intersection.

affunlabeled
Indexing XML Data with ToXin.
2001· article· en· Computer Science
distilled prediction:candidate · noneconsensus · none
73
citations
affunlabeled
TPC-DI
2014· article· en· Proceedings of the VLDB Endowment· Computer Science
distilled prediction:candidate · noneconsensus · none
69
citations
affno abstractunlabeled
Expressive power of SQL
2003· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
68
citations
afffundunlabeled
Logics for Unranked Trees: An Overview
2006· article· en· Logical Methods in Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
67
citations
affunlabeled
The Lambda and the Kappa
2017· article· en· IEEE Internet Computing· Computer Science
distilled prediction:candidate · noneconsensus · none
66
citations
affunlabeled
OLAP dimension constraints
2002· article· en· Computer Science
distilled prediction:candidate · noneconsensus · none
63
citations
affno abstractunlabeled
Data Stream Management
2010· book· en· Synthesis lectures on data management· Computer Science
distilled prediction:candidate · metaepi_narrow+open_science+insufficient_payloadconsensus · open_science
59
citations
fundno affunlabeled
Normalization theory for XML
2006· article· en· ACM SIGMOD Record· Computer Science
distilled prediction:candidate · noneconsensus · none
50
citations
affno abstractunlabeled
LATIN 2010: Theoretical Informatics
2010· book· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
49
citations
affno abstractunlabeled
Finding and Analyzing Database User Sessions
2005· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
41
citations

How this was built: Screen · Findings · About