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 12 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 teacher distillation outputs. Candidate is the union; consensus is the intersection.

affno abstractunlabeled
Finding modes with equality comparisons
J. Ian Munro, Venkatesh Raman, Srinivas Rao Satti
2017· article· en· Theoretical Computer Science· Mathematics
distilled prediction:candidate · stsconsensus · sts
3
citations
affno abstractunlabeled
Analysis of set-up time models: A metric perspective
Eitan Bachmat, Tao Kai Lam, Avner Magen
2008· article· en· Theoretical Computer Science· Business, Management and Accounting
distilled prediction:candidate · stsconsensus · none
3
citations
afffundno abstractunlabeled
Hyperopic Cops and Robbers
Anthony Bonato, Nancy E. Clarke, Danielle Cox, Stephen Finbow, Fionn Mc Inerney, Margaret-Ellen Messinger
2018· article· en· Theoretical Computer Science· Decision Sciences
distilled prediction:candidate · sts+insufficient_payloadconsensus · none
3
citations
affno abstractunlabeled
Preface
Paola Flocchini, Leszek Gąsieniec
2008· article· en· Theoretical Computer Science
distilled prediction:candidate · sts+insufficient_payloadconsensus · none
3
citations
afffundno abstractunlabeled
Brushing with additional cleaning restrictions
Piotr Borowiecki, Dariusz Dereniowski, Paweł Prałat
2014· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
3
citations
affno abstractunlabeled
Automata of asynchronous behaviors
Janusz Brzozowski, R. Negulescu
2000· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · stsconsensus · none
3
citations
affno abstractunlabeled
Unary patterns under permutations
James D. Currie, Florín Manea, Dirk Nowotka, Kamellia Reshadi
2018· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · stsconsensus · none
3
citations
afffundno abstractunlabeled
Smoothed heights of tries and patricia tries
Weitian Tong, Randy Goebel, Guohui Lin
2015· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · stsconsensus · none
3
citations
affno abstractunlabeled
Width versus size in resolution proofs
2007· article· en· Theoretical Computer Science· Arts and Humanities
distilled prediction:candidate · stsconsensus · none
3
citations
afffundno abstractunlabeled
On the teaching complexity of linear sets
Ziyuan Gao, Hans Ulrich Simon, Sandra Zilles
2017· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · sts+open_scienceconsensus · sts
3
citations
afffundunlabeled
Vertex-critical graphs in co-gem-free graphs
Iain Beaton, Ben Cameron
2025· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · metaepi_narrow+sts+open_scienceconsensus · none
3
citations
afffundno abstractunlabeled
Canonical forms of uptimals
Neil A. McKay
2011· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · stsconsensus · none
3
citations
affno abstractunlabeled
Maximal unbordered factors of random strings
Patrick Hagge Cording, Travis Gagie, Mathias Bæk Tejs Knudsen, Tomasz Kociumaka
2020· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
3
citations
afffundno abstractunlabeled
Properties of a class of Toeplitz words
Gabriele Fici, Jeffrey Shallit
2022· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
2
citations
affno abstractunlabeled
Compressed depth sequences
Travis Gagie
2008· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · stsconsensus · none
2
citations
afffundno abstractunlabeled
State complexity of inversion operations
Da-Jung Cho, Yo-Sub Han, Sang‐Ki Ko, Kai Salomaa
2015· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · stsconsensus · none
2
citations
afffundno abstractunlabeled
Excuse me! or the courteous theatregoers' problem
Konstantinos Georgiou, Evangelos Kranakis, Danny Kriz̧anc
2015· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
2
citations
afffundno abstractunlabeled
Permuted scaled matching
Ayelet Butman, Noa Lewenstein, J. Ian Munro
2016· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
2
citations
affno abstractunlabeled
Path queries on functions
Travis Gagie, Meng He, Gonzalo Navarro
2018· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · sts+insufficient_payloadconsensus · none
2
citations
affno abstractunlabeled
Price of asynchrony in mobile agents computing
Yoann Dieudonné, Andrzej Pelc
2014· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
2
citations
afffundno abstractunlabeled
Document retrieval with one wildcard
Moshe Lewenstein, J. Ian Munro, Yakov Nekrich, Sharma V. Thankachan
2016· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
2
citations
affno abstractunlabeled
The weighted k-center problem in trees for fixed k
Binay Bhattacharya, Sandip Das, Subhadeep Ranjan Dev
2022· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · sts+open_scienceconsensus · none
2
citations

How this was built: Screen · Findings · About