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
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 6 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 the Cordiality of Corona Graphs.
2006· article· en· Ars Combinatoria· Computer Science
distilled prediction:candidate · noneconsensus · none
3
citations
venueno affunlabeled
Coloring The Line.
2007· article· en· Ars Combinatoria· Computer Science
distilled prediction:candidate · noneconsensus · none
3
citations
venueno affno abstractunlabeled
On Incidence Graphs.
2008· article· en· Ars Combinatoria· Computer Science
distilled prediction:candidate · noneconsensus · none
3
citations
affunlabeled
Splitting Numbers of Grids
2005· article· en· The Electronic Journal of Combinatorics· Computer Science
distilled prediction:candidate · noneconsensus · none
3
citations
venueno affno abstractunlabeled
Weak Edge Detour Number of a Graph.
2011· article· en· Ars Combinatoria· Computer Science
distilled prediction:candidate · noneconsensus · none
3
citations
venueno affunlabeled
On Regular Distance Magic Graphs of Odd Order
2023· article· en· Journal of Combinatorial Mathematics and Combinatorial Computing· Computer Science
distilled prediction:candidate · noneconsensus · none
3
citations
venueno affno abstractunlabeled
Magic graphs with pendant edges.
2011· article· en· Ars Combinatoria· Computer Science
distilled prediction:candidate · noneconsensus · none
3
citations
venueno affunlabeled
Resolvability in Hypergraphs
2023· article· en· Contributions to Discrete Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
3
citations
venueno affno abstractunlabeled
On Prime Graphs.
2012· article· en· Ars Combinatoria· Computer Science
distilled prediction:candidate · noneconsensus · none
3
citations

How this was built: Screen · Findings · About