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 5 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
Path Queries on Functions
Travis Gagie, Meng He, Gonzalo Navarro
2017· article· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
fundno affunlabeled
Optimal algorithms and proofs (Dagstuhl Seminar 14421)
Olaf Beyersdorff, Edward Hirsch, Jan Krajı́ček, Rahul Santhanam
2015· article· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affunlabeled
10081 Abstracts Collection – Cognitive Robotics
Gerhard Lakemeyer, Hector J. Levesque, Fiora Pirri
2010· article· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Engineering
machine prediction:candidate · insufficient_payloadconsensus · none
1
citations
affunlabeled
Typeful Normalization by Evaluation
Olivier Danvy, Chantal Keller, Matthias Puech
2015· article· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affunlabeled
Lifting for Constant-Depth Circuits and Applications to MCSP
Marco Carmosino, Kenneth R. Hoover, Russell Impagliazzo, Valentine Kabanets, Antonina Kolokolova
2021· article· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
afffundunlabeled
From Small Space to Small Width in Resolution
Massimo Lauria, Mladen Mikša, Jakob Nordstr”öm, Marc Vinyals
2014· article· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
fundno affunlabeled
Subspace-Invariant AC^0 Formulas
Benjamin Rossman
2017· article· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
afffundunlabeled
On Local Testability in the Non-Signaling Setting
Alessandro Chiesa, Peter Manohar, Igor Shinkar
2020· article· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Engineering
machine prediction:candidate · noneconsensus · none
1
citations
affunlabeled
Attention Demands in Text Entry Interfaces
I. Scott MacKenzie
2006· article· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affunlabeled
String Matching: Communication, Circuits, and Learning
Alexander Golovnev, Mika Göös, Daniel Reichman, Igor Shinkar
2019· article· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affunlabeled
Market Pricing for Matroid Rank Valuations
Kristóf Bérczi, Naonori Kakimura, Yusuke Kobayashi
2020· article· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Economics, Econometrics and Finance
machine prediction:candidate · noneconsensus · none
1
citations
affunlabeled
On Query-To-Communication Lifting for Adversary Bounds
Anurag Anshu, Shalev Ben-David, Srijita Kundu
2021· article· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
afffundunlabeled
A QPTAS for Facility Location on Unit Disk Graphs
2025· article· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Business, Management and Accounting
machine prediction:candidate · noneconsensus · none
1
citations
afffundunlabeled
Colourful TFNP and Propositional Proofs
2023· article· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
afffundunlabeled
PRINCE: Accurate Approximation of the Copy Number of Tandem Repeats
Mehrdad Mansouri, Julian Booth, Margaryta Vityaz, Cédric Chauve, Leonid Chindelevitch
2018· article· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Biochemistry, Genetics and Molecular Biology
machine prediction:candidate · noneconsensus · none
1
citations
afffundunlabeled
Improved Algorithms for MST and Metric-TSP Interdiction
André Linhares, Chaitanya Swamy
2017· article· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Economics, Econometrics and Finance
machine prediction:candidate · noneconsensus · none
1
citations
affunlabeled
Space and Time Bounded Multiversion Garbage Collection
Naama Ben-David, Guy E. Blelloch, Panagiota Fatourou, Eric Ruppert, Yihan Sun, Yuanhao Wei
2021· preprint· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
fundno affunlabeled
REST: Integrating Term Rewriting with Program Verification
Zachary Grannan, Niki Vazou, Eva Darulová, Alexander J. Summers
2022· preprint· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
fundno affunlabeled
Routing on the Visibility Graph
Prosenjit Bose, Matias Korman, Sander Verdonschot, André van Renssen
2017· preprint· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
fundno affunlabeled
Time for Timed Monitorability
2025· article· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
← previousnext →

How this was built: Screen · Findings · About