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 201 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
Visualizing Temporal Interval Hierarchies
Nafiz Sadman, Nastaran Kianersi, Sean Kauffman
2025· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
fundno affno abstractunlabeled
What Makes a User Click on a News Item?
Bruno N. Sotic, Jaap Kamps
2025· book-chapter· en· Lecture notes in computer science· Social Sciences
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
On the Number of Unbordered Factors
Daniel Goč, Hamoon Mousavi, Jeffrey Shallit
2013· preprint· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Improved MPI Collectives for 3D-FFT
Yuang Yan, Natasha Kuk, Ryan E. Grant
2024· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Explicit Token-Based Communication for Mobile Entities
Balasingham Balamohan, Stefan Dobrev, Paola Flocchini, Nicola Santoro
2025· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Three-Way Strategy Design for Conflict Analysis
Chengjun Shi, Mengjun Hu, Yilin Huang, Yiyu Yao
2025· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Lattice Blind Signatures with Forward Security
Huy Quoc Le, Dung Hoang Duong, Willy Susilo, Ha Thanh Nguyen Tran, Viet Cuong Trinh, Josef Pieprzyk +1 more
2020· preprint· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
An Edge Ordering Problem of Regular Hypergraphs
Hongbing Fan, Robert Kalbfleisch
2006· book-chapter· en· Lecture notes in computer science· Engineering
machine prediction:candidate · noneconsensus · none
0
citations
fundno affunlabeled
TaSSAT: Transfer and Share SAT
Md Solimul Chowdhury, Cayden R. Codel, Marijn J. H. Heule
2024· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
State Complexity of the Minimal Star Basis
Jozef Jirásek, Galina Jirásková, Jeffrey Shallit
2024· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Monodromy Coordinates
Taylor Brysiewicz
2024· book-chapter· en· Lecture notes in computer science· Mathematics
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
High Fives to the Avant-Garde
Kurtis Lesick
2016· book-chapter· en· Lecture notes in computer science· Arts and Humanities
machine prediction:candidate · noneconsensus · none
0
citations

How this was built: Screen · Findings · About