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 4 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 affno abstractunlabeled
Two Classes of Graceful Graphs.
2000· article· en· Ars Combinatoria· Computer Science
distilled prediction:candidate · noneconsensus · none
8
citations
affno abstractunlabeled
Advances in Combinatorics
2013· book· en· Computer Science
distilled prediction:candidate · noneconsensus · none
7
citations
venueno affno abstractunlabeled
Some Properties of Prime Graphs.
2007· article· en· Ars Combinatoria· Computer Science
distilled prediction:candidate · noneconsensus · none
7
citations
venueno affno abstractunlabeled
On odd graceful graphs.
2013· article· en· Ars Combinatoria· Computer Science
distilled prediction:candidate · insufficient_payloadconsensus · none
7
citations
affno abstractunlabeled
Elementary additive combinatorics
2007· book-chapter· en· CRM proceedings & lecture notes· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
7
citations
affno abstractunlabeled
The <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>-labeling on Cartesian sum of graphs
2008· article· lv· Applied Mathematics Letters· Computer Science
distilled prediction:candidate · metaepi_narrow+sts+scholarly_communication+research_integrity+insufficient_payloadconsensus · metaepi_narrow+sts+research_integrity+insufficient_payload
7
citations
venueno affno abstractunlabeled
Regular handicap graphs of odd order
2017· article· en· Journal of Combinatorial Mathematics and Combinatorial Computing· Computer Science
distilled prediction:candidate · noneconsensus · none
6
citations
venueno affunlabeled
Some Graceful Graphs
2012· article· en· Journal of Mathematics Research· Computer Science
distilled prediction:candidate · noneconsensus · none
6
citations
affno abstractunlabeled
IC-Colorings and IC-Indices of graphs
2005· article· en· Discrete Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
6
citations
affvenueno abstractunlabeled
Further results on SD-prime labeling
2016· article· en· Journal of Combinatorial Mathematics and Combinatorial Computing· Computer Science
distilled prediction:candidate · noneconsensus · none
6
citations
affunlabeled
Some edge-magic cubic graphs
2002· article· en· HKBU Institutional Repository (Hong Kong Baptist University)· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
6
citations
venueno affno abstractunlabeled
Induced Graph Theorem on Magic Valuations.
2000· article· en· Ars Combinatoria· Computer Science
distilled prediction:candidate · insufficient_payloadconsensus · none
6
citations
affvenueno abstractunlabeled
On SD-prime labeling of graphs
2018· article· en· Utilitas Mathematica· Computer Science
distilled prediction:candidate · noneconsensus · none
5
citations
venueno affno abstractunlabeled
On Variations of Graceful Labelings.
2008· article· en· Ars Combinatoria· Computer Science
distilled prediction:candidate · noneconsensus · none
5
citations
fundno affunlabeled
Combinatorial Gray codes-an updated survey
2022· preprint· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Computer Science
distilled prediction:candidate · metaepi_narrow+scholarly_communicationconsensus · none
5
citations
← previousnext →

How this was built: Screen · Findings · About