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 142 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.

afffundno abstractunlabeled
Perceptual Grouping Using Superpixels
Sven Dickinson, Alex Levinshtein, Cristian Sminchisescu
2012· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
affno abstractunlabeled
Key Recovery Attack Against 2.5-Round $$\pi $$ -Cipher
Christina Boura, Avik Chakraborti, Gaëtan Leurent, Goutam Paul, Dhiman Saha, Hadi Soleimany +1 more
2016· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
affno abstractunlabeled
Heaven or Hell? A “Real-Time” UML?
Bran Selić, Alan Burns, Alan Moore, Theo Tempelmeier, François Terrier
2000· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
affno abstractunlabeled
Automata Implementation
Oliver Boldt
2001· book· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
aboutno affno abstractunlabeled
A Spatiotemporal Analysis of Taxis Demand: A Case Study in the Manizales City
Andrés Felipe Giraldo-Forero, S. Garcia-Lopez, Paula Andrea Rodríguez Marín, Juan Martinez, Yohan Ricardo Céspedes-Villar, Oscar Cardona +2 more
2019· book-chapter· en· Lecture notes in computer science· Social Sciences
machine prediction:candidate · noneconsensus · none
2
citations
affno abstractunlabeled
Prime Decompositions of Regular Prefix Codes
Jurek Czyzowicz, Wojciech Frączak, Andrzej Pelc, Wojciech Rytter
2003· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
affno abstractunlabeled
Fully End-To-End Super-Resolved Bone Age Estimation
Mohammed Gasmallah, Farhana Zulkernine, François Rivest, Parvin Mousavi, Alireza Sedghi
2019· book-chapter· en· Lecture notes in computer science· Engineering
machine prediction:candidate · noneconsensus · none
2
citations
affno abstractunlabeled
Zero Error List-Decoding Capacity of the q/(q–1) Channel
Sourav Chakraborty, Jaikumar Radhakrishnan, Nandakumar Raghunathan, Prashant Sasatte
2006· book-chapter· en· Lecture notes in computer science· Mathematics
machine prediction:candidate · noneconsensus · none
2
citations
affno abstractunlabeled
Approximating Steiner k-Cuts
Chandra Chekuri, Sudipto Guha, Joseph Naor
2003· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
affno abstractunlabeled
Transition Times for Manipulation Tasks in Hybrid Interfaces
Allan Christensen, Simon Pedersen, Per Bjerre, Andreas K. Pedersen, Wolfgang Stuerzlinger
2016· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
affno abstractunlabeled
An undergraduate course in software design
Daniel Hoffman
2006· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations

How this was built: Screen · Findings · About