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

affno abstractunlabeled
Perfect matchings after vertex deletions
R. E. L. Aldred, R.P. Anstee, Stephen C. Locke
2007· article· en· Discrete Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
13
citations
afffundno abstractunlabeled
Partitioned probe comparability graphs
David B. Chandler, Maw‐Shang Chang, Ton Kloks, Jiping Liu, Sheng‐Lung Peng
2008· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · stsconsensus · none
13
citations
afffundno abstractunlabeled
Characterizations of (<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" display="inline" overflow="scroll"><mml:mn>4</mml:mn><mml:msub><mml:mrow><mml:mi>K</mml:mi></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:math>, <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si2.gif" display="inline" overflow="scroll"><mml:msub><mml:mrow><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mn>4</mml:mn></mml:mrow></mml:msub></mml:math>, <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si3.gif" display="inline" overflow="scroll"><mml:msub><mml:mrow><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mn>5</mml:mn></mml:mrow></mml:msub></mml:math>)-free graphs
Dallas J. Fraser, Angèle M. Hamel, Chı́nh T. Hoàng, Kevin J. Holmes, Tom P. LaMantia
2016· article· lv· Discrete Applied Mathematics· Computer Science
distilled prediction:candidate · metaresearch+metaepi_narrow+sts+scholarly_communication+open_science+research_integrity+insufficient_payloadconsensus · metaepi_narrow+sts+open_science+research_integrity+insufficient_payload
13
citations
affno abstractunlabeled
Packing trees in communication networks
Mohamed Saad, Tamás Terlaky, Anthony Vannelli, Zhang Hu
2008· article· en· Journal of Combinatorial Optimization· Computer Science
distilled prediction:candidate · noneconsensus · none
13
citations
affunlabeled
FINDING SMALLEST SUPERTREES UNDER MINOR CONTAINMENT
Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos
2000· article· en· International Journal of Foundations of Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
13
citations
affno abstractunlabeled
Reconfiguration on Sparse Graphs
Daniel Lokshtanov, Amer E. Mouawad, Fahad Panolan, M. S. Ramanujan, Saket Saurabh
2015· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
13
citations
afffundunlabeled
5-List-Coloring Planar Graphs with Distant Precolored Vertices
Zdenĕk Dvořák, Bernard Lidický, Bojan Mohar, Luke Postle
2017· article· en· Iowa State University Digital Repository (Iowa State University)· Computer Science
distilled prediction:candidate · metaepi_narrow+sts+scholarly_communicationconsensus · none
13
citations
afffundno abstractunlabeled
Making triangulations 4-connected using flips
Prosenjit Bose, Dana Jansens, André van Renssen, Maria Saumell, Sander Verdonschot
2012· article· en· Computational Geometry· Computer Science
distilled prediction:candidate · noneconsensus · none
12
citations
affno abstractunlabeled
The number of 2-sat functions
Béla Bollobás, Graham Brightwell, Imre Leader
2003· article· en· Israel Journal of Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
12
citations
affunlabeled
Corrigendum to “Best match graphs”
David Schaller, Manuela Geiß, Edgar Chávez, Marcos González Laffitte, Alitzel López Sánchez, Bärbel M. R. Stadler +4 more
2021· erratum· en· Journal of Mathematical Biology· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
12
citations
affunlabeled
Partitioning planar graphs with costs and weights
Lyudmil Aleksandrov, Hristo Djidjev, Hua Guo, Anil Maheshwari
2007· article· en· ACM Journal of Experimental Algorithmics· Computer Science
distilled prediction:candidate · noneconsensus · none
12
citations
affunlabeled
Disjoint quasi‐kernels in digraphs
Scott Heard, Jing Huang
2008· article· en· Journal of Graph Theory· Computer Science
distilled prediction:candidate · noneconsensus · none
12
citations
affunlabeled
Average distance and maximum induced forest
Pierre Hansen, Alain Hertz, Rim Kilani, Odile Marcotte, David Schindl
2008· article· en· Journal of Graph Theory· Computer Science
distilled prediction:candidate · noneconsensus · none
12
citations
affno abstractunlabeled
Simplifying the weft hierarchy
Jonathan F. Buss, Tarique Islam
2005· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · sts+open_scienceconsensus · none
12
citations
venueno affno abstractunlabeled
Domination Graphs of Tournaments with Isolated Vertices.
David Fisher, J. Richard Lundgren, David R. Guichard, Sarah K. Merz, K. B. Reid
2003· article· en· Ars Combinatoria· Computer Science
distilled prediction:candidate · noneconsensus · none
12
citations
afffundno abstractunlabeled
Number of lines in hypergraphs
Pierre Aboulker, Adrian Bondy, Ehsan Chiniforooshan, Vašek Chvátal, Peihan Miao
2014· article· en· Discrete Applied Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
12
citations
affno abstractunlabeled
Multi-terminal multipath flows: synthesis
R. Chandrasekaran, K. P. K. Nair, Y.P. Aneja, S.N. Kabadi
2004· article· en· Discrete Applied Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
12
citations
affno abstractunlabeled
Path Cover Problems with Length Cost
Kenya Kobayashi, Guohui Lin, Eiji Miyano, Toshiki Saitoh, Akira Suzuki, Tadatoshi Utashima +1 more
2023· article· en· Algorithmica· Computer Science
distilled prediction:candidate · insufficient_payloadconsensus · none
12
citations
affno abstractunlabeled
Metric Embeddings?Beyond One-Dimensional Distortion
Robert Krauthgamer, Nathan Linial, Avner Magen
2004· article· en· Discrete & Computational Geometry· Computer Science
distilled prediction:candidate · noneconsensus · none
12
citations
afffundno abstractunlabeled
Dominating and irredundant broadcasts in graphs
Christina M. Mynhardt, Adriana Roux
2017· article· en· Discrete Applied Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
12
citations
afffundunlabeled
On essentially 4-edge-connected cubic bricks
Nishad Kothari, Marcelo H. de Carvalho, Cláudio L. Lucchesi, Charles H. C. Little
2018· article· ArXiv.org· Computer Science
distilled prediction:candidate · metaepi_narrow+insufficient_payloadconsensus · insufficient_payload
12
citations
afffundunlabeled
A Characterization of the degree sequences of 2‐trees
Prosenjit Bose, Vida Dujmović, Danny Kriz̧anc, Stefan Langerman, Pat Morin, David R. Wood +1 more
2008· article· en· Journal of Graph Theory· Computer Science
distilled prediction:candidate · noneconsensus · none
12
citations
affno abstractunlabeled
Constant-factor approximations of branch-decomposition and largest grid minor of planar graphs in<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si2.gif" display="inline" overflow="scroll"><mml:mi>O</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msup><mml:mrow><mml:mi>n</mml:mi></mml:mrow><mml:mrow><mml:mn>1</mml:mn><mml:mo>+</mml:mo><mml:mi>ϵ</mml:mi></mml:mrow></mml:msup><mml:mo>)</mml:mo></mml:mrow></mml:math>time
Qian‐Ping Gu, Hisao Tamaki
2010· article· lv· Theoretical Computer Science· Computer Science
distilled prediction:candidate · metaepi_narrow+sts+scholarly_communication+open_science+research_integrity+insufficient_payloadconsensus · metaepi_narrow+sts+research_integrity+insufficient_payload
12
citations
← previousnext →

How this was built: Screen · Findings · About