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
Optimization and Search Problems
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.

892 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.
892 works in the cohort · of 4,299,418page 2 of 18

Labels cover 0 of 892 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 892 of 892 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
Tree exploration with advice
Pierre Fraigniaud, David Ilcinkas, Andrzej Pelc
2008· article· en· Information and Computation· Computer Science
machine prediction:candidate · noneconsensus · none
63
citations
affunlabeled
Viral marketing meets social advertising
Çiğdem Aslay, Wei Lu, Francesco Bonchi, Amit Goyal, Laks V. S. Lakshmanan
2015· article· en· Proceedings of the VLDB Endowment· Computer Science
machine prediction:candidate · noneconsensus · none
62
citations
affunlabeled
Autonomous initialization of robot formations
Martin Lemay, François Michaud, Dominic Létourneau, Jean-Marc Valin
2004· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
60
citations
affno abstractunlabeled
The ultimate strategy to search on m rays?
Alejandro López-Ortíz, Sven Schuierer
2001· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
58
citations
affunlabeled
Tree exploration with logarithmic memory
Christoph Ambühl, Leszek Gąsieniec, Andrzej Pelc, Tomasz Radzik, Xiaohui Zhang
2011· article· en· ACM Transactions on Algorithms· Computer Science
machine prediction:candidate · noneconsensus · none
57
citations
affno abstractunlabeled
Communication algorithms with advice
Pierre Fraigniaud, David Ilcinkas, Andrzej Pelc
2009· article· en· Journal of Computer and System Sciences· Computer Science
machine prediction:candidate · noneconsensus · none
56
citations
affno abstractunlabeled
Fast radio broadcasting with advice
David Ilcinkas, Dariusz R. Kowalski, Andrzej Pelc
2010· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
53
citations
afffundunlabeled
UNIFORM SCATTERING OF AUTONOMOUS MOBILE ROBOTS IN A GRID
Lali Barrière, Paola Flocchini, Eduardo Mesa-Barrameda, Nicola Santoro
2011· article· en· International Journal of Foundations of Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
53
citations
affunlabeled
Black hole search in common interconnection networks
Stefan Dobrev, Paola Flocchini, Rastislav Kráľovič, Peter Růžička, Giuseppe Prencipe, Nicola Santoro
2005· article· en· Networks· Computer Science
machine prediction:candidate · noneconsensus · none
52
citations
afffundno abstractunlabeled
Rendezvous with constant memory
Paola Flocchini, Nicola Santoro, Giovanni Viglietta, Masafumi Yamashita
2016· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
51
citations
affunlabeled
Closing the Gap: Improved Bounds on Optimal POMDP Solutions
Pascal Poupart, Kee-Eung Kim, Dongho Kim
2011· article· en· Proceedings of the International Conference on Automated Planning and Scheduling· Computer Science
machine prediction:candidate · noneconsensus · none
50
citations
affunlabeled
ONLINE ROUTING IN CONVEX SUBDIVISIONS
Prosenjit Bose, Andrej Brodnik, Svante Carlsson, Erik D. Demaine, Rudolf Fleischer, Alejandro López-Ortíz +2 more
2002· article· en· International Journal of Computational Geometry & Applications· Computer Science
machine prediction:candidate · noneconsensus · none
47
citations
affunlabeled
Tree exploration with logarithmic memory
Leszek Gąsieniec, Andrzej Pelc, Tomasz Radzik, Xiaohui Zhang
2007· article· en· Symposium on Discrete Algorithms· Computer Science
machine prediction:candidate · noneconsensus · none
46
citations
affunlabeled
Computational Principles of Mobile Robotics
Gregory Dudek, Michael Jenkin
2024· book· en· Cambridge University Press eBooks· Computer Science
machine prediction:candidate · noneconsensus · none
45
citations
affno abstractunlabeled
Tell Me Where I Am So I Can Meet You Sooner
Andrew Collins, Jurek Czyzowicz, Leszek Gąsieniec, Arnaud Labourel
2010· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
44
citations
affno abstractunlabeled
Connected graph searching
Lali Barrière, Paola Flocchini, Fedor V. Fomin, Pierre Fraigniaud, Nicolas Nisse, Nicola Santoro +1 more
2012· article· en· Information and Computation· Computer Science
machine prediction:candidate · noneconsensus · none
44
citations
afffundno abstractunlabeled
Gathering in dynamic rings
Giuseppe Antonio Di Luna, Paola Flocchini, Linda Pagli, Giuseppe Prencipe, Nicola Santoro, Giovanni Viglietta
2018· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
41
citations
affno abstractunlabeled
Group Search and Evacuation
Jurek Czyzowicz, Kostantinos Georgiou, Evangelos Kranakis
2019· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
41
citations
affunlabeled
The Mutual Visibility Problem for Oblivious Robots
Giuseppe Antonio Di Luna, Paola Flocchini, Federico Poloni, Nicola Santoro, Giovanni Viglietta
2014· article· en· CINECA IRIS Institutial research information system (University of Pisa)· Computer Science
machine prediction:candidate · noneconsensus · none
41
citations
affno abstractunlabeled
How many oblivious robots can explore a line
Paola Flocchini, David Ilcinkas, Andrzej Pelc, Nicola Santoro
2011· article· en· Information Processing Letters· Computer Science
machine prediction:candidate · noneconsensus · none
40
citations
affunlabeled
Mobile Facility Location
Sergei Bespamyatnikh, Binay Bhattacharya, David Kirkpatrick, Michael Segal
2008· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
40
citations
affno abstractunlabeled
Anonymous Meeting in Networks
Yoann Dieudonné, Andrzej Pelc
2015· article· en· Algorithmica· Computer Science
machine prediction:candidate · noneconsensus · none
37
citations

How this was built: Screen · Findings · About