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
Graph Theory and Algorithms
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.

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

Labels cover 2 of 423 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 423 of 423 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
LSQB
Amine Mhedhbi, Matteo Lissandrini, Laurens Kuiper, Jack Waudby, Gábor Szárnyas
2021· article· en· Computer Science
machine prediction:candidate · insufficient_payloadconsensus · none
22
citations
affno abstractunlabeled
Accelerating data filtering for database using FPGA
Xuan Sun, Chun Jason Xue, Jinghuan Yu, Tei‐Wei Kuo, Xue Liu
2020· article· en· Journal of Systems Architecture· Computer Science
machine prediction:candidate · noneconsensus · none
21
citations
afffundunlabeled
S+EPPs
Mariano P. Consens, Valeria Fionda, Shahan Khatchadourian, Giuseppe Pirrò
2015· article· en· Proceedings of the VLDB Endowment· Computer Science
machine prediction:candidate · noneconsensus · none
19
citations
affunlabeled
Finding locally densest subgraphs
Chenhao Ma, Reynold Cheng, Laks V. S. Lakshmanan, Xiaolin Han
2022· article· en· Proceedings of the VLDB Endowment· Computer Science
machine prediction:candidate · noneconsensus · none
19
citations
affno abstractunlabeled
WGB: Towards a Universal Graph Benchmark
Khaled Ammar, M. TAMER ÖZSU
2014· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
18
citations
affunlabeled
Enumerating Trillion Subgraphs On Distributed Systems
Ha-Myung Park, Francesco Silvestri, Rasmus Pagh, Chin‐Wan Chung, Sung-Hyon Myaeng, U Kang
2018· article· en· ACM Transactions on Knowledge Discovery from Data· Computer Science
machine prediction:candidate · noneconsensus · none
17
citations
affno abstractunlabeled
A New Median Graph Algorithm
Adel Hlaoui, Shengrui Wang
2003· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
17
citations
affunlabeled
Real-Time PageRank on Dynamic Graphs
Scott Sallinen, Juntong Luo, Matei Ripeanu
2023· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
15
citations
affno abstractunlabeled
A Graph Clustering Approach to Weak Motif Recognition
Christina Boucher, Daniel G. Brown, Paul Church
2007· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
15
citations
affno abstractunlabeled
Graph-Drawing Contest Report
Thérèse Biedl, Franz J. Brandenburg
2002· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
9
citations
affunlabeled
Graphsurge
Siddhartha Sahu, Semih Salihoğlu
2021· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
8
citations
← previousnext →

How this was built: Screen · Findings · About