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 9 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
Energy-Optimal Broadcast in a Tree with Mobile Agents
Jerzy Czyzowicz, Krzysztof Diks, Jean Moussi, Wojciech Rytter
2017· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
5
citations
affno abstractunlabeled
Advice Complexity of Priority Algorithms
Allan Borodin, Joan Boyar, Kim S. Larsen, Denis Pankratov
2019· article· en· Theory of Computing Systems· Computer Science
machine prediction:candidate · noneconsensus · none
5
citations
affno abstractunlabeled
Optimization Problems in Infrastructure Security
Evangelos Kranakis, Danny Kriz̧anc
2016· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
5
citations
affno abstractunlabeled
Restart Strategies: Analysis and Simulation
Huayue Wu, Peter van Beek
2003· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
5
citations
affunlabeled
Sharing the cost more efficiently
Luca Becchetti, Jochen Könemann, Stefano Leonardi, M. Páal
2007· article· en· ACM Transactions on Algorithms· Computer Science
machine prediction:candidate · noneconsensus · none
5
citations
afffundunlabeled
Asynchronous Gathering in a Dangerous Ring
Stefan Dobrev, Paola Flocchini, Giuseppe Prencipe, Nicola Santoro
2023· article· en· Algorithms· Computer Science
machine prediction:candidate · noneconsensus · none
5
citations
affno abstractunlabeled
Constrained Routing Between Non-Visible Vertices
Prosenjit Bose, Matias Korman, André van Renssen, Sander Verdonschot
2017· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
5
citations
affno abstractunlabeled
Input-Thrifty Extrema Testing
Kuan-Chieh Robert Tseng, David Kirkpatrick
2011· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
5
citations
afffundunlabeled
Distributed Dominating Sets on Grids
Elaheh Fata, Stephen L. Smith, Shreyas Sundaram
2013· preprint· en· arXiv (Cornell University)· Computer Science
machine prediction:candidate · noneconsensus · none
5
citations
affno abstractunlabeled
An Improved Algorithm for Online Unit Clustering
Hamid Zarrabi-Zadeh, Timothy M. Chan
2007· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
5
citations
affno abstractunlabeled
The Multi-source Beachcombers’ Problem
Jurek Czyzowicz, Leszek Gąsieniec, Konstantinos Georgiou, Evangelos Kranakis, Fraser MacQuarrie
2015· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
5
citations
affno abstractunlabeled
Patrolling
Jurek Czyzowicz, Kostantinos Georgiou, Evangelos Kranakis
2019· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
5
citations
afffundno abstractunlabeled
Optimal circle search despite the presence of faulty robots
Konstantinos Georgiou, Evangelos Kranakis, Nikos Leonardos, Aris Pagourtzis, Ioannis Papaioannou
2023· article· en· Information Processing Letters· Computer Science
machine prediction:candidate · noneconsensus · none
5
citations
affunlabeled
Fast Rendezvous with Advice
Avery Miller, Andrzej Pelc
2014· preprint· en· arXiv (Cornell University)· Computer Science
machine prediction:candidate · noneconsensus · none
5
citations
affno abstractunlabeled
Optimal Exploration of Terrains with Obstacles
Jurek Czyzowicz, David Ilcinkas, Arnaud Labourel, Andrzej Pelc
2010· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
4
citations
affunlabeled
LOWER BOUNDS FOR STREETS AND GENERALIZED STREETS
Alejandro López-Ortíz, Sven Schuierer
2001· article· en· International Journal of Computational Geometry & Applications· Computer Science
machine prediction:candidate · noneconsensus · none
4
citations
affunlabeled
Gathering over Meeting Nodes in Infinite Grid*
Subhash Bhagat, Abhinav Chakraborty, Bibhuti Das, Krishnendu Mukhopadhyaya
2022· article· en· Fundamenta Informaticae· Computer Science
machine prediction:candidate · noneconsensus · none
4
citations
afffundno abstractunlabeled
Searching for a non-adversarial, uncooperative agent on a cycle
Jurek Czyzowicz, Stefan Dobrev, Maxime Godon, Evangelos Kranakis, Toshinori Sakai, Jorge Urrutia
2019· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
4
citations

How this was built: Screen · Findings · About