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 15 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 teacher distillation outputs. Candidate is the union; consensus is the intersection.

affno abstractunlabeled
A Pragmatic Approach to Stateful Partial Order Reduction
Berk Çirişci, Constantin Enea, Azadeh Farzan, Süha Orhun Mutluergil
2023· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
4
citations
affunlabeled
FC<sup>3</sup>: Feasibility-Based Control Chain Coordination
Jason Harris, Danny Driess, Marc Toussaint
2022· article· en· 2022 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
4
citations
affunlabeled
The Analysis of Open Source Search Engines
Xinyuan Chang
2023· article· en· Highlights in Science Engineering and Technology· Computer Science
distilled prediction:candidate · noneconsensus · none
4
citations
affunlabeled
Symbolic model checking for agent interactions
Mohamed El-Menshawy, Wei Wan, Jamal Bentahar, Rachida Dssouli
2010· article· en· Adaptive Agents and Multi-Agents Systems· Computer Science
distilled prediction:candidate · noneconsensus · none
3
citations
affunlabeled
Fair cycle detection using description logic reasoning
Shoham Ben-David, Jeffrey Pound, Richard Trefler, Dmitry Tsarkov, Grant Weddell
2009· article· en· Research Explorer (The University of Manchester)· Computer Science
distilled prediction:candidate · noneconsensus · none
3
citations
affunlabeled
Formal verification of a bus structure modeled in SystemC
A. Habibi, S. Tabar, L. Halleb
2004· article· en· The 2nd Annual IEEE Northeast Workshop on Circuits and Systems, 2004. NEWCAS 2004.· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
3
citations
affno abstractunlabeled
NuMDG: A New Tool for Multiway Decision Graphs Construction
Sa’ed Abed, Yassine Mokhtari, Otmane Aı̈t Mohamed, Sofiène Tahar
2011· article· en· Journal of Computer Science and Technology· Computer Science
distilled prediction:candidate · noneconsensus · none
3
citations
afffundunlabeled
Bisimulation for Feller-Dynkin Processes
Linan Chen, Florence Clerc, Prakash Panangaden
2019· article· en· Electronic Notes in Theoretical Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
3
citations
affno abstractunlabeled
Automata of asynchronous behaviors
Janusz Brzozowski, R. Negulescu
2000· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · stsconsensus · none
3
citations
affunlabeled
MDG-SAT: an automated methodology for efficient safety checking
Khaza Anuarul Hoque, Otmane Aı̈t Mohamed, Nahum Sá, Sa’ed Abed, Mounir Boukadoum
2012· article· en· International Journal of Critical Computer-Based Systems· Computer Science
distilled prediction:candidate · noneconsensus · none
3
citations
affno abstractunlabeled
Towards a First-Order Deontic Action Logic
Pablo F. Castro, Tom Maibaum
2012· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
3
citations
affunlabeled
Formal Analysis of Soft Errors using Theorem Proving
Naeem Abbasi, Osman Hasan, Sofiène Tahar
2013· article· en· Electronic Proceedings in Theoretical Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
3
citations
affunlabeled
Path graphs and pr-trees
Derek G. Corneil, Steven Chaplick
2012· dissertation· en· Computer Science
distilled prediction:candidate · noneconsensus · none
3
citations
affno abstractunlabeled
A Logical Approach to Data-Aware Automated Sequence Generation
Sylvain Hallé, Roger Villemaire, Omar Cherkaoui, Rudy Deca
2012· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrow+open_scienceconsensus · none
3
citations

How this was built: Screen · Findings · About