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
Complexity and Algorithms in Graphs
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.

755 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.
755 works in the cohort · of 4,299,418page 3 of 16

Labels cover 0 of 755 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 755 of 755 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
Computing all the best swap edges distributively
Paola Flocchini, Linda Pagli, Giuseppe Prencipe, Nicola Santoro, Peter Widmayer
2008· article· en· Journal of Parallel and Distributed Computing· Computer Science
machine prediction:candidate · noneconsensus · none
27
citations
affno abstractunlabeled
Randomized distributed decision
Pierre Fraigniaud, Mika Göös, Amos Korman, Merav Parter, David Peleg
2014· article· en· Distributed Computing· Computer Science
machine prediction:candidate · noneconsensus · none
26
citations
affno abstractunlabeled
Efficient Many-To-Many Point Matching in One Dimension
Justin Colannino, Mirela Damian, Ferrán Hurtado, Stefan Langerman, Henk Meijer, Suneeta Ramaswami +2 more
2007· article· en· Graphs and Combinatorics· Computer Science
machine prediction:candidate · noneconsensus · none
25
citations
affunlabeled
Uniform Hardness Amplification in NP via Monotone Codes
Joshua Buresh-Oppenheim, Valentine Kabanets, Rahul Santhanam
2006· article· en· Electronic colloquium on computational complexity· Computer Science
machine prediction:candidate · noneconsensus · none
24
citations
affno abstractunlabeled
Cut problems in graphs with a budget constraint
Roee Engelberg, Jochen Könemann, Stefano Leonardi, Joseph Naor
2006· article· en· Journal of Discrete Algorithms· Computer Science
machine prediction:candidate · noneconsensus · none
23
citations
afffundno abstractunlabeled
Hypergraphic LP Relaxations for Steiner Trees
Deeparnab Chakrabarty, Jochen Könemann, David Pritchard
2010· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
23
citations
affunlabeled
Pebbles and Branching Programs for Tree Evaluation
Stephen Cook, Pierre McKenzie, Dustin Wehr, Mark Braverman, Rahul Santhanam
2012· article· en· ACM Transactions on Computation Theory· Computer Science
machine prediction:candidate · noneconsensus · none
23
citations
fundno affunlabeled
Information Equals Amortized Communication
Mark Braverman, Anup Rao
2011· preprint· en· arXiv (Cornell University)· Computer Science
machine prediction:candidate · noneconsensus · none
22
citations
affno abstractunlabeled
Priority algorithms for graph optimization problems
Allan Borodin, Joan Boyar, Kim S. Larsen, Nazanin Mirmohammadi
2009· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
21
citations
affno abstractunlabeled
Critical Facets of the Stable Set Polytope
László Lipták, László Lovász
2001· article· en· COMBINATORICA· Computer Science
machine prediction:candidate · noneconsensus · none
21
citations
affvenueunlabeled
Connectivity in Hypergraphs
2018· article· en· Canadian Mathematical Bulletin· Computer Science
machine prediction:candidate · noneconsensus · none
21
citations
afffundno abstractunlabeled
Topology recognition with advice
Emanuele G. Fusco, Andrzej Pelc, Rossella Petreschi
2016· article· en· Information and Computation· Computer Science
machine prediction:candidate · noneconsensus · none
20
citations
affunlabeled
Randomized Communication vs. Partition Number.
Mika Göös, T. S. Jayram, Toniann Pitassi, Thomas Watson
2015· article· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Computer Science
machine prediction:candidate · noneconsensus · none
19
citations
affno abstractunlabeled
Steiner k-Edge Connected Subgraph Polyhedra
Mohamed Didi Biha, A. Ridha Mahjoub
2000· article· en· Journal of Combinatorial Optimization· Computer Science
machine prediction:candidate · noneconsensus · none
19
citations

How this was built: Screen · Findings · About