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
Topic
Distributed systems and fault tolerance
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.

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

Labels cover 3 of 1,063 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 1,063 of 1,063 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
Process migration
Dejan Milojičić, Fred Douglis, Yves Paindaveine, Richard Wheeler, Songnian Zhou
2000· review· en· ACM Computing Surveys· Computer Science
machine prediction:candidate · noneconsensus · none
469
citations
fundno affunlabeled
Unbounded Transactional Memory
C. Scott Ananian, Krste Asanović, Bradley C. Kuszmaul, Charles E. Leiserson, Sean Lie
2005· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
440
citations
affunlabeled
X10
Philippe Charles, Christian Grothoff, Vijay Saraswat, Christopher Donawa, Allan Kielstra, Kemal Ebci̇oğlu +2 more
2005· article· en· ACM SIGPLAN Notices· Computer Science
machine prediction:candidate · noneconsensus · none
293
citations
affno abstractunlabeled
The computational power of population protocols
Dana Angluin, James Aspnes, David Eisenstat, Eric Ruppert
2007· article· en· Distributed Computing· Computer Science
machine prediction:candidate · noneconsensus · none
272
citations
affunlabeled
MIDDLE-R
Marta Patiño-Martı́nez, Bettina Kemme, Gustavo Alonso
2005· article· en· ACM Transactions on Computer Systems· Computer Science
machine prediction:candidate · noneconsensus · none
173
citations
affunlabeled
Unbounded Transactional Memory
C. Scott Ananian, Krste Asanović, Bradley C. Kuszmaul, Charles E. Leiserson, Sean Lie
2006· article· en· IEEE Micro· Computer Science
machine prediction:candidate · noneconsensus · none
158
citations
affunlabeled
Are quorums an alternative for data replication?
Marta Patiño-Martı́nez, Gustavo Alonso, Bettina Kemme
2003· article· en· ACM Transactions on Database Systems· Computer Science
machine prediction:candidate · noneconsensus · none
144
citations
afffundunlabeled
Lock-free linked lists and skip lists
Mikhail Fomitchev, Eric Ruppert
2004· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
144
citations
affunlabeled
A practical scalable distributed B-tree
Marcos K. Aguilera, Wojciech Golab, Mehul A. Shah
2008· article· en· Proceedings of the VLDB Endowment· Computer Science
machine prediction:candidate · noneconsensus · none
135
citations
affunlabeled
ERMIA
Kangnyeon Kim, Tianzheng Wang, Ryan Johnson, Ippokratis Pandis
2016· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
125
citations
affunlabeled
How to roll a join
Kenneth Salem, Kevin Beyer, Bruce G. Lindsay, Roberta Cochrane
2000· article· en· ACM SIGMOD Record· Computer Science
machine prediction:candidate · noneconsensus · none
91
citations
affunlabeled
Scalable leader election
Valerie King, Jared Saia, Vishal Sanwalani, Erik Vee
2006· article· en· Symposium on Discrete Algorithms· Computer Science
machine prediction:candidate · noneconsensus · none
83
citations
affunlabeled
Space-Optimal Majority in Population Protocols
Dan Alistarh, James Aspnes, Rati Gelashvili
2018· book-chapter· en· Society for Industrial and Applied Mathematics eBooks· Computer Science
machine prediction:candidate · noneconsensus · none
76
citations
affunlabeled
How do programmers use unsafe rust?
Vytautas Astrauskas, Christoph Matheja, Federico Poli, Péter Müller, Alexander J. Summers
2020· article· en· Proceedings of the ACM on Programming Languages· Computer Science
machine prediction:candidate · noneconsensus · none
75
citations
affunlabeled
Otherworld
Alex Depoutovitch, Michael Stumm
2010· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
75
citations
affno abstractunlabeled
Sense of direction in distributed computing
Paola Flocchini, Bernard Mans, Nicola Santoro
2002· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
63
citations
affno abstractunlabeled
Concurrency Control and Recovery
University Research Chair
2009· book-chapter· en· Encyclopedia of Database Systems· Computer Science
machine prediction:candidate · noneconsensus · none
61
citations
affunlabeled
The future is ours: prophecy variables in separation logic
Ralf Jung, Rodolphe Lepigre, G. Parthasarathy, Marianna Rapoport, Amin Timany, Derek Dreyer +1 more
2019· article· en· Proceedings of the ACM on Programming Languages· Computer Science
machine prediction:candidate · noneconsensus · none
60
citations
affunlabeled
Accordion
Marco Serafini, Essam Mansour, Ashraf Aboulnaga, Kenneth Salem, Taha Rafiq, Umar Farooq Minhas
2014· article· en· Proceedings of the VLDB Endowment· Computer Science
machine prediction:candidate · noneconsensus · none
58
citations
affno abstractunlabeled
Miner Collusion and the BitCoin Protocol
Alfred Lehar, Christine A. Parlour
2020· article· en· SSRN Electronic Journal· Computer Science
machine prediction:candidate · noneconsensus · none
57
citations
affunlabeled
Inductive data flow graphs
Azadeh Farzan, Zachary Kincaid, Andreas Podelski
2013· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
51
citations

How this was built: Screen · Findings · About