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

affno abstractunlabeled
Improving the <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:msub><mml:mrow><mml:mi>H</mml:mi></mml:mrow><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msub></mml:math>-bound on the price of stability in undirected Shapley network design games
2014· article· lv· Theoretical Computer Science· Decision Sciences
distilled prediction:candidate · metaepi_narrow+sts+scholarly_communication+insufficient_payloadconsensus · sts+insufficient_payload
14
citations
afffundno abstractunlabeled
Whom to befriend to influence people
2018· article· en· Theoretical Computer Science· Physics and Astronomy
distilled prediction:candidate · noneconsensus · none
13
citations
afffundno abstractunlabeled
The Magnus–Derek game
2007· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · stsconsensus · none
13
citations
afffundno abstractunlabeled
Partitioned probe comparability graphs
2008· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · stsconsensus · none
13
citations
affno abstractunlabeled
Swapping colored tokens on graphs
2018· article· en· Theoretical Computer Science· Biochemistry, Genetics and Molecular Biology
distilled prediction:candidate · stsconsensus · none
13
citations
affno abstractunlabeled
Uniqueness logic
2005· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
13
citations
afffundno 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 modular product of two graphs
2013· 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
13
citations
affno abstractunlabeled
Simplifying the weft hierarchy
2005· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · sts+open_scienceconsensus · none
12
citations
affno abstractunlabeled
Constant-factor approximations of branch-decomposition and largest grid minor of planar graphs in<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si2.gif" display="inline" overflow="scroll"><mml:mi>O</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msup><mml:mrow><mml:mi>n</mml:mi></mml:mrow><mml:mrow><mml:mn>1</mml:mn><mml:mo>+</mml:mo><mml:mi>ϵ</mml:mi></mml:mrow></mml:msup><mml:mo>)</mml:mo></mml:mrow></mml:math>time
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
12
citations
12
citations
affno abstractunlabeled
Semantic distance between specifications
2000· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · insufficient_payloadconsensus · none
12
citations
affno abstractunlabeled
Error-detecting properties of languages
2002· article· en· Theoretical Computer Science· Biochemistry, Genetics and Molecular Biology
distilled prediction:candidate · noneconsensus · none
12
citations
affno abstractunlabeled
On stabilizers of infinite words
2008· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · stsconsensus · none
12
citations
affno abstractunlabeled
A general framework for searching on a line
2017· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · sts+scholarly_communicationconsensus · none
11
citations

How this was built: Screen · Findings · About