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
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 4 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
Interval Partitions and Polynomial Factorization
Joachim von zur Gathen, Daniel Panario, Bruce M. Richmond
2011· article· en· Algorithmica· Computer Science
machine prediction:candidate · noneconsensus · none
4
citations
afffundno abstractunlabeled
The Inverse Voronoi Problem in Graphs I: Hardness
Édouard Bonnet, Sergio Cabello, Bojan Mohar, Hebert Pérez‐Rosés
2020· article· en· Algorithmica· Computer Science
machine prediction:candidate · noneconsensus · none
4
citations
affno abstractunlabeled
Geometric Path Problems with Violations
Anil Maheshwari, Subhas C. Nandy, Drimit Pattanayak, Sasanka Roy, Michiel Smid
2016· article· en· Algorithmica· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations
afffundno abstractunlabeled
The Inverse Voronoi Problem in Graphs II: Trees
Édouard Bonnet, Sergio Cabello, Bojan Mohar, Hebert Pérez‐Rosés
2020· article· en· Algorithmica· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations
affno abstractunlabeled
Biased Predecessor Search
Prosenjit Bose, Rolf Fagerberg, John Howat, Pat Morin
2016· article· en· Algorithmica· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
affno abstractunlabeled
Biased Range Trees
Vida Dujmović, John Howat, Pat Morin
2010· article· en· Algorithmica· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
afffundno abstractunlabeled
Bounded-Angle Minimum Spanning Trees
Ahmad Biniaz, Prosenjit Bose, Anna Lubiw, Anil Maheshwari
2021· article· en· Algorithmica· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
afffundno abstractunlabeled
Approximations for Throughput Maximization
Dylan Hyatt-Denesik, Mirmahdi Rahgoshay, Mohammad R. Salavatipour
2024· article· en· Algorithmica· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affno abstractunlabeled
Circular Separability of Polygons
Jean‐Daniel Boissonnat, Jurek Czyzowicz, Olivier Devillers, Mariette Yvinec
2001· preprint· en· Algorithmica· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affno abstractunlabeled
Algorithms for Marketing-Mix Optimization
Joachim Gudmundsson, Pat Morin, Michiel Smid
2010· article· en· Algorithmica· Engineering
machine prediction:candidate · noneconsensus · none
1
citations
afffundunlabeled
Linear Search by a Pair of Distinct-Speed Robots
Evangelos Bampas, Jurek Czyzowicz, Leszek Gąsieniec, David Ilcinkas, Ralf Klasing, Tomasz Kociumaka +1 more
2018· article· en· Algorithmica· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
afffundunlabeled
The Complexity of Two Colouring Games
Stephan Dominique Andres, François Dross, Melissa A. Huggan, Fionn Mc Inerney, Richard J. Nowakowski
2022· article· en· Algorithmica· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations

How this was built: Screen · Findings · About