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 82 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
A Survey of Recent Attacks on the Filter Generator
Sondre Rønjom, Guang Gong, Tor Helleseth
2007· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
8
citations
affno abstractunlabeled
Finding Compact Structural Motifs
Jianbo Qian, Shuai Cheng Li, Dongbo Bu, Ming Li, Jinbo Xu
2007· book-chapter· en· Lecture notes in computer science· Biochemistry, Genetics and Molecular Biology
machine prediction:candidate · noneconsensus · none
8
citations
affno abstractunlabeled
Position Discovery for a System of Bouncing Robots
Jurek Czyzowicz, Leszek Gąsieniec, Adrian Kosowski, Evangelos Kranakis, Oscar Morales Ponce, Eduardo Pacheco
2012· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
8
citations
affno abstractunlabeled
New Bounds for Motif Finding in Strong Instances
Broňa Brejová, Daniel G. Brown, Ian M. Harrower, Tomáš Vinař
2006· book-chapter· en· Lecture notes in computer science· Engineering
machine prediction:candidate · noneconsensus · none
8
citations
affno abstractunlabeled
Layered Working-Set Trees
Prosenjit Bose, Karim Douïeb, Vida Dujmović, John Howat
2010· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
8
citations
affno abstractunlabeled
Automating the E-learning Personalization
Fathi Essalmi, Leila Jemni Ben Ayed, Mohamed Jemni, Kinshuk Kinshuk, Sabine Graf
2013· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
8
citations
afffundno abstractunlabeled
Arc-Consistency + Unit Propagation = Lookahead
Jia-Huai You, Guiwen Hou
2004· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
8
citations
affno abstractunlabeled
A Bandwidth Allocation Scheme in Optical TDM
Abdelilah Maach, Hassan Zeineddine, Gregor von Bochmann
2004· book-chapter· en· Lecture notes in computer science· Engineering
machine prediction:candidate · noneconsensus · none
8
citations
affno abstractunlabeled
Belief Rough Set Classifier
Salsabil Trabelsi, Zied Elouedi, Pawan Lingras
2009· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
7
citations
affno abstractunlabeled
Independence of Tabulation-Based Hash Classes
Toryn Q. Klassen, Philipp Woelfel
2012· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
7
citations
affno abstractunlabeled
Meet-in-the-Middle Attacks on Reduced-Round Hierocrypt-3
Ahmed Abdelkhalek, Riham AlTawy, Mohamed F. Tolba, Amr Youssef
2015· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
7
citations
affno abstractunlabeled
Diffusion Transport Alignment
Andrés Orozco‐Duque, Guy Wolf, Kevin R. Moon
2023· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
7
citations
affno abstractunlabeled
Perfect DCJ Rearrangement
Sèverine Bérard, Annie Château, Cédric Chauve, Christophe Paul, Éric Tannier
2008· book-chapter· en· Lecture notes in computer science· Biochemistry, Genetics and Molecular Biology
machine prediction:candidate · noneconsensus · none
7
citations
affno abstractunlabeled
Distance Corrections on Recombinant Sequences
David Bryant, Daniel H. Huson, Tobias H. Kloepper, Kay Nieselt
2003· book-chapter· en· Lecture notes in computer science· Biochemistry, Genetics and Molecular Biology
machine prediction:candidate · noneconsensus · none
7
citations
affno abstractunlabeled
Semantic-Based Cross-Media Image Retrieval
Ahmed Id Oumohmed, Max Mignotte, Jian‐Yun Nie
2005· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
7
citations
affno abstractunlabeled
Correcting Errors in Message Passing Systems
Jan Bækgaard Pedersen, Alan Wagner
2001· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
7
citations

How this was built: Screen · Findings · About