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 86 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
Length Codes, Products of Languages and Primality
Arto Salomaa, Kai Salomaa, Sheng Yü
2008· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
7
citations
fundno affno abstractunlabeled
Middleware 2001
2001· book· en· Lecture notes in computer science· Social Sciences
machine prediction:candidate · noneconsensus · none
7
citations
affno abstractunlabeled
An Ontology-Based Reasoning Approach for Electric Power Utilities
Mohamed Gaha, Arnaud Zinflou, Christian Langheit, Alexandre Bouffard, Mathieu Viau, Luc Vouligny
2013· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
7
citations
affno abstractunlabeled
Association Rules Mining with Auto-encoders
Théophile Berteloot, Richard Khoury, Audrey Durand
2024· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
7
citations
affno abstractunlabeled
Provable computable functions on abstract data types
John V. Tucker, Stanley S. Wainer, J. I. Zucker
2005· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
7
citations
afffundno abstractunlabeled
Branching Measures and Nearly Acyclic NFAs
Kai Salomaa
2017· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
7
citations
fundno affno abstractunlabeled
Runtime Verification
Ezio Bartocci, Rupak Majumdar
2015· book· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
7
citations
affno abstractunlabeled
Comparing Approaches to Tag Discourse Relations
Shamima Mithun, Leila Kosseim
2011· book-chapter· en· Lecture notes in computer science· Arts and Humanities
machine prediction:candidate · noneconsensus · none
7
citations
affno abstractunlabeled
Abstract Analysis of Symbolic Executions
Aws Albarghouthi, Arie Gurfinkel, Ou Wei, Marsha Chećhik
2010· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
7
citations
affno abstractunlabeled
Error Invariants for Concurrent Traces
Andreas Holzer, Daniel Schwartz‐Narbonne, Mitra Tabaei Befrouei, Georg Weißenbacher, Thomas Wies
2016· 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

How this was built: Screen · Findings · About