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 6 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
1-String B_2-VPG Representation of Planar Graphs
Thérèse Biedl, Martin Derka
2015· article· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affunlabeled
Scala with Explicit Nulls (Artifact)
Abel Nieto, Yaoyu Zhao, Ondřej Lhoták, Angela Chang, Justin Pu
2020· article· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
afffundunlabeled
Counting Homomorphisms Modulo a Prime Number
Amirhossein Kazeminia, Andreǐ A. Bulatov
2019· preprint· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
afffundunlabeled
Layered Fan-Planar Graph Drawings
Thérèse Biedl, Steven Chaplick, Michael Kaufmann, Fabrizio Montecchiani, Martin Nöllenburg, Chrysanthi N. Raftopoulou
2020· preprint· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affunlabeled
Toward a Dichotomy for Approximation of $H$-coloring
Akbar Rafiey, Arash Rafiey, Thiago Santos
2019· preprint· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affunlabeled
RLBWT Tricks
Nathaniel K. Brown, Travis Gagie
2021· preprint· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affunlabeled
On Approximate Range Mode and Range Selection
Hicham El-Zein, Meng He, J. Ian Munro, Yakov Nekrich, Bryce Sandlund
2019· preprint· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
afffundunlabeled
On Palindromic Periodicities
2025· article· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
aboutno affunlabeled
KaMinPar
2025· other· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Biochemistry, Genetics and Molecular Biology
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Learning in Local Branching (Invited Talk)
Defeng Liu, Andrea Lodi
2021· article· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Arts and Humanities
machine prediction:candidate · noneconsensus · none
0
citations
← previousnext →

How this was built: Screen · Findings · About