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
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 ·
Categories
Machine labels · sparse coverage
Evidence
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 2 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 teacher distillation outputs. Candidate is the union; consensus is the intersection.

affno abstractunlabeled
OpenTM: Traffic Matrix Estimator for OpenFlow Networks
2010· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrow+scholarly_communication+open_scienceconsensus · none
281
citations
affno abstractunlabeled
Mobility Detection Using Everyday GSM Traces
2006· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
277
citations
affno abstractunlabeled
Learning Options in Reinforcement Learning
2002· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrow+research_integrityconsensus · none
270
citations
affno abstractunlabeled
Human-Computer Interaction – INTERACT 2011
2011· book· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrow+open_science+research_integrity+insufficient_payloadconsensus · none
268
citations
affno abstractunlabeled
LIMBO: Scalable Clustering of Categorical Data
2004· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrow+open_scienceconsensus · open_science
260
citations
affno abstractunlabeled
Explainable AI: The New 42?
2018· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrow+scholarly_communication+open_science+insufficient_payloadconsensus · none
252
citations
affno abstractunlabeled
Transactions on Rough Sets I
2004· book· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
238
citations
afffundno abstractunlabeled
Computer Vision – ECCV 2014
2014· book· en· Lecture notes in computer science· Engineering
distilled prediction:candidate · metaepi_narrowconsensus · none
233
citations
fundno affno abstractunlabeled
Computer Vision – ECCV 2016
2016· book· en· Lecture notes in computer science· Engineering
distilled prediction:candidate · metaepi_narrowconsensus · none
232
citations
affno abstractunlabeled
Advances in Cryptology – CRYPTO 2012
2012· book· en· Lecture notes in computer science· Social Sciences
distilled prediction:candidate · metaepi_narrow+stsconsensus · none
224
citations
affno abstractunlabeled
How to Run Turing Machines on Encrypted Data
2013· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrow+scholarly_communication+open_scienceconsensus · none
213
citations
affno abstractunlabeled
Optimal Paths in Weighted Timed Automata
2001· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
209
citations
affno abstractunlabeled
Robust Visual Tracking for Multiple Targets
2006· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
188
citations
affno abstractunlabeled
A Flexible Power Model for FPGAs
2002· book-chapter· en· Lecture notes in computer science· Engineering
distilled prediction:candidate · metaepi_narrowconsensus · none
178
citations
affno abstractunlabeled
Inconsistency Tolerance
2005· book· en· Lecture notes in computer science· Social Sciences
distilled prediction:candidate · metaepi_narrowconsensus · none
175
citations
← previousnext →

How this was built: Screen · Findings · About