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
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 3 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
Information preserving XML schema embedding
Philip Bohannon, Wenfei Fan, Michael Flaster, P. P. S. Narayan
2005· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
39
citations
affunlabeled
Modeling transition
Gary Hall, Rajesh K. Gupta
2002· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
39
citations
affunlabeled
Expressiveness and complexity of order dependencies
Jaroslaw Szlichta, Parke Godfrey, Jarek Gryz, Calisto Zuzarte
2013· article· en· Proceedings of the VLDB Endowment· Computer Science
machine prediction:candidate · noneconsensus · none
38
citations
affno abstractunlabeled
InfoBot: Transfer and Exploration via the Information Bottleneck
Anirudh Goyal, Riashat Islam, Daniel Strouse, Zafarali Ahmed, Hugo Larochelle, Matthew Botvinick +2 more
2019· article· en· arXiv (Cornell University)· Computer Science
machine prediction:candidate · noneconsensus · none
35
citations
affunlabeled
AIDA
Joseph Vinish D'silva, Florestan De Moor, Bettina Kemme
2018· article· en· Proceedings of the VLDB Endowment· Computer Science
machine prediction:candidate · noneconsensus · none
33
citations
afffundunlabeled
Today's DBMSs: how autonomic are they
Said Elnaffar, Wendy Powley, D. Benoit, Patrick Martin
2004· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
32
citations
affno abstractunlabeled
Advanced Conceptual Modeling Techniques
Eric Yu, Masatoshi Yoshikawa
2003· book· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
32
citations
affunlabeled
Efficient index compression in DB2 LUW
Bishwaranjan Bhattacharjee, Lipyeow Lim, Timothy Malkemus, George A. Mihaila, Kenneth A. Ross, Sherman Lau +3 more
2009· article· en· Proceedings of the VLDB Endowment· Computer Science
machine prediction:candidate · noneconsensus · none
31
citations
affno abstractunlabeled
Fibrations and universal view updatability
Michael Johnson, Robert Rosebrugh
2007· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
30
citations
affno abstractunlabeled
Intermodeling, Queries, and Kleisli Categories
Zinovy Diskin, Tom Maibaum, Krzysztof Czarnecki
2012· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
30
citations
afffundunlabeled
Reordering rows for better compression
Daniel Lemire, Owen Kaser, Eduardo Gutarra
2012· article· en· ACM Transactions on Database Systems· Computer Science
machine prediction:candidate · noneconsensus · none
30
citations
affno abstractunlabeled
True Online TD(lambda)
Harm van Seijen, Rich Sutton
2014· article· en· International Conference on Machine Learning· Computer Science
machine prediction:candidate · noneconsensus · none
30
citations
affunlabeled
Covering indexes for branching path queries
Raghav Kaushik, Philip Bohannon, Jeffrey F. Naughton, Henry F. Korth
2002· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
28
citations
affunlabeled
MDL summarization with holes
Shaofeng Bu, Laks V. S. Lakshmanan, Raymond T. Ng
2005· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
28
citations
affunlabeled
X-warehouse
Ji Zhang, Wei Wang, Han Liu, Sheng Zhang
2005· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
28
citations
affno abstractunlabeled
Materialized View Selection in XML Databases
Nan Tang, Jeffrey Xu Yu, Hao Tang, M. TAMER ÖZSU, Peter Boncz
2009· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
27
citations
affno abstractunlabeled
A Semi-monad for Semi-structured Data (ICDT Version)
Mary Fernández, Jérǒme Simèon, Philip Wadler
2001· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
27
citations
affunlabeled
A normal form for XML documents
Marcelo Arenas, Leonid Libkin
2002· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
26
citations
affno abstractunlabeled
Regular path queries under approximate semantics
Gösta Grahne, Alex Thomo
2006· article· en· Annals of Mathematics and Artificial Intelligence· Computer Science
machine prediction:candidate · noneconsensus · none
26
citations
affno abstractunlabeled
Streaming multiple aggregations using phantoms
Rui Zhang, Nick Koudas, Beng Chin Ooi, Divesh Srivastava, Pu Zhou
2010· article· en· The VLDB Journal· Computer Science
machine prediction:candidate · noneconsensus · none
26
citations

How this was built: Screen · Findings · About