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

aboutno affunlabeled
MIRRI0127676
2022· dataset· en· Entrepôt pour orphelin· Computer Science
distilled prediction:candidate · metaepi_narrow+insufficient_payloadconsensus · insufficient_payload
0
citations
affunlabeled
Timed alternating finite automata
Abdelaziz Fellah, Carma Harding
2004· article· en· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
affunlabeled
On Fixed-Path Rationing Methods
Lars Ehlers
2001· preprint· en· RePEc: Research Papers in Economics· Computer Science
distilled prediction:candidate · metaepi_narrow+research_integrityconsensus · none
0
citations
venueno affno abstractunlabeled
The Mean Integrity of Paths and Cycles.
Claus Ernst, Beth Rountree
2010· article· en· Ars Combinatoria· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
MRF Models of Logic Gates
Svetlana Yanushkevich, G. Tangim, A.H. Tran, T. Mohamed, V.P. Shmerko, S. Kasai
2013· book-chapter· en· Synthesis lectures on digital circuits and systems· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
0
citations
affunlabeled
Revisiting SATZilla Features in 2024
2024· article· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Computer Science
distilled prediction:candidate · metaepi_narrow+scholarly_communicationconsensus · none
0
citations
afffundunlabeled
Towards Practical First-Order Model Counting
2025· article· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
0
citations
affunlabeled
Dynamic Boolean Formula Evaluation.
Rathish Das, Andrea Lincoln, Jayson Lynch, J. Ian Munro
2021· article· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
0
citations
venueno affno abstractunlabeled
10.1016/s1558-0164(08)70419-x
2000· article· en· Time to knit· Computer Science
distilled prediction:candidate · insufficient_payloadconsensus · insufficient_payload
0
citations
affno abstractunlabeled
SPCU-Algebra
2009· book-chapter· en· Encyclopedia of Database Systems· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
0
citations
affunlabeled
Composing snippets
Igor Benko, Jo Ebergen
2000· article· en· International Symposium on Advanced Research in Asynchronous Circuits and Systems· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
aboutno affno abstractunlabeled
Canadian Pacific Railway lines timetable
2018· article· en· Open Collections· Computer Science
distilled prediction:candidate · sts+scholarly_communicationconsensus · none
0
citations
afffundunlabeled
DRAT Proofs of Unsatisfiability for SAT Modulo Monotonic Theories
Nick Feng, Alan J. Hu, Sam Bayless, Syed Muhammad Javed Iqbal, Patrick Trentin, Lee Pike +1 more
2024· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
0
citations
afffundno abstractunlabeled
Compressing branch-and-bound trees
Gonzalo Muñoz, Joseph Paat, Álinson Santos Xavier
2024· article· en· Mathematical Programming· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
← previous

How this was built: Screen · Findings · About