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

affunlabeled
pymc-devs/pytensor: rel-2.29.0
2025· other· en· Zenodo (CERN European Organization for Nuclear Research)· Computer Science
distilled prediction:candidate · metaepi_narrow+scholarly_communication+insufficient_payloadconsensus · insufficient_payload
0
citations
affno abstractunlabeled
The Key
Catherine H. Gebotys
2009· book-chapter· en· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
afffundunlabeled
Reconfiguration of Graph Minors
Benjamin Moore, Naomi Nishimura, Vijay Subramanya
2018· preprint· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
0
citations
venueno affno abstractunlabeled
10.1016/b978-1-55860-348-6.50004-3
2000· book-chapter· en· Time to knit· Computer Science
distilled prediction:candidate · metaepi_narrow+insufficient_payloadconsensus · insufficient_payload
0
citations
venueno affunlabeled
5-Regular Subgraphs in Hypercubes
Y. M. Borse, S. R. Shaikh, J. B. Saraf
2024· article· en· Ars Combinatoria· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Broadcast Schemes of Hypercubes
M.H. Fakharan, Hovhannes A. Harutyunyan, Pouria Alikhanifard
2025· article· en· Journal of Graph Algorithms and Applications· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
aboutno affunlabeled
Network-on Chip Micro-Benchmarks
Zhonghai Lu, Axel Jantsch, Erno Salminen, Cristian Grecu
2008· article· hu· Computer Science
distilled prediction:candidate · metaepi_narrow+insufficient_payloadconsensus · insufficient_payload
0
citations
affno abstractunlabeled
Topology
Natalie Enright Jerger, Tushar Krishna, Li-Shiuan Peh
2017· book-chapter· en· Synthesis lectures on computer architecture· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
0
citations
venueno affno abstractunlabeled
On the path edge-connectivity of graphs.
Shumin Zhang
2017· article· en· Ars Combinatoria· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
venueno affno abstractunlabeled
Covering a Unit Hypercube with Hypercubes.
Chunxia Shen, Zhanjun Su, Liping Yuan
2016· article· en· Ars Combinatoria· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
venueno affno abstractunlabeled
Restricted arc-connectivity of digraphs.
L. B. Guo, Xiaofeng Guo
2014· article· en· Ars Combinatoria· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
fundno affunlabeled
Layered subgraphs of the hypercube
Natalie Behague, Imre Leader, Natasha Morrison, Kada Williams
2024· preprint· en· arXiv (Cornell University)· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
aboutno affunlabeled
Design of a 17-million gate network processor using a design factory
Gilles-Eric Descamps, Satish Bagalkotkar, Satish Iyengar, Alain Pirson
2003· article· en· Proceedings of the 40th conference on Design automation - DAC '03· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
0
citations
venueno affunlabeled
Table of contents
Arcesio Arbelaez, Ian Goode, Juan Gomez-Cruz, Carlos Escobedo, Carlos E. Saavedra, Mohammad Halim Deedar +11 more
2020· article· en· Canadian Journal of Electrical and Computer Engineering· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
afffundno abstractunlabeled
Minimum multiple originator broadcast graphs
Arthur L. Liestman, Dana Richards
2016· article· en· Discrete Applied Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations

How this was built: Screen · Findings · About