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
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. 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
Tough graphs and hamiltonian circuits
Vašek Chvátal
2006· article· en· Discrete Mathematics· Computer Science
machine 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
Louigi Addario‐Berry, W. Sean Kennedy, Andrew D. King, Zhentao Li, Bruce Reed
2008· article· en· Discrete Applied Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
25
citations
afffundunlabeled
Improper coloring of unit disk graphs
Frédéric Havet, Ross J. Kang, Jean‐Sébastien Sereni
2009· article· en· Networks· Computer Science
machine prediction:candidate · noneconsensus · 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
Harjinder S. Dhaliwal, Angèle M. Hamel, Chı́nh T. Hoàng, Frédéric Maffray, Tyler J. D. McConnell, Stefan A. Panait
2016· article· lv· Discrete Applied Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
24
citations
affno abstractunlabeled
On the monotonicity of the broadcast function
Hovhannes A. Harutyunyan, Arthur L. Liestman
2003· article· en· Discrete Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
24
citations
affno abstractunlabeled
Simultaneous Interval Graphs
Krishnam Raju Jampani, Anna Lubiw
2010· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
24
citations
afffundno abstractunlabeled
Broadcasts and domination in trees
E. J. Cockayne, Sarada Herke, Christina M. Mynhardt
2010· article· en· Discrete Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
24
citations
affno abstractunlabeled
Paths with two blocks in n-chromatic digraphs
Louigi Addario‐Berry, Frédéric Havet, Stéphan Thomassé
2006· article· en· Journal of Combinatorial Theory Series B· Computer Science
machine prediction:candidate · noneconsensus · none
23
citations
affno abstractunlabeled
Biconvex graphs: ordering and algorithms
Nesrine Abbas, Lorna Stewart
2000· article· en· Discrete Applied Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
23
citations
afffundunlabeled
Coloring-flow duality of embedded graphs
Matt DeVos, Luis Goddyn, Bojan Mohar, Dirk Vertigan, Xuding Zhu
2004· article· en· Transactions of the American Mathematical Society· Computer Science
machine prediction:candidate · noneconsensus · none
23
citations
venueno affno abstractunlabeled
On Some Rational Difference Equations.
Bratislav Iričanin, Stevo Stević
2009· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
23
citations
affunlabeled
Egalitarian Graph Orientations
Glencora Borradaile, Jennifer Iglesias, Theresa Migler, Antonio Ochoa, Gordon Wilfong, Lisa Zhang
2017· article· en· Journal of Graph Algorithms and Applications· Computer Science
machine prediction:candidate · noneconsensus · none
23
citations
affno abstractunlabeled
Minimum Cost Homomorphisms to Reflexive Digraphs
Arvind Gupta, Pavol Hell, Arash Rafiey
2008· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
22
citations
affno abstractunlabeled
Density of 5/2-critical graphs
Zdenĕk Dvořák, Luke Postle
2016· article· en· COMBINATORICA· Computer Science
machine prediction:candidate · noneconsensus · none
22
citations
affno abstractunlabeled
Roman Domination over Some Graph Classes
Mathieu Liedloff, Ton Kloks, Jiping Liu, Sheng‐Lung Peng
2005· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
22
citations
afffundunlabeled
A finer reduction of constraint problems to digraphs
Jakub Bulín, Dejan Delić, Marcel Jackson, Todd Niven
2015· article· en· Logical Methods in Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
21
citations
afffundunlabeled
Towards a structure theory for matrices and matroids
Jim Geelen, Bert Gerards, Geoff Whittle
2007· article· en· Proceedings of the International Congress of Mathematicians Madrid, August 22–30, 2006· Computer Science
machine prediction:candidate · noneconsensus · none
21
citations
affno abstractunlabeled
Perfect Roman domination in graphs
S. S. Banerjee, Julian Keil, D. Pradhan
2019· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
21
citations
affno abstractunlabeled
On the geodesic pre-hull number of a graph
Norbert Polat, Gert Sabidussi
2008· article· en· European Journal of Combinatorics· Computer Science
machine prediction:candidate · noneconsensus · none
21
citations
afffundno abstractunlabeled
On graphs that are not PCGs
Stéphane Durocher, Debajyoti Mondal, Md. Saidur Rahman
2015· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
21
citations
afffundunlabeled
Vertex Cover Reconfiguration and Beyond
Amer E. Mouawad, Naomi Nishimura, Venkatesh Raman, Sebastian Siebertz
2018· article· en· Algorithms· Computer Science
machine prediction:candidate · noneconsensus · none
21
citations
affunlabeled
Sparse universal graphs for planarity
Louis Esperet, Gwenaël Joret, Pat Morin
2023· article· en· Journal of the London Mathematical Society· Computer Science
machine prediction:candidate · noneconsensus · none
20
citations
affno abstractunlabeled
Practical and Efficient Circle Graph Recognition
Emeric Gioan, Christophe Paul, Marc Tedder, Derek G. Corneil
2013· article· en· Algorithmica· Computer Science
machine prediction:candidate · noneconsensus · none
20
citations
← previousnext →

How this was built: Screen · Findings · About