MétaCan
ENFR
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.

Export CSVExport JSONAPI query

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
Author
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 ·
Results by year
20002025
Publication date
Categories
Machine labels · sparse coverage
Evidence
Language
Type
Citations
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. The Gemma side is a direct model label for every work (title-only); the Codex side is a distilled, calibrated classifier. Candidate is the union; consensus is the intersection.

affunlabeled
Indexing XML Data with ToXin.
Flavio Rizzolo, Alberto O. Mendelzon
2001· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
73
citations
affunlabeled
Answering tree pattern queries using views
Laks V. S. Lakshmanan, Hui Wang, Zheng Zhao
2006· article· en· Very Large Data Bases· Computer Science
machine prediction:candidate · noneconsensus · none
70
citations
affunlabeled
TPC-DI
Meikel Poess, Tilmann Rabl, Hans‐Arno Jacobsen, Brian Caufield
2014· article· en· Proceedings of the VLDB Endowment· Computer Science
machine prediction:candidate · noneconsensus · none
69
citations
affno abstractunlabeled
Expressive power of SQL
Leonid Libkin
2003· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
68
citations
afffundunlabeled
Logics for Unranked Trees: An Overview
Leonid Libkin
2006· article· en· Logical Methods in Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
67
citations
affunlabeled
The Lambda and the Kappa
Jimmy Lin
2017· article· en· IEEE Internet Computing· Computer Science
machine prediction:candidate · noneconsensus · none
66
citations
affunlabeled
Querying ATSQL databases with temporal logic
Jan Chomicki, David Toman, Michael H. Böhlen
2001· article· en· ACM Transactions on Database Systems· Computer Science
machine prediction:candidate · noneconsensus · none
66
citations
affno abstractunlabeled
Query processing techniques for arrays
A. Marathe, Kenneth Salem
2002· article· en· The VLDB Journal· Computer Science
machine prediction:candidate · noneconsensus · none
64
citations
affunlabeled
OLAP dimension constraints
Carlos Hurtado, Alberto O. Mendelzon
2002· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
63
citations
affunlabeled
Efficient incremental validation of XML documents
Denilson Barbosa, Alberto O. Mendelzon, Leonid Libkin, Laurent Mignet, Marcelo Arenas
2004· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
61
citations
affno abstractunlabeled
Data Stream Management
Lukasz Golab, M. Tamer �zsu
2010· book· en· Synthesis lectures on data management· Computer Science
machine prediction:candidate · noneconsensus · none
59
citations
affunlabeled
Using partial evaluation in distributed query evaluation
Peter Buneman, Gao Cong, Wenfei Fan, Anastasios Kementsietsidis
2006· article· en· Edinburgh Research Explorer (University of Edinburgh)· Computer Science
machine prediction:candidate · noneconsensus · none
57
citations
affunlabeled
Optimal top-down join enumeration
David DeHaan, Frank Wm. Tompa
2007· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
51
citations
fundno affunlabeled
Normalization theory for XML
Marcelo Arenas
2006· article· en· ACM SIGMOD Record· Computer Science
machine prediction:candidate · noneconsensus · none
50
citations
affno abstractunlabeled
LATIN 2010: Theoretical Informatics
2010· book· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
49
citations
affno abstractunlabeled
Scalar Aggregation in FD-Inconsistent Databases
Marcelo Arenas, Leopoldo Bertossi, Jan Chomicki
2001· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
47
citations
affunlabeled
Multi-query Stream Processing on FPGAs
Mohammad Sadoghi, Rija Javed, Naif Tarafdar, Harsh Vikram Singh, R. Palaniappan, Hans‐Arno Jacobsen
2012· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
47
citations
affunlabeled
Lenses, fibrations and universal translations
Michael Johnson, Robert Rosebrugh, Richard J. Wood
2011· article· en· Mathematical Structures in Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
43
citations
affno abstractunlabeled
A framework for testing DBMS features
Eric Lo, Carsten Binnig, Donald Kossmann, M. TAMER ÖZSU, Wing-Kai Hon
2009· article· en· The VLDB Journal· Computer Science
machine prediction:candidate · noneconsensus · none
41
citations
affno abstractunlabeled
Finding and Analyzing Database User Sessions
Qingsong Yao, Aijun An
2005· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
41
citations
affunlabeled
Temporal Logics over Unranked Trees
Pablo Barceló, Leonid Libkin
2006· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
41
citations
← previousnext →

How this was built: Screen · Findings · About