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
Discrete Mathematics & Theoretical Computer Science
Topic
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.

246 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.
246 works in the cohort · of 4,299,418page 2 of 5

Labels cover 0 of 246 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 246 of 246 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.

afffundunlabeled
Combinatorial Hopf Algebras and Towers of Algebras
Nantel Bergeron, Thomas Lam, Huilan Li
2008· article· fr· Discrete Mathematics & Theoretical Computer Science· Mathematics
machine prediction:candidate · noneconsensus · none
7
citations
afffundunlabeled
Separating layered treewidth and row treewidth
Prosenjit Bose, Vida Dujmović, Mehrnoosh Javarsineh, Pat Morin, David R. Wood
2022· article· en· Discrete Mathematics & Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
7
citations
afffundunlabeled
P_4-Colorings and P_4-Bipartite Graphs
Chı́nh T. Hoàng, Van Bang Lê
2001· article· en· Discrete Mathematics & Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
7
citations
afffundunlabeled
Adjoint functors and tree duality
Jan Foniok, Claude Tardif
2009· article· en· Discrete Mathematics & Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
7
citations
affunlabeled
QSym over Sym has a stable basis
Aaron Lauve, Sarah Mason
2010· article· fr· Discrete Mathematics & Theoretical Computer Science· Mathematics
machine prediction:candidate · noneconsensus · none
6
citations
afffundunlabeled
Most Complex Regular Ideal Languages
2016· article· en· Discrete Mathematics & Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
6
citations
fundno affunlabeled
The Cycles of the Multiway Perfect Shuffle Permutation
John Ellis, Hongbing Fan, Jeffrey Shallit
2002· article· en· Discrete Mathematics & Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
5
citations
afffundunlabeled
The repetition threshold for binary rich words
James D. Currie, Lucas Mol, Narad Rampersad
2020· article· en· Discrete Mathematics & Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
5
citations
affunlabeled
New Hopf Structures on Binary Trees
Stefan Forcey, Aaron Lauve, Frank Sottile
2009· article· en· Discrete Mathematics & Theoretical Computer Science· Mathematics
machine prediction:candidate · noneconsensus · none
5
citations
fundno affunlabeled
The Height of List-tries and TST
Nicolas Broutin, Luc Devroye
2007· article· en· Discrete Mathematics & Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
4
citations
affunlabeled
Minor-monotone crossing number
Drago Bokal, Gašper Fijavž, Bojan Mohar
2005· article· en· Discrete Mathematics & Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
4
citations
affunlabeled
Cycle transversals in bounded degree graphs
Marina Groshaus, Pavol Hell, Sulamita Klein, Loana Tito Nogueira, Fábio Protti
2011· article· en· Discrete Mathematics & Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
4
citations
afffundunlabeled
$m$-noncrossing partitions and $m$-clusters
Aslak Bakke Buan, Idun Reiten, Hugh Thomas
2009· article· en· Discrete Mathematics & Theoretical Computer Science· Mathematics
machine prediction:candidate · noneconsensus · none
4
citations
fundno affunlabeled
Packing Plane Perfect Matchings into a Point Set
Ahmad Biniaz, Prosenjit Bose, Anil Maheshwari, Michiel Smid
2015· article· en· Discrete Mathematics & Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
4
citations
fundno affunlabeled
Centerpoint theorems for wedges
Jeff Erickson, Ferrán Hurtado, Pat Morin
2009· article· en· Discrete Mathematics & Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
4
citations
fundno affunlabeled
The Windy Postman Problem on Series-Parallel Graphs
Francisco Javier Zaragoza Martínez
2005· article· en· Discrete Mathematics & Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
4
citations
fundno affunlabeled
Token Swapping on Trees
Ahmad Biniaz, Kshitij Jain, Anna Lubiw, Zuzana Masárová, Tillmann Miltzow, Debajyoti Mondal +3 more
2023· preprint· en· Discrete Mathematics & Theoretical Computer Science· Biochemistry, Genetics and Molecular Biology
machine prediction:candidate · noneconsensus · none
4
citations
affunlabeled
The Incidence Hopf Algebra of Graphs
Brandon Humpert, Jeremy L. Martin
2011· preprint· fr· Discrete Mathematics & Theoretical Computer Science· Mathematics
machine prediction:candidate · noneconsensus · none
3
citations
affunlabeled
Skew quantum Murnaghan-Nakayama rule
Matjaž Konvalinka
2011· article· fr· Discrete Mathematics & Theoretical Computer Science· Mathematics
machine prediction:candidate · noneconsensus · none
3
citations
affunlabeled
Toppling numbers of complete and random graphs
Anthony Bonato, William B. Kinnersley, Paweł Prałat
2014· article· en· Discrete Mathematics & Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations
afffundunlabeled
A Variation on Chip-Firing: the diffusion game
Christopher Duffy, Thomas Lidbetter, Margaret-Ellen Messinger, Richard J. Nowakowski
2018· article· en· Discrete Mathematics & Theoretical Computer Science· Physics and Astronomy
machine prediction:candidate · noneconsensus · none
3
citations
affunlabeled
Asymptotic Density of Zimin Words
Joshua Cooper, Danny Rorabaugh
2016· article· en· Discrete Mathematics & Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations
afffundunlabeled
Pseudoperiodic Words and a Question of Shevelev
Joseph Meleshko, Pascal Ochem, Jeffrey Shallit, Sonja Linghui Shan
2023· article· en· Discrete Mathematics & Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations
fundno affunlabeled
Directed One-Trees
William Evans, Mohammad Ali Safari
2005· article· en· Discrete Mathematics & Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations
afffundunlabeled
Cubefree words with many squares
James D. Currie, Narad Rampersad
2010· article· en· Discrete Mathematics & Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations
fundno affunlabeled
On the Book Thickness of k-Trees
Vida Dujmović, David R. Wood
2011· article· en· Discrete Mathematics & Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations

How this was built: Screen · Findings · About