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
Information and Computation
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.

93 results · 1 filter active ·
Results by year
20012025
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.
93 works in the cohort · of 4,299,418page 1 of 2

Labels cover 0 of 93 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 93 of 93 works in this cohort. Predictions are machine_predicted_unvalidated teacher distillation outputs. Candidate is the union; consensus is the intersection.

afffundno abstractunlabeled
A mathematical theory of resources
Bob Coecke, T. A. Fritz, Robert W. Spekkens
2016· article· en· Information and Computation· Physics and Astronomy
distilled prediction:candidate · noneconsensus · none
313
citations
affno abstractunlabeled
Distinguishing string selection problems
J. Kevin Lanctot, Ming Li, Bin Ma, Shaojiu Wang, Louxin Zhang
2003· article· en· Information and Computation· Computer Science
distilled prediction:candidate · noneconsensus · none
236
citations
affno abstractunlabeled
Anonymity protocols as noisy channels
Konstantinos Chatzikokolakis, Catuscia Palamidessi, Prakash Panangaden
2007· article· en· Information and Computation· Computer Science
distilled prediction:candidate · noneconsensus · none
198
citations
affno abstractunlabeled
Follow automata
Lucian Ilie, Sheng Yü
2003· article· en· Information and Computation· Computer Science
distilled prediction:candidate · noneconsensus · none
122
citations
affno abstractunlabeled
Mutual visibility by luminous robots without collisions
Giuseppe Antonio Di Luna, Paola Flocchini, Sruti Gan Chaudhuri, Federico Poloni, Nicola Santoro, Giovanni Viglietta
2016· article· en· Information and Computation· Computer Science
distilled prediction:candidate · noneconsensus · none
95
citations
afffundno abstractunlabeled
Bisimulation and cocongruence for probabilistic systems
Vincent Danos, Josée Desharnais, François Laviolette, Prakash Panangaden
2006· article· en· Information and Computation· Computer Science
distilled prediction:candidate · noneconsensus · none
85
citations
affno abstractunlabeled
Tree exploration with advice
Pierre Fraigniaud, David Ilcinkas, Andrzej Pelc
2008· article· en· Information and Computation· Computer Science
distilled prediction:candidate · noneconsensus · none
63
citations
affno abstractunlabeled
The complexity of constraint satisfaction games and QCSP
Ferdinand Börner, А. А. Булатов, H. Chen, Peter Jeavons, Andrei Krokhin
2009· article· en· Information and Computation· Computer Science
distilled prediction:candidate · noneconsensus · none
62
citations
affno abstractunlabeled
Connected graph searching
Lali Barrière, Paola Flocchini, Fedor V. Fomin, Pierre Fraigniaud, Nicolas Nisse, Nicola Santoro +1 more
2012· article· en· Information and Computation· Computer Science
distilled prediction:candidate · noneconsensus · none
44
citations
afffundno abstractunlabeled
Synchronization
Helmut Jürgensen
2008· article· en· Information and Computation· Computer Science
distilled prediction:candidate · noneconsensus · none
23
citations
affno abstractunlabeled
Aperiodic propagation criteria for Boolean functions
Lars Eirik Danielsen, T. Aaron Gulliver, Matthew G. Parker
2006· article· en· Information and Computation· Computer Science
distilled prediction:candidate · noneconsensus · none
21
citations
affno abstractunlabeled
Range majority in constant time and linear space
Stéphane Durocher, Meng He, J. Ian Munro, Patrick K. Nicholson, Matthew Skala
2012· article· en· Information and Computation· Computer Science
distilled prediction:candidate · noneconsensus · none
21
citations
affno abstractunlabeled
Incremental recomputation in local languages
Guozhu Dong, Leonid Libkin, Limsoon Wong
2003· article· en· Information and Computation· Computer Science
distilled prediction:candidate · noneconsensus · none
21
citations
affno abstractunlabeled
Decision problems for convex languages
Janusz Brzozowski, Jeffrey Shallit, Zhi Xu
2010· article· en· Information and Computation· Computer Science
distilled prediction:candidate · noneconsensus · none
20
citations
affno abstractunlabeled
The query complexity of order-finding
Richard Cleve
2004· article· en· Information and Computation· Computer Science
distilled prediction:candidate · noneconsensus · none
20
citations
afffundno abstractunlabeled
Topology recognition with advice
Emanuele G. Fusco, Andrzej Pelc, Rossella Petreschi
2016· article· en· Information and Computation· Computer Science
distilled prediction:candidate · noneconsensus · none
20
citations
affno abstractunlabeled
Subword conditions and subword histories
Arto Salomaa, Sheng Yü
2006· article· en· Information and Computation· Computer Science
distilled prediction:candidate · noneconsensus · none
18
citations
afffundno abstractunlabeled
Mind change efficient learning
Wei Luo, Oliver Schulte
2006· article· en· Information and Computation· Computer Science
distilled prediction:candidate · noneconsensus · none
15
citations
fundno affno abstractunlabeled
Modeling concurrency with interval traces
Ryszard Janicki, Xiang Yin
2017· article· en· Information and Computation· Computer Science
distilled prediction:candidate · noneconsensus · none
14
citations
affno abstractunlabeled
Minimality in template-guided recombination
Michael Domaratzki
2009· article· en· Information and Computation· Biochemistry, Genetics and Molecular Biology
distilled prediction:candidate · noneconsensus · none
10
citations
affno abstractunlabeled
Some natural conditions on incremental learning
Sanjay Jain, Steffen Lange, Sandra Zilles
2007· article· en· Information and Computation· Computer Science
distilled prediction:candidate · noneconsensus · none
9
citations
afffundno abstractunlabeled
Further remarks on DNA overlap assembly
Srujan Kumar Enaganti, Óscar H. Ibarra, Lila Kari, Steffen Kopecki
2017· article· en· Information and Computation· Biochemistry, Genetics and Molecular Biology
distilled prediction:candidate · noneconsensus · none
9
citations
affno abstractunlabeled
On the list update problem with advice
Joan Boyar, Shahin Kamali, Kim S. Larsen, Alejandro López-Ortíz
2016· article· en· Information and Computation· Computer Science
distilled prediction:candidate · noneconsensus · none
8
citations
affno abstractunlabeled
Automatic learning of subclasses of pattern languages
John Case, Sanjay Jain, Trong Dao Le, Yuh Shin Ong, Pavel Semukhin, Frank Stephan
2012· article· en· Information and Computation· Computer Science
distilled prediction:candidate · noneconsensus · none
6
citations
affno abstractunlabeled
Space proof complexity for random 3-CNFs
Patrick Bennett, Ilario Bonacina, Nicola Galesi, Tony Huynh, Mike Molloy, Paul Wollan
2017· preprint· en· Information and Computation· Computer Science
distilled prediction:candidate · scholarly_communicationconsensus · none
6
citations
next →

How this was built: Screen · Findings · About