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
Theoretical Computer Science
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.

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

Labels cover 0 of 797 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 797 of 797 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
Lemmings is PSPACE-complete
Giovanni Viglietta
2015· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
19
citations
affno abstractunlabeled
Succinct representation of dynamic trees
Arash Farzan, J. Ian Munro
2010· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
19
citations
affno abstractunlabeled
Reconstructing polygons from scanner data
Thérèse Biedl, Stéphane Durocher, Jack Snoeyink
2010· article· en· Theoretical Computer Science· Engineering
machine prediction:candidate · noneconsensus · none
18
citations
afffundno abstractunlabeled
Priority evacuation from a disk: The case of n = 1,2,3
Jurek Czyzowicz, Konstantinos Georgiou, Ryan Killick, Evangelos Kranakis, Danny Kriz̧anc, Lata Narayanan +2 more
2019· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
18
citations
affno abstractunlabeled
UNO is hard, even for a single player
Erik D. Demaine, Martin L. Demaine, Nicholas J. A. Harvey, Ryuhei Uehara, Takeaki Uno, Yushi Uno
2013· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
17
citations
affno abstractunlabeled
Approximation algorithms for NMR spectral peak assignment
Zhi‐Zhong Chen, Tao Jiang, Guohui Lin, Jianjun Wen, Dong Xu, Jinbo Xu +1 more
2003· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
17
citations
affno abstractunlabeled
On approximating string selection problems with outliers
Christina Boucher, Gad M. Landau, Avivit Levy, David Pritchard, Oren Weimann
2013· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
17
citations
affno abstractunlabeled
Quasiperiodic and Lyndon episturmian words
Amy Glen, Florence Levé, Gwénaël Richomme
2008· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
16
citations
affno abstractunlabeled
Decimations of languages and state complexity
Dalia Krieger, Avery Miller, Narad Rampersad, Bala Ravikumar, Jeffrey Shallit
2009· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
16
citations
afffundno abstractunlabeled
Transition complexity of language operations
Michael Domaratzki, Kai Salomaa
2007· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
16
citations
affno abstractunlabeled
A palindromization map for the free group
Christian Kassel, Christophe Reutenauer
2008· article· en· Theoretical Computer Science· Mathematics
machine prediction:candidate · noneconsensus · none
16
citations
afffundno abstractunlabeled
Constructing divisions into power groups
Karl Auinger, Benjamin Steinberg
2005· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
15
citations
afffundno abstractunlabeled
Long binary patterns are Abelian 2-avoidable
James D. Currie, Terry I. Visentin
2008· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
15
citations
affno abstractunlabeled
Finding houses and holes in graphs
Chı́nh T. Hoàng, R. Sritharan
2001· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
15
citations
← previousnext →

How this was built: Screen · Findings · About