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
Topic
Computability, Logic, AI Algorithms
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.

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

Labels cover 0 of 805 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 805 of 805 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.

affno abstractunlabeled
PSPACE-Completeness of Reversible Deterministic Systems
Erik D. Demaine, Robert A. Hearn, Dylan Hendrickson, Jayson Lynch
2022· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
afffundunlabeled
Approximate and Stochastic Ising Machines
Tingting Zhang, Siting Liu, Honglan Jiang, Warren J. Gross, Fabrizio Lombardi, Jie Han
2025· article· en· IEEE Nanotechnology Magazine· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
venueno affno abstractunlabeled
Implicit degree sum condition for long cycles.
Junqing Cai, Yu Lian, Jinzhuan Cai
2017· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
affno abstractunlabeled
Caging AI
Ming Li
2025· article· en· Journal of Computer Science and Technology· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
affno abstractunlabeled
Fast Combinatorial Algorithms for Efficient Sortation
Madison Van Dyk, Kim Klause, Jochen Koenemann, Nicole Megow
2024· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
fundno affunlabeled
Ten Problems in Experimental Mathematics
David H. Bailey, Jonathan M. Borwein, Vishaal Kapoor, Eric W. Weisstein
2004· article· en· University of North Texas Digital Library (University of North Texas)· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
affno abstractunlabeled
The Fundamental Theorem of Arithmetic
Daniel Rosenthal, David Rosenthal, Peter Rosenthal
2014· book-chapter· en· Undergraduate texts in mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
fundno affunlabeled
Pride and Probability
Francesca Zaffora Blando
2024· article· en· Philosophy of Science· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
fundno affunlabeled
On the frequency of $k$-deficient numbers
Jean–Marie De Koninck, Imre Kátai
2002· article· en· Publicationes Mathematicae Debrecen· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
affunlabeled
The Synthesis and Decoding of Meaning
H. Georg Schulze
2021· article· en· Journal of Artificial General Intelligence· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
afffundunlabeled
COMPLEXITY, INFORMATION, ENERGY
Helmut Jürgensen
2008· article· en· International Journal of Foundations of Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
affunlabeled
On the Complexity of Zero Gap MIP*
Hamoon Mousavi, Seyed Sajjad Nezhadi, Henry Yuen
2020· article· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
affno abstractunlabeled
Theory and Applications of Models of Computation
Ding‐Zhu Du, Donglei Du, Chenchen Wu, Dachuan Xu
2022· book· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
afffundunlabeled
Bridging Generative Networks with the Common Model of Cognition
Robert West, Spencer Eckler, Brendan Conway-Smith, Nico Turcas, Eilene Tomkins-Flanagan, Matthew A. Kelly
2024· article· en· Proceedings of the AAAI Symposium Series· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affunlabeled
Non-computable Julia sets
Mark Braverman, Michael Yampolsky
2004· preprint· en· ArXiv.org· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affunlabeled
Software for "How to Bake a Quantum Pi"
Jacques Carette, Amr Sabry, Chris Heunen, Robin Kaarsgaard
2023· preprint· en· arXiv (Cornell University)· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
venueno affno abstractunlabeled
Some Tree-book Ramsey Numbers.
Lianmin Zhang, Kun Chen, Dongmei Zhu
2017· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affunlabeled
Toward a Model of Models: Part II
Mordechay Schlesinger, Robert D. Kent
2005· book-chapter· en· Kluwer Academic Publishers eBooks· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
aboutno affunlabeled
ACM Turing Award Lecture at SC22
2022· article· en· ACM SIGHPC Connect· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
venueno affunlabeled
A Minimal Pair of Turing Degrees
Patrizio Cintioli
2014· article· en· Journal of Mathematics Research· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations

How this was built: Screen · Findings · About