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

affno abstractunlabeled
Zero-Sum Flows in Regular Graphs
2010· article· en· Graphs and Combinatorics· Computer Science
distilled prediction:candidate · noneconsensus · none
25
citations
afffundunlabeled
Digraphs are $2$-Weight Choosable
2011· article· en· The Electronic Journal of Combinatorics· Computer Science
distilled prediction:candidate · noneconsensus · none
19
citations
venueno affno abstractunlabeled
Super Mean Labeling Of Graphs.
2013· article· en· Ars Combinatoria· Computer Science
distilled prediction:candidate · noneconsensus · none
19
citations
venueno affunlabeled
The Metric Dimension of Circulant Graphs
2016· article· en· Canadian Mathematical Bulletin· Computer Science
distilled prediction:candidate · insufficient_payloadconsensus · none
18
citations
affno abstractunlabeled
On a construction of supermagic graphs
2002· article· en· HKBU Institutional Repository (Hong Kong Baptist University)· Computer Science
distilled prediction:candidate · noneconsensus · none
16
citations
affno abstractunlabeled
Combinatorial Algorithms
2018· book· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
16
citations
afffundno abstractunlabeled
On minimally b-imperfect graphs
2009· article· en· Discrete Applied Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
16
citations
venueno affno abstractunlabeled
Graceful and Edge-Antimagic Labelings.
2010· article· en· Ars Combinatoria· Computer Science
distilled prediction:candidate · noneconsensus · none
15
citations
venueno affunlabeled
On integer-magic spectra of caterpillars
2007· article· en· Journal of Combinatorial Mathematics and Combinatorial Computing· Computer Science
distilled prediction:candidate · noneconsensus · none
14
citations
affvenueno abstractunlabeled
Super edge-antimagic total labelings
2006· article· en· Utilitas Mathematica· Computer Science
distilled prediction:candidate · insufficient_payloadconsensus · none
13
citations
venueno affno abstractunlabeled
On the Hall Number of a Graph.
2000· article· en· Ars Combinatoria· Computer Science
distilled prediction:candidate · noneconsensus · none
13
citations
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
afffundno 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 modular product of two graphs
2013· 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
13
citations
← previousnext →

How this was built: Screen · Findings · About