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
ACM SIGSAM Bulletin
Topic
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.

27 results · 1 filter active ·
Results by year
20002005
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.
27 works in the cohort · of 4,299,418page 1 of 1

Labels cover 0 of 27 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 27 of 27 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
On the complexity of the D5 principle
Xavier Dahan, Éric Schost, Marc Moreno Maza, Wenyuan Wu, Yongjian Xie
2005· article· en· ACM SIGSAM Bulletin· Computer Science
machine prediction:candidate · noneconsensus · none
48
citations
affunlabeled
The RegularChains library in MAPLE
François Lemaire, Marc Moreno Maza, Yongjian Xie
2005· article· en· ACM SIGSAM Bulletin· Computer Science
machine prediction:candidate · insufficient_payloadconsensus · none
39
citations
affunlabeled
Not seeing the roots for the branches
David J. Jeffrey, A. C. Norman
2004· article· en· ACM SIGSAM Bulletin· Computer Science
machine prediction:candidate · noneconsensus · none
16
citations
affunlabeled
MKM
William M. Farmer
2004· article· en· ACM SIGSAM Bulletin· Computer Science
machine prediction:candidate · insufficient_payloadconsensus · none
16
citations
aboutno affunlabeled
On writing OpenMath content dictionaries
James H. Davenport
2000· article· en· ACM SIGSAM Bulletin· Computer Science
machine prediction:candidate · noneconsensus · none
10
citations
affunlabeled
Approximate computation of pseudovarieties
Robert M. Corless, Hiroshi Kai, Stephen M. Watt
2003· article· en· ACM SIGSAM Bulletin· Computer Science
machine prediction:candidate · noneconsensus · none
6
citations
affunlabeled
Algebraic generalization
Stephen M. Watt
2005· article· en· ACM SIGSAM Bulletin· Computer Science
machine prediction:candidate · noneconsensus · none
5
citations
affunlabeled
The <i>n</i> th derivative
Mhenni M. Benghorbal, Robert M. Corless
2002· article· en· ACM SIGSAM Bulletin· Computer Science
machine prediction:candidate · noneconsensus · none
4
citations
affaboutunlabeled
East Coast Computer Algebra Day
Mark Giesbrecht
2000· article· en· ACM SIGSAM Bulletin· Mathematics
machine prediction:candidate · noneconsensus · none
2
citations
affunlabeled
ANTS VI
Ilias Kotsireas, Emil Volcheck
2004· article· en· ACM SIGSAM Bulletin· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affunlabeled
Review of risk management
Matt Davison
2003· article· en· ACM SIGSAM Bulletin· Business, Management and Accounting
machine prediction:candidate · noneconsensus · none
0
citations

How this was built: Screen · Findings · About