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

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

Labels cover 0 of 687 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 687 of 687 works in this cohort. Predictions are machine_predicted_unvalidated teacher distillation outputs. Candidate is the union; consensus is the intersection.

affno abstractunlabeled
Preface
Peter Horák, Ladislav Stacho
2008· article· en· Discrete Mathematics
distilled prediction:candidate · insufficient_payloadconsensus · none
0
citations
afffundunlabeled
Large matchings in maximal 1-planar graphs
Thérèse Biedl, John Wittnebel
2024· article· en· Discrete Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
afffundno abstractunlabeled
Divisible design Cayley digraphs
Dean Crnković, Hadi Kharaghani, Andrea Švob
2019· preprint· en· Discrete Mathematics· Engineering
distilled prediction:candidate · metaepi_narrowconsensus · none
0
citations
affunlabeled
Hamiltonicity of transitive graphs whose automorphism group has <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.svg"> <mml:msub> <mml:mrow> <mml:mi mathvariant="double-struck">Z</mml:mi> </mml:mrow> <mml:mrow> <mml:mi>p</mml:mi> </mml:mrow> </mml:msub> </mml:math> as commutator subgroups
Florian Lehner, Farzad Maghsoudi, Babak Miraftab
2025· article· lv· Discrete Mathematics· Mathematics
distilled prediction:candidate · metaepi_narrow+sts+scholarly_communication+research_integrity+insufficient_payloadconsensus · metaepi_narrow+sts+research_integrity+insufficient_payload
0
citations
affno abstractunlabeled
<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si6.gif" display="inline" overflow="scroll"><mml:mrow><mml:mo>{</mml:mo><mml:mn>0</mml:mn><mml:mo>,</mml:mo><mml:mn>2</mml:mn><mml:mo>}</mml:mo></mml:mrow></mml:math>-Degree free spanning forests in graphs
Kenta Ozeki, Abbas Rezaei, Rahmtin Rotabi
2015· article· lv· Discrete Mathematics· Computer Science
distilled prediction:candidate · metaepi_narrow+sts+scholarly_communication+open_science+research_integrity+insufficient_payloadconsensus · metaepi_narrow+sts+research_integrity+insufficient_payload
0
citations
afffundno abstractunlabeled
The threshold strong dimension of a graph
Nadia Benakli, Novi H. Bong, Shonda Dueck, Linda Eroh, Beth Novick, Ortrud R. Oellermann
2021· preprint· en· Discrete Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Preface
Jeff Dinitz, Hadi Kharaghani, G. B. Khosrovshahi, Shahriar Shahriari
2009· article· en· Discrete Mathematics
distilled prediction:candidate · insufficient_payloadconsensus · none
0
citations
affno abstractunlabeled
Preface
Geňa Hahn, Bojan Mohar
2011· article· en· Discrete Mathematics
distilled prediction:candidate · insufficient_payloadconsensus · insufficient_payload
0
citations
affno abstractunlabeled
Graph covers using t-colourable vertex sets
Sylvain Gravier, Jeannette Janssen, K. Kilakos, Sulamita Klein
2003· article· en· Discrete Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
On nice and injective-nice tournaments
Tina Rapke, K. Seyffarth
2017· article· en· Discrete Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Tight incomplete block designs
Izabela Adamczak, Donald L. Kreher, Rolf S. Rees
2004· article· en· Discrete Mathematics· Engineering
distilled prediction:candidate · noneconsensus · none
0
citations
afffundno abstractunlabeled
Almost all <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" display="inline" overflow="scroll"> <mml:mi>k</mml:mi> </mml:math> -cop-win graphs contain a dominating set of cardinality <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si2.gif" display="inline" overflow="scroll"> <mml:mi>k</mml:mi> </mml:math>
Paweł Prałat
2014· article· en· Discrete Mathematics· Mathematics
distilled prediction:candidate · metaepi_narrow+sts+scholarly_communication+research_integrity+insufficient_payloadconsensus · metaepi_narrow+research_integrity
0
citations
affno abstractunlabeled
Extended Petersen graphs
Peter Horák, Alexander Rosa
2005· article· en· Discrete Mathematics· Engineering
distilled prediction:candidate · noneconsensus · none
0
citations
afffundno abstractunlabeled
On the roots of Wiener polynomials of graphs
Jason I. Brown, Lucas Mol, Ortrud R. Oellermann
2018· preprint· en· Discrete Mathematics· Mathematics
distilled prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Preface
Pavol Hell, Wilfried Imrich, Jaroslav Nešetřil
2011· article· en· Discrete Mathematics
distilled prediction:candidate · insufficient_payloadconsensus · insufficient_payload
0
citations
affno abstractunlabeled
Disjoint paths in arborescences
Livio Colussi, Michele Conforti, Giacomo Zambelli
2005· article· en· Discrete Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
A characterization of <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si4.gif" overflow="scroll"><mml:msub><mml:mrow><mml:mi>P</mml:mi></mml:mrow><mml:mrow><mml:mn>4</mml:mn></mml:mrow></mml:msub></mml:math>-comparability graphs
Celina M.H. de Figueiredo, Chı́nh T. Hoàng, Frédéric Maffray
2006· article· lv· Discrete Mathematics· Computer Science
distilled prediction:candidate · metaepi_narrow+sts+scholarly_communication+research_integrity+insufficient_payloadconsensus · insufficient_payload
0
citations
affno abstractunlabeled
Backbone colourings of graphs
Babak Farzad, Arnoosh Golestanian, Michael Molloy
2016· article· en· Discrete Mathematics· Neuroscience
distilled prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Optimal linear rate 12 codes over F5 and F7
T. Aaron Gulliver, Patric R. J. Östergård, Nikolai Senkevitch
2003· article· en· Discrete Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
afffundno abstractunlabeled
Laplacian pretty good fractional revival
Ada Chan, Bobae Johnson, Mengzhen Liu, Malena Schmidt, Zhanghan Yin, Hanmeng Zhan
2022· article· en· Discrete Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Hall sets, Lazard sets and comma-free codes
Dominique Perrin, Christophe Reutenauer
2017· preprint· en· Discrete Mathematics· Mathematics
distilled prediction:candidate · metaepi_narrowconsensus · metaepi_narrow
0
citations
afffundno abstractunlabeled
Orthogonally Resolvable Matching Designs
Peter Danziger, Sophia Park
2017· preprint· en· Discrete Mathematics· Engineering
distilled prediction:candidate · metaepi_narrowconsensus · none
0
citations
afffundno abstractunlabeled
A cop-winning strategy on strongly cop-win graphs
Josée Desharnais, François Laviolette, Héli Marcoux, Norbert Polat
2023· article· en· Discrete Mathematics· Computer Science
distilled prediction:candidate · insufficient_payloadconsensus · none
0
citations
affno abstractunlabeled
Quaternary Legendre pairs II
Ilias Kotsireas, Christoph Koutschan, Arne Winterhof
2025· article· en· Discrete Mathematics· Mathematics
distilled prediction:candidate · metaepi_narrowconsensus · none
0
citations
← previousnext →

How this was built: Screen · Findings · About