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
Complexity and Algorithms in Graphs
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.

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

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

afffundunlabeled
Oracle size
2006· preprint· en· Computer Science
distilled prediction:candidate · noneconsensus · none
47
citations
affunlabeled
DERANDOMIZATION: A BRIEF OVERVIEW
2004· article· en· WORLD SCIENTIFIC eBooks· Computer Science
distilled prediction:candidate · noneconsensus · none
39
citations
affno abstractunlabeled
Reducing the complexity of reductions
2001· article· en· Computational Complexity· Computer Science
distilled prediction:candidate · noneconsensus · none
38
citations
afffundunlabeled
Learning Algorithms from Natural Proofs
2016· article· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
37
citations
affunlabeled
The VPN conjecture is true
2008· article· en· Computer Science
distilled prediction:candidate · noneconsensus · none
33
citations
affunlabeled
Packing element-disjoint steiner trees
2007· article· en· ACM Transactions on Algorithms· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
31
citations
fundno affunlabeled
On the usefulness of predicates
2013· article· en· ACM Transactions on Computation Theory· Computer Science
distilled prediction:candidate · noneconsensus · none
30
citations
affno abstractunlabeled
The capacitated max k-cut problem
2007· article· en· Mathematical Programming· Computer Science
distilled prediction:candidate · noneconsensus · none
29
citations
← previousnext →

How this was built: Screen · Findings · About