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

affunlabeled
Rendezvous of Two Robots with Constant Memory
Paola Flocchini, Nicola Santoro, Giovanni Viglietta, Masafumi Yamashita
2013· preprint· en· arXiv (Cornell University)· Computer Science
machine prediction:candidate · noneconsensus · none
9
citations
affno abstractunlabeled
On the Monotonicity of Weak Searching
Boting Yang, Yi Cao
2008· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
9
citations
affno abstractunlabeled
Distributed Security Algorithms by Mobile Agents
Paola Flocchini, Nicola Santoro
2006· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
9
citations
affno abstractunlabeled
A Randomized Algorithm for Online Unit Clustering
Timothy M. Chan, Hamid Zarrabi-Zadeh
2007· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
9
citations
affno abstractunlabeled
On the list update problem with advice
Joan Boyar, Shahin Kamali, Kim S. Larsen, Alejandro López-Ortíz
2016· article· en· Information and Computation· Computer Science
machine prediction:candidate · noneconsensus · none
8
citations
afffundno abstractunlabeled
Fast rendezvous with advice
Avery Miller, Andrzej Pelc
2015· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
8
citations
affno abstractunlabeled
Time Optimal Algorithms for Black Hole Search in Rings
Balasingham Balamohan, Paola Flocchini, Ali Miri, Nicola Santoro
2010· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
8
citations
affno abstractunlabeled
A General Framework for Searching on a Line
Prosenjit Bose, Jean-Lou De Carufel
2016· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
8
citations
affunlabeled
A maiden analysis of Longest Wait First
Jeff Edmonds, Kirk Pruhs
2004· article· en· Symposium on Discrete Algorithms· Computer Science
machine prediction:candidate · noneconsensus · none
8
citations
affno abstractunlabeled
Position Discovery for a System of Bouncing Robots
Jurek Czyzowicz, Leszek Gąsieniec, Adrian Kosowski, Evangelos Kranakis, Oscar Morales Ponce, Eduardo Pacheco
2012· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
8
citations
affunlabeled
Moving Agents in Formation in Congested Environments
Jiaoyang Li, Kexuan Sun, Hang Ma, Ariel Felner, T. K. Satish Kumar, Sven Koenig
2020· article· en· Proceedings of the International Symposium on Combinatorial Search· Computer Science
machine prediction:candidate · noneconsensus · none
8
citations
affno abstractunlabeled
Collision-free network exploration
Jurek Czyzowicz, Dariusz Dereniowski, Leszek Gąsieniec, Ralf Klasing, Adrian Kosowski, Dominik Pająk
2016· article· en· Journal of Computer and System Sciences· Computer Science
machine prediction:candidate · noneconsensus · none
8
citations
affno abstractunlabeled
Layered Working-Set Trees
Prosenjit Bose, Karim Douïeb, Vida Dujmović, John Howat
2010· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
8
citations
afffundno abstractunlabeled
Time constrained graph searching
Brian Alspach, Danny Dyer, Denis Hanson, Boting Yang
2008· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
8
citations
affno abstractunlabeled
Weighted Group Search on a Line
Konstantinos Georgiou, Jesse Lucier
2020· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
7
citations
affno abstractunlabeled
The robot cleans up
Margaret-Ellen Messinger, Richard J. Nowakowski
2009· article· en· Journal of Combinatorial Optimization· Computer Science
machine prediction:candidate · noneconsensus · none
7
citations
affno abstractunlabeled
Deterministic Rendezvous in Restricted Graphs
Ashley Farrugia, Leszek Gąsieniec, Łukasz Kuszner, Eduardo Pacheco
2015· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
7
citations
afffundunlabeled
Deterministic Rendezvous with Detection Using Beeps
Samir Elouasbi, Andrzej Pelc
2017· article· en· International Journal of Foundations of Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
7
citations

How this was built: Screen · Findings · About