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 45 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
Perfect -latin squares.
Kevin G. Hare
2002· article· en· Ars Combinatoria· Engineering
machine prediction:candidate · noneconsensus · none
0
citations
venueno affno abstractunlabeled
On the Disarrangements with k Cycles.
QI Deng-ji, Xiuli Li
2010· article· en· Ars Combinatoria· Engineering
machine prediction:candidate · noneconsensus · none
0
citations
venueno affno abstractunlabeled
Note on the choosability of bipartite graphs.
Guoping Wang, Qiongxiang Huang
2010· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affno abstractunlabeled
Tough-Maximum Graphs.
S.A. Choudum, N.Shanmuga Priya
2001· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affno abstractunlabeled
Szeged Index of HC5C7[r, p] Nanotube.
A. Iranmanesh, Y. Pakravesh, A. Mahmiani
2008· article· hu· Ars Combinatoria· Chemistry
machine prediction:candidate · noneconsensus · none
0
citations
venueno affno abstractunlabeled
Maximal Separation On 2-D Arrays.
Jim Tao, Wenqing Xu
2012· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affunlabeled
Illuminating a Graph
Wayne Goddard, Deirdre LaVey
2024· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affno abstractunlabeled
Small 2-factors of Bipartite Graphs.
Peter Horák, Edward A. Bertram, Samah Said Mohammed
2001· article· en· Ars Combinatoria· Engineering
machine prediction:candidate · noneconsensus · none
0
citations
venueno affno abstractunlabeled
Some Nonbinary Power Residue Codes.
T. Aaron Gulliver, Vijay K. Bhargava
2000· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affno abstractunlabeled
On E 4 -Cordial Graphs.
M. I. Jinnah, S. Beena
2015· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affno abstractunlabeled
Two families of graphs that are not CCE-orientable
David Fisher, Suh-Ryung Kim, Chang-Hoon Park, Yunsun Nam
2001· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affno abstractunlabeled
Nearly antipodal chromatc number of even paths.
Yufa Shen, Jun Guo, Xin Xiao, Qing Tang
2011· article· en· Ars Combinatoria· Arts and Humanities
machine prediction:candidate · noneconsensus · none
0
citations
venueno affno abstractunlabeled
Maximal-clique Partitions of Different Sizes.
Chariya Uiyyasathian, Kathryn Fraughnaugh
2005· article· en· Ars Combinatoria· Engineering
machine prediction:candidate · noneconsensus · none
0
citations
venueno affno abstractunlabeled
Antimagic labelings of Msbius grids.
Martin Bača, Yuqing Lin, Mirka Miller, Joseph F. Ryan
2006· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affno abstractunlabeled
On the Cordiality of D(1, 3) Graphs.
Chenmin Ni, Zhishan Liu
2014· article· en· Ars Combinatoria· Engineering
machine prediction:candidate · noneconsensus · none
0
citations
venueno affunlabeled
Colourfully panconnected subgraphs II.
Douglas R. Woodall
2012· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affno abstractunlabeled
Embedding of Hypercubes into Generalized Books.
R. Sundara Rajan, Indra Rajasingh, Micheal Arockiaraj, T. M. Rajalaxmi, B. Mahavir
2017· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affno abstractunlabeled
Two Families of Lattices.
Zengti Li, Fengru Deng
2011· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
← previousnext →

How this was built: Screen · Findings · About