MétaCan
Menu
Back to cohort
Record W2068773776 · doi:10.1142/s0219498811004859

TWO-SIDED IDEALS IN LEAVITT PATH ALGEBRAS

2011· article· en· W2068773776 on OpenAlexaff
Pinar Colak

Bibliographic record

VenueJournal of Algebra and Its Applications · 2011
Typearticle
Languageen
FieldMathematics
TopicAdvanced Operator Algebra Research
Canadian institutionsSimon Fraser University
Fundersnot available
KeywordsMathematicsNoetherianGraphVertex (graph theory)Path (computing)CombinatoricsIdeal (ethics)Discrete mathematicsPure mathematicsAlgebra over a fieldComputer science

Abstract

fetched live from OpenAlex

We explicitly describe two-sided ideals in Leavitt path algebras associated with a row-finite graph. Our main result is that any two-sided ideal I of a Leavitt path algebra associated with a row-finite graph is generated by elements of the form [Formula: see text], where g is a cycle based at vertex v. We use this result to show that a Leavitt path algebra is two-sided Noetherian if and only if the ascending chain condition holds for hereditary and saturated closures of the subsets of the vertices of the row-finite graph E.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

How this classification was reachedexpand

Full frame machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.001
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: Theoretical or conceptual
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.005
Threshold uncertainty score0.018

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0000.001
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0010.001
Science and technology studies0.0010.002
Scholarly communication0.0010.003
Open science0.0010.001
Research integrity0.0000.001
Insufficient payload (model declined to judge)0.0050.001

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.077
GPT teacher head0.359
Teacher spread0.283 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designTheoretical or conceptual
Domainnot available
GenreEmpirical

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations16
Published2011
Admission routes1
Has abstractyes

Explore more

Same venueJournal of Algebra and Its ApplicationsSame topicAdvanced Operator Algebra ResearchFrench-language works237,207