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
Interconnection Networks and Systems
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.

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

Labels cover 0 of 1,044 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 1,044 of 1,044 works in this cohort. Predictions are machine_predicted_unvalidated teacher distillation outputs. Candidate is the union; consensus is the intersection.

affno abstractunlabeled
Cube Precomputation
2009· book-chapter· en· Encyclopedia of Database Systems· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
0
citations
affunlabeled
On‐Chip Surfing Interconnect
Suwen Yang, Mark R. Greenstreet
2012· other· en· Computer Science
distilled prediction:candidate · insufficient_payloadconsensus · insufficient_payload
0
citations
affno abstractunlabeled
Connectivity of Graphs Under Edge Flips
Norbert Zeh
2004· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
0
citations
affno abstractunlabeled
Routing equal-size messages on a slotted ring
Dariusz Dereniowski, Wiesław Kubiak
2011· article· en· Journal of Scheduling· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
aboutno affunlabeled
le quotidien pdf
2024· other· fr· Zenodo (CERN European Organization for Nuclear Research)· Computer Science
distilled prediction:candidate · metaepi_narrow+sts+scholarly_communication+insufficient_payloadconsensus · insufficient_payload
0
citations
affunlabeled
Topology-aware Parallel Joins
Xiao Hu, Paraschos Koutris
2024· article· en· Proceedings of the ACM on Management of Data· Computer Science
distilled prediction:candidate · open_scienceconsensus · none
0
citations
affunlabeled
On messy broadcasting in directed hyper-cylinder graphs
Aria Adibi, Hovhannes A. Harutyunyan
2025· article· en· International Journal of Computer Mathematics Computer Systems Theory· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
0
citations

How this was built: Screen · Findings · About