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
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
IN SEARCH OF MOST COMPLEX REGULAR LANGUAGES
2013· article· en· International Journal of Foundations of Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
52
citations
affunlabeled
QUOTIENT COMPLEXITY OF STAR-FREE LANGUAGES
2012· article· en· International Journal of Foundations of Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
26
citations
afffundunlabeled
INVOLUTIVELY BORDERED WORDS
2007· article· en· International Journal of Foundations of Computer Science· Biochemistry, Genetics and Molecular Biology
distilled prediction:candidate · noneconsensus · none
23
citations
affunlabeled
A SIMPLE ALPHABET-INDEPENDENT FM-INDEX
2006· article· en· International Journal of Foundations of Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
20
citations
affunlabeled
QUANTUM SOFTWARE REUSABILITY
2003· article· en· International Journal of Foundations of Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
20
citations
affunlabeled
ANALYSIS OF QUANTUM FUNCTIONS
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
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
2007· article· en· International Journal of Foundations of Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
17
citations
affunlabeled
BOUNDED PARIKH AUTOMATA
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
2013· article· en· International Journal of Foundations of Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
17
citations
affunlabeled
Operations on Unambiguous Finite Automata
2018· article· en· International Journal of Foundations of Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
15
citations
affunlabeled
UNARY PATTERNS WITH INVOLUTION
2012· article· en· International Journal of Foundations of Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
14
citations

How this was built: Screen · Findings · About