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 15 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.

affunlabeled
Brief Announcement: Fast Graphical Population Protocols
Dan Alistarh, Rati Gelashvili, Joel Rybicki
2021· article· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
1
citations
afffundunlabeled
A general technique for non-blocking trees
Trevor Brown, Faith Ellen, Eric Ruppert
2014· preprint· en· ACM SIGPLAN Notices· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
1
citations
afffundno abstractunlabeled
Discretionary capability confinement
2007· article· en· International Journal of Information Security· Computer Science
distilled prediction:candidate · noneconsensus · none
1
citations
affno abstractunlabeled
Transactional Memory
Nir Shavit, Alexander Matveev
2015· book-chapter· en· Encyclopedia of Algorithms· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
1
citations
affunlabeled
Stabilizing Consensus with the Power of Two Choices
Carola Doerr, Leslie Ann Goldberg, Lorenz Minder, Thomas Sauerwald, Christian Scheideler
2010· article· en· Dagstuhl Seminar Proceedings· Computer Science
distilled prediction:candidate · noneconsensus · none
1
citations
affunlabeled
As-if trust
Michael K. MacKenzie, Alfred Moore
2024· article· en· Critical Review of International Social and Political Philosophy· Computer Science
distilled prediction:candidate · noneconsensus · none
1
citations
affno abstractunlabeled
Event Stream Processing with Multiple Threads
Sylvain Hallé, Raphaël Khoury, Sébastien Gaboury
2017· preprint· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrow+scholarly_communication+open_scienceconsensus · none
1
citations
affunlabeled
A Lock-free Binary Trie
Jeremy Ko
2024· article· en· Computer Science
distilled prediction:candidate · noneconsensus · none
1
citations
afffundunlabeled
POSTER
Maya Arbel-Raviv, Trevor Brown
2017· article· en· ACM SIGPLAN Notices· Computer Science
distilled prediction:candidate · noneconsensus · none
1
citations
afffundunlabeled
An Almost Tight RMR Lower Bound for Abortable Test-And-Set
Aryaz Eghbali, Philipp Woelfel
2018· preprint· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Computer Science
distilled prediction:candidate · metaepi_narrow+scholarly_communicationconsensus · none
1
citations
afffundno abstractunlabeled
Life beyond set agreement
David Chan, Vassos Hadzilacos, Sam Toueg
2020· article· en· Distributed Computing· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
1
citations
affunlabeled
An Extended Concurrency Control Service for CORBA
Nima Sharifimehr, Samira Sadaoui
2008· article· en· Proceedings - Australian Software Engineering Conference/Proceedings· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
1
citations
affno abstractunlabeled
The Fence Complexity of Persistent Sets
Gaetano Coccimiglio, Trevor Brown, Srivatsan Ravi
2023· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
1
citations

How this was built: Screen · Findings · About