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 Transactions on Algorithms
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.

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

Labels cover 0 of 101 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 101 of 101 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
Fault-tolerant facility location
Chaitanya Swamy, David B. Shmoys
2008· article· en· ACM Transactions on Algorithms· Business, Management and Accounting
machine prediction:candidate · noneconsensus · none
90
citations
afffundunlabeled
Gathering Despite Mischief
Yoann Dieudonné, Andrzej Pelc, David Peleg
2014· article· en· ACM Transactions on Algorithms· Computer Science
machine prediction:candidate · noneconsensus · none
74
citations
affunlabeled
On distributing symmetric streaming computations
Jon Feldman, S. Muthukrishnan, Anastasios Sidiropoulos, Clifford Stein, Zoya Svitkina
2010· article· en· ACM Transactions on Algorithms· Computer Science
machine prediction:candidate · noneconsensus · none
66
citations
affunlabeled
Tree exploration with logarithmic memory
Christoph Ambühl, Leszek Gąsieniec, Andrzej Pelc, Tomasz Radzik, Xiaohui Zhang
2011· article· en· ACM Transactions on Algorithms· Computer Science
machine prediction:candidate · noneconsensus · none
57
citations
affunlabeled
Elimination graphs
Yuli Ye, Allan Borodin
2012· article· en· ACM Transactions on Algorithms· Computer Science
machine prediction:candidate · noneconsensus · none
46
citations
affunlabeled
Approximation Schemes for Clustering with Outliers
Zachary Friggstad, Kamyar Khodamoradi, Mohsen Rezapour, Mohammad R. Salavatipour
2019· article· en· ACM Transactions on Algorithms· Business, Management and Accounting
machine prediction:candidate · noneconsensus · none
43
citations
affunlabeled
Lower-bounded facility location
Zoya Svitkina
2010· article· en· ACM Transactions on Algorithms· Business, Management and Accounting
machine prediction:candidate · noneconsensus · none
42
citations
affunlabeled
Approximate distance oracles for geometric spanners
Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan, Michiel Smid
2008· article· en· ACM Transactions on Algorithms· Computer Science
machine prediction:candidate · noneconsensus · none
41
citations
affunlabeled
Bipartite roots of graphs
Lap Chi Lau
2006· article· en· ACM Transactions on Algorithms· Computer Science
machine prediction:candidate · noneconsensus · none
39
citations
affunlabeled
Improved algorithms for weakly chordal graphs
Ryan Hayward, Jeremy Spinrad, R. Sritharan
2007· article· en· ACM Transactions on Algorithms· Computer Science
machine prediction:candidate · noneconsensus · none
35
citations
affunlabeled
Succinct ordinal trees based on tree covering
Meng He, J. Ian Munro, Srinivasa Rao Satti
2012· article· en· ACM Transactions on Algorithms· Computer Science
machine prediction:candidate · noneconsensus · none
32
citations
affunlabeled
Packing element-disjoint steiner trees
Joseph Cheriyan, Mohammad R. Salavatipour
2007· article· en· ACM Transactions on Algorithms· Computer Science
machine prediction:candidate · noneconsensus · none
31
citations
affunlabeled
Better Balance by Being Biased
Per Austrin, Siavosh Benabbas, Konstantinos Georgiou
2016· article· en· ACM Transactions on Algorithms· Computer Science
machine prediction:candidate · noneconsensus · none
27
citations
affunlabeled
A Bounded Budget Network Creation Game
Shayan Ehsani, Saber Shokat Fadaee, MohammadAmin Fazli, Abbas Mehrabian, Sina Sadeghian Sadeghabad, MohammadAli Safari +1 more
2015· article· en· ACM Transactions on Algorithms· Decision Sciences
machine prediction:candidate · noneconsensus · none
25
citations
afffundunlabeled
Morphing orthogonal planar graph drawings
Thérèse Biedl, Anna Lubiw, Mark Petrick, Michael J. Spriggs
2013· article· en· ACM Transactions on Algorithms· Computer Science
machine prediction:candidate · noneconsensus · none
25
citations
affunlabeled
Cake cutting really is not a piece of cake
Jeff Edmonds, Kirk Pruhs
2011· article· en· ACM Transactions on Algorithms· Computer Science
machine prediction:candidate · noneconsensus · none
24
citations
affunlabeled
A maiden analysis of longest wait first
Jeff Edmonds, Kirk Pruhs
2005· article· en· ACM Transactions on Algorithms· Computer Science
machine prediction:candidate · noneconsensus · none
23
citations
affunlabeled
Generating rooted and free plane trees
Joe Sawada
2006· article· en· ACM Transactions on Algorithms· Mathematics
machine prediction:candidate · noneconsensus · none
17
citations
affunlabeled
Finding one tight cycle
Sergio Cabello, Matt DeVos, Jeff Erickson, Bojan Mohar
2010· article· en· ACM Transactions on Algorithms· Computer Science
machine prediction:candidate · noneconsensus · none
17
citations
affunlabeled
Faster Algorithms for Semi-Matching Problems
Jittat Fakcharoenphol, Bundit Laekhanukit, Danupon Nanongkai
2014· article· en· ACM Transactions on Algorithms· Computer Science
machine prediction:candidate · noneconsensus · none
17
citations

How this was built: Screen · Findings · About