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
Topic
Formal Methods in Verification
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.

1,244 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.
1,244 works in the cohort · of 4,299,418page 7 of 25

Labels cover 3 of 1,244 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 1,244 of 1,244 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
The Safety Simple Subset
Shoham Ben-David, Dana Fisman, Sitvanit Ruah
2006· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
13
citations
affno abstractunlabeled
Finding Small Backdoors in SAT Instances
Zijie Li, Peter van Beek
2011· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
13
citations
afffundunlabeled
On Closure UnderStuttering
Dimitrie O. Păun, Marsha Chećhik
2003· article· en· Formal Aspects of Computing· Computer Science
machine prediction:candidate · noneconsensus · none
13
citations
affunlabeled
Proving termination of nonlinear command sequences
Domagoj Babić, Byron Cook, Alan J. Hu, Zvonimir Rakamarić
2012· article· en· Formal Aspects of Computing· Computer Science
machine prediction:candidate · noneconsensus · none
13
citations
affno abstractunlabeled
Hierarchical formal verification using a hybrid tool
Skander Kort, Sofi�ne Tahar, Paul Curzon
2003· article· en· International Journal on Software Tools for Technology Transfer· Computer Science
machine prediction:candidate · noneconsensus · none
12
citations
affunlabeled
A Semantics for Timed MSC
Tong Zheng, Ferhat Khendek, Loı̈c Hélouët
2002· article· en· Electronic Notes in Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
12
citations
affno abstractunlabeled
Dynamically Partitioning for Solving QBF
Horst Samulowitz, Fahiem Bacchus
2007· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
12
citations
affno abstractunlabeled
Formalizing Dangerous SAT Encodings
Alexander Hertel, Philipp Hertel, Alasdair Urquhart
2007· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
12
citations
affno abstractunlabeled
Comparison of SPIN and VIS for protocol verification
Hong Peng, Sofi�ne Tahar, Ferhat Khendek
2003· article· en· International Journal on Software Tools for Technology Transfer· Computer Science
machine prediction:candidate · noneconsensus · none
12
citations
affunlabeled
Generating Reliable Code from Hybrid-Systems Models
Madhukar Anand, Sebastian Fischmeister, Yerang Hur, Jesung Kim, I. Lee
2010· article· en· IEEE Transactions on Computers· Computer Science
machine prediction:candidate · noneconsensus · none
12
citations
affunlabeled
SynKit: LTL Synthesis as a Service
Alberto Rivas, Christian Muise, Jorge A. Baier, Sheila A. McIlraith
2018· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
12
citations
affno abstractunlabeled
Validation and Verification of Intelligent and Adaptive Control Systems
Gregory Tallant, James Buffington, Vincent Crum, Bruce H. Krogh, Clinton Plaisted, R. Prasanth +2 more
2004· article· en· AIAA Guidance, Navigation, and Control Conference and Exhibit· Computer Science
machine prediction:candidate · noneconsensus · none
11
citations
← previousnext →

How this was built: Screen · Findings · About