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 8 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 teacher distillation outputs. Candidate is the union; consensus is the intersection.

affno abstractunlabeled
Minimum consistent subset of simple graph classes
Sanjana Dey, Anil Maheshwari, Subhas C. Nandy
2023· article· en· Discrete Applied Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
3
citations
affno abstractunlabeled
On chromatic and flow polynomial unique graphs
Yinghua Duan, Haidong Wu, Qinglin Yu
2008· article· en· Discrete Applied Mathematics· Mathematics
distilled prediction:candidate · metaepi_narrowconsensus · none
3
citations
affno abstractunlabeled
Game brush number
William B. Kinnersley, Paweł Prałat
2016· article· en· Discrete Applied Mathematics· Mathematics
distilled prediction:candidate · insufficient_payloadconsensus · insufficient_payload
3
citations
afffundno abstractunlabeled
A sharp lower bound on the number of non-equivalent colorings of graphs of order <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si8.gif" display="inline" overflow="scroll"><mml:mi>n</mml:mi></mml:math> and maximum degree <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si11.gif" display="inline" overflow="scroll"><mml:mi>n</mml:mi><mml:mo>−</mml:mo><mml:mn>3</mml:mn></mml:math>
Romain Absil, Eglantine Camby, Alain Hertz, Hadrien Mélot
2016· article· lv· Discrete Applied Mathematics· Computer Science
distilled prediction:candidate · metaepi_narrow+sts+scholarly_communication+research_integrity+insufficient_payloadconsensus · metaepi_narrow+sts
3
citations
afffundno abstractunlabeled
2-limited broadcast domination in subcubic graphs
Michael A. Henning, Gary MacGillivray, Frank Yang
2020· article· en· Discrete Applied Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
3
citations
afffundno abstractunlabeled
Edge addition and the change in Kemeny’s constant
Stephen Kirkland, Yuqiao Li, John S. McAlister, Xiaohong Zhang
2025· article· en· Discrete Applied Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
3
citations
afffundno abstractunlabeled
2-limited broadcast domination on grid graphs
Aaron Slobodin, Gary MacGillivray, Wendy Myrvold
2023· article· en· Discrete Applied Mathematics· Computer Science
distilled prediction:candidate · insufficient_payloadconsensus · none
3
citations
affno abstractunlabeled
The cost of perfection for matchings in graphs
Emílio Vital Brazil, Celina M.H. de Figueiredo, Guilherme D. da Fonseca, Diana Sasaki
2014· article· en· Discrete Applied Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
3
citations
affno abstractunlabeled
Broadcasting from multiple originators
Arthur L. Liestman, Dana Richards, Ladislav Stacho
2009· article· en· Discrete Applied Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
3
citations
affno abstractunlabeled
Solving the clique cover problem on (bull, <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" overflow="scroll" id="d1e19" altimg="si5.gif"><mml:msub><mml:mrow><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mn>4</mml:mn></mml:mrow></mml:msub></mml:math>)-free graphs
Kathie Cameron, Chı́nh T. Hoàng
2018· article· lv· Discrete Applied Mathematics· Computer Science
distilled prediction:candidate · metaepi_narrow+sts+scholarly_communication+open_science+research_integrity+insufficient_payloadconsensus · sts+research_integrity+insufficient_payload
3
citations
affno abstractunlabeled
Maximizing edge-ratio is NP-complete
Steven D. Noble, Pierre Hansen, Nenad Mladenović
2011· article· en· Discrete Applied Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
2
citations
afffundno abstractunlabeled
The robot crawler graph process
Anthony Bonato, R. Maria del Rio-Chanona, Calum MacRury, Jake Nicolaidis, Xavier Pérez‐Giménez, Paweł Prałat +1 more
2018· article· en· Discrete Applied Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
2
citations
affno abstractunlabeled
Homothetic polygons and beyond: Maximal cliques in intersection graphs
Valentin E. Brimkov, Konstanty Junosza-Szaniawski, Sean Kafer, Jan Kratochvı́l, Martin Pergel, Paweł Rzążewski +2 more
2018· article· en· Discrete Applied Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
2
citations
affno abstractunlabeled
Similarity based deduplication with small data chunks
Lior Aronovich, Ron Asher, Danny Harnik, Michael Hirsch, Shmuel T. Klein, Yair Toaff
2015· article· en· Discrete Applied Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
2
citations
affno abstractunlabeled
On the continuity of graph parameters
Matthew Hurshman, Jeannette Janssen
2014· article· en· Discrete Applied Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
2
citations
affno abstractunlabeled
Polynomial size linear programs for problems in P
David Avis, Hans Raj Tiwary, Osamu Watanabe
2019· article· en· Discrete Applied Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
2
citations
fundno affno abstractunlabeled
Minimum edge ranking spanning trees of split graphs
Kazuhisa Makino, Yushi Uno, Toshihide Ibaraki
2006· article· en· Discrete Applied Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
2
citations
affno abstractunlabeled
On the strong chromatic index of cyclic multigraphs
Pavol Gvozdjak, Peter Horák, Mariusz Meszka, Zdzisław Skupień
2000· article· en· Discrete Applied Mathematics· Engineering
distilled prediction:candidate · noneconsensus · none
2
citations
affno abstractunlabeled
Preface
Gregory Gutin, Abraham P. Punnen
2002· article· en· Discrete Applied Mathematics
distilled prediction:candidate · insufficient_payloadconsensus · insufficient_payload
2
citations
affno abstractunlabeled
Preface
Martine Labbé, Gilbert Laporte, Silvano Martello
2001· article· en· Discrete Applied Mathematics
distilled prediction:candidate · insufficient_payloadconsensus · none
2
citations
afffundno abstractunlabeled
Cops and an Insightful Robber
Melissa A. Huggan, Richard J. Nowakowski
2021· article· en· Discrete Applied Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
2
citations
fundno affno abstractunlabeled
Recoloring some hereditary graph classes
Manoj Belavadi, Kathie Cameron
2024· article· en· Discrete Applied Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
2
citations
affno abstractunlabeled
The iterative independent model
Erin Meger, Abigail Raz
2023· article· en· Discrete Applied Mathematics· Physics and Astronomy
distilled prediction:candidate · noneconsensus · none
2
citations
affno abstractunlabeled
A note on connected greedy edge colouring
Marthe Bonamy, Carla Groenland, Carole Muller, Jonathan Narboni, Jakub Pekárek, Alexandra Wesolek
2021· preprint· en· Discrete Applied Mathematics· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
2
citations
afffundno abstractunlabeled
Irredundance graphs
Christina M. Mynhardt, Adriana Roux
2022· article· en· Discrete Applied Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
2
citations
afffundno abstractunlabeled
On directed covering and domination problems
Tesshu Hanaka, Naomi Nishimura, Hirotaka Ono
2019· article· en· Discrete Applied Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
2
citations
affunlabeled
Monitoring edge-geodetic sets in graphs
Subhadeep Ranjan Dev, Sanjana Dey, Florent Foucaud, Krishna R. Narayanan, Lekshmi Ramasubramony Sulochana
2025· article· en· Discrete Applied Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
2
citations
affno abstractunlabeled
The<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si6.gif" display="inline" overflow="scroll"><mml:msub><mml:mrow><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msub></mml:math>-extended graft construction
Gary MacGillivray, Jacobus Swarts
2011· article· lv· Discrete Applied Mathematics· Computer Science
distilled prediction:candidate · metaepi_narrow+sts+scholarly_communication+research_integrity+insufficient_payloadconsensus · sts+insufficient_payload
2
citations
← previousnext →

How this was built: Screen · Findings · About