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
Topological and Geometric Data Analysis
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.

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

Labels cover 0 of 390 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 390 of 390 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
Bounds on spectral norms and barcodes
Asaf Kislev, Egor Shelukhin
2021· preprint· en· Geometry & Topology· Computer Science
machine prediction:candidate · noneconsensus · none
21
citations
afffundno abstractunlabeled
Computing the Monge–Kantorovich distance
Franklin Mendivil
2016· article· en· Computational and Applied Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
15
citations
affunlabeled
Voxelization in common sampling lattices
Haris Widjaya, Torsten Möller, Alireza Entezari
2004· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
12
citations
affunlabeled
Colourful theorems and indices of homomorphism complexes
Gábor Simonyi, Claude Tardif, Ambrus Zsbán
2013· article· en· Repository of the Academy's Library (Library of the Hungarian Academy of Sciences)· Computer Science
machine prediction:candidate · noneconsensus · none
11
citations
affunlabeled
Barcode embeddings for metric graphs
Steve Oudot, Elchanan Solomon
2021· article· en· Algebraic & Geometric Topology· Computer Science
machine prediction:candidate · noneconsensus · none
10
citations
afffundno abstractunlabeled
Oriented Interval Greedoids
Franco Saliola, Hugh Thomas
2011· article· en· Discrete & Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
10
citations
venueno affunlabeled
Minimum cycle and homology bases of surface-embedded graphs
Glencora Borradaile, Erin Wolf Chambers, Kyle Fox, Amir Nayyeri
2017· article· en· Journal of Computational Geometry (Carleton University)· Computer Science
machine prediction:candidate · noneconsensus · none
8
citations
← previousnext →

How this was built: Screen · Findings · About