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 7 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
Why extension-based proofs fail
Dan Alistarh, James Aspnes, Faith Ellen, Rati Gelashvili, Leqi Zhu
2019· preprint· en· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
8
citations
afffundunlabeled
Coarser Equivalences for Causal Concurrency
Azadeh Farzan, Umang Mathur
2024· article· en· Proceedings of the ACM on Programming Languages· Computer Science
distilled prediction:candidate · noneconsensus · none
8
citations
affno abstractunlabeled
Transformations of Self-Stabilizing Algorithms
Kleoni Ioannidou
2002· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
8
citations
affunlabeled
Comparison of UDDI registry replication strategies
Chenliang Sun, Yi Lin, Bettina Kemme
2004· article· en· Proceedings. IEEE International Conference on Web Services, 2004.· Computer Science
distilled prediction:candidate · noneconsensus · none
7
citations
affno abstractunlabeled
B-slack Trees: Space Efficient B-Trees
Trevor Brown
2014· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
7
citations
affunlabeled
Brief Announcement: Fast Graphical Population Protocols
Dan Alistarh, Rati Gelashvili, Joel Rybicki
2021· preprint· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Computer Science
distilled prediction:candidate · metaepi_narrow+scholarly_communicationconsensus · none
7
citations
affunlabeled
ESCAPE to Precaution against Leader Failures
Gengrui Zhang, Hans‐Arno Jacobsen
2022· article· en· 2022 IEEE 42nd International Conference on Distributed Computing Systems (ICDCS)· Computer Science
distilled prediction:candidate · metaepi_narrow+scholarly_communicationconsensus · none
7
citations
affunlabeled
Toward scalable transaction processing
Anastasia Ailamaki, Ryan Johnson, Ippokratis Pandis, Pınar Tözün
2013· article· en· Proceedings of the VLDB Endowment· Computer Science
distilled prediction:candidate · noneconsensus · none
7
citations
affunlabeled
Proving PACELC
Wojciech Golab
2018· article· en· ACM SIGACT News· Computer Science
distilled prediction:candidate · noneconsensus · none
7
citations

How this was built: Screen · Findings · About