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 4 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
Symmetries of the k-bounded partition lattice
Chris Berg, Mike Zabrocki
2012· article· fr· Discrete Mathematics & Theoretical Computer Science· Mathematics
machine prediction:candidate · noneconsensus · none
1
citations
afffundunlabeled
Antisquares and Critical Exponents
Aseem Baranwal, James D. Currie, L. A. S. Mόl, Pascal Ochem, Narad Rampersad, Jeffrey Shallit
2023· article· en· Discrete Mathematics & Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affunlabeled
The topology of restricted partition posets
Richard Ehrenborg, JiYoon Jung
2011· article· fr· Discrete Mathematics & Theoretical Computer Science· Mathematics
machine prediction:candidate · noneconsensus · none
1
citations
affunlabeled
Enumerating Triangulations of Convex Polytopes
Sergei Bespamyatnikh
2001· article· en· Discrete Mathematics & Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
afffundunlabeled
Further results on Hendry's Conjecture
Manuel Lafond, Ben Seamone, Rezvan Sherkati
2022· article· en· Discrete Mathematics & Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
afffundunlabeled
On the multipacking number of grid graphs
Laurent Beaudou, Richard C. Brewster
2019· article· en· Discrete Mathematics & Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affunlabeled
Delannoy numbers and Legendre polytopes
Gábor Hetyei
2008· article· en· Discrete Mathematics & Theoretical Computer Science· Mathematics
machine prediction:candidate · noneconsensus · none
1
citations
afffundunlabeled
On the number of regular edge labelings
Kevin Buchin, Bettina Speckmann, Sander Verdonschot
2014· article· en· Discrete Mathematics & Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
fundno affunlabeled
Around the root of random multidimensional quadtrees
Gilbert Labelle, Louise Laforest, Xavier Provençal
2006· article· en· Discrete Mathematics & Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affunlabeled
On quadratic threshold CSPs
Per Austrin, Siavosh Benabbas, Avner Magen
2012· article· en· Discrete Mathematics & Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
afffundunlabeled
Domination in Kn\"odel Graphs
Jesse Racicot, Giovanni Rosso
2022· article· en· Discrete Mathematics & Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affunlabeled
Affine and toric arrangements
Richard Ehrenborg, Margaret Readdy, Michael Slone
2008· article· fr· Discrete Mathematics & Theoretical Computer Science· Mathematics
machine prediction:candidate · noneconsensus · none
1
citations
affunlabeled
$n!$ matchings, $n!$ posets (extended abstract)
Anders Claesson, Svante Linusson
2010· article· en· Discrete Mathematics & Theoretical Computer Science· Mathematics
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
The Erdős-Sós conjecture for geometric graphs
Luis Barba, Ruy Fabila‐Monroy, Dolores Lara, Jesús Leaños, Cynthia Rodrıguez, Gelasio Salazar +1 more
2013· article· en· Discrete Mathematics & Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
afffundunlabeled
Uniquely monopolar-partitionable block graphs
Xue-gang Chen, Jing Huang
2014· article· en· Discrete Mathematics & Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
fundno affunlabeled
The Price of Upwardness
Patrizio Angelini, Thérèse Biedl, Markus Chimani, Sabine Cornelsen, Giordano Da Lozzo, Seok-Hee Hong +5 more
2025· article· en· Discrete Mathematics & Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
afffundunlabeled
Infinite limits and folding
Anthony Bonato, Jeannette Janssen
2005· article· en· Discrete Mathematics & Theoretical Computer Science· Biochemistry, Genetics and Molecular Biology
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
A non-partitionable Cohen–Macaulay simplicial complex
Art M. Duval, Bennet Goeckner, Caroline J. Klivans, Jeremy L. Martin
2020· article· en· Discrete Mathematics & Theoretical Computer Science· Mathematics
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Quasisymmetric (k,l)-hook Schur functions
Sarah Mason, Elizabeth Niese
2014· article· en· Discrete Mathematics & Theoretical Computer Science· Mathematics
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Homomorphically Full Oriented Graphs
Thomas Bellitto, Christopher Duffy, Gary MacGillivray
2023· article· en· Discrete Mathematics & Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
← previousnext →

How this was built: Screen · Findings · About