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

affunlabeled
Search Numbers in Networks with Special Topologies
Boting Yang, Runtao Zhang, Yi Cao, Farong Zhong
2019· article· en· Journal of Interconnection Networks· Computer Science
distilled prediction:candidate · noneconsensus · none
5
citations
affno abstractunlabeled
On Quadratic Threshold CSPs
Per Austrin, Siavosh Benabbas, Avner Magen
2010· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrow+open_science+research_integrityconsensus · none
5
citations
afffundno abstractunlabeled
A New Graph Parameter to Measure Linearity
Pierre Charbit, Michel Habib, Lalla Mouatadid, Reza Naserasr
2017· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrow+scholarly_communication+open_scienceconsensus · none
5
citations
affunlabeled
Packing paths in digraphs
Richard C. Brewster, Pavol Hell, Sarah H. Pantel, Roméo Rizzi, Anders Yeo
2003· article· en· Journal of Graph Theory· Computer Science
distilled prediction:candidate · noneconsensus · none
5
citations
affno abstractunlabeled
On a DAG Partitioning Problem
Soroush Alamdari, Abbas Mehrabian
2012· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
5
citations
fundvenueno affunlabeled
A survey of graph burning
Anthony Bonato
2021· preprint· en· Contributions to Discrete Mathematics· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
5
citations
affunlabeled
Reconfiguration of Dominating Sets
Akira Suzuki, Amer E. Mouawad, Naomi Nishimura
2014· preprint· en· arXiv (Cornell University)· Computer Science
distilled prediction:candidate · noneconsensus · none
5
citations
affno abstractunlabeled
Excluding cycles with a fixed number of chords
Pierre Aboulker, Nicolás Bousquet
2014· article· en· Discrete Applied Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
5
citations
afffundunlabeled
Yes, the “missing axiom” of matroid theory is lost forever
Dillon Mayhew, Mike Newman, Geoff Whittle
2018· preprint· lv· Transactions of the American Mathematical Society· Computer Science
distilled prediction:candidate · metaepi_narrow+sts+open_science+insufficient_payloadconsensus · none
5
citations
venueno affunlabeled
note on total co-independent domination in trees
Abel Cabrera Martínez, Frank A. Hernández Mira, José M. Sigarreta, Ismael G. Yero
2024· article· en· Contributions to Discrete Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
5
citations
venueno affno abstractunlabeled
On (g, f, n)-critical graphs
LI Jian-xiang, Haruhide Matsuda
2006· article· en· Ars Combinatoria· Computer Science
distilled prediction:candidate · noneconsensus · none
5
citations
venueno affunlabeled
On geodetic and k-geodetic sets in graphs.
Sergio Bermudo, Juan A. Rodríguez‐Velázquez, José M. Sigarreta, Ismael G. Yero
2010· article· en· Ars Combinatoria· Computer Science
distilled prediction:candidate · noneconsensus · none
5
citations
venueno affno abstractunlabeled
Alternating Subsets and Successions.
Augustine O. Munagi
2013· article· en· Ars Combinatoria· Computer Science
distilled prediction:candidate · noneconsensus · none
5
citations
venueno affunlabeled
Hamiltonian Properties of Generalized Halin Graphs
Shabnam Malik, Ahmad Mahmood Qureshi, Tudor Zamfirescu
2009· article· en· Canadian Mathematical Bulletin· Computer Science
distilled prediction:candidate · insufficient_payloadconsensus · none
5
citations
afffundunlabeled
The structure of claw-free binary matroids
Peter Nelson, Kazuhiro Nomoto
2018· preprint· en· arXiv (Cornell University)· Computer Science
distilled prediction:candidate · open_scienceconsensus · open_science
5
citations
afffundunlabeled
Homomorphisms of signed graphs: An update
2019· preprint· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Computer Science
distilled prediction:candidate · metaepi_narrow+open_scienceconsensus · none
5
citations
affno abstractunlabeled
Simpler Projective Plane Embedding
Wendy Myrvold, Jianping Roth
2000· article· en· Electronic Notes in Discrete Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
5
citations
venueno affunlabeled
The Complexity of List Ranking of Trees
Dariusz Dereniowski
2008· article· en· Ars Combinatoria· Computer Science
distilled prediction:candidate · noneconsensus · none
5
citations
afffundno abstractunlabeled
Spectrally degenerate graphs: Hereditary case
Zdenĕk Dvořák, Bojan Mohar
2012· article· en· Journal of Combinatorial Theory Series B· Computer Science
distilled prediction:candidate · noneconsensus · none
5
citations
venueno affno abstractunlabeled
On Equitable Coloring of Sun let Graph Families.
K. Kaliraj, J. Vernold Vivin, M M Akbar
2012· article· en· Ars Combinatoria· Computer Science
distilled prediction:candidate · noneconsensus · none
4
citations
afffundno abstractunlabeled
Ferrers dimension of grid intersection graphs
Steven Chaplick, Pavol Hell, Yota Otachi, Toshiki Saitoh, Ryuhei Uehara
2015· article· en· Discrete Applied Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
4
citations
affunlabeled
DIAMETER-CONSTRAINED STEINER TREES
Wei Ding, Guohui Lin, Guoliang Xue
2011· article· en· Discrete Mathematics Algorithms and Applications· Computer Science
distilled prediction:candidate · noneconsensus · none
4
citations
← previousnext →

How this was built: Screen · Findings · About