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

affno abstractunlabeled
Multi-terminal multipath flows: synthesis
R. Chandrasekaran, K. P. K. Nair, Y.P. Aneja, S.N. Kabadi
2004· article· en· Discrete Applied Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
12
citations
affno abstractunlabeled
Approximation Algorithms for Orienting Mixed Graphs
Michael Elberfeld, Danny Segev, Colin R. Davidson, Dana Silverbush, Roded Sharan
2011· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
12
citations
affunlabeled
Partitioning planar graphs with costs and weights
Lyudmil Aleksandrov, Hristo Djidjev, Hua Guo, Anil Maheshwari
2007· article· en· ACM Journal of Experimental Algorithmics· Computer Science
distilled prediction:candidate · noneconsensus · none
12
citations
affno abstractunlabeled
Ultimate Generalizations of LexBFS and LEX M
Anne Berry, Richard Krueger, Geneviève Simonet
2005· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
11
citations
affno abstractunlabeled
Maximum Constraint Satisfaction on Diamonds
Andrei Krokhin, Benoît Larose
2005· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
11
citations
affno abstractunlabeled
The complexity of tropical graph homomorphisms
Florent Foucaud, Ararat Harutyunyan, Pavol Hell, Sylvain Legay, Yannis Manoussakis, Reza Naserasr
2017· article· en· Discrete Applied Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
11
citations
afffundno abstractunlabeled
On P4-transversals of perfect graphs
Chı́nh T. Hoàng, Van Bang Lê
2000· article· en· Discrete Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
11
citations
affunlabeled
Computing planar intertwines
Ajay Gupta, Russell Impagliazzo
2002· article· en· Computer Science
distilled prediction:candidate · noneconsensus · none
11
citations
affno abstractunlabeled
Burning Two Worlds
Shahin Kamali, Avery Miller, Kenny Zhang
2020· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrow+open_scienceconsensus · none
11
citations
affno abstractunlabeled
Adjusted Interval Digraphs
Tomás Feder, Pavol Hell, Jing Huang, Arash Rafiey
2009· article· en· Electronic Notes in Discrete Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
11
citations
afffundno abstractunlabeled
A tie-break model for graph search
Derek G. Corneil, Jérémie Dusart, Michel Habib, Antoine Mamcarz, Fabien de Montgolfier
2015· article· en· Discrete Applied Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
11
citations
affunlabeled
On $t$-Common List-Colorings
Ho‐Jin Choi, Young Soo Kwon
2017· article· en· The Electronic Journal of Combinatorics· Computer Science
distilled prediction:candidate · noneconsensus · none
11
citations
affno abstractunlabeled
Near-perfect graphs with polyhedral
Silvia Bianchi, M. Escalante, Graciela Nasini, Levent Tunçel
2011· article· en· Electronic Notes in Discrete Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
11
citations
affunlabeled
Convex Bodies, Graphs and Partial Orders
Béla Bollobás, Graham R. Brightwel
2000· article· en· Proceedings of the London Mathematical Society· Computer Science
distilled prediction:candidate · noneconsensus · none
11
citations
afffundRetraction · OpenAlex missed itunlabeled
Quasi‐graphic matroids*
Jim Geelen, Bert Gerards, Geoff Whittle
2017· article· en· Journal of Graph Theory· Computer Science
distilled prediction:candidate · noneconsensus · none
11
citations
afffundno abstractunlabeled
Coloring face hypergraphs on surfaces
Zdenĕk Dvořák, Daniel Král͏̌, Riste Škrekovski
2004· article· en· European Journal of Combinatorics· Computer Science
distilled prediction:candidate · noneconsensus · none
11
citations
affno abstractunlabeled
Bipartite graphs are not universal fixers
Richard G. Gibson
2007· article· en· Discrete Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
11
citations
affunlabeled
On the Spanning and Routing Ratio of Theta-Four
Prosenjit Bose, Jean-Lou De Carufel, Darryl Hill, Michiel Smid
2019· book-chapter· en· Society for Industrial and Applied Mathematics eBooks· Computer Science
distilled prediction:candidate · noneconsensus · none
11
citations
afffundunlabeled
On Coloring a Class of Claw-free Graphs
Yingjun Dai, Angèle M. Foley, Chı́nh T. Hoàng
2019· article· en· Electronic Notes in Theoretical Computer Science· Computer Science
distilled prediction:candidate · open_scienceconsensus · none
10
citations
affno abstractunlabeled
On the Treewidth of NK Landscapes
Yong Gao, Joseph Culberson
2003· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
10
citations
afffundno abstractunlabeled
Local 7-coloring for planar subgraphs of unit disk graphs
Jurek Czyzowicz, Stefan Dobrev, Hernàn González-Aguilar, Evangelos Kranakis, Josef Opatrný, Ladislav Stacho +1 more
2010· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · stsconsensus · none
10
citations
affno abstractunlabeled
Acyclic coloring with few division vertices
Debajyoti Mondal, Rahnuma Islam Nishat, Md. Saidur Rahman, Sue Whitesides
2013· article· en· Journal of Discrete Algorithms· Computer Science
distilled prediction:candidate · noneconsensus · none
10
citations
afffundno abstractunlabeled
Some bounds on global alliances in trees
Ararat Harutyunyan
2011· article· en· Discrete Applied Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
10
citations
fundno affno abstractunlabeled
Domination in tournaments
Maria Chudnovsky, Ringi Kim, Chun‐Hung Liu, Paul Seymour, Stéphan Thomassé
2017· article· en· Journal of Combinatorial Theory Series B· Computer Science
distilled prediction:candidate · noneconsensus · none
10
citations

How this was built: Screen · Findings · About