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 26 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
Use Case Level Pointcuts
Jonathan Sillito, Christopher Dutchyn, Andrew Eisenberg, Kris De Volder
2004· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
27
citations
affno abstractunlabeled
Low-Level Visual Homing
Andrew Vardy, Franz Oppacher
2003· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
27
citations
affno abstractunlabeled
Hairpin Structures in DNA Words
Lila Kari, Stavros Konstantinidis, Elena Losseva, Petr Sosı́k, G. Thierrin
2006· book-chapter· en· Lecture notes in computer science· Biochemistry, Genetics and Molecular Biology
machine prediction:candidate · noneconsensus · none
27
citations
affno abstractunlabeled
Sorting multisets and vectors in-place
J. Ian Munro, Venkatesh Raman
2005· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
27
citations
affno abstractunlabeled
Instantiation Validity in IS Design Research
Roman Lukyanenko, Jöerg Evermann, Jeffrey Parsons
2014· book-chapter· en· Lecture notes in computer science· Social Sciences
machine prediction:candidate · metaresearchconsensus · none
27
citations
affno abstractunlabeled
Materialized View Selection in XML Databases
Nan Tang, Jeffrey Xu Yu, Hao Tang, M. TAMER ÖZSU, Peter Boncz
2009· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
27
citations
affno abstractunlabeled
Probabilistic Graph Summarization
Nasrin Hassanlou, Maryam Shoaran, Alex Thomo
2013· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
26
citations
affno abstractunlabeled
Semantic Variations Among UML StateMachines
Ali Taleghani, Joanne M. Atlee
2006· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
26
citations
affno abstractunlabeled
Synchronous Rendezvous for Location-Aware Agents
Andrew Collins, Jurek Czyzowicz, Leszek Gąsieniec, Adrian Kosowski, Russell Martin
2011· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
26
citations
affno abstractunlabeled
Graph Exploration by a Finite Automaton
Pierre Fraigniaud, David Ilcinkas, Guy Peer, Andrzej Pelc, David Peleg
2004· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
26
citations
affno abstractunlabeled
Light-Efficient Photography
Samuel W. Hasinoff, Kiriakos N. Kutulakos
2008· book-chapter· en· Lecture notes in computer science· Engineering
machine prediction:candidate · noneconsensus · none
26
citations
affno abstractunlabeled
Watch Your Steps: Local Image and Scene Editing by Text Instructions
Ashkan Mirzaei, Tristan Aumentado‐Armstrong, Marcus A. Brubaker, Jonathan W. Kelly, Alex Levinshtein, Konstantinos G. Derpanis +1 more
2024· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
26
citations
affno abstractunlabeled
Cryptanalysis of Short RSA Secret Exponents
Michael J. Wiener
2007· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
26
citations
affno abstractgemma · no categorygpt · no categorymodels agree
An Event-Based Pool Physics Simulator
Will Leckie, Michael Greenspan
2006· book-chapter· en· Lecture notes in computer science· Economics, Econometrics and Finance
machine prediction:candidate · noneconsensus · none
26
citations
affno abstractunlabeled
Treatment of Diagrams in Document Image Analysis
Dorothea Blostein, Edward Lank, Richard Zanibbi
2000· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
26
citations

How this was built: Screen · Findings · About