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 2 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.

affno abstractunlabeled
Monotonicity of strong searching on digraphs
Boting Yang, Yi Cao
2007· article· en· Journal of Combinatorial Optimization· Computer Science
distilled prediction:candidate · noneconsensus · none
10
citations
affno abstractunlabeled
Convex partitions with 2-edge connected dual graphs
Marwan Al-Jubeh, Michael M. Hoffmann, Mashhood Ishaque, Diane L. Souvaine, Csaba D. Tóth
2010· article· en· Journal of Combinatorial Optimization· Computer Science
distilled prediction:candidate · noneconsensus · none
7
citations
affno abstractunlabeled
The robot cleans up
Margaret-Ellen Messinger, Richard J. Nowakowski
2009· article· en· Journal of Combinatorial Optimization· Computer Science
distilled prediction:candidate · noneconsensus · none
7
citations
affno abstractunlabeled
Paired versus double domination in K 1,r -free graphs
Paul Dorbec, Bert L. Hartnell, Michael A. Henning
2012· article· en· Journal of Combinatorial Optimization· Computer Science
distilled prediction:candidate · noneconsensus · none
6
citations
affno abstractunlabeled
On the oriented diameter of planar triangulations
Debajyoti Mondal, Indra Rajasingh
2024· article· en· Journal of Combinatorial Optimization· Computer Science
distilled prediction:candidate · noneconsensus · none
4
citations
afffundno abstractunlabeled
Fast searching on cactus graphs
Yuan Xue, Boting Yang, Sandra Zilles, Lusheng Wang
2023· article· en· Journal of Combinatorial Optimization· Computer Science
distilled prediction:candidate · noneconsensus · none
4
citations
afffundno abstractunlabeled
Graph Algorithms with Small Communication Costs
Jieliang Zhou, Patrick Dymond, Xiaotie Deng
2000· article· en· Journal of Combinatorial Optimization· Computer Science
distilled prediction:candidate · noneconsensus · none
3
citations
affno abstractunlabeled
The average size of maximal matchings in graphs
Alain Hertz, Sébastien Bonte, Gauvain Devillez, Hadrien Mélot
2024· article· en· Journal of Combinatorial Optimization· Mathematics
distilled prediction:candidate · noneconsensus · none
2
citations
affno abstractunlabeled
Galaxy cutsets in graphs
Nicolas Sonnerat, Adrian Vetta
2009· article· en· Journal of Combinatorial Optimization· Immunology and Microbiology
distilled prediction:candidate · noneconsensus · none
2
citations
affno abstractunlabeled
The critical node game
Gabriele Dragotto, Amine Boukhtouta, Andrea Lodi, Mehdi Taobane
2024· article· en· Journal of Combinatorial Optimization· Engineering
distilled prediction:candidate · noneconsensus · none
2
citations
affno abstractunlabeled
Shortest paths among transient obstacles
Anil Maheshwari, Arash Nouri, Jörg-Rüdiger Sack
2020· article· en· Journal of Combinatorial Optimization· Computer Science
distilled prediction:candidate · noneconsensus · none
2
citations
← previousnext →

How this was built: Screen · Findings · About