A Prediction-Enhanced Physical-to-Virtual Twin Connectivity Framework for Human Digital Twin
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
This paper proposes a new secure and privacy-preserving prediction-enhanced solution for reliable physical-to-virtual communications in human digital twin (HDT) systems. With such a prediction-enhanced connectivity (PeHDT) framework, the evolution of any virtual twin (VT) could be triggered in real-time or in advance using the expected state of its physical counterpart. This ensures the continuous maintenance of a true replica of each physical twin (PT), thus relieving the need for timely PT-VT synchronization while the VT-experienced delay is reduced to zero or close to zero. We adopted a secured federated multi-task learning technique to meet the security and privacy constraints of HDT and employed a single server discrete-time batch-service queue framework when characterizing the batching process to reduce the communication burden. Furthermore, we introduced a prediction verification framework to improve the performance of the proposed PeHDT framework. The resulting problem was formulated as a constrained Markov decision process and was solved by introducing a primary-dual deep deterministic policy gradient (DDPG) algorithm. Through a joint investigation of communication, batching and prediction verification schemes, the simulation results show that the proposed PeHDT framework can greatly reduce both the VT-experienced delay and the PT-VT communication time without compromising the specific requirements of HDT.
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.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.001 |
| Insufficient payload (model declined to judge) | 0.000 | 0.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.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it