MétaCan
Menu
Back to cohort
Record W4416452333 · doi:10.48550/arxiv.2505.16564

Graph splitting methods: Fixed points and strong convergence for linear subspaces

2025· preprint· en· W4416452333 on OpenAlexfundno aff
Francisco J. Aragón Artacho, Heinz H. Bauschke, Rubén Campoy, César López-Pastor

Bibliographic record

VenueArXiv.org · 2025
Typepreprint
Languageen
FieldMathematics
TopicAdvanced Optimization Algorithms Research
Canadian institutionsnot available
FundersAgencia Estatal de InvestigaciónEuropean Social FundEuropean Regional Development FundNatural Sciences and Engineering Research Council of Canada
KeywordsLinear subspaceFixed pointGraphMonotone polygonLinear operatorsLinear mapGraph theory

Abstract

fetched live from OpenAlex

In this paper, we develop a general analysis for the fixed points of the operators defining the graph splitting methods from [SIAM J. Optim. 2024;34:1569–1594] by Bredies, Chenchene and Naldi. We particularize it to the case where the maximally monotone operators are normal cones of closed linear subspaces and provide an explicit formula for the limit points of the graph splitting schemes. We exemplify these results on some particular algorithms, unifying in this way some results previously derived as well as obtaining new ones.

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.004
metaresearch head score (Gemma)0.010
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: Methods · Consensus signal: Methods
Teacher disagreement score0.004
Threshold uncertainty score0.020

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0040.010
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0020.001
Science and technology studies0.0010.003
Scholarly communication0.0010.004
Open science0.0020.003
Research integrity0.0020.003
Insufficient payload (model declined to judge)0.0040.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.190
GPT teacher head0.479
Teacher spread0.289 · 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
GenreMethods

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

Citations0
Published2025
Admission routes1
Has abstractyes

Explore more

Same venueArXiv.orgSame topicAdvanced Optimization Algorithms ResearchFrench-language works237,207