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 21 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
Implicit degree sum condition for long cycles.
Junqing Cai, Yu Lian, Jinzhuan Cai
2017· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
venueno affno abstractunlabeled
Trees Which Admit No alpha-labelings
Chin-Lin Shiue, Hui-Chuan Lu
2012· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
venueno affno abstractunlabeled
On Motzkin words and noncrossing partitions.
A. Panayotolpoulos, A. Sapounakis
2003· article· en· Ars Combinatoria· Mathematics
machine prediction:candidate · noneconsensus · none
2
citations
venueno affno abstractunlabeled
On Generalized Triple Derivations On Lattices.
Zafar Ullah, Imran Javaid, Muhammad Anwar Chaudhry
2014· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
venueno affunlabeled
On Lanzhou Index of Graphs
Somnath Bera, Kinkar Chandra Das
2023· article· en· Ars Combinatoria· Mathematics
machine prediction:candidate · noneconsensus · none
2
citations
venueno affunlabeled
On Graphs with Strong a-valuations.
Saad I. El‐Zanati, Charles Vanden Eynden
2000· article· en· Ars Combinatoria· Mathematics
machine prediction:candidate · noneconsensus · none
2
citations
venueno affno abstractunlabeled
n-Colour Even Compositions.
Yuhong Guo
2013· article· en· Ars Combinatoria· Physics and Astronomy
machine prediction:candidate · noneconsensus · none
2
citations
venueno affno abstractunlabeled
Some Notes on Combination Graphs.
M. A. Seoud, Manal N. Al-Harere
2016· article· en· Ars Combinatoria· Engineering
machine prediction:candidate · noneconsensus · none
2
citations
venueno affno abstractunlabeled
Average degrees of critical graphs.
Xuechao Li
2005· article· en· Ars Combinatoria· Mathematics
machine prediction:candidate · noneconsensus · none
2
citations
venueno affno abstractunlabeled
On the diameter of integral circulant graphs.
Dragan Stevanović, Marko D. Petković, Milan Bašić
2012· article· en· Ars Combinatoria· Mathematics
machine prediction:candidate · noneconsensus · none
2
citations
venueno affunlabeled
Long Cycles in 2-Connected Triangle-Free Graphs.
Douglas C. Bauer, Nathan Kahl, Linda E. McGuire, E. F. Schmeichel
2008· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
venueno affunlabeled
Dimensions for Cographs.
Terry A. McKee
2000· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · insufficient_payloadconsensus · none
2
citations
venueno affno abstractunlabeled
Symmetric Designs and Self-Dual Codes over Rings.
Steven T. Dougherty, T. Aaron Gulliver, Reshma Ramadurai
2007· article· en· Ars Combinatoria· Engineering
machine prediction:candidate · noneconsensus · none
2
citations
venueno affno abstractunlabeled
Vertex PI indices of some sums of graphs.
LI Shu-hua, Hong Bian, Guoping Wang, Haizheng Yu
2011· article· en· Ars Combinatoria· Mathematics
machine prediction:candidate · noneconsensus · none
2
citations
venueno affunlabeled
Vertex-Disjoint K1, t's in Graphs.
Shinya Fujita
2002· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
← previousnext →

How this was built: Screen · Findings · About