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 27 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
Bounds of q-factorial [n] q !
Mohamed Mansour, Mustafa A. A. Obaid
2011· article· en· Ars Combinatoria· Mathematics
machine prediction:candidate · noneconsensus · none
1
citations
venueno affno abstractunlabeled
Toughness and [a, b]-factors in graphs.
Renying Chang, Yan Zhu, Guizhen Liu
2012· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
venueno affno abstractunlabeled
On k-connected restrained domination in graphs.
Hongyu Chen, Xue-gang Chen, Xiang Tan
2011· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
venueno affno abstractunlabeled
A Class of Optimal Quaternary Codes.
Kishore Sinha, Neelam Sinha
2010· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
venueno affno abstractunlabeled
On the Recursive Sequence Order-k.
Tugba Parpar, Ayşe Nallı
2012· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
venueno affno abstractunlabeled
On Cordial Labelings of Fans with Other Graphs.
Adel T. Diab, Sayed Anwar Elsaid Mohammed
2012· 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 affunlabeled
Permutations with interval cycles.
Arnold Knopfmacher, Augustine O. Munagi
2012· article· en· Ars Combinatoria· Mathematics
machine prediction:candidate · noneconsensus · none
1
citations
venueno affunlabeled
Royal Colorings of Graphs
Gary Chartrand, James Hallas, Ping Zhang
2023· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
venueno affunlabeled
Extremal Size In Graphs With Bounded Degree.
Krystyna T. Balińska, Louis V. Quintas, Krzysztof T. Zwierzyński
2006· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
venueno affno abstractunlabeled
The Niche Category of Dense Graphs.
Steve Bowser, Charles Cable
2001· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
venueno affno abstractunlabeled
Neighbourly regular strength of a graph.
Selvam Avadayappan, M. Muthuchelvam
2016· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
venueno affno abstractunlabeled
On the Three Color Ramsey Numbers R(Cm, C4, C4).
Yongqi Sun, Yuansheng Yang, Xiaohui Lin, Wenping Zheng
2007· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
venueno affunlabeled
Two-Dimensional Bandwidth of Graphs.
Jianxiu Hao
2005· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
venueno affno abstractunlabeled
Bishop Covers of Rectangular Boards.
David Fisher, Paul Thalos
2002· article· en· Ars Combinatoria· Engineering
machine prediction:candidate · noneconsensus · none
1
citations
venueno affno abstractunlabeled
A note on integral sum crowns.
G. Suresh Singh, G. Santhosh
2003· article· en· Ars Combinatoria· Engineering
machine prediction:candidate · noneconsensus · none
1
citations
venueno affno abstractunlabeled
On f-Derivations Of B-Algebras.
Alev Firat, Şule Ayar Özbal
2011· article· en· Ars Combinatoria· Decision Sciences
machine prediction:candidate · noneconsensus · none
1
citations
venueno affno abstractunlabeled
On a new Stirling's series.
Mohamed Mansour, Mustafa A. A. Obaid
2012· article· en· Ars Combinatoria· Mathematics
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
Uniform Step Magic Squares Revisited.
Livinus U. Uko
2004· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
venueno affno abstractunlabeled
Disjoint cycles in directed graphs.
Jin Yan
2018· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
venueno affno abstractunlabeled
On The Average Crosscap Number Of A Graph.
Yunsheng Zhang, Yichao Chen, Yanpei Liu
2013· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
venueno affno abstractunlabeled
On Connected m-K 2 -Residual Graphs.
Huiming Duan, Bo Zeng, Jin Liying
2016· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
← previousnext →

How this was built: Screen · Findings · About