CS Paper Radar

Weekly top 20 · Systems & Networking

2026-W47 Nov 16 – Nov 22, 2026

Ranked from 1,465 papers submitted on 2 days — week in progress, ranks can still change.

Score = weighted mean ofCitations 20%Upvotes 10%Code stars 10%Venue 15%Code/data 10%Novelty 15%Momentum 15%Substance 5%how it works
1

Life-cycle structural reliability of RC bridge piers under corrosion in a changing climate

cs.PF ·2026-11-16 ·Giuseppe Vittorio Nava, Luca Capacci, Fabio Biondini, Lorenzo Casti
publishedunusualhighly cited
Abstract

Aging and deterioration processes of structures and infrastructure systems can be severely affected by the long-term evolution of environmental conditions expected in a changing climate. This paper aims at investigating the interaction between climate change and environmental aggressiveness on the probabilistic life-cycle performance of concrete structures under corrosion. A simulation-based framework is proposed for life-cycle structural reliability analysis under climate change scenarios. The framework is applied to a bridge pier with hollow core cross-section exposed to chloride-induced corrosion. The results allow to quantify the impact of climate change on long-term probabilistic structural response and highlight the need for proper modeling of the environmental parameters and climate evolution over the entire lifespan of aging structures for optimal life-cycle maintenance and management of structural and infrastructural facilities.

0.68
2

One Mean Can't Rule Them All

cs.AR ·2026-11-16 ·Ahmed Nematallah
published
Abstract · 9 pages, 4 figures, 2 tables. Author's accepted manuscript, licensed CC BY 4.0. Published in IEEE Computer, vol. 59, no. 2, pp. 49-58, Febru…

There has been extensive debate on how to summarize performance results, especially within the computer architecture community. This article presents a systematic approach to choosing the correct mean, aiming to answer this question for all computer scientists once and for all.

0.65
3

Network Intrusion Detection Adaptability under Spurious Labels: A Noise-Aware Few-Shot Class-Incremental Learning Framework

cs.NI cs.AIcs.LG ·2026-11-16 ·Zijian Zhao, Davide Di Monda, Domenico Ciuonzo, Yipeng Wang, Antonio Pescapè
publishedcode/data
Abstract

Network Intrusion Detection Systems (NIDSs) must incrementally adapt to emerging attacks, even when only a limited amount of labeled network traffic is available. Consequently, Few-Shot Class-Incremental Learning (FSCIL)-based NIDSs have gained growing attention. However, existing FSCIL-based NIDSs are highly vulnerable to label noise in newly-observed attack classes. To address this limitation, we propose NAFN, a noise-aware FSCIL-based NIDS framework that reduces the impact of mislabeled data during incremental adaptation. NAFN consists of two components: (i) Noise Detection, which identifies and removes mislabeled biflows using noise-detection algorithms, and (ii) Feature Sampling, which estimates class-conditional embeddings from clean biflows, calibrates them with base-class statistics, and resamples synthetic features to recover the original biflow count. The framework follows the Rethink Few-Shot (RFS) teacher-student paradigm with lightweight nearest-neighbor or logistic regression classifiers, and various pretraining & memory selection strategies. Experiments on CSE-CIC-IDS2018, Edge-IIoT, and IoT-NID datasets show that NAFN effectively preserves prior knowledge and maintains strong incremental performance even under 50% label noise, consistently improving new-class F1-scores over non-denoised baselines, up to +52%, while being time-efficient and robust in cross-network and high-noise incremental settings. The implementation is publicly available to foster reproducibility.

0.49
4

A Copper-Inducible Yeast Biosensor with Bioluminescent Readout: Mathematical Modeling, Experimental Validation, and Photodetector Coupling for Molecular Communication in IoBNT

cs.ET ·2026-11-17 ·Nikolaos Ntetsikas, Styliana Kyriakoudi, Ariel Klavaris, Antonis Kirmizis, Chrysostomos Chrysostomou +2 more
published
Abstract

Engineered living biosensors constitute promising model organisms for bringing Molecular Communications (MC) closer to practical applications. However, challenges associated with their development and characterization have resulted in the relevant literature being limited in the MC domain, . In this paper, we contribute in this direction by leveraging engineered yeast as a basis to detect heavy metals such as copper. The biosensor's development is supported by a validated mathematical characterization and analysis for possible integration in an MC system. Different from the existing literature, mathematical representations of the major biological processes within the yeast copper detoxification pathway are integrated into a comprehensive framework that predicts the time evolution of the CUP1 gene, which is treated as the system output. In the engineered circuit, CUP1 was replaced with GFP, therefore making GFP fluorescence the final system output. Experimental analysis including mRNA transcript quantification and fluorometric measurements, validate the GFP reporting model to a satisfactory degree. This establishes the proposed model as a useful tool for virtual experimentation and the developed testbed as a suitable platform for further engineering of yeast-based copper sensors. The theoretical analysis is further extended by incorporating a self-sustained bioluminescent reporter for yeast, replacing GFP and enabling optical output without external light excitation. The optical response is coupled to a photodetector model, rendering the system suitable for integration into mobile monitoring devices such as Smart Pills. The presented characterization of the yeast receiver as a copper biosensor, constitutes the first step towards the development and characterization of a complete end-to-end MC based system for gut theranostics after coupling with suitable engineered probiotic senders.

0.47
5

Top-Level Operational Equilibrium: When is the response of a distributed system predictable from its own telemetry?

cs.DC cs.PF ·2026-11-16 ·Víctor Casamayor Pujol, Nefeli-Marina Rouska, Boris Sedlak
theorycode/data
Abstract · 38 pages, 1 figure, 14 tables. Code and data: https://github.com/vikcas/TLOE-theoretical_analysis (doi:10.5281/zenodo.24200155)

Distributed systems deployed across the edge-cloud continuum are adapted continuously: scaled, re-routed, given more or less capacity. Each adaptation rests on an expectation of how the system will respond, yet operators cannot tell from the telemetry they already collect whether that response is predictable. We define top-level operational equilibrium (TLOE), a notion of equilibrium for a running system, stated relative to the controls its operator declares. TLOE has three conditions: stationarity with time-scale separation, sufficiency of a top-level aggregate for the controls, and time-reversibility of that aggregate. We prove that an aggregate satisfying the last two exists if and only if the minimal sufficient statistic of the controls is time-reversible, so the coarsest admissible aggregate is derived rather than chosen. Under the first two conditions, the response to a small control change follows from passive telemetry through the steady-state fluctuation-response identity, with a conjugate observable fixed by the type of control: the total work in progress for a change of load, the occupancy of a stage for a change of its capacity. For chains of exponential single-server stages with Poisson input, TLOE holds exactly for load control at every stable throughput, but never for a control on the capacity of the first or last stage. On reference models, a per-stage conjugate overestimates the early response about threefold, blocking between stages breaks both conditions weakly, and a hysteretic autoscaler leaves no admissible aggregate at any reaction time computed. We specify a test for each condition, show that a static sufficiency test with an estimated top-level conjugate has no power, and quantify on simulated telemetry the window lengths the prediction and the reversibility test need. The evidence is on reference models; real telemetry is left to future work.

0.44
6

ThermLeT: Transformer-based Temperature Prediction for 2.5D Chiplet Architecture

cs.AR cs.AIcs.LG ·2026-11-16 ·Varun Darshana Parekh, Anusha Devulapally, Sivani Devarapalli, Cassius Henderson, Shimeng Yu +1 more
publishedcode/data
Abstract · Published at VLSID 2026. Code and dataset: https://github.com/MicroSystemsDesignLab/ThermLeT

The drive toward heterogeneous 2.5D chiplet packages promises unmatched performance and customization, yet the resulting density amplifies thermal challenges. To facilitate rapid design space exploration, we present ThermLeT, a multimodal transformer-based, scale invariant surrogate that integrates power density maps, spatial coordinate embeddings, material properties and heat transfer rate to predict steady state temperature in 13 ms, about four orders of magnitude faster than conventional finite element solvers such as ANSYS. To train the transformer model, we also create a dataset of 6,221 chiplet layouts perturbed from three representative architectures. On a 150 sample test set, ThermLeT achieves an RMSE of 3.16°C and an MAE of 2.24°C, improving accuracy by 35% over ThermEDGe and by 71% over HotSpot, while running approximately 6x and 11x lower inference latencies respectively. Ablation studies confirm robust generalization to unseen floorplans. Code and dataset available at https://github.com/MicroSystemsDesignLab/ThermLeT

0.43
7

MASQ: Measurement-Adaptive Sampling for Near-Clifford Quantum Error Correction Circuits

cs.ET quant-ph ·2026-11-17 ·Chaebin Jung, Sangmin Jeon, Kyeongwon Lee, Sechan Park, Woojoo Lee
published
Abstract · 7 pages, 3 figures, and 1 table. This paper has been accepted for publication at DATE 2027

Classical sampling of quantum error correction (QEC) circuits supports fault-tolerant protocol evaluation, but estimating rare logical failures requires many independent shots. Frame-active-state simulators isolate non-stabilizer information in a dense active-state vector, yet dense-state processing remains exponential in the active width. This paper presents MASQ, an exact measurement-adaptive sampler for near-Clifford QEC circuits based on selective materialization of non-Clifford rotations. At each measurement boundary, MASQ materializes only rotations in a measurement-relevant closure capturing direct and indirect non-commuting dependencies, deferring the rest to limit active-state expansion. Stabilizer-assisted elimination further removes rotations certified to be invisible to all future measurements. A circuit-dependent schedule is computed once and shared across shots, while adaptive caching of conditional Born probabilities and batched execution reduce repeated sampling work while preserving the measurement-record distribution. Across 19 QEC benchmarks, MASQ reduces peak active width by up to 40 active virtual qubits and achieves up to 8,098-fold CPU throughput speedup over Clifft on multi-round circuits.

0.43
8

Collecting Infrastructure-Level Measures for Energy Analysis in Modern Computing Infrastructures

cs.DC ·2026-11-17 ·Isac Pasianotto, Stefano Cozzini, Niccolo Tosato
top venuedataset
Abstract · Accepted version. Published in SC Workshops '26 (Chicago, IL, USA, 2026). Version of Record: https://doi.ieeecomputersociety.org/10.1109/SCW…

Modern HPC facilities are complex environments in which all components are tightly coupled; consequently, precisely modeling and accounting for energy consumption requires approaches that go beyond instrumenting individual compute nodes. Aiming for a cluster-wide vision, we designed a scalable data collection pipeline that aggregates fine-grained measurements from multiple subsystems-spanning component loads, software and hardware counters, sensors and energy-ensuring consistent sampling frequencies and synchronized data acquisition across the infrastructure. We present a dataset of comprehensive metrics collected at 1 Hz over one month from a production research data center supporting heterogeneous workloads, including HPC, Kubernetes services, and distributed storage. To illustrate what this approach makes possible in practice, we analyze two case studies-distributed I/O and large-language-model inference-showing how cluster-wide measurement reveals system-level dynamics missed by localized instrumentation. The proposed dataset and collection methodology provide a foundation for future work on predictive modeling, energy-aware resource management, and more efficient computing infrastructures.

0.42
9

Pelorus: Warped-Product Graph Indexing for Hyperbolic Vector Search

cs.DB ·2026-11-17 ·Wenxuan Xiao, Xu Cao
code/data
Abstract · 30 pages, 6 figures. Full version with proofs and supplementary experiments. Code and artifacts available at https://github.com/Astrmira/Pel…

Hyperbolic embeddings capture hierarchical relations, but million-scale approximate nearest neighbor search must reconcile geodesic fidelity with memory efficiency. Flat inner-product indices distort order across radial shells, while native hyperbolic graphs repeatedly access full-precision vectors or quantize coordinates with singular conformal scales. We present Pelorus, a warped-product proximity-graph index for hyperbolic vector search. Pelorus separates unquantized FP32 radial and conformal scalars from scale-invariant 2-bit spherical directional codes and defers full-vector FP64 evaluation to a compact reranking tail. A conformal distortion analysis motivates orthogonal-projection debiasing, purity-gated tangent-cone residuals, and Conformal Jacobian gating. QuadriPrune allocates edges across geodesic fibers, same-shell rings, and radial elevators, with spanning-tree chord swaps restoring entry reachability. A single-page record layout and carry-save AVX2 kernel accelerate traversal. Across eight real and synthetic benchmarks on AMD EPYC 9654, Pelorus builds Cohere-1M indices 5.44x faster than full-precision polar graphs on 32 threads, reducing hot navigation memory to 517.0 MB. At 99% Recall@10, it improves Cohere-1M throughput by 4.30x on one thread and 6.31x on 24 threads, and delivers 53,483 QPS on MERU-1M. On clustered narrow shells, tangent-cone residuals raise recall from 34.22% to 99.385%, while isotropic narrow-shell stress tests expose remaining recall limits.

0.42
10

V2V Communications Using Blockchain-Enabled 6G Technology and Federated Learning

cs.NI cs.AIcs.CRcs.LG ·2026-11-16 ·Tahir H. Ahmed, Jun Jiat Tiang, Azwan Mahmud, Dinh-Thuan Do, Truong Tran +1 more
published
Abstract

This study proposes an interesting approach for vehicle-to-vehicle (V2V) communication, which integrates blockchain technology, federated learning (FL), and allocation optimization of latency and resources. The research evaluates the proposed system using various performance metrics such as packet delivery ratio (PDR), model accuracy, and latency and demonstrates its superiority over existing techniques. Furthermore, the system provides enhanced security through consensus optimization and k-anonymity for data privacy. Overall, the proposed system is a promising solution for efficient and secure V2V communication in the era of connected and autonomous vehicles. Moreover, the proposed approach achieves higher reliability, lower latency, and better resource utilization compared to traditional 5G.

0.42
11

Clock Distribution Network with Backside Clock Mesh in BSPDN Architecture

cs.AR ·2026-11-16 ·Seohyun Kim, Youngjin Chae, Shilong Zhang, Youngsoo Shin
top venue
Abstract · Accepted to ASP-DAC 2027

We propose a clock distribution network (CDN) in which the clock mesh is located on backside metal (BM) layers, while the rest of the network remains on the frontside. Since the backside power distribution network (BSPDN) also uses the BM layers, the clock mesh and power network must share them. We identify an important problem of placing mesh receivers while accounting for keep-out zones (KOZs) between clock- and power-nTSVs. We show that this problem can be solved using a potential-field method (PFM). Machine learning models are developed to place the mesh receivers: a U-Net predicts their initial positions, and an MLP predicts force weights for PFM-guided position refinement. Both models are trained through self-supervised learning by optimizing a differentiable objective that accounts for clock latency, IR-drop, and KOZ violations. Experimental results show that, on average, the proposed CDN reduces maximum local clock latency by 26%, global clock skew by 40%, and mesh switching power by 29% compared with a frontside CDN. On the same backside CDN, ML-guided PFM satisfies KOZ constraints while lowering IR-drop by 33% and requiring 85% fewer iterations than standard PFM.

0.40
12

Do Apple M-Series Processors Enforce the Compound Memory Model? Sequential and Parallel Composition of Arm and TSO

cs.AR cs.PL ·2026-11-16 ·Vijay Nagarajan
code/data
Abstract · 26 pages, 6 figures, 11 tables. Artifact: https://github.com/vijay-nagarajan/apple-tso-litmus

Apple's M-series processors can run each thread under the Arm memory model or under a TSO model, and threads of both kinds can share memory. This raises two questions of composition that Apple has not answered. Across threads, how does the machine behave as a whole? Within a thread, which Arm instructions play the roles of TSO's loads, stores and atomic read-modify-writes, and how are they ordered between themselves and across other Arm instructions? We propose that both answers are compositions of preserved program order. Across threads, each thread keeps the preserved program order of its own model: a parallel composition. Within a TSO thread, every Arm instruction keeps TSO's order and adds Arm's, and every atomic memory operation (AMO) is locked, as x86's read-modify-writes are: a sequential composition. We test both on an Apple M1 and an Apple M2 running Linux, with 936 litmus tests chosen from the two models' preserved program order, each run 6x10^8 times on each machine. Arm-mode threads follow Arm's official model, TSO-mode threads follow x86-TSO and the sequential composition, and programs that mix the two modes follow the compound model: neither machine shows an outcome these models forbid. Both machines also preserve three orders that these models do not require, and a compare-and-swap whose comparison fails behaves as if it writes back the value it read, which the Arm model does not require. All three orders held in runs up to 40 times longer.

0.40
13

Gateway-Free Kafka Streaming from FPGA-Based Detectors: A Bare-Metal Pipelined Producer on Zynq-7000

cs.NI cs.AR ·2026-11-17 ·Fernanda Zapata Bascuñán, Matías Hampel
published
Abstract · Accepted for pucblishing at IEEE Explore proceedings of ARGENCON 2026

We present a bare-metal Apache Kafka producer implemented on a Zynq-7000 System-on-Chip (SoC) for event-driven data acquisition. Events are generated in Programmable Logic (PL), transferred to the Processing System (PS) through AXI4-Stream and AXI DMA, and published to a standard Kafka broker without an intermediate gateway computer. The PS constructs ProduceRequest messages and transmits them through the lwIP raw TCP/IP API. A configurable pipeline limits the number of outstanding Kafka requests. Pipeline depths of D = 1, 2, 4, and 8 were evaluated with two independent DMA sources. For each depth, 20 independent runs of 5,000 events were acquired, for 400,000 event records in total. Each event carries a 32-bit frame counter and a 32-bit PL timestamp. PS-side instrumentation records DMA start and completion, publication, successful local tcp_write() acceptance, and reception of the corresponding Kafka acknowledgement. Measurement records are exported to a separate Kafka topic after the timed event stream has completed. Each of the 80 runs contained 5,000 records with frame values from 0 to 4,999, with no sequence discontinuities in the exported metric records and no recorded Kafka errors. Mean operational throughput was approximately 5.3 kevents/s at D = 1, 9.4-9.6 kevents/s at D = 2, 16.2 kevents/s at D = 4, and 16.8-17.5 kevents/s at D = 8. The median publish-to-acknowledgement interval was 1.62-1.64 ms at D = 1, 0.98 ms at D = 2, 0.66 ms at D = 4, and 0.83-0.86 ms at D = 8. At D = 4, the corresponding P95 values were 0.81-0.83 ms.

0.40
14

Tight Width Minimisation of Self-Join-Free Quantified Conjunctive Queries

cs.DB cs.LO ·2026-11-16 ·Hubie Chen, Fabio Mogavero, Sam M. Thompson
top venue
Abstract · To appear at PODS 2027

Query minimisation is a classical problem in database theory and the width of a formula, defined as the maximum number of free variables over all subformulae, is a central measure for query evaluation. We study width minimisation for a subclass of quantified conjunctive queries (QCQs), namely self-join-free QCQs. For this subclass, we show that rewriting optimality coincides with semantic optimality: given a query $φ$, the minimum-width query obtainable from $φ$ by applying natural and established rewriting rules has minimum width among all first-order formulae logically equivalent to $φ$. As a consequence, the width of a self-join-free QCQ can be optimised by a logical-equivalence-preserving rewriting algorithm.

0.39
15

3D-VASE: Volumetric-Aware Scalable and Efficient Multi-Layer Design Synthesis for 3D-Printed Microfluidics

cs.ET ·2026-11-17 ·Yushen Zhang, Jiashuo Chen, Tsun-Ming Tseng, Ulf Schlichtmann
published
Abstract · Accepted for publication in the 32nd Asia and South Pacific Design Automation Conference (ASP-DAC 2027)

Additive manufacturing (3D printing) enables complex multi-layer microfluidic devices, but the physical synthesis of passive-flow designs remains a key bottleneck. In such systems, designers must encode timing synchronization and target dosing directly into channel geometry, even though the available routing space across multiple 3D layers is often highly congested, which makes scaling to complex designs difficult. Existing approaches formulate placement, routing, and fluidic constraints as a single monolithic optimization, leading to combinatorial explosion and poor performance on complex designs. This paper presents a volumetric-aware two-stage synthesis framework that decouples global structure from routing detail. A Mixed-Integer Programming (MIP) model first computes a compact multi-layer placement, followed by a dynamic 3D routing engine that enforces timing and volumetric constraints during path construction. To further improve routability in dense layouts, we introduce a hierarchical conflict resolution strategy combining local rip-up-and-reroute with controlled global expansion. Experimental results show that, under timing and volumetric constraints, 3D-VASE consistently improves synthesis speed and, in most test cases, also improves layout quality. Notably, for difficult large-scale cases where prior methods often failed to return any solution within the time limit, 3D-VASE produces feasible high-quality layouts within practical runtimes. These advances enable fast, iterative design-space exploration for complex 3D-printed microfluidic systems.

0.36
16

ASCEND: Automated Shockproof Cost-Efficient Network Design

cs.NI ·2026-11-16 ·Taha ValizadehAslani, Vaibhav Phatarpekar, Cameron Brackmann, Bala Ramachandran
Abstract · Submitted to IEEE Transactions on Network and Service Management

Designing resilient and cost-effective IP network topologies over an existing physical infrastructure is a challenging combinatorial optimization problem, particularly at large scale and under extensive failure modeling assumptions. Traditional deterministic approaches struggle to jointly address resiliency against shock (large customer-impact outages) and implementation cost objectives when the number of candidate circuits grows quadratically with the number of sites to be interconnected. In this paper, we propose Automated Shockproof Cost-Efficient Network Design (ASCEND), a systematic design pipeline for IP core network optimization based on a two-level optimization framework. At the outer level, ASCEND uses Multi-Objective Particle Swarm Optimization (MOPSO) to select core sites and core circuits. Given a core design, the inner-level integral Multi-Commodity Flow (MCF) formulation selects edge circuits and maps both core and edge circuits onto optical (fiber/transport) paths while prioritizing resource disjointness and latency. Network designs are evaluated using two competing objectives: a performance cost capturing resiliency under probabilistic failure scenarios and an implementation cost. The performance cost incorporates an exponentially weighted vulnerability metric that explicitly penalizes infeasible configurations. Experimental results on multiple real-world networks demonstrate that ASCEND consistently identifies designs that outperform a manually engineered baseline in both resiliency and implementation cost.

0.36
17

HiGAI-Net: Hierarchical Encrypted Traffic Classification for Generative AI Services

cs.NI ·2026-11-17 ·Madhan Raj Kanagarathinam, Jaheon Gu, Krishna M. Sivalingam, Kapal Dev
published
Abstract · Paper accepted in IEEE Globecom 2026

The Radio Access Network (RAN) today does not have a reliable way to identify GenAI traffic (ChatGPT, Microsoft Copilot, or Google Gemini traffic) at the bearer level. TLS~1.3 moves SNI into the encrypted handshake record, and Encrypted ClientHello (ECH) removes it entirely from passive inspection; Gemini has partly shifted to QUIC where SNI visibility also depends on whether ECH is deployed. Without per-flow application identity, differentiated QoS for GenAI services is not possible. HiGAI-Net tackles this using only packet-header metadata, stacking three independently trained classifiers: a binary AI/Non-AI gate (98.5 % weighted F1), a per-service resolver across ChatGPT, Copilot, and Gemini (86.4 %), and a text-vs-voice/video mode classifier (61.0 %). The core innovation is a suite of sliding-window temporal features that track how DL/UL byte-ratios evolve within a session -- the per-quarter and per-half ratio trends, a trend differential $ΔR$, and a streaming regularity index. Tested on 44,492 labeled flows, gradient-boosted tree models consistently outperformed all deep-learning variants; a per-flow label cache brings amortised inference below 1~$μ$s per packet.

0.34
18

Errpedia: Is Your Exact $k$-NN Vector Search Really Exact?

cs.DB ·2026-11-17 ·Yinuo Deng, Ying Zhang, Hanchen Wang, Wenjie Zhang
benchmarkdatasetcode/data
Abstract

Exact $k$-nearest-neighbor ($k$-NN) vector search is a common feature of vector libraries and database systems. It serves applications that require exact results and provides the ground truth for evaluating approximate search. However, floating-point rounding and overflow can cause an exact search to return mathematically incorrect top-$k$ result sets. These errors can go unnoticed and affect downstream tasks that rely on exact results. We present Errpedia, a purpose-built dataset for testing the numerical correctness of exact vector search. Errpedia contains 1,616 queries across 21 error categories, with ground truth independently verified using exact rational arithmetic. We evaluate 20 widely used library and database configurations and find that every tested configuration returns mathematically incorrect top-10 result sets on at least 1 applicable query. Failures include misranking nearly equidistant vectors and returning incomplete results: 1 library omits all 10 exact matches to a query, and several systems return fewer than $k$ neighbors. We release Errpedia as a reproducible benchmark for developers and researchers to test their implementations. The dataset is publicly available at https://github.com/dynos01/errpedia.

0.34
19

Design Rules for Low-Latency Multipath Congestion Control

cs.NI ·2026-11-16 ·Danny De Vleeschauwer, Chia-Yu Chang, Koen De Schepper, Simone Bolettieri
Abstract

We first study optimal congestion control from a theoretical perspective. Concretely, we consider a system that optimizes the sum of the utilities of all the users, in which the users are allowed to send their traffic over different paths over the network and derive design rules that optimal (low-latency) multipath congestion control needs to follow. Because, as it turns out that optimal congestion control requires coordination between the network nodes, and hence, is hard to implement, we investigate how to approximate its performance with algorithms in which (i) the network nodes make independent decisions and (ii) coordination is only allowed between the subflows that belong to the same user. Therefore, these design rules need to be slightly relaxed. We compare the performance of these realistic algorithms with the optimal algorithm. We also investigate to what extent the algorithms that are currently defined and are being defined in the Internet Engineering Task Force (IETF), in particular, (i) Prague congestion control (i.e., congestion control based on Accurate Explicit Congestion Notification (AccECN) marks) and (ii) a variant of a loss-based multipath congestion control algorithm, adhere to these rules.

0.33
20

Countering Anion Inhibition of Laccase Electron Transfer: Electrostatic Design, Charge-Transfer Dynamics on a Superconducting Quantum Processor, and Its Limits

cs.ET ·2026-11-17 ·Lucia Malickova
benchmarkunusual
Abstract · Main text 17 pages, supporting informations 13 pages

Hydroxide at neutral-to-alkaline pH and halides inhibit fungal laccases and limit their use in wastewater treatment. From GFN2-xTB cluster models of Trametes versicolor laccase (PDB 1GYC) we build a four-site Hubbard model of the His454-T3A-T3B-His452 junction of the trinuclear copper cluster and execute its charge-transfer dynamics on the Euro-Q-Exa quantum computer (IQM, 8 qubits, Trotterized circuits with Pauli twirling; 726 jobs). The charge-transfer frequency is measured to 3-5 meV, reproducibly over nine days and across changes of the device qubit map: hydroxide raises the charge-transfer energy of the crystal-geometry model by 92.0 +/- 2.2 meV (exact 87) and exceeds fluoride by 10.1 +/- 1.8 meV. A screen of charged probes in three dielectric models identifies Y116E; in the probe model the hardware resolves a reduction of the hydroxide penalty by 74 +/- 7 meV and of the halide penalty by 64 +/- 5 meV, acting on the site-energy gap rather than on the coupling. A real Glu116 (five conformers) with PROPKA protonation states and the coupled Asp456 gives a realistic reduction of 10-30 meV, with the same sign in 28 of 28 model combinations; the direction and ordering are the prediction, rate factors only an illustration. Scanning the on-site repulsion reverses the sign of the hydroxide effect, and a one-electron Hartree model reproduces the reversal: the measured dynamics is effectively single-particle. On a Fermi-Hubbard benchmark the hardware does not resolve electron correlation; it would need a contrast loss below 0.13 percent per CZ gate instead of the measured 0.34-0.54 percent.

0.32