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 28 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.

affno abstractunlabeled
Foreword
Dardo Goyeneche, Ilias Kotsireas, Padraig Ó Catháin
2018· article· en· Mathematics in Computer Science· Engineering
machine prediction:candidate · noneconsensus · none
0
citations
venueno affunlabeled
Nilpotent Covers of Dihedral Groups
Kimeu Arphaxad Ngwava, Nick Gill
2024· article· en· Ars Combinatoria· Engineering
machine prediction:candidate · noneconsensus · none
0
citations
afffundno abstractunlabeled
Cyclic polytopes, hyperplanes, and Gray codes
Tibor Bisztriczky, K�roly B�r�czky, David S. Gunderson
2003· article· en· Journal of Geometry· Engineering
machine prediction:candidate · noneconsensus · none
0
citations
afffundno abstractunlabeled
Enumeration of Max-Pooling Responses with Generalized Permutohedra
Laura Escobar, Patricio A. Gallardo, Javier González‐Anaya, José L. González, Guido Montúfar, Alejandro H. Morales
2025· article· en· Annals of Combinatorics· Engineering
machine prediction:candidate · noneconsensus · none
0
citations
afffundunlabeled
A New Relationship between Block Designs
Alexander Shramchenko, Vasilisa Shramchenko
2016· article· en· International Journal of Combinatorics· Engineering
machine prediction:candidate · noneconsensus · none
0
citations
fundvenueno affunlabeled
Cards, permutations, and sums
Bill Sands
2011· article· en· Contributions to Discrete Mathematics· Engineering
machine prediction:candidate · noneconsensus · none
0
citations
afffundno abstractunlabeled
Local Balance in Graph Decompositions
Flora C. Bowditch, Peter J. Dukes
2022· preprint· en· Graphs and Combinatorics· Engineering
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Cayley graphs of order 27p are hamiltonian
Ebrahim Ghaderpour, Dave Witte Morris
2011· preprint· en· arXiv (Cornell University)· Engineering
machine prediction:candidate · noneconsensus · none
0
citations
afffundunlabeled
On the existence of unparalleled even cycle systems
Peter Danziger, Eric Mendelsohn, Tommaso Traetta
2017· article· en· Institutional Research Information System (Università degli Studi di Brescia)· Engineering
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Perfectly Orderable P4 Composition
Ryan Hayward, William Lenhart
2001· article· en· Electronic Notes in Discrete Mathematics· Engineering
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Ordered 3-colorings
Arvind Gupta, Ján Maňuch, Ladislav Stacho
2005· article· en· Electronic Notes in Discrete Mathematics· Engineering
machine prediction:candidate · noneconsensus · none
0
citations
venueno affunlabeled
An Open Problem in Embedding
Dinesh G. Sarvate, Li Zhang
2024· article· en· Journal of Combinatorial Mathematics and Combinatorial Computing· Engineering
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
An Edge Ordering Problem of Regular Hypergraphs
Hongbing Fan, Robert Kalbfleisch
2006· book-chapter· en· Lecture notes in computer science· Engineering
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Tight incomplete block designs
Izabela Adamczak, Donald L. Kreher, Rolf S. Rees
2004· article· en· Discrete Mathematics· Engineering
machine prediction:candidate · noneconsensus · none
0
citations
aboutno affunlabeled
Preface
Ruy de Queiroz, Luiz Carlos Pereira, Edward Hermann Hæusler
2002· article· en· Electronic Notes in Theoretical Computer Science· Engineering
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Introduction
Megan Dewar, Brett Stevens
2012· book-chapter· en· CMS books in mathematics· Engineering
machine prediction:candidate · insufficient_payloadconsensus · insufficient_payload
0
citations
venueno affunlabeled
On bisectors in normed planes
Thomas Jahn, Margarita Spirova
2016· article· en· Contributions to Discrete Mathematics· Engineering
machine prediction:candidate · noneconsensus · none
0
citations
fundno affunlabeled
Strong log-convexity of genus sequences
Bojan Mohar
2024· preprint· en· arXiv (Cornell University)· Engineering
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Results in Configuration Ordering
Megan Dewar, Brett Stevens
2012· book-chapter· en· CMS books in mathematics· Engineering
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Optical CDMA and WDMA in the access network
Edward H. Sargent, A. Stok
2003· article· en· Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE· Engineering
machine prediction:candidate · noneconsensus · none
0
citations
← previousnext →

How this was built: Screen · Findings · About