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 4 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
Tree exploration with little memory
Krzysztof Diks, Pierre Fraigniaud, Evangelos Kranakis, Andrzej Pelc
2002· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
24
citations
affno abstractunlabeled
A list heuristic for vertex cover
David Avis, Tomokazu Imamura
2006· article· en· Operations Research Letters· Computer Science
machine prediction:candidate · noneconsensus · none
24
citations
afffundunlabeled
Nonclairvoyant Speed Scaling for Flow and Energy
Ho-Leung Chan, Jeff Edmonds, Tak‐Wah Lam, Lap–Kei Lee, Alberto Marchetti-Spaccamela, Kirk Pruhs
2010· article· en· Algorithmica· Computer Science
machine prediction:candidate · noneconsensus · none
23
citations
affunlabeled
A maiden analysis of longest wait first
Jeff Edmonds, Kirk Pruhs
2005· article· en· ACM Transactions on Algorithms· Computer Science
machine prediction:candidate · noneconsensus · none
23
citations
affaboutunlabeled
Incremental) priority algorithms
Allan Borodin, Morten Nielsen, Charles Rackoff
2002· article· en· Symposium on Discrete Algorithms· Computer Science
machine prediction:candidate · noneconsensus · none
22
citations
affno abstractunlabeled
Online Algorithms for Caching Multimedia Streams
Matthew Andrews, Kamesh Munagala
2000· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
22
citations
affno abstractunlabeled
Evacuating two robots from multiple unknown exits in a circle
Jurek Czyzowicz, Stefan Dobrev, Konstantinos Georgiou, Evangelos Kranakis, Fraser MacQuarrie
2016· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
20
citations
affno abstractunlabeled
FIFO Queueing Policies for Packets with Heterogeneous Processing
Kirill Kogan, Alejandro López-Ortíz, Sergey Nikolenko, Alexander Sirotkin, Denis Tugaryov
2012· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
19
citations
affno abstractunlabeled
Decidability Classes for Mobile Agents Computing
Pierre Fraigniaud, Andrzej Pelc
2012· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
18
citations
afffundno abstractunlabeled
Priority evacuation from a disk: The case of n = 1,2,3
Jurek Czyzowicz, Konstantinos Georgiou, Ryan Killick, Evangelos Kranakis, Danny Kriz̧anc, Lata Narayanan +2 more
2019· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
18
citations
afffundunlabeled
TIME OPTIMAL ALGORITHMS FOR BLACK HOLE SEARCH IN RINGS
Balasingham Balamohan, Paola Flocchini, Ali Miri, Nicola Santoro
2011· article· en· Discrete Mathematics Algorithms and Applications· Computer Science
machine prediction:candidate · noneconsensus · none
18
citations
fundno affunlabeled
How to Meet Asynchronously at Polynomial Cost
Yoann Dieudonné, Andrzej Pelc, Vincent Villain
2013· preprint· en· arXiv (Cornell University)· Computer Science
machine prediction:candidate · noneconsensus · none
18
citations
affno abstractunlabeled
Synchronized Dancing of Oblivious Chameleons
Shantanu Das, Paola Flocchini, Giuseppe Prencipe, Nicola Santoro
2014· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
17
citations
afffundunlabeled
Dispatching Buses in a Depot Using Block Patterns
Mohamed Hamdouni, Guy Desaulniers, Odile Marcotte, François Soumis, Marianne van Putten
2006· article· en· Transportation Science· Computer Science
machine prediction:candidate · noneconsensus · none
17
citations
affno abstractunlabeled
Towards the price of leasing online
Sebastian Abshoff, Peter Kling, Christine Markarian, Friedhelm Meyer auf der Heide, Peter Pietrzyk
2015· article· en· Journal of Combinatorial Optimization· Computer Science
machine prediction:candidate · noneconsensus · none
17
citations
affunlabeled
Faster Algorithms for Semi-Matching Problems
Jittat Fakcharoenphol, Bundit Laekhanukit, Danupon Nanongkai
2014· article· en· ACM Transactions on Algorithms· Computer Science
machine prediction:candidate · noneconsensus · none
17
citations
← previousnext →

How this was built: Screen · Findings · About