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 2 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
Parallelizing Feature Selection
Jerffeson Souza, Stan Matwin, Nathalie Japkowicz
2006· article· en· Algorithmica· Computer Science
machine prediction:candidate · noneconsensus · none
29
citations
affno abstractunlabeled
On Metric Clustering to Minimize the Sum of Radii
Matt Gibson, Gaurav Kanade, Erik Krohn, Imran A. Pirwani, Kasturi Varadarajan
2009· article· en· Algorithmica· Business, Management and Accounting
machine prediction:candidate · noneconsensus · none
26
citations
affno abstractunlabeled
Monotone Drawings of Graphs with Fixed Embedding
Patrizio Angelini, Walter Didimo, Stephen Kobourov, Tamara Mchedlidze, Vincenzo Roselli, Antonios Symvonis +1 more
2013· article· en· Algorithmica· Computer Science
machine prediction:candidate · noneconsensus · none
25
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
affno abstractunlabeled
Budget Management with Applications
Chen, Bozorgzadeh, Ankur Srivastava, Sarrafzadeh
2002· article· en· Algorithmica· Engineering
machine prediction:candidate · noneconsensus · none
23
citations
affno abstractunlabeled
Rapid Homology Search with Neighbor Seeds
Miklós Csürös, Bin Ma
2007· article· en· Algorithmica· Biochemistry, Genetics and Molecular Biology
machine prediction:candidate · noneconsensus · none
20
citations
affno abstractunlabeled
Practical and Efficient Circle Graph Recognition
Emeric Gioan, Christophe Paul, Marc Tedder, Derek G. Corneil
2013· article· en· Algorithmica· Computer Science
machine prediction:candidate · noneconsensus · none
20
citations
affno abstractunlabeled
Convergecast and Broadcast by Power-Aware Mobile Agents
J. Anaya, Jérémie Chalopin, Jurek Czyzowicz, Arnaud Labourel, Andrzej Pelc, Yann Vaxès
2014· article· en· Algorithmica· Computer Science
machine prediction:candidate · noneconsensus · none
16
citations
afffundunlabeled
Geometric Spanners for Weighted Point Sets
Mohammad Ali Abam, Mark de Berg, Mohammad Farshi, Joachim Gudmundsson, Michiel Smid
2010· article· en· Algorithmica· Computer Science
machine prediction:candidate · noneconsensus · none
16
citations
afffundno abstractunlabeled
On Minimum Sum of Radii and Diameters Clustering
Babak Behsaz, Mohammad R. Salavatipour
2014· article· en· Algorithmica· Business, Management and Accounting
machine prediction:candidate · noneconsensus · none
15
citations
affunlabeled
Algorithms and Complexity on Indexing Founder Graphs
Massimo Equi, Tuukka Norri, Jarno Alanko, Bastien Cazaux, Alexandru I. Tomescu, Veli Mäkinen
2022· article· en· Algorithmica· Computer Science
machine prediction:candidate · noneconsensus · none
14
citations
affno abstractunlabeled
Some Aperture-Angle Optimization Problems
Prosenjit Bose, F. Hurtado-Diaz, Elsa Omaña-Pulido, Jack Snoeyink, Godfried T. Toussaint
2002· article· en· Algorithmica· Computer Science
machine prediction:candidate · noneconsensus · none
14
citations
← previousnext →

How this was built: Screen · Findings · About