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
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 9 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.

afffundno abstractunlabeled
Time constrained graph searching
Brian Alspach, Danny Dyer, Denis Hanson, Boting Yang
2008· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · stsconsensus · none
8
citations
fundno affno abstractunlabeled
The Maker-Breaker Largest Connected Subgraph game
Julien Bensmail, Foivos Fioravantes, Fionn Mc Inerney, Nicolas Nisse, Nacim Oijid
2022· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · sts+open_scienceconsensus · sts
8
citations
affno abstractunlabeled
Games to induce specified equilibria
Antoniy Ganchev, Lata Narayanan, Sunil Shende
2008· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
8
citations
affno abstractunlabeled
Learning without coding
Sanjay Jain, Samuel E. Moelius, Sandra Zilles
2012· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
8
citations
affno abstractunlabeled
<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" display="inline" overflow="scroll"><mml:mi>L</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mn>2</mml:mn><mml:mo>,</mml:mo><mml:mn>1</mml:mn><mml:mo>)</mml:mo></mml:mrow></mml:math>-Labelings on the composition of <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si2.gif" display="inline" overflow="scroll"><mml:mi>n</mml:mi></mml:math> graphs
Zhendong Shao, Roberto Solis-Oba
2010· article· lv· Theoretical Computer Science· Computer Science
distilled prediction:candidate · metaepi_narrow+sts+scholarly_communication+open_science+research_integrity+insufficient_payloadconsensus · metaepi_narrow+sts+research_integrity+insufficient_payload
8
citations
afffundno abstractunlabeled
Constructing an indeterminate string from its associated graph
Joel Helling, Patrick J. Ryan, W.F. Smyth, Michael Soltys
2017· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · sts+scholarly_communication+open_scienceconsensus · none
8
citations
affno abstractunlabeled
Words avoiding repetitions in arithmetic progressions
Jui-Yi Kao, Narad Rampersad, Jeffrey Shallit, Manuel Silva
2007· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
8
citations
affno abstractunlabeled
Algorithmic decomposition of shuffle on words
Franziska Biegler, Mark Daley, Ian McQuillan
2012· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
8
citations
affno abstractunlabeled
Approximation algorithms for orienting mixed graphs
Michael Elberfeld, Danny Segev, Colin R. Davidson, Dana Silverbush, Roded Sharan
2012· article· en· Theoretical Computer Science· Biochemistry, Genetics and Molecular Biology
distilled prediction:candidate · noneconsensus · none
8
citations
afffundno abstractunlabeled
Fast rendezvous with advice
Avery Miller, Andrzej Pelc
2015· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
8
citations
affno abstractunlabeled
The Thue–Morse word contains circular <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:mn>5</mml:mn><mml:mo>/</mml:mo><mml:msup><mml:mrow><mml:mn>2</mml:mn></mml:mrow><mml:mrow><mml:mo>+</mml:mo></mml:mrow></mml:msup></mml:math> power free words of every length
Ali Aberkane, James D. Currie
2005· article· lv· Theoretical Computer Science· Computer Science
distilled prediction:candidate · metaepi_narrow+sts+scholarly_communication+open_science+research_integrity+insufficient_payloadconsensus · metaepi_narrow+sts+open_science+research_integrity+insufficient_payload
8
citations
affno abstractunlabeled
Conservative and aggressive rough SVR modeling
Pawan Lingras, Cory J. Butz
2011· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
8
citations
affno abstractunlabeled
An edge deletion model for complex networks
Paweł Prałat, Changping Wang
2011· article· en· Theoretical Computer Science· Physics and Astronomy
distilled prediction:candidate · noneconsensus · none
7
citations
afffundno abstractunlabeled
Approximating the maximum multiple RNA interaction problem
Weitian Tong, Randy Goebel, Tian Liu, Guohui Lin
2014· article· en· Theoretical Computer Science· Biochemistry, Genetics and Molecular Biology
distilled prediction:candidate · noneconsensus · none
7
citations
afffundno abstractunlabeled
Growth rate of binary words avoiding xxx
James D. Currie, Narad Rampersad
2015· article· en· Theoretical Computer Science· Biochemistry, Genetics and Molecular Biology
distilled prediction:candidate · noneconsensus · none
7
citations
affno abstractunlabeled
Evolving schemas for streaming XML
Maryam Shoaran, Alex Thomo
2011· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
7
citations
afffundno abstractunlabeled
Kochen-Specker sets and Hadamard matrices
Petr Lisoněk
2019· article· en· Theoretical Computer Science· Physics and Astronomy
distilled prediction:candidate · noneconsensus · none
7
citations
affno abstractunlabeled
Improved analysis of the online set cover problem with advice
Stefan Dobrev, Jeff Edmonds, Dennis Komm, Rastislav Kráľovič, Richard Královič, Sacha Krug +1 more
2017· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · sts+open_scienceconsensus · none
7
citations

How this was built: Screen · Findings · About