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
Discrete Applied Mathematics
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.

520 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.
520 works in the cohort · of 4,299,418page 1 of 11

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

affno abstractunlabeled
On spaced seeds for similarity search
2003· article· en· Discrete Applied Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
142
citations
affno abstractunlabeled
Variable space search for graph coloring
2008· article· en· Discrete Applied Mathematics· Decision Sciences
distilled prediction:candidate · noneconsensus · none
124
citations
affno abstractunlabeled
Degree constrained subgraphs
2007· article· en· Discrete Applied Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
121
citations
affno abstractunlabeled
Advances on sorting by reversals
2006· article· en· Discrete Applied Mathematics· Biochemistry, Genetics and Molecular Biology
distilled prediction:candidate · noneconsensus · none
109
citations
affno abstractunlabeled
On constant composition codes
2005· article· en· Discrete Applied Mathematics· Engineering
distilled prediction:candidate · noneconsensus · none
102
citations
affno abstractunlabeled
Dynamic monopolies in tori
2003· article· en· Discrete Applied Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
81
citations
affno abstractunlabeled
Investigations on autark assignments
2000· article· en· Discrete Applied Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
75
citations
afffundno abstractunlabeled
Burning a graph is hard
2017· article· en· Discrete Applied Mathematics· Physics and Astronomy
distilled prediction:candidate · noneconsensus · none
72
citations
affno abstractunlabeled
On sum coloring of graphs
2003· article· en· Discrete Applied Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
60
citations
afffundno abstractunlabeled
On the b-dominating coloring of graphs
2005· article· en· Discrete Applied Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
57
citations
afffundno abstractunlabeled
Perfect Roman domination in trees
2017· article· en· Discrete Applied Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
49
citations
next →

How this was built: Screen · Findings · About