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 Applied Mathematics
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.

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

Labels cover 0 of 520 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 520 of 520 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
A note on tolerance graph recognition
Ryan Hayward, Ron Shamir
2004· article· en· Discrete Applied Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
17
citations
affno abstractunlabeled
A lower bound for the job insertion problem
Tamás Kis, Alain Hertz
2003· article· en· Discrete Applied Mathematics· Engineering
machine prediction:candidate · noneconsensus · none
16
citations
afffundno abstractunlabeled
Limited visibility Cops and Robber
Nancy E. Clarke, Danielle Cox, Christopher Duffy, Daniel Dyer, Shannon L. Fitzpatrick, Margaret-Ellen Messinger
2019· article· en· Discrete Applied Mathematics· Decision Sciences
machine prediction:candidate · noneconsensus · none
16
citations
afffundno abstractunlabeled
Pancyclicity and NP-completeness in planar graphs
Mingchu Li, Derek G. Corneil, Eric Mendelsohn
2000· article· en· Discrete Applied Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
16
citations
affno abstractunlabeled
Finding and listing induced paths and cycles
Chı́nh T. Hoàng, Marcin Kamiński, Joe Sawada, R. Sritharan
2012· article· en· Discrete Applied Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
16
citations
affno abstractunlabeled
Representation of graphs by OBDDs
Robin Nunkesser, Philipp Woelfel
2008· article· en· Discrete Applied Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
16
citations
affno abstractunlabeled
Searching with mobile agents in networks with liars
Nicolas Hanusse, Evangelos Kranakis, Danny Kriz̧anc
2003· article· en· Discrete Applied Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
16
citations
afffundno abstractunlabeled
On minimally b-imperfect graphs
Chı́nh T. Hoàng, Cláudia Linhares Sales, Frédéric Maffray
2009· article· en· Discrete Applied Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
16
citations
affno abstractunlabeled
Proximity, remoteness and girth in graphs
Mustapha Aouchiche, Pierre Hansen
2017· article· en· Discrete Applied Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
15
citations
affno abstractunlabeled
The average connectivity of a digraph
Michael A. Henning, Ortrud R. Oellermann
2003· article· en· Discrete Applied Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
15
citations
affno abstractunlabeled
Formulas for cube roots in <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si710.gif" overflow="scroll"><mml:msub><mml:mrow><mml:mi mathvariant="double-struck">F</mml:mi></mml:mrow><mml:mrow><mml:msup><mml:mrow><mml:mn>3</mml:mn></mml:mrow><mml:mrow><mml:mi>m</mml:mi></mml:mrow></mml:msup></mml:mrow></mml:msub></mml:math>
Omran Ahmadi, Darrel Hankerson, Alfred Menezes
2006· article· lv· Discrete Applied Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
15
citations
afffundno abstractunlabeled
Greedy flipping of pancakes and burnt pancakes
Joe Sawada, Aaron Williams
2016· article· en· Discrete Applied Mathematics· Biochemistry, Genetics and Molecular Biology
machine prediction:candidate · noneconsensus · none
14
citations
affno abstractunlabeled
On the robustness of primitive words
Gheorghe Pǎun, Nicolae Sântean, G. Thierrin, Sheng Yü
2002· article· en· Discrete Applied Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
14
citations
affno abstractunlabeled
The vertex leafage of chordal graphs
Steven Chaplick, Juraj Stacho
2012· article· en· Discrete Applied Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
13
citations
affno abstractunlabeled
On well-covered triangulations: Part II
Arthur S. Finbow, Bert L. Hartnell, Richard J. Nowakowski, Michael D. Plummer
2009· article· en· Discrete Applied Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
13
citations
afffundno abstractunlabeled
Characterizations of (<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" display="inline" overflow="scroll"><mml:mn>4</mml:mn><mml:msub><mml:mrow><mml:mi>K</mml:mi></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:math>, <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si2.gif" display="inline" overflow="scroll"><mml:msub><mml:mrow><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mn>4</mml:mn></mml:mrow></mml:msub></mml:math>, <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si3.gif" display="inline" overflow="scroll"><mml:msub><mml:mrow><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mn>5</mml:mn></mml:mrow></mml:msub></mml:math>)-free graphs
Dallas J. Fraser, Angèle M. Hamel, Chı́nh T. Hoàng, Kevin J. Holmes, Tom P. LaMantia
2016· article· lv· Discrete Applied Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
13
citations
affno abstractunlabeled
Multi-terminal multipath flows: synthesis
R. Chandrasekaran, K. P. K. Nair, Y.P. Aneja, S.N. Kabadi
2004· article· en· Discrete Applied Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
12
citations
afffundno abstractunlabeled
Dominating and irredundant broadcasts in graphs
Christina M. Mynhardt, Adriana Roux
2017· article· en· Discrete Applied Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
12
citations
afffundno abstractunlabeled
Number of lines in hypergraphs
Pierre Aboulker, Adrian Bondy, Ehsan Chiniforooshan, Vašek Chvátal, Peihan Miao
2014· article· en· Discrete Applied Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
12
citations
afffundno abstractunlabeled
A tie-break model for graph search
Derek G. Corneil, Jérémie Dusart, Michel Habib, Antoine Mamcarz, Fabien de Montgolfier
2015· article· en· Discrete Applied Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
11
citations
affno abstractunlabeled
The complexity of tropical graph homomorphisms
Florent Foucaud, Ararat Harutyunyan, Pavol Hell, Sylvain Legay, Yannis Manoussakis, Reza Naserasr
2017· article· en· Discrete Applied Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
11
citations
affno abstractunlabeled
Approximating the fixed linear crossing number
Robert Cimikowski, Brendan Mumey
2007· article· en· Discrete Applied Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
11
citations
← previousnext →

How this was built: Screen · Findings · About