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 10 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 teacher distillation outputs. Candidate is the union; consensus is the intersection.

affno abstractunlabeled
The average size of maximal matchings in graphs
Alain Hertz, Sébastien Bonte, Gauvain Devillez, Hadrien Mélot
2024· article· en· Journal of Combinatorial Optimization· Mathematics
distilled prediction:candidate · noneconsensus · none
2
citations
afffundunlabeled
Maximizing the mean subtree order
Lucas Mol, Ortrud R. Oellermann
2018· preprint· en· Journal of Graph Theory· Mathematics
distilled prediction:candidate · noneconsensus · none
2
citations
venueno affunlabeled
The Erdős–Rado Arrow for Singular Cardinals
Saharon Shelah
2009· article· en· Canadian Mathematical Bulletin· Mathematics
distilled prediction:candidate · insufficient_payloadconsensus · insufficient_payload
2
citations
afffundunlabeled
Two-sided Lieb–Thirring bounds
Sven Bachmann, Richard Froese, Severin Schraven
2024· article· en· Journal of Mathematical Physics· Mathematics
distilled prediction:candidate · noneconsensus · none
2
citations
venueno affunlabeled
On Lanzhou Index of Graphs
Somnath Bera, Kinkar Chandra Das
2023· article· en· Ars Combinatoria· Mathematics
distilled prediction:candidate · noneconsensus · none
2
citations
venueno affno abstractunlabeled
Average degrees of critical graphs.
Xuechao Li
2005· article· en· Ars Combinatoria· Mathematics
distilled prediction:candidate · noneconsensus · none
2
citations
venueno affno abstractunlabeled
Harmonic index of dense graphs.
Jianxi Liu
2015· article· en· Ars Combinatoria· Mathematics
distilled prediction:candidate · noneconsensus · none
2
citations
fundno affunlabeled
Computing the Wiener Index of a Phenylenic Pattern
M. R. Darafsheh, Hassan Jolany, M. H. Khalifeh
2011· article· en· Fullerenes Nanotubes and Carbon Nanostructures· Mathematics
distilled prediction:candidate · noneconsensus · none
1
citations
venueno affno abstractunlabeled
On the spectra of tricyclic graphs.
Ruifang Liu, Huicai Jia, Jinlong Shu
2011· article· en· Ars Combinatoria· Mathematics
distilled prediction:candidate · noneconsensus · none
1
citations
venueno affno abstractunlabeled
Laplacian Eigenvalues and the Excess of a Graph.
Juan A. Rodríguez-Velázáuez, J.L.A. Yebra
2002· article· en· Ars Combinatoria· Mathematics
distilled prediction:candidate · noneconsensus · none
1
citations
venueno affno abstractunlabeled
The Generalized Pell p-Sequences in Groups.
Ömür Deveci, Merve Akdeniz, Erdal Karaduman
2015· article· en· Ars Combinatoria· Mathematics
distilled prediction:candidate · noneconsensus · none
1
citations
venueno affno abstractunlabeled
On the Laplacian-Energy-Like of graphs.
Zhifu You, Bo Liu
2013· article· en· Ars Combinatoria· Mathematics
distilled prediction:candidate · noneconsensus · none
1
citations
venueno affno abstractunlabeled
The Lattice Polynomial of a Graph.
Jonathan P. Wiens, Kara Nance
2000· article· en· Ars Combinatoria· Mathematics
distilled prediction:candidate · noneconsensus · none
1
citations
venueno affno abstractunlabeled
On the matching polynomial of theta graphs.
Hailiang Zhang, Jinlong Shu
2012· article· en· Ars Combinatoria· Mathematics
distilled prediction:candidate · noneconsensus · none
1
citations
venueno affno abstractunlabeled
Defensive alliances in circulant graphs.
Gabriela Araujo‐Pardo, Lali Barrière
2014· article· en· Ars Combinatoria· Mathematics
distilled prediction:candidate · noneconsensus · none
1
citations
venueno affno abstractunlabeled
Harmonic index of graphs with more than one cut-vertex.
J. Amalorpava Jerline, L. Benedict Michaelraj, K. Dhanalakshmi, P Syamala
2017· article· en· Ars Combinatoria· Mathematics
distilled prediction:candidate · noneconsensus · none
1
citations
venueno affno abstractunlabeled
On Vertex Matching Polynomial of Graphs.
Gholam Hossein Fath-Tabar, Amir Loghman
2012· article· en· Ars Combinatoria· Mathematics
distilled prediction:candidate · noneconsensus · none
1
citations
fundno affunlabeled
Fiedler vectors with unbalanced sign patterns
Sooyeong Kim, Steve Kirkland
2021· article· en· Czechoslovak Mathematical Journal· Mathematics
distilled prediction:candidate · insufficient_payloadconsensus · none
1
citations
← previousnext →

How this was built: Screen · Findings · About