Research Papers
Research Papers news — Friday 09 October 2026
25 stories from 1 sources, every one in English. Each links to its publisher.
-
The 2M Multiplication Algorithm for Complex Matrices
arXiv cs.DC (Distributed)
arXiv:2609.05419v2 Announce Type: replace Abstract: Complex matrix multiplication is typically computed using 4 real matrix multiplications (GEMMs) of the same size. The well-known 3M multiplication algorithm reduces this cost to 3 real…
-
Mooncake: A KVCache-centric Disaggregated Architecture for LLM Serving
arXiv cs.DC (Distributed)
arXiv:2407.00079v5 Announce Type: replace Abstract: Mooncake is the serving platform for Kimi, a leading LLM service provided by Moonshot AI. It features a KVCache-centric disaggregated architecture that separates the prefill and decoding…
-
Sovereign Grassroots Currencies: A CBDC Architecture for Credit and Monetary Policy (Full Version)
arXiv cs.DC (Distributed)
arXiv:2609.27727v3 Announce Type: replace-cross Abstract: A Central Bank Digital Currency (CBDC) is central-bank money in digital form, held by the public. Leading designs have two limitations: conversion from bank deposits into CBDC can…
-
IPEK: Event-Criticality-Aware Evidential Trust Management against Strategic Insider Attacks in Vehicular Ad Hoc Networks
arXiv cs.DC (Distributed)
arXiv:2604.07532v3 Announce Type: replace-cross Abstract: Event-based trust management in vehicular ad hoc networks is vulnerable to strategic insider attackers who report trivial events correctly to build reputation, falsify reports on…
-
LLM Agents as Resilience Engineers for Scientific Applications
arXiv cs.DC (Distributed)
arXiv:2610.11260v1 Announce Type: new Abstract: Efficient checkpoint/restart support is essential for resilient HPC scientific applications, but implementing it requires substantial expertise: developers must identify recoverable state…
-
Proof-of-Continuity: A Temporal Model for Authority Propagation in Distributed Systems and AI Agents
arXiv cs.DC (Distributed)
arXiv:2607.08906v2 Announce Type: replace-cross Abstract: Proof-of-Possession authorization models derive authority from the possession of artifacts such as tokens, credentials, or capabilities. This paper argues that possession is…
-
Capturing a Moving Target on Star Graphs by Two Communicating Mobile Agents
arXiv cs.DC (Distributed)
arXiv:2610.11955v1 Announce Type: new Abstract: We study a problem of searching for a mobile target in an $m$-ray star graph, a natural generalization of linear search to multiple directions. The target is placed adversarially on one of…
-
S4oP: Operator-level Pruning of Structured State Space Models for Resource-Constrained Devices
arXiv cs.DC (Distributed)
arXiv:2606.18096v2 Announce Type: replace-cross Abstract: Structured State Space Models (SSMs), including the S4 and S4D architectures, have recently emerged as powerful alternatives to attention-based models for capturing long-range…
-
Federated Zeroth-Order Optimization with Direction Aggregation and Variance Reduction
arXiv cs.DC (Distributed)
arXiv:2610.11821v1 Announce Type: new Abstract: We study constrained nonsmooth nonconvex stochastic optimization in federated settings, where clients access only stochastic function evaluations. Existing federated zeroth-order methods…
-
NosRacer: Dynamic Detection of Race Conditions in On-Device Network Operating Systems
arXiv cs.DC (Distributed)
arXiv:2610.11875v1 Announce Type: new Abstract: Commercial on-device network operating systems (NOSes) run complex control planes in production routers and switches, where configuration update tasks are executed by multiple loosely coupled…
-
PageWeaver: KV-Guided Query Unions for Sparse Attention
arXiv cs.DC (Distributed)
arXiv:2610.11201v1 Announce Type: new Abstract: Dynamic sparse attention limits the KV pages selected by each query, but a small support does not necessarily yield efficient GPU work. Query unions share page loads and populate Tensor Core…
-
A Modular Event-Driven Software Architecture for Open-Source Industrial IoT Edge Gateways
arXiv cs.DC (Distributed)
arXiv:2610.10544v1 Announce Type: cross Abstract: Integrating legacy industrial machinery into modern cloud infrastructures poses a significant software engineering challenge. Industrial Internet of Things (IIoT) deployments frequently…
-
Omnisolver: An extensible interface to Ising spin-glass and QUBO solvers: adding a distributed GPU brute-force plugin
arXiv cs.DC (Distributed)
arXiv:2610.10542v1 Announce Type: cross Abstract: This software update extends Omnisolver with \texttt{omnisolver-bruteforce}, a first-class plugin for exact exhaustive search of QUBO and Ising instances on CUDA-enabled GPUs. The update…
-
Real Long-Term Memory for AI: A 50-Million-Token Window That Is Faster and Cheaper Than Recompute
arXiv cs.DC (Distributed)
arXiv:2610.10845v1 Announce Type: cross Abstract: A large language model can only use the text that fits in its context window, and it recomputes its internal key-value (KV) state for a prompt every time the prompt is sent. We test a…
-
Zepp: Accelerating Distributed MoE Serving under Relaxed Balance Constraints
arXiv cs.DC (Distributed)
arXiv:2610.11158v1 Announce Type: new Abstract: As Mixture-of-Experts (MoE) models continue to scale, serving them increasingly relies on expert parallelism (EP) across a growing number of devices. Yet skewed expert workloads create…
-
Almost Optimal Constant-Round Approximation of Dominating Set in Graph Classes with Excluded Minors
arXiv cs.DC (Distributed)
arXiv:2610.09618v2 Announce Type: replace-cross Abstract: For every fixed proper minor-closed class $\mathscr C$ and every $\epsilon>0$, we give a deterministic LOCAL algorithm that returns a dominating set of size at most $(2a(\mathscr…
-
New Contraction Bounds for Multidimensional Asymptotic Consensus in Dynamic Networks
arXiv cs.DC (Distributed)
arXiv:2610.11805v1 Announce Type: new Abstract: This work studies the multidimensional asymptotic agreement problem in dynamic networks. We assume that nodes have $d$-dimensional inputs and need to converge arbitrarily close to each…
-
eAVID: Asynchronous Verifiable Information Dispersal with Post-Dissemination Pruning
arXiv cs.DC (Distributed)
arXiv:2608.15469v2 Announce Type: replace Abstract: The well-known Asynchronous Verifiable Information Dispersal (AVID) problem lets a sender disperse a message across $N=3F+1$ nodes such that it remains recoverable despite up to $F$…
-
Cassandra: Consensus with Partial Progress via Robust Partitionable View Synchronization
arXiv cs.DC (Distributed)
arXiv:2607.02856v2 Announce Type: replace Abstract: Replicated databases and permissioned blockchains rely on Byzantine Fault-Tolerant (BFT) consensus to maintain a consistent order of transactions across replicas. These protocols preserve…
-
IAPRepair: In-Network Aggregation Enhanced Proactive Repair for Erasure-Coded Storage System
arXiv cs.DC (Distributed)
arXiv:2610.11114v1 Announce Type: new Abstract: Erasure-coded storage provides fault tolerance with substantially lower storage overhead than full replication, but repairing lost or at-risk blocks requires intensive cross-node data…
-
Adaptive Multi-Discriminator WGAN Framework for Resource-Constrained Internet of Vehicles Using Reinforcement Learning and Game Theory
arXiv cs.DC (Distributed)
arXiv:2610.10926v1 Announce Type: cross Abstract: Managing machine learning workloads as a network service introduces a resource-orchestration problem distinct from conventional model training; which nodes should be allocated to a task…
-
DIALER: A Case for Improving Rare-Class Accuracy in Retraining-Free Edge Video Analytics
arXiv cs.DC (Distributed)
arXiv:2610.06358v2 Announce Type: replace Abstract: Edge video analytics with lightweight models is prone to accuracy degradation due to persistent distributional shifts in live video streams. While continuous learning (CL) addresses such…
-
Reconciling Bottom-Up Metrics with Top-Down Reporting for Cloud Carbon Accounting
arXiv cs.DC (Distributed)
arXiv:2610.10148v2 Announce Type: replace Abstract: Organizations seeking to reduce the carbon footprint of their cloud applications must rely on two largely disconnected ways of measuring it, each with important limitations. Bottom-up…
-
Capacity Confounds and Coverage Guarantees in Adaptive Sub-model Federated Learning
arXiv cs.DC (Distributed)
arXiv:2608.07157v2 Announce Type: replace-cross Abstract: Sub-model federated learning lets resource-constrained clients train width-reduced versions of a global model, but existing methods allocate capacity by device resources alone. A…
-
TAPAAL SMC: Statistical Model Checking of Stochastic Timed-Arc Petri Nets
arXiv cs.DC (Distributed)
arXiv:2606.02007v2 Announce Type: replace Abstract: Timed-Arc Petri net (TAPN) is a timed extension of the classical Petri net model where tokens have their age and input arcs are associated with time intervals restricting the ages of…