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
Journal of Combinatorial Optimization
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.

133 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.
133 works in the cohort · of 4,299,418page 3 of 3

Labels cover 1 of 133 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 133 of 133 works in this cohort. Predictions are machine_predicted_unvalidated teacher distillation outputs. Candidate is the union; consensus is the intersection.

afffundno abstractunlabeled
A 0.5358-approximation for Bandpass-2
Liqin Huang, Weitian Tong, Randy Goebel, Tian Liu, Guohui Lin
2013· article· en· Journal of Combinatorial Optimization· Computer Science
distilled prediction:candidate · noneconsensus · none
2
citations
affno abstractunlabeled
Well paired-dominated graphs
Shannon L. Fitzpatrick, Bert L. Hartnell
2008· article· en· Journal of Combinatorial Optimization· Computer Science
distilled prediction:candidate · noneconsensus · none
1
citations
affno abstractunlabeled
Algorithms for local similarity between forests
Zhewei Liang, Kaizhong Zhang
2013· article· en· Journal of Combinatorial Optimization· Biochemistry, Genetics and Molecular Biology
distilled prediction:candidate · noneconsensus · none
1
citations
affno abstractunlabeled
The frustum network model based on clique extension
Anthony Bonato, Ryan Cushman, Trent G. Marbach, Zhiyuan Zhang
2024· article· en· Journal of Combinatorial Optimization· Computer Science
distilled prediction:candidate · noneconsensus · none
1
citations
affno abstractunlabeled
Linear time algorithms on mirror trees
Alain Quilliot, Djamal Rebaïne
2022· article· en· Journal of Combinatorial Optimization· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Editorial: In memoriam: Yong He (1969–2005)
Guohui Lin, Zhiyi Tan
2006· editorial· en· Journal of Combinatorial Optimization· Social Sciences
distilled prediction:candidate · metaepi_narrow+research_integrityconsensus · none
0
citations
affno abstractunlabeled
On Some Polyhedra Covering Problems
Cao An Wang, Boting Yang, Binhai Zhu
2000· article· en· Journal of Combinatorial Optimization· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
fundno affno abstractunlabeled
Client assignment problems for latency minimization
Gruiă Cälinescu, Xiaolang Wang
2018· article· en· Journal of Combinatorial Optimization· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Computing monotone disjoint paths on polytopes
David Avis, Bohdan Kaluzny
2008· article· en· Journal of Combinatorial Optimization· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
← previous

How this was built: Screen · Findings · About