Skip to content
Log in
#edge computing Book Open access

HLV-DS-SPEC-001R: Deterministic One-Click Carrier Spectral-Specificity Recovery Engine — Corrected Implementation Freeze v0.1.1

Marcel Krüger
Aug 2026 · Zenodo (CERN European Organization for Nuclear Research)

Abstract

This record freezes corrected implementation v0.1.1 of the deterministic One-Click execution engine for HLV-DS-SPEC-001R. The controlling scientific recovery protocol remains unchanged: Krūger, M. (2026). HLV-DS-SPEC-001R: Prospective Recovery of the Native 6D-to-3D Carrier Spectral-Specificity Gate After Q-Control Capacity Stop — Pre-Execution Protocol Freeze v0.1.0. Zenodo. DOI 10.5281/zenodo.22162097. The purpose of implementation v0.1.1 is strictly technical: it removes a severe runtime bottleneck in the R-family continuity-replay stage of implementation v0.1.0 without changing the scientific hypothesis, target, null families, random seeds, spectral observables, thresholds, scoring rules, control-capacity rules, or machine-verdict logic. The identified bottleneck arose because implementation v0.1.0 performed two Python bidirectional graph-connectivity searches after essentially every accepted R-family double-edge swap. For the locked DG-001 target with N1 = 5345 edges, the frozen R procedure requires 50 × N1 = 267250 accepted swaps per replicate. Across 31 R replicates this corresponds to 8284750 accepted swaps and approximately 16.6 million Python reachability searches. This produced an implementation-level runtime stall in Google Colab before the scientific spectral evaluation was reached. Corrected implementation v0.1.1 replaces only this per-proposal connectivity-validation mechanism with a deterministic parent-certified replay. The corrected replay: - uses the identical PCG64 seed sequence; - consumes the same proposal stream; - preserves the same shared-endpoint, self-loop, and duplicate-edge rejection rules; - preserves the same accepted-swap target; - preserves the exact vertex-degree sequence; - performs an independent final connectivity check; - and, critically, requires the final sparse B1 matrix of every R replicate to be exactly equal to the corresponding already-public frozen parent R matrix. Any mismatch causes the recovery continuity gate to fail before any spectral calculation is allowed. During preparation of this corrected implementation, all 31 frozen R replicates were replayed and compared against the archived parent controls. Result: 31 / 31 exact sparse-matrix matches. This validation establishes implementation equivalence for the corrected R replay under the frozen parent controls. It is a technical implementation result only and is not a DS-SPEC-001R scientific result. No target QSPEC or RRESP spectral signature, target-control distance, family score, recovery verdict, or final carrier-specificity result was computed in preparing this corrected freeze. The complete scientific control bank remains frozen before spectral evaluation and retains the same load-bearing families: R — deterministic parent-continuity degree-preserving rewires; Q — capacity-matched random 6D-to-3D projection controls; W — capacity-matched altered-window controls; IRR — matched irrational-factor controls. The corrected implementation does not alter the Q recovery extension, Q candidate ceiling, W or IRR generation, accepted-control counts, spectral signatures, normalization, score construction, thresholds, or verdict logic. Visible flushed progress reporting has been added so that Colab now reports progress during R replay, Q-prefix reproduction, Q recovery extension, W and IRR generation, and the subsequent spectral evaluation. This reporting has no effect on scientific calculations. The implementation remains deterministic and self-contained. The One-Click notebook embeds the frozen upstream artifacts, reconstructs them with SHA-256 verification, requires no Google Drive mount, and preserves the lock-before-outcome execution order. Technical validation performed before this freeze includes exact replay of all 31 frozen R-family parent controls. No outcome-bearing target spectral calculation was inspected. Corrected implementation artifact identities: Corrected One-Click notebook SHA-256: 4b713ee16a754e4366952616e965186ad41fc54567971f3f560c3e5635126fae Corrected scientific engine SHA-256: e86a8f4f55bb8fd2ad99d0dd713ab109ac97bd6db6aac2ecabaa0de8409d8b0d Corrected implementation-freeze package SHA-256: 6cd34b01c5cd8f6ec51f3d6f2652656695ca0876c9edbb4a15f4564b4e28d42e This v0.1.1 record supersedes implementation v0.1.0 only with respect to the R-family runtime implementation and progress reporting. It does not supersede or modify the controlling DS-SPEC-001R scientific recovery protocol. After publication of this exact implementation freeze, the prescribed next action is to open the archived corrected One-Click notebook in Google Colab and execute Runtime → Run all once without editing any scientific cell, payload, seed, null-family rule, threshold, score, or verdict condition. The resulting locked scientific result archive and its printed SHA-256 must be preserved unchanged regardless of whether the final outcome is PASS, FAIL, or INCONCLUSIVE. A later PASS would support only the finite carrier spectral-specificity claim defined by the controlling frozen DS-SPEC-001R protocol and its declared null ensemble. It would not establish spacetime, gravity, Standard-Model recovery, particle masses, dark matter, dark energy, physical selection of the golden ratio, or experimental validation.

DOI
View source

Similar papers

#federated learning Sep 2026

AoI Minimization in Heterogeneous MEC Networks: A Federated Learning-Assisted Hybrid DRL and Convex Approach

This paper investigates a dynamic heterogeneous mobile edge computing network (HMECN), where mobile devices (MDs) could offload their full tasks to a small base station (SBS) directly or the macro base station (MBS) in direct or relay mode. As age of information (AoI) is a comprehensive and accurate metric to capture the freshness of computation results, we formulate a long-term weighted sum AoI (LWSA) minimization problem in the HMECN by jointly optimizing the offloading decisions of MDs as well as the bandwidth and computation resource allocation of all base stations, subject to energy, delay and peak AoI constraints. To address the formulated non-convex mixed integer nonlinear programming problem, we decompose it into the offloading decision optimization (ODO) top-problem and the resource allocation optimization (RAO) sub-problem. Based on the decomposition, we propose a federated learning (FL)-assisted hybrid DRL and convex approach that is comprised of a safe multi-agent DRL algorithm, convex optimization and FL. The ODO top-problem is solved by the safe multi-agent DRL algorithm, which strictly ensures that the actions of each agent do not exceed its energy constraint and then paves the way for using convex optimization to solve the RAO sub-problem. FL is used to alleviate the training instability problem aggravated by multi-agent settings via breaking the limitation of partial knowledge for each individual agent. Simulation results demonstrate the superiority of the proposed approach in terms of the LWSA, convergence, scalability and robustness in dynamic environments.

Xiaoying Liu, Junhao Zheng, Kechen Zheng et al. · 8 citations
#edge computing Sep 2026

DRUDM-CFG: A Fairness-Aware Multi-Agent DRL Algorithm for AMEC-Assisted Task Offloading in Post-Disaster Scenarios

High-altitude airships (HAS) and uncrewed aerial vehicles (UAVs) equipped with Multiaccess Edge Computing (MEC) servers have emerged as promising aerial MEC nodes for providing task offloading (TO) services to intelligent mobile devices (IMDs) in post-disaster scenarios. HAS offers robust computing and energy resources, while UAVs provide flexible, low-altitude coverage for rapid deployment. However, direct task offloading from IMDs to HAS often leads to task failures due to high transmission delays. UAVs with limited onboard resources require to minimize resource waste. Additionally, IMDs in sparse areas face insufficient TO services due to unfair UAV coverage. This paper defines these challenges as a joint optimization problem involving TO, RA, and UAV coverage fairness. It proposes a cooperative aerial Multiaccess Edge Computing (AMEC) framework integrating HAS and UAVs to address the issue. Within this framework, a hybrid TO scheme is first developed to mitigate the high transmission delay between IMDs and HAS. Second, a Distance, Resource, Urgency-based Decision Mechanism (DRUDM) is designed to enhance the accuracy of UAVs in selecting target IMDs for TO services. Third, a Coverage Fairness Guarantee (CFG) strategy is proposed to optimize UAV flight trajectories, ensuring IMDs in sparse areas receive fair TO services. Finally, the joint optimization problem is modeled as a Multi-Agent Partially Observable Markov Decision Process (MA-POMDP), and a DRUDM–CFG algorithm is presented to efficiently solve this complex non-convex optimization problem. Experimental results demonstrate that the proposed algorithm outperforms other compared algorithms in task completion rate and average delay, benefiting from the DRUDM mechanism. Meanwhile, the CFG strategy effectively improves TO service fairness for IMDs in sparse areas.

Xiting Peng, Chuanqi Qin, Xiaoyu Zhang et al. · 4 citations
#edge computing Preprint Aug 2026

Computing an e-net of a closed hyperbolic surface

Hyperbolic surfaces are a fundamental object in mathematics and play an increasingly important role in computational geometry and topology. A key ingredient in the design of efficient algorithms on such surfaces is the availability of a geometric discretization of controlled complexity. In this paper, we present the first algorithm for constructing e-nets on hyperbolic surfaces starting from a fundamental polygon representation. Our approach is based on Delaunay refinement and relies on maintaining Delaunay triangulations through edge flips. The size of an e-net cannot be bounded solely as a function of the genus because of the presence of arbitrarily long collars around short geodesics. To overcome this difficulty, we introduce the notion of a pseudo e-net, which decomposes the surface into e-thin cylinders together with a Delaunay triangulation over an e-net of the remaining thick part. As applications, we obtain algorithms for computing the length spectrum of an e-thick hyperbolic surface and for computing the systole from a pseudo log(sqrt(2))-net. These results demonstrate that Delaunay-based discretizations provide a practical and versatile framework for algorithmic computations on hyperbolic surfaces.

V. Delecroix, Vincent Despré, Camille Lanuel et al. · 3 citations
#edge computing Sep 2026

Toward 6G Edge Intelligence: Lightweight LLMs for Intent-Driven Network Automation

Future 6G networks are envisaged to tightly integrate communication, sensing, and computing, demanding real-time, intent-driven intelligence at the edge. While large language models (LLMs) excel in intent recognition and semantic reasoning, their application to real-time network lifecycle management at the edge is limited by heterogeneous application intents (APPIs), dynamic network conditions, and severe resource constraints. This paper proposes a novel lightweight LLM architecture, KGLlama-KD, that synergizes knowledge graphs (KGs) with knowledge distillation (KD) to enable intent-driven networking and enhance 6G edge intelligence. Specifically, a KG is constructed to formally describe the relationships among application scenarios, functional primitives, performance requirements within APPIs, and the correspondences between APPIs and network service requests (NSRs), thereby producing a structured intent training dataset. Building upon the Llama 3 foundation model, a two-phase optimization framework is designed to support lightweight edge deployment while preserving translation fidelity. The LLM is first fine-tuned with KG guidance and compressed via KD in the cloud, and then deployed on resource-constrained edge nodes to perform real-time, accurate, and efficient APPIs interpretation. Experiments validate that KGLlama-KD achieves 95% accuracy for APPI understanding, surpassing DeepSeek and Qwen by an average of 8%. The distilled model reduces inference latency by 60% compared to full-scale LLMs, fulfilling the sub-100 ms requirement for 6G latency-sensitive services.

Bing Wu, Sai Zou, Minghui Liwang et al. · 3 citations
#edge computing Sep 2026

Joint Latency and Charge Cost Minimization for Reliable Task Offloading in Dispersed Computing: A Multi-Objective Optimization Approach

Dispersed computing has emerged as a promising paradigm that leverages underutilized resources from massive Internet of Things devices (IoTDs) to enhance the computing capacity at the network edge. However, existing works about the dispersed computing overlook the heterogeneous computing environment with parallel and serial computations and task reliability requirements for the hardware-constrained IoTDs, and they lack multi-objective optimization approaches to optimize the task offloading. To address the challenges, we propose a comprehensive scheme to achieve a delay-aware and economic-aware dispersed computing paradigm by using a multi-objective optimization approach. Particularly, we consider parallel processing at an edge server and serial processing at the lightweight IoTDs, and leverage the task redundancy to satisfy the task reliability requirements on the IoTD side. We further formulate a constrained multi-objective optimization problem (CMOP) aiming at jointly optimizing the task assignment, bandwidth allocation, and CPU frequency allocation to simultaneously minimize the total delay cost and the total charge cost of the tasks. To address the CMOP, we propose an improved constrained multi-objective evolutionary algorithm that employs a dual-population cooperative mechanism between two populations and a repairing constraint-handling technique. The dual-population cooperative mechanism can balance convergence toward Pareto optimality and solution diversity maintenance. The repairing constraint-handling technique is designed to guide solutions toward feasible regions, achieving efficient exploration of complex constrained search spaces. Simulation results demonstrate the superiority of our algorithm in seeking the better-converged and better-distributed Pareto optimal solutions to well address the tradeoffs between the two objectives.

Xumin Huang, Zexiong Wu, Chaoda Peng et al. · 2 citations
#edge computing Sep 2026

Service Enhancement and Reliability Assurance in 6G Vehicular Networks via a Stackelberg Game-Theoretic Approach

With the rapid development of 6G and Internet of Vehicles (IoV) technologies, the volume of computation-intensive tasks generated by intelligent vehicles is growing exponentially. Given limited onboard processing capabilities, vehicles increasingly rely on edge servers deployed by service providers (SPs) at roadside units to offload tasks. Vehicle clients can offload the tasks to SPs to mitigate their onboard computation load, while SPs derive economic benefits through the provision of computation resources. However, this interaction introduces a conflict of interest, as vehicles aim to minimize their offloading costs, while SPs seek to maximize revenue. To address this problem, we propose SPOR, a Stackelberg game-based service priority-aware computation offloading and resource pricing scheme in IoV. SPOR is a hierarchical game-theoretic framework in which SPs act as leaders setting prices, while vehicles act as followers determining their offloading strategies. A novel service prioritization function is introduced, incorporating booking price, system load, and reputation to ensure fair and balanced resource allocation. We provide a theoretical proof of the existence and uniqueness of a Nash equilibrium. Extensive experiments on a real-world vehicle edge computing dataset show that SPOR outperforms baseline methods in delay, energy consumption, average load, and task completion rate. Notably, SPOR maintains task completion rates above 97% even under heavy workloads, demonstrating its effectiveness in enhancing system reliability and overall performance.

Kai Peng, Yuanlin Lin, Shuai Zhao et al. · 2 citations

Related blog posts