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
Distributed Computing
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.

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

Labels cover 0 of 73 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 73 of 73 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
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
affno abstractunlabeled
Deterministic broadcasting in ad hoc radio networks
Bogdan S. Chlebus, Leszek Gąsieniec, Alan Gibbons, Andrzej Pelc, Wojciech Rytter
2002· article· en· Distributed Computing· Computer Science
machine prediction:candidate · noneconsensus · none
153
citations
afffundno abstractunlabeled
Distributed exploration of dynamic rings
Giuseppe Di Luna, Stefan Dobrev, Paola Flocchini, Nicola Santoro
2018· article· en· Distributed Computing· Computer Science
machine prediction:candidate · noneconsensus · none
34
citations
affno abstractunlabeled
Broadcasting in UDG radio networks with unknown topology
Yuval Emek, Leszek Gąsieniec, Erez Kantor, Andrzej Pelc, David Peleg, Chang Su
2008· article· en· Distributed Computing· Computer Science
machine prediction:candidate · noneconsensus · none
33
citations
affno abstractunlabeled
Randomized distributed decision
Pierre Fraigniaud, Mika Göös, Amos Korman, Merav Parter, David Peleg
2014· article· en· Distributed Computing· Computer Science
machine prediction:candidate · noneconsensus · none
26
citations
afffundno abstractunlabeled
Recoverable mutual exclusion
Wojciech Golab, Aditya Ramaraju
2019· article· en· Distributed Computing· Computer Science
machine prediction:candidate · noneconsensus · none
24
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
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
affno abstractunlabeled
Secure multi-party computation in large networks
Varsha Dani, Valerie King, Mahnush Movahedi, Jared Saia, Mahdi Zamani
2016· article· en· Distributed Computing· Computer Science
machine prediction:candidate · noneconsensus · none
19
citations
affno abstractunlabeled
Lower bound for scalable Byzantine Agreement
Dan Holtby, Bruce M. Kapron, Valerie King
2008· article· en· Distributed Computing· Computer Science
machine prediction:candidate · noneconsensus · none
17
citations
afffundno abstractunlabeled
Rendezvous in networks in spite of delay faults
Jérémie Chalopin, Yoann Dieudonné, Arnaud Labourel, Andrzej Pelc
2015· article· en· Distributed Computing· Computer Science
machine prediction:candidate · noneconsensus · none
14
citations
affno abstractunlabeled
Partial synchrony based on set timeliness
Marcos K. Aguilera, Carole Delporte-Gallet, Hugues Fauconnier, Sam Toueg
2012· article· en· Distributed Computing· Computer Science
machine prediction:candidate · noneconsensus · none
10
citations
affno abstractunlabeled
Byzantine agreement with homonyms
Carole Delporte-Gallet, Hugues Fauconnier, Rachid Guerraoui, Anne-Marie Kermarrec, Eric Ruppert, Hung Tran-The
2013· article· en· Distributed Computing· Computer Science
machine prediction:candidate · noneconsensus · none
9
citations
affno abstractunlabeled
Concurrent imitation dynamics in congestion games
Heiner Ackermann, Petra Berenbrink, Simon Fischer, Martin Hoefer
2014· article· en· Distributed Computing· Decision Sciences
machine prediction:candidate · noneconsensus · none
8
citations

How this was built: Screen · Findings · About