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 13 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 teacher distillation outputs. Candidate is the union; consensus is the intersection.

fundno affno abstractunlabeled
Efficient operations on discrete paths
Alexandre Blondin Massé, Srečko Brlek, Hugo Tremblay
2015· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
2
citations
afffundno abstractunlabeled
Deterministic rendezvous in infinite trees
Subhash Bhagat, Andrzej Pelc
2023· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
2
citations
affno abstractunlabeled
Binary distinguishability operation
Matthew Kozma
2024· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · scholarly_communicationconsensus · none
2
citations
afffundno abstractunlabeled
Low space data structures for geometric range mode query
Stéphane Durocher, Hicham El-Zein, J. Ian Munro, Sharma V. Thankachan
2015· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · open_scienceconsensus · none
2
citations
afffundno abstractunlabeled
Type-two polynomial-time and restricted lookahead
Bruce M. Kapron, Florian Steinberg
2019· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · insufficient_payloadconsensus · none
2
citations
affno abstractunlabeled
Language theoretical properties of hairpin formations
Volker Diekert, Steffen Kopecki
2011· article· en· Theoretical Computer Science· Biochemistry, Genetics and Molecular Biology
distilled prediction:candidate · stsconsensus · none
2
citations
affno abstractunlabeled
Randomised broadcasting: Memory vs. randomness
Petra Berenbrink, Robert Elsässer⋆, Thomas Sauerwald
2013· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · metaepi_narrow+sts+scholarly_communication+insufficient_payloadconsensus · none
2
citations
affno abstractunlabeled
On the number of episturmian palindromes
Michelangelo Bucci, Aldo de Luca
2010· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · stsconsensus · none
2
citations
affno abstractunlabeled
Preface
Ilias Kotsireas, Bernard Mourrain, Victor Y. Pan, Lihong Zhi
2012· article· en· Theoretical Computer Science
distilled prediction:candidate · sts+insufficient_payloadconsensus · none
1
citations
affno abstractunlabeled
Cops and invisible robbers: The cost of drunkenness
Athanasios Kehagias, Dieter Mitsche, Paweł Prałat
2013· article· en· Theoretical Computer Science· Physics and Astronomy
distilled prediction:candidate · stsconsensus · none
1
citations
affno abstractunlabeled
Metrics for labelled Markov processes
Josée Desharnais
2004· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
1
citations
affno abstractunlabeled
An infinite hierarchy induced by depth synchronization
Franziska Biegler, Ian McQuillan, Kai Salomaa
2007· article· en· Theoretical Computer Science· Biochemistry, Genetics and Molecular Biology
distilled prediction:candidate · noneconsensus · none
1
citations
afffundno abstractunlabeled
On codes defined by bio-operations
Mark Daley, Michael Domaratzki
2006· article· en· Theoretical Computer Science· Biochemistry, Genetics and Molecular Biology
distilled prediction:candidate · noneconsensus · none
1
citations
affno abstractunlabeled
Algebraic properties of substitution on trajectories
Michael Domaratzki, Petr Sosı́k, Alfonso Rodríguez‐Patón
2006· article· en· Theoretical Computer Science· Biochemistry, Genetics and Molecular Biology
distilled prediction:candidate · noneconsensus · none
1
citations
affno abstractunlabeled
Scheduling maintenance jobs in networks
Fidaa Abed, Lin Chen, Yann Disser, Martin Groß, Nicole Megow, Julie Meißner +2 more
2018· preprint· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · metaepi_narrow+sts+scholarly_communication+open_scienceconsensus · open_science
1
citations
afffundno abstractunlabeled
On Sillke's bijection
Robert Cori, Christophe Reutenauer
2016· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
1
citations
afffundno abstractunlabeled
Order compression schemes
Malte Darnstädt, Thorsten Kiss, Hans Ulrich Simon, Sandra Zilles
2015· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
1
citations
affno abstractunlabeled
Exhaustive generation of gominoes
Jérôme Fortier, Alain Goupil, Jonathan Lortie, Jérôme Tremblay
2012· article· en· Theoretical Computer Science· Mathematics
distilled prediction:candidate · noneconsensus · none
1
citations
afffundno abstractunlabeled
State grammars with stores
Óscar H. Ibarra, Ian McQuillan
2019· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
1
citations
affno abstractunlabeled
Space-efficient algorithm for computing a centerpoint of a set of points in <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:msup><mml:mrow><mml:mi mathvariant="double-struck">R</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup></mml:math>
Binay Bhattacharya, Subhas C. Nandy, Sasanka Roy
2015· article· lv· Theoretical Computer Science· Computer Science
distilled prediction:candidate · metaepi_narrow+sts+scholarly_communication+insufficient_payloadconsensus · none
1
citations
afffundno abstractunlabeled
Unique decipherability in formal languages
Paul C. Bell, Daniel Reidenbach, Jeffrey Shallit
2019· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
1
citations
← previousnext →

How this was built: Screen · Findings · About