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
Combinatorics Probability Computing
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.

106 results · 1 filter active ·
Categories
Machine labels · sparse coverage
Evidence
An unlabeled work is unknown, not a negative. Label coverage is reported on every query.
106 works in the cohort · of 4,299,418page 2 of 3

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

affunlabeled
Reconstructing Odd Necklaces
2007· article· en· Combinatorics Probability Computing· Computer Science
distilled prediction:candidate · noneconsensus · none
8
citations
affunlabeled
‘Forcing a sparse minor’ — CORRIGENDUM
2015· erratum· en· Combinatorics Probability Computing· Economics, Econometrics and Finance
distilled prediction:candidate · metaepi_narrow+insufficient_payloadconsensus · insufficient_payload
4
citations
affunlabeled
Frank Ramsey
2003· article· en· Combinatorics Probability Computing· Mathematics
distilled prediction:candidate · noneconsensus · none
3
citations
affunlabeled
Measurable Events Indexed by Trees
2012· article· en· Combinatorics Probability Computing· Mathematics
distilled prediction:candidate · noneconsensus · none
3
citations
affunlabeled
Twin-width of sparse random graphs
2024· article· en· Combinatorics Probability Computing· Mathematics
distilled prediction:candidate · noneconsensus · none
2
citations
affunlabeled
Pegging Graphs Yields a Small Diameter
2010· article· en· Combinatorics Probability Computing· Mathematics
distilled prediction:candidate · metaepi_narrowconsensus · none
1
citations
affunlabeled
A BK inequality for random matchings
2022· article· en· Combinatorics Probability Computing· Mathematics
distilled prediction:candidate · noneconsensus · none
0
citations
affunlabeled
The (7, 4)-Conjecture in Finite Groups
2015· preprint· en· Combinatorics Probability Computing· Engineering
distilled prediction:candidate · metaepi_narrowconsensus · none
0
citations
affunlabeled
CPC volume 24 issue 1 Cover and Back matter
2015· paratext· en· Combinatorics Probability Computing· Economics, Econometrics and Finance
distilled prediction:candidate · metaepi_narrow+insufficient_payloadconsensus · insufficient_payload
0
citations
affunlabeled
Common pairs of graphs
2025· article· en· Combinatorics Probability Computing· Mathematics
distilled prediction:candidate · noneconsensus · none
0
citations

How this was built: Screen · Findings · About