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
Topic
Advanced Graph Theory Research
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.

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

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

venueno affunlabeled
Dimensions for Cographs.
Terry A. McKee
2000· article· en· Ars Combinatoria· Computer Science
distilled prediction:candidate · noneconsensus · none
2
citations
affno abstractunlabeled
The weighted k-center problem in trees for fixed k
Binay Bhattacharya, Sandip Das, Subhadeep Ranjan Dev
2022· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · sts+open_scienceconsensus · none
2
citations
affno abstractunlabeled
Combinatorial Analysis
Albert W. Marshall, Ingram Olkin, Barry C. Arnold
2010· book-chapter· en· Springer series in statistics· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
2
citations
venueno affunlabeled
Vertex-Disjoint K1, t's in Graphs.
Shinya Fujita
2002· article· en· Ars Combinatoria· Computer Science
distilled prediction:candidate · noneconsensus · none
2
citations
afffundno abstractunlabeled
Serial exchanges in matroids
Sean McGuinness
2021· article· en· Discrete Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
2
citations
afffundno abstractunlabeled
Hitting all maximum stable sets in P5-free graphs
Sepehr Hajebi, Yanjia Li, Sophie Spirkl
2023· article· en· Journal of Combinatorial Theory Series B· Computer Science
distilled prediction:candidate · noneconsensus · none
2
citations
affno abstractunlabeled
Colouring bottomless rectangles and arborescences
Jean Cardinal, Kolja Knauer, Piotr Micek, Dömötör Pálvölgyi, Torsten Ueckerdt, Narmada Varadarajan
2023· article· en· Computational Geometry· Computer Science
distilled prediction:candidate · noneconsensus · none
2
citations
afffundunlabeled
The Excluded Tree Minor Theorem Revisited
Vida Dujmović, Robert Hickingbotham, Gwenaël Joret, Piotr Micek, Pat Morin, David R. Wood
2023· article· en· Combinatorics Probability Computing· Computer Science
distilled prediction:candidate · stsconsensus · none
2
citations
afffundunlabeled
Complexity of locally-injective homomorphisms to tournaments
Stefan Bard, Thomas Bellitto, Christopher Duffy, Gary MacGillivray, Feiran Yang
2018· article· en· DOAJ (DOAJ: Directory of Open Access Journals)· Computer Science
distilled prediction:candidate · metaepi_narrow+open_science+insufficient_payloadconsensus · none
2
citations
afffundunlabeled
Naji's characterization of circle graphs
Jim Geelen, Edward Lee
2019· article· en· Journal of Graph Theory· Computer Science
distilled prediction:candidate · noneconsensus · none
2
citations
venueno affno abstractunlabeled
Edge Complete (p, 2) Semigraphs.
K. Kayathri, S. Pethanachi Selvam
2007· article· en· Ars Combinatoria· Computer Science
distilled prediction:candidate · noneconsensus · none
2
citations
afffundno abstractunlabeled
Elimination schemes and lattices
Margaret-Ellen Messinger, Richard J. Nowakowski, Paweł Prałat
2014· article· en· Discrete Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
2
citations
venueno affunlabeled
Minimum Dominating Set for the Prism Graph Family
Jebisha Esther S, J. Veninstine Vivik
2023· article· en· Mathematics in Applied Sciences and Engineering· Computer Science
distilled prediction:candidate · noneconsensus · none
2
citations
afffundunlabeled
Chromatic Polynomials of 2-Edge-Coloured Graphs
Iain Beaton, Danielle Cox, Christopher Duffy, Nicole Zolkavich
2023· article· en· The Electronic Journal of Combinatorics· Computer Science
distilled prediction:candidate · noneconsensus · none
2
citations
fundno affunlabeled
Complexity of locally-injective homomorphisms to tournaments
Stefan Bard, Thomas Bellitto, Christopher Duffy, Gary MacGillivray, Feiran Yang
2018· preprint· en· Discrete Mathematics & Theoretical Computer Science· Computer Science
distilled prediction:candidate · metaepi_narrow+sts+open_scienceconsensus · open_science
2
citations
afffundunlabeled
The <i>k</i>-conversion number of regular graphs
Christina M. Mynhardt, Jane Wodlinger
2020· article· en· AKCE International Journal of Graphs and Combinatorics· Computer Science
distilled prediction:candidate · noneconsensus · none
2
citations
venueno affno abstractunlabeled
Molds of regular tournaments.
Vı́ctor Neumann-Lara, Mika Olsen
2013· article· en· Ars Combinatoria· Computer Science
distilled prediction:candidate · noneconsensus · none
2
citations
← previousnext →

How this was built: Screen · Findings · About