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 10 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 teacher distillation outputs. Candidate is the union; consensus is the intersection.

fundno affunlabeled
An Eternal Domination Problem in Grids
William F. Klostermeyer, Margaret-Ellen Messinger, Alejandro Angeli Ayello
2017· article· en· Theory and Applications of Graphs· Computer Science
distilled prediction:candidate · noneconsensus · none
4
citations
afffundunlabeled
Evacuating an Equilateral Triangle in the Face-to-Face Model
Huda Chuangpishit, Saeed Mehrabi, Lata Narayanan, Jaroslav Opatrný
2018· article· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Computer Science
distilled prediction:candidate · noneconsensus · none
4
citations
affunlabeled
Energy Consumption of Group Search on a Line
Jurek Czyzowicz, Konstantinos Georgiou, Ryan Killick, Evangelos Kranakis, Danny Kriz̧anc, Manuel Lafond +3 more
2019· preprint· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
4
citations
affunlabeled
Almost Online Square Packing
Shahin Kamali, Alejandro López-Ortíz
2014· article· en· Canadian Conference on Computational Geometry· Computer Science
distilled prediction:candidate · noneconsensus · none
4
citations
affno abstractunlabeled
Multi-agent Search-Type Problems on Polygons
Konstantinos Georgiou, Caleb Jones, Jesse Lucier
2025· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
3
citations
affno abstractunlabeled
Deterministic Rendezvous with Detection Using Beeps
Samir Elouasbi, Andrzej Pelc
2015· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
3
citations
affunlabeled
How to Meet at a Node of Any Connected Graph
2022· article· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
3
citations
affno abstractunlabeled
Efficient Exploration of Faulty Trees
Ευριπίδης Μάρκου, Andrzej Pelc
2006· article· en· Theory of Computing Systems· Computer Science
distilled prediction:candidate · noneconsensus · none
3
citations
affno abstractunlabeled
Cache-Oblivious Comparison-Based Algorithms on Multisets
Arash Farzan, Paolo Ferragina, Gianni Franceschini, J. Ian Munro
2005· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
3
citations
affno abstractunlabeled
Know When to Persist: Deriving Value from a Stream Buffer
Konstantinos Georgiou, George Karakostas, Evangelos Kranakis, Danny Kriz̧anc
2016· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
3
citations
afffundno abstractunlabeled
Meeting in a polygon by anonymous oblivious robots
Giuseppe Antonio Di Luna, Paola Flocchini, Nicola Santoro, Giovanni Viglietta, Masafumi Yamashita
2019· article· en· Distributed Computing· Computer Science
distilled prediction:candidate · noneconsensus · none
3
citations
affunlabeled
Brief announcement
Alejandro López-Ortíz, Alejandro Salinger
2011· article· en· Computer Science
distilled prediction:candidate · noneconsensus · none
3
citations
affno abstractunlabeled
Dangerous Graphs
Ευριπίδης Μάρκου
2019· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
3
citations
affno abstractunlabeled
On the Relative Dominance of Paging Algorithms
Reza Dorrigiv, Alejandro López-Ortíz, J. Ian Munro
2007· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · noneconsensus · none
3
citations
affno abstractunlabeled
Searching Trees with Sources and Targets
Chris Worman, Boting Yang
2008· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
3
citations
afffundno abstractunlabeled
Edge searching weighted graphs
Öznur Yaşar, Danny Dyer, David A. Pike, Margo Kondratieva
2009· article· en· Discrete Applied Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
3
citations
affno abstractunlabeled
Fast Rendezvous with Advice
Avery Miller, Andrzej Pelc
2015· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
3
citations
affno abstractunlabeled
Linear Search for an Escaping Target with Unknown Speed
Jared Coleman, Dmitry Ivanov, Evangelos Kranakis, Danny Kriz̧anc, Oscar Morales-Ponce
2024· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrow+scholarly_communicationconsensus · none
3
citations
affno abstractunlabeled
Overcoming Probabilistic Faults in Disoriented Linear Search
Κωνσταντίνος Γεωργίου, Nikos Giachoudis, Evangelos Kranakis
2023· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
3
citations
affunlabeled
Optimal robot localization in trees
Rudolf Fleischer, Gerhard Trippen
2000· article· en· Computer Science
distilled prediction:candidate · insufficient_payloadconsensus · none
3
citations
affunlabeled
General bounds for incremental maximization
Aaron Bernstein, Yann Disser, Martin Groß
2020· preprint· en· Mathematical Programming· Computer Science
distilled prediction:candidate · scholarly_communicationconsensus · none
3
citations
affunlabeled
Graph exploration with robot swarms
Hui Wang, Michael Jenkin, Patrick Dymond
2009· article· en· International Journal of Intelligent Computing and Cybernetics· Computer Science
distilled prediction:candidate · noneconsensus · none
3
citations

How this was built: Screen · Findings · About