MétaCan
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.

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

aboutno affunlabeled
On Molecular Descriptors of Carbon Nanocones
Waqas Nazeer, Adeel Farooq, Mohammad Younas, Mobeen Munir, Shin Min Kang
2018· article· en· Biomolecules· Mathematics
machine prediction:candidate · noneconsensus · none
38
citations
affno abstractunlabeled
On zeta elements for Gm
David Burns, Masato Kurihara, Takamichi Sano
2016· article· en· Mathematics
machine prediction:candidate · noneconsensus · none
37
citations
affno abstractunlabeled
Constructably Laplacian integral graphs
Steve Kirkland
2006· article· en· Linear Algebra and its Applications· Mathematics
machine prediction:candidate · noneconsensus · none
35
citations
affno abstractunlabeled
On the extreme eigenvalues of regular graphs
Sebastian M. Cioabă
2005· article· en· Journal of Combinatorial Theory Series B· Mathematics
machine prediction:candidate · noneconsensus · none
35
citations
affno abstractunlabeled
On a conjecture about the Randić index
Mustapha Aouchiche, Pierre Hansen
2006· article· en· Discrete Mathematics· Mathematics
machine prediction:candidate · noneconsensus · none
33
citations
venueno affunlabeled
On molecular topological properties of dendrimers
Syed Ahtsham Ul Haq Bokhary, Muhammad Imran, Sadia Manzoor
2015· article· en· Canadian Journal of Chemistry· Mathematics
machine prediction:candidate · noneconsensus · none
33
citations
affunlabeled
Heavy cycles in weighted graphs
J. A. Bondy, Hajo Broersma, Jan van den Heuvel, H.J. Veldman
2002· article· en· Discussiones Mathematicae Graph Theory· Mathematics
machine prediction:candidate · noneconsensus · none
32
citations
afffundno abstractunlabeled
Equiangular lines and covers of the complete graph
Gabriel Coutinho, Chris Godsil, Hamed Shirazi
2015· article· en· Linear Algebra and its Applications· Mathematics
machine prediction:candidate · noneconsensus · none
32
citations
affunlabeled
On a Problem of Marco Buratti
Peter Horák, Alexander Rosa
2009· article· en· The Electronic Journal of Combinatorics· Mathematics
machine prediction:candidate · noneconsensus · none
30
citations
affno abstractunlabeled
Polynomially Solvable Cases of the TSP
Santosh N. Kabadi
2006· book-chapter· en· Combinatorial optimization· Mathematics
machine prediction:candidate · noneconsensus · none
29
citations
affno abstractunlabeled
Inertia and biclique decompositions of joins of graphs
David A. Gregory, Brenda Heyink, Kevin N. Vander Meulen
2003· article· en· Journal of Combinatorial Theory Series B· Mathematics
machine prediction:candidate · noneconsensus · none
28
citations
affno abstractunlabeled
Energy ordering of unicyclic graphs
Ailian Chen, An Chang, Wai Chee Shiu
2006· article· en· HKBU Institutional Repository (Hong Kong Baptist University)· Mathematics
machine prediction:candidate · noneconsensus · none
28
citations
affunlabeled
Motives and Algebraic Cycles
Rob de Jeu, James Lewis
2009· book· en· American Mathematical Society eBooks· Mathematics
machine prediction:candidate · noneconsensus · none
27
citations
afffundno abstractunlabeled
Boundary uniqueness of fusenes
Xiaofeng Guo, Pierre Hansen, Maolin Zheng
2002· article· en· Discrete Applied Mathematics· Mathematics
machine prediction:candidate · noneconsensus · none
27
citations
affno abstractunlabeled
Planarity of iterated line graphs
M. Ghebleh, Mahdad Khatirinejad
2007· article· en· Discrete Mathematics· Mathematics
machine prediction:candidate · noneconsensus · none
24
citations
affunlabeled
Distance Spectra of Graphs: A Survey
Mustapha Aouchiche, Pierre Hansen
2013· article· fr· Les Cahiers du GERAD· Mathematics
machine prediction:candidate · noneconsensus · none
23
citations
affno abstractunlabeled
Independent Sets In Association Schemes
Chris Godsil, Michael Newman
2006· article· en· COMBINATORICA· Mathematics
machine prediction:candidate · noneconsensus · none
23
citations

How this was built: Screen · Findings · About