MétaCan
ENFR
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.

Export CSVExport JSONAPI query

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 3 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.

affunlabeled
Skew quantum Murnaghan-Nakayama rule
Matjaž Konvalinka
2011· article· fr· Discrete Mathematics & Theoretical Computer Science· Mathematics
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
Complexity of locally-injective homomorphisms to tournaments
Stefan Bard, Thomas Bellitto, Christopher Duffy, Gary MacGillivray, Feiran Yang
2018· preprint· en· Discrete Mathematics & Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
affunlabeled
The Möbius function of generalized subword order
Peter R. W. McNamara, Bruce E. Sagan
2012· article· en· Discrete Mathematics & Theoretical Computer Science· Mathematics
machine prediction:candidate · noneconsensus · none
2
citations
affunlabeled
Computing Tutte Polynomials
Michael Monagan
2012· article· fr· Discrete Mathematics & Theoretical Computer Science· Mathematics
machine prediction:candidate · noneconsensus · none
2
citations
affunlabeled
Negative $q$-Stirling numbers
Yue Cai, Margaret Readdy
2015· article· en· Discrete Mathematics & Theoretical Computer Science· Mathematics
machine prediction:candidate · noneconsensus · none
2
citations
afffundunlabeled
Tuza's Conjecture for Threshold Graphs
Marthe Bonamy, Łukasz Bożyk, Andrzej Grzesik, Meike Hatzel, Tomáš Masařík, Jana Novotná +1 more
2022· article· en· Discrete Mathematics & Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
afffundunlabeled
A method for eternally dominating strong grids
Alizée Gagnon, Alexander Hassler, Jerry Huang, Aaron Krim-Yee, Fionn Mc Inerney, Andrés Zacarías +2 more
2020· article· en· Discrete Mathematics & Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
afffundunlabeled
Primitive orthogonal idempotents for R-trivial monoids
Chris Berg, Nantel Bergeron, Sandeep Bhargava, Franco Saliola
2011· article· fr· Discrete Mathematics & Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
afffundunlabeled
Triangulations of cyclic polytopes
Steffen Oppermann, Hugh Thomas
2012· article· fr· Discrete Mathematics & Theoretical Computer Science· Mathematics
machine prediction:candidate · noneconsensus · none
2
citations
affunlabeled
Universal cycles for permutation classes
Michael Albert, Julian West
2009· article· fr· Discrete Mathematics & Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
fundno affunlabeled
The facial weak order in finite Coxeter groups
Aram Dermenjian, Christophe Hohlweg, Vincent Pilaud
2020· article· en· Discrete Mathematics & Theoretical Computer Science· Mathematics
machine prediction:candidate · noneconsensus · none
2
citations
afffundunlabeled
Immaculate basis of the non-commutative symmetric functions
Chris Berg, Nantel Bergeron, Franco Saliola, Luís Serrano, Mike Zabrocki
2013· article· fr· Discrete Mathematics & Theoretical Computer Science· Mathematics
machine prediction:candidate · noneconsensus · none
2
citations
fundno affunlabeled
Makespan Trade-offs for Visiting Triangle Edges
Konstantinos Georgiou, Somnath Kundu, Paweł Prałat
2025· article· en· Discrete Mathematics & Theoretical Computer Science· Engineering
machine prediction:candidate · noneconsensus · none
2
citations
affunlabeled
On the Grone-Merris conjecture
Tamon Stephen
2005· article· en· Discrete Mathematics & Theoretical Computer Science· Mathematics
machine prediction:candidate · noneconsensus · none
2
citations
affunlabeled
On intervals of the consecutive pattern poset
Sergi Elizalde, Peter R. W. McNamara
2020· article· en· Discrete Mathematics & Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
affunlabeled
The Murnaghan―Nakayama rule for k-Schur functions
Jason Bandlow, Anne Schilling, Mike Zabrocki
2011· article· fr· Discrete Mathematics & Theoretical Computer Science· Mathematics
machine prediction:candidate · noneconsensus · none
2
citations
affunlabeled
Critical Groups of Simplicial Complexes
Art M. Duval, Caroline J. Klivans, Jeremy L. Martin
2011· preprint· fr· Discrete Mathematics & Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
fundno affunlabeled
Asymptotic laws for knot diagrams
Harrison Chapman
2020· article· en· Discrete Mathematics & Theoretical Computer Science· Mathematics
machine prediction:candidate · noneconsensus · none
1
citations
afffundunlabeled
Refinements of the Littlewood-Richardson rule
J. Haglund, K. Luoto, Sarah Mason, Stephanie van Willigenburg
2009· article· fr· Discrete Mathematics & Theoretical Computer Science· Mathematics
machine prediction:candidate · noneconsensus · none
1
citations
affunlabeled
Normal Supercharacter Theory
Farid Aliniaeifard
2020· preprint· en· Discrete Mathematics & Theoretical Computer Science· Mathematics
machine prediction:candidate · noneconsensus · none
1
citations
affunlabeled
Row-strict quasisymmetric Schur functions
Sarah Mason, Jeffrey B. Remmel
2011· article· en· Discrete Mathematics & Theoretical Computer Science· Mathematics
machine prediction:candidate · noneconsensus · none
1
citations
fundno affunlabeled
On Separating Path and Tree Systems in Graphs
Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, Anil Maheshwari, Babak Miraftab, Saeed Odak +3 more
2025· article· en· Discrete Mathematics & Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
afffundunlabeled
List circular backbone colouring
Frédéric Havet, A. R. King
2014· article· en· Discrete Mathematics & Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
← previousnext →

How this was built: Screen · Findings · About