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
graph theory and CDMA systems
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.

1,464 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.
1,464 works in the cohort · of 4,299,418page 23 of 30

Labels cover 0 of 1,464 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 1,464 of 1,464 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
A Bound on the Size of Separating Hash Families.
Simon R. Blackburn⋆, Tuvi Etzion, Douglas R. Stinson, Gregory M. Zaverucha
2007· preprint· en· IACR Cryptology ePrint Archive· Engineering
machine prediction:candidate · noneconsensus · none
0
citations
venueno affno abstractunlabeled
Modular Multiplicative Graphs.
Walter O. Krawec
2016· article· en· Ars Combinatoria· Engineering
machine prediction:candidate · noneconsensus · none
0
citations
afffundunlabeled
The sepr-sets of sign patterns
Leslie Hogben, Jephian C.-H. Lin, D.D. Olesky, P. van den Driessche
2019· preprint· en· Linear and Multilinear Algebra· Engineering
machine prediction:candidate · noneconsensus · none
0
citations
venueno affunlabeled
G-designs without blocking sets, Note.
Salvatore Milici, Gaetano Quattrocchi, Źsolt Tuza
2014· article· en· Ars Combinatoria· Engineering
machine prediction:candidate · noneconsensus · none
0
citations
venueno affno abstractunlabeled
D-Graphs For Graphs With Cyclomatic Number 1.
Edward J. Farrell, Andrew Anthony Hunte
2016· article· en· Ars Combinatoria· Engineering
machine prediction:candidate · noneconsensus · none
0
citations
fundno affunlabeled
Wickets in 3-uniform Hypergraphs
József Solymosi
2023· preprint· en· arXiv (Cornell University)· Engineering
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Three-Coloring Three-Dimensional Uniform Hypergraphs.
Ahmad Biniaz, Prosenjit Bose, Jean Cardinal, Michael S. Payne
2019· article· en· Canadian Conference on Computational Geometry· Engineering
machine prediction:candidate · noneconsensus · none
0
citations
afffundno abstractunlabeled
Maximal nonassociativity via fields
Petr Lisoněk
2020· preprint· en· Designs Codes and Cryptography· Engineering
machine prediction:candidate · noneconsensus · none
0
citations
venueno affno abstractunlabeled
On Holey Schroder Designs of Type 2 n u 1 .
Hantao Zhang, Stanley Ziewacz
2016· article· en· Ars Combinatoria· Engineering
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Drawing the Horton Set in an Integer Grid of Minimun Size.
Luis Barba, Frank Duque, Ruy Fabila Monroy, Carlos Hidalgo-Toscano
2014· article· en· Canadian Conference on Computational Geometry· Engineering
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
The Karpelevi\v{c} Region Revisited
Stephen Kirkland, Thomas J. Laffey, Helena Šmigoc
2020· preprint· en· arXiv (Cornell University)· Engineering
machine prediction:candidate · noneconsensus · none
0
citations
venueno affunlabeled
Improvement to lotto design tables
Lutful Karim
2005· dissertation· en· Library and Archives Canada (Government of Canada)· Engineering
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
(7,3,1) and combinatorics
Ezra Brown, Richard H. Guy
2020· book-chapter· en· ˜The œCarus mathematical monographs· Engineering
machine prediction:candidate · noneconsensus · none
0
citations
venueno affno abstractunlabeled
Some results on 4-cycle packings
Hung‐Lin Fu
2009· article· en· Ars Combinatoria· Engineering
machine prediction:candidate · noneconsensus · none
0
citations
venueno affno abstractunlabeled
Bipartite graphs decomposable into closed trails
Sylwia Cichacz, Dalibor Fronček
2010· article· en· Journal of Combinatorial Mathematics and Combinatorial Computing· Engineering
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
On 2-cycles of graphs
Sergey Norin, Robin Thomas, Hein van der Holst
2023· article· en· Journal of Combinatorial Theory Series B· Engineering
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
On the chromatic number of Latin square graphs
Nazli Besharati, Luis Goddyn, E. S. Mahmoodian, M. Mortezaeefar
2015· preprint· en· arXiv (Cornell University)· Engineering
machine prediction:candidate · noneconsensus · none
0
citations
fundno affunlabeled
Block colourings of star systems
R. A. Bailey, Iren Darijani
2022· preprint· en· arXiv (Cornell University)· Engineering
machine prediction:candidate · noneconsensus · none
0
citations
← previousnext →

How this was built: Screen · Findings · About