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 ·
Categories
Machine labels · sparse coverage
Evidence
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 5 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
Enhanced string covering
2013· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
24
citations
afffundno abstractunlabeled
Computing the Longest Previous Factor
2012· article· en· European Journal of Combinatorics· Computer Science
distilled prediction:candidate · noneconsensus · none
23
citations
affno abstractunlabeled
A new tree inclusion algorithm
2006· article· en· Information Processing Letters· Computer Science
distilled prediction:candidate · noneconsensus · none
23
citations
afffundunlabeled
Closest string with outliers
2011· article· en· BMC Bioinformatics· Computer Science
distilled prediction:candidate · noneconsensus · none
22
citations
affunlabeled
Time-Optimal Top-$k$ Document Retrieval
2017· article· en· SIAM Journal on Computing· Computer Science
distilled prediction:candidate · sts+scholarly_communicationconsensus · none
22
citations
affno abstractunlabeled
String matching with alphabet sampling
2010· article· en· Journal of Discrete Algorithms· Computer Science
distilled prediction:candidate · noneconsensus · none
21
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
afffundunlabeled
PFP Compressed Suffix Trees
2021· article· en· Society for Industrial and Applied Mathematics eBooks· Computer Science
distilled prediction:candidate · noneconsensus · none
20
citations
← previousnext →

How this was built: Screen · Findings · About