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
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 3 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
Rendezvous with constant memory
2016· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · stsconsensus · none
51
citations
affno abstractunlabeled
Quotient complexity of ideal languages
2012· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · stsconsensus · none
51
citations
afffundno abstractunlabeled
Cops and Robbers from a distance
2010· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · stsconsensus · none
50
citations
affno abstractunlabeled
Learning recursive functions: A survey
2008· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · stsconsensus · none
50
citations
afffundno abstractunlabeled
State complexity of power
2009· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · stsconsensus · none
49
citations
affno abstractunlabeled
Deletion along trajectories
2004· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
47
citations
affno abstractunlabeled
Cleaning a network with brushes
2008· article· en· Theoretical Computer Science· Physics and Astronomy
distilled prediction:candidate · noneconsensus · none
46
citations
afffundno abstractunlabeled
On a special class of primitive words
2009· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
46
citations
affno abstractunlabeled
Succinct encoding of arbitrary graphs
2013· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
43
citations
affno abstractunlabeled
Near-optimal PAC bounds for discounted MDPs
2014· article· en· Theoretical Computer Science· Decision Sciences
distilled prediction:candidate · sts+scholarly_communicationconsensus · none
43
citations
affno abstractunlabeled
<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:msup><mml:mrow><mml:mtext>CTL</mml:mtext></mml:mrow><mml:mrow><mml:mo>*</mml:mo></mml:mrow></mml:msup></mml:math> model checking for time Petri nets
2005· article· lv· Theoretical Computer Science· Computer Science
distilled prediction:candidate · metaepi_narrow+sts+scholarly_communication+open_science+research_integrity+insufficient_payloadconsensus · sts+insufficient_payload
41
citations
afffundno abstractunlabeled
Gathering in dynamic rings
2018· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
41
citations
affno abstractunlabeled
On the power of non-local boxes
2005· article· en· Theoretical Computer Science· Physics and Astronomy
distilled prediction:candidate · noneconsensus · none
41
citations
affno abstractunlabeled
Fast construction of wavelet trees
2015· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
38
citations
affno abstractunlabeled
An algorithmic view of gene teams
2004· article· en· Theoretical Computer Science· Biochemistry, Genetics and Molecular Biology
distilled prediction:candidate · noneconsensus · none
36
citations
afffundno abstractunlabeled
Repetitions in Sturmian strings
2000· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
36
citations
afffundno abstractunlabeled
The “runs” conjecture
2010· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · sts+scholarly_communicationconsensus · sts
36
citations
fundno affno abstractunlabeled
Syntactic control of concurrency
2005· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
35
citations
afffundno abstractunlabeled
Finite state complexity
2011· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · stsconsensus · none
35
citations
afffundno abstractunlabeled
On properties of bond-free DNA languages
2005· article· en· Theoretical Computer Science· Biochemistry, Genetics and Molecular Biology
distilled prediction:candidate · noneconsensus · none
35
citations
← previousnext →

How this was built: Screen · Findings · About