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
Journal of Symbolic 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.

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

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

afffundno abstractunlabeled
A bound for the Rosenfeld–Gröbner algorithm
Oleg Golubitsky, M. V. Kondratieva, Marc Moreno Maza, Alexey Ovchinnikov
2008· article· en· Journal of Symbolic Computation· Computer Science
distilled prediction:candidate · noneconsensus · none
13
citations
afffundno abstractunlabeled
Computing critical points for invariant algebraic systems
Jean‐Charles Faugère, George Labahn, Mohab Safey El Din, Éric Schost, Thi Xuan Vu
2022· article· en· Journal of Symbolic Computation· Computer Science
distilled prediction:candidate · noneconsensus · none
11
citations
affno abstractunlabeled
An equivalence theorem for regular differential chains
François Boulier, François Lemaire, Adrien Poteaux, Marc Moreno Maza
2018· article· en· Journal of Symbolic Computation· Computer Science
distilled prediction:candidate · noneconsensus · none
11
citations
affno abstractunlabeled
When does <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" display="inline" overflow="scroll"><mml:mrow><mml:mo>〈</mml:mo><mml:mi>T</mml:mi><mml:mo>〉</mml:mo></mml:mrow></mml:math> equal <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si2.gif" display="inline" overflow="scroll"><mml:mstyle mathvariant="normal"><mml:mi>sat</mml:mi></mml:mstyle><mml:mrow><mml:mo>(</mml:mo><mml:mi>T</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math>?
François Lemaire, Marc Moreno Maza, Wei Pan, Yuzhen Xie
2011· article· lv· Journal of Symbolic Computation· Computer Science
distilled prediction:candidate · metaepi_narrow+sts+scholarly_communication+open_science+research_integrity+insufficient_payloadconsensus · metaepi_narrow+sts+research_integrity+insufficient_payload
10
citations
affno abstractunlabeled
Relaxed Hensel lifting of triangular sets
Romain Lebreton
2014· article· en· Journal of Symbolic Computation· Computer Science
distilled prediction:candidate · noneconsensus · none
9
citations
affno abstractunlabeled
Computation of unirational fields
Jaime Gutiérrez, David Sevilla
2006· article· en· Journal of Symbolic Computation· Computer Science
distilled prediction:candidate · noneconsensus · none
8
citations
fundno affno abstractunlabeled
Solving determinantal systems using homotopy techniques
Jonathan D. Hauenstein, Mohab Safey El Din, Éric Schost, Thi Xuan Vu
2020· preprint· en· Journal of Symbolic Computation· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
4
citations
affno abstractunlabeled
Computing rational powers of monomial ideals
Pratik Dongre, Benjamin Drabkin, Josiah Lim, Ethan Partida, Ethan Roy, Dylan Ruff +2 more
2022· article· en· Journal of Symbolic Computation· Mathematics
distilled prediction:candidate · noneconsensus · none
2
citations
fundno affno abstractunlabeled
Genus 3 curves whose Jacobians have endomorphisms by <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:mi mathvariant="double-struck">Q</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:msub><mml:mrow><mml:mi>ζ</mml:mi></mml:mrow><mml:mrow><mml:mn>7</mml:mn></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mrow><mml:mover accent="true"><mml:mrow><mml:mi>ζ</mml:mi></mml:mrow><mml:mrow><mml:mo stretchy="false">¯</mml:mo></mml:mrow></mml:mover></mml:mrow><mml:mrow><mml:mn>7</mml:mn></mml:mrow></mml:msub><mml:mo stretchy="false">)</mml:mo></mml:math>
J. William Hoffman, Zhibin Liang, Yukiko Sakai, Haohao Wang
2015· article· lv· Journal of Symbolic Computation· Mathematics
distilled prediction:candidate · metaresearch+metaepi_narrow+sts+scholarly_communication+open_science+research_integrity+insufficient_payloadconsensus · metaepi_narrow+sts+research_integrity+insufficient_payload
2
citations
← previousnext →

How this was built: Screen · Findings · About