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
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 5 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
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
affno abstractunlabeled
Locating a backtracking robber on a tree
Suzanne M. Seager
2014· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
24
citations
affno abstractunlabeled
Loop checks for logic programs with functions
Yi-Dong Shen, Li-Yan Yuan, Jia-Huai You
2001· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
24
citations
affno abstractunlabeled
McNaughton families of languages
Marie‐Claude Beaudry, Markus Holzer, G.K. Niemann, F. Otto
2003· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
24
citations
affno abstractunlabeled
Enhanced string covering
Tomáš Flouri, Costas S. Iliopoulos, Tomasz Kociumaka, Solon P. Pissis, Simon J. Puglisi, W.F. Smyth +1 more
2013· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
24
citations
aboutno affno abstractunlabeled
Complexity of Canadian traveler problem variants
Dror Fried, Solomon Eyal Shimony, Amit Benbassat, Cenny Wenner
2013· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
24
citations
affno abstractunlabeled
Palindromic factors of billiard words
Jean-Pierre Borel, Christophe Reutenauer
2005· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
23
citations
affno abstractunlabeled
Palindromic complexity of codings of rotations
Alexandre Blondin Massé, Srečko Brlek, Sebastien Labbé, Laurent Vuillon
2011· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
23
citations
affno abstractunlabeled
Combinatorial properties of smooth infinite words
Srečko Brlek, Serge Dulucq, A. Ladouceur, Laurent Vuillon
2006· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
22
citations
afffundno abstractunlabeled
Aspects of shuffle and deletion on trajectories
Lila Kari, Petr Sosı́k
2004· article· en· Theoretical Computer Science· Biochemistry, Genetics and Molecular Biology
machine prediction:candidate · noneconsensus · none
22
citations
affno abstractunlabeled
Mergible states in large NFA
Cezar Câmpeanu, Nicolae Sântean, Sheng Yü
2004· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
22
citations
affno abstractunlabeled
Maximizing agreements and coagnostic learning
Nader H. Bshouty, Lynn Burroughs
2005· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
21
citations
affno abstractunlabeled
On non-progressive spread of influence through social networks
MohammadAmin Fazli, Mohammad Ghodsi, Jafar Habibi, Pooya Jalaly, Vahab Mirrokni, Sina Sadeghian
2014· article· en· Theoretical Computer Science· Physics and Astronomy
machine prediction:candidate · noneconsensus · none
21
citations
afffundno abstractunlabeled
On graphs that are not PCGs
Stéphane Durocher, Debajyoti Mondal, Md. Saidur Rahman
2015· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
21
citations
affno abstractunlabeled
Priority algorithms for graph optimization problems
Allan Borodin, Joan Boyar, Kim S. Larsen, Nazanin Mirmohammadi
2009· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
21
citations
affno abstractunlabeled
Perfect Roman domination in graphs
S. S. Banerjee, Julian Keil, D. Pradhan
2019· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
21
citations
affno abstractunlabeled
Computability of analog networks
John V. Tucker, J. I. Zucker
2006· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
20
citations
afffundno abstractunlabeled
On the weight of universal insertion grammars
Lila Kari, Petr Sosı́k
2008· article· en· Theoretical Computer Science· Biochemistry, Genetics and Molecular Biology
machine prediction:candidate · noneconsensus · none
20
citations
affno abstractunlabeled
Evacuating two robots from multiple unknown exits in a circle
Jurek Czyzowicz, Stefan Dobrev, Konstantinos Georgiou, Evangelos Kranakis, Fraser MacQuarrie
2016· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
20
citations
affno abstractunlabeled
Decidability of trajectory-based equations
Michael Domaratzki, Kai Salomaa
2005· article· en· Theoretical Computer Science· Biochemistry, Genetics and Molecular Biology
machine prediction:candidate · noneconsensus · none
20
citations
affno abstractunlabeled
Realizability models for BLL-like languages
Martin Hofmann, Philip Scott
2003· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
19
citations
afffundno abstractunlabeled
On prefix normal words and prefix normal forms
Péter Burcsi, Gabriele Fici, Zsuzsanna Lipták, Frank Ruskey, Joe Sawada
2016· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
19
citations
affno abstractunlabeled
Lemmings is PSPACE-complete
Giovanni Viglietta
2015· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
19
citations

How this was built: Screen · Findings · About