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
International Journal of Algebra and Computation
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.

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

Labels cover 0 of 95 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 95 of 95 works in this cohort. Predictions are machine_predicted_unvalidated teacher distillation outputs. Candidate is the union; consensus is the intersection.

affunlabeled
ON THE COMPLEXITY OF SOME MALTSEV CONDITIONS
Ralph Freese, Matthew Valeriote
2009· article· en· International Journal of Algebra and Computation· Computer Science
distilled prediction:candidate · noneconsensus · none
52
citations
affunlabeled
APERIODIC POINTLIKES AND BEYOND
Karsten Henckell, John Rhodes, Benjamin Steinberg
2010· article· en· International Journal of Algebra and Computation· Computer Science
distilled prediction:candidate · noneconsensus · none
31
citations
afffundunlabeled
OMITTING TYPES, BOUNDED WIDTH AND THE ABILITY TO COUNT
Benoît Larose, Matthew Valeriote, László Zádori
2009· article· en· International Journal of Algebra and Computation· Computer Science
distilled prediction:candidate · noneconsensus · none
20
citations
affunlabeled
CATEGORIES AS ALGEBRA, II
Benjamin Steinberg, Bret Tilson
2003· article· en· International Journal of Algebra and Computation· Computer Science
distilled prediction:candidate · noneconsensus · none
17
citations
affunlabeled
A CHARACTERIZATION OF de MORGAN ALGEBRAS
Janusz Brzozowski
2001· article· en· International Journal of Algebra and Computation· Computer Science
distilled prediction:candidate · noneconsensus · none
16
citations
affunlabeled
A PROFINITE APPROACH TO STABLE PAIRS
Karsten Henckell, John Rhodes, Benjamin Steinberg
2010· article· en· International Journal of Algebra and Computation· Computer Science
distilled prediction:candidate · noneconsensus · none
15
citations
affunlabeled
MONOIDS AND COMPUTATIONS
Pascal Tesson, Denis Thérien
2004· article· en· International Journal of Algebra and Computation· Computer Science
distilled prediction:candidate · noneconsensus · none
13
citations
affunlabeled
GROUP GRADINGS ON FINITARY SIMPLE LIE ALGEBRAS
Yuri Bahturin, Matej Brešar, Mikhail Kochetov
2012· article· en· International Journal of Algebra and Computation· Mathematics
distilled prediction:candidate · noneconsensus · none
11
citations
afffundunlabeled
THE LATTICE OF ALTER EGOS
Brian Davey, Jane G. Pitkethly, Ross Willard
2011· article· en· International Journal of Algebra and Computation· Computer Science
distilled prediction:candidate · noneconsensus · none
10
citations
fundno affunlabeled
THE SEMIGROUP OF CONJUGATES OF A WORD
Peter M. Higgins
2006· article· en· International Journal of Algebra and Computation· Computer Science
distilled prediction:candidate · noneconsensus · none
10
citations
affunlabeled
CSP DICHOTOMY FOR SPECIAL POLYADS
Libor Barto, Jakub Bulín
2013· article· en· International Journal of Algebra and Computation· Computer Science
distilled prediction:candidate · noneconsensus · none
9
citations
fundno affunlabeled
POLYNOMIAL INDEX GROWTH GROUPS
Antal Balog, László Pyber, Avinoam Mann
2000· article· en· International Journal of Algebra and Computation· Mathematics
distilled prediction:candidate · noneconsensus · none
8
citations
affunlabeled
NILPOTENT LINEAR SEMIGROUPS
Eric Jespers, David M. Riley
2006· article· en· International Journal of Algebra and Computation· Mathematics
distilled prediction:candidate · noneconsensus · none
8
citations
affunlabeled
TABLEAUX FORMULAS FOR MACDONALD POLYNOMIALS
François Bergeron, Mark Haiman
2013· article· en· International Journal of Algebra and Computation· Mathematics
distilled prediction:candidate · noneconsensus · none
8
citations
affunlabeled
H-POLYNOMIALS AND ROOK POLYNOMIALS
Mahir Bilen Can, Lex E. Renner
2008· article· en· International Journal of Algebra and Computation· Mathematics
distilled prediction:candidate · noneconsensus · none
7
citations
affunlabeled
PROFINITE TOPOLOGIES IN FREE PRODUCTS OF GROUPS
Luis Ribes, Pavel Zalesskii
2004· article· en· International Journal of Algebra and Computation· Computer Science
distilled prediction:candidate · noneconsensus · none
6
citations
affunlabeled
HOW FINITE IS A THREE-ELEMENT UNARY ALGEBRA?
Jennifer Hyndman, Jane G. Pitkethly
2005· article· en· International Journal of Algebra and Computation· Computer Science
distilled prediction:candidate · noneconsensus · none
5
citations

How this was built: Screen · Findings · About