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 Journal of Experimental Algorithmics
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.

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

Labels cover 0 of 23 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 23 of 23 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
StreamKM++
Marcel R. Ackermann, Marcus Märtens, Christoph Raupach, Kamil Swierkot, Christiane Lammersen, Christian Sohler
2012· article· en· ACM Journal of Experimental Algorithmics· Computer Science
machine prediction:candidate · noneconsensus · none
295
citations
afffundunlabeled
Xor Filters
2020· article· en· ACM Journal of Experimental Algorithmics· Computer Science
machine prediction:candidate · noneconsensus · none
112
citations
afffundunlabeled
Array Layouts for Comparison-Based Searching
Paul-Virak Khuong, Pat Morin
2017· article· en· ACM Journal of Experimental Algorithmics· Computer Science
machine prediction:candidate · noneconsensus · none
32
citations
affunlabeled
A topological sorting algorithm for large graphs
Deepak Ajwani, Adan Cosgaya-Lozano, Norbert Zeh
2012· article· en· ACM Journal of Experimental Algorithmics· Computer Science
machine prediction:candidate · noneconsensus · none
16
citations
affunlabeled
Solving a "Hard" problem to approximate an "Easy" one
Sándor P. Fekete, Henk Meijer, André Rohe, Walter Tietze
2002· article· en· ACM Journal of Experimental Algorithmics· Computer Science
machine prediction:candidate · noneconsensus · none
14
citations
affunlabeled
Partitioning planar graphs with costs and weights
Lyudmil Aleksandrov, Hristo Djidjev, Hua Guo, Anil Maheshwari
2007· article· en· ACM Journal of Experimental Algorithmics· Computer Science
machine prediction:candidate · noneconsensus · none
12
citations
affunlabeled
Computing Autotopism Groups of Partial Latin Rectangles
Rebecca J. Stones, Raúl Manuel Falcón Ganfornina, Daniel Kotlar, Trent G. Marbach
2020· article· en· ACM Journal of Experimental Algorithmics· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations
affunlabeled
Fast string sorting using order-preserving compression
Alejandro López-Ortíz, Mehdi Mirzazadeh, Mohammad Ali Safari, Hossein Sheikhattar
2005· article· en· ACM Journal of Experimental Algorithmics· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations

How this was built: Screen · Findings · About