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 81 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
Renormalization of NoSQL Database Schemas
Michael J. Mior, Kenneth Salem
2018· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
8
citations
affno abstractunlabeled
Clustering in Tractography Using Autoencoders (CINTA)
Jon Haitz Legarreta, Laurent Petit, Pierre‐Marc Jodoin, Maxime Descoteaux
2022· book-chapter· en· Lecture notes in computer science· Medicine
machine prediction:candidate · noneconsensus · none
8
citations
affno abstractunlabeled
State Complexity Research and Approximation
Sheng Yü, Yuan Gao
2011· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
8
citations
affno abstractunlabeled
Heap Building Bounds
Zhentao Li, Bruce A. Reed
2005· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
8
citations
affno abstractunlabeled
Improved Algorithms for Partial Curve Matching
Anil Maheshwari, Jörg-Rüdiger Sack, Kaveh Shahbaz, Hamid Zarrabi-Zadeh
2011· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
8
citations
affno abstractunlabeled
Layered Working-Set Trees
Prosenjit Bose, Karim Douïeb, Vida Dujmović, John Howat
2010· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
8
citations
affno abstractunlabeled
IDNs in Education: Skills for Future Generations
Jonathan Barbara, Hartmut Koenitz, Breanne Pitt, Colette Daiute, Cristina Sylla, Serge Bouchardon +1 more
2023· book-chapter· en· Lecture notes in computer science· Health Professions
machine prediction:candidate · noneconsensus · none
8
citations
afffundno abstractunlabeled
Arc-Consistency + Unit Propagation = Lookahead
Jia-Huai You, Guiwen Hou
2004· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
8
citations
affno abstractunlabeled
Case Authoring from Text and Historical Experiences
Marvin Zaluski, Nathalie Japkowicz, Stan Matwin
2003· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
8
citations
affno abstractunlabeled
The Use of Traces for Inlining in Java Programs
Borys J. Bradel, Tarek S. Abdelrahman
2005· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
8
citations
affno abstractunlabeled
Reconstructing Polygons from Scanner Data
Thérèse Biedl, Stéphane Durocher, Jack Snoeyink
2009· book-chapter· en· Lecture notes in computer science· Engineering
machine prediction:candidate · noneconsensus · none
8
citations
affno abstractunlabeled
Simulating Classic Mosaics with Graph Cuts
Yu Liu, Olga Veksler, Olivier Juan
2007· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
8
citations
affno abstractunlabeled
New Bounds for Motif Finding in Strong Instances
Broňa Brejová, Daniel G. Brown, Ian M. Harrower, Tomáš Vinař
2006· book-chapter· en· Lecture notes in computer science· Engineering
machine prediction:candidate · noneconsensus · none
8
citations
affno abstractunlabeled
Three Paths to Point Placement
Md Shafiul Alam, Asish Mukhopadhyay
2015· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
8
citations
affno abstractunlabeled
On Hardness of Several String Indexing Problems
Kasper Green Larsen, J. Ian Munro, Jesper Sindahl Nielsen, Sharma V. Thankachan
2014· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
8
citations

How this was built: Screen · Findings · About