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
Semantic Web and Ontologies
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,983 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,983 works in the cohort · of 4,299,418page 33 of 40

Labels cover 1 of 1,983 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,983 of 1,983 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.

affno abstractunlabeled
Towards Ontologies in Variation.
Torsten Hahmann, Sheila A. McIlraith
2015· article· en· National Conference on Artificial Intelligence· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Digital Scholarly Communication
Katy Nelson
2009· article· en· BCLA Browser: Linking the Library Landscape· Computer Science
machine prediction:candidate · scholarly_communication+insufficient_payloadconsensus · none
0
citations
affno abstractunlabeled
Semantic Web
2018· book-chapter· en· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Description Logics SROIQ
Reda Alhajj, Jon Rokne
2018· book-chapter· en· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Reverse Library Search
Kermit K. Murray, Robert K. Boyd, Marcos N. Eberlin, G. John Langley, Liang Li, Yasuhide Naito
2016· dataset· en· IUPAC Standards Online· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
aboutno affunlabeled
Heather Joseph on OA strategies
Peter Suber
2007· preprint· en· Computer Science
machine prediction:candidate · scholarly_communication+open_scienceconsensus · none
0
citations
venueno affno abstractunlabeled
ISSUE INFORMATION
2018· paratext· en· Hemodialysis International· Computer Science
machine prediction:candidate · insufficient_payloadconsensus · insufficient_payload
0
citations
venueno affunlabeled
Testing the Accuracy of Text Deconstruction using PTree tool.
Wan Malini Wan Isa, Jamaliah Abdul Hamid, Hamidah Ibrahim, Mohd Hasan Selamat, Rusli Abdullah, Nurul Amelina Nasharuddin
2010· article· en· Computer and Information Science· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Semantic Web Search
2018· book-chapter· en· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affno abstractunlabeled
RAMFIS: Integrating Diverse TA1's.
Cecilia Mauceri, Shafiuddin Rehan Ahmed, Timothy O'Gorman, Chris Koski, Peter Anick, David White +1 more
2019· article· en· Theory and applications of categories· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Natural Reference Configuration
Morton E. Gurtin, Eliot Fried, L. D. Vijay Anand
2010· book-chapter· en· Cambridge University Press eBooks· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Refining Query and Document Representations
Jimmy Lin, Rodrigo Nogueira, Andrew Yates
2022· book-chapter· en· Synthesis lectures on human language technologies· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Social Computing
2018· book-chapter· en· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affno abstractunlabeled
BUPTTeam Participation at TAC 2017 Knowledge Base.
Yongmei Tan, Yang Hu, Xiaoguang Li
2017· article· en· Theory and applications of categories· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Document Indexing
2014· book-chapter· en· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Ontology Alignment
2018· book-chapter· en· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
venueno affno abstractunlabeled
OPEN MANTRA for Open Access to Information.
A.R.D. Prasad, Devika P. Madalli
2007· article· fr· Ingénierie des systèmes d information· Computer Science
machine prediction:candidate · open_scienceconsensus · none
0
citations
affaboutunlabeled
SOCIAL ONTOLOGY IN BIG DATA ORGANIZING
Andrew Iliadis, Peter Pulsifer, Tracey P. Lauriault, Nick Couldry, Ulises A. Mejias
2018· article· en· AoIR Selected Papers of Internet Research· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations

How this was built: Screen · Findings · About