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 1 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 teacher distillation outputs. Candidate is the union; consensus is the intersection.

afffundunlabeled
Learning Algorithms from Natural Proofs
Marco Carmosino, Russell Impagliazzo, Valentine Kabanets, Antonina Kolokolova
2016· article· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
37
citations
affunlabeled
Concrete Types for TypeScript
Gregor Richards, Francesco Zappa Nardelli, Jan Vítek
2015· preprint· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Computer Science
distilled prediction:candidate · metaepi_narrow+scholarly_communicationconsensus · none
36
citations
affunlabeled
Hybrid DOM-Sensitive Change Impact Analysis for JavaScript
Saba Alimadadi, Ali Mesbah, Karthik Pattabiraman
2015· article· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
32
citations
fundno affunlabeled
Block-Wise Non-Malleable Codes
Nishanth Chandran, Vipul Goyal, Pratyay Mukherjee, Omkant Pandey, Jalaj Upadhyay
2016· article· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
31
citations
affunlabeled
Automated Certified Proofs with CiME3
Évelyne Contejean, Pierre Courtieu, Julien Forest, Olivier Pons, Xavier Urbain
2011· preprint· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Computer Science
distilled prediction:candidate · metaepi_narrow+scholarly_communicationconsensus · none
29
citations
affunlabeled
The Tropical Double Description Method
Xavier Allamigeon, Stéphane Gaubert, Éric Goubault
2010· preprint· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Computer Science
distilled prediction:candidate · metaepi_narrow+scholarly_communicationconsensus · none
24
citations
affunlabeled
Uncloneable Quantum Encryption via Oracles
Anne Broadbent, Sébastien Lord
2019· preprint· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Computer Science
distilled prediction:candidate · metaepi_narrow+scholarly_communicationconsensus · none
23
citations
affunlabeled
A Formal Framework for Probabilistic Unclean Databases.
Christopher De, Ihab F. Ilyas, Benny Kimelfeld, Christopher Ré, Theodoros Rekatsinas
2019· article· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Decision Sciences
distilled prediction:candidate · metaepi_narrow+insufficient_payloadconsensus · none
22
citations
fundno affunlabeled
The Quantum Entropy Cone of Stabiliser States
Noah Linden, František Matúš, Mary Beth Ruskai, Andreas Winter
2013· preprint· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Computer Science
distilled prediction:candidate · metaepi_narrow+scholarly_communicationconsensus · none
21
citations
affunlabeled
Randomized Communication vs. Partition Number.
Mika Göös, T. S. Jayram, Toniann Pitassi, Thomas Watson
2015· article· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
19
citations
fundno affunlabeled
Graph Modification Problems (Dagstuhl Seminar 14071)
Hans L. Bodlaender, Pinar Heggernes, Daniel Lokshtanov
2014· article· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
19
citations
affunlabeled
Pathfinding in Games
Adi Botea, Bruno Bouzy, Michael Buro, Christian Bauckhage, Dana Nau
2013· article· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Computer Science
distilled prediction:candidate · metaepi_narrow+insufficient_payloadconsensus · none
17
citations
fundno affunlabeled
A Unified Framework of Quantum Walk Search
Simon Apers, András Gilyén, Stacey Jeffery
2021· preprint· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Computer Science
distilled prediction:candidate · metaepi_narrow+scholarly_communication+research_integrityconsensus · none
15
citations
affunlabeled
Super Mario Bros. is Harder/Easier Than We Thought
Erik D. Demaine, Giovanni Viglietta, Aaron Williams
2016· article· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Computer Science
distilled prediction:candidate · metaepi_narrow+insufficient_payloadconsensus · none
15
citations
affunlabeled
On Visibility Representations of Non-Planar Graphs
Thérèse Biedl, Giuseppe Liotta, Fabrizio Montecchiani
2016· article· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Computer Science
distilled prediction:candidate · noneconsensus · none
14
citations
affunlabeled
Proportionally Fair Clustering Revisited
Evi Micha, Nisarg Shah
2020· article· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Computer Science
distilled prediction:candidate · metaepi_narrow+open_scienceconsensus · open_science
14
citations
fundno affunlabeled
Simpler Proofs of Quantumness
Zvika Brakerski, Venkata Koppula, Umesh Vazirani, Thomas Vidick
2020· preprint· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
14
citations
affunlabeled
A Fast and Small Subsampled R-Index
2020· preprint· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Computer Science
distilled prediction:candidate · metaepi_narrow+scholarly_communication+open_scienceconsensus · none
13
citations
affunlabeled
Convergence Results for Neural Networks via Electrodynamics
Rina Panigrahy‎, Ali Rahimi, Sushant Sachdeva, Qiuyi Zhang
2018· article· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
13
citations
affunlabeled
Hilbert’s Tenth Problem in Coq
Dominique Larchey-Wendling, Yannick Forster
2019· preprint· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Computer Science
distilled prediction:candidate · metaepi_narrow+scholarly_communication+open_science+research_integrityconsensus · metaepi_narrow+open_science
12
citations
affunlabeled
The Beta-Bernoulli process and algebraic effects
Sam Staton, Dario Stein, Hongseok Yang, Nathanael Ackerman, Cameron E. Freer, Daniel M. Roy
2018· preprint· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Computer Science
distilled prediction:candidate · metaepi_narrow+scholarly_communicationconsensus · none
11
citations
afffundunlabeled
Dynamic Orthogonal Range Searching on the RAM, Revisited
Timothy M. Chan, Konstantinos Tsakalidis
2017· article· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Computer Science
distilled prediction:candidate · sts+scholarly_communicationconsensus · none
11
citations
afffundunlabeled
Succinct Data Structures for Chordal Graphs
J. Ian Munro, Kaiyu Wu
2018· article· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Computer Science
distilled prediction:candidate · metaepi_narrow+open_scienceconsensus · none
10
citations
affunlabeled
Sums of Palindromes: an Approach via Automata
Aayush Rajasekaran, Jeffrey Shallit, Tim Smith
2018· article· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
9
citations
affunlabeled
Leakage-Resilient Secret Sharing in Non-Compartmentalized Models.
Fuchun Lin, Mahdi Cheraghchi, Venkatesan Guruswami, Reihaneh Safavi–Naini, Huaxiong Wang
2020· article· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
8
citations
afffundunlabeled
Light Euclidean Spanners with Steiner Points
Hung Le, Shay Solomon
2020· article· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
8
citations

How this was built: Screen · Findings · About