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
Year range
→
Sort
Language
Type
Field
Venue
Topic
Advanced Graph Theory Research
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.

2,515 results · 1 filter active ·
Categories
Machine labels · sparse coverage
Evidence
An unlabeled work is unknown, not a negative. Label coverage is reported on every query.
2,515 works in the cohort · of 4,299,418page 2 of 51

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

affno abstractunlabeled
Shortest paths between shortest paths
2011· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · metaepi_narrow+sts+open_scienceconsensus · none
76
citations
affunlabeled
Some remarks on domination
2004· article· en· Journal of Graph Theory· Computer Science
distilled prediction:candidate · noneconsensus · none
71
citations
afffundno abstractunlabeled
Cops and robbers in a random graph
2012· article· en· Journal of Combinatorial Theory Series B· Computer Science
distilled prediction:candidate · noneconsensus · none
67
citations
fundno affunlabeled
The Chromatic Number of Graph Powers
2002· article· en· Combinatorics Probability Computing· Computer Science
distilled prediction:candidate · noneconsensus · none
66
citations
afffundunlabeled
Triangle-intersecting families of graphs
2012· article· en· Journal of the European Mathematical Society· Computer Science
distilled prediction:candidate · noneconsensus · none
65
citations
affno abstractunlabeled
On sum coloring of graphs
2003· article· en· Discrete Applied Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
60
citations
affno abstractunlabeled
Hedetniemi's conjecture — a survey
2001· article· en· Discrete Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
57
citations
affno abstractunlabeled
On the k-path partition of graphs
2003· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · stsconsensus · none
54
citations
← previousnext →

How this was built: Screen · Findings · About