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
Data Management and Algorithms
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,256 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,256 works in the cohort · of 4,299,418page 8 of 26

Labels cover 2 of 1,256 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,256 of 1,256 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.

affno abstractunlabeled
Iceberg Clique queries in large graphs
Fei Hao, Zheng Pei, Doo-Soon Park, Laurence T. Yang, Young‐Sik Jeong, Jong-Hyuk Park
2017· article· en· Neurocomputing· Computer Science
machine prediction:candidate · noneconsensus · none
11
citations
affno abstractunlabeled
Probabilistic k-Median Clustering in Data Streams
Christiane Lammersen, Melanie Schmidt, Christian Sohler
2014· article· en· Theory of Computing Systems· Computer Science
machine prediction:candidate · noneconsensus · none
11
citations
afffundunlabeled
Moving Target Search with Subgoal Graphs
Doron Nussbaum, Alper Yörükçü
2021· article· en· Proceedings of the International Symposium on Combinatorial Search· Computer Science
machine prediction:candidate · noneconsensus · none
11
citations
affunlabeled
A Knowledge-Based AI Framework for Mobility as a Service
Enayat Rajabi, Sławomir Nowaczyk, Sepideh Pashami, Magnus Bergquist, Geethu Susan Ebby, Summrina Kanwal
2023· article· en· Sustainability· Computer Science
machine prediction:candidate · noneconsensus · none
10
citations
affunlabeled
DISTIL
Maria Patrou, Md Mahbub Alam, Puya Memarzia, Suprio Ray, Virendra C. Bhavsar, Kenneth B. Kent +1 more
2018· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
10
citations
affno abstractunlabeled
A-ToPSS
Haifeng Liu, Hans‐Arno Jacobsen
2004· book-chapter· en· Elsevier eBooks· Computer Science
machine prediction:candidate · noneconsensus · none
10
citations
affno abstractunlabeled
A Compendium of Robust Data Structures
James P. Black, D. Taylor, D.E. Morgon
2005· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
10
citations
affno abstractunlabeled
Axes, ticks and grids
Martin Krzywinski
2013· article· en· Nature Methods· Computer Science
machine prediction:candidate · noneconsensus · none
10
citations
affno abstractunlabeled
Parsimonious cluster systems
François Brucker, Alain Gély
2009· article· en· Advances in Data Analysis and Classification· Computer Science
machine prediction:candidate · noneconsensus · none
10
citations
afffundno abstractunlabeled
Algorithms and Data Structures
Pat Morin, Subhash Suri
2023· book· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
10
citations
venueno affno abstractunlabeled
Variations of Distance-Based Invariants of Trees
Marcus Bartlett, Elliot Krop, Colton Magnant, Fedelis Mutiso, Hua Wang
2014· article· en· Journal of Combinatorial Mathematics and Combinatorial Computing· Computer Science
machine prediction:candidate · noneconsensus · none
9
citations
affunlabeled
Subhypergraphs in non-uniform random hypergraphs
Megan Dewar, John J. Healy, Xavier Pérez‐Giménez, Paweł Prałat, John Proos, Benjamin Reiniger +1 more
2018· article· en· Internet Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
9
citations

How this was built: Screen · Findings · About