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
International Journal of Foundations of 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.

182 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.
182 works in the cohort · of 4,299,418page 2 of 4

Labels cover 0 of 182 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 182 of 182 works in this cohort. Predictions are machine_predicted_unvalidated teacher distillation outputs. Candidate is the union; consensus is the intersection.

affunlabeled
FINDING SMALLEST SUPERTREES UNDER MINOR CONTAINMENT
Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos
2000· article· en· International Journal of Foundations of Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
13
citations
affunlabeled
AUTOMATIC THEOREM-PROVING IN COMBINATORICS ON WORDS
Daniel Goč, Dane Henshall, JEFFREY SHALLIT
2013· article· en· International Journal of Foundations of Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
13
citations
affunlabeled
FAST BROADCASTING WITH BYZANTINE FAULTS
Michel Paquette, Andrzej Pelc
2006· article· en· International Journal of Foundations of Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
11
citations
affunlabeled
WORD COMPLEXITY AND REPETITIONS IN WORDS
Lucian Ilie, Sheng Yü, Kaizhong Zhang
2004· article· en· International Journal of Foundations of Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
11
citations
affunlabeled
ABELIAN PRIMITIVE WORDS
Michael Domaratzki, Narad Rampersad
2012· article· en· International Journal of Foundations of Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
11
citations
affunlabeled
AVOIDING APPROXIMATE SQUARES
Pascal Ochem, Narad Rampersad, Jeffrey Shallit
2008· article· en· International Journal of Foundations of Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
11
citations
affunlabeled
Large Aperiodic Semigroups
Janusz Brzozowski, Marek Szykuła
2015· article· en· International Journal of Foundations of Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
10
citations
affunlabeled
THE STRUCTURE OF FACTOR ORACLES
Maxime Crochemore, Lucian Ilie, Emine Seid-Hilmi
2007· article· en· International Journal of Foundations of Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
10
citations
affunlabeled
ON SPANNERS OF GEOMETRIC GRAPHS
Joachim Gudmundsson, Michiel Smid
2009· article· en· International Journal of Foundations of Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
9
citations
afffundunlabeled
RECONSTRUCTING A SUFFIX ARRAY
František Franěk, William F. Smyth
2006· article· en· International Journal of Foundations of Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
9
citations
afffundunlabeled
<font>L</font>-SYSTEMS IN GEOMETRIC MODELING
Przemysław Prusinkiewicz, Mitra Shirmohammadi, Faramarz Samavati
2012· article· en· International Journal of Foundations of Computer Science· Engineering
distilled prediction:candidate · noneconsensus · none
8
citations
affunlabeled
SHUFFLE DECOMPOSITIONS OF REGULAR LANGUAGES
Cezar Câmpeanu, Kai Salomaa, Sándor Vágvölgyi
2002· article· en· International Journal of Foundations of Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
8
citations
affunlabeled
UNAMBIGUOUS CONSTRAINED AUTOMATA
Michaël Cadilhac, Alain Finkel, Pierre McKenzie
2013· article· en· International Journal of Foundations of Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
8
citations
affunlabeled
IDENTIFYING RHYTHMS IN MUSICAL TEXTS
Manolis Christodoulakis, Costas S. Iliopoulos, M. Sohel Rahman, William F. Smyth
2008· article· en· International Journal of Foundations of Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
8
citations
afffundunlabeled
Deterministic Rendezvous with Detection Using Beeps
Samir Elouasbi, Andrzej Pelc
2017· article· en· International Journal of Foundations of Computer Science· Computer Science
distilled prediction:candidate · scholarly_communicationconsensus · none
7
citations
affunlabeled
State Complexity of Insertion
Yo-Sub Han, Sang‐Ki Ko, Timothy Ng, Kai Salomaa
2016· article· en· International Journal of Foundations of Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
7
citations
affunlabeled
On the Density of Context-Free and Counter Languages
Joseph Eremondi, Óscar H. Ibarra, Ian McQuillan
2018· article· en· International Journal of Foundations of Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
7
citations
affunlabeled
Fast Algorithms for Diameter-Optimally Augmenting Paths and Trees
Ulrike Große, Christian Knauer, Fabian Stehn, Joachim Gudmundsson, Michiel Smid
2019· preprint· en· International Journal of Foundations of Computer Science· Computer Science
distilled prediction:candidate · scholarly_communicationconsensus · none
7
citations
afffundunlabeled
WATSON-CRICK BORDERED WORDS AND THEIR SYNTACTIC MONOID
Lila Kari, Kalpana Mahalingam
2008· article· en· International Journal of Foundations of Computer Science· Biochemistry, Genetics and Molecular Biology
distilled prediction:candidate · noneconsensus · none
7
citations
affunlabeled
INTRA-MOLECULAR TEMPLATE-GUIDED RECOMBINATION
Mark Daley, Michael Domaratzki, ALEXIS MORRIS
2007· article· en· International Journal of Foundations of Computer Science· Biochemistry, Genetics and Molecular Biology
distilled prediction:candidate · noneconsensus · none
6
citations
affunlabeled
NON-UNIQUENESS AND RADIUS OF CYCLIC UNARY NFAs
Michael Domaratzki, Keith Ellul, JEFFREY SHALLIT, Ming‐Wei Wang
2005· article· en· International Journal of Foundations of Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
6
citations
affunlabeled
Space Complexity of Stack Automata Models
Óscar H. Ibarra, Jozef Jirásek, Ian McQuillan, Luca Prigioniero
2021· article· en· International Journal of Foundations of Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
5
citations
affunlabeled
DE BRUIJN SEQUENCES REVISITED
Lila Kari, Zhi Xu
2012· article· en· International Journal of Foundations of Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
5
citations
affunlabeled
Semilinearity of Families of Languages
Óscar H. Ibarra, Ian McQuillan
2020· article· en· International Journal of Foundations of Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
5
citations
affunlabeled
ON THE EXISTENCE OF LOOKAHEAD DELEGATORS FOR NFA
Bala Ravikumar, Nicolae Sântean
2007· article· en· International Journal of Foundations of Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
4
citations
affunlabeled
STATE COMPLEXITY AND APPROXIMATION
Yuan Gao, Sheng Yü
2012· article· en· International Journal of Foundations of Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
4
citations
affunlabeled
STATE-SIZE HIERARCHY FOR FINITE-STATE COMPLEXITY
Cristian S. Calude, Kai Salomaa, Tania Roblot
2012· article· en· International Journal of Foundations of Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
4
citations
affunlabeled
APPROXIMATION ALGORITHMS FOR BUY-AT-BULK GEOMETRIC NETWORK DESIGN
Artur Czumaj, Jurek Czyzowicz, Leszek Gąsieniec, Jesper Jansson, Andrzej Lingas, Paweł Żyliński
2011· article· en· International Journal of Foundations of Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
4
citations

How this was built: Screen · Findings · About