Evidence map›Paper›PMID 38965278›Full record

ArticleScientific reports2024

Quantum-inspired modeling of distributed intelligence systems with artificial intelligent agents self-organization.

A P Alodjants, D V Tsarev, A E Avdyushina, A Yu Khrennikov, A V Boukhanovsky

Abstract read
In one paragraph

Article in Scientific reports, 2024. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 2 papers.

0numbers the graph read from it
0cells of the map it votes in
2citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

2 citing papers in PubMed.

  1. Article
  2. Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

5 authors.

A P AlodjantsITMO University, St. Petersburg, Russia, 197101.
D V TsarevITMO University, St. Petersburg, Russia, 197101.
A E AvdyushinaITMO University, St. Petersburg, Russia, 197101.
A Yu KhrennikovInternational Center for Mathematical Modeling in Physics, Engineering, Economics, and Cognitive Science Linnaeus University, 35195, Vaxjo-Kalmar, Sweden. andrei.khrennikov@lnu.se.
A V BoukhanovskyITMO University, St. Petersburg, Russia, 197101.

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

Distributed intelligence systems (DIS) containing natural and artificial intelligence agents (NIA and AIA) for decision making (DM) belong to promising interdisciplinary studies aimed at digitalization of routine processes in industry, economy, management, and everyday life. In this work, we suggest a novel quantum-inspired approach to investigate the crucial features of DIS consisting of NIAs (users) and AIAs (digital assistants, or avatars). We suppose that N users and their avatars are located in N nodes of a complex avatar - avatar network. The avatars can receive information from and transmit it to each other within this network, while the users obtain information from the outside. The users are associated with their digital assistants and cannot communicate with each other directly. Depending on the meaningfulness/uselessness of the information presented by avatars, users show their attitude making emotional binary "like"/"dislike" responses. To characterize NIA cognitive abilities in a simple DM process, we propose a mapping procedure for the Russell's valence-arousal circumplex model onto an effective quantum-like two-level system. The DIS aims to maximize the average satisfaction of users via AIAs long-term adaptation to their users. In this regard, we examine the opinion formation and social impact as a result of the collective emotional state evolution occurring in the DIS. We show that generalized cooperativity parameters

Identifiers

PMID38965278
PMCPMC11224413

What OpenQuestion holds

Textmetadata
LicenceCC BY
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.