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

aboutno affunlabeled
graph-archive.rar
A. Chaouche
2018· dataset· en· Figshare· Computer Science
machine prediction:candidate · insufficient_payloadconsensus · none
0
citations
affno abstractunlabeled
Graph burning
2022· book-chapter· en· Student mathematical library· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Graph searching
Anthony Bonato
2022· book-chapter· en· Student mathematical library· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affno abstractunlabeled
10.1145/3712285.3787178
AI Generated
2000· article· en· Time to knit· Computer Science
machine prediction:candidate · insufficient_payloadconsensus · insufficient_payload
0
citations
venueno affno abstractunlabeled
10.1145/3725843.3786401
AI Generated
2000· article· en· Time to knit· Computer Science
machine prediction:candidate · insufficient_payloadconsensus · insufficient_payload
0
citations
affunlabeled
graph_api_counts.tab
Asura Enkhbayar, Stefanie Haustein, Juan Pablo Alperín
2019· dataset· en· Harvard Dataverse· Computer Science
machine prediction:candidate · insufficient_payloadconsensus · none
0
citations
affunlabeled
TCR/CAR antagonism: theoretical modeling
2025· other· en· Zenodo (CERN European Organization for Nuclear Research)· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Hockey Lines
2025· dataset· en· Borealis· Computer Science
machine prediction:candidate · insufficient_payloadconsensus · none
0
citations
affunlabeled
Continuous Monte Carlo Graph Search
2024· article· en· Aaltodoc (Aalto University)· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Corrigendum to "Best match graphs"
2021· article· en· Greater South Information System· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Portfolios of Subgraph Isomorphism Algorithms
Lars Kotthoff, Ciaran McCreesh
2016· article· en· HAL (Le Centre pour la Communication Scientifique Directe)· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affunlabeled
The edge surviving rate of Halin graphs
Xiaoxue Hu, Wenting Guo, Yanjun Qi, Jiangxu Kong
2025· article· en· Utilitas Mathematica· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Graph Querying or Similarity Search? Both!
Vicente Calisto, Sebastián Ferrada, Gonzalo Navarro, Juan L. Reutter, Javier Sánchez, Domagoj Vrgoč
2025· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
MULTI-RESOLUTION REPRESENTATION USING GRAPH DATABASE
Yan Huang, Emmanuel Stefanakis
2022· article· en· ISPRS annals of the photogrammetry, remote sensing and spatial information sciences· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
aboutno affunlabeled
Preface
Andreas Rauh, Balázs Bánhelyi
2023· article· en· Acta Cybernetica· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
← previousnext →

How this was built: Screen · Findings · About