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
AI-based Problem Solving and Planning
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.

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

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

affno abstractunlabeled
Preference-Based Planning via MaxSAT
2012· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
13
citations
affno abstractunlabeled
Similarity
2008· book-chapter· en· Studies in computational intelligence· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
12
citations
afffundunlabeled
Optimally Relaxing Partial-Order Plans with MaxSAT
2012· article· en· Proceedings of the International Conference on Automated Planning and Scheduling· Computer Science
distilled prediction:candidate · noneconsensus · none
12
citations
afffundunlabeled
Computing Robust Plans in Continuous Domains
2009· article· en· Proceedings of the International Conference on Automated Planning and Scheduling· Computer Science
distilled prediction:candidate · noneconsensus · none
9
citations
affunlabeled
Classical Planning in Deep Latent Space
2022· article· en· Journal of Artificial Intelligence Research· Computer Science
distilled prediction:candidate · noneconsensus · none
9
citations
affunlabeled
State-Set Search
2011· article· en· Annual Symposium on Combinatorial Search· Computer Science
distilled prediction:candidate · metaepi_narrow+insufficient_payloadconsensus · none
9
citations
← previousnext →

How this was built: Screen · Findings · About