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
Review of Economic Design
Topic
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.

19 results · 1 filter active ·
Results by year
20002024
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.
19 works in the cohort · of 4,299,418page 1 of 1

Labels cover 0 of 19 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 19 of 19 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.

affno abstractunlabeled
Spatial social networks
Cathleen Johnson, Robert P. Gilles
2000· article· en· Review of Economic Design· Decision Sciences
machine prediction:candidate · noneconsensus · none
203
citations
affno abstractunlabeled
On complexity of lobbying in multiple referenda
Robin Christian, Frances Rosamond, Arkadii Slinko
2007· article· en· Review of Economic Design· Economics, Econometrics and Finance
machine prediction:candidate · noneconsensus · none
77
citations
affno abstractunlabeled
Link bidding in laboratory networks
Cary Deck, Cathleen Johnson
2004· article· en· Review of Economic Design· Decision Sciences
machine prediction:candidate · noneconsensus · none
50
citations
affno abstractunlabeled
Testing alone is insufficient
Rahul Deb, Mallesh M. Pai, Akhil Vohra, Rakesh Vohra
2022· article· en· Review of Economic Design· Mathematics
machine prediction:candidate · metaresearchconsensus · none
5
citations
affno abstractunlabeled
An optimistic search equilibrium
Dipjyoti Majumdar, Artyom Shneyerov, Huan Xie
2015· article· en· Review of Economic Design· Decision Sciences
machine prediction:candidate · noneconsensus · none
5
citations
affno abstractunlabeled
Two topics in Leo Hurwicz’s research
Stanley Reiter
2009· article· en· Review of Economic Design· Business, Management and Accounting
machine prediction:candidate · noneconsensus · none
3
citations
afffundno abstractunlabeled
Partnership markets with adverse selection
Gregory K. Dow
2013· article· en· Review of Economic Design· Social Sciences
machine prediction:candidate · noneconsensus · none
2
citations
affno abstractunlabeled
Efficient trading with restriction
Hu Lu, Yuntong Wang
2009· article· en· Review of Economic Design· Decision Sciences
machine prediction:candidate · noneconsensus · none
1
citations

How this was built: Screen · Findings · About