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
LMS Journal of Computation and Mathematics
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.

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

Labels cover 0 of 30 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 30 of 30 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
Computing symmetry groups of polyhedra
David Avis, Mathieu Dutour Sikirić, Dmitrii V. Ṗasechnik, Thomas Rehn
2014· article· en· LMS Journal of Computation and Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
39
citations
affunlabeled
Tracking -adic precision
Xavier Caruso, David Roe, Tristan Vaccon
2014· article· en· LMS Journal of Computation and Mathematics· Mathematics
machine prediction:candidate · noneconsensus · none
22
citations
afffundunlabeled
The Brauer-Manin Obstruction and III[2]
Martin Bright, Nils Bruin, E. V. Flynn, Adam Logan
2007· article· en· LMS Journal of Computation and Mathematics· Mathematics
machine prediction:candidate · noneconsensus · none
22
citations
afffundunlabeled
Wieferich pairs and Barker sequences, II
2014· article· en· LMS Journal of Computation and Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
11
citations
afffundunlabeled
Primitive Divisors on Twists of Fermat's Cubic
Graham Everest, Patrick Ingram, Shaun Stevens
2009· article· en· LMS Journal of Computation and Mathematics· Mathematics
machine prediction:candidate · noneconsensus · none
11
citations
afffundunlabeled
Decomposing Replicable Functions
John McKay, David Sevilla
2008· article· en· LMS Journal of Computation and Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
aboutno affunlabeled
A classification of all 1-Salem graphs
Lee Gumbrell, James McKee
2014· preprint· en· LMS Journal of Computation and Mathematics· Mathematics
machine prediction:candidate · noneconsensus · none
0
citations

How this was built: Screen · Findings · About