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
Lecture notes in computer 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.

11,332 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.
11,332 works in the cohort · of 4,299,418page 226 of 227

Labels cover 8 of 11,332 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 11,332 of 11,332 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
Vertex-Pursuit in Hierarchical Social Networks
Anthony Bonato, Dieter Mitsche, Paweł Prałat
2012· book-chapter· en· Lecture notes in computer science· Physics and Astronomy
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Hypertext in Mutation: The Mapping of a Mythos
Tara Ogaick, Wonjoon Chung
2013· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Blunder Cost in Go and Hex
Henry Brausen, Ryan Hayward, Martin Müller, Abdul Qadir, David Spies
2012· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
A New Style of Mathematical Proof
William M. Farmer
2018· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
How to Design and Build New Musical Interfaces
Sidney Fels, Michael J. Lyons
2015· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
From utterance to belief via presupposition
Andrew Csinger, David Poole
2005· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Chains-into-Bins Processes
2011· book-chapter· en· Lecture notes in computer science· Engineering
machine prediction:candidate · noneconsensus · none
0
citations
afffundaboutunlabeled
Credential Attacks in Ontario’s Online Elections
Eric Klassen, James Brunet, Nicole Goodman, Aleksander Essex
2025· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
ServLessSense: Serverless Smell Detection Tool
Hasini Sumalee Perera, Zadia Codabux, Fabio Palomba
2025· book-chapter· en· Lecture notes in computer science· Engineering
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Toward Self-Managed Networks?
Jean‐Philippe Martin‐Flatin
2006· book-chapter· en· Lecture notes in computer science· Engineering
machine prediction:candidate · noneconsensus · none
0
citations
afffundno abstractunlabeled
Bounding Clique-Width via Perfect Graphs
Konrad K. Dabrowski, Shenwei Huang, Daniël Paulusma
2015· preprint· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Advances in Services Computing
Lina Yao, Xia Xie, Qingchen Zhang, Laurence T. Yang, Albert Y. Zomaya, Hai Jin
2015· book· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Powergaming by Spamming in a Learning Game
Nafisul Kiron, Mehnuma Tabassum Omar, Julita Vassileva
2023· book-chapter· en· Lecture notes in computer science· Psychology
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Validation of SIP/H.323 Interworking Using SDL/MSC
Ligang Wang, J. William Atwood, Anjali Agarwal
2003· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Panel: Authentication in Constrained Environments
Mike Burmester, Virgil D. Gligor, Evangelos Kranakis, Doug Tygar, Yuliang Zheng
2006· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations

How this was built: Screen · Findings · About