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
Author
Year range
→
Sort
Language
Type
Field
Venue
Journal of Algorithms
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.

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

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

afffundno abstractunlabeled
On Graph Powers for Leaf-Labeled Trees
Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos
2002· article· en· Journal of Algorithms· Computer Science
machine prediction:candidate · noneconsensus · none
111
citations
affno abstractunlabeled
Space Efficient Suffix Trees
Venkatesh Raman
2001· article· en· Journal of Algorithms· Computer Science
machine prediction:candidate · noneconsensus · none
103
citations
fundno affno abstractunlabeled
Constructing Optimal Trees from Quartets
David Bryant, Mike Steel
2001· article· en· Journal of Algorithms· Biochemistry, Genetics and Molecular Biology
machine prediction:candidate · noneconsensus · none
77
citations
affno abstractunlabeled
Efficient Algorithms for Petersen's Matching Theorem
Thérèse Biedl, Prosenjit Bose, Erik D. Demaine, Anna Lubiw
2001· article· en· Journal of Algorithms· Computer Science
machine prediction:candidate · noneconsensus · none
70
citations
affno abstractunlabeled
Rectangular drawings of planar graphs
Md. Saidur Rahman, Takao Nishizeki, Shubhashis Ghosh
2003· article· en· Journal of Algorithms· Computer Science
machine prediction:candidate · noneconsensus · none
42
citations
affno abstractunlabeled
Elastic labels around the perimeter of a map
Claudia Iturriaga, Anna Lubiw
2003· article· en· Journal of Algorithms· Computer Science
machine prediction:candidate · noneconsensus · none
13
citations
affno abstractunlabeled
Fault-Tolerant Broadcasting in Radio Networks
Evangelos Kranakis, Danny Kriz̧anc, A. Pelc
2001· article· en· Journal of Algorithms· Computer Science
machine prediction:candidate · noneconsensus · none
6
citations
affno abstractunlabeled
Estimating the maximum
Ben Gum, Richard J. Lipton, Andrea S. LaPaugh, Faith E. Fich
2004· article· en· Journal of Algorithms· Mathematics
machine prediction:candidate · noneconsensus · none
5
citations
affno abstractunlabeled
Selecting the branches for an evolutionary tree.
Jonathan H. Badger, Paul Kearney, Ming Li, John S. Tsang, Tao Jiang
2004· article· en· Journal of Algorithms· Biochemistry, Genetics and Molecular Biology
machine prediction:candidate · noneconsensus · none
4
citations
affno abstractunlabeled
How Helpers Hasten h-Relations
Peter Sanders, Roberto Solis-Oba
2000· article· en· Journal of Algorithms· Psychology
machine prediction:candidate · noneconsensus · none
1
citations

How this was built: Screen · Findings · About