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 3 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
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
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
A Simple Algorithm for Minimum Cuts in Near-Linear Time
Nalin Bhardwaj, Antonio Molina Lovett, Bryce Sandlund
2019· preprint· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Computer Science
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
A Recipe for Quantum Graphical Languages
Titouan Carette, Emmanuel Jeandel
2020· preprint· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Physics and Astronomy
machine prediction:candidate · noneconsensus · none
4
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
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
afffundunlabeled
Optimal Register Construction in M&M Systems
Vassos Hadzilacos, Xing Hu, Sam Toueg
2020· article· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Computer Science
machine prediction:candidate · noneconsensus · none
4
citations
afffundunlabeled
Time-Space Trade-offs for Triangulating a Simple Polygon
Boris Aronov, Matias Korman, Simon Pratt, André van Renssen, Marcel Roeloffzen
2016· article· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations
affunlabeled
Palindrome Recognition In The Streaming Model
Petra Berenbrink, Funda Ergün, Frederik Mallmann-Trenn, Erfan Sadeqi Azer
2014· article· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations
afffundunlabeled
Improved Routing on the Delaunay Triangulation
Nicolas Bonichon, Prosenjit Bose, Jean-Lou De Carufel, Vincent Despré, Darryl Hill, Michiel Smid
2018· article· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Social Sciences
machine prediction:candidate · noneconsensus · none
3
citations
affunlabeled
On the Notion of Genre in Digital Preservation
Fiorella Foscarini, Yunhyong Kim, Christopher A. Lee, Alexander Mehler, Gillian Oliver, Seamus Ross
2010· article· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations
affunlabeled
The Tandem Duplication Distance Is NP-Hard
Manuel Lafond, Binhai Zhu, Peng Zou
2020· article· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations
fundno affunlabeled
Data Physicalization (Dagstuhl Seminar 18441)
Jason Alexander, Petra Isenberg, Yvonne Jansen, Bernice E. Rogowitz, Andrew Vande Moere
2019· article· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Arts and Humanities
machine prediction:candidate · noneconsensus · none
3
citations
affunlabeled
The Complexity of Symmetry Breaking in Massive Graphs
Christian Konrad, Sriram V. Pemmaraju, Talal Riaz, Peter Robinson
2019· article· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations
affunlabeled
Tensor of Quantitative Equational Theories
Giorgio Bacci, Radu Mardare, Prakash Panangaden, Gordon Plotkin
2021· article· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations
affunlabeled
The complexity of speedrunning video games
Manuel Lafond
2018· article· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations
affunlabeled
Query-To-Communication Lifting for BPP Using Inner Product
Arkadev Chattopadhyay, Yuval Filmus, Sajin Koroth, Or Meir
2019· article· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations

How this was built: Screen · Findings · About