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
Software Practice and Experience
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.

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

Labels cover 0 of 140 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 140 of 140 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
Number parsing at a gigabyte per second
Daniel Lemire
2021· preprint· en· Software Practice and Experience· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
aboutno affunlabeled
PPM compression without escapes
Peter Fenwick
2011· article· en· Software Practice and Experience· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
afffundunlabeled
Parsing millions of URLs per second
Yagiz Nizipli, Daniel Lemire
2023· article· en· Software Practice and Experience· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
afffundunlabeled
Parsing Millions of DNS Records Per Second
Jeroen Koekkoek, Daniel Lemire
2024· article· en· Software Practice and Experience· Engineering
machine prediction:candidate · noneconsensus · none
2
citations
affunlabeled
The Relationlog system prototype
Mengchi Liu
2001· article· en· Software Practice and Experience· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
affunlabeled
Exploiting exceptions
Michael Zastre, R. Nigel Horspool
2001· article· en· Software Practice and Experience· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affunlabeled
Editorial
Yaser Ghanam, Kendra Cooper, Frank Maurer
2011· editorial· en· Software Practice and Experience· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
afffundunlabeled
Fast number parsing without fallback
Noble Mushtak, Daniel Lemire
2023· article· en· Software Practice and Experience· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
afffundunlabeled
High‐performance extended actors
Peter A. Buhr, Colby A. Parsons, Thierry Delisle, He Nan Li
2023· article· en· Software Practice and Experience· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affunlabeled
Fast and effective soft links
John A. Akinyemi, Charles L. A. Clarke
2012· article· en· Software Practice and Experience· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
afffundunlabeled
Batched ranged random integer generation
Nevin Brackett‐Rozinsky, Daniel Lemire
2024· article· en· Software Practice and Experience· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Issue Information
2022· paratext· en· Software Practice and Experience· Engineering
machine prediction:candidate · insufficient_payloadconsensus · insufficient_payload
0
citations
affno abstractunlabeled
Issue Information
2022· paratext· en· Software Practice and Experience· Computer Science
machine prediction:candidate · insufficient_payloadconsensus · insufficient_payload
0
citations

How this was built: Screen · Findings · About