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 72 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 d-Step Approach for Distinct Squares in Strings
Antoine Deza, František Franěk, Mei Jiang
2011· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
9
citations
affno abstractunlabeled
Boolean Grammars
Alexander Okhotin
2003· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
9
citations
affno abstractunlabeled
On the Theory of Composition in Physics
Lucién Hardy
2013· book-chapter· en· Lecture notes in computer science· Physics and Astronomy
machine prediction:candidate · noneconsensus · none
9
citations
affno abstractunlabeled
A methodology for programming with concurrency
Christian Lengauer, Eric C. R. Hehner
2007· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
9
citations
affno abstractunlabeled
On Strongly Chordal Graphs That Are Not Leaf Powers
Manuel Lafond
2017· book-chapter· en· Lecture notes in computer science· Biochemistry, Genetics and Molecular Biology
machine prediction:candidate · noneconsensus · none
9
citations
affno abstractunlabeled
PointNeRF++: A Multi-scale, Point-Based Neural Radiance Field
Weiwei Sun, Eduard Trulls, Yang-Che Tseng, Sneha Sambandam, G. K. Sharma, Andrea Tagliasacchi +1 more
2024· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
9
citations
affno abstractunlabeled
Speeding Up Assumption-Based SAT
Randy Hickey, Fahiem Bacchus
2019· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
9
citations
affno abstractunlabeled
New Lower Bounds on Broadcast Function
Hayk Grigoryan, Hovhannes A. Harutyunyan
2014· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
9
citations
affno abstractunlabeled
Graph-Drawing Contest Report
Thérèse Biedl, Franz J. Brandenburg
2002· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
9
citations
affno abstractunlabeled
Top-Down Progressive Computing
Yiyu Yao, Jigang Luo
2011· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
9
citations
affno abstractunlabeled
Monitoring of Security Properties Using BeepBeep
Mohamed Recem Boussaha, Raphaël Khoury, Sylvain Hallé
2018· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
9
citations
affno abstractunlabeled
A Model-Based Hematopoietic Stem Cell Tracker
Nezamoddin N. Kachouie, Paul Fieguth, John Ramunas, Eric Jervis
2005· book-chapter· en· Lecture notes in computer science· Biochemistry, Genetics and Molecular Biology
machine prediction:candidate · noneconsensus · none
9
citations
affno abstractunlabeled
Approximation Spaces of Type-Free Sets
Peter Apostoli, Akira Kanda
2001· book-chapter· en· Lecture notes in computer science· Mathematics
machine prediction:candidate · noneconsensus · none
9
citations
← previousnext →

How this was built: Screen · Findings · About