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
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 teacher distillation outputs. Candidate is the union; consensus is the intersection.

affunlabeled
Fault-tolerant facility location
2008· article· en· ACM Transactions on Algorithms· Business, Management and Accounting
distilled prediction:candidate · insufficient_payloadconsensus · insufficient_payload
90
citations
afffundunlabeled
Gathering Despite Mischief
2014· article· en· ACM Transactions on Algorithms· Computer Science
distilled prediction:candidate · noneconsensus · none
74
citations
affunlabeled
Elimination graphs
2012· article· en· ACM Transactions on Algorithms· Computer Science
distilled prediction:candidate · noneconsensus · none
46
citations
affunlabeled
Lower-bounded facility location
2010· article· en· ACM Transactions on Algorithms· Business, Management and Accounting
distilled prediction:candidate · insufficient_payloadconsensus · insufficient_payload
42
citations
affunlabeled
Bipartite roots of graphs
2006· article· en· ACM Transactions on Algorithms· Computer Science
distilled prediction:candidate · noneconsensus · none
39
citations
affunlabeled
Packing element-disjoint steiner trees
2007· article· en· ACM Transactions on Algorithms· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
31
citations
affunlabeled
Better Balance by Being Biased
2016· article· en· ACM Transactions on Algorithms· Computer Science
distilled prediction:candidate · noneconsensus · none
27
citations
affunlabeled
A Bounded Budget Network Creation Game
2015· article· en· ACM Transactions on Algorithms· Decision Sciences
distilled prediction:candidate · insufficient_payloadconsensus · none
25
citations
affunlabeled
Finding one tight cycle
2010· article· en· ACM Transactions on Algorithms· Computer Science
distilled prediction:candidate · noneconsensus · none
17
citations
next →

How this was built: Screen · Findings · About