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
Computational Complexity
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.

40 results · 1 filter active ·
Results by year
20012025
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.
40 works in the cohort · of 4,299,418page 1 of 1

Labels cover 0 of 40 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 40 of 40 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
Quantum Arthur–Merlin games
Chris Marriott, John Watrous
2005· article· en· Computational Complexity· Computer Science
machine prediction:candidate · noneconsensus · none
253
citations
affno abstractunlabeled
Non-Automatizability of Bounded-Depth Frege Proofs
Marı́a Luisa Bonet, Carlos Domingo, Ricard Gavald�, Alexis Maciel, Toniann Pitassi
2004· article· en· Computational Complexity· Computer Science
machine prediction:candidate · noneconsensus · none
71
citations
affno abstractunlabeled
Quantum Computational Complexity
John Watrous
2011· book-chapter· en· Computational Complexity· Computer Science
machine prediction:candidate · noneconsensus · none
49
citations
affno abstractunlabeled
Reducing the complexity of reductions
M. Agrawal, Eric Allender, Russell Impagliazzo, Toniann Pitassi, Steven Rudich
2001· article· en· Computational Complexity· Computer Science
machine prediction:candidate · noneconsensus · none
38
citations
affno abstractunlabeled
Mining Circuit Lower Bound Proofs for Meta-Algorithms
Ruiwen Chen, Valentine Kabanets, Antonina Kolokolova, Ronen Shaltiel, David Zuckerman
2015· article· en· Computational Complexity· Computer Science
machine prediction:candidate · noneconsensus · none
35
citations
affno abstractunlabeled
Interpolation of Shifted-Lacunary Polynomials
Mark Giesbrecht, Daniel S. Roche
2010· article· en· Computational Complexity· Computer Science
machine prediction:candidate · noneconsensus · none
27
citations
affno abstractunlabeled
The Minimum Oracle Circuit Size Problem
Eric Allender, Dhiraj Holden, Valentine Kabanets
2016· article· en· Computational Complexity· Computer Science
machine prediction:candidate · noneconsensus · none
25
citations
afffundno abstractunlabeled
Homogenization and the polynomial calculus
Joshua Buresh-Oppenheim, Matthew Clegg, Russell Impagliazzo, Toniann Pitassi
2002· article· en· Computational Complexity· Computer Science
machine prediction:candidate · noneconsensus · none
19
citations
affno abstractunlabeled
Parallel Approximation of Min-Max Problems
Gus Gutoski, Xiaodi Wu
2013· article· en· Computational Complexity· Computer Science
machine prediction:candidate · noneconsensus · none
16
citations
affno abstractunlabeled
On the Power of Non-adaptive Learning Graphs
Aleksandrs Belovs, Ansis Rosmanis
2014· article· en· Computational Complexity· Computer Science
machine prediction:candidate · noneconsensus · none
16
citations
affno abstractunlabeled
The Complexity of Tensor Circuit Evaluation
Martin Beaudry, Markus Holzer
2007· article· en· Computational Complexity· Computer Science
machine prediction:candidate · noneconsensus · none
11
citations
affno abstractunlabeled
The complexity of estimating min-entropy
Thomas Watson
2014· article· en· Computational Complexity· Computer Science
machine prediction:candidate · noneconsensus · none
10
citations
affno abstractunlabeled
A Quantum Characterization Of NP
Hugue Blier, Alain Tapp
2011· article· en· Computational Complexity· Computer Science
machine prediction:candidate · noneconsensus · none
9
citations
affno abstractunlabeled
Space-Efficient Counting in Graphs on Surfaces
Mark Braverman, Raghav Kulkarni, Sambuddha Roy
2009· article· en· Computational Complexity· Computer Science
machine prediction:candidate · noneconsensus · none
5
citations
afffundno abstractunlabeled
The Landscape of Communication Complexity Classes
Mika Göös, Toniann Pitassi, Thomas Watson
2018· article· en· Computational Complexity· Computer Science
machine prediction:candidate · noneconsensus · none
5
citations
affno abstractunlabeled
The Power of Natural Properties as Oracles
Russell Impagliazzo, Valentine Kabanets, Ilya Volkovich
2023· article· en· Computational Complexity· Computer Science
machine prediction:candidate · noneconsensus · none
4
citations
afffundno abstractunlabeled
KRW Composition Theorems via Lifting
Susanna F. de Rezende, Or Meir, Jakob Nordstr”öm, Toniann Pitassi, Robert Robere
2024· article· en· Computational Complexity· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affno abstractunlabeled
Subquadratic-Time Algorithms for Normal Bases
Mark Giesbrecht, Armin Jamshidpey, Éric Schost
2021· preprint· en· Computational Complexity· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affno abstractunlabeled
Lifting lower bounds for tree-like proofs
Alexis Maciel, Phuong Nguyen, Toniann Pitassi
2013· article· en· Computational Complexity· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affunlabeled
On the Complexity of Succinct Zero-Sum Games
Lance Fortnow, Russell Impagliazzo, Valentine Kabanets, Christopher Umans
2005· article· en· Computational Complexity· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affno abstractunlabeled
Rough Sets: Foundations and Perspectives
James F. Peters, Andrzej Skowron, Jarosław Stepaniuk
2011· book-chapter· en· Computational Complexity· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations

How this was built: Screen · Findings · About