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
Journal of the ACM
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.

79 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.
79 works in the cohort · of 4,299,418page 1 of 2

Labels cover 0 of 79 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 79 of 79 works in this cohort. Predictions are machine_predicted_unvalidated teacher distillation outputs. Candidate is the union; consensus is the intersection.

affunlabeled
Quantum lower bounds by polynomials
Robert Beals, Harry Buhrman, Richard Cleve, Michele Mosca, Ronald de Wolf
2001· article· en· Journal of the ACM· Computer Science
distilled prediction:candidate · noneconsensus · none
659
citations
affunlabeled
Interval arithmetic
Timothy J. Hickey, Qun Ju, M. H. van Emden
2001· article· en· Journal of the ACM· Computer Science
distilled prediction:candidate · noneconsensus · none
339
citations
affunlabeled
Adversarial queuing theory
Allan Borodin, Jon Kleinberg, Prabhakar Raghavan, Madhu Sudan, David P. Williamson
2001· article· en· Journal of the ACM· Business, Management and Accounting
distilled prediction:candidate · noneconsensus · none
274
citations
affunlabeled
Hierarchical Clustering
Vincent Cohen-Addad, Varun Kanade, Frederik Mallmann-Trenn, Claire Mathieu
2019· article· en· Journal of the ACM· Computer Science
distilled prediction:candidate · open_scienceconsensus · none
207
citations
afffundunlabeled
The measurement calculus
Vincent Danos, Elham Kashefi, Prakash Panangaden
2007· article· en· Journal of the ACM· Computer Science
distilled prediction:candidate · noneconsensus · none
192
citations
affunlabeled
Learning functions represented as multiplicity automata
Amos Beimel, Francesco Bergadano, Nader H. Bshouty, Eyal Kushilevitz, Stefano Varricchio
2000· article· en· Journal of the ACM· Computer Science
distilled prediction:candidate · noneconsensus · none
124
citations
affunlabeled
Empirical hardness models
Kevin Leyton‐Brown, Eugene Nudelman, Yoav Shoham
2009· article· en· Journal of the ACM· Decision Sciences
distilled prediction:candidate · noneconsensus · none
110
citations
affunlabeled
Online algorithms for market clearing
Avrim Blum, Tüomas Sandholm, Martin Zinkevich
2006· article· en· Journal of the ACM· Decision Sciences
distilled prediction:candidate · noneconsensus · none
82
citations
fundno affunlabeled
Attribute-Based Encryption for Circuits
S. Gorbunov, Vinod Vaikuntanathan, Hoeteck Wee
2015· article· en· Journal of the ACM· Computer Science
distilled prediction:candidate · noneconsensus · none
77
citations
affunlabeled
Logics with aggregate operators
Lauri Hella, Leonid Libkin, Juha Nurmonen, Limsoon Wong
2001· article· en· Journal of the ACM· Computer Science
distilled prediction:candidate · noneconsensus · none
74
citations
affunlabeled
QIP = PSPACE
Rahul Jain, Zhengfeng Ji, Sarvagya Upadhyay, John Watrous
2011· article· en· Journal of the ACM· Computer Science
distilled prediction:candidate · noneconsensus · none
62
citations
affunlabeled
Lower bounds for local approximation
Mika Göös, Juho Hirvonen, Jukka Suomela
2013· article· en· Journal of the ACM· Computer Science
distilled prediction:candidate · noneconsensus · none
46
citations
affunlabeled
Computing with highly mixed states
Andris Ambainis, Leonard J. Schulman, Umesh Vazirani
2006· article· en· Journal of the ACM· Computer Science
distilled prediction:candidate · noneconsensus · none
35
citations
afffundunlabeled
Approximating Markov Processes by Averaging
Philippe Chaput, Vincent Danos, Prakash Panangaden, Gordon Plotkin
2014· article· en· Journal of the ACM· Computer Science
distilled prediction:candidate · noneconsensus · none
32
citations
affunlabeled
On the Computability of Conditional Probability
Nathanael Ackerman, Cameron E. Freer, Daniel M. Roy
2019· article· en· Journal of the ACM· Computer Science
distilled prediction:candidate · open_scienceconsensus · none
32
citations
affunlabeled
Instance-Optimal Geometric Algorithms
Peyman Afshani, Jérémy Barbay, Timothy M. Chan
2017· article· en· Journal of the ACM· Computer Science
distilled prediction:candidate · noneconsensus · none
30
citations
affunlabeled
Distribution sort with randomized cycling
Jeffrey Scott Vitter, D. A. W. Hutchinson
2006· article· en· Journal of the ACM· Computer Science
distilled prediction:candidate · noneconsensus · none
22
citations
afffundunlabeled
Maximum Flow and Minimum-Cost Flow in Almost-Linear Time
Li Chen, Rasmus Kyng, Yang P. Liu, Richard Peng, Maximilian Probst Gutenberg, Sushant Sachdeva
2025· article· en· Journal of the ACM· Computer Science
distilled prediction:candidate · noneconsensus · none
16
citations
next →

How this was built: Screen · Findings · About