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
Graph theory and applications
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.

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

Labels cover 1 of 889 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 889 of 889 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.

venueno affunlabeled
Some results about star-factors in graphs
Sizhong Zhou, Xu Yang, Zhiren Sun
2024· article· en· Contributions to Discrete Mathematics· Mathematics
machine prediction:candidate · noneconsensus · none
13
citations
affunlabeled
Roots of cube polynomials of median graphs
Boštjan Brešar, Sandi Klavžar, Riste Škrekovski
2006· article· en· Journal of Graph Theory· Mathematics
machine prediction:candidate · noneconsensus · none
13
citations
affunlabeled
Computing Kemeny's constant for a barbell graph
Jane Breen, Steve Butler, Nicklas Day, Colt DeArmond, Kate Lorenzen, Haoyang Qian +1 more
2019· article· en· Electronic Journal of Linear Algebra· Mathematics
machine prediction:candidate · noneconsensus · none
13
citations
affno abstractunlabeled
Fundamentals of fractional revival in graphs
Ada Chan, Gabriel Coutinho, Whitney Drazen, Or Eisenberg, Chris Godsil, Mark Kempton +3 more
2022· article· en· Linear Algebra and its Applications· Mathematics
machine prediction:candidate · noneconsensus · none
13
citations
afffundunlabeled
Refined inertias of tree sign-patterns
Colin Garnett, D.D. Olesky, P. van den Driessche
2013· article· en· Electronic Journal of Linear Algebra· Mathematics
machine prediction:candidate · noneconsensus · none
13
citations
affno abstractunlabeled
The distance spectrum of complements of trees
Huiqiu Lin, S.W. Drury
2017· article· en· Linear Algebra and its Applications· Mathematics
machine prediction:candidate · noneconsensus · none
13
citations
venueno affno abstractunlabeled
On the normalized Laplacian eigenvalues of graphs.
Kinkar Chandra Das, Ayşe Dilek Güngör, Ş. Burcu Bozkurt
2015· article· en· Ars Combinatoria· Mathematics
machine prediction:candidate · noneconsensus · none
13
citations
affno abstractunlabeled
Graphs
Chris Godsil, Gordon Royle
2001· book-chapter· en· Graduate texts in mathematics· Mathematics
machine prediction:candidate · noneconsensus · none
13
citations
venueno affunlabeled
Some Results On Q-Integral Graphs.
Zoran Stanić
2009· article· en· Ars Combinatoria· Mathematics
machine prediction:candidate · noneconsensus · none
12
citations
affunlabeled
Expander graphs and gaps between primes
Sebastian M. Cioabă, M. Ram Murty
2008· article· en· Forum Mathematicum· Mathematics
machine prediction:candidate · noneconsensus · none
12
citations
affno abstractunlabeled
Colorings and spectral radius of digraphs
S.W. Drury, Huiqiu Lin
2015· article· en· Discrete Mathematics· Mathematics
machine prediction:candidate · noneconsensus · none
12
citations
affno abstractunlabeled
On the determinant of bipartite graphs
Khodakhast Bibak
2013· article· en· Discrete Mathematics· Mathematics
machine prediction:candidate · noneconsensus · none
12
citations
affunlabeled
Analysis of Internet topology data
J. Chen, Ljiljana Trajković
2004· article· en· Mathematics
machine prediction:candidate · noneconsensus · none
11
citations
afffundunlabeled
Maximum spread of graphs and bipartite graphs
Jane Breen, Alex W. N. Riasanovsky, Michael Tait, John Urschel
2022· article· en· Communications of the American Mathematical Society· Mathematics
machine prediction:candidate · noneconsensus · none
10
citations
afffundunlabeled
Levinson's theorem for graphs
Andrew M. Childs, DJ Strouse
2011· article· en· Journal of Mathematical Physics· Mathematics
machine prediction:candidate · noneconsensus · none
10
citations
venueno affno abstractunlabeled
The Extremal Matching Energy of Graphs.
Shengjin Ji, Hongping Ma
2014· article· en· Ars Combinatoria· Mathematics
machine prediction:candidate · noneconsensus · none
9
citations
← previousnext →

How this was built: Screen · Findings · About