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 3 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
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
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
Cops and Robbers from a distance
Anthony Bonato, Ehsan Chiniforooshan, Paweł Prałat
2010· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
50
citations
affno abstractunlabeled
Learning recursive functions: A survey
Thomas Zeugmann, Sandra Zilles
2008· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
50
citations
afffundno abstractunlabeled
State complexity of power
Michael Domaratzki, Alexander Okhotin
2009· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
49
citations
affno abstractunlabeled
Deletion along trajectories
Michael Domaratzki
2004· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
47
citations
affno abstractunlabeled
Cleaning a network with brushes
Margaret-Ellen Messinger, Richard J. Nowakowski, Paweł Prałat
2008· article· en· Theoretical Computer Science· Physics and Astronomy
machine prediction:candidate · noneconsensus · none
46
citations
affno abstractunlabeled
Descriptional Complexity of Formal Systems
Helmut Jürgensen, Juhani Karhumäki, Alexander Okhotin
2015· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
46
citations
afffundno abstractunlabeled
On a special class of primitive words
Lila Kari, Shinnosuke Seki
2009· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
46
citations
afffundno abstractunlabeled
The complexity of dominating set reconfiguration
Arash Haddadan, Takehiro Ito, Amer E. Mouawad, Naomi Nishimura, Hirotaka Ono, Akira Suzuki +1 more
2016· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
44
citations
affno abstractunlabeled
Succinct encoding of arbitrary graphs
Arash Farzan, J. Ian Munro
2013· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
43
citations
affno abstractunlabeled
Active learning in heteroscedastic noise
András Antos, Varun Grover, Csaba Szepesvári
2010· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
43
citations
affno abstractunlabeled
Near-optimal PAC bounds for discounted MDPs
Tor Lattimore, Marcus Hütter
2014· article· en· Theoretical Computer Science· Decision Sciences
machine prediction:candidate · noneconsensus · none
43
citations
afffundno abstractunlabeled
Gathering in dynamic rings
Giuseppe Antonio Di Luna, Paola Flocchini, Linda Pagli, Giuseppe Prencipe, Nicola Santoro, Giovanni Viglietta
2018· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
41
citations
affno abstractunlabeled
On the power of non-local boxes
Anne Broadbent, André Allan Méthot
2005· article· en· Theoretical Computer Science· Physics and Astronomy
machine prediction:candidate · noneconsensus · none
41
citations
affno abstractunlabeled
A new logic for electronic commerce protocols
Kamel Adi, Mourad Debbabi, Mohamed Mejri
2002· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
39
citations
affno abstractunlabeled
Covering arrays avoiding forbidden edges
Peter Danziger, Eric Mendelsohn, Lucia Moura, Brett Stevens
2009· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
38
citations
affno abstractunlabeled
Fast construction of wavelet trees
J. Ian Munro, Yakov Nekrich, Jeffrey Scott Vitter
2015· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
38
citations
affno abstractunlabeled
A new characteristic property of rich words
Michelangelo Bucci, Alessandro De Luca, Amy Glen, Luca Q. Zamboni
2008· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
37
citations
affno abstractunlabeled
An algorithmic view of gene teams
Marie-Pierre Béal, Anne Bergeron, Sylvie Corteel, Mathieu Raffinot
2004· article· en· Theoretical Computer Science· Biochemistry, Genetics and Molecular Biology
machine prediction:candidate · noneconsensus · none
36
citations
afffundno abstractunlabeled
Repetitions in Sturmian strings
František Franěk, A. Karaman, W.F. Smyth
2000· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
36
citations
afffundno abstractunlabeled
The “runs” conjecture
Maxime Crochemore, Lucian Ilie, Liviu Tinta
2010· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
36
citations
fundno affno abstractunlabeled
Syntactic control of concurrency
Dan R. Ghica, Andrzej S. Murawski, C.-H. Luke Ong
2005· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
35
citations
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

How this was built: Screen · Findings · About