MétaCan
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.

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

afffundunlabeled
The Mondrian Kernel
Matej Balog, Balaji Lakshminarayanan, Zoubin Ghahramani, Daniel M. Roy, Yee Whye Teh
2016· preprint· en· arXiv (Cornell University)· Computer Science
machine prediction:candidate · noneconsensus · none
8
citations
afffundno abstractunlabeled
Extremal hypergraphs for Ryser's Conjecture
Penny Haxell, Lothar Narins, Tibor Szabó
2018· article· en· Journal of Combinatorial Theory Series A· Computer Science
machine prediction:candidate · noneconsensus · none
8
citations
afffundno abstractunlabeled
Counting maps on doughnuts
Timothy R. Walsh
2011· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
7
citations
afffundno abstractunlabeled
Geometric Construction of a Coboundary of a Cycle
Madjid Állili, Tomasz Kaczyński
2001· article· en· Discrete & Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
7
citations
affunlabeled
TopoSeg: Topology-aware Segmentation for Point Clouds
Weiquan Liu, Hanyun Guo, Weini Zhang, Yu Zang, Cheng Wang, Jonathan Li
2022· article· en· Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence· Computer Science
machine prediction:candidate · noneconsensus · none
7
citations
afffundunlabeled
Bump hunting by topological data analysis
Max Sommerfeld, Giseon Heo, Peter Kim, Stephen Rush, J. S. Marron
2017· article· en· Stat· Computer Science
machine prediction:candidate · noneconsensus · none
7
citations
affunlabeled
Morse homology descriptor for shape characterization
Madjid Állili, David Corriveau, Djemel Ziou
2004· article· en· Proceedings of the 17th International Conference on Pattern Recognition, 2004. ICPR 2004.· Computer Science
machine prediction:candidate · noneconsensus · none
7
citations
affno abstractunlabeled
Small cones of m-hemimetrics
Michel Deza, Ivo G. Rosenberg
2005· article· en· Discrete Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
7
citations
afffundunlabeled
Topological structure of dictionary graphs
Henryk Fukś, Mark Krzemiński
2009· article· en· Journal of Physics A Mathematical and Theoretical· Computer Science
machine prediction:candidate · noneconsensus · none
6
citations
affno abstractunlabeled
Removing uncertainty in neural networks
Arturo Tozzi, James F. Peters
2020· article· en· Cognitive Neurodynamics· Computer Science
machine prediction:candidate · noneconsensus · none
6
citations
afffundno abstractunlabeled
Simplices and Spectra of Graphs
Bojan Mohar, Igor Rivin
2009· article· en· Discrete & Computational Geometry· Computer Science
machine prediction:candidate · noneconsensus · none
6
citations
affunlabeled
Bulk-boundary correspondence in soft matter
M. Ramazanoglu, Şener Özönder, R. Salci
2019· article· en· Physical review. E· Computer Science
machine prediction:candidate · noneconsensus · none
5
citations
affno abstractunlabeled
Topological Sorting of Finitely Near Sets
I. Dochviri, James F. Peters
2016· article· en· Mathematics in Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
5
citations
fundno affno abstractunlabeled
A topological approach to mapping space signatures
Chad Giusti, Darrick Lee, Vidit Nanda, Harald Oberhauser
2024· article· en· Advances in Applied Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
4
citations
venueno affunlabeled
Simplicial flat norm with scale
Sharif Ibrahim, Bala Krishnamoorthy, Kevin R. Vixie
2012· article· en· Journal of Computational Geometry (Carleton University)· Computer Science
machine prediction:candidate · noneconsensus · none
4
citations
affunlabeled
Synthetic Differential Topology
Marta Bunge, Felipe Gago, Ana María San Luis
2018· book-chapter· en· Cambridge University Press eBooks· Computer Science
machine prediction:candidate · noneconsensus · none
4
citations

How this was built: Screen · Findings · About