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
European Journal of Combinatorics
Topic
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.

219 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.
219 works in the cohort · of 4,299,418page 1 of 5

Labels cover 0 of 219 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 219 of 219 works in this cohort. Predictions are machine_predicted_unvalidated teacher distillation outputs. Candidate is the union; consensus is the intersection.

affno abstractunlabeled
Palindromic richness
Amy Glen, Jacques Justin, Steve Widmer, Luca Q. Zamboni
2008· article· en· European Journal of Combinatorics· Computer Science
distilled prediction:candidate · noneconsensus · none
151
citations
affno abstractunlabeled
On the asymptotic proportion of connected matroids
Dillon Mayhew, Mike Newman, Dominic Welsh, Geoff Whittle
2011· article· en· European Journal of Combinatorics· Computer Science
distilled prediction:candidate · noneconsensus · none
94
citations
affno abstractunlabeled
Improved complexity results on <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si2.gif" display="inline" overflow="scroll"><mml:mi>k</mml:mi></mml:math>-coloring <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si5.gif" display="inline" overflow="scroll"><mml:msub><mml:mrow><mml:mi>P</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:math>-free graphs
Shenwei Huang
2015· article· lv· European Journal of Combinatorics· Computer Science
distilled prediction:candidate · metaepi_narrow+sts+scholarly_communication+open_science+research_integrity+insufficient_payloadconsensus · metaepi_narrow+sts+research_integrity+insufficient_payload
79
citations
affno abstractunlabeled
On a conjecture about the Szeged index
Mustapha Aouchiche, Pierre Hansen
2010· article· en· European Journal of Combinatorics· Mathematics
distilled prediction:candidate · noneconsensus · none
68
citations
affno abstractunlabeled
Dejean’s conjecture and Sturmian words
Morteza Mohammad-Noori, James D. Currie
2006· article· en· European Journal of Combinatorics· Computer Science
distilled prediction:candidate · noneconsensus · none
58
citations
afffundno abstractunlabeled
A dichotomy for minimum cost graph homomorphisms
Gregory Gutin, Pavol Hell, Arash Rafiey, Anders Yeo
2008· article· en· European Journal of Combinatorics· Computer Science
distilled prediction:candidate · noneconsensus · none
57
citations
affno abstractunlabeled
Sphere packings revisited
Károly Bezdek
2005· article· en· European Journal of Combinatorics· Mathematics
distilled prediction:candidate · noneconsensus · none
52
citations
affno abstractunlabeled
Divisibility of countable metric spaces
Christian Delhommé, Claude Laflamme, Maurice Pouzet, Norbert Sauer
2006· article· en· European Journal of Combinatorics· Mathematics
distilled prediction:candidate · noneconsensus · none
50
citations
affno abstractunlabeled
Resolving sets for Johnson and Kneser graphs
R. A. Bailey, José Cáceres, Delia Garijo, Antonio González, Alberto Márquez, Karen Meagher +1 more
2012· article· en· European Journal of Combinatorics· Engineering
distilled prediction:candidate · noneconsensus · none
49
citations
affno abstractunlabeled
Deterministic random walks on the integers
Joshua Cooper, Benjamin Doerr, Joel Spencer, Gábor Tardos
2007· article· en· European Journal of Combinatorics· Physics and Astronomy
distilled prediction:candidate · noneconsensus · none
47
citations
affno abstractunlabeled
Colorful subgraphs in Kneser-like graphs
Gábor Simonyi, Gábor Tardos
2007· article· en· European Journal of Combinatorics· Computer Science
distilled prediction:candidate · noneconsensus · none
39
citations
afffundno abstractunlabeled
Graph partitions with prescribed patterns
Pavol Hell
2013· article· en· European Journal of Combinatorics· Computer Science
distilled prediction:candidate · noneconsensus · none
37
citations
affno abstractunlabeled
Vertex-coloring 2-edge-weighting of graphs
Hongliang Lu, Qinglin Yu, Cun‐Quan Zhang
2010· article· en· European Journal of Combinatorics· Computer Science
distilled prediction:candidate · noneconsensus · none
37
citations
afffundno abstractunlabeled
Embedding grids in surfaces
Jim Geelen, R. Bruce Richter, Gelasio Salazar
2004· article· en· European Journal of Combinatorics· Computer Science
distilled prediction:candidate · noneconsensus · none
35
citations
affno abstractunlabeled
On codes from hypergraphs
Yonatan Bilu, Shlomo Hoory
2003· article· en· European Journal of Combinatorics· Computer Science
distilled prediction:candidate · noneconsensus · none
35
citations
affno abstractunlabeled
Judicious Partitions of 3-uniform Hypergraphs
B Bollobás, Alex Scott
2000· article· en· European Journal of Combinatorics· Engineering
distilled prediction:candidate · noneconsensus · none
32
citations
affno abstractunlabeled
Geometric properties of Assur graphs
Brigitte Servatius, Offer Shai, Walter Whiteley
2009· article· en· European Journal of Combinatorics· Engineering
distilled prediction:candidate · noneconsensus · none
32
citations
afffundno abstractunlabeled
Rigidity of ball-polyhedra in Euclidean 3-space
Károly Bezdek, Márton Naszódi
2004· article· en· European Journal of Combinatorics· Mathematics
distilled prediction:candidate · noneconsensus · none
30
citations
affno abstractunlabeled
Reduced clique graphs of chordal graphs
Michel Habib, Juraj Stacho
2011· article· en· European Journal of Combinatorics· Computer Science
distilled prediction:candidate · noneconsensus · none
27
citations
affno abstractunlabeled
Minimal paths and cycles in set systems
Dhruv Mubayi, Jacques Verstraëte
2006· article· en· European Journal of Combinatorics· Mathematics
distilled prediction:candidate · noneconsensus · none
27
citations
affno abstractunlabeled
Computing regularities in strings: A survey
W.F. Smyth
2012· article· en· European Journal of Combinatorics· Computer Science
distilled prediction:candidate · noneconsensus · none
26
citations
afffundno abstractunlabeled
Computing the Longest Previous Factor
Maxime Crochemore, Lucian Ilie, Costas S. Iliopoulos, Marcin Kubica, Wojciech Rytter, Tomasz Waleń
2012· article· en· European Journal of Combinatorics· Computer Science
distilled prediction:candidate · noneconsensus · none
23
citations
afffundno abstractunlabeled
Representations of directed strongly regular graphs
Chris Godsil, Sylvia A. Hobart, William J. Martin
2006· article· en· European Journal of Combinatorics· Mathematics
distilled prediction:candidate · noneconsensus · none
23
citations
affno abstractunlabeled
On the geodesic pre-hull number of a graph
Norbert Polat, Gert Sabidussi
2008· article· en· European Journal of Combinatorics· Computer Science
distilled prediction:candidate · noneconsensus · none
21
citations
affno abstractunlabeled
n-Semimetrics
Michel Deza, Ivo G. Rosenberg
2000· article· en· European Journal of Combinatorics· Mathematics
distilled prediction:candidate · noneconsensus · none
21
citations
affno abstractunlabeled
Poset edge-labellings and left modularity
Peter R. W. McNamara, Hugh Thomas
2004· article· en· European Journal of Combinatorics· Engineering
distilled prediction:candidate · noneconsensus · none
21
citations
afffundno abstractunlabeled
Local Steiner convexity
Michael A. Henning, Morten H. Nielsen, Ortrud R. Oellermann
2008· article· en· European Journal of Combinatorics· Computer Science
distilled prediction:candidate · noneconsensus · none
18
citations
next →

How this was built: Screen · Findings · About