MétaCan
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.

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 5 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
An Approach for Testing Real Time Protocol Entities
Ahmed Khoumsi, Mehdi Akalay, Rachida Dssouli, Abdeslam En‐Nouaary, Louis Granger
2000· book-chapter· en· IFIP advances in information and communication technology· Computer Science
machine prediction:candidate · noneconsensus · none
22
citations
affno abstractunlabeled
Encoding a process algebra using the Event B method
Yamine Aït-Ameur, Mickaël Baron, Nadjet Kamel, Jean‐Marc Mota
2009· article· en· International Journal on Software Tools for Technology Transfer· Computer Science
machine prediction:candidate · noneconsensus · none
21
citations
affno abstractunlabeled
Abstract Patterns of Compositional Reasoning
Nina Amla, E. Allen Emerson, Kedar S. Namjoshi, Richard Trefler
2003· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
20
citations
affno abstractunlabeled
Error Correcting Codes
Christiane Rousseau, Yvan Saint-Aubin
2008· book-chapter· en· Springer undergraduate texts in mathematics and technology· Computer Science
machine prediction:candidate · noneconsensus · none
20
citations
affunlabeled
Reasoning about static and dynamic properties in alloy
Marcelo F. Frias, Carlos G. López Pombo, Gabriel Alfredo Baum, Nazareno Aguirre, T. S. E. Maibaum
2005· article· en· ACM Transactions on Software Engineering and Methodology· Computer Science
machine prediction:candidate · noneconsensus · none
20
citations
affunlabeled
Ultimate GemCutter and the Axes of Generalization
Dominik Klumpp, Daniel Dietsch, Matthias Heizmann, Frank Schüssele, Marcel Ebbinghaus, Azadeh Farzan +1 more
2022· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
19
citations
affunlabeled
Mapping template semantics to SMV
Yun Lu, Joanne M. Atlee, Nancy A. Day, Jianwei Niu
2004· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
19
citations
affno abstractunlabeled
Weak Bisimulation is Sound and Complete for PCTL*
Josée Desharnais, Vineet Gupta, Radha Jagadeesan, Prakash Panangaden
2002· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
18
citations
affno abstractunlabeled
Temporal Antecedent Failure: Refining Vacuity
Shoham Ben-David, Dana Fisman, Sitvanit Ruah
2007· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
18
citations
affno abstractunlabeled
Use Case Maps as a property specification language
Jameleddine Hassine, Juergen Rilling, Rachida Dssouli
2007· article· en· Software & Systems Modeling· Computer Science
machine prediction:candidate · noneconsensus · none
18
citations
affunlabeled
Stubborn Sets for Time Petri Nets
Hanifa Boucheneb, Kamel Barkaoui
2015· article· en· ACM Transactions on Embedded Computing Systems· Computer Science
machine prediction:candidate · noneconsensus · none
18
citations
affunlabeled
Managing don't cares in Boolean satisfiability
S. Safarpour, A. Veneris, Rolf Drechsler, J. Lee
2004· article· en· Proceedings Design, Automation and Test in Europe Conference and Exhibition· Computer Science
machine prediction:candidate · noneconsensus · none
18
citations
affno abstractunlabeled
Timed Use Case Maps
Jameleddine Hassine, Juergen Rilling, Rachida Dssouli
2006· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
17
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

How this was built: Screen · Findings · About