ArXivCSExplorer
☆☆Bookmarks🏆RSSHow to UseFAQ
Built with and by Teycir Ben Soltane•
How to Use•FAQ•GitHub•arXiv.org•
Share:

20 results for “wirelength”

CS papers only

Hybrid search: Keyword + semantic, ranked by combined score.ⓘ

Want pure semantic search? Try claim verification →

cs.ITcs.CRRecentMay 7, 2026

Cryptographic and Information-theoretic Security Capacities for General Arbitrarily Varying Wiretap Channels

Holger Boche, Ning Cai, Yiqi Chen, Marc Geitz

The paper compares various strong secrecy capacities for Arbitrarily Varying and General Arbitrarily Varying Wiretap Channels, establishing equivalences under specific conditions and bounding the capa…

View →
cs.DMmath.COEmpiricalRecentJul 16, 2026

A Census of New Snake-in-the-Box Records

Paul Orland, Lucas Fagan, Michele Tarquini, Davide Passaro +6 more

The paper provides new longest chordless paths, called snakes, in hypercube graphs $Q_n$ for dimensions 9 to 13, improving the lower bound on $a(n)$.

View →
cs.ITcs.CRRecentApr 9, 2026

Proximity Gaps Conjecture Fails Near Capacity over Prime Fields

Antonio Kambiré

The paper proves that the proximity gaps conjecture fails for a specific family of Reed-Solomon codes near their capacity rate, specifically at radii $O(1/ ext{log } n)$ below capacity.

View →
cs.ARcs.AIcs.CRRecentApr 15, 2026

VeriCWEty: Embedding enabled Line-Level CWE Detection in Verilog

Prithwish Basu Roy, Zeng Wang, Anatolii Chuvashlov, Weihua Xiao +3 more

VeriCWEty proposes an embedding-based framework to detect and classify common software vulnerabilities (CWEs) in Verilog RTL code at both module and line levels, achieving high detection accuracy.

View →
cs.DSEmpiricalRecentJun 12, 2026

On a Conjecture for Parameterized st-Orientations

Charalampos Papamanthou

This paper disproves a conjecture about the longest-path lengths of MaxSTN and MinSTN algorithms for producing $st$-orientations of biconnected graphs.

View →
cs.CRcs.NIRecentMay 14, 2026

Characterizing AI-Assisted Bot Traffic in Darknet Data: Implications for ICS and IIoT Security

Alex Carbajal, Caleb Faultersack, Jonahtan Vasquez, Shereen Ismail +1 more

This paper analyzes darknet traffic to characterize advanced, AI-assisted bot reconnaissance, finding that modern evasion techniques allow most bot traffic to bypass standard IDS thresholds.

View →
cs.CRRecentApr 17, 2026

ProcRoute: Process-Scoped Authorization of Split-Tunnel Routes

Arul Thileeban Sagayam

ProcRoute is a system that restricts internal network route access to specific, authorized applications, preventing unprivileged processes from exploiting split-tunnel VPN routes.

View →
cs.CRcs.NIRecentMar 24, 2026

What a Mesh: Formal Security Analysis of WPA3 SAE Wireless Authentication

Roberto Metere, Mario Lilli, Luca Arnaboldi, Elvinia Riccobene

This paper provides a comprehensive formal security analysis of the WPA3 SAE protocol by modeling and analyzing both its high-level communication logic and its low-level state machine implementation.

View →
cs.ITTheoreticalRecentJun 19, 2026

Error Exponent Bounds for Optimal Short-Read Clustering

Yoav Chachamovitz, Nir Weinberger

This paper derives bounds on the probability of incorrect clustering of noisy short sequences using statistically optimal rules, focusing on DNA storage decoders.

View →
quant-phcs.CRRecentApr 2, 2026

Topology-Hiding Path Validation for Large-Scale Quantum Key Distribution Networks

Stephan Krenn, Omid Mir, Thomas Lorünser, Sebastian Ramacher +1 more

The paper proposes a provably secure path validation protocol for large-scale Quantum Key Distribution (QKD) networks that allows receivers to verify network compliance without revealing sensitive top…

View →
cs.SDcs.AIcs.CREmpiricalRecentJun 26, 2026

Room for Error: Large-Scale Simulation of Over-the-Air Acoustic Attacks

Andrew C. Cullen, Neil Marchant, Jiani Xie, Paul Montague +1 more

This paper tests the impact of acoustic factors on voice control systems and introduces a Dual-Form Signal to Noise Ratio to decouple source stealth from attack efficacy.

View →
cs.ARcs.LGEmpiricalRecentJul 4, 2026

Weave: Verified Netlist-to-Schematic Conversion via Layered Graph Layout

Senol Gulgonul

This paper presents Weave, a deterministic method to convert SPICE netlists into LTspice schematics with guaranteed connectivity preservation.

View →
math.PRstat.MLTheoreticalRecentJul 8, 2026

Local large deviations for linear-region growth in random piecewise-linear networks

Recep Özkan, Christian Hirsch

This paper studies a random compositional model for the growth of affine regions in deep piecewise-linear networks and proves the existence of a submultiplicative pressure for the number of affine pie…

View →
cs.CRRecentMar 19, 2026

Secure Wi-Fi Ranging Today: Security and Adoption of IEEE 802.11az/bk

Nikola Antonijević, Bernhard Etzlinger, Dave Singelée, Bart Preneel

The paper analyzes the security and practical deployability of advanced Wi-Fi ranging standards (IEEE 802.11az/bk), concluding that while promising, secure implementation is highly sensitive to config…

View →
quant-phcs.CCcs.DSRecentMay 28, 2026

Elfs, transducers and quantum walks

Simon Apers, Jérémie Roland, Yuxin Zhang

This paper introduces Electric Flow Sampling (elfs) as a zero-error quantum walk primitive and uses it to derive improved quantum algorithms for various graph problems, including semi-supervised learn…

View →
astro-ph.SRcs.CRRecentMar 24, 2026

Out-of-Domain Stress Test for Temporal Braid Group Privilege Escalation Detection

Christophe Parisel

The paper validates a specialized mathematical metric (the Burau-Lyapunov exponent) designed for detecting privilege escalation in cloud IAM graphs by applying it to an unrelated physical system: sola…

View →
cs.LGcs.NIEmpiricalRecentJun 28, 2026

Deciphering Region-Level Signatures from Latency Measurements in LEO Satellite Internet

Xiang Shi, Yifei Zhang, Peng Hu

This paper proposes a hierarchical analytical framework to characterize region-level latency differences in Low-Earth orbit satellite Internet using Starlink RTT measurements.

View →
cs.CRcs.ITRecentMar 24, 2026

Canonical Byte-String Encoding for Finite-Ring Cryptosystems

Kyrylo Riabov, Serhii Kryvyi

The paper introduces the base-m length codec, a canonical and robust encoding scheme that maps byte strings to lists of residues modulo m, essential for finite-ring cryptosystems.

View →