MétaCan
ENFR
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.

Export CSVExport JSONAPI query

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 143 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
State Complexity and Jacobsthal’s Function
Jeffrey Shallit
2001· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
affno abstractunlabeled
Analyzing Requirements Using Environment Modelling
Dominique Méry, Neeraj Kumar Singh
2015· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
affno abstractunlabeled
Nonparametric Impulsive Noise Removal
Bogdan Smołka, Rastislav Lukàč
2004· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
affno abstractunlabeled
A Multi-Objective Genetic Algorithm Based on Density
Jinhua Zheng, Wu Song, Xuyong Li, Charles X. Ling
2007· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
affno abstractunlabeled
A Framework for Composing Personalized Web Resources
Bipin Upadhyaya, Hua Xiao, Ying Zou, Joanna Ng, Alex Lau
2013· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
affno abstractunlabeled
Multi-target Ray Searching Problems
Spyros Angelopoulos, Alejandro López-Ortíz, Κωνσταντίνος Παναγιώτου
2011· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
affno abstractunlabeled
Folding a Paper Strip to Minimize Thickness
Erik D. Demaine, David Eppstein, Adam Hesterberg, Hiro Ito, Anna Lubiw, Ryuhei Uehara +1 more
2015· book-chapter· en· Lecture notes in computer science· Engineering
machine prediction:candidate · noneconsensus · none
2
citations
affno abstractunlabeled
Detection of Equalization Errors in Time-Varying Channels
Juraci Ferreira Galdino, Ernesto Pinto, Marcelo Sampaio de Alencar, E.S. Sousa
2004· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
affno abstractunlabeled
Adding DL-Lite TBoxes to Proper Knowledge Bases
Giuseppe De Giacomo, Hector J. Levesque
2015· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
affno abstractunlabeled
Property-Driven Statistics of Biological Networks
Pierre-Yves Bourguignon, Vincent Danos, François Képès, Serge Smidtas, Vincent Schächter
2006· book-chapter· en· Lecture notes in computer science· Biochemistry, Genetics and Molecular Biology
machine prediction:candidate · noneconsensus · none
2
citations
affno abstractunlabeled
Incremental Verification of Computing Policies
Ehab S. Elmallah, H. B. Acharya, Mohamed G. Gouda
2014· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
affno abstractunlabeled
Minimum Consistent Subset Problem for Trees
Sanjana Dey, Anil Maheshwari, Subhas C. Nandy
2021· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
← previousnext →

How this was built: Screen · Findings · About