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
Auction Theory and Applications
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.

1,300 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.
1,300 works in the cohort · of 4,299,418page 3 of 26

Labels cover 1 of 1,300 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 1,300 of 1,300 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
Learning When to Stop Searching
Daniel G. Goldstein, R. Preston McAfee, Siddharth Suri, James R. Wright
2019· article· en· Management Science· Decision Sciences
machine prediction:candidate · noneconsensus · none
43
citations
afffundunlabeled
The Impact of Online Auction Duration
Ernan Haruvy, Peter T. L. Popkowski Leszczyc
2009· article· en· Decision Analysis· Decision Sciences
machine prediction:candidate · noneconsensus · none
41
citations
affno abstractunlabeled
Competing auctions with endogenous quantities
Benny Moldovanu, Aner Sela, Xianwen Shi
2007· article· en· Journal of Economic Theory· Decision Sciences
machine prediction:candidate · noneconsensus · none
41
citations
affunlabeled
Approximation of Nash equilibria in Bayesian games
Olivier Armantier, Jean‐Pierre Florens, Jean‐François Richard
2008· article· en· Journal of Applied Econometrics· Decision Sciences
machine prediction:candidate · noneconsensus · none
38
citations
affunlabeled
Optimal Monitoring Design
George Georgiadis, Balázs Szentes
2020· article· en· Econometrica· Decision Sciences
machine prediction:candidate · noneconsensus · none
37
citations
affunlabeled
Ranking Contingent Monitoring Systems
Marie‐Cécile Fagart, Bernard Sinclair‐Désgagné
2007· article· en· Management Science· Decision Sciences
machine prediction:candidate · noneconsensus · none
35
citations
affunlabeled
Price of Anarchy for Greedy Auctions
Brendan Lucier, Allan Borodin
2010· preprint· en· Decision Sciences
machine prediction:candidate · noneconsensus · none
35
citations
affno abstractunlabeled
Governing AI Agents
Noam Kolt
2024· article· en· SSRN Electronic Journal· Decision Sciences
machine prediction:candidate · noneconsensus · none
33
citations
venueno affunlabeled
Inferring Transactions from Financial Statements*
Anil Arya, John C. Fellingham, Jonathan Glover, Douglas A. Schroeder, Gilbert Strang
2000· article· en· Contemporary Accounting Research· Decision Sciences
machine prediction:candidate · noneconsensus · none
32
citations

How this was built: Screen · Findings · About