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

afffundno abstractunlabeled
Covering points with convex sets of minimum size
Sang Won Bae, Hwan-Gue Cho, William A. Evans, Noushin Saeedi, Chan-Su Shin
2016· article· en· Theoretical Computer Science· Engineering
distilled prediction:candidate · noneconsensus · none
5
citations
afffundno abstractunlabeled
Relativized codes
Mark Daley, Helmut Jürgensen, Lila Kari, Kalpana Mahalingam
2011· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · stsconsensus · none
5
citations
afffundno abstractunlabeled
Matchings in higher-order Gabriel graphs
Ahmad Biniaz, Anil Maheshwari, Michiel Smid
2015· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
5
citations
fundno affno abstractunlabeled
Effectively approximating measurable sets by open sets
Chris J. Conidis
2012· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · metaepi_narrow+scholarly_communication+open_scienceconsensus · open_science
5
citations
afffundno abstractunlabeled
Palindromization and construction of Markoff triples
Antoine Abram, Mélodie Lapointe, Christophe Reutenauer
2019· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
5
citations
affno abstractunlabeled
State complexity of unique rational operations
Narad Rampersad, Nicolae Sântean, Jeffrey Shallit, Bala Ravikumar
2009· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · stsconsensus · none
5
citations
affno abstractunlabeled
Specular sets
Valérie Berthé, Clelia De Felice, Vincent Delecroix, Francesco Dolce, Julien Leroy, Dominique Perrin +2 more
2017· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · sts+scholarly_communication+open_scienceconsensus · sts
5
citations
affno abstractunlabeled
State complexity of prefix distance
Timothy Ng, David Rappaport, Kai Salomaa
2016· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · stsconsensus · none
5
citations
afffundno abstractunlabeled
How to choose friends strategically
Lata Narayanan, Kangkang Wu
2018· article· en· Theoretical Computer Science· Physics and Astronomy
distilled prediction:candidate · noneconsensus · none
5
citations
affno abstractunlabeled
Compressed indexes for text with wildcards
Chris Thachuk
2012· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
4
citations
afffundno abstractunlabeled
Polygon simplification by minimizing convex corners
Yeganeh Bahoo, Stéphane Durocher, Julian Keil, Debajyoti Mondal, Saeed Mehrabi, Sahar Mehrpour
2019· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
4
citations
affno abstractunlabeled
Functional clones and expressibility of partition functions
Andreĭ A. Bulatov, Leslie Ann Goldberg, Mark Jerrum, David Richerby, Stanislav Živný
2017· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · stsconsensus · none
4
citations
fundno affno abstractunlabeled
On learning of functions refutably
Sanjay Jain, Efim Kinber, Rolf Wiehagen, Thomas Zeugmann
2003· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
4
citations
affno abstractunlabeled
Dynamic range majority data structures
Amr Elmasry, Meng He, J. Ian Munro, Patrick K. Nicholson
2016· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · open_scienceconsensus · open_science
4
citations
afffundno abstractunlabeled
Block insertion and deletion on trajectories
Bo Cui, Lila Kari, Shinnosuke Seki
2010· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
4
citations
affno abstractunlabeled
Self-similarity of communities of the ABCD model
Jordan Barrett, Paweł Prałat, François Théberge
2024· article· en· Theoretical Computer Science· Physics and Astronomy
distilled prediction:candidate · noneconsensus · none
4
citations
afffundno abstractunlabeled
Searching for a non-adversarial, uncooperative agent on a cycle
Jurek Czyzowicz, Stefan Dobrev, Maxime Godon, Evangelos Kranakis, Toshinori Sakai, Jorge Urrutia
2019· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
4
citations
afffundno abstractunlabeled
One-visibility cops and robber on trees
Boting Yang, Tanzina Akter
2021· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · stsconsensus · none
4
citations
afffundunlabeled
Path partitions of phylogenetic networks
Manuel Lafond, Vincent Moulton
2024· article· en· Theoretical Computer Science· Biochemistry, Genetics and Molecular Biology
distilled prediction:candidate · noneconsensus · none
4
citations
affno abstractunlabeled
<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.svg"><mml:mi mathvariant="sans-serif">NP</mml:mi></mml:math>-completeness of the game Kingdomino<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si2.svg"><mml:msup><mml:mrow/><mml:mrow><mml:mtext mathvariant="italic">TM</mml:mtext></mml:mrow></mml:msup></mml:math>
Viet-Ha Nguyen, Kévin Perrot, Mathieu Vallet
2020· article· lv· Theoretical Computer Science· Computer Science
distilled prediction:candidate · metaepi_narrow+sts+scholarly_communication+open_science+research_integrity+insufficient_payloadconsensus · metaepi_narrow+sts+open_science+research_integrity+insufficient_payload
3
citations
affno abstractunlabeled
On minimum cost edge searching
Dariusz Dereniowski, Danny Dyer
2013· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · sts+scholarly_communication+insufficient_payloadconsensus · none
3
citations

How this was built: Screen · Findings · About