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
Algorithmica
Topic
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.

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

Labels cover 0 of 232 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 232 of 232 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
Travelling on Graphs with Small Highway Dimension
Yann Disser, Andreas Emil Feldmann, Max Klimm, Jochen Könemann
2021· article· en· Algorithmica· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Galloping in Fast-Growth Natural Merge Sorts
Elahe Ghasemi, Vincent Jugé, Ghazal Khalighinejad, Helia Yazdanyar
2024· article· en· Algorithmica· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Tile-Packing Tomography Is $\mathbb{NP}$ -hard
Marek Chrobák, Christoph Dürr, Flavio Guíñez, Antoni Lozano, Nguyễn Kim Thắng
2011· article· en· Algorithmica· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Routing Regardless of Network Stability
Bundit Laekhanukit, Adrian Vetta, Gordon Wilfong
2014· article· en· Algorithmica· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Finding Optimal Solutions with Neighborly Help
Elisabet Burjons, Fabian Frei, Edith Hemaspaandra, Dennis Komm, David Wehner
2024· article· en· Algorithmica· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Foreword from the Guest Editors
Frédéric Magniez, Ashwin Nayak
2008· article· en· Algorithmica· Social Sciences
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Introduction to Special Issue
Frank Dehne, Jörg-Rüdiger Sack
2007· article· en· Algorithmica· Social Sciences
machine prediction:candidate · insufficient_payloadconsensus · none
0
citations
affno abstractunlabeled
Introduction
Michele Mosca, Alain Tapp
2002· article· en· Algorithmica
machine prediction:candidate · insufficient_payloadconsensus · none
0
citations
affunlabeled
Algebraic Restriction Codes and Their Applications
Divesh Aggarwal, Nico Döttling, Jesko Dujmovic, Mohammad Hajiabadi, Giulio Malavolta, Maciej Obremski
2023· article· en· Algorithmica· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Guest Editors’ Foreword
Prosenjit Bose, Pat Morin
2005· article· en· Algorithmica· Social Sciences
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Editorial, COCOON 2007 Special Issue
Guohui Lin, Zhipeng Cai
2008· article· en· Algorithmica· Arts and Humanities
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Symmetry Breaking in the Plane
Jurek Czyzowicz, Leszek Gąsieniec, Ryan Killick, Evangelos Kranakis
2024· article· en· Algorithmica· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Subgraphs of 4-Regular Planar Graphs
Chris Dowden, Louigi Addario‐Berry
2010· article· en· Algorithmica· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations

How this was built: Screen · Findings · About