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 4 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.

afffundno abstractunlabeled
Finite state complexity
Cristian S. Calude, Kai Salomaa, Tania Roblot
2011· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
35
citations
afffundno abstractunlabeled
On properties of bond-free DNA languages
Lila Kari, Stavros Konstantinidis, Petr Sosı́k
2005· article· en· Theoretical Computer Science· Biochemistry, Genetics and Molecular Biology
machine prediction:candidate · noneconsensus · none
35
citations
afffundno abstractunlabeled
Longest increasing subsequences in sliding windows
Michael Albert, Alexander Golynski, Angèle M. Hamel, Alejandro López-Ortíz, Mohammad Ali Safari
2004· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
34
citations
affno abstractunlabeled
Approximate periods of strings
Jeong Seop Sim, Costas S. Iliopoulos, Kunsoo Park, W.F. Smyth
2001· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
33
citations
affno abstractunlabeled
On computing graph minor obstruction sets
Kevin Cattell, Michael J. Dinneen, Rodney G. Downey, Michael R. Fellows, Michael A. Langston
2000· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
33
citations
affno abstractunlabeled
Reducing NFAs by invariant equivalences
Lucian Ilie, Sheng Yü
2003· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
33
citations
fundno affno abstractunlabeled
Taut Monads and T0-spaces
Ernest G. Manes
2002· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
33
citations
affno abstractunlabeled
On the descriptional complexity of Watson–Crick automata
Elena Czeizler, Eugen Czeizler, Lila Kari, Kai Salomaa
2009· article· en· Theoretical Computer Science· Biochemistry, Genetics and Molecular Biology
machine prediction:candidate · noneconsensus · none
32
citations
affno abstractunlabeled
Euclidean strings
John Ellis, Frank Ruskey, Joe Sawada, Jamie Simpson
2003· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
32
citations
affno abstractunlabeled
On RAC drawings of 1-planar graphs
Michael A. Bekos, Walter Didimo, Giuseppe Liotta, Saeed Mehrabi, Fabrizio Montecchiani
2017· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
31
citations
fundno affno abstractunlabeled
Sequential?
Sylvain Lombardy, Jacques Sakarovitch
2006· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
31
citations
affno abstractunlabeled
The surviving rate of an infected network
Weifan Wang, Stephen Finbow, Ping Wang
2010· article· en· Theoretical Computer Science· Physics and Astronomy
machine prediction:candidate · noneconsensus · none
31
citations
afffundno abstractunlabeled
Recursively defined metric spaces without contraction
Franck van Breugel, Claudio Hermida, Michael Makkai, James Worrell
2007· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
31
citations
affno abstractunlabeled
Competitive algorithms for unbounded one-way trading
Francis Y. L. Chin, Bin Fu, Jiu-ling Guo, Shuguang Han, Jueliang Hu, Minghui Jiang +5 more
2015· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
31
citations
affno abstractunlabeled
The complexity of weighted Boolean #CSP with mixed signs
Andreǐ A. Bulatov, Martin Dyer, Leslie Ann Goldberg, Markus Jalsenius, David Richerby
2009· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
31
citations
affno abstractunlabeled
Simple permutations mix well
Shlomo Hoory, Avner Magen, Steven Myers, Charles Rackoff
2005· article· en· Theoretical Computer Science· Biochemistry, Genetics and Molecular Biology
machine prediction:candidate · noneconsensus · none
31
citations
afffundno abstractunlabeled
An FPTAS for the parallel two-stage flowshop problem
Jianming Dong, Weitian Tong, Taibo Luo, Xueshi Wang, Jueliang Hu, Yinfeng Xu +1 more
2016· article· en· Theoretical Computer Science· Engineering
machine prediction:candidate · noneconsensus · none
30
citations
aboutno affno abstractunlabeled
The Covering Canadian Traveller Problem
Chung-Shou Liao, Yamming Huang
2014· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
30
citations
affno abstractunlabeled
Fibrations and universal view updatability
Michael Johnson, Robert Rosebrugh
2007· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
30
citations
affno abstractunlabeled
Exploring an unknown dangerous graph using tokens
Stefan Dobrev, Paola Flocchini, Rastislav Kráľovič, Nicola Santoro
2012· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
29
citations
affno abstractunlabeled
On the superimposition of Christoffel words
Geneviève Paquin, Christophe Reutenauer
2010· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
29
citations
affno abstractunlabeled
Studies on finite Sturmian words
Christophe Reutenauer
2015· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
28
citations
affno abstractunlabeled
Template-guided DNA recombination
Mark Daley, Ian McQuillan
2004· article· en· Theoretical Computer Science· Biochemistry, Genetics and Molecular Biology
machine prediction:candidate · noneconsensus · none
28
citations
affno abstractunlabeled
The complexity of zero-visibility cops and robber
Dariusz Dereniowski, Danny Dyer, Ryan M. Tifenbach, Boting Yang
2015· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
27
citations
affno abstractunlabeled
Rich, Sturmian, and trapezoidal words
Aldo de Luca, Amy Glen, Luca Q. Zamboni
2008· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
27
citations
fundno affno abstractunlabeled
FM-index of alignment: A compressed index for similar strings
Joong Chae Na, Hyunjoon Kim, Heejin Park, Thierry Lecroq, Martine Léonard, Laurent Mouchard +1 more
2015· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
26
citations
affno abstractunlabeled
Multi-cut αβ-pruning in game-tree search
Yngvi Björnsson, T.A. Marsland
2001· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
26
citations
afffundno abstractunlabeled
A note on differentiable palindromes
Srečko Brlek, A. Ladouceur
2003· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
26
citations
affno abstractunlabeled
A generalization of repetition threshold
Lucian Ilie, Pascal Ochem, Jeffrey Shallit
2005· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
26
citations
afffundno abstractunlabeled
Shuffle and scattered deletion closure of languages
Masami Itō, Lila Kari, G. Thierrin
2000· article· en· Theoretical Computer Science· Biochemistry, Genetics and Molecular Biology
machine prediction:candidate · noneconsensus · none
25
citations
← previousnext →

How this was built: Screen · Findings · About