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
Year range
→
Sort
Language
Type
Field
Venue
Topic
Graph Labeling and Dimension Problems
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.

807 results · 1 filter active ·
Categories
Machine labels · sparse coverage
Evidence
An unlabeled work is unknown, not a negative. Label coverage is reported on every query.
807 works in the cohort · of 4,299,418page 1 of 17

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

venueno affunlabeled
Journal of Combinatorial Mathematics and Combinatorial Computing
2023· paratext· en· Journal of Combinatorial Mathematics and Combinatorial Computing· Computer Science
distilled prediction:candidate · metaepi_narrow+scholarly_communication+research_integrityconsensus · metaepi_narrow+research_integrity
237
citations
affno abstractunlabeled
Degree constrained subgraphs
2007· article· en· Discrete Applied Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
121
citations
affno abstractunlabeled
Vertex-Colouring Edge-Weightings
2007· article· en· COMBINATORICA· Computer Science
distilled prediction:candidate · noneconsensus · none
114
citations
affno abstractunlabeled
Vertex colouring edge partitions
2005· article· en· Journal of Combinatorial Theory Series B· Computer Science
distilled prediction:candidate · noneconsensus · none
109
citations
affno abstractunlabeled
Additive Combinatorics
2007· book· en· CRM proceedings & lecture notes· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
107
citations
affno abstractunlabeled
On vertex-coloring 13-edge-weighting
2008· article· en· Frontiers of Mathematics in China· Computer Science
distilled prediction:candidate · noneconsensus · none
79
citations
aboutno affunlabeled
The Map-Coloring Game
2007· article· en· American Mathematical Monthly· Computer Science
distilled prediction:candidate · noneconsensus · none
72
citations
venueno affno abstractunlabeled
On Super Edge-Magic Graphs.
2002· article· en· Ars Combinatoria· Computer Science
distilled prediction:candidate · insufficient_payloadconsensus · none
59
citations
afffundno abstractunlabeled
On the b-dominating coloring of graphs
2005· article· en· Discrete Applied Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
57
citations
fundno affunlabeled
On the metric dimension of Grassmann graphs
2012· article· en· Discrete Mathematics & Theoretical Computer Science· Computer Science
distilled prediction:candidate · noneconsensus · none
53
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>p</mml:mi><mml:mo>,</mml:mo><mml:mn>1</mml:mn><mml:mo stretchy="false">)</mml:mo></mml:math>-Total labelling of graphs
2007· article· lv· Discrete Mathematics· Computer Science
distilled prediction:candidate · metaepi_narrow+sts+scholarly_communication+research_integrity+insufficient_payloadconsensus · metaepi_narrow+research_integrity
48
citations
venueno affno abstractunlabeled
A Note on Strongly Graceful Trees.
2009· article· en· Ars Combinatoria· Computer Science
distilled prediction:candidate · noneconsensus · none
40
citations
afffundunlabeled
Metric Dimension for Random Graphs
2013· article· en· The Electronic Journal of Combinatorics· Computer Science
distilled prediction:candidate · noneconsensus · none
39
citations
affno abstractunlabeled
Chromatic Number and the 2-Rank of a Graph
2001· article· en· Journal of Combinatorial Theory Series B· Computer Science
distilled prediction:candidate · noneconsensus · none
35
citations
affno abstractunlabeled
Magic square spectra
2008· article· en· Linear Algebra and its Applications· Computer Science
distilled prediction:candidate · noneconsensus · none
32
citations
afffundno abstractunlabeled
Locating a robber on a graph
2012· article· en· Discrete Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
31
citations
affunlabeled
L(2,1)-labelling of graphs
2008· article· en· HAL (Le Centre pour la Communication Scientifique Directe)· Computer Science
distilled prediction:candidate · noneconsensus · none
30
citations
venueno affno abstractunlabeled
On vertex irregular total labelings.
2013· article· en· Ars Combinatoria· Computer Science
distilled prediction:candidate · insufficient_payloadconsensus · none
28
citations
affunlabeled
Relaxed Graceful Labellings of Trees
2002· article· en· The Electronic Journal of Combinatorics· Computer Science
distilled prediction:candidate · noneconsensus · none
28
citations
venueno affunlabeled
Cubic Graphs with Application
2018· article· en· International Journal of Analysis and Applications· Computer Science
distilled prediction:candidate · noneconsensus · none
27
citations
affunlabeled
Gray code numbers for graphs
2011· article· en· Ars Mathematica Contemporanea· Computer Science
distilled prediction:candidate · noneconsensus · none
27
citations
next →

How this was built: Screen · Findings · About