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 4 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
COMPUTATION BY ANNOTATION: MODELLING EPIGENETIC REGULATION
Franziska Biegler, Mark Daley, Marjorie Elizabeth Osborn Locke
2008· article· en· International Journal of Foundations of Computer Science· Biochemistry, Genetics and Molecular Biology
distilled prediction:candidate · noneconsensus · none
0
citations
affunlabeled
State Complexity of Suffix Distance
Timothy Ng, David Rappaport, Kai Salomaa
2019· article· en· International Journal of Foundations of Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
afffundunlabeled
Repetition Factorization of Automatic Sequences
Narad Rampersad, Jeffrey Shallit, Xinhao Xu
2024· article· en· International Journal of Foundations of Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
afffundunlabeled
SORTING SUFFIXES OF TWO-PATTERN STRINGS
František Franěk, W.F. Smyth
2005· article· en· International Journal of Foundations of Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Preface
Alexandre Blondin Massé, Srečko Brlek, Christophe Reutenauer
2018· article· en· International Journal of Foundations of Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
PREFACE
Michael Domaratzki, Kai Salomaa
2008· article· en· International Journal of Foundations of Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
affunlabeled
The Intersection Problem for Finite Semigroups
Lukas Fleischer
2020· preprint· en· International Journal of Foundations of Computer Science· Computer Science
distilled prediction:candidate · scholarly_communication+open_scienceconsensus · none
0
citations
afffundunlabeled
Note on Two-Stage BP Maximization
Hong Chang, Donglei Du, Chuchu Xu, Xiaoyan Zhang
2025· article· en· International Journal of Foundations of Computer Science· Engineering
distilled prediction:candidate · noneconsensus · none
0
citations
affunlabeled
ORTHOGONAL SHUFFLE ON TRAJECTORIES
Mark Daley, Lila Kari, Shinnosuke Seki, Petr Sosı́k
2011· article· en· International Journal of Foundations of Computer Science· Biochemistry, Genetics and Molecular Biology
distilled prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Language Quotients Revisited
Stavros Konstantinidis, Nelma Moreira, Rogério Reis
2025· article· en· International Journal of Foundations of Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
afffundunlabeled
Exploration of Faulty Hamiltonian Graphs
David Caissy, Andrzej Pelc
2016· preprint· en· International Journal of Foundations of Computer Science· Computer Science
distilled prediction:candidate · open_scienceconsensus · none
0
citations
fundno affunlabeled
SORTING SIGNED PERMUTATIONS BY FIXED-LENGTH REVERSALS
Xingqin Qi, Guojun Li, Jichang Wu, Bingqiang Liu
2006· article· en· International Journal of Foundations of Computer Science· Biochemistry, Genetics and Molecular Biology
distilled prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
PREFACE
Helmut Jürgensen, Rogério Reis
2014· article· en· International Journal of Foundations of Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
PREFACE
Kai Salomaa, Sheng Yü
2005· article· en· International Journal of Foundations of Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
affunlabeled
SOLITON LANGUAGES ARE NEARLY AN ANTI-AFL
Oliver Boldt, Helmut Jürgensen
2007· article· en· International Journal of Foundations of Computer Science· Engineering
distilled prediction:candidate · noneconsensus · none
0
citations
affunlabeled
MULTIPSEUDOPERIODIC WORDS
Alexandre Blondin Massé, SARAH DESMEULES, Sébastien Gaboury, Sylvain Hallé
2013· article· en· International Journal of Foundations of Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Search on a Line by Byzantine Robots
Jurek Czyzowicz, Konstantinos Georgiou, Evangelos Kranakis, Danny Kriz̧anc, Lata Narayanan, Jaroslav Opatrný +1 more
2021· preprint· en· International Journal of Foundations of Computer Science· Computer Science
distilled prediction:candidate · scholarly_communication+open_scienceconsensus · none
0
citations
afffundunlabeled
Tight Bounds for Restricted Grid Scheduling
Joan Boyar, Faith Ellen
2019· article· en· International Journal of Foundations of Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
afffundunlabeled
Branching Measures and Nearly Acyclic NFAs
Chris Keeler, Kai Salomaa
2019· article· en· International Journal of Foundations of Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations

How this was built: Screen · Findings · About