MétaCan
Menu
Back to cohort
Record W4411406701 · doi:10.1109/tnse.2025.3580705

Quantum Deep Deterministic Policy Gradient for Digital Twin-Enabled Semantic IoV Networks

2025· article· en· W4411406701 on OpenAlex

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.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.
fundA Canadian funder is recorded on the work.

Bibliographic record

VenueIEEE Transactions on Network Science and Engineering · 2025
Typearticle
Languageen
FieldEngineering
TopicAdvanced Memory and Neural Computing
Canadian institutionsMemorial University of Newfoundland
FundersNatural Sciences and Engineering Research Council of CanadaNational Research Foundation of Korea
KeywordsComputer scienceTheoretical computer scienceAlgorithm

Abstract

fetched live from OpenAlex

Internet of Vehicles (IoV) networks are becoming more complex as they require real-time decision-making and efficient resource management. These demands make it difficult to maintain stable and reliable operations. The challenges are especially severe in dynamic and time-varying environments. To address these limitations, we propose a framework that integrates the quantum-based deep deterministic policy gradient (Q-DDPG) with digital twin networks (DTN) for distributed semantic optimization in dynamic IoV environments. The framework leverages quantum computing, such as superposition and entanglement, to enhance distributed semantic decisions. DTNs provide real-time modeling for efficient task offloading and adaptive resource allocation in decentralized IoV environments under varying conditions and uncertainties. The numerical results validate the robustness of the proposed approach, significantly reduce latency, and improve energy efficiency.

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 imitation

Not 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.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.935
Threshold uncertainty score0.866

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.001
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.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.008
GPT teacher head0.228
Teacher spread0.220 · 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