MétaCan
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.

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
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 10 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. 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.

affaboutunlabeled
RISK PREDICTION FOR MODERN TECHNOLOGICAL SYSTEMS
B Duffey Romney, W Saull John
2008· article· en· Journal of Polish Safety and Reliability Association· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
aboutno affunlabeled
Ver Capone (2020) Pelicula Completa En Castellano wgd
2020· article· es· Zenodo (CERN European Organization for Nuclear Research)· Computer Science
machine prediction:candidate · insufficient_payloadconsensus · insufficient_payload
0
citations
affunlabeled
Reasoning with Goal Models
Paolo Giorgini, Roberto Sebastiani
2002· article· en· Unitn Eprints Research (Università Degli Studi di Trento)· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
aboutno affunlabeled
Smith, Larratt Wm. (1820-ca. 1900)
2014· article· en· eYLS (Yale Law School)· Computer Science
machine prediction:candidate · insufficient_payloadconsensus · none
0
citations
affno abstractunlabeled
Expansion of Habitual Domains and DMCS
Moussa Larbani, Po-Lung Yu
2016· book-chapter· en· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Integrative Procedure Learning
Ben Goertzel, Cassio Pennachin, Nil Geisweiller
2014· book-chapter· en· Atlantis thinking machines· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
afffundunlabeled
Planning with Epistemic Preferences
Toryn Q. Klassen, Christian Muise, Sheila A. McIlraith
2023· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
AIware in the Foundation Model Era
Zhen Ming Jiang, Ahmed E. Hassan, Thomas Zimmermann, Mark Harman
2025· article· IEEE Software· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations

How this was built: Screen · Findings · About