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 Mathematics Algorithms and Applications
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.

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

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

affunlabeled
CLASSIFICATION OF NEAR-NORMAL SEQUENCES
2009· article· en· Discrete Mathematics Algorithms and Applications· Computer Science
distilled prediction:candidate · noneconsensus · none
4
citations
affunlabeled
DIAMETER-CONSTRAINED STEINER TREES
2011· article· en· Discrete Mathematics Algorithms and Applications· Computer Science
distilled prediction:candidate · noneconsensus · none
4
citations
affunlabeled
LCD codes over finite fields
2024· article· en· Discrete Mathematics Algorithms and Applications· Computer Science
distilled prediction:candidate · noneconsensus · none
3
citations
affunlabeled
Survivability of bouncing robots
2016· article· en· Discrete Mathematics Algorithms and Applications· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
affunlabeled
A SUCCINCT 3D VISIBILITY SKELETON
2010· article· en· Discrete Mathematics Algorithms and Applications· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Star chromatic number of some graphs
2021· article· en· Discrete Mathematics Algorithms and Applications· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
affunlabeled
A note on hyperopic cops and robber
2022· article· en· Discrete Mathematics Algorithms and Applications· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Random graph languages
2017· article· en· Discrete Mathematics Algorithms and Applications· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
afffundunlabeled
Disjoint dominating sets with a perfect matching
2017· preprint· en· Discrete Mathematics Algorithms and Applications· Computer Science
distilled prediction:candidate · metaepi_narrow+scholarly_communicationconsensus · none
0
citations

How this was built: Screen · Findings · About