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
Topic
Complexity and Algorithms in Graphs
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.

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

Labels cover 0 of 755 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 755 of 755 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.

affunlabeled
Mapping the MPM maximum flow algorithm on GPUs
Steven Davidoff Solomon, Parimala Thulasiraman
2010· article· en· Journal of Physics Conference Series· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affunlabeled
On the Complexity of Succinct Zero-Sum Games
Lance Fortnow, Russell Impagliazzo, Valentine Kabanets, Christopher Umans
2005· article· en· Computational Complexity· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affunlabeled
Approximation algorithms for hitting subgraphs
Noah Brüstle, Tal Elbaz, Hamed Hatami, Onur Kocer, Bingchan Ma
2020· preprint· en· arXiv (Cornell University)· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affunlabeled
Polynomial Time with Restricted Use of Randomness
Matei David, Periklis A. Papakonstantinou, Anastasios Sidiropoulos
2009· article· en· Electronic colloquium on computational complexity· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affunlabeled
Distributed Quantum Advantage for Local Problems
Alkida Balliu, Sebastian Brandt, Xavier Coiteux-Roy, Francesco d’Amore, Massimo Equi, François Le Gall +7 more
2025· preprint· en· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
fundno affunlabeled
Lower Bounds for Set-Multilinear Branching Programs
Prerona Chatterjee, Deepanshu Kush, Shubhangi Saraf, Amir Shpilka
2023· preprint· en· arXiv (Cornell University)· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
afffundno abstractunlabeled
Two-stage BP maximization under p-matroid constraint
Hong Chang, Jing Jin, Zhicheng Liu, Donglei Du, Xiaoyan Zhang
2024· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
fundno affno abstractunlabeled
Path Cover Problems withLength Cost
Kenya Kobayashi, Guohui Lin, Eiji Miyano, Toshiki Saitoh, AKIRA SUZUKI, Tadatoshi Utashima +1 more
2022· article· en· Institutional Repositories DataBase (IRDB)· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Finding Hamiltonian paths in tournaments on clusters
Chun-Hsi Huang, Sanguthevar Rajasekaran, Laurence T. Yang, Xin He
2006· article· en· Cluster Computing· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
afffundunlabeled
Polynomial property testing
Lior Gishboliner, A. Shapira
2025· article· en· Computer Science Review· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
afffundunlabeled
Stabilizing Weighted Graphs
Zhuan Khye Koh, Laura Sanità
2020· preprint· en· Mathematics of Operations Research· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
k-Cores
2018· book-chapter· en· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Complexity Column
Andreǐ A. Bulatov
2024· article· en· ACM SIGLOG News· Computer Science
machine prediction:candidate · insufficient_payloadconsensus · none
0
citations
← previousnext →

How this was built: Screen · Findings · About