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
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 3 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
CoroBase
Yongjun He, Jiacheng Lu, Tianzheng Wang
2020· article· en· Proceedings of the VLDB Endowment· Computer Science
machine prediction:candidate · noneconsensus · none
25
citations
affunlabeled
Consensus and Mutual Exclusion in a Multiple Access Channel
Jurek Czyzowicz, Leszek Gąsieniec, Dariusz R. Kowalski, Andrzej Pec
2010· article· en· IEEE Transactions on Parallel and Distributed Systems· Computer Science
machine prediction:candidate · noneconsensus · none
25
citations
affunlabeled
Gossiping to reach consensus
Bogdan S. Chlebus, Dariusz R. Kowalski
2002· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
25
citations
affunlabeled
Ocean vista
Hua Fan, Wojciech Golab
2019· article· en· Proceedings of the VLDB Endowment· Computer Science
machine prediction:candidate · noneconsensus · none
24
citations
affunlabeled
The presumed-either two-phase commit protocol
Gopi K. Attaluri, Kenneth Salem
2002· article· en· IEEE Transactions on Knowledge and Data Engineering· Computer Science
machine prediction:candidate · noneconsensus · none
24
citations
afffundno abstractunlabeled
Recoverable mutual exclusion
Wojciech Golab, Aditya Ramaraju
2019· article· en· Distributed Computing· Computer Science
machine prediction:candidate · noneconsensus · none
24
citations
affunlabeled
Strongly linearizable implementations
Maryam Helmi, Lisa Highám, Philipp Woelfel
2012· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
24
citations
affunlabeled
Query fresh
Tianzheng Wang, Ryan Johnson, Ippokratis Pandis
2017· article· en· Proceedings of the VLDB Endowment· Computer Science
machine prediction:candidate · noneconsensus · none
23
citations
affunlabeled
NBR
Ajay Singh, Trevor Brown, Ali José Mashtizadeh
2021· article· en· Computer Science
machine prediction:candidate · insufficient_payloadconsensus · none
23
citations
afffundno abstractunlabeled
Tight Bounds for Adopt-Commit Objects
James Aspnes, Faith Ellen
2013· article· en· Theory of Computing Systems· Computer Science
machine prediction:candidate · noneconsensus · none
23
citations
affno abstractunlabeled
How much memory is needed for leader election
Emanuele G. Fusco, Andrzej Pelc
2011· article· en· Distributed Computing· Computer Science
machine prediction:candidate · noneconsensus · none
23
citations
affunlabeled
Eventually consistent
Wojciech Golab, Muntasir Rahman, Alvin AuYoung, Kimberly Keeton, Xiaozhou Li
2014· article· en· Communications of the ACM· Computer Science
machine prediction:candidate · noneconsensus · none
22
citations
affunlabeled
Feel Free to Interrupt
Sameh Attia, Vaughn Betz
2020· article· en· ACM Transactions on Reconfigurable Technology and Systems· Computer Science
machine prediction:candidate · noneconsensus · none
22
citations
affunlabeled
Canopus
Sajjad Rizvi, Bernard Wong, Srinivasan Keshav
2017· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
22
citations
affno abstractunlabeled
Adaptive security protocol selection for mobile computing
Bruno P. S. Rocha, Daniel N.O. Costa, Rande A. Moreira, Cristiano Rezende, Antônio A. F. Loureiro, Azzedine Boukerche
2010· article· en· Journal of Network and Computer Applications· Computer Science
machine prediction:candidate · noneconsensus · none
20
citations
affunlabeled
ConfluxDB
Prima Chairunnanda, Khuzaima Daudjee, M. TAMER ÖZSU
2014· article· en· Proceedings of the VLDB Endowment· Computer Science
machine prediction:candidate · noneconsensus · none
20
citations
affunlabeled
A modal separation logic for resource dynamics
Jean-René Courtault, Didier Galmiche
2015· article· en· Journal of Logic and Computation· Computer Science
machine prediction:candidate · noneconsensus · none
20
citations
affno abstractunlabeled
Secretive Birds: Privacy in Population Protocols
Carole Delporte-Gallet, Hugues Fauconnier, Rachid Guerraoui, Eric Ruppert
2008· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
20
citations
affunlabeled
Prosecutor
Gengrui Zhang, Hans‐Arno Jacobsen
2021· article· en· Computer Science
machine prediction:candidate · insufficient_payloadconsensus · none
19
citations
afffundno abstractunlabeled
The space complexity of unbounded timestamps
Faith Ellen, Panagiota Fatourou, Eric Ruppert
2008· article· en· Distributed Computing· Computer Science
machine prediction:candidate · noneconsensus · none
19
citations
← previousnext →

How this was built: Screen · Findings · About