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
Theoretical Computer Science
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.

797 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.
797 works in the cohort · of 4,299,418page 2 of 16

Labels cover 0 of 797 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 797 of 797 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
afffundno abstractunlabeled
Theory of átomata
2014· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · stsconsensus · none
74
citations
affno abstractunlabeled
Expressive power of SQL
2003· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
68
citations
affno abstractunlabeled
Lyndon words, permutations and trees
2003· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
65
citations
affno abstractunlabeled
Coding properties of DNA languages
2003· article· en· Theoretical Computer Science· Biochemistry, Genetics and Molecular Biology
distilled prediction:candidate · noneconsensus · none
61
citations
afffundno abstractunlabeled
Computing similarity between RNA structures
2002· article· en· Theoretical Computer Science· Biochemistry, Genetics and Molecular Biology
distilled prediction:candidate · noneconsensus · none
60
citations
affno abstractunlabeled
On weighted balls-into-bins games
2008· article· en· Theoretical Computer Science· Economics, Econometrics and Finance
distilled prediction:candidate · insufficient_payloadconsensus · none
60
citations
affno abstractunlabeled
Synchronizing groups and automata
2006· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
59
citations
affno abstractunlabeled
The ultimate strategy to search on m rays?
2001· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · scholarly_communicationconsensus · none
58
citations
affno abstractunlabeled
How many runs can a string contain?
2008· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
57
citations
afffundno abstractunlabeled
Recognizing and drawing IC-planar graphs
2016· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
55
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
affno abstractunlabeled
Fast radio broadcasting with advice
2010· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
53
citations
affno abstractunlabeled
Quotient complexity of ideal languages
2012· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · stsconsensus · none
51
citations
afffundno abstractunlabeled
Rendezvous with constant memory
2016· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · stsconsensus · none
51
citations
← previousnext →

How this was built: Screen · Findings · About