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
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 teacher distillation outputs. Candidate is the union; consensus is the intersection.

aboutno affunlabeled
graph-archive.rar
2018· dataset· en· Figshare· Computer Science
distilled prediction:candidate · metaepi_narrow+insufficient_payloadconsensus · insufficient_payload
0
citations
aboutno affunlabeled
The Looking Glass. Vol. 15 No. 2 (2011)
2011· article· en· Figshare· Computer Science
distilled prediction:candidate · insufficient_payloadconsensus · insufficient_payload
0
citations
affno abstractunlabeled
Graph burning
2022· book-chapter· en· Student mathematical library· Computer Science
distilled prediction:candidate · metaepi_narrow+insufficient_payloadconsensus · none
0
citations
affno abstractunlabeled
Graph searching
2022· book-chapter· en· Student mathematical library· Computer Science
distilled prediction:candidate · metaepi_narrow+insufficient_payloadconsensus · none
0
citations
venueno affno abstractunlabeled
10.1145/3712285.3787178
2000· article· en· Time to knit· Computer Science
distilled prediction:candidate · insufficient_payloadconsensus · insufficient_payload
0
citations
venueno affno abstractunlabeled
10.1145/3725843.3786401
2000· article· en· Time to knit· Computer Science
distilled prediction:candidate · insufficient_payloadconsensus · insufficient_payload
0
citations
affunlabeled
graph_api_counts.tab
2019· dataset· en· Harvard Dataverse· Computer Science
distilled prediction:candidate · metaepi_narrow+insufficient_payloadconsensus · insufficient_payload
0
citations
affunlabeled
TCR/CAR antagonism: theoretical modeling
2025· other· en· Zenodo (CERN European Organization for Nuclear Research)· Computer Science
distilled prediction:candidate · scholarly_communication+insufficient_payloadconsensus · insufficient_payload
0
citations
affunlabeled
Hockey Lines
2025· dataset· en· Borealis· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Continuous Monte Carlo Graph Search
2024· article· en· Aaltodoc (Aalto University)· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Corrigendum to "Best match graphs"
2021· article· en· Greater South Information System· Computer Science
distilled prediction:candidate · insufficient_payloadconsensus · none
0
citations
aboutno affunlabeled
Peter Andreas Hochuli (1946–2018)
2018· article· de· Open MIND· Computer Science
distilled prediction:candidate · metaepi_narrow+scholarly_communication+insufficient_payloadconsensus · insufficient_payload
0
citations
affno abstractunlabeled
Portfolios of Subgraph Isomorphism Algorithms
2016· article· en· HAL (Le Centre pour la Communication Scientifique Directe)· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Graph Querying or Similarity Search? Both!
2025· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
0
citations
aboutno affunlabeled
Preface
2023· article· en· Acta Cybernetica· Computer Science
distilled prediction:candidate · insufficient_payloadconsensus · none
0
citations
← previousnext →

How this was built: Screen · Findings · About