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 7 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
Integrating Data from Maps on the World-Wide Web
Eliyahu Safra, Yaron Kanza, Yehoshua Sagiv, Yerach Doytsher
2006· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
15
citations
venueno affno abstractunlabeled
k-Geodomination in Graphs
Raluca Muntean, Ping Zhang
2002· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
14
citations
affno abstractunlabeled
Calibrated random imputation for qualitative data
Anne‐Catherine Favre, Alina Matei, Yves Tillé
2004· article· en· Journal of Statistical Planning and Inference· Computer Science
machine prediction:candidate · noneconsensus · none
14
citations
affunlabeled
Modeling location-based services with subject spaces
Hubert Ka Yau Leung, Ioana Burcea, Hans-Amo Jacobsen
2003· article· en· Conference of the Centre for Advanced Studies on Collaborative Research· Computer Science
machine prediction:candidate · noneconsensus · none
14
citations
affno abstractunlabeled
Taxonomy of space tessellation
Y.C Lee, Zhilin Li, Yiran Li
2000· article· en· ISPRS Journal of Photogrammetry and Remote Sensing· Computer Science
machine prediction:candidate · noneconsensus · none
14
citations
affno abstractunlabeled
The direction-constrained k nearest neighbor query
Min-Joong Lee, Dong-Wan Choi, Sangyeon Kim, Ha-Myung Park, Sunghee Choi, Chin‐Wan Chung
2016· article· en· GeoInformatica· Computer Science
machine prediction:candidate · noneconsensus · none
13
citations
affno abstractunlabeled
Topics in Spatial Stochastic Processes
Vincenzo Capasso, Ely Merzbach, B. Gail Ivanoff, Marco Dozzi, Robert C. Dalang, Thomas Mountford
2003· book· en· Lecture notes in mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
13
citations
affno abstractunlabeled
On Modeling and Querying Concept Evolution
Siarhei Bykau, John Mylopoulos, Flavio Rizzolo, Yannis Velegrakis
2012· article· en· Journal on Data Semantics· Computer Science
machine prediction:candidate · noneconsensus · none
12
citations
afffundunlabeled
Aspects of metric spaces in computation
Matthew Skala
2008· dissertation· en· UWSpace (University of Waterloo)· Computer Science
machine prediction:candidate · noneconsensus · none
12
citations
affunlabeled
Preferential Regular Path Queries
Gösta Grahne, Alex Thomo, William W. Wadge
2008· article· en· Fundamenta Informaticae· Computer Science
machine prediction:candidate · noneconsensus · none
12
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
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

How this was built: Screen · Findings · About