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
Discrete Mathematics & 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.

246 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.
246 works in the cohort · of 4,299,418page 2 of 5

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

afffundunlabeled
Separating layered treewidth and row treewidth
2022· article· en· Discrete Mathematics & Theoretical Computer Science· Computer Science
distilled prediction:candidate · metaepi_narrow+stsconsensus · sts
7
citations
afffundunlabeled
P_4-Colorings and P_4-Bipartite Graphs
2001· article· en· Discrete Mathematics & Theoretical Computer Science· Computer Science
distilled prediction:candidate · metaepi_narrow+stsconsensus · none
7
citations
afffundunlabeled
Adjoint functors and tree duality
2009· article· en· Discrete Mathematics & Theoretical Computer Science· Computer Science
distilled prediction:candidate · stsconsensus · none
7
citations
affunlabeled
QSym over Sym has a stable basis
2010· article· fr· Discrete Mathematics & Theoretical Computer Science· Mathematics
distilled prediction:candidate · metaepi_narrow+sts+scholarly_communication+insufficient_payloadconsensus · insufficient_payload
6
citations
afffundunlabeled
Most Complex Regular Ideal Languages
2016· article· en· Discrete Mathematics & Theoretical Computer Science· Computer Science
distilled prediction:candidate · stsconsensus · none
6
citations
afffundunlabeled
The repetition threshold for binary rich words
2020· article· en· Discrete Mathematics & Theoretical Computer Science· Computer Science
distilled prediction:candidate · scholarly_communicationconsensus · none
5
citations
affunlabeled
New Hopf Structures on Binary Trees
2009· article· en· Discrete Mathematics & Theoretical Computer Science· Mathematics
distilled prediction:candidate · metaepi_narrowconsensus · none
5
citations
fundno affunlabeled
The Height of List-tries and TST
2007· article· en· Discrete Mathematics & Theoretical Computer Science· Computer Science
distilled prediction:candidate · stsconsensus · none
4
citations
affunlabeled
Minor-monotone crossing number
2005· article· en· Discrete Mathematics & Theoretical Computer Science· Computer Science
distilled prediction:candidate · scholarly_communicationconsensus · none
4
citations
affunlabeled
Cycle transversals in bounded degree graphs
2011· article· en· Discrete Mathematics & Theoretical Computer Science· Computer Science
distilled prediction:candidate · metaepi_narrow+stsconsensus · none
4
citations
fundno affunlabeled
Packing Plane Perfect Matchings into a Point Set
2015· article· en· Discrete Mathematics & Theoretical Computer Science· Computer Science
distilled prediction:candidate · scholarly_communicationconsensus · none
4
citations
fundno affunlabeled
Centerpoint theorems for wedges
2009· article· en· Discrete Mathematics & Theoretical Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
4
citations
fundno affunlabeled
The Windy Postman Problem on Series-Parallel Graphs
2005· article· en· Discrete Mathematics & Theoretical Computer Science· Computer Science
distilled prediction:candidate · metaepi_narrow+sts+scholarly_communication+open_scienceconsensus · sts
4
citations
fundno affunlabeled
Token Swapping on Trees
2023· preprint· en· Discrete Mathematics & Theoretical Computer Science· Biochemistry, Genetics and Molecular Biology
distilled prediction:candidate · metaepi_narrowconsensus · none
4
citations
affunlabeled
The Incidence Hopf Algebra of Graphs
2011· preprint· fr· Discrete Mathematics & Theoretical Computer Science· Mathematics
distilled prediction:candidate · metaepi_narrow+sts+open_scienceconsensus · metaepi_narrow+sts+open_science
3
citations
affunlabeled
Skew quantum Murnaghan-Nakayama rule
2011· article· fr· Discrete Mathematics & Theoretical Computer Science· Mathematics
distilled prediction:candidate · metaepi_narrow+sts+insufficient_payloadconsensus · insufficient_payload
3
citations
affunlabeled
Asymptotic Density of Zimin Words
2016· article· en· Discrete Mathematics & Theoretical Computer Science· Computer Science
distilled prediction:candidate · stsconsensus · none
3
citations
fundno affunlabeled
Directed One-Trees
2005· article· en· Discrete Mathematics & Theoretical Computer Science· Computer Science
distilled prediction:candidate · metaepi_narrow+sts+open_scienceconsensus · none
3
citations
afffundunlabeled
Cubefree words with many squares
2010· article· en· Discrete Mathematics & Theoretical Computer Science· Computer Science
distilled prediction:candidate · metaepi_narrow+sts+scholarly_communicationconsensus · none
3
citations
fundno affunlabeled
On the Book Thickness of k-Trees
2011· article· en· Discrete Mathematics & Theoretical Computer Science· Computer Science
distilled prediction:candidate · sts+open_scienceconsensus · none
3
citations
← previousnext →

How this was built: Screen · Findings · About