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 3 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
Cycles and Paths Related Vertex-Equitable Graphs
2023· article· en· Journal of Combinatorial Mathematics and Combinatorial Computing· Computer Science
distilled prediction:candidate · noneconsensus · none
13
citations
venueno affno abstractunlabeled
Fibonacci Graceful Graphs.
2010· article· en· Ars Combinatoria· Computer Science
distilled prediction:candidate · noneconsensus · none
12
citations
affno abstractunlabeled
Magic Labelings on Cycles and Wheels
2008· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
12
citations
venueno affunlabeled
A Problem on Edge-magic Labelings of Cycles
2013· article· en· Canadian Mathematical Bulletin· Computer Science
distilled prediction:candidate · insufficient_payloadconsensus · insufficient_payload
11
citations
venueno affno abstractunlabeled
On Skolem-Graceful and Cordial Graphs.
2006· article· en· Ars Combinatoria· Computer Science
distilled prediction:candidate · noneconsensus · none
11
citations
venueno affno abstractunlabeled
On Super Edge-Magic Graphs.
2006· article· en· Ars Combinatoria· Computer Science
distilled prediction:candidate · noneconsensus · none
11
citations
venueno affno abstractunlabeled
On a Prime Labeling Conjecture.
2006· article· en· Ars Combinatoria· Computer Science
distilled prediction:candidate · noneconsensus · none
10
citations
venueno affunlabeled
On the Local Colorings of Graphs.
2008· article· en· Ars Combinatoria· Computer Science
distilled prediction:candidate · noneconsensus · none
10
citations
venueno affno abstractunlabeled
Graceful labelings of cyclic snakes.
2001· article· en· Ars Combinatoria· Computer Science
distilled prediction:candidate · noneconsensus · none
10
citations
affunlabeled
Graph Theory
2023· article· en· Oberwolfach Reports· Computer Science
distilled prediction:candidate · noneconsensus · none
9
citations
affunlabeled
Derived colourings of graphs
2012· dissertation· en· Computer Science
distilled prediction:candidate · noneconsensus · none
9
citations
affunlabeled
Computing in Combinatorial Optimization
2019· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
8
citations
affno abstractunlabeled
<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" display="inline" overflow="scroll"><mml:mi>L</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mn>2</mml:mn><mml:mo>,</mml:mo><mml:mn>1</mml:mn><mml:mo>)</mml:mo></mml:mrow></mml:math>-Labelings on the composition of <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si2.gif" display="inline" overflow="scroll"><mml:mi>n</mml:mi></mml:math> graphs
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
8
citations
venueno affno abstractunlabeled
Two Classes of Graceful Graphs.
2000· article· en· Ars Combinatoria· Computer Science
distilled prediction:candidate · noneconsensus · none
8
citations
← previousnext →

How this was built: Screen · Findings · About