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 7 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
A classification of plane and planar 2-trees
Gilbert Labelle, Cédric Lamathe, Pierre Leroux
2003· article· en· Theoretical Computer Science· Chemistry
machine prediction:candidate · noneconsensus · none
14
citations
affno abstractunlabeled
Combinatorial properties of double square tiles
Alexandre Blondin Massé, A. Garon, Sebastien Labbé
2012· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
14
citations
affno abstractunlabeled
Improving the <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:msub><mml:mrow><mml:mi>H</mml:mi></mml:mrow><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msub></mml:math>-bound on the price of stability in undirected Shapley network design games
Yann Disser, Andreas Emil Feldmann, Max Klimm, Matúš Mihaľák
2014· article· lv· Theoretical Computer Science· Decision Sciences
machine prediction:candidate · noneconsensus · none
14
citations
affno abstractunlabeled
On the existence of regular approximations
Brendan Cordy, Kai Salomaa
2007· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
13
citations
afffundno abstractunlabeled
Whom to befriend to influence people
Gennaro Cordasco, Luisa Gargano, Manuel Lafond, Lata Narayanan, Adele A. Rescigno, Ugo Vaccaro +1 more
2018· article· en· Theoretical Computer Science· Physics and Astronomy
machine prediction:candidate · noneconsensus · none
13
citations
affno abstractunlabeled
On the g-extra connectivity of augmented cubes
Eddie Cheng, László Lipták, Ke Qiu, Zhizhang Shen, Abhishek Vangipuram
2023· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
13
citations
afffundno abstractunlabeled
On hardness of several string indexing problems
Kasper Green Larsen, J. Ian Munro, Jesper Sindahl Nielsen, Sharma V. Thankachan
2015· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
13
citations
affno abstractunlabeled
Progressive solutions to a parallel automata equation
Khaled El‐Fakih, Nina Yevtushenko, Sergey Buffalov, Gregor von Bochmann
2006· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
13
citations
afffundno abstractunlabeled
The Magnus–Derek game
Zhivko Nedev, S. Muthukrishnan
2007· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
13
citations
afffundno abstractunlabeled
Partitioned probe comparability graphs
David B. Chandler, Maw‐Shang Chang, Ton Kloks, Jiping Liu, Sheng‐Lung Peng
2008· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
13
citations
affno abstractunlabeled
Swapping colored tokens on graphs
Katsuhisa Yamanaka, Takashi Horiyama, Julian Keil, David Kirkpatrick, Yota Otachi, Toshiki Saitoh +2 more
2018· article· en· Theoretical Computer Science· Biochemistry, Genetics and Molecular Biology
machine prediction:candidate · noneconsensus · none
13
citations
affno abstractunlabeled
Uniqueness logic
Dana Harrington
2005· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
13
citations
13
citations
affno abstractunlabeled
Simplifying the weft hierarchy
Jonathan F. Buss, Tarique Islam
2005· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
12
citations
affno abstractunlabeled
Prime normal form and equivalence of simple grammars
Cédric Bastien, Jurek Czyzowicz, Wojciech Frączak, Wojciech Rytter
2006· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
12
citations
affno abstractunlabeled
Palindrome recognition using a multidimensional tape
Thérèse Biedl, Jonathan F. Buss, Erik D. Demaine, Martin L. Demaine, MohammadTaghi Hajiaghayi, Tomáš Vinař
2003· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
12
citations
afffundno abstractunlabeled
Interactive proofs with quantum finite automata
Harumichi Nishimura, Tomoyuki Yamakami
2014· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
12
citations
affno abstractunlabeled
Semantic distance between specifications
Rym Mili, Jules Desharnais, Marc Frappier, Ali Mili
2000· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
12
citations
affno abstractunlabeled
Error-detecting properties of languages
Stavros Konstantinidis, Amber O'Hearn
2002· article· en· Theoretical Computer Science· Biochemistry, Genetics and Molecular Biology
machine prediction:candidate · noneconsensus · none
12
citations
affno abstractunlabeled
On stabilizers of infinite words
Dalia Krieger
2008· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
12
citations
affno abstractunlabeled
A general framework for searching on a line
Prosenjit Bose, Jean-Lou De Carufel
2017· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
11
citations

How this was built: Screen · Findings · About