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
Acta Informatica
Topic
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.

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

Labels cover 0 of 29 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 29 of 29 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
Sticky-free and overhang-free DNA languages
Lila Kari, Stavros Konstantinidis, Elena Losseva, Geoff Wozniak
2003· article· en· Acta Informatica· Biochemistry, Genetics and Molecular Biology
machine prediction:candidate · noneconsensus · none
46
citations
affno abstractunlabeled
Even faster generalized LR parsing
John Aycock, Nigel Horspool, Jan Janoušek, Bořivoj Melichar
2001· article· en· Acta Informatica· Computer Science
machine prediction:candidate · noneconsensus · none
42
citations
affno abstractunlabeled
Solving #SAT using vertex covers
Naomi Nishimura, Prabhakar Ragde, Stefan Szeider
2007· article· en· Acta Informatica· Computer Science
machine prediction:candidate · noneconsensus · none
38
citations
affno abstractunlabeled
Analysis of range search for random k-d trees
Philippe Chanzy, Luc Devroye, Carlos Zamora-Cura
2001· article· en· Acta Informatica· Computer Science
machine prediction:candidate · noneconsensus · none
34
citations
afffundno abstractunlabeled
The syntactic monoid of hairpin-free languages
Lila Kari, Kalpana Mahalingam, G. Thierrin
2007· article· en· Acta Informatica· Biochemistry, Genetics and Molecular Biology
machine prediction:candidate · noneconsensus · none
16
citations
affno abstractunlabeled
A queue based mutual exclusion algorithm
Alex Aravind, Wim H. Hesselink
2008· article· en· Acta Informatica· Computer Science
machine prediction:candidate · noneconsensus · none
12
citations
affno abstractunlabeled
Weighted height of random trees
Nicolas Broutin, Luc Devroye, Erin McLeish
2008· article· en· Acta Informatica· Computer Science
machine prediction:candidate · noneconsensus · none
11
citations
affno abstractunlabeled
On Abelian 2-avoidable binary patterns
James D. Currie, Terry I. Visentin
2006· article· en· Acta Informatica· Computer Science
machine prediction:candidate · noneconsensus · none
7
citations
affno abstractunlabeled
Early action in an Earley parser
John Aycock, Angelo Borsotti
2009· article· en· Acta Informatica· Computer Science
machine prediction:candidate · noneconsensus · none
6
citations
affno abstractunlabeled
Tree-systems of morphisms
Jürgen Dassow, Gheorghe Pǎun, G. Thierrin, Sheng Yü
2001· article· en· Acta Informatica· Biochemistry, Genetics and Molecular Biology
machine prediction:candidate · noneconsensus · none
1
citations
afffundno abstractunlabeled
On the 3-tree core of plane graphs
Debajyoti Mondal, Md. Saidur Rahman
2025· article· en· Acta Informatica· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
afffundunlabeled
Novel tree-search method for synthesizing SMT strategies
Zhengyang Lu, Joel D. Day, Piyush Jha, Paul Sarnighausen-Cahn, Stefan Siemer, Florín Manea +1 more
2025· article· en· Acta Informatica· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations

How this was built: Screen · Findings · About