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
Ars Combinatoria
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.

2,619 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.
2,619 works in the cohort · of 4,299,418page 24 of 53

Labels cover 1 of 2,619 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 2,619 of 2,619 works in this cohort. Predictions are machine_predicted_unvalidated. The Gemma side is a direct model label for every work (title-only); the Codex side is a distilled, calibrated classifier. Candidate is the union; consensus is the intersection.

venueno affno abstractunlabeled
On Vertex Matching Polynomial of Graphs.
Gholam Hossein Fath-Tabar, Amir Loghman
2012· article· en· Ars Combinatoria· Mathematics
machine prediction:candidate · noneconsensus · none
1
citations
venueno affno abstractunlabeled
On Harmonious Graphs of Order 6.
M. A. Seoud, Maged Z. Youssef
2002· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
venueno affno abstractunlabeled
Defensive alliances in regular graphs.
Gabriela Araujo‐Pardo, Lali Barrière
2014· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
venueno affunlabeled
Graph Reconstruction by Permutations.
Pierre Ille, William L. Kocay
2008· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
venueno affno abstractunlabeled
The planar Ramsey numbers PR(K4-e, Kk-e).
Yongqi Sun, Yuansheng Yang, Zhihai Wang
2008· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
venueno affno abstractunlabeled
Set-magic labelings of infinite graphs.
N.M. Singhi, G.R. Vijayakumar, N. Usha Devi
2002· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
venueno affno abstractunlabeled
Some Decomposition Invariants of Crowns.
Chiang Lin, Jenq-Jong Lin, Hung-Chih Lee
2003· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
venueno affno abstractunlabeled
New Families of Graceful Disconnected Graphs.
M. A. Seoud, Maged Z. Youssef
2000· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
venueno affno abstractunlabeled
On the existence of trades of large volumes.
Abdolhossein Hoorfar, G. B. Khosrovshahi
2004· article· en· Ars Combinatoria· Economics, Econometrics and Finance
machine prediction:candidate · noneconsensus · none
1
citations
venueno affno abstractunlabeled
On (64, 28, 12) Difference Sets.
Omar A. AbuGhneim
2013· article· en· Ars Combinatoria· Engineering
machine prediction:candidate · noneconsensus · none
1
citations
venueno affno abstractunlabeled
Potentially K 1, 1, t -graphic sequences.
Jian-Hua Yin, Jiong-Sheng Li, Wen-Ya Li
2012· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
venueno affno abstractunlabeled
Hamiltonicity of transformation graph G
Lingyan Zhen, Baoyindureng Wu
2013· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
venueno affno abstractunlabeled
Harmonic index of graphs with more than one cut-vertex.
J. Amalorpava Jerline, L. Benedict Michaelraj, K. Dhanalakshmi, P Syamala
2017· article· en· Ars Combinatoria· Mathematics
machine prediction:candidate · noneconsensus · none
1
citations
venueno affno abstractunlabeled
Isomorphisms of directed P 3 -graphs.
Yan Liu, Biao Zhao
2011· article· en· Ars Combinatoria· Engineering
machine prediction:candidate · noneconsensus · none
1
citations
venueno affno abstractunlabeled
Self-complementary magic squares.
Gek L. Chia, Angeline Lee
2014· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
venueno affno abstractunlabeled
Defensive alliances in circulant graphs.
Gabriela Araujo‐Pardo, Lali Barrière
2014· article· en· Ars Combinatoria· Mathematics
machine prediction:candidate · noneconsensus · none
1
citations
venueno affunlabeled
Critical sets for dihedral groups.
Ganesh Sittampalam, A.D. Keedwell
2001· article· en· Ars Combinatoria· Mathematics
machine prediction:candidate · noneconsensus · none
1
citations
venueno affno abstractunlabeled
The Geo-Number Of A Graph.
A. P. Santhakumaran, P. Titus
2012· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
venueno affno abstractunlabeled
On the interior H-points of H-polygons.
Xiao Feng, Penghao Cao, Liping Yuan
2015· article· en· Ars Combinatoria· Mathematics
machine prediction:candidate · noneconsensus · none
1
citations
← previousnext →

How this was built: Screen · Findings · About