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 6 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
Shape Formation by Programmable Particles
Giuseppe Antonio Di Luna, Paola Flocchini, Nicola Santoro, Giovanni Viglietta, Yukiko Yamauchi
2017· preprint· en· arXiv (Cornell University)· Computer Science
machine prediction:candidate · noneconsensus · none
12
citations
afffundno abstractunlabeled
Online computation with untrusted advice
Spyros Angelopoulos, Christoph Dürr, Shendan Jin, Shahin Kamali, Marc Renault
2024· article· en· Journal of Computer and System Sciences· Computer Science
machine prediction:candidate · noneconsensus · none
12
citations
affno abstractunlabeled
Localization for a System of Colliding Robots
Jurek Czyzowicz, Evangelos Kranakis, Eduardo Pacheco
2013· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
12
citations
affno abstractunlabeled
A general framework for searching on a line
Prosenjit Bose, Jean-Lou De Carufel
2017· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
11
citations
affno abstractunlabeled
Pursuit Strategies for Autonomous Agents
Joshua A. Marshall, Zhiyun Lin, Mireille E. Broucke, Bruce A. Francis
2004· book-chapter· en· Lecture notes in control and information sciences· Computer Science
machine prediction:candidate · noneconsensus · none
11
citations
affno abstractunlabeled
Minimizing Cache Usage in Paging
Alejandro López-Ortíz, Alejandro Salinger
2013· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
11
citations
afffundunlabeled
Building a Nest by an Automaton
Jurek Czyzowicz, Dariusz Dereniowski, Andrzej Pelc
2020· article· en· Algorithmica· Computer Science
machine prediction:candidate · noneconsensus · none
11
citations
aboutno affno abstractunlabeled
Generalized Canadian traveller problems
Chung-Shou Liao, Yamming Huang
2013· article· en· Journal of Combinatorial Optimization· Computer Science
machine prediction:candidate · noneconsensus · none
11
citations
affno abstractunlabeled
Multi-target ray searching problems
Spyros Angelopoulos, Alejandro López-Ortíz, Κωνσταντίνος Παναγιώτου
2014· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
11
citations
affunlabeled
Boolean theory of coteries
Toshihide Ibaraki, Tsunehiko Kameda
2002· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
11
citations
affno abstractunlabeled
More efficient periodic traversal in anonymous undirected graphs
Jurek Czyzowicz, Stefan Dobrev, Leszek Gąsieniec, David Ilcinkas, Jesper Jansson, Ralf Klasing +4 more
2012· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
10
citations
affunlabeled
Gathering despite mischief
Yoann Dieudonné, Andrzej Pelc, David Peleg
2012· article· en· Symposium on Discrete Algorithms· Computer Science
machine prediction:candidate · noneconsensus · none
10
citations
affunlabeled
Maximal Independent Set via Mobile Agents
Debasish Pattanayak, Subhash Bhagat, Sruti Gan Chaudhuri, Anisur Rahaman Molla
2024· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
10
citations
affunlabeled
Symmetry Breaking in the Plane
Jurek Czyzowicz, Leszek Gąsieniec, Ryan Killick, Evangelos Kranakis
2019· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
10
citations
affunlabeled
Randomized rendezvous with limited memory
Evangelos Kranakis, Danny Kriz̧anc, Pat Morin
2011· article· en· ACM Transactions on Algorithms· Computer Science
machine prediction:candidate · noneconsensus · none
10
citations
affno abstractunlabeled
Competitive Online Routing on Delaunay Triangulations
Prosenjit Bose, Jean-Lou De Carufel, Stéphane Durocher, Perouz Taslakian
2014· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
10
citations
affunlabeled
The mortgage problem
Ran El‐Yaniv, Richard M. Karp
2002· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
10
citations
affunlabeled
Distributed dominating sets on grids
Elaheh Fata, Stephen L. Smith, Shreyas Sundaram
2013· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
10
citations
affno abstractunlabeled
Monotonicity of strong searching on digraphs
Boting Yang, Yi Cao
2007· article· en· Journal of Combinatorial Optimization· Computer Science
machine prediction:candidate · noneconsensus · none
10
citations
afffundno abstractunlabeled
Contraction obstructions for connected graph searching
Micah J. Best, Arvind Gupta, Dimitrios M. Thilikos, Dimitris Zoros
2015· article· en· Discrete Applied Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
10
citations
afffundno abstractunlabeled
Monotonicity in digraph search problems
Boting Yang, Yi Cao
2008· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
10
citations
affno abstractunlabeled
Priority algorithms for the subset-sum problem
Yuli Ye, Allan Borodin
2008· article· en· Journal of Combinatorial Optimization· Computer Science
machine prediction:candidate · noneconsensus · none
10
citations
afffundno abstractunlabeled
Three-fast-searchable graphs
Dariusz Dereniowski, Öznur Yaşar Diner, Danny Dyer
2013· article· en· Discrete Applied Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
9
citations
affunlabeled
Interruptible algorithms for multiproblem solving
Spyros Angelopoulos, Alejandro López-Ortíz
2009· article· en· HAL (Le Centre pour la Communication Scientifique Directe)· Computer Science
machine prediction:candidate · noneconsensus · none
9
citations

How this was built: Screen · Findings · About