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
Algorithmica
Topic
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.

232 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.
232 works in the cohort · of 4,299,418page 3 of 5

Labels cover 0 of 232 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 232 of 232 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
Choosing a Random Peer in Chord
Valerie King, Scott Lewis, Jared Saia, Maxwell Young
2007· article· en· Algorithmica· Computer Science
machine prediction:candidate · noneconsensus · none
13
citations
affno abstractunlabeled
Path Cover Problems with Length Cost
Kenya Kobayashi, Guohui Lin, Eiji Miyano, Toshiki Saitoh, Akira Suzuki, Tadatoshi Utashima +1 more
2023· article· en· Algorithmica· Computer Science
machine prediction:candidate · noneconsensus · none
12
citations
affno abstractunlabeled
Approximating Minimum-Cost Connected T-Joins
Joseph Cheriyan, Zachary Friggstad, Zhihan Gao
2013· article· en· Algorithmica· Computer Science
machine prediction:candidate · noneconsensus · none
12
citations
afffundunlabeled
Building a Nest by an Automaton
Jurek Czyzowicz, Dariusz Dereniowski, Andrzej Pelc
2020· article· en· Algorithmica· Computer Science
machine prediction:candidate · noneconsensus · none
11
citations
affno abstractunlabeled
Weak Coverage of a Rectangular Barrier
Stefan Dobrev, Evangelos Kranakis, Danny Kriz̧anc, Manuel Lafond, Ján Maňuch, Lata Narayanan +2 more
2019· article· en· Algorithmica· Computer Science
machine prediction:candidate · noneconsensus · none
11
citations
afffundno abstractunlabeled
Binary Pattern Tile Set Synthesis Is NP-Hard
Lila Kari, Steffen Kopecki, Pierre-Étienne Meunier, Matthew J. Patitz, Shinnosuke Seki
2016· article· en· Algorithmica· Biochemistry, Genetics and Molecular Biology
machine prediction:candidate · noneconsensus · none
9
citations
affno abstractunlabeled
Fast Algorithms for Approximating Distances
Sergei Bespamyatnikh, Michael Segal
2002· article· en· Algorithmica· Computer Science
machine prediction:candidate · noneconsensus · none
8
citations
afffundno abstractunlabeled
Algorithms for p-Faulty Search on a Half-Line
Anthony Bonato, Konstantinos Georgiou, Calum MacRury, Paweł Prałat
2022· article· en· Algorithmica· Computer Science
machine prediction:candidate · noneconsensus · none
7
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
Minimum Weight Convex Steiner Partitions
Adrian Dumitrescu, Csaba D. Tóth
2009· 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
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
Self-Stabilizing Balls and Bins in Batches
Petra Berenbrink, Tom Friedetzky, Peter Kling, Frederik Mallmann-Trenn, Lars Nagel, Chris Wastell
2018· article· en· Algorithmica· Computer Science
machine prediction:candidate · noneconsensus · none
5
citations
afffundno abstractunlabeled
Range Majorities and Minorities in Arrays
Djamal Belazzougui, Travis Gagie, J. Ian Munro, Gonzalo Navarro, Yakov Nekrich
2021· preprint· en· Algorithmica· Computer Science
machine prediction:candidate · noneconsensus · none
5
citations
affno abstractunlabeled
Precision, Local Search and Unimodal Functions
Martin Dietzfelbinger, Jonathan E. Rowe, Ingo Wegener, Philipp Woelfel
2009· article· en· Algorithmica· Computer Science
machine prediction:candidate · noneconsensus · none
5
citations
← previousnext →

How this was built: Screen · Findings · About