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
Topic
Limits and Structures in Graph Theory
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.

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

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

afffundunlabeled
Short rainbow cycles in graphs and matroids
2021· article· en· IRIS Research product catalog (Sapienza University of Rome)· Mathematics
distilled prediction:candidate · noneconsensus · none
14
citations
affno abstractunlabeled
Sums and products along sparse graphs
2011· article· en· Israel Journal of Mathematics· Mathematics
distilled prediction:candidate · noneconsensus · none
14
citations
affunlabeled
[no title]
2017· article· en· University of Birmingham Research Portal (University of Birmingham)· Mathematics
distilled prediction:candidate · metaepi_narrow+sts+open_scienceconsensus · sts
14
citations
afffundunlabeled
Cops and Robbers playing on edges
2014· article· en· Journal of Combinatorics· Mathematics
distilled prediction:candidate · noneconsensus · none
13
citations
venueno affunlabeled
Rainbow K-Connection in Dense Graphs
2015· article· en· Journal of Combinatorial Mathematics and Combinatorial Computing· Mathematics
distilled prediction:candidate · metaepi_narrowconsensus · none
12
citations
afffundno abstractunlabeled
Lines in hypergraphs
2013· article· en· COMBINATORICA· Mathematics
distilled prediction:candidate · noneconsensus · none
12
citations
affunlabeled
Regular subgraphs of random graphs
2006· article· en· Random Structures and Algorithms· Mathematics
distilled prediction:candidate · noneconsensus · none
12
citations
afffundunlabeled
An Erdős-Ko-Rado Theorem for Multisets
2011· article· en· The Electronic Journal of Combinatorics· Mathematics
distilled prediction:candidate · noneconsensus · none
12
citations
affno abstractunlabeled
The codegree threshold of<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:msubsup><mml:mrow><mml:mi>K</mml:mi></mml:mrow><mml:mrow><mml:mn>4</mml:mn></mml:mrow><mml:mrow><mml:mo>−</mml:mo></mml:mrow></mml:msubsup></mml:math>
2017· article· lv· Electronic Notes in Discrete Mathematics· Mathematics
distilled prediction:candidate · metaepi_narrow+sts+scholarly_communication+open_science+research_integrity+insufficient_payloadconsensus · metaepi_narrow+sts+research_integrity+insufficient_payload
11
citations
affno abstractunlabeled
Polychromatic cliques
2004· article· fr· Discrete Mathematics· Mathematics
distilled prediction:candidate · metaepi_narrow+insufficient_payloadconsensus · none
10
citations
affunlabeled
Colouring Random Regular Graphs
2006· article· en· Combinatorics Probability Computing· Mathematics
distilled prediction:candidate · metaepi_narrowconsensus · none
10
citations
affno abstractunlabeled
Roth-type theorems in finite groups
2013· article· en· European Journal of Combinatorics· Mathematics
distilled prediction:candidate · noneconsensus · none
10
citations
affunlabeled
Induced Trees in Triangle-Free Graphs
2008· article· en· The Electronic Journal of Combinatorics· Mathematics
distilled prediction:candidate · noneconsensus · none
10
citations
← previousnext →

How this was built: Screen · Findings · About