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
Author
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 25 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
A model of language inflection graphs
Henryk Fukś, Babak Farzad, Yi Cao
2015· preprint· en· arXiv (Cornell University)· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Refining the r-index
Hideo Bannai, Travis Gagie, I Tomohiro
2019· preprint· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · scholarly_communication+open_scienceconsensus · open_science
0
citations
aboutno affunlabeled
HSI Model
2018· other· en· OSF Preprints (OSF Preprints)· Computer Science
distilled prediction:candidate · metaepi_narrow+open_science+insufficient_payloadconsensus · open_science+insufficient_payload
0
citations
aboutno affunlabeled
Indexing Textual Information
Ioannis Kouris, Christos Makris, Evangelos Theodoridis, Athanasios Tsakalidis
2009· book-chapter· en· IGI Global eBooks· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
0
citations
fundno affunlabeled
Compressing Suffix Trees by Path Decompositions
Ruben Becker, Davide Cenzato, Travis Gagie, Sunghwan Kim, Ragnar Groot Koerkamp, Giovanni Manzini +1 more
2025· preprint· en· ArXiv.org· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
0
citations
affunlabeled
A model of language inflection graphs
Henryk Fukś, Babak Farzad, Yi Cao
2013· article· en· International Journal of Modern Physics C· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
aboutno affunlabeled
16S Sequences
Isabelle Laforest‐Lapointe
2017· dataset· en· Figshare· Computer Science
distilled prediction:candidate · insufficient_payloadconsensus · insufficient_payload
0
citations
affunlabeled
Efficient dynamic range minimum query
Maxime Crochemore, Laurent Mouchard, Mikaël Salson, Bill Smyth
2010· preprint· en· Murdoch Research Repository (Murdoch University)· Computer Science
distilled prediction:candidate · metaepi_narrow+sts+scholarly_communication+open_science+research_integrityconsensus · open_science
0
citations
aboutno affunlabeled
Libro del XIV Congreso Nacional de Ciencia y Tecnología - APANAC 2023
2023· article· es· Congresos CLABES Conferencia Latinoamericana sobre el ABandono de la Educación Superior (Universidad Tecnológica de Panamá)· Computer Science
distilled prediction:candidate · metaepi_narrow+sts+scholarly_communication+research_integrity+insufficient_payloadconsensus · metaepi_narrow+sts+research_integrity+insufficient_payload
0
citations
venueno affno abstractunlabeled
P m U P k -equipackable paths and cycles.
Liandi Zhang, Yanfei Wang, Yuqin Zhang
2017· article· ca· Ars Combinatoria· Computer Science
distilled prediction:candidate · metaepi_narrow+sts+scholarly_communicationconsensus · none
0
citations
affunlabeled
Recovery from Non-Decomposable Distance Oracles
Zhuangfei Hu, Xinda Li, David P. Woodruff, Change Institutions to: University of Waterloo, Shufan Zhang
2022· preprint· en· arXiv (Cornell University)· Computer Science
distilled prediction:candidate · metaepi_narrow+open_scienceconsensus · none
0
citations
affno abstractunlabeled
More Complex Rules
Henryk Fukś
2023· book-chapter· en· Understanding complex systems· Computer Science
distilled prediction:candidate · metaepi_narrow+insufficient_payloadconsensus · none
0
citations
aboutno affno abstractunlabeled
Queen Victoria's cabin, H.M. yacht Alberta
2009· other· en· Open Research Exeter (University of Exeter)· Computer Science
distilled prediction:candidate · metaepi_narrow+open_science+insufficient_payloadconsensus · insufficient_payload
0
citations
affno abstractunlabeled
On suffix tree detection
Amihood Amir, Eitan Kondratovsky, Avivit Levy
2024· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · scholarly_communicationconsensus · none
0
citations
affunlabeled
Distance-Preserving Graph Compression Techniques
Amirali Madani, Anil Maheshwari
2024· article· en· Journal of Graph Algorithms and Applications· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Compressed Data Structures for Dynamic Sequences
J. Ian Munro, Yakov Nekrich
2015· preprint· en· arXiv (Cornell University)· Computer Science
distilled prediction:candidate · metaepi_narrow+open_scienceconsensus · open_science
0
citations
aboutno affunlabeled
2003 CCHS Dataset and Codeset
Jamie Moeller
2017· dataset· en· Figshare· Computer Science
distilled prediction:candidate · insufficient_payloadconsensus · insufficient_payload
0
citations
venueno affunlabeled
Integrated Fabry-Perot optical space switches
2009· other· en· Library and Archives Canada (Government of Canada)· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
0
citations
affno abstractunlabeled
Efficient Computation of Closed Substrings
Samkith K. Jain, Neerja Mhaskar
2025· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
0
citations
fundno affunlabeled
Dynamic 3d sequence capture and enhancement
Ljubomir Jovanov, Wilfried Philips
2017· article· en· Ghent University Academic Bibliography (Ghent University)· Computer Science
distilled prediction:candidate · metaepi_narrow+stsconsensus · none
0
citations
venueno affunlabeled
Display Random Code in the C
Xiaoyun Chen
2005· article· en· Microcomputer applications· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
fundno affunlabeled
The Trie Measure, Revisited
2025· article· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Computer Science
distilled prediction:candidate · scholarly_communicationconsensus · none
0
citations
affno abstractunlabeled
Skip Lift: A Probabilistic Alternative to Red-Black Trees
Prosenjit Bose, Karim Douïeb, Pat Morin
2011· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrow+open_scienceconsensus · none
0
citations
afffundunlabeled
SORTING SUFFIXES OF TWO-PATTERN STRINGS
František Franěk, W.F. Smyth
2005· article· en· International Journal of Foundations of Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Conclusions and Open Problems
Marina Barsky, Ulrike Stege, Alex Thomo
2012· book-chapter· en· Synthesis lectures on data management· Computer Science
distilled prediction:candidate · metaepi_narrow+open_scienceconsensus · open_science
0
citations
venueno affno abstractunlabeled
Pebbling Graph Products.
Maggy Tomova, Cindy Wyels
2011· article· en· Ars Combinatoria· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Structures for Indexing Substrings
Marina Barsky, Ulrike Stege, Alex Thomo
2012· book-chapter· en· Synthesis lectures on data management· Computer Science
distilled prediction:candidate · metaepi_narrow+open_scienceconsensus · none
0
citations
fundno affunlabeled
A simple algorithm for computing the lempel ziv factorization
Maxime Crochemore, Lucian Ilie, William F. Smyth
2008· preprint· en· Murdoch Research Repository (Murdoch University)· Computer Science
distilled prediction:candidate · metaepi_narrow+sts+scholarly_communication+open_scienceconsensus · open_science
0
citations
affno abstractunlabeled
External Construction of Suffix Trees
Marina Barsky, Ulrike Stege, Alex Thomo
2012· book-chapter· en· Synthesis lectures on data management· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
0
citations

How this was built: Screen · Findings · About