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
IEEE Transactions on Computers
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.

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

Labels cover 0 of 135 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 135 of 135 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.

fundno affunlabeled
Faster Key Compression for Isogeny-Based Cryptosystems
Gustavo H. M. Zanon, Marcos A. Simplício, Geovandro C. C. F. Pereira, Javad Doliskani, Paulo S. L. M. Barreto
2018· article· en· IEEE Transactions on Computers· Computer Science
machine prediction:candidate · noneconsensus · none
32
citations
afffundunlabeled
Measuring Temporal Lags in Delay-Tolerant Networks
Arnaud Casteigts, Paola Flocchini, Bernard Mans, Nicola Santoro
2012· article· en· IEEE Transactions on Computers· Computer Science
machine prediction:candidate · noneconsensus · none
29
citations
afffundunlabeled
Efficient Composited de Bruijn Sequence Generators
Bo Yang, Kalikinkar Mandal, Mark D. Aagaard, Guang Gong
2017· article· en· IEEE Transactions on Computers· Computer Science
machine prediction:candidate · noneconsensus · none
18
citations
affunlabeled
Generating Reliable Code from Hybrid-Systems Models
Madhukar Anand, Sebastian Fischmeister, Yerang Hur, Jesung Kim, I. Lee
2010· article· en· IEEE Transactions on Computers· Computer Science
machine prediction:candidate · noneconsensus · none
12
citations

How this was built: Screen · Findings · About