ArticleScientific reports2026
Interpretable reputation driven asynchronous consensus vehicle networking federated learning architecture.
Article in Scientific reports, 2026. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Not yet cited in PubMed.
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.
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.
Who cites it
0 citing papers in PubMed.
No citing paper in PubMed yet.
Corrections and comments
PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.
Authors and funding
2 authors.
Funding
Abstract
This paper proposes a Vehicle-Road-Cloud-Chain (VRCC) four-layer collaborative framework to address the issues of lack of interpretability, reputation evaluation failure, and architecture centralization vulnerability faced by federated learning in Internet of Vehicles (IoV) under Differential Privacy (DP), Non-Independent and Identically Distributed (Non-IID) data, and Byzantine attacks. The framework achieves explicit decoupling between low-latency data sharing and latency-tolerant collaborative training. Firstly, construct an asynchronous blockchain consensus layer based on Directed Acyclic Graph (DAG), which supports low confirmation latency model interaction record storage in high-concurrency vehicle scenarios; And design a three-layer interpretable reputation evaluation mechanism, integrating historical task performance, Maximum Mean Discrepancy (MMD) Bayesian inference, and task completion contribution, to achieve causal decoupling between "honest high loss" and "malicious low loss reporting" under Differential Privacy noise, and jointly sign and upload it to the chain through the regulatory committee and Roadside Units (RSUs), making reputation judgments auditable and transparent; Further propose a participant selection algorithm based on Deep Deterministic Policy Gradient (DDPG) and reputation partitioning, which synchronously optimizes communication overhead, computation delay, and redundant filtering in dynamic traffic flow, while utilizing local DAG weight-biased random walks to achieve lightweight asynchronous model quality verification. The experiment shows that the cumulative reward of the proposed method can quickly converge and remain stable, verifying its system-level superiority in interpretable robust aggregation and high-concurrency scalability.
Indexed as
Identifiers
What OpenQuestion holds
Registered trials
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.