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

fundno affunlabeled
On Linear Layouts of Graphs
Vida Dujmović, David R. Wood
2004· article· en· Discrete Mathematics & Theoretical Computer Science· Engineering
machine prediction:candidate · noneconsensus · none
116
citations
fundno affunlabeled
On the metric dimension of Grassmann graphs
R. A. Bailey, Karen Meagher
2012· article· en· Discrete Mathematics & Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
53
citations
fundno affunlabeled
Track Layouts of Graphs
Vida Dujmović, Attila Pór, David R. Wood
2004· article· en· Discrete Mathematics & Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
52
citations
fundno affunlabeled
Sums of Digits, Overlaps, and Palindromes
Jean‐Paul Allouche, Jeffrey Shallit
2000· article· en· Discrete Mathematics & Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
48
citations
afffundunlabeled
Complexity results on graphs with few cliques
Bill Rosgen, Lorna Stewart
2007· article· en· Discrete Mathematics & Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
39
citations
affunlabeled
On-line Ramsey numbers for paths and stars
Jarosław Grytczuk, H. A. Kierstead, Paweł Prałat
2008· article· en· Discrete Mathematics & Theoretical Computer Science· Mathematics
machine prediction:candidate · noneconsensus · none
34
citations
affunlabeled
Connectedness of number theoretical tilings
Shigeki Akiyama, Nertila Gjini
2005· article· en· Discrete Mathematics & Theoretical Computer Science· Mathematics
machine prediction:candidate · noneconsensus · none
29
citations
affunlabeled
Isomorphism of graph classes related to the circular-ones property
Andrew R. Curtis, Min Chih Lin, Ross M. McConnell, Yahav Nussbaum, Francisco J. Soulignac, Jeremy Spinrad +1 more
2013· article· en· Discrete Mathematics & Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
28
citations
aboutno affunlabeled
Walks in the Quarter Plane with Multiple Steps
Manuel Kauers, Rika Yatchak
2015· article· fr· Discrete Mathematics & Theoretical Computer Science· Engineering
machine prediction:candidate · noneconsensus · none
26
citations
fundno affunlabeled
Vertex-colouring edge-weightings with two edge weights
Mahdad Khatirinejad, Reza Naserasr, Mike Newman, Ben Seamone, Brett Stevens
2012· article· en· Discrete Mathematics & Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
21
citations
fundno affunlabeled
A de Bruijn - Erdos theorem and metric spaces
Ehsan Chiniforooshan, Vašek Chvátal
2011· article· en· Discrete Mathematics & Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
20
citations
affunlabeled
Labeling planar graphs with a condition at distance two
Peter Bella, Daniel Král͏̌, Bojan Mohar, Katarina Quittnerová
2005· article· en· Discrete Mathematics & Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
20
citations
affunlabeled
Diversities and the Geometry of Hypergraphs
David Bryant, Paul Tupper
2014· article· en· Discrete Mathematics & Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
19
citations
affunlabeled
Cycles intersecting edge-cuts of prescribed sizes
Tomáš Kaiser, Riste Škrekovski
2005· article· en· Discrete Mathematics & Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
17
citations
affunlabeled
Random assignment and shortest path problems
Johan Wästlund
2006· article· en· Discrete Mathematics & Theoretical Computer Science· Mathematics
machine prediction:candidate · noneconsensus · none
16
citations
afffundunlabeled
Quasisymmetric Schur functions
James Haglund, Sarah Mason, Kurt Luoto, Steph van Willigenburg
2008· article· fr· Discrete Mathematics & Theoretical Computer Science· Mathematics
machine prediction:candidate · noneconsensus · none
16
citations
affunlabeled
Gale-Robinson Sequences and Brane Tilings
In-Jee Jeong, Gregg Musiker, Sicong Zhang
2013· article· en· Discrete Mathematics & Theoretical Computer Science· Mathematics
machine prediction:candidate · noneconsensus · none
15
citations
afffundunlabeled
Fast separation in a graph with an excluded minor
Bruce Reed, David R. Wood
2005· article· en· Discrete Mathematics & Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
15
citations
fundno affunlabeled
Evacuating Robots from a Disk Using Face-to-Face Communication
Jurek Czyzowicz, Konstantinos Georgiou, Evangelos Kranakis, Lata Narayanan, Jarda Opatrny, Birgit Vogtenhuber
2020· preprint· en· Discrete Mathematics & Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
13
citations
afffundunlabeled
Color critical hypergraphs and forbidden configurations
R.P. Anstee, Balin Fleming, Zoltán Füredi, Attila Sali
2005· article· en· Discrete Mathematics & Theoretical Computer Science· Engineering
machine prediction:candidate · noneconsensus · none
13
citations
fundno affunlabeled
Improved product structure for graphs on surfaces
Marc Distel, Robert Hickingbotham, Tony Huynh, David R. Wood
2022· article· en· Discrete Mathematics & Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
13
citations
fundno affunlabeled
Cataland: Why the Fuss?
Christian Stump, Hugh Thomas, Nathan Williams
2020· article· en· Discrete Mathematics & Theoretical Computer Science· Mathematics
machine prediction:candidate · noneconsensus · none
11
citations
afffundunlabeled
On $k$-crossings and $k$-nestings of permutations
Sophie Burrill, Marni Mishna, Jacob Post
2010· article· fr· Discrete Mathematics & Theoretical Computer Science· Mathematics
machine prediction:candidate · noneconsensus · none
10
citations
fundno affunlabeled
Properties of the extremal infinite smooth words
Srečko Brlek, Guy Mélançon, Geneviève Paquin
2007· article· en· Discrete Mathematics & Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
10
citations
fundno affunlabeled
On the critical exponent of generalized Thue-Morse words
Alexandre Blondin Massé, Srečko Brlek, Amy Glen, Sebastien Labbé
2007· article· en· Discrete Mathematics & Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
9
citations
fundno affunlabeled
Connected Tropical Subgraphs in Vertex-Colored Graphs
Jean-Alexandre Anglès d'Auriac, Nathann Cohen, Hakim El Mafthoui, Ararat Harutyunyan, Sylvain Legay, Yannis Manoussakis
2016· article· en· Discrete Mathematics & Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
9
citations
affunlabeled
Crystals from categorified quantum groups
Aaron D. Lauda, Monica Vazirani
2010· article· fr· Discrete Mathematics & Theoretical Computer Science· Mathematics
machine prediction:candidate · noneconsensus · none
8
citations
affunlabeled
Coloring and Guarding Arrangements
Prosenjit Bose, Jean Cardinal, Sébastien Collette, Ferrán Hurtado, Matias Korman, Stefan Langerman +1 more
2013· article· en· Discrete Mathematics & Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
8
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
next →

How this was built: Screen · Findings · About