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
Communications in computer and information science
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.

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

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

affno abstractunlabeled
Efficient Range Sensing Using Imperceptible Structured Light
Avery Cole, Sheikh Ziauddin, Jonathon Malcolm, Michael Greenspan
2022· book-chapter· en· Communications in computer and information science· Engineering
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Side-Channel Based Runtime Intrusion Detection for Network Equipment
Arthur Grisel-Davy, Goksen U. Guler, Julian Dickert, Philippe Vibien, Waleed Khan, Jack A. Morgan +2 more
2024· book-chapter· en· Communications in computer and information science· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Traffic Crash Severity Prediction Using eXplainable AI
Nishtha Srivastava, Rishabh Maloo, Bhavesh N. Gohil, Suprio Ray
2025· book-chapter· en· Communications in computer and information science· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Features of Persuasive AI in the Workplace
Elisavet Averkiadi, Wietske Van Osch
2023· book-chapter· en· Communications in computer and information science· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
fundno affno abstractunlabeled
Advanced Computing
2024· book· en· Communications in computer and information science· Computer Science
machine prediction:candidate · insufficient_payloadconsensus · none
0
citations
affunlabeled
Approximate GCD in Bernstein basis
Robert M. Corless, Leili Rafiee Sevyeri
2019· preprint· en· Communications in computer and information science· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Planning with Non-deterministic Actions in Jason
Josh Blondin, Babak Esfandiari
2024· book-chapter· en· Communications in computer and information science· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
fundno affno abstractunlabeled
Videogame Sciences and Arts
2024· book· en· Communications in computer and information science· Psychology
machine prediction:candidate · noneconsensus · none
0
citations

How this was built: Screen · Findings · About