MétaCan
ENFR
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.

Export CSVExport JSONAPI query

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

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
affunlabeled
Subset selection of search heuristics
Chris Rayner, Nathan Sturtevant, Michael Bowling
2013· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
7
citations
affunlabeled
Mechanism Design for Online Resource Allocation
Xiaoqi Tan, Bo Sun, Alberto Leon‐Garcia, Yuan Wu, Danny H. K. Tsang
2020· article· en· Proceedings of the ACM on Measurement and Analysis of Computing Systems· Computer Science
machine prediction:candidate · noneconsensus · none
7
citations
affunlabeled
Distributed Selfish Load Balancing on Networks
Petra Berenbrink, Martin Hoefer, Thomas Sauerwald
2014· article· en· ACM Transactions on Algorithms· Computer Science
machine prediction:candidate · noneconsensus · none
7
citations
aboutno affno abstractunlabeled
The Canadian Traveller Problem Revisited
Yamming Huang, Chung-Shou Liao
2012· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
7
citations
affunlabeled
ONLINE COLORING CO-INTERVAL GRAPHS
H Zarabizadeh
2009· article· en· Scientia Iranica· 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
Improved analysis of the online set cover problem with advice
Stefan Dobrev, Jeff Edmonds, Dennis Komm, Rastislav Kráľovič, Richard Královič, Sacha Krug +1 more
2017· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
7
citations
affunlabeled
On the push&pull protocol for rumour spreading
Hüseyin Acan, Andrea Collevecchio, Abbas Mehrabian, Nick Wormald
2014· preprint· en· arXiv (Cornell University)· Computer Science
machine prediction:candidate · noneconsensus · none
7
citations
affunlabeled
Black Hole Search in Dynamic Rings
Giuseppe Antonio Di Luna, Paola Flocchini, Giuseppe Prencipe, Nicola Santoro
2021· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
6
citations
afffundno abstractunlabeled
Minimizing Latency of Capacitated k-Tours
Christopher S. Martin, Mohammad R. Salavatipour
2017· article· en· Algorithmica· Computer Science
machine prediction:candidate · noneconsensus · none
6
citations
affno abstractunlabeled
Online Interval Scheduling with Predictions
Joan Boyar, Lene M. Favrholdt, Shahin Kamali, Kim S. Larsen
2023· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
6
citations
afffundno abstractunlabeled
The quadratic balanced optimization problem
Abraham P. Punnen, Sara Taghipour, Daniel Karapetyan, Bishnu Bhattacharyya
2014· article· en· Discrete Optimization· Computer Science
machine prediction:candidate · noneconsensus · none
6
citations
affunlabeled
AmeriFlux CA-HPC Havikpak Creek
Oliver Sonnentag, P. Marsh
2021· dataset· en· OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information)· Computer Science
machine prediction:candidate · noneconsensus · none
6
citations
afffundno abstractunlabeled
Layered Working-Set Trees
Prosenjit Bose, Karim Douïeb, Vida Dujmović, John Howat
2011· article· en· Algorithmica· Computer Science
machine prediction:candidate · noneconsensus · none
6
citations
affno abstractunlabeled
Online Bin Covering with Advice
Joan Boyar, Lene M. Favrholdt, Shahin Kamali, Kim S. Larsen
2020· article· en· Algorithmica· Computer Science
machine prediction:candidate · noneconsensus · none
6
citations
affno abstractunlabeled
On asynchronous rendezvous in general graphs
Evangelos Bampas, Lélia Blin, Jurek Czyzowicz, David Ilcinkas, Arnaud Labourel, Maria Potop-Butucaru +1 more
2018· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
6
citations
affno abstractunlabeled
A Theoretical Analysis of Search in GSAT
Evgeny Skvortsov
2009· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
6
citations
affno abstractunlabeled
Parallel Job Scheduling: A Performance Perspective
Shikharesh Majumdar, Eric W. Parsons
2000· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
6
citations
affunlabeled
Competitive Routing on a Bounded-Degree Plane Spanner
Prosenjit Bose, Rolf Fagerberg, André van Renssen, Sander Verdonschot
2012· article· en· University of Southern Denmark Research Portal (University of Southern Denmark)· Computer Science
machine prediction:candidate · noneconsensus · none
6
citations
← previousnext →

How this was built: Screen · Findings · About