MétaCan
ENFR
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.

Export CSVExport JSONAPI query

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 3 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
OVERLAP-FREE LANGUAGES AND SOLID CODES
Yo-Sub Han, Kai Salomaa
2011· article· en· International Journal of Foundations of Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
4
citations
affunlabeled
Interconnection Networks and Their Eigenvalues
Ke Qiu, Sajal K. Das
2003· article· en· International Journal of Foundations of Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
4
citations
afffundunlabeled
Most Complex Non-Returning Regular Languages
Janusz Brzozowski, Sylvie Davies
2019· preprint· en· International Journal of Foundations of Computer Science· Computer Science
distilled prediction:candidate · open_scienceconsensus · none
4
citations
afffundunlabeled
Generalizations of Code Languages with Marginal Errors
Sang‐Ki Ko, Yo-Sub Han, Kai Salomaa
2021· article· en· International Journal of Foundations of Computer Science· Biochemistry, Genetics and Molecular Biology
distilled prediction:candidate · noneconsensus · none
3
citations
affunlabeled
Automatic Sets of Rational Numbers
2015· article· en· International Journal of Foundations of Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
3
citations
affunlabeled
CONSTRUCTING RED-BLACK TREE SHAPES
Andrea Mantler, Helen Cameron
2002· article· en· International Journal of Foundations of Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
3
citations
fundno affunlabeled
A DYNAMICS RECOMMENDATION SYSTEM BASED ON LOG MINING
Wen Gao, Shi Wang, Bin Liu
2002· article· en· International Journal of Foundations of Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
3
citations
affunlabeled
QUANTUM COMPUTATION WITH RESTRICTED AMPLITUDES
Harumichi Nishimura
2003· article· en· International Journal of Foundations of Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
2
citations
afffundunlabeled
COMPLEXITY, INFORMATION, ENERGY
Helmut Jürgensen
2008· article· en· International Journal of Foundations of Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
2
citations
affunlabeled
Counting, Generating, Analyzing and Sampling Tree Alignments
Cédric Chauve, Julien Courtiel, Yann Ponty
2018· article· en· International Journal of Foundations of Computer Science· Biochemistry, Genetics and Molecular Biology
distilled prediction:candidate · noneconsensus · none
2
citations
afffundunlabeled
SOLITON AUTOMATA BASED ON TREES
Helmut Jürgensen, PAULINE KRAAK
2007· article· en· International Journal of Foundations of Computer Science· Engineering
distilled prediction:candidate · noneconsensus · none
1
citations
affunlabeled
Remarks on Privileged Words
Michael Forsyth, Amlesh Jayakumar
2016· preprint· en· International Journal of Foundations of Computer Science· Computer Science
distilled prediction:candidate · open_scienceconsensus · none
1
citations
fundno affunlabeled
EFFICIENT PARALLEL JOB SCHEDULING USING GANG SERVICE
Fabrício Alves Barbosa da Silva, Isaac D. Scherson
2001· article· en· International Journal of Foundations of Computer Science· Engineering
distilled prediction:candidate · noneconsensus · none
1
citations
affunlabeled
An Inequality for the Number of Periods in a Word
Daniel Gabrić, Narad Rampersad, Jeffrey Shallit
2021· preprint· en· International Journal of Foundations of Computer Science· Computer Science
distilled prediction:candidate · open_scienceconsensus · none
1
citations
affunlabeled
FORMAL MODELLING OF VIRAL GENE COMPRESSION
Mark Daley, Ian McQuillan
2005· article· en· International Journal of Foundations of Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
1
citations
affunlabeled
QUANTUM OCTAL GAMES
Sylvain Gravier, Philippe Jorrand, Mehdi Mhalla, Charles Payan
2006· article· en· International Journal of Foundations of Computer Science· Physics and Astronomy
distilled prediction:candidate · noneconsensus · none
1
citations
affunlabeled
CHANNEL SYNTHESIS FOR FINITE TRANSDUCERS
Gilles Benattar, Béatrice Bérard, Didier Lime, John Mullins, Olivier Roux, Mathieu Sassolas
2012· article· en· International Journal of Foundations of Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
1
citations
affunlabeled
SC-EXPRESSIONS IN OBJECT-ORIENTED LANGUAGES
Sheng Yü, Qing Zhao
2007· article· en· International Journal of Foundations of Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
afffundunlabeled
Cobham’s Theorem and Automaticity
Lucas Mol, Narad Rampersad, Jeffrey Shallit, Manon Stipulanti
2019· preprint· en· International Journal of Foundations of Computer Science· Computer Science
distilled prediction:candidate · open_scienceconsensus · none
0
citations
affunlabeled
Efficiently Enumerating Spanning Trees of <i>k</i> -Trees
Muhammad Nur Yanhaona, Rahnuma Islam Nishat, Md. Saidur Rahman
2025· article· en· International Journal of Foundations of Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
← previousnext →

How this was built: Screen · Findings · About