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 182 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
Volumetric Rendering with Baked Quadrature Fields
Gopal Sharma, Daniel Rebain, Kwang Moo Yi, Andrea Tagliasacchi
2024· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affno abstractunlabeled
The Distance 4-Sector of Two Points Is Unique
Robert Fraser, Meng He, Akitoshi Kawamura, Alejandro López-Ortíz, J. Ian Munro, Patrick K. Nicholson
2013· book-chapter· en· Lecture notes in computer science· Mathematics
machine prediction:candidate · noneconsensus · none
1
citations
affno abstractunlabeled
On the computation of the Hilbert series
Joachim Hollman
2005· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affno abstractunlabeled
The Road to Direction
Maxime Sainte-Marie
2014· book-chapter· en· Lecture notes in computer science· Engineering
machine prediction:candidate · noneconsensus · none
1
citations
affno abstractunlabeled
Scheduling Maintenance Jobs in Networks
Fidaa Abed, Lin Chen, Yann Disser, Martin Groß, Nicole Megow, Julie Meißner +2 more
2017· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affno abstractunlabeled
Root-Finding with Implicit Deflation
Rémi Imbach, Victor Y. Pan, Chee Yap, Ilias Kotsireas, Vitaly Zaderman
2019· preprint· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affno abstractunlabeled
Games and Learning Alliance
Francesca de Rosa, Iza Marfisi Schottman, Jannicke Baalsrud Hauge, Francesco Bellotti, Pierpaolo Dondio, Margarida Roméro
2021· book· en· Lecture notes in computer science· Psychology
machine prediction:candidate · noneconsensus · none
1
citations
affno abstractunlabeled
Repetition Avoidance in Circular Factors
Hamoon Mousavi, Jeffrey Shallit
2013· preprint· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
afffundno abstractunlabeled
The Visible Perimeter of an Arrangement of Disks
Gabriel Nivasch, János Pach, Gábor Tardos
2013· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affno abstractunlabeled
Recovering the Lattice of Repetitive Sub-functions
Guy-Vincent Jourdan, Hasan Ural, Hüsnü Yenigün
2005· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affno abstractunlabeled
The Algebraic Theory of Parikh Automata
Michaël Cadilhac, Andreas Krebs, Pierre McKenzie
2013· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affno abstractunlabeled
Complexity and Algorithms for MUL-Tree Pruning
Mathieu Gascon, Riccardo Dondi, Nadia El-Mabrouk
2021· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
afffundno abstractunlabeled
State Complexity of Overlap Assembly
Janusz Brzozowski, Lila Kari, Bai Li, Marek Szykuła
2018· preprint· en· Lecture notes in computer science· Biochemistry, Genetics and Molecular Biology
machine prediction:candidate · noneconsensus · none
1
citations

How this was built: Screen · Findings · About