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
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 1 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.

affunlabeled
Array programming with NumPy
2020· review· en· TUScholarShare (Temple University)· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
18,805
citations
affno abstractunlabeled
On spaced seeds for similarity search
2003· article· en· Discrete Applied Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
142
citations
affno abstractunlabeled
Finding Similar Regions in Many Sequences
2002· article· en· Journal of Computer and System Sciences· Computer Science
distilled prediction:candidate · noneconsensus · none
139
citations
affunlabeled
Multi-Exemplar Affinity Propagation
2013· article· en· IEEE Transactions on Pattern Analysis and Machine Intelligence· Computer Science
distilled prediction:candidate · noneconsensus · none
122
citations
affunlabeled
Single parity check product codes
2001· article· en· IEEE Transactions on Communications· Computer Science
distilled prediction:candidate · noneconsensus · none
110
citations
affno abstractunlabeled
Space Efficient Suffix Trees
2001· article· en· Journal of Algorithms· Computer Science
distilled prediction:candidate · noneconsensus · none
103
citations
afffundunlabeled
A compression algorithm for DNA sequences
2001· article· en· IEEE Engineering in Medicine and Biology Magazine· Computer Science
distilled prediction:candidate · noneconsensus · none
93
citations
affno abstractunlabeled
Cuckoo hashing: Further analysis
2003· article· en· Information Processing Letters· Computer Science
distilled prediction:candidate · noneconsensus · none
89
citations
affunlabeled
Rank/select operations on large alphabets
2006· article· en· Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
86
citations

How this was built: Screen · Findings · About