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 20 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
The Weighted Cfg Constraint
George Katsirelos, Nina Narodytska, Toby Walsh
2008· article· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affunlabeled
<scp>H</scp> uffman Coding
En‐hui Yang, Da‐ke He
2003· other· en· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affno abstractunlabeled
On Suffix Tree Detection
Amihood Amir, Eitan Kondratovsky, Avivit Levy
2023· preprint· en· SSRN Electronic Journal· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affaboutunlabeled
Fast Data Compression with Antidictionaries
Michael Davidson, Lucian Ilie
2004· article· en· Fundamenta Informaticae· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affno abstractunlabeled
Recovering the Lattice of Repetitive Sub-functions
Guy-Vincent Jourdan, Hasan Ural, Hüsnü Yenigün
2005· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affno abstractunlabeled
On unequal error protection for LZSS compressed data
Richard Demo Souza, Marcelo Eduardo Pellenz, Zaqueu Cabral Pereira
2009· article· fr· Annals of Telecommunications· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affunlabeled
STEP
Rhodes Brown, Karel Driesen, David Eng, Laurie Hendren, John Bagterp Jørgensen, Clark Verbrugge +1 more
2002· article· en· ACM SIGSOFT Software Engineering Notes· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affunlabeled
String Matching: Communication, Circuits, and Learning
Alexander Golovnev, Mika Göös, Daniel Reichman, Igor Shinkar
2019· article· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affunlabeled
RLBWT Tricks
Nathaniel K. Brown, Travis Gagie
2021· preprint· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affno abstractunlabeled
Intersections of Inverted Lists
Andrew W. Kane, Alejandro López-Ortíz
2016· book-chapter· en· Encyclopedia of Algorithms· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affunlabeled
Path Queries on Functions
Travis Gagie, Meng He, Gonzalo Navarro
2017· article· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affno abstractunlabeled
A prefix array for parameterized strings
Richard Beal, Donald Adjeroh, W.F. Smyth
2016· article· en· Murdoch Research Repository (Murdoch University)· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Deterministic Random Walks on the Integers
Joshua Cooper, Benjamin Doerr, Joel Spencer, Gábor Tardos
2006· preprint· en· ArXiv.org· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Computing the Genomic Distance in Linear Time
Anne Bergeron, Julia Mixtacki, Jens Stoye
2010· article· en· PUB – Publications at Bielefeld University (Bielefeld University)· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Compressing XML
2009· book-chapter· en· Encyclopedia of Database Systems· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
RunA.nc
Sisi Chen, Lulin Xue, M. K. Yau
2020· dataset· en· Harvard Dataverse· Computer Science
machine prediction:candidate · insufficient_payloadconsensus · none
0
citations
affunlabeled
Densities
Jean Berstel, Dominique Perrin, Christophe Reutenauer
2009· book-chapter· en· Cambridge University Press eBooks· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
A New Style of Mathematical Proof
William M. Farmer
2018· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations

How this was built: Screen · Findings · About