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

affunlabeled
Preconditioning for the Geometric Transportation Problem
Andrey Boris Khesin, Aleksandar Nikolov, Dmitry Paramonov
2019· article· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Computer Science
machine prediction:candidate · noneconsensus · none
7
citations
affunlabeled
Graph Clustering using Effective Resistance
Vedat Levi Alev, Nima Anari, Lap Chi Lau, Shayan Oveis Gharan
2018· article· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Physics and Astronomy
machine prediction:candidate · noneconsensus · none
7
citations
fundno affunlabeled
Information complexity is computable
2015· preprint· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Computer Science
machine prediction:candidate · noneconsensus · none
7
citations
affunlabeled
Temporal information extraction from legal documents
Frank Schilder, J. Andrew McCulloh
2005· article· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Computer Science
machine prediction:candidate · noneconsensus · none
6
citations
fundno affunlabeled
Span Programs and Quantum Time Complexity
Arjan Cornelissen, Stacey Jeffery, Māris Ozols, Álvaro Piedrafita
2020· preprint· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Computer Science
machine prediction:candidate · noneconsensus · none
6
citations
afffundunlabeled
Index-Stratified Types
Rohan Jacob-Rao, Brigitte Pientka, David Thibodeau
2018· article· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Mathematics
machine prediction:candidate · noneconsensus · none
6
citations
affunlabeled
On the Determinism of Multi-core Processors
Vladimir‐Alexandru Paun, Bruno Monsuez, Philippe Baufreton
2013· preprint· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Computer Science
machine prediction:candidate · noneconsensus · none
6
citations
afffundunlabeled
Algorithms for Designing Pop-Up Cards
Zachary Abel, Erik D. Demaine, Martin L. Demaine, Sarah Eisenstat, Anna Lubiw, André Schulz +3 more
2013· article· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Computer Science
machine prediction:candidate · noneconsensus · none
6
citations
affunlabeled
Shape formation by programmable particles
Giuseppe Antonio Di Luna, Paola Flocchini, Nicola Santoro, Giovanni Viglietta, Yukiko Yamauchi
2018· article· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Engineering
machine prediction:candidate · noneconsensus · none
6
citations
affunlabeled
A New Perspective on the Mereotopology of RCC8
Michael Grüninger, Bahar Aameri
2017· article· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Computer Science
machine prediction:candidate · noneconsensus · none
6
citations
afffundunlabeled
Succinct Color Searching in One Dimension
Hicham El-Zein, J. Ian Munro, Yakov Nekrich
2017· article· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Computer Science
machine prediction:candidate · noneconsensus · none
5
citations
fundno affunlabeled
There Is Only One Notion of Differentiation
J.R.B. Cockett, Jean-Simon Pacaud Lemay
2017· article· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Computer Science
machine prediction:candidate · noneconsensus · none
5
citations
afffundunlabeled
On $r$-Guarding Thin Orthogonal Polygons
Thérèse Biedl, Saeed Mehrabi
2016· preprint· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Computer Science
machine prediction:candidate · noneconsensus · none
5
citations
affunlabeled
Existential Length Universality
Paweł Gawrychowski, Martin Lange, Narad Rampersad, Jeffrey Shallit, Marek Szykuła
2020· article· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Computer Science
machine prediction:candidate · noneconsensus · none
5
citations
affunlabeled
Improved Learning from Kolmogorov Complexity
2023· article· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Biochemistry, Genetics and Molecular Biology
machine prediction:candidate · noneconsensus · none
5
citations
afffundunlabeled
Dequantizing Read-once Quantum Formulas
Alessandro Cosentino, Robin Kothari, Adam Paetznick
2013· preprint· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Computer Science
machine prediction:candidate · noneconsensus · none
5
citations
afffundunlabeled
Homomorphisms of signed graphs: An update
2019· preprint· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Computer Science
machine prediction:candidate · noneconsensus · none
5
citations
affunlabeled
Categorical Range Reporting with Frequencies
Arnab Ganguly, J. Ian Munro, Yakov Nekrich, Rahul Shah, Sharma V. Thankachan
2019· article· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Computer Science
machine prediction:candidate · noneconsensus · none
5
citations
fundno affunlabeled
Combinatorial Gray codes-an updated survey
2022· preprint· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Computer Science
machine prediction:candidate · noneconsensus · none
5
citations
affunlabeled
A Composition Theorem for Conical Juntas.
Mika Göös, T. S. Jayram
2015· article· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Computer Science
machine prediction:candidate · noneconsensus · none
5
citations
affunlabeled
Succinct Population Protocols for Presburger Arithmetic
Michael Blondin, Javier Esparza, Blaise Genest, Martin Helfrich, Stefan Jaax
2020· preprint· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Computer Science
machine prediction:candidate · noneconsensus · none
5
citations
affunlabeled
It’s a Small World for Random Surfers
Abbas Mehrabian
2014· article· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Physics and Astronomy
machine prediction:candidate · noneconsensus · none
4
citations
affunlabeled
Energy Consumption of Group Search on a Line
Jurek Czyzowicz, Konstantinos Georgiou, Ryan Killick, Evangelos Kranakis, Danny Kriz̧anc, Manuel Lafond +3 more
2019· preprint· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Computer Science
machine prediction:candidate · noneconsensus · none
4
citations
affunlabeled
The Power of Super-logarithmic Number of Players
Arkadev Chattopadhyay, Michael Saks
2014· article· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Mathematics
machine prediction:candidate · noneconsensus · none
4
citations
affunlabeled
Improved Time and Space Bounds for Dynamic Range Mode
Hicham El-Zein, Meng He, J. Ian Munro, Bryce Sandlund
2018· article· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Computer Science
machine prediction:candidate · noneconsensus · none
4
citations
affunlabeled
Iterated Belief Change and the Levi Identity
Abhaya Nayak, Randy Goebel, Mehmet A. Orgun, Tam Pham
2005· article· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Computer Science
machine prediction:candidate · noneconsensus · none
4
citations

How this was built: Screen · Findings · About