Tootfinder

Rolled hummingbird-macrorouting v0.3.0 ; version bump due to API changes (for the better).
Apologies if this conflicts with your travel (though I don’t think anyone hard-depends on this except us, anyway). Complain to me in person. (-:
#Swift #Hummingbird

Release 0.3.0 · sloatescoan/hummingbird-macrorouting
This release contains BC breaks (hence the 0.3.x bump) API changes: rename $Routing.prefix to $Routing.$prefix to avoid collision with a route named prefix rename resolvedPath to path (path can be...

Word Chain Generators for Prefix Normal Words
Duncan Adamson, Moritz Dudey, Pamela Fleischmann, Annika Huch
https://arxiv.org/abs/2508.19619 https://arxiv.…

Word Chain Generators for Prefix Normal Words
In 2011, Fici and Lipták introduced prefix normal words. A binary word is prefix normal if it has no factor (substring) that contains more occurrences of the letter 1 than the prefix of the same length. Among the open problems regarding this topic are the enumeration of prefix normal words and efficient testing methods. We show a range of characteristics of prefix normal words. These include properties of factors that are responsible for a word not being prefix normal. With word chains and gen…

TokenLake: A Unified Segment-level Prefix Cache Pool for Fine-grained Elastic Long-Context LLM Serving
Bingyang Wu, Zili Zhang, Yinmin Zhong, Guanzhe Huang, Yibo Zhu, Xuanzhe Liu, Xin Jin
https://arxiv.org/abs/2508.17219

TokenLake: A Unified Segment-level Prefix Cache Pool for Fine-grained Elastic Long-Context LLM Serving
Prefix caching is crucial to accelerate multi-turn interactions and requests with shared prefixes. At the cluster level, existing prefix caching systems are tightly coupled with request scheduling to optimize cache efficiency and computation performance together, leading to load imbalance, data redundancy, and memory fragmentation of caching systems across instances. To address these issues, memory pooling is promising to shield the scheduler from the underlying cache management so that it can …

TyphoonMLA: A Mixed Naive-Absorb MLA Kernel For Shared Prefix
Ahmet Caner Y\"uz\"ug\"uler, Ahmet \c{C}elik, Jiawei Zhuang, Lukas Cavigelli
https://arxiv.org/abs/2509.21081

TyphoonMLA: A Mixed Naive-Absorb MLA Kernel For Shared Prefix
Multi-Head Latent Attention (MLA) is a recent attention mechanism adopted in state-of-the-art LLMs such as DeepSeek-v3 and Kimi K2. Thanks to its novel formulation, MLA allows two functionally equivalent but computationally distinct kernel implementations: naive and absorb. While the naive kernels (e.g., FlashAttention) are typically preferred in training and prefill for their computational efficiency, existing decoding kernels (e.g., FlashMLA) rely on the absorb method to minimize HBM bandwidt…

@… @… I've recently learned that this is common behavior, but still it's utterly broken. Their RAs promised that you can have the prefix for some time. A local power outage or other brief service interrupt…

Mutually Abelian-Bordered Binary Words
Anuran Maity, K. V. Krishna
https://arxiv.org/abs/2509.20773 https://arxiv.org/pdf/2509.20773

Mutually Abelian-Bordered Binary Words
A word is said to be bordered if it contains a nonempty proper prefix that is also a suffix. A pair of words $(u, v)$ is said to be mutually bordered if there exists a word that is a nonempty proper prefix of $u$ and suffix of $v$, and there exists a word that is a nonempty proper suffix of $u$ and prefix of $v$. Recently, Gabric studied the number of mutually bordered pairs. In this work, we extend the concept of mutually bordered pairs to abelian setting, and determine the number of mutually …

Apropos to my recent blog post on SSH server host key reuse at LightNode (brand of Kaupo), this prefix was found to have many reused keys.
https://social.bgp.tools/@transfers/statuses/01K5WRXSBHYPYBEBZE65TDMHZ2

Post by IP/ASN Transfers, @transfers@bgp.tools
"Beijing Kaopu Cloud technology co. LTD" transferred 103.152.14.0/23 to "Kaopu Cloud HK Limited" (Estimated Market Value: $13.82 K)

ShadowServe: Interference-Free KV Cache Fetching for Distributed Prefix Caching
Xingyu Xiang, Raj Joshi, Yuhan Liu, Jiayi Yao, Chenxingyu Zhao, Junchen Jiang, Yang Zhou, Eddie Kohler, Minlan Yu
https://arxiv.org/abs/2509.16857

ShadowServe: Interference-Free KV Cache Fetching for Distributed Prefix Caching
Distributed prefix caching accelerates long-context LLM serving by reusing KV cache entries for common context prefixes. However, KV cache fetches can become a bottleneck when network bandwidth is limited. Compression mitigates the bandwidth issue, but can degrade overall performance when decompression interferes with model computation. We present ShadowServe, the first SmartNIC-accelerated, interference-free prefix caching system for LLM serving. ShadowServe separates a control plane on the …

Rethinking Caching for LLM Serving Systems: Beyond Traditional Heuristics
Jungwoo Kim, Minsang Kim, Jaeheon Lee, Chanwoo Moon, Heejin Kim, Taeho Hwang, Woosuk Chung, Yeseong Kim, Sungjin Lee
https://arxiv.org/abs/2508.18736

Rethinking Caching for LLM Serving Systems: Beyond Traditional Heuristics
Serving Large Language Models (LLMs) at scale requires meeting strict Service Level Objectives (SLOs) under severe computational and memory constraints. Nevertheless, traditional caching strategies fall short: exact-matching and prefix caches neglect query semantics, while state-of-the-art semantic caches remain confined to traditional intuitions, offering little conceptual departure. Building on this, we present SISO, a semantic caching system that redefines efficiency for LLM serving. SISO in…

I prefer -- as variable name prefix to $
Same key pressed twice > two different keys to press in combination

Important Bit Prefix M-ary Quadrature Amplitude Modulation for Semantic Communications
Haonan Lu, Rui Meng, Xiaodong Xu, Yiming Liu, Ping Zhang, Dusit Niyato
https://arxiv.org/abs/2508.11351

Important Bit Prefix M-ary Quadrature Amplitude Modulation for Semantic Communications
M-ary Quadrature Amplitude Modulation (MQAM) is a commonly used channel modulation technology in wireless communication systems. To achieve dedicated channel modulation for semantic communication (SemCom), we propose an Important-Bit-Prefixed MQAM (IBP-MQAM) scheme and derive its approximate expression of important symbol error rate (ISER) and unimportant symbol error rate (USER). By extracting and quantifying text semantics using Latent Dirichlet Allocation (LDA), we verify that IBP-MQAM achie…

Semantic-Condition Tuning: Fusing Graph Context with Large Language Models for Knowledge Graph Completion
Ruitong Liu, Yan Wen, Te Sun, Yunjia Wu, Pingyang Huang, Zihang Yu, Siyuan Li
https://arxiv.org/abs/2510.08966

Semantic-Condition Tuning: Fusing Graph Context with Large Language Models for Knowledge Graph Completion
Fusing Knowledge Graphs with Large Language Models is crucial for knowledge-intensive tasks like knowledge graph completion. The prevailing paradigm, prefix-tuning, simply concatenates knowledge embeddings with text inputs. However, this shallow fusion overlooks the rich relational semantics within KGs and imposes a significant implicit reasoning burden on the LLM to correlate the prefix with the text. To address these, we propose Semantic-condition Tuning (SCT), a new knowledge injection parad…

🥳 New Kitten Release
Housekeeping:
• Updated runtime version to Node version 22.18.0 (latest LTS).
• Removed `--experimental-global-customevent` in node launch command (as `CustomEvent` is no longer behing the CLI flag since Node v19.0.0)
• Renamed `--experimental-loader` flag to `--loader` as the experimental prefix is no longer required.
…

About fucking time... Android finally doing proper DHCPv6. When this is live on my phone I can turn off SLAAC, and not have Windows insist on using it (yes, there's meant to be ways to stop Windows from using SLAAC, so it only uses DHCPv6, but I never saw any of them work). *I* don't want 'random' addresses, I want predictable ones for firewalling and ACLs:

Exploring Data and Parameter Efficient Strategies for Arabic Dialect Identifications
Vani Kanjirangat, Ljiljana Dolamic, Fabio Rinaldi
https://arxiv.org/abs/2509.13775 https://

Exploring Data and Parameter Efficient Strategies for Arabic Dialect Identifications
This paper discusses our exploration of different data-efficient and parameter-efficient approaches to Arabic Dialect Identification (ADI). In particular, we investigate various soft-prompting strategies, including prefix-tuning, prompt-tuning, P-tuning, and P-tuning V2, as well as LoRA reparameterizations. For the data-efficient strategy, we analyze hard prompting with zero-shot and few-shot inferences to analyze the dialect identification capabilities of Large Language Models (LLMs). For the …

At #CheltLitFest, briefly, for Martin Parr's talk. Bought the book after he signed it and we exchanged the only words we have ever had which is Thank you, and Cheers, though he did prefix it this time with "Oh, I can spell that".
This is remarkably special for me, less for him I suspect.

wanna see my NixOS configuration for a git-pages cluster that announces BGP routes for anycast? it runs on any commodity VPS because i sub-lease a single anycast /32 IPv4 from rage4 instead of an entire /24 prefix
here's the entire thing: https://codeberg.org/grebedoc-dev/rage

rage4.infra.grebedoc.dev
Static pages server for the general public in NixOS using git-pages (Rage4 AnycastIP network)

PREE: Towards Harmless and Adaptive Fingerprint Editing in Large Language Models via Knowledge Prefix Enhancement
Xubin Yue, Zhenhua Xu, Wenpeng Xing, Jiahui Yu, Mohan Li, Meng Han
https://arxiv.org/abs/2509.00918

PREE: Towards Harmless and Adaptive Fingerprint Editing in Large Language Models via Knowledge Prefix Enhancement
Addressing the intellectual property protection challenges in commercial deployment of large language models (LLMs), existing black-box fingerprinting techniques face dual challenges from incremental fine-tuning erasure and feature-space defense due to their reliance on overfitting high-perplexity trigger patterns. Recent work has revealed that model editing in the fingerprinting domain offers distinct advantages, including significantly lower false positive rates, enhanced harmlessness, and su…

Streaming periodicity with mismatches, wildcards, and edits
Taha El Ghazi, Tatiana Starikovskaya
https://arxiv.org/abs/2509.14898 https://arxiv.org/pdf/250…

Streaming periodicity with mismatches, wildcards, and edits
In this work, we study the problem of detecting periodic trends in strings. While detecting exact periodicity has been studied extensively, real-world data is often noisy, where small deviations or mismatches occur between repetitions. This work focuses on a generalized approach to period detection that efficiently handles noise. Given a string $S$ of length $n$, the task is to identify integers $p$ such that the prefix and the suffix of $S$, each of length $n-p+1$, are similar under a given di…

"DHCPv6 PD support is expected to roll out to most devices running Android 11 and above before the end of the year [...]"
https://android-developers.googleblog.com/2025/09/simplifying-advanced-networking-with.html
For bac…

Simplifying advanced networking with DHCPv6 Prefix Delegation
News and insights on the Android platform, developer tools, and events.

Runtime Verification for LTL in Stochastic Systems
Javier Esparza, Vincent Fischer
https://arxiv.org/abs/2508.07963 https://arxiv.org/pdf/2508.07963…

Runtime Verification for LTL in Stochastic Systems
Runtime verification encompasses several lightweight techniques for checking whether a system's current execution satisfies a given specification. We focus on runtime verification for Linear Temporal Logic (LTL). Previous work describes monitors which produce, at every time step one of three outputs - true, false, or inconclusive - depending on whether the observed execution prefix definitively determines satisfaction of the formula. However, for many LTL formulas, such as liveness properties, …

I like #Swift quite a lot, but few things over here make me doubt my life choices as much as having to use a function with a `NS` prefix and pass pointers around, just to fix a rounding error.

Improved Clifford operations in constant commutative depth
Richard Cleve, Zhiqian Ding, Luke Schaeffer
https://arxiv.org/abs/2510.04921 https://arxiv.org/p…

Improved Clifford operations in constant commutative depth
The commutative depth model allows gates that commute with each other to be performed in parallel. We show how to compute Clifford operations in constant commutative depth more efficiently than was previously known. Bravyi, Maslov, and Nam [Phys. Rev. Lett. 129:230501, 2022] showed that every element of the Clifford group (on $n$ qubits) can be computed in commutative depth 23 and size $O(n^2)$. We show that the Prefix Sum problem can be computed in commutative depth 16 and size $O(n \log n)$, …

Thinking Inside the Mask: In-Place Prompting in Diffusion LLMs
Xiangqi Jin, Yuxuan Wang, Yifeng Gao, Zichen Wen, Biqing Qi, Dongrui Liu, Linfeng Zhang
https://arxiv.org/abs/2508.10736

Thinking Inside the Mask: In-Place Prompting in Diffusion LLMs
Despite large language models (LLMs) have achieved remarkable success, their prefix-only prompting paradigm and sequential generation process offer limited flexibility for bidirectional information. Diffusion large language models (dLLMs) present new opportunities through their bidirectional attention mechanisms and iterative refinement processes, enabling more flexible in-place prompting strategies. We introduce ICE (In-Place Chain-of-Thought Prompting with Early Exit), a novel framework that …

Topological Full Groups of Irreducible Edge Shifts have Solvable Conjugacy Problem
Matteo Tarocchi
https://arxiv.org/abs/2508.02582 https://arxiv.org/pdf/2…

Topological Full Groups of Irreducible Edge Shifts have Solvable Conjugacy Problem
In this paper, we solve the conjugacy problem for Topological Full Groups of Irreducible Edge Shifts, introduced by Matui in 2015 and later recontextualized as groups of almost automorphisms of trees by Lederle in 2020. The techniques we use work in a larger class of groups, that of Piecewise-Canonical Homeomorphisms of Edge Shifts (which are essentially the prefix-exchange transformations), which also includes the Houghton groups and the Thompson-like group $QV$, for example. We use strand dia…

The Construction of Near-optimal Universal Coding of Integers
Wei Yan, Yunghsiang S. Han
https://arxiv.org/abs/2507.23180 https://arxiv.org/pdf/2507.23180

The Construction of Near-optimal Universal Coding of Integers
Universal Coding of Integers (UCI) is suitable for discrete memoryless sources with unknown probability distributions and infinitely countable alphabet sizes. The UCI is a class of prefix codes, such that the ratio of the average codeword length to $\max\{1, H(P)\}$ is within a constant expansion factor $K_{\mathcal{C}}$ for any decreasing probability distribution $P$, where $H(P)$ is the entropy of $P$. For any UCI code $\mathcal{C}$, define \emph{the minimum expansion factor} $K_{\mathcal{C}}…

Replaced article(s) found for cs.GT. https://arxiv.org/list/cs.GT/new
[1/1]:
- Expectation in Stochastic Games with Prefix-independent Objectives
Laurent Doyen, Pranshu Gaba, Shibashis Guha

On the Interplay of Cube Learning and Dependency Schemes in QCDCL Proof Systems
Abhimanyu Choudhury, Meena Mahajan
https://arxiv.org/abs/2510.05876 https://

On the Interplay of Cube Learning and Dependency Schemes in QCDCL Proof Systems
Quantified Conflict Driven Clause Leaning (QCDCL) is one of the main approaches to solving Quantified Boolean Formulas (QBF). Cube-learning is employed in this approach to ensure that true formulas can be verified. Dependency Schemes help to detect spurious dependencies that are implied by the variable ordering in the quantifier prefix of QBFs but are not essential for constructing (counter)models. This detection can provably shorten refutations in specific proof systems, and is expected to spe…

Replaced article(s) found for cs.CR. https://arxiv.org/list/cs.CR/new
[1/1]:
- GridSE: Towards Practical Secure Geographic Search via Prefix Symmetric Searchable Encryption (Fu...
Ruoyang Guo, Jiarui Li, Shucheng Yu

Zak-OTFS over CP-OFDM
Saif Khan Mohammed, Saurabh Prakash, Muhammad Ubadah, Imran Ali Khan, Ronny Hadani, Shlomo Rakib, Shachar Kons, Yoav Hebron, Ananthanarayanan Chockalingam, Robert Calderbank
https://arxiv.org/abs/2508.03906

Zak-OTFS over CP-OFDM
Zak-Orthogonal Time Frequency Space (Zak-OTFS) modulation has been shown to achieve significantly better performance compared to the standardized Cyclic-Prefix Orthogonal Frequency Division Multiplexing (CP-OFDM), in high delay/Doppler spread scenarios envisaged in next generation communication systems. Zak-OTFS carriers are quasi-periodic pulses in the delay-Doppler (DD) domain, characterized by two parameters, (i) the pulse period along the delay axis (``delay period") (Doppler period is rela…

Triangle Detection in Worst-Case Sparse Graphs via Local Sketching
Hongyi Duan, Jian'an Zhang
https://arxiv.org/abs/2509.03215 https://arxiv.org/pdf/25…

Triangle Detection in Worst-Case Sparse Graphs via Local Sketching
We present a non-algebraic, locality-preserving framework for triangle detection in worst-case sparse graphs. Our algorithm processes the graph in $O(\log n)$ independent layers and partitions incident edges into prefix-based classes where each class maintains a 1-sparse triple over a prime field. Potential witnesses are surfaced by pair-key (PK) alignment, and every candidate is verified by a three-stage, zero-false-positive pipeline: a class-level 1-sparse consistency check, two slot-level de…

Replaced article(s) found for cs.CR. https://arxiv.org/list/cs.CR/new
[1/2]:
- Prefix Siphoning: Exploiting LSM-Tree Range Filters For Information Disclosure (Full Version)
Adi Kaufman, Moshik Hershcovitch, Adam Morrison