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 3 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.

affunlabeled
Formula Caching in DPLL
Paul Beame, Russell Impagliazzo, Toniann Pitassi, Nathan Segerlind
2010· article· en· ACM Transactions on Computation Theory· Computer Science
machine prediction:candidate · noneconsensus · none
41
citations
affno abstractunlabeled
MapReduce for Parallel Trace Validation of LTL Properties
Benjamin Barré, Mathieu Klein, Maxime Soucy-Boivin, Pierre-Antoine Ollivier, Sylvain Hallé
2013· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
40
citations
affno abstractunlabeled
Why Waste a Perfectly Good Abstraction?
Arie Gurfinkel, Marsha Chećhik
2006· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
40
citations
affno abstractunlabeled
The proof complexity of linear algebra
Michael Soltys, Stephen Cook
2004· article· en· Annals of Pure and Applied Logic· Computer Science
machine prediction:candidate · noneconsensus · none
39
citations
afffundunlabeled
Space Complexity in Polynomial Calculus
Massimo Lauria, Jakob Nordstr”öm, Noga Ron‐Zewi, Neil Thapen
2015· article· en· SIAM Journal on Computing· Computer Science
machine prediction:candidate · noneconsensus · none
37
citations
affunlabeled
Relaxation Search: A Simple Way of Managing Optional Clauses
Fahiem Bacchus, Jessica Davies, Maria Tsimpoukelli, George Katsirelos
2014· article· en· Proceedings of the AAAI Conference on Artificial Intelligence· Computer Science
machine prediction:candidate · noneconsensus · none
37
citations
afffundunlabeled
SAT Modulo Monotonic Theories
Sam Bayless, Noah Bayless, Holger H. Hoos, Alan J. Hu
2015· article· en· Proceedings of the AAAI Conference on Artificial Intelligence· Computer Science
machine prediction:candidate · noneconsensus · none
36
citations
afffundunlabeled
Strategy synthesis for linear arithmetic games
Azadeh Farzan, Zachary Kincaid
2017· article· en· Proceedings of the ACM on Programming Languages· Computer Science
machine prediction:candidate · noneconsensus · none
36
citations
affno abstractunlabeled
Temporal Properties of Self-Timed Rings
Anthony Winstanley, Mark R. Greenstreet
2001· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
35
citations
affunlabeled
Efficient ADD operations for point-based algorithms
Guy Shani, Pascal Poupart, Ronen I. Brafman, Solomon Eyal Shimony
2008· article· en· International Conference on Automated Planning and Scheduling· Computer Science
machine prediction:candidate · noneconsensus · none
34
citations
affno abstractunlabeled
The Prusti Project: Formal Verification for Rust
Vytautas Astrauskas, Aurel Bílý, Jonáš Fiala, Zachary Grannan, Christoph Matheja, Péter Müller +2 more
2022· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
34
citations
affno abstractunlabeled
Approaching the Coverability Problem Continuously
Michael Blondin, Alain Finkel, Christoph Haase, Serge Haddad
2016· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
33
citations
affno abstractunlabeled
Translating Statecharts to B
Emil Sekerinski, Rafik Zurob
2002· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
33
citations
affunlabeled
Exploiting QBF Duality on a Circuit Representation
Alexandra Goultiaeva, Fahiem Bacchus
2010· article· en· Proceedings of the AAAI Conference on Artificial Intelligence· Computer Science
machine prediction:candidate · noneconsensus · none
33
citations
afffundunlabeled
Approximating Markov Processes by Averaging
Philippe Chaput, Vincent Danos, Prakash Panangaden, Gordon Plotkin
2014· article· en· Journal of the ACM· Computer Science
machine prediction:candidate · noneconsensus · none
32
citations
affunlabeled
Weak Alphabet Merging of Partial Behavior Models
Dario Fischbein, Nicolás D’Ippolito, Greg Brunet, Marsha Chećhik, Sebastián Uchitel
2012· article· en· ACM Transactions on Software Engineering and Methodology· Computer Science
machine prediction:candidate · noneconsensus · none
32
citations
affno abstractunlabeled
Implementing a Multi-valued Symbolic Model Checker
Marsha Chećhik, Benet Devereux, Steve Easterbrook
2001· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
31
citations
affno abstractunlabeled
Beyond CNF: A Circuit-Based QBF Solver
Alexandra Goultiaeva, Vicki Iverson, Fahiem Bacchus
2009· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
31
citations
afffundunlabeled
Towards a Unified View of AI Planning and Reactive Synthesis
Alberto Rivas, Meghyn Bienvenu, Sheila A. McIlraith
2019· article· en· Proceedings of the International Conference on Automated Planning and Scheduling· Computer Science
machine prediction:candidate · noneconsensus · none
31
citations
← previousnext →

How this was built: Screen · Findings · About