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
Theoretical Computer Science
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.

797 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.
797 works in the cohort · of 4,299,418page 2 of 16

Labels cover 0 of 797 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 797 of 797 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
Shortest paths between shortest paths
Marcin Kamiński, Paul Medvedev, Martin Milanič
2011· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
76
citations
afffundno abstractunlabeled
Theory of átomata
Janusz Brzozowski, Hellis Tamm
2014· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
74
citations
affno abstractunlabeled
Expressive power of SQL
Leonid Libkin
2003· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
68
citations
affno abstractunlabeled
Succinct representations of permutations and functions
J. Ian Munro, Rajeev Raman, Venkatesh Raman, Srinivasa Rao Satti
2012· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
67
citations
affno abstractunlabeled
Optimal graph exploration without good maps
Anders Dessmark, Andrzej Pelc
2004· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
66
citations
affno abstractunlabeled
Lyndon words, permutations and trees
Christophe Hohlweg, Christophe Reutenauer
2003· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
65
citations
affno abstractunlabeled
A note on the number of squares in a word
Lucian Ilie
2007· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
65
citations
affno abstractunlabeled
Pattern avoidance: themes and variations
James D. Currie
2005· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
65
citations
affno abstractunlabeled
Sense of direction in distributed computing
Paola Flocchini, Bernard Mans, Nicola Santoro
2002· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
63
citations
affno abstractunlabeled
Theory of one-tape linear-time Turing machines
K. Tadaki, Tomoyuki Yamakami, Jack C. H. Lin
2009· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
62
citations
affno abstractunlabeled
Coding properties of DNA languages
Salah Hussini, Lila Kari, Stavros Konstantinidis
2003· article· en· Theoretical Computer Science· Biochemistry, Genetics and Molecular Biology
machine prediction:candidate · noneconsensus · none
61
citations
affno abstractunlabeled
The degree distribution of the generalized duplication model
Gürkan Bebek, Petra Berenbrink, Colin Cooper, Tom Friedetzky, Joseph H. Nadeau, S. Cenk Şahinalp
2006· article· en· Theoretical Computer Science· Biochemistry, Genetics and Molecular Biology
machine prediction:candidate · noneconsensus · none
61
citations
afffundno abstractunlabeled
Computing similarity between RNA structures
Bin Ma, Lusheng Wang, Kaizhong Zhang
2002· article· en· Theoretical Computer Science· Biochemistry, Genetics and Molecular Biology
machine prediction:candidate · noneconsensus · none
60
citations
affno abstractunlabeled
On weighted balls-into-bins games
Petra Berenbrink, Tom Friedetzky, Zengjian Hu, Russell Martin
2008· article· en· Theoretical Computer Science· Economics, Econometrics and Finance
machine prediction:candidate · noneconsensus · none
60
citations
affno abstractunlabeled
Synchronizing groups and automata
Fredrick Arnold, Benjamin Steinberg
2006· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
59
citations
affno abstractunlabeled
The ultimate strategy to search on m rays?
Alejandro López-Ortíz, Sven Schuierer
2001· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
58
citations
afffundno abstractunlabeled
Mining for empty spaces in large data sets
Jeff Edmonds, Jarek Gryz, Dongming Liang, Renée J. Miller
2003· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
58
citations
affno abstractunlabeled
How many runs can a string contain?
Simon J. Puglisi, Jamie Simpson, W.F. Smyth
2008· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
57
citations
afffundno abstractunlabeled
Recognizing and drawing IC-planar graphs
Franz J. Brandenburg, Walter Didimo, William Evans, Philipp Kindermann, Giuseppe Liotta, Fabrizio Montecchiani
2016· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
55
citations
affno abstractunlabeled
On the k-path partition of graphs
George Steiner
2003· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
54
citations
affno abstractunlabeled
List matrix partitions of chordal graphs
Tomás Feder, Pavol Hell, Sulamita Klein, Loana Tito Nogueira, Fábio Protti
2005· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
53
citations
affno abstractunlabeled
Fast radio broadcasting with advice
David Ilcinkas, Dariusz R. Kowalski, Andrzej Pelc
2010· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
53
citations
affno abstractunlabeled
Space-efficient planar convex hull algorithms
Hervé Brönnimann, John Iacono, Jyrki Katajainen, Pat Morin, Jason Morrison, Godfried Toussaint
2004· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
52
citations
affno abstractunlabeled
Quotient complexity of ideal languages
Janusz Brzozowski, Galina Jirásková, Baiyu Li
2012· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
51
citations
afffundno abstractunlabeled
Rendezvous with constant memory
Paola Flocchini, Nicola Santoro, Giovanni Viglietta, Masafumi Yamashita
2016· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
51
citations
afffundno abstractunlabeled
Complexity of barrier coverage with relocatable sensors in the plane
Stefan Dobrev, Stéphane Durocher, Mohsen Eftekhari, Konstantinos Georgiou, Evangelos Kranakis, Danny Kriz̧anc +4 more
2015· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
51
citations
← previousnext →

How this was built: Screen · Findings · About