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
Author
Year range
Sort
Language
Type
Field
Venue
Journal of Combinatorics
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.

21 results · 1 filter active ·
Results by year
20102024
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.
21 works in the cohort · of 4,299,418page 1 of 1

Labels cover 0 of 21 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 21 of 21 works in this cohort. Predictions are machine_predicted_unvalidated. The Gemma side is a direct model label for every work (title-only); the Codex side is a distilled, calibrated classifier. Candidate is the union; consensus is the intersection.

afffundunlabeled
Cops and Robbers playing on edges
Andrzej Dudek, Przemysław Gordinowicz, Paweł Prałat
2014· article· en· Journal of Combinatorics· Mathematics
machine prediction:candidate · noneconsensus · none
13
citations
affunlabeled
Independence posets
Hugh Thomas, Nathan Williams
2019· article· en· Journal of Combinatorics· Computer Science
machine prediction:candidate · noneconsensus · none
4
citations
affunlabeled
Zero-forcing in random regular graphs
Deepak Bal, Patrick Bennett, Sean English, Calum MacRury, Paweł Prałat
2021· article· en· Journal of Combinatorics· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
fundno affunlabeled
Complements of nearly perfect graphs
2013· article· en· Journal of Combinatorics· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
affunlabeled
Pursuit-evasion games on Latin square graphs
Shreya Ahirwar, Anthony Bonato, Leanna Gittins, Alice Huang, Trent G. Marbach, Tomer Zaidman
2023· article· en· Journal of Combinatorics· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
afffundunlabeled
A Sidon-type condition on set systems
Peter J. Dukes, Jane Wodlinger
2013· preprint· en· Journal of Combinatorics· Mathematics
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Toggling, rowmotion, and homomesy on interval-closed sets
Jennifer Elder, Nadia Lafrenière, Erin McNicholas, Jessica Striker, Amanda Welch
2024· article· en· Journal of Combinatorics· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations

How this was built: Screen · Findings · About