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 1 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
ON THE CLIQUE-WIDTH OF SOME PERFECT GRAPH CLASSES
Martin Charles Golumbic, Udi Rotics
2000· article· en· International Journal of Foundations of Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
231
citations
affunlabeled
ON THE PALINDROMIC COMPLEXITY OF INFINITE WORDS
Srečko Brlek, Sylvie Hamel, Maurice Nivat, Christophe Reutenauer
2004· article· en· International Journal of Foundations of Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
106
citations
affunlabeled
A FORMAL STUDY OF PRACTICAL REGULAR EXPRESSIONS
Cezar Câmpeanu, Kai Salomaa, Sheng Yü
2003· article· en· International Journal of Foundations of Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
98
citations
affunlabeled
A ZONAL ALGORITHM FOR CLUSTERING AN HOC NETWORKS
Yuanzhu Peter Chen, Arthur L. Liestman
2003· article· en· International Journal of Foundations of Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
75
citations
afffundunlabeled
UNIFORM SCATTERING OF AUTONOMOUS MOBILE ROBOTS IN A GRID
Lali Barrière, Paola Flocchini, Eduardo Mesa-Barrameda, Nicola Santoro
2011· article· en· International Journal of Foundations of Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
53
citations
affunlabeled
COMPUTING BY COMMUNICATION IN NETWORKS OF MEMBRANES
Andrei Păun, Gheorghe Pǎun, Grzegorz Rozenberg
2002· article· en· International Journal of Foundations of Computer Science· Biochemistry, Genetics and Molecular Biology
distilled prediction:candidate · noneconsensus · none
52
citations
affunlabeled
IN SEARCH OF MOST COMPLEX REGULAR LANGUAGES
Janusz Brzozowski
2013· article· en· International Journal of Foundations of Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
52
citations
affunlabeled
NETWORK DECONTAMINATION IN PRESENCE OF LOCAL IMMUNITY
Fabrizio Luccio, Linda Pagli, Nicola Santoro
2007· article· en· International Journal of Foundations of Computer Science· Engineering
distilled prediction:candidate · noneconsensus · none
34
citations
affunlabeled
VECTOR ALGORITHMS FOR APPROXIMATE STRING MATCHING
Anne Bergeron, Sylvie Hamel
2002· article· en· International Journal of Foundations of Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
29
citations
affunlabeled
QUOTIENT COMPLEXITY OF STAR-FREE LANGUAGES
Janusz Brzozowski, Bo Liu
2012· article· en· International Journal of Foundations of Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
26
citations
affunlabeled
THE AVERAGING TRICK AND THE ČERNÝ CONJECTURE
Benjamin Steinberg
2011· article· en· International Journal of Foundations of Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
26
citations
affunlabeled
LINEAR-TIME PRIME DECOMPOSITION OF REGULAR PREFIX CODES
Jurek Czyzowicz, Wojciech Frączak, Andrzej Pelc, Wojciech Rytter
2003· article· en· International Journal of Foundations of Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
23
citations
afffundunlabeled
INVOLUTIVELY BORDERED WORDS
Lila Kari, Kalpana Mahalingam
2007· article· en· International Journal of Foundations of Computer Science· Biochemistry, Genetics and Molecular Biology
distilled prediction:candidate · noneconsensus · none
23
citations
afffundunlabeled
CLOSURES IN FORMAL LANGUAGES AND KURATOWSKI'S THEOREM
Janusz Brzozowski, Elyot Grant, JEFFREY SHALLIT
2011· article· en· International Journal of Foundations of Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
21
citations
affunlabeled
A SIMPLE ALPHABET-INDEPENDENT FM-INDEX
Szymon Grabowski, Gonzalo Navarro, Rafal Przywarski, Alejandro Salinger, Veli Mäkinen
2006· article· en· International Journal of Foundations of Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
20
citations
affunlabeled
PROPERTIES OF THE CONTOUR PATH OF DISCRETE SETS
Srečko Brlek, Gilbert Labelle, Annie Lacasse
2006· article· en· International Journal of Foundations of Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
20
citations
affunlabeled
QUANTUM SOFTWARE REUSABILITY
Andreas Klappenecker, Martin Rötteler
2003· article· en· International Journal of Foundations of Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
20
citations
affunlabeled
ANALYSIS OF QUANTUM FUNCTIONS
Tomoyuki Yamakami
2003· article· en· International Journal of Foundations of Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
18
citations
affunlabeled
Rigidity and Substitutive Dendric Words
Valérie Berthé, Francesco Dolce, Fabien Durand, Julien Leroy, Dominique Perrin
2018· article· en· International Journal of Foundations of Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
18
citations
afffundunlabeled
INFORMATION DISTANCE AND ITS APPLICATIONS
Ming Li
2007· article· en· International Journal of Foundations of Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
17
citations
affunlabeled
BOUNDED PARIKH AUTOMATA
Michaël Cadilhac, Alain Finkel, Pierre McKenzie
2012· article· en· International Journal of Foundations of Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
17
citations
affunlabeled
COMPLEXITY OF ATOMS OF REGULAR LANGUAGES
Janusz Brzozowski, Hellis Tamm
2013· article· en· International Journal of Foundations of Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
17
citations
afffundunlabeled
APPROXIMATION ALGORITHMS FOR FLEXIBLE JOB SHOP PROBLEMS
Klaus Jansen, Monaldo Mastrolilli, Roberto Solis-Oba
2005· article· en· International Journal of Foundations of Computer Science· Engineering
distilled prediction:candidate · noneconsensus · none
17
citations
affunlabeled
Operations on Unambiguous Finite Automata
Jozef Jirásek, Galina Jirásková, Juraj Šebej
2018· article· en· International Journal of Foundations of Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
15
citations
affunlabeled
UNARY PATTERNS WITH INVOLUTION
Bastian Bischoff, James D. Currie, Dirk Nowotka
2012· article· en· International Journal of Foundations of Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
14
citations
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

How this was built: Screen · Findings · About