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
Symposium on Discrete 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.

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

Labels cover 0 of 59 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 59 of 59 works in this cohort. Predictions are machine_predicted_unvalidated teacher distillation outputs. Candidate is the union; consensus is the intersection.

affunlabeled
An optimal Bloom filter replacement
2005· article· en· Symposium on Discrete Algorithms· Computer Science
distilled prediction:candidate · noneconsensus · none
153
citations
affunlabeled
Scalable leader election
2006· article· en· Symposium on Discrete Algorithms· Computer Science
distilled prediction:candidate · noneconsensus · none
83
citations
affno abstractunlabeled
Estimating DNA sequence entropy
2000· article· en· Symposium on Discrete Algorithms· Biochemistry, Genetics and Molecular Biology
distilled prediction:candidate · noneconsensus · none
81
citations
affunlabeled
Distributed selfish load balancing
2006· article· en· Symposium on Discrete Algorithms· Decision Sciences
distilled prediction:candidate · insufficient_payloadconsensus · none
53
citations
affno abstractunlabeled
Weakly chordal graph algorithms via handles
2000· article· en· Symposium on Discrete Algorithms· Computer Science
distilled prediction:candidate · metaepi_narrow+insufficient_payloadconsensus · none
41
citations
affunlabeled
The list partition problem for graphs
2004· article· en· Symposium on Discrete Algorithms· Computer Science
distilled prediction:candidate · noneconsensus · none
29
citations
affaboutunlabeled
Incremental) priority algorithms
2002· article· en· Symposium on Discrete Algorithms· Computer Science
distilled prediction:candidate · metaepi_narrow+insufficient_payloadconsensus · none
22
citations
affunlabeled
Biased range trees
2009· article· en· Symposium on Discrete Algorithms· Computer Science
distilled prediction:candidate · noneconsensus · none
11
citations
affunlabeled
Approximating rooted Steiner networks
2012· article· en· Symposium on Discrete Algorithms· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
11
citations
affunlabeled
Gathering despite mischief
2012· article· en· Symposium on Discrete Algorithms· Computer Science
distilled prediction:candidate · noneconsensus · none
10
citations
affunlabeled
A little advice can be very helpful
2012· article· en· Symposium on Discrete Algorithms· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
8
citations
affunlabeled
Bipartite roots of graphs
2004· article· en· Symposium on Discrete Algorithms· Computer Science
distilled prediction:candidate · noneconsensus · none
7
citations
affno abstractunlabeled
A fast algorithm to generate unlabeled necklaces
2000· article· en· Symposium on Discrete Algorithms· Computer Science
distilled prediction:candidate · metaepi_narrow+insufficient_payloadconsensus · none
6
citations
affunlabeled
On validating planar worlds
2001· article· en· Symposium on Discrete Algorithms· Engineering
distilled prediction:candidate · noneconsensus · none
6
citations
affno abstractunlabeled
Linear reductions of maximum matching
2001· article· en· Symposium on Discrete Algorithms· Economics, Econometrics and Finance
distilled prediction:candidate · noneconsensus · none
5
citations
next →

How this was built: Screen · Findings · About