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

venueno affno abstractunlabeled
List coloring Halin graphs
Weifan Wang, Ko‐Wei Lih
2005· article· en· Ars Combinatoria· Computer Science
distilled prediction:candidate · noneconsensus · none
10
citations
affno abstractunlabeled
On the Treewidth of NK Landscapes
Yong Gao, Joseph Culberson
2003· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
10
citations
affno abstractunlabeled
Cleaning with Brooms
Margaret-Ellen Messinger, Richard J. Nowakowski, Paweł Prałat
2010· article· en· Graphs and Combinatorics· Computer Science
distilled prediction:candidate · noneconsensus · none
10
citations
fundno affno abstractunlabeled
Domination in tournaments
Maria Chudnovsky, Ringi Kim, Chun‐Hung Liu, Paul Seymour, Stéphan Thomassé
2017· article· en· Journal of Combinatorial Theory Series B· Computer Science
distilled prediction:candidate · noneconsensus · none
10
citations
affno abstractunlabeled
Location Oblivious Distributed Unit Disk Graph Coloring
Mathieu Couture, Michel Barbeau, Prosenjit Bose, Paz Carmi, Evangelos Kranakis
2007· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
10
citations
afffundunlabeled
Tough spiders
Tomáš Kaiser, Daniel Král͏̌, Ladislav Stacho
2007· article· en· Journal of Graph Theory· Computer Science
distilled prediction:candidate · noneconsensus · none
10
citations
afffundno abstractunlabeled
On nice graphs
Pavol Hell, Alexandr Kostochka, André Raspaud, Éric Sopena
2001· article· en· Discrete Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
10
citations
afffundno abstractunlabeled
Some bounds on global alliances in trees
Ararat Harutyunyan
2011· article· en· Discrete Applied Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
10
citations
affno abstractunlabeled
Acyclic coloring with few division vertices
Debajyoti Mondal, Rahnuma Islam Nishat, Md. Saidur Rahman, Sue Whitesides
2013· article· en· Journal of Discrete Algorithms· Computer Science
distilled prediction:candidate · noneconsensus · none
10
citations
affno abstractunlabeled
Paired Domination Vertex Critical Graphs
Xinmin Hou, Michelle Edwards
2008· article· en· Graphs and Combinatorics· Computer Science
distilled prediction:candidate · noneconsensus · none
10
citations
affno abstractunlabeled
Fast Winning Strategies in Avoider-Enforcer Games
Dan Hefetz, Michael Krivelevich, Miloš Stojaković, Tibor Szabó
2009· article· en· Graphs and Combinatorics· Computer Science
distilled prediction:candidate · noneconsensus · none
10
citations
afffundunlabeled
Succinct Data Structures for Chordal Graphs
J. Ian Munro, Kaiyu Wu
2018· article· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Computer Science
distilled prediction:candidate · metaepi_narrow+open_scienceconsensus · none
10
citations
affno abstractunlabeled
<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:mo stretchy="false">(</mml:mo><mml:mi>Δ</mml:mi><mml:mo>-</mml:mo><mml:mi>k</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math>-critical graphs
Babak Farzad, Michael Molloy, Bruce Reed
2004· article· lv· Journal of Combinatorial Theory Series B· Computer Science
distilled prediction:candidate · metaepi_narrow+sts+scholarly_communication+open_science+research_integrity+insufficient_payloadconsensus · metaepi_narrow+sts+research_integrity+insufficient_payload
10
citations
venueno affno abstractunlabeled
The Global Connected Domination In Graphs.
Dejan Delić, Changping Wang
2014· article· en· Ars Combinatoria· Computer Science
distilled prediction:candidate · noneconsensus · none
10
citations
venueno affno abstractunlabeled
On The Detour Monophonic Number of a Graph.
P. Titus, K. Ganesamoorthy
2016· article· en· Ars Combinatoria· Computer Science
distilled prediction:candidate · noneconsensus · none
9
citations
affno abstractunlabeled
On the Excluded Minors for Quaternary Matroids
Jim Geelen, James Oxley, Dirk Vertigan, Geoff Whittle
2000· article· en· Journal of Combinatorial Theory Series B· 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
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
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
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
venueno affno abstractunlabeled
A Sequential Locating Game on Graphs.
Suzanne M. Seager
2013· article· en· Ars Combinatoria· Computer Science
distilled prediction:candidate · insufficient_payloadconsensus · none
9
citations
venueno affno abstractunlabeled
Restrained Domination Excellent Trees.
Johannes H. Hattingh, Michael A. Henning
2008· article· en· Ars Combinatoria· Computer Science
distilled prediction:candidate · noneconsensus · none
9
citations
← previousnext →

How this was built: Screen · Findings · About