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 22 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
On multikey sorting
Abdelaziz Fellah, A. Maamir, Mahmoud Abaza
2000· article· en· Advances in Engineering Software· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Sampling Frequent and Diverse Patterns Through Compression
François Camelin, Samir Loudni, Gilles Pesant, Charlotte Truchet
2025· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
0
citations
afffundno abstractunlabeled
Total variation distance for product distributions is <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.svg"> <mml:mi mathvariant="normal">#</mml:mi> <mml:mi mathvariant="sans-serif">P</mml:mi> </mml:math> -complete
Arnab Bhattacharyya, Sutanu Gayen, Kuldeep S. Meel, Dimitrios Myrisiotis, A. Pavan, N. V. Vinodchandran
2025· article· en· Information Processing Letters· Computer Science
distilled prediction:candidate · metaepi_narrow+sts+scholarly_communicationconsensus · none
0
citations
aboutno affunlabeled
Spiophanes japonicum Imajima 1991
2003· article· en· Zenodo (CERN European Organization for Nuclear Research)· Computer Science
distilled prediction:candidate · sts+scholarly_communication+insufficient_payloadconsensus · insufficient_payload
0
citations
affunlabeled
Fast and Small Subsampled R-indexes
Dustin Cobas, Travis Gagie, Gonzalo Navarro
2025· article· en· ACM Transactions on Algorithms· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Communication Issues in Scalable Parallel Computing
C. E. R. Alves, Edson N. Cáceres, F. Dehne, S. W. Song
2010· book-chapter· en· IGI Global eBooks· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
0
citations
affno abstractunlabeled
V-Words, Lyndon Words and Substring circ-UMFFs
Jacqueline W. Daykin, Neerja Mhaskar, W.F. Smyth
2023· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
0
citations
affvenueaboutunlabeled
Scanning Compressed Full Text Files
Carolyn Watters, Matthew Young-Lai
2013· article· en· Proceedings of the Annual Conference of CAIS / Actes du congrès annuel de l ACSI· Computer Science
distilled prediction:candidate · scholarly_communicationconsensus · scholarly_communication
0
citations
affno abstractunlabeled
Introduction
Michael L. Scott, Trevor Brown
2024· book-chapter· en· Synthesis lectures on computer architecture· Computer Science
distilled prediction:candidate · metaepi_narrow+insufficient_payloadconsensus · none
0
citations
affunlabeled
On the Subset Matching
Yangjun Chen
2006· article· en· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
affunlabeled
An example of goal-directed, calculational proof
Roland Backhouse, Walter Guttmann, Michael Winter
2024· article· en· Journal of Functional Programming· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Case Study: Pattern Matching
Fayez Gebali
2011· other· en· Computer Science
distilled prediction:candidate · insufficient_payloadconsensus · none
0
citations
affunlabeled
Succinct Posets
J. Ian Munro, Patrick K. Nicholson
2012· preprint· en· arXiv (Cornell University)· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
0
citations
affno abstractunlabeled
Introduction
Kaisong Huang, Tianzheng Wang
2023· book-chapter· en· SpringerBriefs in computer science· Computer Science
distilled prediction:candidate · metaepi_narrow+insufficient_payloadconsensus · none
0
citations
affunlabeled
Solving 8&times8 Hex
Philip Henderson, Broderick Arneson, Ryan Hayward
2009· article· en· International Joint Conference on Artificial Intelligence· Computer Science
distilled prediction:candidate · insufficient_payloadconsensus · none
0
citations
affunlabeled
All-Match LZ77 Bit Recycling
Danny Dub�, Vincent Beaudoin
2008· article· en· DCC· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
afffundunlabeled
Hierarchical bin buffering
Daniel Lemire, Owen Kaser
2008· article· en· ACM Transactions on Algorithms· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Dynamic Compact Planar Embeddings
Travis Gagie, Meng He, Michael St. Denis
2023· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
0
citations
affno abstractunlabeled
Full-Text (Substring) Indexes in External Memory
Marina Barsky, Ulrike Stege, Alex Thomo
2012· book· en· Synthesis lectures on data management· Computer Science
distilled prediction:candidate · metaepi_narrow+open_scienceconsensus · none
0
citations
affunlabeled
The Trie Measure, Revisited
Jarno Alanko, Ruben Becker, Davide Cenzato, Travis Gagie, Bojana Kodric, Nicola Prezza
2025· preprint· en· ArXiv.org· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Selectable Heaps and Optimal Lazy Search Trees
Bryce Sandlund, Lingyi Zhang
2022· book-chapter· en· Society for Industrial and Applied Mathematics eBooks· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
0
citations
afffundunlabeled
Simultaneously Building and Reconciling a Synteny Tree
Mathieu Gascon, Mattéo Delabre, Nadia El-Mabrouk
2024· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrow+scholarly_communicationconsensus · none
0
citations

How this was built: Screen · Findings · About