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 17 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. The Gemma side is a direct model label for every work (title-only); the Codex side is a distilled, calibrated classifier. Candidate is the union; consensus is the intersection.

affno abstractunlabeled
Full-Text (Substring) Indexes in External Memory
Marina Barsky, Ulrike Stege, Alex Thomo
2011· article· en· Synthesis lectures on data management· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
affunlabeled
HyperMinHash: MinHash in LogLog space
Yun William Yu, Griffin M. Weber
2020· preprint· en· IEEE Transactions on Knowledge and Data Engineering· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
afffundunlabeled
Average Cost of QuickXsort with Pivot Sampling
Sebastian Wild
2018· preprint· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
affunlabeled
An In-Place Priority Search Tree
Minati De, Anil Maheshwari, Subhas C. Nandy, Michiel H. M. Smid
2011· article· en· Canadian Conference on Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
affunlabeled
Reconstruction From Noisy Substrings
Hengjia Wei, Moshe Schwartz, Gennian Ge
2024· article· en· IEEE Transactions on Information Theory· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
affunlabeled
Application of Random Walks in Data Processing
Yujian Zhang, Hechen Zhang
2023· article· en· Highlights in Science Engineering and Technology· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
fundno affunlabeled
Network delay inference from additive metrics
Shankar Bhamidi, Ram Rajagopal, Sébastien Roch
2010· preprint· en· Random Structures and Algorithms· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
affno abstractunlabeled
Biased Predecessor Search
Prosenjit Bose, Rolf Fagerberg, John Howat, Pat Morin
2016· article· en· Algorithmica· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
affno abstractunlabeled
Circuit Complexity of Shuffle
Michael Soltys
2013· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
affunlabeled
Computing regularities in strings
W.F. Smyth, Munina Yusufu
2009· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
affno abstractunlabeled
OpenCL
Deshanand P. Singh, Peter Yiannacouras
2016· book-chapter· en· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
afffundno abstractunlabeled
String shuffle: Circuits and graphs
Neerja Mhaskar, Michael Soltys
2015· article· en· Journal of Discrete Algorithms· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affunlabeled
Tight Bounds for Monotone Minimal Perfect Hashing
Sepehr Assadi, Martı́n Farach-Colton, William Kuszmaul
2024· article· en· ACM Transactions on Algorithms· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affno abstractunlabeled
Search Engines and Web Information Retrieval
Alejandro López-Ortíz
2005· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affunlabeled
Lazy Search Trees
Bryce Sandlund, Sebastian Wild
2020· preprint· en· arXiv (Cornell University)· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affno abstractunlabeled
Space-Efficient Conversions from SLPs
Travis Gagie, Adrián Goga, Artur Jeż, Gonzalo Navarro
2024· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affno abstractunlabeled
Complexity and Algorithms for MUL-Tree Pruning
Mathieu Gascon, Riccardo Dondi, Nadia El-Mabrouk
2021· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
afffundunlabeled
Competitive Online Search Trees on Trees
Prosenjit Bose, Jean Cardinal, John Iacono, Grigorios Koumoutsos, Stefan Langerman
2023· article· en· ACM Transactions on Algorithms· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affno abstractunlabeled
KeBaB: k-mer Based Breaking for Finding Long MEMs
Nathaniel K. Brown, Lore Depuydt, Mohsen Zakeri, Anas Alhadi, Nour Allam, Dove Begleiter +4 more
2025· article· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations

How this was built: Screen · Findings · About