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 7 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
Tough graphs and hamiltonian circuits
2006· article· en· Discrete Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
25
citations
affno abstractunlabeled
Finding a maximum-weight induced <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>-partite subgraph of an <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si2.gif" display="inline" overflow="scroll"><mml:mi>i</mml:mi></mml:math>-triangulated graph
2008· article· en· Discrete Applied Mathematics· Computer Science
distilled prediction:candidate · metaepi_narrow+sts+scholarly_communication+research_integrity+insufficient_payloadconsensus · metaepi_narrow+research_integrity
25
citations
affno abstractunlabeled
Pure pairs. I. Trees and linear anticomplete pairs
2020· article· en· Oxford University Research Archive (ORA) (University of Oxford)· Computer Science
distilled prediction:candidate · metaepi_narrow+stsconsensus · none
24
citations
afffundno abstractunlabeled
On color-critical (<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si4.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>,co-<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si4.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
2016· article· lv· Discrete Applied Mathematics· Computer Science
distilled prediction:candidate · metaepi_narrow+sts+scholarly_communication+open_science+research_integrity+insufficient_payloadconsensus · metaepi_narrow+sts+open_science+research_integrity+insufficient_payload
24
citations
affno abstractunlabeled
Simultaneous Interval Graphs
2010· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrow+open_science+research_integrityconsensus · none
24
citations
afffundno abstractunlabeled
Broadcasts and domination in trees
2010· article· en· Discrete Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
24
citations
afffundunlabeled
Coloring-flow duality of embedded graphs
2004· article· en· Transactions of the American Mathematical Society· Computer Science
distilled prediction:candidate · noneconsensus · none
23
citations
venueno affno abstractunlabeled
On Some Rational Difference Equations.
2009· article· en· Ars Combinatoria· Computer Science
distilled prediction:candidate · noneconsensus · none
23
citations
affunlabeled
Egalitarian Graph Orientations
2017· article· en· Journal of Graph Algorithms and Applications· Computer Science
distilled prediction:candidate · noneconsensus · none
23
citations
affno abstractunlabeled
Density of 5/2-critical graphs
2016· article· en· COMBINATORICA· Computer Science
distilled prediction:candidate · noneconsensus · none
22
citations
affno abstractunlabeled
Roman Domination over Some Graph Classes
2005· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
22
citations
afffundunlabeled
Towards a structure theory for matrices and matroids
2007· article· en· Proceedings of the International Congress of Mathematicians Madrid, August 22–30, 2006· Computer Science
distilled prediction:candidate · noneconsensus · none
21
citations
affno abstractunlabeled
Perfect Roman domination in graphs
2019· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
21
citations
afffundno abstractunlabeled
On graphs that are not PCGs
2015· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · stsconsensus · none
21
citations
affunlabeled
Sparse universal graphs for planarity
2023· article· en· Journal of the London Mathematical Society· Computer Science
distilled prediction:candidate · noneconsensus · none
20
citations
← previousnext →

How this was built: Screen · Findings · About