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

affunlabeled
Three-dimensional matching is NP-Hard
2020· preprint· en· arXiv (Cornell University)· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
1
citations
afffundno abstractunlabeled
The complexity of geometric scaling
2023· article· en· Operations Research Letters· Computer Science
distilled prediction:candidate · stsconsensus · none
1
citations
fundno affunlabeled
[no title]
2019· article· en· Theory of Computing· Computer Science
distilled prediction:candidate · noneconsensus · none
1
citations
afffundno abstractunlabeled
KRW Composition Theorems via Lifting
2024· article· en· Computational Complexity· Computer Science
distilled prediction:candidate · noneconsensus · none
1
citations
affno abstractunlabeled
Less Is More Approach
2023· book-chapter· en· Springer optimization and its applications· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
1
citations
affno abstractunlabeled
Generalizedk-multiway cut problems
2006· article· en· Journal of Applied Mathematics and Computing· Computer Science
distilled prediction:candidate · noneconsensus · none
1
citations
afffundunlabeled
Colourful TFNP and Propositional Proofs
2023· article· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
1
citations
affno abstractunlabeled
Priority Algorithms for the Subset-Sum Problem
2007· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrow+open_scienceconsensus · none
1
citations
affunlabeled
On quadratic threshold CSPs
2012· article· en· Discrete Mathematics & Theoretical Computer Science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
1
citations
affno abstractunlabeled
Routing on Heavy-Path WSPD-Spanners
2021· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrow+scholarly_communicationconsensus · none
1
citations
← previousnext →

How this was built: Screen · Findings · About