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
Advanced Graph Theory Research
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.

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

Labels cover 3 of 2,515 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 2,515 of 2,515 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.

affno abstractunlabeled
Algorithms for Generating Strongly Chordal Graphs
Asish Mukhopadhyay, Md. Zamilur Rahman
2021· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affunlabeled
A note on the spatiality degree of graphs.
Pierluigi Crescenzi, Sergio De Agostino, Riccardo Silvestri
2002· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
afffundunlabeled
List homomorphisms to separable signed graphs
Jan Bok, Richard C. Brewster, Tomás Feder, Pavol Hell, Nikola Jedličková
2023· preprint· en· arXiv (Cornell University)· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
afffundunlabeled
An introduction to the deduction number
Andrea C. Burgess, Danny Dyer, M. Shahrabi Farahani
2025· article· en· Discrete Applied Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Counting Homomorphisms in Plain Exponential Time
Andreǐ A. Bulatov, Amineh Dadsetan
2018· preprint· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Naji's characterization of circle graphs
Jim Geelen, Edward Lee
2018· preprint· en· arXiv (Cornell University)· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
afffundunlabeled
Surjective H-Colouring over Reflexive Digraphs
Benoît Larose, Barnaby Martin, Daniël Paulusma
2018· preprint· en· ACM Transactions on Computation Theory· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Robust geometric spanners
Prosenjit Bose, Vida Dujmović, Pat Morin, Michiel Smid
2013· preprint· en· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
afffundno abstractunlabeled
The circular chromatic number of hypergraphs
Richard C. Brewster, Gary MacGillivray, Laura Shepherd
2008· article· en· Discrete Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
afffundno abstractunlabeled
H-coloring degree-bounded (acyclic) digraphs
Pavol Hell, Aurosish Mishra
2014· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
fundno affunlabeled
Maximum rectilinear convex subsets
Hernàn González-Aguilar, David Orden, Pablo Pérez-Lantero, David Rappaport, Carlos Seara, Javier Tejel +1 more
2019· preprint· en· arXiv (Cornell University)· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Immersing complete digraphs
Matt DeVos, Jessica McDonald, Bojan Mohar, Diego Scheide
2011· preprint· en· arXiv (Cornell University)· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
afffundunlabeled
The complexity of frugal colouring
Stefan Bard, Gary MacGillivray, Shayla Redlin
2021· article· en· Arabian Journal of Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Heterogeneous Graph
2014· book-chapter· en· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Computing monotone disjoint paths on polytopes
David Avis, Bohdan Kaluzny
2008· article· en· Journal of Combinatorial Optimization· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Simplifying the Weft Hierarchy
Jonathan F. Buss, Tarique Islam
2004· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations

How this was built: Screen · Findings · About