MétaCan
ENFR
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.

Export CSVExport JSONAPI query

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
Distributed and Parallel Computing 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.

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

Labels cover 5 of 2,076 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 2,076 of 2,076 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
Managing Distributed MARF with SNMP
Serguei A. Mokhov, Lee Wei Huynh, Jian Li
2009· preprint· en· ArXiv.org· Computer Science
machine prediction:candidate · noneconsensus · none
12
citations
affunlabeled
Efficient Bidding in Dynamic Grid Markets
Amir Danak, Shie Mannor
2011· article· en· IEEE Transactions on Parallel and Distributed Systems· Computer Science
machine prediction:candidate · noneconsensus · none
12
citations
affunlabeled
Exploiting Virtualization and Cloud Computing in ATLAS
Fernando Harald Barreiro Megino, Doug Benjamin, K. De, Ian Gable, Val Hendrix, S. Panitkin +6 more
2012· article· en· Journal of Physics Conference Series· Computer Science
machine prediction:candidate · noneconsensus · none
12
citations
fundno affunlabeled
Scalable Bulk Data Transfer in Wide Area Networks
Nader Mohamed, Jameela Al‐Jaroodi, Hong Jiang, David Swanson
2003· article· en· The International Journal of High Performance Computing Applications· Computer Science
machine prediction:candidate · noneconsensus · none
11
citations
affaboutunlabeled
Finding order in chaos: a behavior model of the whole grid
Jesús Montes, Alberto Sánchez, Julio J. Valdés, Marı́a S. Pérez, Pilar Herrero
2009· article· en· Concurrency and Computation Practice and Experience· Computer Science
machine prediction:candidate · noneconsensus · none
11
citations
affno abstractunlabeled
Architecture of the ATLAS High Level Trigger Event Selection Software
S.R. Armstrong, K. Assamagan, J. T. Baines, C. P. Bee, M. Biglietti, A. Bogaerts +71 more
2003· article· en· Nuclear Instruments and Methods in Physics Research Section A Accelerators Spectrometers Detectors and Associated Equipment· Computer Science
machine prediction:candidate · noneconsensus · none
11
citations
afffundno abstractunlabeled
Computer Program Exchange
Brian P. O’Connor
2001· article· en· Applied Psychological Measurement· Computer Science
machine prediction:candidate · insufficient_payloadconsensus · none
11
citations
affunlabeled
Policies, grids and autonomic computing
Bradley Simmons, Hanan Lutfiyya
2005· article· en· ACM SIGSOFT Software Engineering Notes· Computer Science
machine prediction:candidate · noneconsensus · none
11
citations
affno abstractunlabeled
The Proxy-Based Mobile Grid
Azade Khalaj, Hanan Lutfiyya, Mark Perry
2010· book-chapter· en· Lecture notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering· Computer Science
machine prediction:candidate · noneconsensus · none
10
citations
affno abstractunlabeled
MoHex 2.0: A Pattern-Based MCTS Hex Player
Shih-Chieh Huang, Broderic Arneson, Ryan Hayward, Martin Müller, Jakub Pawlewicz
2014· article· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
10
citations
affunlabeled
Simulated annealing for generalized Skyrme models
Jean-Philippe Longpré, Luc Marleau
2005· article· en· Physical review. D. Particles, fields, gravitation, and cosmology/Physical review. D, Particles, fields, gravitation, and cosmology· Computer Science
machine prediction:candidate · noneconsensus · none
10
citations
fundno affno abstractunlabeled
Engineering of Complex Computer Systems
2024· book· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
10
citations
affunlabeled
Consolidation of cloud computing in ATLAS
R. Taylor, C Cordeiro, Domenico Giordano, John Hover, Tomáš Kouba, P. A. Love +3 more
2017· article· en· Journal of Physics Conference Series· Computer Science
machine prediction:candidate · noneconsensus · none
10
citations
afffundunlabeled
Using Kubernetes as an ATLAS computing site
Fernando Harald Barreiro Megino, Jeffrey Ryan Albert, F. Berghaus, K. De, FaHui Lin, D. M. Mac Donell +5 more
2020· article· en· EPJ Web of Conferences· Computer Science
machine prediction:candidate · noneconsensus · none
9
citations
← previousnext →

How this was built: Screen · Findings · About