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 44 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
Multi-Agent-Based Simulation VIII
Jörg Siekmann, Mario Paolucci, Emma Norling, Luís Antunes
2008· book· en· Lecture notes in computer science· Engineering
machine prediction:candidate · noneconsensus · none
17
citations
affno abstractunlabeled
Abstract Operational Semantics for Use Case Maps
Jameleddine Hassine, Juergen Rilling, Rachida Dssouli
2005· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
17
citations
affno abstractunlabeled
Dynamic View Selection for OLAP
Michael A. Lawrence, Andrew Rau‐Chaplin
2006· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
17
citations
affno abstractunlabeled
A Hybrid Schema for Systematic Local Search
William S. Havens, Bistra Dilkina
2004· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
16
citations
affno abstractunlabeled
Improving ML Safety with Partial Specifications
Rick Salay, Krzysztof Czarnecki
2019· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
16
citations
affno abstractunlabeled
A Particle Filter Framework for Contour Detection
Nicolas Widynski, Max Mignotte
2012· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
16
citations
affno abstractunlabeled
Text Classification Using Small Number of Features
Masoud Makrehchi, Mohamed S. Kamel
2005· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
16
citations
affno abstractunlabeled
Mining Social Networks for Significant Friend Groups
Carson K. Leung, Syed Khairuzzaman Tanbeer
2012· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
16
citations
affno abstractunlabeled
On the Spanning Ratio of Theta-Graphs
Prosenjit Bose, André van Renssen, Sander Verdonschot
2013· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
16
citations
affno abstractunlabeled
Change Propagation due to Uncertainty Change
Rick Salay, Jan Gorzny, Marsha Chećhik
2013· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
16
citations
affno abstractunlabeled
Interactive Construction of Decision Trees
Jianchao Han, Nick Cercone
2001· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
16
citations
affno abstractunlabeled
On the Recognition of General Partition Graphs
Ton Kloks, Chuan-Min Lee, Jiping Liu, Haiko Müller
2003· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
16
citations
affno abstractunlabeled
Guessing Secrecy
Mohsen Alimomeni, Reihaneh Safavi–Naini
2012· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
16
citations
affno abstractunlabeled
Reliability-Aware Routing of AVB Streams in TSN Networks
Ayman A. Atallah, Ghaith Bany Hamad, Otmane Aı̈t Mohamed
2018· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
16
citations
affno abstractunlabeled
Metamodelling and Conformance Checking with PVS
Richard F. Paige, Jonathan S. Ostroff
2001· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
16
citations
← previousnext →

How this was built: Screen · Findings · About