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
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
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.

463 results · 1 filter active ·
Results by year
20052025
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.
463 works in the cohort · of 4,299,418page 9 of 10

Labels cover 0 of 463 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 463 of 463 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.

afffundunlabeled
Incremental branching programs
Anna Gál, Pierre McKenzie, Michal Koucký
2006· article· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
QCSP on Reflexive Tournaments
Benoît Larose, Petar Marković, Barnaby Martin, Daniël Paulusma, Siani Smith, Stanislav Živný
2021· article· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
fundno affunlabeled
Computational Proteomics (Dagstuhl Seminar 19351)
Nuno Bandeira, Lennart Martens
2019· article· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Biochemistry, Genetics and Molecular Biology
machine prediction:candidate · noneconsensus · none
0
citations
afffundunlabeled
Quantum Cryptanalysis (Dagstuhl Seminar 19421)
Michele Mosca, María Naya‐Plasencia, Rainer Steinwandt
2020· other· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
afffundunlabeled
Short Proofs Are Hard to Find
Ian Mertz, Toniann Pitassi, Yuanhao Wei
2019· article· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Social Sciences
machine prediction:candidate · noneconsensus · none
0
citations
fundno affunlabeled
A Note on the No-(d+2)-On-a-Sphere Problem
2025· article· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Mathematics
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
LIPIcs, Volume 298, ECRTS 2024, Complete Volume
2024· other· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Biochemistry, Genetics and Molecular Biology
machine prediction:candidate · insufficient_payloadconsensus · none
0
citations
afffundunlabeled
Minimum Plane Bichromatic Spanning Trees
2024· article· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Environmental Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Is Impredicativity Implicitly Implicit
Stefan Monnier, Nathaniel Bos
2020· article· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
afffundunlabeled
Reconfiguration of Graph Minors
Benjamin Moore, Naomi Nishimura, Vijay Subramanya
2018· preprint· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Blame for Null (Artifact)
Abel Nieto, Marianna Rapoport, Gregor Richards, Ondřej Lhoták
2020· article· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
← previousnext →

How this was built: Screen · Findings · About