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 21 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
Evolution of Architectural Floor Plans
Robert W. J. Flack, Brian J. Ross
2011· book-chapter· en· Lecture notes in computer science· Engineering
machine prediction:candidate · noneconsensus · none
33
citations
affno abstractunlabeled
Translating Statecharts to B
Emil Sekerinski, Rafik Zurob
2002· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
33
citations
affno abstractunlabeled
Approaching the Coverability Problem Continuously
Michael Blondin, Alain Finkel, Christoph Haase, Serge Haddad
2016· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
33
citations
affno abstractunlabeled
On Some Attacks on Multi-prime RSA
M. Jason Hinek, Mo King Low, Edlyn Teske
2003· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
32
citations
affno abstractunlabeled
Software Implementation of Arithmetic in
Omran Ahmadi, Darrel Hankerson, Alfred Menezes
2007· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
32
citations
affno abstractunlabeled
Chance Encounters in the Digital Library
Elaine G. Toms, Lori McCay‐Peet
2009· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
32
citations
affno abstractunlabeled
Group Testing and Batch Verification
Gregory M. Zaverucha, Douglas R. Stinson
2010· book-chapter· en· Lecture notes in computer science· Medicine
machine prediction:candidate · noneconsensus · none
32
citations
affno abstractunlabeled
Train Scheduling with Hybrid ASP
Dirk Abels, Julian Jordi, Max Ostrowski, Torsten Schaub, Ambra Toletti, Philipp Wanko
2019· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
32
citations
affno abstractunlabeled
Characterization of Graphs Using Degree Cores
John J. Healy, Jeannette Janssen, Evangelos Milios, William Aiello
2008· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
32
citations
affno abstractunlabeled
Conceptualizing Student Models for ICALL
Luiz Amaral, Detmar Meurers
2007· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
32
citations
affno abstractunlabeled
Autonomic Computing Now You See It, Now You Don’t
Hausi Müller, Holger M. Kienle, Ulrike Stege
2009· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
32
citations
affno abstractunlabeled
Universal Succinct Representations of Trees?
Arash Farzan, Rajeev Raman
2009· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
32
citations
affno abstractunlabeled
Advanced Conceptual Modeling Techniques
Eric Yu, Masatoshi Yoshikawa
2003· book· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
32
citations
affno abstractunlabeled
Extending Alloy with Partial Instances
Vajih Montaghami, Derek Rayside
2012· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
32
citations
affno abstractunlabeled
L-ToPSS – Push-Oriented Location-Based Services
Ioana Burcea, Hans‐Arno Jacobsen
2003· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
32
citations
affno abstractunlabeled
Web Page Transformation When Switching Devices
Bonnie MacKay, Carolyn Watters, Jack Duffy
2004· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
32
citations

How this was built: Screen · Findings · About