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
Discussiones Mathematicae Graph Theory
Topic
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.

26 results · 1 filter active ·
Results by year
20022023
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.
26 works in the cohort · of 4,299,418page 1 of 1

Labels cover 0 of 26 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 26 of 26 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.

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
affno abstractunlabeled
Minimal trees and monophonic convexity
José Cáceres, Ortrud R. Oellermann, María Luz Puertas
2012· article· en· Discussiones Mathematicae Graph Theory· Computer Science
machine prediction:candidate · noneconsensus · none
17
citations
affunlabeled
A new framework to approach Vizing's conjecture
Boštjan Brešar, Bert L. Hartnell, Michael A. Henning, Kirsti Kuenzel, Douglas F. Rall
2020· article· en· Discussiones Mathematicae Graph Theory· Mathematics
machine prediction:candidate · noneconsensus · none
8
citations
affno abstractunlabeled
The signed matchings in graphs
Changping Wang
2008· article· en· Discussiones Mathematicae Graph Theory· Mathematics
machine prediction:candidate · noneconsensus · none
6
citations
affunlabeled
On the Erd\H{o}s-Gyárfás conjecture in claw-free graphs
Khodakhast Bibak, Hossein Esfandiari, Pouria Salehi Nowbandegani, Mohammad Hassan Shirdareh Haghighi
2013· article· en· Discussiones Mathematicae Graph Theory· Mathematics
machine prediction:candidate · noneconsensus · none
4
citations
affno abstractunlabeled
Characterizing Cartesian fixers and multipliers
Stephen Benecke, Christina M. Mynhardt
2012· article· en· Discussiones Mathematicae Graph Theory· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Efficient <i>(j, k)</i> -dominating functions
William F. Klostermeyer, Gary MacGillivray, Piri Farzaneh
2020· article· en· Discussiones Mathematicae Graph Theory· Engineering
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
The threshold dimension and irreducible graphs
Lucas Mol, Matthew J. H. Murphy, Ortrud R. Oellermann
2020· preprint· en· Discussiones Mathematicae Graph Theory· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
afffundunlabeled
On the Strong Path Partition Conjecture
Johan P. de Wet, Jean E. Dunbar, Marietjie Frick, Ortrud R. Oellermann
2022· article· en· Discussiones Mathematicae Graph Theory· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations

How this was built: Screen · Findings · About