ArticleScientific reports2026
Zero knowledge verifiable, semi asynchronous federated learning for trajectory prediction on permissioned blockchain.
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
No grant is acknowledged in the PubMed record.
Abstract
Vehicle trajectory prediction in Internet-of-Vehicles requires collaborative learning over sensitive trajectories under intermittent connectivity and partially trusted participants. ChainDrive-FL-VRA coordinates semi-asynchronous federated learning on a permissioned consortium ledger using Practical Byzantine Fault Tolerance (PBFT), while keeping raw trajectories and raw model-update tensors off-chain. Each client submits an on-chain header containing a commitment and hash of the local update, together with zero-knowledge proofs that certify [Formula: see text]clipping and anchor-consistency. Validators admit only proof-checked updates, compute staleness- and reputation-aware robust weights, and publish a proof of correct aggregation that binds the aggregation commitment and the committed global model hash to the admitted committed updates under fixed-point weights. A contextual-bandit trigger selects aggregation timing under client churn. Experiments on NGSIM US-101 and I-80 show improved ADE/FDE/RMSE and improved robustness under staleness and anomalous updates, while on-chain artifacts remain at kilobyte scale per update and per aggregation event.
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.