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
Author
Year range
→
Sort
Language
Type
Field
Venue
Combinatorial Theory
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
20212025
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.

affunlabeled
An aperiodic monotile
David J. Smith, Joseph Samuel Myers, Craig S. Kaplan, Chaim Goodman-Strauss
2024· article· en· Combinatorial Theory· Engineering
machine prediction:candidate · noneconsensus · none
36
citations
fundno affunlabeled
Promotion permutations for tableaux
Christian Gaetz, Oliver Pechenik, Stephan Pfannerer, Jessica Striker, Joshua P. Swanson
2024· article· en· Combinatorial Theory· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations
fundno affunlabeled
Homomesy via toggleability statistics
Colin Defant, Sam Hopkins, Svetlana Poznanović, James Propp
2023· article· en· Combinatorial Theory· Mathematics
machine prediction:candidate · noneconsensus · none
3
citations
afffundunlabeled
Inducibility and universality for trees
Timothy F. N. Chan, Daniel Král͏̌, Bojan Mohar, David R. Wood
2022· article· en· Combinatorial Theory· Mathematics
machine prediction:candidate · noneconsensus · none
2
citations
fundno affunlabeled
Shelling the \(m=1\) amplituhedron
Steven N. Karp, John Machacek
2023· article· en· Combinatorial Theory· Mathematics
machine prediction:candidate · noneconsensus · none
2
citations
afffundunlabeled
The primitive Eulerian polynomial
Jose Bastidas, Christophe Hohlweg, Franco Saliola
2024· article· en· Combinatorial Theory· Mathematics
machine prediction:candidate · noneconsensus · none
1
citations
fundno affunlabeled
On the number of squares in a finite word
Srečko Brlek, Shuo Li
2025· article· en· Combinatorial Theory· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
afffundunlabeled
Sets of mutually orthogoval projective and affine planes
Charles J. Colbourn, Colin Ingalls, Jonathan Jedwab, Mark Saaltink, K. Smith, Brett Stevens
2024· article· en· Combinatorial Theory· Engineering
machine prediction:candidate · noneconsensus · none
0
citations

How this was built: Screen · Findings · About