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
Network Time Synchronization Technologies
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.

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

Labels cover 1 of 209 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 209 of 209 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
VM clock synchronization measurements
Jagmohan Chauhan, Dwight Makaroff, Anthony Arkles
2011· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations
affunlabeled
Clock synchronization using a linear process model
James Aweya, Delfin Y. Montuno, Michel Ouellette, Kent Felske
2005· article· en· International Journal of Network Management· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
affunlabeled
Clock and Data Recovery
2024· book-chapter· en· Cambridge University Press eBooks· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
venueno affunlabeled
TSN Time Synchronization Based on Kalman Filtering
Kai Li, Yuan Zhu, Sun Zhipeng
2023· article· en· Journal of Electronics and Information Science· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affunlabeled
Reference node selection in dynamic tree
Masoume Jabbarifar, Michel Dagenais
2014· article· en· International Journal of Network Management· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affunlabeled
Carrier scale Ethernet [Guest Editorial]
A. McGuire, Glenn Parsons, David K. Hunter
2008· article· en· IEEE Communications Magazine· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affunlabeled
Architecture for a fully distributed Wireless Control Network
Miroslav Pajić, Shreyas Sundaram, Mansimar Aneja, Srinivas Vemuri, Rahul Mangharam, George J. Pappas
2011· article· en· ScholarlyCommons (University of Pennsylvania)· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations

How this was built: Screen · Findings · About