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
Year range
→
Sort
Language
Type
Field
Venue
Topic
Advanced Graph Theory Research
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.

2,515 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.
2,515 works in the cohort · of 4,299,418page 3 of 51

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

affno abstractunlabeled
Rebuilding convex sets in graphs
2005· article· en· Discrete Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
52
citations
afffundno abstractunlabeled
Cops and Robbers from a distance
2010· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · stsconsensus · none
50
citations
affno abstractunlabeled
Profinite Graphs and Groups
2017· book· de· Ergebnisse der Mathematik und ihrer Grenzgebiete· Computer Science
distilled prediction:candidate · metaepi_narrow+sts+scholarly_communication+open_science+research_integrity+insufficient_payloadconsensus · metaepi_narrow+sts+research_integrity
49
citations
afffundno abstractunlabeled
Perfect Roman domination in trees
2017· article· en· Discrete Applied Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
49
citations
affno abstractunlabeled
Eigenvalues and colorings of digraphs
2009· article· en· Linear Algebra and its Applications· Computer Science
distilled prediction:candidate · noneconsensus · none
48
citations
affno abstractunlabeled
Matching, matroids, and extensions
2002· article· en· Mathematical Programming· Computer Science
distilled prediction:candidate · noneconsensus · none
47
citations
affunlabeled
Protecting a graph with mobile guards
2016· article· en· Digital Object Identifier (DOI) Repository Serbia (National Library of Serbia)· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
46
citations
affunlabeled
Elimination graphs
2012· article· en· ACM Transactions on Algorithms· Computer Science
distilled prediction:candidate · noneconsensus · none
46
citations
affno abstractunlabeled
Strategies for Hotlink Assignments
2000· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
45
citations
affno abstractunlabeled
On bags and bugs
2007· article· en· Discrete Applied Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
45
citations
affno abstractunlabeled
Excluding a planar graph from<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:mi mathvariant="normal">GF</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>q</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math>-representable matroids
2007· article· lv· Journal of Combinatorial Theory Series B· Computer Science
distilled prediction:candidate · metaepi_narrow+sts+scholarly_communication+research_integrity+insufficient_payloadconsensus · metaepi_narrow+research_integrity+insufficient_payload
45
citations
affunlabeled
Star Chromatic Index
2012· article· en· Journal of Graph Theory· Computer Science
distilled prediction:candidate · noneconsensus · none
45
citations
affno abstractunlabeled
How to build a brick
2006· article· en· Discrete Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
45
citations
affno abstractunlabeled
Balanced vertex-orderings of graphs
2005· article· en· Discrete Applied Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
44
citations
affunlabeled
Tree embeddings
2001· article· en· Journal of Graph Theory· Computer Science
distilled prediction:candidate · noneconsensus · none
44
citations
afffundno abstractunlabeled
Constructions of<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si11.gif" display="inline" overflow="scroll"><mml:mi>k</mml:mi></mml:math>-critical<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si12.gif" display="inline" overflow="scroll"><mml:msub><mml:mrow><mml:mi>P</mml:mi></mml:mrow><mml:mrow><mml:mn>5</mml:mn></mml:mrow></mml:msub></mml:math>-free graphs
2014· article· lv· Discrete Applied Mathematics· Computer Science
distilled prediction:candidate · metaepi_narrow+sts+scholarly_communication+open_science+research_integrity+insufficient_payloadconsensus · metaepi_narrow+sts+research_integrity+insufficient_payload
44
citations
affno abstractunlabeled
On the divisibility of graphs
2002· article· en· Discrete Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
43
citations
affno abstractunlabeled
On the Roots of Domination Polynomials
2013· article· en· Graphs and Combinatorics· Computer Science
distilled prediction:candidate · noneconsensus · none
43
citations
affno abstractunlabeled
The Largest Small Octagon
2002· article· en· Journal of Combinatorial Theory Series A· Computer Science
distilled prediction:candidate · noneconsensus · none
43
citations
affno abstractunlabeled
Locally planar graphs are 5-choosable
2008· article· en· Journal of Combinatorial Theory Series B· Computer Science
distilled prediction:candidate · noneconsensus · none
41
citations
affno abstractunlabeled
Weakly chordal graph algorithms via handles
2000· article· en· Symposium on Discrete Algorithms· Computer Science
distilled prediction:candidate · metaepi_narrow+insufficient_payloadconsensus · none
41
citations
← previousnext →

How this was built: Screen · Findings · About