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 ·
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 18 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
Encoding Quadrilateral Meshes in 2.40 bits per Vertex.
2004· article· en· Indian Conference on Computer Vision, Graphics and Image Processing· Computer Science
distilled prediction:candidate · metaepi_narrow+scholarly_communicationconsensus · none
1
citations
affunlabeled
FORMAL MODELLING OF VIRAL GENE COMPRESSION
2005· article· en· International Journal of Foundations of Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
1
citations
affunlabeled
AmpliconTagger pipeline databases
2019· dataset· en· Zenodo (CERN European Organization for Nuclear Research)· Computer Science
distilled prediction:candidate · metaepi_narrow+sts+scholarly_communication+open_science+insufficient_payloadconsensus · insufficient_payload
1
citations
affno abstractunlabeled
Non-repetitive Strings over Alphabet Lists
2015· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
1
citations
affno abstractunlabeled
On Suffix Tree Detection
2023· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
1
citations
affunlabeled
Pseudopower Avoidance
2012· preprint· en· Fundamenta Informaticae· Computer Science
distilled prediction:candidate · metaepi_narrow+insufficient_payloadconsensus · none
1
citations
affno abstractunlabeled
Google and the Page Rank Algorithm
2008· book-chapter· en· Springer undergraduate texts in mathematics and technology· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
1
citations
afffundunlabeled
Two-way Linear Probing Revisited
2023· preprint· en· Preprints.org· Computer Science
distilled prediction:candidate · metaepi_narrow+open_science+insufficient_payloadconsensus · none
1
citations
affno abstractunlabeled
Multidimensional Range Selection
2015· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
1
citations
affno abstractunlabeled
Hierarchy Encoding with Multiple Genes
2008· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
1
citations
afffundno abstractunlabeled
Bumpless pipe dreams meet puzzles
2025· article· en· Advances in Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
1
citations
affunlabeled
Loop Free Generation of<i>K</i>-Ary Trees
2000· article· en· American Journal of Mathematical and Management Sciences· Computer Science
distilled prediction:candidate · noneconsensus · none
1
citations
venueno affno abstractunlabeled
Path Spectra and Forbidden Families.
2001· article· en· Ars Combinatoria· Computer Science
distilled prediction:candidate · noneconsensus · none
1
citations
affunlabeled
Copy number variation
2009· article· en· ˜The œbiomedical & life sciences collection.· Computer Science
distilled prediction:candidate · stsconsensus · none
1
citations
affunlabeled
Simple Balanced Binary Search Trees
2014· article· en· Electronic Proceedings in Theoretical Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
1
citations
affunlabeled
Introduction to the SK model
2014· preprint· en· Current Developments in Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
1
citations

How this was built: Screen · Findings · About