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

afffundno abstractunlabeled
Displaying blocking pairs in signed graphs
Bertrand Guenin, Irene Pivotto, Paul Wollan
2015· article· en· European Journal of Combinatorics· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
venueno affunlabeled
C-Perfect K-Uniform Hypergraphs.
Changiz Eslahchi, Arash Rafiey
2006· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
venueno affno abstractunlabeled
The Forcing Domination Numbers Of Some Graphs.
Abdollah Khodkar, Seyed Mahmoud Sheikholeslami
2007· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
affunlabeled
Sketching Distances in Monotone Graph Classes
Louis Esperet, Nathaniel Harms, Andrey Kupavskii
2022· preprint· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
affno abstractunlabeled
Vertex arboricity of integer distance graph <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si11.gif" display="inline" overflow="scroll"><mml:mi>G</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mrow><mml:mi>D</mml:mi></mml:mrow><mml:mrow><mml:mi>m</mml:mi><mml:mo>,</mml:mo><mml:mi>k</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:math>
Liancui Zuo, Qinglin Yu, Jianliang Wu
2008· article· lv· Discrete Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
venueno affunlabeled
On Tape Graphs
M. El-Ghoul, H. El-Zohny, Muayyad Mahmood Khalil
2010· article· en· Journal of Mathematics Research· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
affunlabeled
Improved bounds for colouring circle graphs
James C. Davies
2022· preprint· en· Proceedings of the American Mathematical Society· Computer Science
machine 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
machine prediction:candidate · noneconsensus · none
2
citations
affno abstractunlabeled
Graph homomorphisms via vector colorings
Chris Godsil, David E. Roberson, Brendan Rooney, Robert Šámal, Antonios Varvitsiotis
2019· preprint· en· European Journal of Combinatorics· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
venueno affno abstractunlabeled
Alternating Domination In Arc-Colored Digraphs.
Pietra Delgado-Escalante, Hortensia Galeana‐Sánchez
2009· article· en· Ars Combinatoria· Computer Science
machine 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
machine prediction:candidate · noneconsensus · none
2
citations
affno abstractunlabeled
On the 3-Tree Core of Plane Graphs
Debajyoti Mondal, Md. Saidur Rahman
2024· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
affno abstractunlabeled
The ultimate categorical matching in a graph
Michael Albert, Derek Holton, Richard J. Nowakowski
2001· article· en· Discrete Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
venueno affno abstractunlabeled
On a-valuations of disconnected graphs.
Saad I. El‐Zanati, Charles Vanden Eynden
2001· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
affno abstractunlabeled
Bicircular matroids are 3-colorable
Luis Goddyn, Winfried Hochstättler, Nancy Ann Neudauer
2016· article· en· Discrete Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
← previousnext →

How this was built: Screen · Findings · About