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
Year range
→
Sort
Language
Type
Field
Venue
Topic
Algorithms and Data Compression
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.

1,336 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.
1,336 works in the cohort · of 4,299,418page 8 of 27

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

affno abstractunlabeled
Generating Combinations by Prefix Shifts
2005· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
12
citations
affunlabeled
Textual image compression
2003· article· en· Computer Science
distilled prediction:candidate · noneconsensus · none
12
citations
affunlabeled
Compressing Pattern Databases with Learning
2008· book-chapter· en· Frontiers in artificial intelligence and applications· Computer Science
distilled prediction:candidate · noneconsensus · none
11
citations
afffundno abstractunlabeled
Reconstructing a string from its Lyndon arrays
2017· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · sts+scholarly_communication+open_scienceconsensus · none
11
citations
affunlabeled
WORD COMPLEXITY AND REPETITIONS IN WORDS
2004· article· en· International Journal of Foundations of Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
11
citations
affno abstractunlabeled
Algorithms and Data Structures
2011· book· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrow+open_scienceconsensus · open_science
11
citations
affunlabeled
THE STRUCTURE OF FACTOR ORACLES
2007· article· en· International Journal of Foundations of Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
10
citations
afffundno abstractunlabeled
The complexity of string partitioning
2014· article· en· Journal of Discrete Algorithms· Computer Science
distilled prediction:candidate · noneconsensus · none
10
citations
affno abstractunlabeled
Dynamic Shannon Coding
2004· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
10
citations
← previousnext →

How this was built: Screen · Findings · About