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
Mobile Agent-Based Network Management
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.

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

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

afffundunlabeled
An agent-based shopping system
Luigi Benedicenti, Xuguang Chen, Raman Paranjape
2004· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
fundno affno abstractunlabeled
Mobile Web and Intelligent Information Systems
Muhammad Younas, Irfan Awan, Tor‐Morten Grønli
2023· book· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
affunlabeled
A practical approach to agent migration protocol
G. Autran, Xining Li
2004· article· en· Proceedings. IEEE/WIC/ACM International Conference on Intelligent Agent Technology, 2004. (IAT 2004).· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
affno abstractunlabeled
The Spider Model of Agents
F. Y. Huang, David B. Skillicorn
2001· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
fundno affunlabeled
Distributed management of mobile components
Rui Pedro Lopes, José Luís Oliveira
2001· article· en· Journal of Diabetes and its Complications· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
aboutno affunlabeled
Compilation statique de Java
Étienne Bergeron
2002· dissertation· fr· Open MIND· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
fundno affunlabeled
Locating a black hole in a dynamic ring
Giuseppe Antonio Di Luna, Paola Flocchini, Giuseppe Prencipe, Nicola Santoro
2024· article· en· Journal of Parallel and Distributed Computing· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
affunlabeled
Using event-streams for fault-management in MAS
Peng Xu, R. Deters
2004· article· en· Proceedings. IEEE/WIC/ACM International Conference on Intelligent Agent Technology, 2004. (IAT 2004).· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
affno abstractunlabeled
Toward a Mobile Work Environment
Larbi Esmahi, Roger Impey, Ramiro Liscano
2000· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations

How this was built: Screen · Findings · About