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
ACM SIGACT News
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.

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

Labels cover 0 of 30 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 30 of 30 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
The story of set disjointness
Arkadev Chattopadhyay, Toniann Pitassi
2010· article· en· ACM SIGACT News· Economics, Econometrics and Finance
machine prediction:candidate · noneconsensus · none
49
citations
affunlabeled
Combinatorial designs
Douglas R. Stinson
2008· article· en· ACM SIGACT News· Engineering
machine prediction:candidate · noneconsensus · none
19
citations
affunlabeled
Proving PACELC
Wojciech Golab
2018· article· en· ACM SIGACT News· Computer Science
machine prediction:candidate · noneconsensus · none
7
citations
affunlabeled
Guest Column
Susanna F. de Rezende, Mika Göös, Robert Robere
2022· article· en· ACM SIGACT News· Computer Science
machine prediction:candidate · insufficient_payloadconsensus · none
6
citations
affunlabeled
Computational geometry column 54
Adrian Dumitrescu, Csaba D. Tóth
2012· article· en· ACM SIGACT News· Computer Science
machine prediction:candidate · insufficient_payloadconsensus · none
5
citations
aboutno affunlabeled
SIGACT News Complexity Theory Column 112
Lane A. Hemaspaandra
2022· article· en· ACM SIGACT News· Engineering
machine prediction:candidate · insufficient_payloadconsensus · none
4
citations
affunlabeled
Half century of automata theory
Lila Kari
2000· article· en· ACM SIGACT News· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
aboutno affunlabeled
2005
Marek Chrobák
2006· article· en· ACM SIGACT News· Computer Science
machine prediction:candidate · insufficient_payloadconsensus · none
0
citations
aboutno affunlabeled
PODC 2019 Review
Naama Ben-David, Yi‐Jun Chang, Michal Dory, Dean Leitersdorf
2019· article· en· ACM SIGACT News· Computer Science
machine prediction:candidate · insufficient_payloadconsensus · none
0
citations
affunlabeled
A Brief Summary of PODC 2022
Dan Alistarh, Alkida Balliu, Dimitrios Los, Sean Ovens
2023· article· en· ACM SIGACT News· Decision Sciences
machine prediction:candidate · noneconsensus · none
0
citations
affaboutunlabeled
SIROCCO 2018 Review
Avery Miller
2018· article· en· ACM SIGACT News· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations

How this was built: Screen · Findings · About