MétaCan
Menu
Back to cohort

Fixed Point Methodologies for ψ-Contraction Mappings in Cone Metric Spaces over Banach Algebra with Supportive Applications

2024· article· en· W4400822612 on OpenAlexvenueno aff
Rashwan A. Rashwan, Hasanen A. Hammad, Mohamed Gamal, Saleh Omran, Manuel De la Sen

Bibliographic record

VenueInternational Journal of Analysis and Applications · 2024
Typearticle
Languageen
FieldMathematics
TopicFixed Point Theorems Analysis
Canadian institutionsnot available
FundersEuropean Regional Development FundEusko Jaurlaritza
KeywordsMathematicsContraction (grammar)Metric spaceCone (formal languages)Banach spaceContraction principleFixed-point theoremPure mathematicsAlgebra over a fieldAlgorithmLinguistics

Abstract

fetched live from OpenAlex

The explicit aim of this manuscript is to obtain fixed point consequences under novel ψ-contraction mappings in a complete cone metric space over Banach algebra. We connect and relate different fixed point theorems by using the idea of ψ-contraction mappings, providing a thorough viewpoint that deepens our comprehension of this topic. Our theorems generalize and unify many results in the scientific literature. These prospective extensions offer intriguing research directions and have the potential to further advance the study of fixed point theory. The investigation of examples plays an extremely crucial role in verifying the effectiveness and validity of our theoretical results. Moreover, to support the theoretical results, some examples are investigated to emphasize these results. Ultimately, the existence and uniqueness of the solution to the Urysohn integral and nonlinear fractional differential equation are cooperated as applications to provide an authoritative basis for dealing with actual problems that include these equations.

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.002
metaresearch head score (Gemma)0.003
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: none
Teacher disagreement score0.002
Threshold uncertainty score0.013

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0020.003
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0020.001
Science and technology studies0.0010.003
Scholarly communication0.0020.003
Open science0.0010.002
Research integrity0.0010.002
Insufficient payload (model declined to judge)0.0020.000

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.032
GPT teacher head0.368
Teacher spread0.336 · 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

Citations1
Published2024
Admission routes1
Has abstractyes

Explore more

Same venueInternational Journal of Analysis and ApplicationsSame topicFixed Point Theorems AnalysisFrench-language works237,207