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 20 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 teacher distillation outputs. Candidate is the union; consensus is the intersection.

affno abstractunlabeled
On pseudomatroid property of matrices
R. Sridhar, S.N. Kabadi
2000· article· en· Linear Algebra and its Applications· Engineering
distilled prediction:candidate · noneconsensus · none
1
citations
affno abstractunlabeled
Forbidden Configurations and Product Constructions
R.P. Anstee, Christina Koch, Miguel Raggi, Attila Sali
2013· article· en· Graphs and Combinatorics· Engineering
distilled prediction:candidate · noneconsensus · none
1
citations
venueno affno abstractunlabeled
Isomorphisms of directed P 3 -graphs.
Yan Liu, Biao Zhao
2011· article· en· Ars Combinatoria· Engineering
distilled prediction:candidate · noneconsensus · none
1
citations
afffundno abstractunlabeled
Threefold triple systems with nonsingular <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" display="inline" overflow="scroll"><mml:msub><mml:mrow><mml:mi>N</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub></mml:math>
Peter J. Dukes, Kseniya Garaschuk
2015· article· lv· Discrete Mathematics· Engineering
distilled prediction:candidate · metaepi_narrow+scholarly_communication+research_integrity+insufficient_payloadconsensus · insufficient_payload
1
citations
affno abstractunlabeled
Decompositions of complete graphs into circulants
Mariusz Meszka, Roman Nedela, Alexander Rosa, Martin Škoviera
2016· article· en· Discrete Mathematics· Engineering
distilled prediction:candidate · noneconsensus · none
1
citations
affunlabeled
Crowns in Linear $3$-Graphs of Minimum Degree $4$
Alvaro Carbonero, Willem Fletcher, Jing Guo, András Gyárfás, Rona Wang, Shiyu Yan
2022· article· en· The Electronic Journal of Combinatorics· Engineering
distilled prediction:candidate · noneconsensus · none
1
citations
affunlabeled
The Best Matrix Conjecture
2019· article· en· Zenodo (CERN European Organization for Nuclear Research)· Engineering
distilled prediction:candidate · insufficient_payloadconsensus · insufficient_payload
1
citations
venueno affno abstractunlabeled
On cycle resonant outerplanar graphs.
Xiaofeng Guo, Zhixia Xu
2014· article· en· Ars Combinatoria· Engineering
distilled prediction:candidate · noneconsensus · none
0
citations
fundno affunlabeled
The Implicit Graph Conjecture is False
Hamed Hatami, Pooya Hatami
2021· preprint· en· arXiv (Cornell University)· Engineering
distilled prediction:candidate · metaepi_narrowconsensus · none
0
citations
venueno affunlabeled
Halving complete 4-partite graphs
Dalibor Fronček, Jozef Širáň
2000· article· sv· Ars Combinatoria· Engineering
distilled prediction:candidate · metaepi_narrow+insufficient_payloadconsensus · insufficient_payload
0
citations
afffundno abstractunlabeled
A lower bound on HMOLS with equal sized holes
Michael Bailey, Coen del Valle, Peter J. Dukes
2021· preprint· en· Finite Fields and Their Applications· Engineering
distilled prediction:candidate · noneconsensus · none
0
citations
venueno affno abstractunlabeled
Maximal-clique Partitions of Different Sizes.
Chariya Uiyyasathian, Kathryn Fraughnaugh
2005· article· en· Ars Combinatoria· Engineering
distilled prediction:candidate · noneconsensus · none
0
citations
venueno affno abstractunlabeled
On the Disarrangements with k Cycles.
QI Deng-ji, Xiuli Li
2010· article· en· Ars Combinatoria· Engineering
distilled prediction:candidate · noneconsensus · none
0
citations
venueno affno abstractunlabeled
Perfect -latin squares.
Kevin G. Hare
2002· article· en· Ars Combinatoria· Engineering
distilled prediction:candidate · noneconsensus · none
0
citations
venueno affno abstractunlabeled
λ-Designs with Two Block Sizes II.
Nick C. Fiala
2009· article· en· Ars Combinatoria· Engineering
distilled prediction:candidate · noneconsensus · none
0
citations
venueno affno abstractunlabeled
k-Connected Graphs Without K 4 .
Xiang-Jun Li
2015· article· en· Ars Combinatoria· Engineering
distilled prediction:candidate · noneconsensus · none
0
citations
← previousnext →

How this was built: Screen · Findings · About