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 1 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
Deterministic Rendezvous in Graphs
Anders Dessmark, Pierre Fraigniaud, Dariusz R. Kowalski, Andrzej Pelc
2006· article· en· Algorithmica· Computer Science
machine prediction:candidate · noneconsensus · none
179
citations
affno abstractunlabeled
Graph exploration by a finite automaton
Pierre Fraigniaud, David Ilcinkas, Guy Peer, Andrzej Pelc, David Peleg
2005· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
176
citations
affno abstractunlabeled
Asynchronous deterministic rendezvous in graphs
Gianluca De Marco, Luisa Gargano, Evangelos Kranakis, Danny Kriz̧anc, Andrzej Pelc, Ugo Vaccaro
2006· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
162
citations
afffundunlabeled
Capture of an intruder by mobile agents
Lali Barrière, Paola Flocchini, Pierre Fraigniaud, Nicola Santoro
2002· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
158
citations
afffundno abstractunlabeled
Autonomous mobile robots with lights
Shantanu Das, Paola Flocchini, Giuseppe Prencipe, Nicola Santoro, Masafumi Yamashita
2015· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
145
citations
affno abstractunlabeled
Gathering few fat mobile robots in the plane
Jurek Czyzowicz, Leszek Gąsieniec, Andrzej Pelc
2008· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
141
citations
afffundunlabeled
Maximum Flow and Minimum-Cost Flow in Almost-Linear Time
Li Chen, Rasmus Kyng, Yang P. Liu, Richard Peng, Maximilian Probst Gutenberg, Sushant Sachdeva
2022· article· en· 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS)· Computer Science
machine prediction:candidate · noneconsensus · none
132
citations
affunlabeled
On Allocating Goods to Maximize Fairness
Deeparnab Chakrabarty, Julia Chuzhoy, Sanjeev Khanna
2009· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
122
citations
affno abstractunlabeled
Scheduling in the dark
Jeff Edmonds
2000· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
104
citations
afffundno abstractunlabeled
Distributed Computing by Oblivious Mobile Robots
Paola Flocchini, Giuseppe Prencipe, Nicola Santoro
2012· article· en· Synthesis lectures on distributed computing theory· Computer Science
machine prediction:candidate · noneconsensus · none
99
citations
affno abstractunlabeled
Mutual visibility by luminous robots without collisions
Giuseppe Antonio Di Luna, Paola Flocchini, Sruti Gan Chaudhuri, Federico Poloni, Nicola Santoro, Giovanni Viglietta
2016· article· en· Information and Computation· Computer Science
machine prediction:candidate · noneconsensus · none
95
citations
affno abstractunlabeled
Self-deployment of mobile sensors on a ring
Paola Flocchini, Giuseppe Prencipe, Nicola Santoro
2008· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
88
citations
affno abstractunlabeled
Map construction of unknown graphs by multiple agents
Shantanu Das, Paola Flocchini, Shay Kutten, Amiya Nayak, Nicola Santoro
2007· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
83
citations
afffundunlabeled
Gathering Despite Mischief
Yoann Dieudonné, Andrzej Pelc, David Peleg
2014· article· en· ACM Transactions on Algorithms· Computer Science
machine prediction:candidate · noneconsensus · none
74
citations
afffundno abstractunlabeled
The Mobile Agent Rendezvous Problem in the Ring
Evangelos Kranakis, Danny Kriz̧anc, Ευριπίδης Μάρκου
2010· article· en· Synthesis lectures on distributed computing theory· Computer Science
machine prediction:candidate · noneconsensus · none
72
citations
affno abstractunlabeled
Optimal graph exploration without good maps
Anders Dessmark, Andrzej Pelc
2004· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
66
citations

How this was built: Screen · Findings · About