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 127 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
Listing All Sorting Reversals in Quadratic Time
Krister M. Swenson, Ghada Badr, David Sankoff
2010· book-chapter· en· Lecture notes in computer science· Biochemistry, Genetics and Molecular Biology
machine prediction:candidate · noneconsensus · none
3
citations
affno abstractunlabeled
Computing Valuation Popov Forms
Mark Giesbrecht, George Labahn, Yang Zhang
2005· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations
affno abstractunlabeled
A New Approach to the Paperfolding Sequences
Daniel Goč, Hamoon Mousavi, Luke Schaeffer, Jeffrey Shallit
2015· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations
affno abstractunlabeled
Improved Method for Point-Based Tracking
Andrei Danilchenko, Andrew D. Wiles, Ramya Balachandran, J. Michael Fitzpatrick
2010· article· en· Lecture notes in computer science· Engineering
machine prediction:candidate · noneconsensus · none
3
citations
affno abstractunlabeled
Solving Probabilistic Combinatorial Games
Ling Zhao, Martin Müller
2006· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations
affno abstractunlabeled
Data Mining with Calendar Attributes
Howard J. Hamilton, Dee Jay Randall
2001· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations
affno abstractunlabeled
Towards Architecture-Centric Software Generation
Chung–Horng Lung, Balasangar Balasubramaniam, Kamalachelva Selvarajah, Poopalasinkam Elankeswaran, Umatharan Gopalasundaram
2010· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations
afffundno abstractunlabeled
Trade-Offs in Planar Polyline Drawings
Stéphane Durocher, Debajyoti Mondal
2014· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations
affno abstractunlabeled
Splitting Atoms in Relational Algebras
Prathap Siddavaatam, Michael Winter
2011· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations
affno abstractunlabeled
Lemmings Is PSPACE-Complete
Giovanni Viglietta
2014· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations
affno abstractunlabeled
Runtime Monitoring of Temporal Logic Properties in a Platform Game
Simon Varvaressos, Dominic Vaillancourt, Sébastien Gaboury, Alexandre Blondin Massé, Sylvain Hallé
2013· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations
affno abstractunlabeled
Exploiting Entropy in Constraint Programming
Auguste Burlats, Gilles Pesant
2023· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations
affno abstractunlabeled
Searching Trees with Sources and Targets
Chris Worman, Boting Yang
2008· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations
affno abstractunlabeled
Predicting Web Information Content
Tingshao Zhu, Russell Greiner, Gerald Häubl, Bob Price
2005· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations

How this was built: Screen · Findings · About