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 14 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
On the Graph Decomposition
Yangjun Chen, Yibin Chen
2014· article· en· Computer Science
distilled prediction:candidate · noneconsensus · none
9
citations
affunlabeled
CSP DICHOTOMY FOR SPECIAL POLYADS
Libor Barto, Jakub Bulín
2013· article· en· International Journal of Algebra and Computation· Computer Science
distilled prediction:candidate · noneconsensus · none
9
citations
affno abstractunlabeled
New Lower Bounds on Broadcast Function
Hayk Grigoryan, Hovhannes A. Harutyunyan
2014· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
9
citations
afffundno abstractunlabeled
Brushing without capacity restrictions
Darryn Bryant, Nevena Francetić, Przemysław Gordinowicz, David A. Pike, Paweł Prałat
2014· article· en· Discrete Applied Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
9
citations
affno abstractunlabeled
Augmenting chains in graphs without a skew star
Michael U. Gerber, Alain Hertz, Vadim Lozin
2005· article· en· Journal of Combinatorial Theory Series B· Computer Science
distilled prediction:candidate · noneconsensus · none
9
citations
fundno affno abstractunlabeled
Disjoint dijoins
Maria Chudnovsky, Katherine Edwards, Ringi Kim, Alex Scott, Paul Seymour
2016· article· en· Journal of Combinatorial Theory Series B· Computer Science
distilled prediction:candidate · noneconsensus · none
9
citations
affno abstractunlabeled
Algorithms in the W-Hierarchy
Jonathan F. Buss, Tarique Islam
2007· article· en· Theory of Computing Systems· Computer Science
distilled prediction:candidate · noneconsensus · none
9
citations
afffundunlabeled
The Rainbow Cycle Cover Problem
Selene Silvestri, Gilbert Laporte, Raffaele Cerulli
2016· article· en· Networks· Computer Science
distilled prediction:candidate · noneconsensus · none
9
citations
affno abstractunlabeled
An algorithm for computing simple k-factors
Henk Meijer, Yurai Núñez-Rodríguez, David Rappaport
2009· article· en· Information Processing Letters· Computer Science
distilled prediction:candidate · noneconsensus · none
9
citations
afffundno abstractunlabeled
On the Unimodality of Domination Polynomials
Iain Beaton, Jason I. Brown
2022· article· en· Graphs and Combinatorics· Computer Science
distilled prediction:candidate · noneconsensus · none
9
citations
affno abstractunlabeled
The order of hypotraceable oriented graphs
Susan A. van Aardt, Marietjie Frick, Peter Katrenič, Morten H. Nielsen
2011· article· en· Discrete Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
9
citations
affno abstractunlabeled
The Complexity of Dominating Set Reconfiguration
Arash Haddadan, Takehiro Ito, Amer E. Mouawad, Naomi Nishimura, Hirotaka Ono, Akira Suzuki +1 more
2015· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · stsconsensus · none
9
citations
affunlabeled
Constraint satisfaction problems
Andreǐ A. Bulatov
2018· article· en· ACM SIGLOG News· Computer Science
distilled prediction:candidate · insufficient_payloadconsensus · none
9
citations
affno abstractunlabeled
Regular graphs are not universal fixers
Alewyn P. Burger, Christina M. Mynhardt
2008· article· en· Discrete Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
9
citations
affno abstractunlabeled
On the Parameterized Complexity of Computing Graph Bisections
René van Bevern, Andreas Emil Feldmann, Manuel Sorge, Ondřej Suchý
2013· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrow+sts+open_scienceconsensus · none
9
citations
affno abstractunlabeled
Boxicity and cubicity of product graphs
L. Sunil Chandran, Wilfried Imrich, Rogers Mathew, Deepak Rajendraprasad
2015· article· en· European Journal of Combinatorics· Computer Science
distilled prediction:candidate · noneconsensus · none
8
citations
afffundno abstractunlabeled
On well-covered triangulations: Part III
Arthur S. Finbow, Bert L. Hartnell, Richard J. Nowakowski, Michael D. Plummer
2010· article· en· Discrete Applied Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
8
citations
affno abstractunlabeled
Acyclic colorings of graph subdivisions revisited
Debajyoti Mondal, Rahnuma Islam Nishat, Sue Whitesides, Md. Saidur Rahman
2012· article· en· Journal of Discrete Algorithms· Computer Science
distilled prediction:candidate · noneconsensus · none
8
citations
venueno affno abstractunlabeled
Contractible Edges and Bowties in a k-Connected Graph.
Kiyoshi Ando, Atsushi Kaneko, Ken‐ichi Kawarabayashi, Kiyoshi Yoshiomoto
2002· article· en· Ars Combinatoria· Computer Science
distilled prediction:candidate · noneconsensus · none
8
citations
affunlabeled
Acyclic dominating partitions
Louigi Addario‐Berry, Ross J. Kang, Tobias Müller
2009· article· en· Journal of Graph Theory· Computer Science
distilled prediction:candidate · noneconsensus · none
8
citations
affunlabeled
A Polynomial Excluded-Minor Approximation of Treedepth
Ken‐ichi Kawarabayashi, Benjamin Rossman
2018· book-chapter· en· Society for Industrial and Applied Mathematics eBooks· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
8
citations
affno abstractunlabeled
Vertex-critical <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="d1e185" altimg="si23.svg"><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mrow><mml:mi>P</mml:mi></mml:mrow><mml:mrow><mml:mn>3</mml:mn></mml:mrow></mml:msub><mml:mo linebreak="goodbreak" linebreakstyle="after">+</mml:mo><mml:mi>ℓ</mml:mi><mml:msub><mml:mrow><mml:mi>P</mml:mi></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:math>-free and vertex-critical (gem, co-gem)-free graphs
Tala Abuadas, Ben Cameron, Chı́nh T. Hoàng, Joe Sawada
2023· 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
8
citations
affno abstractunlabeled
Oriented star packings
Richard C. Brewster, Pavol Hell, Roméo Rizzi
2007· article· en· Journal of Combinatorial Theory Series B· Computer Science
distilled prediction:candidate · noneconsensus · none
8
citations
affno abstractunlabeled
Stable skew partition problem
Simone Dantas, Celina M.H. de Figueiredo, Sulamita Klein, Sylvain Gravier, Bruce A. Reed
2004· article· en· Discrete Applied Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
8
citations
afffundno abstractunlabeled
Recolouring reflexive digraphs
Richard C. Brewster, Jae-baek Lee, Mark Siggers
2018· article· en· Discrete Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
8
citations
affunlabeled
List H-Coloring a Graph by Removing Few Vertices
Rajesh Chitnis, László Egri, Dániel Marx
2013· preprint· en· arXiv (Cornell University)· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
8
citations
affno abstractunlabeled
Connected Matchings
Kathie Cameron
2003· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrow+open_scienceconsensus · none
8
citations
afffundno abstractunlabeled
Cyclic colorings of plane graphs with independent faces
Jernej Azarija, Rok Erman, Daniel Král͏̌, Matjaž Krnc, Ladislav Stacho
2011· article· en· European Journal of Combinatorics· Computer Science
distilled prediction:candidate · noneconsensus · none
8
citations
affunlabeled
Obstructions for bounded shrub-depth and rank-depth
O‐joung Kwon, Rose McCarty, Sang‐il Oum, Paul Wollan
2021· article· en· IRIS Research product catalog (Sapienza University of Rome)· Computer Science
distilled prediction:candidate · noneconsensus · none
8
citations
affunlabeled
Comparison of Clique-Listing Algorithms.
Eric Harley
2004· article· en· The International Journal of Periodontics & Restorative Dentistry· Computer Science
distilled prediction:candidate · noneconsensus · none
8
citations
← previousnext →

How this was built: Screen · Findings · About