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
Graph Theory 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.

423 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.
423 works in the cohort · of 4,299,418page 1 of 9

Labels cover 2 of 423 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 423 of 423 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
K-core decomposition of large networks on a single PC
Wissam Khaouid, Marina Barsky, Venkatesh Srinivasan, Alex Thomo
2015· article· en· Proceedings of the VLDB Endowment· Computer Science
machine prediction:candidate · noneconsensus · none
214
citations
affunlabeled
Distance-join
Lei Zou, Lei Chen, M. TAMER ÖZSU
2009· article· en· Proceedings of the VLDB Endowment· Computer Science
machine prediction:candidate · noneconsensus · none
207
citations
affunlabeled
The future is big graphs
Sherif Sakr, Angela Bonifati, Hannes Voigt, Alexandru Iosup, Khaled Ammar, Renzo Angles +35 more
2021· article· en· Communications of the ACM· Computer Science
machine prediction:candidate · noneconsensus · none
152
citations
afffundno abstractunlabeled
Object Recognition as Many-to-Many Feature Matching
M. Fatih Demirci, Ali Shokoufandeh, Yakov Keselman, Lars Bretzner, Sven Dickinson
2006· article· en· International Journal of Computer Vision· Computer Science
machine prediction:candidate · noneconsensus · none
145
citations
affunlabeled
Giraph unchained
Minyang Han, Khuzaima Daudjee
2015· article· en· Proceedings of the VLDB Endowment· Computer Science
machine prediction:candidate · noneconsensus · none
145
citations
afffundunlabeled
Graphical Models and Point Pattern Matching
Tibério S. Caetano, Terry Caelli, Dale Schuurmans, Dante Augusto Couto Barone
2006· article· en· IEEE Transactions on Pattern Analysis and Machine Intelligence· Computer Science
machine prediction:candidate · noneconsensus · none
131
citations
affunlabeled
Graphflow
Chathura Kankanamge, Siddhartha Sahu, Amine Mhedbhi, Jeremy Chen, Semih Salihoğlu
2017· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
125
citations
afffundunlabeled
GraphBolt
Mugilan Mariappan, Keval Vora
2019· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
102
citations
affunlabeled
Peregrine
Kasra Jamshidi, Rakesh Mahadasa, Keval Vora
2020· preprint· en· Computer Science
machine prediction:candidate · insufficient_payloadconsensus · none
93
citations
aboutno affunlabeled
A Distributed Algorithm for Large-Scale Graph Partitioning
Fatemeh Rahimian, Amir H. Payberah, Šarūnas Girdzijauskas, Márk Jelasity, Seif Haridi
2015· article· en· ACM Transactions on Autonomous and Adaptive Systems· Computer Science
machine prediction:candidate · noneconsensus · none
43
citations
affno abstractunlabeled
Characterization of Graphs Using Degree Cores
John J. Healy, Jeannette Janssen, Evangelos Milios, William Aiello
2008· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
32
citations
affunlabeled
Compressing pattern databases
Ariel Felner, Ram Meshulam, Robert C. Holte, Richard E. Korf
2004· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
30
citations
aboutno affunlabeled
Mapp Dataset
Émilie Van Haute, Emilien Paulis
2016· dataset· en· Dépôt institutionnel de l'Université libre de Bruxelles (Université Libre de Bruxelles)· Computer Science
machine prediction:candidate · noneconsensus · none
30
citations
affunlabeled
Out-of-Core Edge Partitioning at Linear Run-Time
Ruben Mayer, Kamil Orujzade, Hans‐Arno Jacobsen
2022· article· en· 2022 IEEE 38th International Conference on Data Engineering (ICDE)· Computer Science
machine prediction:candidate · noneconsensus · none
30
citations
afffundunlabeled
Do We Need Specialized Graph Databases?
Anil Pacaci, Alice Zhou, Jimmy Lin, M. TAMER ÖZSU
2017· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
26
citations

How this was built: Screen · Findings · About