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
Author
Year range
→
Sort
Language
Type
Field
Venue
Topic
Advanced Text Analysis Techniques
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.

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

Labels cover 2 of 552 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 552 of 552 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.

affunlabeled
Topic Composition in AEA Journals
Dian Hong
2024· preprint· en· Research Square· Computer Science
machine prediction:candidate · metaresearch+bibliometricsconsensus · none
0
citations
venueno affunlabeled
Inedxing as Problem Solving: A Cognitive Approach to Consistency
Claire David, Laurent Giroux, Suzanne Bertrand‐Gastaldy, Diane Lanteigne
2013· article· en· Proceedings of the Annual Conference of CAIS / Actes du congrès annuel de l ACSI· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Clozapp
Kelly Nisbet, Michel Généreux, Blake Anderson, Victor Kuperman
2019· article· en· The Mental Lexicon· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Annotative Indexing
Charles L. A. Clarke
2025· preprint· en· Information Retrieval Research· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affvenueaboutunlabeled
Correlation of term usage and term indexing frequencies
Michael J. Nelson
2022· article· en· Proceedings of the Annual Conference of CAIS / Actes du congrès annuel de l ACSI· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
aboutno affunlabeled
Editorial
A. H. M. Zahirul Alam
2024· editorial· en· IIUM Engineering Journal· Computer Science
machine prediction:candidate · insufficient_payloadconsensus · none
0
citations
affunlabeled
A Topic Modeling Based Approach for Enhancing Corpus Querying
Nouh Alhindawi, Belal Abu Ata, Lana Mahmoud Obeidat, Mohammad Subhi Al-Batah, Muad Abu‐Ata
2019· article· en· International Journal of Open Source Software and Processes· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Optimal Text-Based Time-Series Indices
David Ardia, Keven Bluteau
2024· article· en· SSRN Electronic Journal· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Preliminaries
Marisa Bortolussi, Peter Dixon
2002· book-chapter· en· Cambridge University Press eBooks· Computer Science
machine prediction:candidate · insufficient_payloadconsensus · none
0
citations
affno abstractunlabeled
Other
Leora C. Swartzman, Richard A. Harshman, Margaret E. Lundy, Jacquelyn Burkell
2004· article· en· Journal of Pain· Computer Science
machine prediction:candidate · insufficient_payloadconsensus · none
0
citations
affunlabeled
Using Graphics to Improve Understanding of Conceptual Models
Kamal Masri, Drew Parker, Andrew Gemino
2010· book-chapter· en· Advances in database research (ADR) book series/Advances in database research series· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affunlabeled
Bike: Bilingual Keyphrase Experiments
David R. Nadeau, Caroline Barrière, George Foster
2005· article· en· NPARC· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affunlabeled
Re-Conceiving Information Studies: A Quantum Approach
John M. Budd
2013· article· fr· Proceedings of the Annual Conference of CAIS / Actes du congrès annuel de l ACSI· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueaboutno affunlabeled
Using Genetics in Information Filtering
Max Höfferer, Bernd Knaus, Werner Winiwarter
2013· article· en· Proceedings of the Annual Conference of CAIS / Actes du congrès annuel de l ACSI· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affunlabeled
Big Data Measures of Environmental Concern
Agol Wai Ming Ho, Kevin Chi Keung Li
2023· article· en· Journal of Applied Business and Economics· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Hierarchical Document Clustering
Benjamin C. M. Fung, Ke Wang, Martin Ester
2011· book-chapter· en· IGI Global eBooks· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Mining Text Conversations
Giuseppe Carenini, Gabriel Murray, Raymond T. Ng
2011· book-chapter· en· Synthesis lectures on data management· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
← previousnext →

How this was built: Screen · Findings · About