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 9 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 teacher distillation outputs. Candidate is the union; consensus is the intersection.

afffundunlabeled
Consistency Oracles
Beom Heyn Kim, Sukwon Oh, David Lie
2017· article· en· Computer Science
distilled prediction:candidate · noneconsensus · none
5
citations
affunlabeled
Snap-Stabilizing Committee Coordination
Borzoo Bonakdarpour, Stéphane Devismes, Franck Petit
2011· preprint· en· Computer Science
distilled prediction:candidate · noneconsensus · none
5
citations
afffundunlabeled
Fast mutual exclusion by the Triangle algorithm
Wim H. Hesselink, Peter A. Buhr, David Dice
2017· article· en· Concurrency and Computation Practice and Experience· Computer Science
distilled prediction:candidate · sts+scholarly_communicationconsensus · none
5
citations
affno abstractunlabeled
Self-Stabilizing Balls and Bins in Batches
Petra Berenbrink, Tom Friedetzky, Peter Kling, Frederik Mallmann-Trenn, Lars Nagel, Chris Wastell
2018· article· en· Algorithmica· Computer Science
distilled prediction:candidate · noneconsensus · none
5
citations
affunlabeled
PNUTS to Sherpa
Brian F. Cooper, P. P. S. Narayan, Raghu Ramakrishnan, Utkarsh Srivastava, Adam Silberstein, Philip Bohannon +4 more
2019· article· en· Proceedings of the VLDB Endowment· Computer Science
distilled prediction:candidate · noneconsensus · none
5
citations
affunlabeled
TIE
Gowritharan Maheswara, Jeremy S. Bradbury, Christopher Collins
2010· article· en· Computer Science
distilled prediction:candidate · noneconsensus · none
5
citations
afffundunlabeled
Concurrent Data Structures
Faith Ellen, Trevor Brown
2016· article· en· Computer Science
distilled prediction:candidate · noneconsensus · none
5
citations
afffundno abstractunlabeled
Recoverable Mutual Exclusion
Sahil Dhoked, Wojciech Golab, Neeraj Mittal
2023· book· en· Synthesis lectures on distributed computing theory· Computer Science
distilled prediction:candidate · metaepi_narrow+insufficient_payloadconsensus · none
4
citations
affunlabeled
mTags
Augusto Born de Oliveira, Ahmad Saif Ur Rehman, Sebastian Fischmeister
2012· article· en· ACM SIGOPS Operating Systems Review· Computer Science
distilled prediction:candidate · insufficient_payloadconsensus · none
4
citations
affunlabeled
DProf: distributed profiler with strong guarantees
Zachary Benavides, Keval Vora, Rajiv Gupta
2019· article· en· Proceedings of the ACM on Programming Languages· Computer Science
distilled prediction:candidate · noneconsensus · none
4
citations
affno abstractunlabeled
Efficient Communication in Unknown Networks
Luisa Gargano, Andrzej Pelc, Stéphane Pérennès, Ugo Vaccaro
2000· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
4
citations
affvenueno abstractunlabeled
Spanning trees with bounded total excess
Hikoe Enomoto, Yukichika Ohnishi, Katsuhiro Ota
2011· article· en· Ars Combinatoria· Computer Science
distilled prediction:candidate · noneconsensus · none
4
citations
afffundunlabeled
Byzantine-Tolerant Set-Constrained Delivery Broadcast
2020· preprint· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Computer Science
distilled prediction:candidate · metaepi_narrow+scholarly_communicationconsensus · none
4
citations
← previousnext →

How this was built: Screen · Findings · About