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 8 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
Finding hidden independent sets in interval graphs
Thérèse Biedl, Broňa Brejová, Erik D. Demaine, Angèle M. Hamel, Alejandro López-Ortíz, Tomáš Vinař
2003· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
11
citations
afffundno abstractunlabeled
On store languages of language acceptors
Óscar H. Ibarra, Ian McQuillan
2018· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · stsconsensus · none
11
citations
fundno affno abstractunlabeled
On the expressivity of time-varying graphs
Arnaud Casteigts, Paola Flocchini, Emmanuel Godard, Nicola Santoro, Masafumi Yamashita
2015· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
11
citations
affno abstractunlabeled
Multi-target ray searching problems
Spyros Angelopoulos, Alejandro López-Ortíz, Κωνσταντίνος Παναγιώτου
2014· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
11
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
distilled prediction:candidate · sts+scholarly_communicationconsensus · none
11
citations
affno abstractunlabeled
Fighting constrained fires in graphs
Anthony Bonato, Margaret-Ellen Messinger, Paweł Prałat
2012· article· en· Theoretical Computer Science· Physics and Astronomy
distilled prediction:candidate · noneconsensus · none
11
citations
afffundno abstractunlabeled
Monotonicity in digraph search problems
Boting Yang, Yi Cao
2008· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · stsconsensus · none
10
citations
affno abstractunlabeled
The within-strip discrete unit disk cover problem
Robert Fraser, Alejandro López-Ortíz
2017· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · sts+scholarly_communicationconsensus · sts
10
citations
afffundno abstractunlabeled
The optimal capture time of the one-cop-moves game
Boting Yang, William Hamilton
2015· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · sts+open_scienceconsensus · none
10
citations
affno abstractunlabeled
Restriction categories as enriched categories
Robin Cockett, Richard Garner
2013· article· en· Theoretical Computer Science· Mathematics
distilled prediction:candidate · sts+insufficient_payloadconsensus · none
10
citations
affno abstractunlabeled
Packing arrays
Brett Stevens, Eric Mendelsohn
2004· article· en· Theoretical Computer Science· Engineering
distilled prediction:candidate · noneconsensus · none
10
citations
affno abstractunlabeled
Another proof of Soittola’s theorem
Jean Berstel, Christophe Reutenauer
2007· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · stsconsensus · none
10
citations
affno abstractunlabeled
More efficient periodic traversal in anonymous undirected graphs
Jurek Czyzowicz, Stefan Dobrev, Leszek Gąsieniec, David Ilcinkas, Jesper Jansson, Ralf Klasing +4 more
2012· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
10
citations
afffundno abstractunlabeled
The Beachcombers' Problem: Walking and searching with mobile robots
Jurek Czyzowicz, Leszek Gąsieniec, Konstantinos Georgiou, Evangelos Kranakis, Fraser MacQuarrie
2015· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · sts+scholarly_communicationconsensus · none
10
citations
afffundno abstractunlabeled
Local 7-coloring for planar subgraphs of unit disk graphs
Jurek Czyzowicz, Stefan Dobrev, Hernàn González-Aguilar, Evangelos Kranakis, Josef Opatrný, Ladislav Stacho +1 more
2010· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · stsconsensus · none
10
citations
affno abstractunlabeled
On two-sided infinite fixed points of morphisms
Jeffrey Shallit, Ming‐Wei Wang
2002· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
10
citations
affno abstractunlabeled
Causality in physics and computation
Prakash Panangaden
2014· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
9
citations
affno abstractunlabeled
Periodicity, morphisms, and matrices
Sabin Cautis, Filippo Mignosi, Jeffrey Shallit, Ming‐Wei Wang, Soroosh Yazdani
2003· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
9
citations
affno abstractunlabeled
Games on triangulations
Oswin Aichholzer, David Avis, Erik D. Demaine, Ferrán Hurtado, Evangelos Kranakis, Hannes Krasser +3 more
2005· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · insufficient_payloadconsensus · none
9
citations
affno abstractunlabeled
Equations on palindromes and circular words
Alexandre Blondin Massé, Srečko Brlek, A. Garon, Sebastien Labbé
2010· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
9
citations
afffundno abstractunlabeled
Generating bracelets with fixed content
Saira Karim, Joe Sawada, Zareen Alamgir, Syed Muhammad Husnine
2012· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
9
citations
afffundno abstractunlabeled
Euclidean chains and their shortcuts
Boting Yang
2012· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
9
citations
affno abstractunlabeled
Codes defined by multiple sets of trajectories
Michael Domaratzki, Kai Salomaa
2006· article· en· Theoretical Computer Science· Biochemistry, Genetics and Molecular Biology
distilled prediction:candidate · noneconsensus · none
9
citations
affno abstractunlabeled
The worst case behavior of randomized gossip protocols
Hervé Baumann, Pierre Fraigniaud, Hovhannes A. Harutyunyan, Rémi de Joannis de Verclos
2014· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · stsconsensus · none
9
citations

How this was built: Screen · Findings · About