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 Labeling and Dimension Problems
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.

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

Labels cover 1 of 807 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 807 of 807 works in this cohort. Predictions are machine_predicted_unvalidated teacher distillation outputs. Candidate is the union; consensus is the intersection.

venueno affno abstractunlabeled
On endotype of bipartite graphs.
Weimin Li
2013· article· en· Ars Combinatoria· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
venueno affno abstractunlabeled
On Co-PI Index of Graphs.
G. Sharmiladevi, V. Kaladev
2018· article· en· Ars Combinatoria· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
venueno affno abstractunlabeled
On edge cover coloring of join graphs.
Jingbo Li, Guizhen Liu, Bin Liu
2011· article· en· Ars Combinatoria· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
venueno affno abstractunlabeled
On the spectral radius of books.
Shijie Jiao, Bo Zhou
2018· article· en· Ars Combinatoria· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
venueno affunlabeled
On 3-coloring of plane triangulations
Atsuhiro Nakamoto, Katsuhiro Ota, Mamoru Watanabe
2005· article· en· Ars Combinatoria· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
aboutno affunlabeled
Cosine Infinite Product: 11210.
Mihály Bencze, Heinz-Jürgen Seiffert
2007· article· en· American Mathematical Monthly· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
venueno affno abstractunlabeled
Toughness of Kronecker product of graphs.
Raxida Guji, Tursun Ali
2016· article· en· Ars Combinatoria· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
venueno affunlabeled
A Class of ‘n’ Distant Graceful Trees
Debdas Mishra, Amaresh C. Panda, Rajani Ballav Dash
2011· article· en· Studies in mathematical sciences· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Pursuit-evasion games on Latin square graphs
Shreya Ahirwar, Anthony Bonato, Leanna Gittins, Alice Huang, Trent G. Marbach, Tomer Zaidman
2023· article· en· Journal of Combinatorics· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
afffundno abstractunlabeled
The threshold strong dimension of a graph
Nadia Benakli, Novi H. Bong, Shonda Dueck, Linda Eroh, Beth Novick, Ortrud R. Oellermann
2021· preprint· en· Discrete Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Literature Highlights in Combinatorial Science: QSAR Comb. Sci. 9/2005
Dirk Strübing, Helfried Neumann, S Simon Hübner, S. Klaus, Matthias Beller, Jian Zhang +15 more
2005· article· en· QSAR & Combinatorial Science· Computer Science
distilled prediction:candidate · metaepi_narrow+sts+scholarly_communication+open_scienceconsensus · sts
0
citations
venueno affunlabeled
The Graph of Simplex Vertices
M. El-Ghoul, N. El-Obaidi
2012· article· en· Journal of Mathematics Research· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
afffundunlabeled
Summing the largest prime factor over integer sequences
Jean–Marie De Koninck, Rafael Jakimczuk
2024· article· es· Revista de la Unión Matemática Argentina· Computer Science
distilled prediction:candidate · metaepi_narrow+scholarly_communication+insufficient_payloadconsensus · none
0
citations
afffundno abstractunlabeled
The threshold dimension of a graph
Lucas Mol, Matthew J. H. Murphy, Ortrud R. Oellermann
2020· preprint· en· Discrete Applied Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
aboutno affunlabeled
Episode 747: Jets vs. Blues tonight, Bettman visits
2024· other· en· Bulletin of Miscellaneous Information (Royal Gardens Kew)· Computer Science
distilled prediction:candidate · metaepi_narrow+insufficient_payloadconsensus · insufficient_payload
0
citations
affno abstractunlabeled
Classification of Perfect Unitary Cayley Graphs
Ján Mináč, Tung Nguyen, Duy Tân Nguyễn
2025· preprint· en· SSRN Electronic Journal· Computer Science
distilled prediction:candidate · metaepi_narrow+research_integrityconsensus · none
0
citations
afffundno abstractunlabeled
The localization game on oriented graphs
Anthony Bonato, Ryan Cushman, Trent G. Marbach, Brittany Pittman
2023· article· en· Discrete Applied Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
venueno affno abstractunlabeled
Matching in Toeplitz graphs.
Farzaneh Ramezani, Mehdi Tale Masouleh
2018· article· en· Ars Combinatoria· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
affunlabeled
The minimum labeling Hamiltonian cycle problem
Frédéric Semet, Nicolas Jozefowiez
2011· preprint· en· HAL (Le Centre pour la Communication Scientifique Directe)· Computer Science
distilled prediction:candidate · metaepi_narrow+scholarly_communicationconsensus · none
0
citations
venueno affno abstractunlabeled
On (a, b;n)-graceful labeling of path Pn.
Zhang Zhi-shang, Qingcheng Zhang, Chunyue Wang
2017· article· en· Ars Combinatoria· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
venueno affno abstractunlabeled
On α-labelling of disconneted graphs.
Maged Z. Youssef
2015· article· en· Ars Combinatoria· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
venueno affunlabeled
The Rainbow Mean Index of Corona Product of Graphs
K Maheswari, G. Rajasekaran
2025· article· en· International Journal of Analysis and Applications· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations

How this was built: Screen · Findings · About