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

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

Labels cover 0 of 145 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 145 of 145 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.

affunlabeled
Cooperative covering problems on networks
Igor Averbakh, Oded Berman, Dmitry Krass, Jörg Kalcsics, Stefan Nickel
2014· article· en· Networks· Business, Management and Accounting
machine prediction:candidate · noneconsensus · none
19
citations
afffundunlabeled
The preemptive swapping problem on a tree
Shoshana Anily, Michel Gendreau, Gilbert Laporte
2011· article· en· Networks· Engineering
machine prediction:candidate · noneconsensus · none
19
citations
afffundunlabeled
Nonadaptive broadcasting in trees
Hovhannes A. Harutyunyan, Arthur L. Liestman, Kazuhisa Makino, Thomas C. Shermer
2010· article· en· Networks· Computer Science
machine prediction:candidate · noneconsensus · none
12
citations
afffundunlabeled
Efficient communication in unknown networks
Luisa Gargano, Andrzej Pelc, Stéphane Pérennès, Ugo Vaccaro
2001· article· en· Networks· Biochemistry, Genetics and Molecular Biology
machine prediction:candidate · noneconsensus · none
11
citations
afffundunlabeled
The Rainbow Cycle Cover Problem
Selene Silvestri, Gilbert Laporte, Raffaele Cerulli
2016· article· en· Networks· Computer Science
machine prediction:candidate · noneconsensus · none
9
citations
affunlabeled
Plowing with precedence in polynomial time
Rodrigo Alexander Castro Campos, Cynthia A. Rodríguez Villalobos, Francisco Javier Zaragoza Martínez
2020· article· en· Networks· Computer Science
machine prediction:candidate · noneconsensus · none
5
citations
afffundunlabeled
New approximations for network reliability
Jason I. Brown, Théodore Kolokolnikov, Robert E. Kooij
2024· article· en· Networks· Engineering
machine prediction:candidate · noneconsensus · none
4
citations

How this was built: Screen · Findings · About