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
Journal of Computer and System Sciences
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.

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

Labels cover 1 of 109 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 109 of 109 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
Finding Similar Regions in Many Sequences
Ming Li, Bin Ma, Lusheng Wang
2002· article· en· Journal of Computer and System Sciences· Computer Science
machine prediction:candidate · noneconsensus · none
139
citations
affno abstractunlabeled
One-dimensional quantum walks with absorbing boundaries
Eric Bach, S. N. Coppersmith, Marcel Paz Goldschen, Robert Joynt, John Watrous
2004· article· en· Journal of Computer and System Sciences· Computer Science
machine prediction:candidate · noneconsensus · none
135
citations
affno abstractunlabeled
Reversible Space Equals Deterministic Space
Klaus-Jörn Lange, Pierre McKenzie, Alain Tapp
2000· article· en· Journal of Computer and System Sciences· Computer Science
machine prediction:candidate · noneconsensus · none
115
citations
affno abstractunlabeled
Solving large FPT problems on coarse-grained parallel machines
James J. Cheetham, Frank Dehne, Andrew Rau‐Chaplin, Ulrike Stege, Peter J. Taillon
2003· article· en· Journal of Computer and System Sciences· Computer Science
machine prediction:candidate · noneconsensus · none
114
citations
affno abstractunlabeled
Foundations of Semantic Web databases
Claudio Gutiérrez, Carlos Hurtado, Alberto O. Mendelzon, Jorge Eduardo Pérez Pérez
2010· article· en· Journal of Computer and System Sciences· Computer Science
machine prediction:candidate · noneconsensus · none
102
citations
affno abstractunlabeled
Subword histories and Parikh matrices
Alexandru Mateescu, Arto Salomaa, Sheng Yü
2003· article· en· Journal of Computer and System Sciences· Computer Science
machine prediction:candidate · noneconsensus · none
85
citations
afffundno abstractunlabeled
Maximal repetitions in strings
Maxime Crochemore, Lucian Ilie
2007· article· en· Journal of Computer and System Sciences· Computer Science
machine prediction:candidate · noneconsensus · none
76
citations
affno abstractunlabeled
Vector seeds: An extension to spaced seeds
Broňa Brejová, Daniel G. Brown, Tomáš Vinař
2005· article· en· Journal of Computer and System Sciences· Biochemistry, Genetics and Molecular Biology
machine prediction:candidate · noneconsensus · none
65
citations
affno abstractunlabeled
A refined search tree technique for Dominating Set on planar graphs
Jochen Alber, Hongbing Fan, Michael R. Fellows, Henning Fernau, Rolf Niedermeier, Frances Rosamond +1 more
2004· article· en· Journal of Computer and System Sciences· Computer Science
machine prediction:candidate · noneconsensus · none
62
citations
affno abstractunlabeled
Completeness results for graph isomorphism
Birgit Jenner, Johannes Köbler, Pierre McKenzie, Jacobo Torán
2003· article· en· Journal of Computer and System Sciences· Computer Science
machine prediction:candidate · noneconsensus · none
61
citations
affno abstractunlabeled
Communication algorithms with advice
Pierre Fraigniaud, David Ilcinkas, Andrzej Pelc
2009· article· en· Journal of Computer and System Sciences· Computer Science
machine prediction:candidate · noneconsensus · none
56
citations
afffundno abstractunlabeled
The complexity of weighted and unweighted #CSP
Andreĭ A. Bulatov, Martin Dyer, Leslie Ann Goldberg, Markus Jalsenius, Mark Jerrum, David Richerby
2011· article· en· Journal of Computer and System Sciences· Computer Science
machine prediction:candidate · noneconsensus · none
53
citations
affno abstractunlabeled
Monotone simulations of non-monotone proofs
Albert Atserias, Nicola Galesi, Pavel Pudlák
2002· article· en· Journal of Computer and System Sciences· Computer Science
machine prediction:candidate · noneconsensus · none
53
citations
affno abstractunlabeled
The complexity of properly learning simple concept classes
Misha Alekhnovich, Mark Braverman, Vitaly Feldman, Adam R. Klivans, Toniann Pitassi
2007· article· en· Journal of Computer and System Sciences· Computer Science
machine prediction:candidate · noneconsensus · none
45
citations
fundno affno abstractunlabeled
The k-Feature Set problem is W[2]-complete
Carlos Cotta, Pablo Moscato
2003· article· en· Journal of Computer and System Sciences· Biochemistry, Genetics and Molecular Biology
machine prediction:candidate · noneconsensus · none
43
citations
afffundno abstractunlabeled
On the complexity of the spaced seeds
Bin Ma, Ming Li
2007· article· en· Journal of Computer and System Sciences· Biochemistry, Genetics and Molecular Biology
machine prediction:candidate · noneconsensus · none
35
citations
affno abstractunlabeled
A distributed multi-agent meeting scheduler
Elhadi Shakshuki, Hsiang-Hwa Koo, Darcy Benoit, Daniel Silver
2007· article· en· Journal of Computer and System Sciences· Computer Science
machine prediction:candidate · noneconsensus · none
35
citations
affno abstractunlabeled
The web from a complex adaptive systems perspective
Maya Rupert, Amjad Rattrout, Salima Hassas
2007· article· en· Journal of Computer and System Sciences· Physics and Astronomy
machine prediction:candidate · noneconsensus · none
35
citations
affno abstractunlabeled
Kernels in planar digraphs
Gregory Gutin, Ton Kloks, Chuan-Min Lee, Anders Yeo
2005· article· en· Journal of Computer and System Sciences· Computer Science
machine prediction:candidate · noneconsensus · none
33
citations
affno abstractunlabeled
Unshuffling a square is NP-hard
Sam Buss, Michael Soltys
2013· article· en· Journal of Computer and System Sciences· Computer Science
machine prediction:candidate · noneconsensus · none
32
citations
affno abstractunlabeled
Enumerating homomorphisms
Andreǐ A. Bulatov, Víctor Dalmau, Martin Grohe, Dániel Marx
2011· article· en· Journal of Computer and System Sciences· Computer Science
machine prediction:candidate · noneconsensus · none
30
citations

How this was built: Screen · Findings · About