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 103 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
The θ 5-Graph is a Spanner
Prosenjit Bose, Pat Morin, André van Renssen, Sander Verdonschot
2013· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
5
citations
affno abstractunlabeled
Comprehensive LU Factors of Polynomial Matrices
Ana C. Camargos Couto, Marc Moreno Maza, David Linder, David J. Jeffrey, Robert M. Corless
2020· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
5
citations
afffundno abstractunlabeled
Approximating Labelled Markov Processes Again!
Philippe Chaput, Vincent Danos, Prakash Panangaden, Gordon Plotkin
2009· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
5
citations
aboutno affno abstractunlabeled
Environmental Monitoring of Libraries with MonTreAL
Marcel Großmann, Steffen Illig, Cornelius Matějka
2017· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
5
citations
affno abstractunlabeled
Drawing K n in Three Dimensions with One Bend Per Edge
Olivier Devillers, Hazel Everett, Sylvain Lazard, Maria Pentcheva, Stephen Wismath
2006· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
5
citations
affno abstractunlabeled
Private Data Management in Collaborative Environments
Larry Korba, Ronggong Song, George Yee, Andrew S. Patrick, Scott Buffett, Yunli Wang +1 more
2007· book-chapter· en· Lecture notes in computer science· Decision Sciences
machine prediction:candidate · noneconsensus · none
5
citations
affno abstractunlabeled
Overview of the CLEF 2024 JOKER Track
Liana Ermakova, Anne-Gwenn Bosser, Tristan Miller, Victor Manuel Palma Preciado, Grigori Sidorov, Adam Jatowt
2024· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
5
citations
affno abstractunlabeled
Order Structures for Subclasses of Generalised Traces
Ryszard Janicki, Jetty Kleijn, Maciej Koutny, Łukasz Mikulski
2015· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
5
citations
affno abstractunlabeled
The Multi-source Beachcombers’ Problem
Jurek Czyzowicz, Leszek Gąsieniec, Konstantinos Georgiou, Evangelos Kranakis, Fraser MacQuarrie
2015· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
5
citations
affno abstractunlabeled
Transactions on Computational Science XXVIII
Alexei Sourin, C.J. Kenneth Tan, Marina L. Gavrilova
2016· book· en· Lecture notes in computer science· Engineering
machine prediction:candidate · noneconsensus · none
5
citations
afffundno abstractunlabeled
On Saturation Effects in Coupled Speed Scaling
Maryam Elahi, Carey Williamson
2018· book-chapter· en· Lecture notes in computer science· Business, Management and Accounting
machine prediction:candidate · noneconsensus · none
5
citations
affno abstractunlabeled
Software Agents in CVW
Ming Zhen Lei, Elhadi Shakshuki, Ivan Tomek
2004· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
5
citations
affno abstractunlabeled
Issues arising in the analysis of L.0
Linda Ness
2005· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
5
citations
affno abstractunlabeled
Input-Thrifty Extrema Testing
Kuan-Chieh Robert Tseng, David Kirkpatrick
2011· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
5
citations

How this was built: Screen · Findings · About