Tootfinder

OmniLLP: Enhancing LLM-based Log Level Prediction with Context-Aware Retrieval
Youssef Esseddiq Ouatiti, Mohammed Sayagh, Bram Adams, Ahmed E. Hassan
https://arxiv.org/abs/2508.08545

OmniLLP: Enhancing LLM-based Log Level Prediction with Context-Aware Retrieval
Developers insert logging statements in source code to capture relevant runtime information essential for maintenance and debugging activities. Log level choice is an integral, yet tricky part of the logging activity as it controls log verbosity and therefore influences systems' observability and performance. Recent advances in ML-based log level prediction have leveraged large language models (LLMs) to propose log level predictors (LLPs) that demonstrated promising performance improvements (AU…

Superior Highly Composite Numbers and the Explicit Upper Bound of Generalized Divisor Functions
Lee-Peng Teo
https://arxiv.org/abs/2508.06764 https://arxiv…

Superior Highly Composite Numbers and the Explicit Upper Bound of Generalized Divisor Functions
For $k\geq 2$, we give a detailed exposition of the superior $k$-highly composite numbers. We then consider the function \[f_k(n)=\frac{\log d_k(n)\log\log n}{\log k\log n},\quad n\geq 3\] which has a maximum value $λ(k)$ at a superior $k$-highly composite number. We develop an efficient algorithm to compute $λ(k)$ and the positive integer $N_{\max}(k)$ where $f_k$ achieves the value $λ(k)$. The results for $2\leq k\leq 100$ are tabled.

Unbiased Insights: Optimal Streaming Algorithms for $\ell_p$ Sampling, the Forget Model, and Beyond
Honghao Lin, Hoai-An Nguyen, William Swartworth, David P. Woodruff
https://arxiv.org/abs/2508.07067

Unbiased Insights: Optimal Streaming Algorithms for $\ell_p$ Sampling, the Forget Model, and Beyond
We study $\ell_p$ sampling and frequency moment estimation in a single-pass insertion-only data stream. For $p \in (0,2)$, we present a nearly space-optimal approximate $\ell_p$ sampler that uses $\widetilde{O}(\log n \log(1/δ))$ bits of space and for $p = 2$, we present a sampler with space complexity $\widetilde{O}(\log^2 n \log(1/δ))$. This space complexity is optimal for $p \in (0, 2)$ and improves upon prior work by a $\log n$ factor. We further extend our construction to a continuous $\…

IT WORKS! ZOMG IT WORKS!!!!
🥳
Turns out, I have to use `internal/runtime/atomic` instead of sync/atomic`` for the `atomic.Bool`.
Then this here will _not_ happen lol:
https://gist.github.com/orangecms/7f985ef19398544114599430b79868f7#file-lol-…

Golang 32-bit Linux futex fixing for year 2038
Golang 32-bit Linux futex fixing for year 2038. GitHub Gist: instantly share code, notes, and snippets.

Volume Polynomials and Log-concavity of the Characteristic Polynomials of Matroids
Eric Katz
https://arxiv.org/abs/2508.08391 https://arxiv.org/pdf/2508.08…

Volume Polynomials and Log-concavity of the Characteristic Polynomials of Matroids
The Rota--Heron--Welsh conjecture (now a theorem of Adiprasito, Huh, and the author) asserts the log-concavity of the characteristic polynomial of matroids. We give an exposition of the Lorentzian polynomial proof following the work of Branden and Leake aimed at undergraduate and beginning graduate students.

A layered architecture for log analysis in complex IT systems
Thorsten Wittkopp
https://arxiv.org/abs/2509.08698 https://arxiv.org/pdf/2509.08698

A layered architecture for log analysis in complex IT systems
In the evolving IT landscape, stability and reliability of systems are essential, yet their growing complexity challenges DevOps teams in implementation and maintenance. Log analysis, a core element of AIOps, provides critical insights into complex behaviors and failures. This dissertation introduces a three-layered architecture to support DevOps in failure resolution. The first layer, Log Investigation, performs autonomous log labeling and anomaly classification. We propose a method that label…

Las Vegas Raiders Game Log https://www.foxsports.com/nfl/las-vegas-raiders-team-game-log

Propagation of weak log-concavity along generalised heat flows via Hamilton-Jacobi equations
Louis-Pierre Chaintron (ENS-PSL), Giovanni Conforti (Unipd), Katharina Eichinger (PARMA)
https://arxiv.org/abs/2508.07931

Propagation of weak log-concavity along generalised heat flows via Hamilton-Jacobi equations
A well-known consequence of the Pr{é}kopa-Leindler inequality is the preservation of logconcavity by the heat semigroup. Unfortunately, this property does not hold for more general semigroups. In this paper, we exhibit a slightly weaker notion of log-concavity that can be propagated along generalised heat semigroups. As a consequence, we obtain logsemiconcavity properties for the ground state of Schr{ö}dinger operators for non-convex potentials, as well as propagation of functional inequaliti…

from my link log —
The difference between fault tolerance, high availability, and disaster recovery.
http://www.pbenson.net/2014/02/the-difference-between-fault-tolerance-high-availability-disaster-recovery/
sa…

Dallas Cowboys Game Log https://www.foxsports.com/nfl/dallas-cowboys-team-game-log

Weekend Reads
* Cloud flow logs for security
https://www.sei.cmu.edu/blog/enhancing-security-with-cloud-flow-logs/
* Supply chain compromises retrospective

Enhancing Security with Cloud Flow Logs
The SEI has a history of support for flow log analysis, including its 2025 releases (for Azure or AWS) of open-source scripts to facilitate cloud flow log analysis. This blog explores challenges with correlating events across multiple CSPs.

Generalized Samorodnitsky noisy function inequalities, with applications to error-correcting codes
Olakunle S. Abawonse, Jan Hazla, Ryan O'Donnell
https://arxiv.org/abs/2508.06940

Generalized Samorodnitsky noisy function inequalities, with applications to error-correcting codes
An inequality by Samorodnitsky states that if $f : \mathbb{F}_2^n \to \mathbb{R}$ is a nonnegative boolean function, and $S \subseteq [n]$ is chosen by randomly including each coordinate with probability a certain $λ= λ(q,ρ) < 1$, then \begin{equation} \log \|T_ρf\|_q \leq \mathbb{E}_{S} \log \|\mathbb{E}(f|S)\|_q\;. \end{equation} Samorodnitsky's inequality has several applications to the theory of error-correcting codes. Perhaps most notably, it can be used to s…

Oh #ShadowServer, now you're just being silly...
#InfoSec #Scanners

Hard Instances of Discrete Logarithm Problem and Cryptographic Applications
Christopher Battarbee, Arman Darbinyan, Delaram Kahrobaei
https://arxiv.org/abs/2508.08823 https://…

Hard Instances of Discrete Logarithm Problem and Cryptographic Applications
Let f be an arbitrary positive integer valued function. The goal of this note is to show that one can construct a finitely generated group in which the discrete log problem is polynomially equivalent to computing the function f. In particular, we provide infinite, but finitely generated groups, in which the discrete logarithm problem is arbitrarily hard. As another application, we construct a family of two-generated groups that have polynomial time word problem and NP-complete discrete log prob…

Ende des Liveblogs
Wir schließen den Liveblog für heute und bedanken uns für Ihr Interesse.
📑 https://www.tagesschau.de/newsticker/liveblog-ukraine-donnerstag-504.html?at_medium=mastodon&a…

Ukraine-Liveblog: ++ Rheinmetall plant Rüstungsfabrik in der Ukraine ++
Der deutsche Rüstungskonzern Rheinmetall will künftig Artilleriegeschosse direkt in der Ukraine produzieren. Morgen tagt der UN-Sicherheitsrat zur Verletzung des polnischen Luftraums durch mutmaßlich russische Drohnen.

How I regret trying a #passkey on an online account!
Before, my #password manager would fill in username & password automatically in the browser, only once in a while I would be asked for 2FA. I clicked "log in", and I was.
Since I accepted the passkey, the browser opens a…

Axing old log store contents to make room for wood that's going to start drying for next year.
#LifeIsAseriesOfCycles

Log Calabi--Yau manifolds: holomorphic tensors, stability and universal cover
Tristan C. Collins, Henri Guenancia
https://arxiv.org/abs/2509.07508 https://…

Log Calabi--Yau manifolds: holomorphic tensors, stability and universal cover
We study various geometric properties of log Calabi-Yau manifolds, i.e. log smooth pairs $(X,D)$ such that $K_X+D=0$. More specifically, we focus on the two cases where $X$ is a Fano manifold and $D$ is either smooth or has two proportional components. Despite the existence of a complete Ricci flat Kähler metric on $X\setminus D$ in both cases, we will show that the geometric properties of the pair $(X,D)$ are vastly different, e.g. validity of Bochner principle, local triviality of the quasi-…

SHAining on Process Mining: Explaining Event Log Characteristics Impact on Algorithms
Andrea Maldonado, Christian M. M. Frey, Sai Anirudh Aryasomayajula, Ludwig Zellner, Stephan A. Fahrenkrog-Petersen, Thomas Seidl
https://arxiv.org/abs/2509.08482

SHAining on Process Mining: Explaining Event Log Characteristics Impact on Algorithms
Process mining aims to extract and analyze insights from event logs, yet algorithm metric results vary widely depending on structural event log characteristics. Existing work often evaluates algorithms on a fixed set of real-world event logs but lacks a systematic analysis of how event log characteristics impact algorithms individually. Moreover, since event logs are generated from processes, where characteristics co-occur, we focus on associational rather than causal effects to assess how stro…

Two for One, One for All: Deterministic LDC-based Robust Computation in Congested Clique
Keren Censor-Hillel, Orr Fischer, Ran Gelles, Pedro Soto
https://arxiv.org/abs/2508.08740

Two for One, One for All: Deterministic LDC-based Robust Computation in Congested Clique
We design a deterministic compiler that makes any computation in the Congested Clique model robust to a constant fraction $α<1$ of adversarial crash faults. In particular, we show how a network of $n$ nodes can compute any circuit of depth $d$, width $ω$, and gate total fan $Δ$, in $d\cdot\lceil\fracω{n^2}+\fracΔ{n}\rceil\cdot 2^{O(\sqrt{\log{n}}\log\log{n})}$ rounds in such a faulty model. As a corollary, any $T$-round Congested Clique algorithm can be compiled into an algorithm that comp…

Crosslisted article(s) found for cs.LO. https://arxiv.org/list/cs.LO/new
[1/1]:
- An MDL-Style Cost Functional KC, Distribution-Preserving Reductions ($A2^d$), and an $AC^0$ log L...
Marko Lela

from my link log —
Let's take esoteric programming languages seriously.
https://arxiv.org/abs/2505.15327
saved 2025-10-11 https://dotat.at/:/XKTKR.…

Let's Take Esoteric Programming Languages Seriously
Esoteric programming languages are challenging to learn, but their unusual features and constraints may serve to improve programming ability. From languages designed to be intentionally obtuse (e.g. INTERCAL) to others targeting artistic expression (e.g. Piet) or exploring the nature of computation (e.g. Fractan), there is rich variety in the realm of esoteric programming languages. This essay examines the counterintuitive appeal of esoteric languages and seeks to analyse reasons for this popul…

Closed-form evaluations of log-sine integrals and Ap\'ery-like sums in terms of polylogarithms
Noam Shalev
https://arxiv.org/abs/2508.05770 https://arx…

Closed-form evaluations of log-sine integrals and Apéry-like sums in terms of polylogarithms
We present a new systematic method for evaluating generalized log-sine integrals in terms of polylogarithms. Our approach is based on an identity connecting ordinary generating functions of polylogarithms to integrals involving the sine function. This method provides closed-form expressions for log-sine integrals of weight up to 4 using only classical polylogarithms, while higher weights require Nielsen polylogarithms. Later we generalize this identity and show how it gives rise to numerous Ap�…

A note on orbifold regularity of canonical metrics
Henri Guenancia, Chung-Ming Pan, Mihai P\u{a}un
https://arxiv.org/abs/2509.09259 https://arxiv.org/pdf/2…

A note on orbifold regularity of canonical metrics
In this short note, we prove that on a compact Kähler variety $X$ with log terminal singularities and $c_1(X)=0$, any singular Ricci-flat Kähler metric has orbifold singularities in restriction to the orbifold locus of $X$.

Implementation of a 8-bit Wallace Tree Multiplier
Ayan Biswas, Jimmy Jin
https://arxiv.org/abs/2509.09178 https://arxiv.org/pdf/2509.09178

Implementation of a 8-bit Wallace Tree Multiplier
Wallace tree multipliers are a parallel digital multiplier architecture designed to minimize the worst-case time complexity of the circuit depth relative to the input size [1]. In particular, it seeks to perform long multiplication in the binary sense, reducing as many partial products per stage as possible through full and half adders circuits, achieving O(log(n)) where n = bit length of input. This paper provides an overview of the design, progress and methodology in the final project of ECE …

Ende des Liveblogs
Für heute schließen wir den Liveblog. Vielen Dank für Ihr Interesse!
📑 https://www.tagesschau.de/newsticker/liveblog-ukraine-dienstag-476.html?at_medium=mastodon&at_campai…

Ukraine-Liveblog: ++ Kiew verlegt weitere Truppen nach Pokrowsk ++
Nach Berichten über durchgesickerte russische Truppen bei Pokrowsk verlegt die Ukraine weitere Truppen in die Region. Der ukrainische Präsident Selenskyj warnt vor Vorstößen Russlands.

Random-effects meta-analysis via generalized linear mixed models: A Bartlett-corrected approach for few studies
Keisuke Hanada, Tomoyuki Sugimoto
https://arxiv.org/abs/2508.08758

Random-effects meta-analysis via generalized linear mixed models: A Bartlett-corrected approach for few studies
Random-effects meta-analysis is widely used for synthesizing results across studies, but the implicit assumption of normality in study-specific aggregate data is often violated. Such violations can lead to biased estimates and misleading conclusions, especially in meta-analyses with small studies or rare events. A prominent example occurs with the log-odds ratio, which exhibits bias that depends on the within-study sample sizes. We first show that conventional methods assuming normality fail to…

Efficient Function Approximation Under Heteroskedastic Noise
Yuji Nakatsukasa, Yifu Zhang
https://arxiv.org/abs/2508.08683 https://arxiv.org/pdf/2508.08683…

Efficient Function Approximation Under Heteroskedastic Noise
Approximating a function $f(x)$ on $[-1,1]$ based on $N+1$ samples is a classical problem in numerical analysis. If the samples come with heteroskedastic noise depending on $x$ of variance $σ(x)^2$, an $O(N\log N)$ algorithm for this problem has not yet been found in the current literature. In this paper, we propose a method called HeteroChebtrunc, adapted from an algorithm named NoisyChebtrunc. Using techniques in high-dimensional probability, we show that with high probability, HeteroChebtru…

from my link log —
StarMalloc: verifying a modern hardened memory allocator.
https://dl.acm.org/doi/abs/10.1145/3689773
saved 2025-10-11 https://

Las Vegas Raiders Game Log https://www.foxsports.com/nfl/las-vegas-raiders-team-game-log

Ende des Liveblogs
Wir beenden an dieser Stelle den Liveblog für heute und bedanken uns für Ihr Interesse.
📑 https://www.tagesschau.de/newsticker/liveblog-ukraine-freitag-556.html?at_medium=masto…

Ukraine-Liveblog: ++ USA und Verbündete werfen Kreml Rechtsbruch vor ++
Die USA und westliche Verbündete haben Russland nach dem Drohnen-Vorfall in Polen Völkerrechtsbruch vorgeworfen. Der ukrainische Präsident Selenskyj sieht den Vormarsch russischer Truppen in der Region Sumy als gescheitert. Der Liveblog vom Freitag zum Nachlesen.

from my link log —
Synthetic aperture radar autofocus and calibration.
https://hforsten.com/synthetic-aperture-radar-autofocus-and-calibration.html
saved 2025-10-11

Synthetic aperture radar autofocus and calibration
3D trajectory position error estimation autofocus, antenna pattern normalization, and polarimetric calibration for drone mounted SAR radar.

Random-Shift Revisited: Tight Approximations for Tree Embeddings and L1-Oblivious Routings
Rasmus Kyng, Maximilian Probst Gutenberg, Tim Rieder
https://arxiv.org/abs/2510.09124 …

Random-Shift Revisited: Tight Approximations for Tree Embeddings and L1-Oblivious Routings
We present a new and surprisingly simple analysis of random-shift decompositions -- originally proposed by Miller, Peng, and Xu [SPAA'13]: We show that decompositions for exponentially growing scales $D = 2^0, 2^1, \ldots, 2^{\log_2(\operatorname{diam}(G))}$, have a tight constant trade-off between distance-to-center and separation probability on average across the distance scales -- opposed to a necessary $Ω(\log n)$ trade-off for a single scale. This almost immediately yields a way to comp…

Dallas Cowboys Game Log https://www.foxsports.com/nfl/dallas-cowboys-team-game-log

Unbounded degree spanning hypertrees in Dirac hypergraphs
Yaobin Chen, Seonghyuk Im, Junchi Zhang
https://arxiv.org/abs/2508.06843 https://arxiv.org/pdf/25…

Unbounded degree spanning hypertrees in Dirac hypergraphs
In 2001, Komlós, Sárközy, and Szemerédi proved that every sufficiently large $n$-vertex graph with minimum degree at least $\left(1/2+γ\right)n$ contains all spanning trees with maximum degree at most $cn/\log n$. We extend this result to hypergraphs by considering loose hypertrees, which are linear hypergraphs obtained by successively adding edges that share exactly one vertex with a previous edge. For all $k > \ell \geq 2$, we determine asymptotically optimal $\ell$-degree conditions t…

Relative mirror symmetry, theta functions and the Gamma conjecture
Fenglong You
https://arxiv.org/abs/2508.06750 https://arxiv.org/pdf/2508.06750

Relative mirror symmetry, theta functions and the Gamma conjecture
Let $X$ be a Fano variety, and $D\subset X$ be an snc anticanonical divisor. We study relative mirror symmetry for the log Calabi--Yau pair $(X,D)$. (1) We prove a relative mirror theorem for snc pairs without assuming the divisors are nef. (2) We study theta functions associated with the pair $(X,D)$. (3) We introduce functions on the mirror that are obtained from the higher-degree part of the big relative quantum cohomology. As an application, we use these new ingredients in relative mirror s…

Extreme values of class group $L$-functions
Jo\~ao Campos-Vargas
https://arxiv.org/abs/2509.05473 https://arxiv.org/pdf/2509.05473

Extreme values of class group $L$-functions
We give a lower bound for the maximum value of class group $L$-functions attached to $\mathbb{Q}(\sqrt{-D})$ at the central point and show that this value is on average at least $$\exp\Bigg(δ\sqrt{\frac{\log D \log \log \log D}{\log \log D}} \Bigg)$$ for any $δ< \frac{1}{4}$.

Optimized Arithmetic Coding for Efficient Data Compression in the Resource-Constrained Internet of Things(IoT)
Vatsala Upadhyay, J. Kokila, Abhishek Vaish
https://arxiv.org/abs/2508.08840

Optimized Arithmetic Coding for Efficient Data Compression in the Resource-Constrained Internet of Things(IoT)
The Internet of Things (IoT) generates vast amounts of heterogeneous data, ranging from sensor readings to log alerts and images, that pose challenges to storage and data transmission in resource-constrained environments. In this context, lossless data compression techniques, like Arithmetic Coding, offer an effective solution owing to their high compression ratio. However, the standard Arithmetic Coding technique is computationally intensive, leading to high memory and processing overhead. Thi…

from my link log —
Signs of AI slop.
https://en.wikipedia.org/wiki/Wikipedia:Signs_of_AI_writing
saved 2025-10-09 https://

Las Vegas Raiders Game Log https://www.foxsports.com/nfl/las-vegas-raiders-team-game-log

Instance-Optimal Matrix Multiplicative Weight Update and Its Quantum Applications
Weiyuan Gong, Tongyang Li, Xinzhao Wang, Zhiyu Zhang
https://arxiv.org/abs/2509.08911 https://

Instance-Optimal Matrix Multiplicative Weight Update and Its Quantum Applications
The Matrix Multiplicative Weight Update (MMWU) is a seminal online learning algorithm with numerous applications. Applied to the matrix version of the Learning from Expert Advice (LEA) problem on the $d$-dimensional spectraplex, it is well known that MMWU achieves the minimax-optimal regret bound of $O(\sqrt{T\log d})$, where $T$ is the time horizon. In this paper, we present an improved algorithm achieving the instance-optimal regret bound of $O(\sqrt{T\cdot S(X||d^{-1}I_d)})$, where…

ℹ️ Beitrag im Liveblog gelöscht oder nicht zuordenbar, es folgt die alte Version:
Der Liveblog vom Donnerstag zum Nachlesen:
🔗 https://www.tagesschau.de/newsticker/liveblog-ukraine-donnerstag-504.html?at_medium=…

Ukraine-Liveblog: ++ Rheinmetall plant Rüstungsfabrik in der Ukraine ++
Der deutsche Rüstungskonzern Rheinmetall will künftig Artilleriegeschosse direkt in der Ukraine produzieren. Morgen tagt der UN-Sicherheitsrat zur Verletzung des polnischen Luftraums durch mutmaßlich russische Drohnen.

A log-free estimate for the diagonal paraproduct high $\times$ high $\to$ low in the 3D Navier-Stokes equation
Pylyp Cherevan
https://arxiv.org/abs/2510.07848 https://

A log-free estimate for the diagonal paraproduct high x high -> low in the 3D Navier-Stokes equation
We consider the diagonal paraproduct arising in the nonlinearity (u * grad) u for the three-dimensional Navier-Stokes equations. On scale-critical windows and in the range 1/6 < delta <= 5/8 we obtain a log-free estimate at the level L^2_t H^-1_x for the projection P_{< N^(1-delta)} div(u_N otimes v_N), consistent with the critical energy scheme. The main tools are phase-geometric integration, anisotropic local estimates on cylinders, and bilinear ell^2 decoupling on a finite-rank surface; the …

R-Log: Incentivizing Log Analysis Capability in LLMs via Reasoning-based Reinforcement Learning
Yilun Liu, Ziang Chen, Song Xu, Minggui He, Shimin Tao, Weibin Meng, Yuming Xie, Tao Han, Chunguang Zhao, Jingzhou Du, Daimeng Wei, Shenglin Zhang, Yongqian Sun
https://arxiv.org/abs/2509.25987

R-Log: Incentivizing Log Analysis Capability in LLMs via Reasoning-based Reinforcement Learning
The growing complexity of log data in modern software systems has prompted the use of Large Language Models (LLMs) for automated log analysis. Current approaches typically rely on direct supervised fine-tuning (SFT) on log-label pairs. However, this exacerbates the domain discrepancy between general-purpose LLMs and specialized log data, causing overfitting. Furthermore, SFT's imbalanced loss computation often allows lengthy contexts to overwhelm critical, concise details in model answers, lead…

from my link log —
Bellcore ManaGeR: running an obscure window system on vintage Linux.
https://www.ninakalinina.com/notes/mgr/
saved 2025-10-12 https://

Strict Log-concavity of $k$-coloured Partitions
Kathrin Bringmann, Ben Kane, Anubhab Pahari, Larry Rolen
https://arxiv.org/abs/2510.07769 https://arxiv.org…

Strict Log-concavity of $k$-coloured Partitions
In recent years, there has been extensive work on inequalities among partition functions. In particular, Nicolas, and independently DeSalvo--Pak, proved that the partition function $p(n)$ is eventually log-concave. Inspired by this and other results, Chern--Fu--Tang first conjectured log-concavity of $k$-coloured partitions. Three of the authors and Tripp later proved this conjecture by introducing recursive sequences and a strict inequality for fractional partition functions, giving explicit e…

Dallas Cowboys Game Log https://www.foxsports.com/nfl/dallas-cowboys-team-game-log

Randomised algebraic constructions for the no-$(k 1)$-in-line problem
Benedek Kov\'acs, Zolt\'an L\'or\'ant Nagy, D\'avid R. Szab\'o
https://arxiv.org/abs/2508.07632

Randomised algebraic constructions for the no-$(k+1)$-in-line problem
The no-(k+1)-in line problem seeks the maximum number of points that can be selected from an $n \times n$ square lattice such that no $k+1$ of them are collinear. The problem was first posed more than $100$ years ago for the special case $k=2$ and has remained open ever since. The general problem was recently resolved in the case $k$ is not small compared to $n$, as Kovács, Nagy and Szabó proved that the upper bound $kn$ can be attained, provided that $k>C\sqrt{n\log{n}}$ for an absolute cons…

Logarithmic Geometry and Geometric Class Field Theory
Aaron Slipper
https://arxiv.org/abs/2508.08648 https://arxiv.org/pdf/2508.08648

Logarithmic Geometry and Geometric Class Field Theory
In this paper, we provide an upgrade of Deligne's geometric class field theory for tamely ramified Galois groups using logarithmic geometry. In particular, we define a framed logarithmic Picard space, and show that a logarithmic compactification of the classical tamely ramified Div-to-Pic map has, for sufficiently large degree, log simply connected fibers given by loagrithmically compactified vector spaces. This provides a canonical bijection between local systems on the curve with divisorial l…

from my link log —
Eon: a programmable effects-based OCaml DNS server.
https://ryan.freumh.org/eon.html
saved 2025-10-11 https://dotat.at/:/R4QXU.html

The Hardy--Ramanujan inequality for sifted sets and its applications
Steve Fan
https://arxiv.org/abs/2508.06005 https://arxiv.org/pdf/2508.06005

The Hardy--Ramanujan inequality for sifted sets and its applications
The well-known Hardy--Ramanujan inequality states that if $ω(n)$ denotes the number of distinct prime factors of a positive integer $n$, then there is an absolute constant $C>0$ such that uniformly for $x\ge2$ and $k\in\mathbb{N}$, \[\#\{n\le x\colonω(n)=k\}\ll\frac{x(\log\log x+C)^{k-1}}{(k-1)!\log x}.\] A myriad of generalizations and variations of this inequality have been discovered. In this paper, we establish a weighted version of this inequality for sifted sets, which generalizes an ea…

from my link log —
Maintaining knowledge about temporal intervals.
https://dl.acm.org/doi/10.1145/182.358434
saved 2025-10-10 https://…

from my link log —
A proposed Handle trait for Rust.
https://smallcultfollowing.com/babysteps/blog/2025/10/07/the-handle-trait/#fnref:3
saved 2025-10-07

A Baseline $T\log^2 T$ Upper Bound for KL-Regularized Prime--Zero Optimal Transport
Zhejun Yang (University of Sydney)
https://arxiv.org/abs/2509.07329 https://

A Baseline $T\log^2 T$ Upper Bound for KL-Regularized Prime--Zero Optimal Transport
We prove that $\mathsf{OT}_η(T)\ll T\log^2 T$ unconditionally via a band-limited test scheme with Fejér averaging. The approach normalizes $\|\widehat f\|_1=Θ(T^{-1})$ to ensure $\|h\|_1\asymp T$ and $\|\widehat h\|_1\ll 1$, and applies an $L^1$-controlled smoothed explicit formula to bound the error terms. As a result, the prime--zero optimal transport distance admits the baseline $T\log^2 T$ upper bound without additional assumptions.

from my link log —
Matrix is email wearing a hoodie.
https://gist.github.com/peterbourgon/04ef9dac27dfc55a0a0fd8e2467874ad
saved 2025-08-01

Matrix ain't it fam
Matrix ain't it fam. GitHub Gist: instantly share code, notes, and snippets.

Logarithmic jets and the chiral de Rham complex of a pair
Emile Bouaziz
https://arxiv.org/abs/2510.04515 https://arxiv.org/pdf/2510.04515

Logarithmic jets and the chiral de Rham complex of a pair
To a smooth variety $X$ with simple normal crossings divisor $D$, we associate a sheaf of vertex algebras on $X$, denoted $Ω^{ch}_{X}(\operatorname{log}D)$, whose conformal weight $0$ subspace is the algebra $Ω_{X}(\operatorname{log}D)$ of forms with log poles along $D$. We prove various basic structural results about $Ω^{ch}_{X}(\operatorname{log}D)$. In particular, if $X^{*}=X\setminus D$ has a volume form then we show that $Ω^{ch}_{X}(\operatorname{log}D)$ admits a topological structure …

from my link log —
Grid-scale batteries in Scotland stabilize power with grid-forming inverters.
https://spectrum.ieee.org/grid-scale-battery-scotland
saved 2025-08-05

Grid-scale Batteries in Scotland Stabilize Power
Grid-scale batteries in Scotland are stabilizing power supply with advanced grid-forming inverters.

Dallas Cowboys Game Log https://www.foxsports.com/nfl/dallas-cowboys-team-game-log

from my link log —
The unlikely revival of nuclear batteries.
https://spectrum.ieee.org/nuclear-battery-revival
saved 2025-08-25

Nuclear Batteries: Energy Storage for Decades
Nuclear batteries that last decades are being developed to power drones, sensors, remote devices and medical implants. Energy storage at its extreme.

Der Liveblog vom Mittwoch zum Nachlesen:
🔗 https://www.tagesschau.de/newsticker/liveblog-ukraine-mittwoch-528.html?at_medium=mastodon&at_campaign=tagesschau.de
📑

Ukraine-Liveblog: ++ Reste von mehr als einem Dutzend Drohnen in Polen gefunden ++
In Polen sind laut Behörden bis zum Abend die Trümmer von mehr als einem Dutzend Drohnen gefunden worden. Nach Angaben von Ministerpräsident Tusk hat Polen konkrete Hilfsangebote von Verbündeten erhalten.

from my link log —
Elizabeth I and the 'Blackamoors': the deportation that never was.
https://www.mirandakaufmann.com/blog/elizabeth-i-and-the-blackamoors-the-deportation-that-never-was
saved 2025-0…

Elizabeth I and the 'Blackamoors': the Deportation that never was
Today I am compelled to blog. There is a wrong I must right. The world simply cannot be allowed to continue to believe that Elizabeth I expelled Africans from her realm in 1596.  This is perhaps...

from my link log —
A polyhedron without Rupert’s property.
https://johncarlosbaez.wordpress.com/2025/08/28/a-polyhedron-without-ruperts-property/
saved 2025-08-28

Rupert’s Property
You can cut a hole in a cube that’s big enough to slide an identical cube through that hole! Think about that for a minute—it’s kind of weird. Amazingly, nobody could prove any co…

from my link log —
The Qweremin: a qwerty theremin.
https://www.linusakesson.net/qweremin/index.php
saved 2025-09-01 https://

Large character sums with multiplicative coefficients
Zikang Dong, Yutong Song, Weijia Wang, Hao Zhang, Shengbo Zhao
https://arxiv.org/abs/2509.09649 https://

Large character sums with multiplicative coefficients
In this paper, we investigate large values of Dirichlet character sums with multiplicative coefficients $\sum_{n\le N}f(n)χ(n)$. We prove a new Omega result in the region $\exp((\log q)^{\frac12+δ})\le N\le\sqrt q$, where $q$ is the prime modulus.

Ende des Liveblogs
Wir schließen den Liveblog für heute. Vielen Dank für Ihr Interesse!
📑 https://www.tagesschau.de/newsticker/liveblog-ukraine-freitag-560.html?at_medium=mastodon&at_campaign…

Ukraine-Liveblog: ++ Deutschland will Druck auf Russland erhöhen ++
Kanzler Merz hat dem ukrainischen Präsidenten Selenskyj zugesagt, den Druck auf Moskau zu erhöhen. Laut US-First-Lady Melania Trump sind acht nach Russland verschleppte Kinder zurück bei ihren Familien in der Ukraine.

from my link log —
Meschers: geometry processing of impossible objects.
https://anadodik.github.io/publication/meschers/
saved 2025-09-06

from my link log —
Rich Hickey already answered that! Design decisions in Clojure.
https://gist.github.com/reborg/dc8b0c96c397a56668905e2767fd697f
saved 2025-09-09

A curated collection of answers that Rich gave throughout the history of Clojure
A curated collection of answers that Rich gave throughout the history of Clojure - rich-already-answered-that.md

from my link log —
You don't need animations.
https://emilkowal.ski/ui/you-dont-need-animations
saved 2025-09-05 https://

You Don't Need Animations
Why you are animating more often than you should.

Ende des Liveblogs
Damit schließen wir den Liveblog für heute. Vielen Dank für das Interesse.
📑 https://www.tagesschau.de/newsticker/liveblog-ukraine-mittwoch-528.html?at_medium=mastodon&at_…

Ukraine-Liveblog: ++ Reste von mehr als einem Dutzend Drohnen in Polen gefunden ++
In Polen sind laut Behörden bis zum Abend die Trümmer von mehr als einem Dutzend Drohnen gefunden worden. Nach Angaben von Ministerpräsident Tusk hat Polen konkrete Hilfsangebote von Verbündeten erhalten.

Local Factorization of p-adic Gamma Sums
Samuel Reid
https://arxiv.org/abs/2508.08407 https://arxiv.org/pdf/2508.08407

Local Factorization of p-adic Gamma Sums
We revisit the proposed equality between discrete Fourier transforms of $p$-adic $Γ_p$--values and $p$-adic $L$--derivatives for odd characters modulo a prime $p$. The clean identity is false in general. Building on Coleman reciprocity and the Gross--Koblitz formula, we prove an exact two-term decomposition: for each odd, nontrivial Dirichlet character $χ\pmod p$, \[ Φ_p (χ):=\sum_{a=1}^{p-1}χ(a)\,\log_p Γ_p \!\left(\frac{a}{p-1}\right) = U_{1,p}\,L'_p(0,χ)\;+\;U_{2,p}\,L(0,χ), \] with …

from my link log —
Crimes with Python's pattern matching.
https://www.hillelwayne.com/post/python-abc/
saved 2025-09-11 https:/…

from my link log —
Cool but obscure X11 tools.
https://cyber.dabamos.de/unix/x11/
saved 2025-03-24 https://dotat.at/:/5BN6Z.htm…

from my link log —
rust-parallel: Run commands in parallel and aggregate outputs, like GNU parallel.
https://github.com/aaronriekenberg/rust-parallel
saved 2025-08-03

GitHub - aaronriekenberg/rust-parallel: Fast command line app in rust/tokio to run commands in parallel. Similar interface to GNU parallel or xargs plus useful features. Listed in Awesome Rust utilities.
Fast command line app in rust/tokio to run commands in parallel. Similar interface to GNU parallel or xargs plus useful features. Listed in Awesome Rust utilities. - aaronriekenberg/rust-parallel

Ende des Liveblogs
Für heute schließen wir den Liveblog. Vielen Dank für Ihr Interesse!
📑 https://www.tagesschau.de/newsticker/liveblog-ukraine-sonntag-580.html?at_medium=mastodon&at_campaign…

Ukraine-Krieg: ++ USA wollen Gespräch zwischen Putin und Selenskyj ++
Laut US-Vizepräsident JD Vance arbeiten die USA daran, Gespräche zwischen Präsident Putin und Präsident Selenskyj zu vereinbaren. Kanzler Merz kündigte in den tagesthemen an, noch heute mit US-Präsident Trump zu telefonieren.

from my link log —
A review of the Helix editor after 1.5 years.
https://felix-knorr.net/posts/2025-03-16-helix-review.html
saved 2025-03-17 …

from my link log —
Mechanical watch: exploded view.
https://fellerts.no/projects/epoch.html
saved 2025-06-24 https://

from my link log —
CriTcl: easily embed C code in Tcl.
https://andreas-kupries.github.io/critcl/
saved 2025-08-03 https://

from my link log —
A proper x86 assembler in Haskell using the Escardó-Oliva functional.
http://blog.vmchale.com/article/escardo-oliva-functional
saved 2025-08-06

from my link log —
Apple's sillyballs (1988).
https://devnonsense.com/posts/apple-sillyballs/
saved 2025-04-30 https://

from my link log —
The key to understanding “Dynamic Programming” is that it’s not referring to “computer programming”.
https://www.vidarholen.net/contents/blog/?p=1172
saved 2025-07-21

from my link log —
Explicit refinement types.
https://dl.acm.org/doi/10.1145/3607837
saved 2025-08-04 https://dotat.at/:/4F…

from my link log —
Asynchrony is not concurrency.
https://kristoff.it/blog/asynchrony-is-not-concurrency/
saved 2025-07-19

from my link log —
SIMD in Rust: you do not need multithreading to do more than one thing at a time.
https://sander.saares.eu/2024/12/31/you-do-not-need-multithreading-to-do-more-than-one-thing-at-a-time/

You do not need multithreading to do more than one thing at a time
As hardware gets faster and more capable, software keeps getting slower. It is remarkable how inefficiently typical apps use the capabilities of modern processors! Often this means an app is doing …

from my link log —
Reading NFC passport chips in Linux.
https://shkspr.mobi/blog/2025/06/reading-nfc-passport-chips-in-linux/
saved 2025-06-25

Reading NFC Passport Chips in Linux
For boring and totally not nefarious reasons, I want to read all the data contained in my passport's NFC chip using Linux. After a long and annoying search, I settled on roeften's pypassport. I can now read all the passport information, including biometrics. Table of ContentsBackgroundRecreating the MRZPython code to generate an MRZCan you read a cancelled passport?Cryptography and other…

from my link log —
Why Lean 4 replaced OCaml as my primary language.
https://kirancodes.me/posts/log-ocaml-to-lean.html#fn.6
saved 2025-08-16

from my link log —
Privacy and security risks in the eSIM ecosystem.
https://www.usenix.org/system/files/usenixsecurity25-motallebighomi.pdf
saved 2025-09-30

from my link log —
How potatoes evolved.
https://www.nhm.ac.uk/discover/news/2025/july/we-finally-solved-the-mystery-of-how-potatoes-evolved.html
saved 2025-08-10

We finally solved the mystery of how potatoes evolved | Natural History Museum
Crisps and mash owe their existence to a series of precise events that took place nine million years ago.

from my link log —
Cuckoo hashing improves SIMD hash tables.
https://reiner.org/cuckoo-hashing
saved 2025-10-04 https://dotat.at/:/6GT24.html

Cuckoo hashing improves SIMD hash tables
Benchmarks and theoretical explanation of why and when cuckoo hashing beats sort beats hash tables.

from my link log —
Gleam programming language tour.
https://tour.gleam.run/everything/
saved 2025-10-07 https://dotat.at/:/72CWQ.html

Everything! - The Gleam Language Tour
An interactive introduction and reference to the Gleam programming language.

from my link log —
The evolution of Lua, continued.
https://www.lua.org/doc/cola.pdf
saved 2025-10-07 https://dotat.at/:/YA5H6.html

from my link log —
Writing a C compiler.
https://norasandler.com/2022/03/29/Write-a-C-Compiler-the-Book.html
saved 2025-06-11

from my link log —
Instead of "auth", we should say "permissions" and "login".
https://ntietz.com/blog/lets-say-instead-of-auth/
saved 2024-05-27

from my link log —
Waffle’s revenge: classic 1 bit 8x8 tiling patterns.
https://www.metafilter.com/207777/Waffles-Revenge
saved 2025-09-05

from my link log —
Runtime-extensible PEG parsers for SQL.
https://duckdb.org/2024/11/22/runtime-extensible-parsers.html
saved 2024-11-22 …

Runtime-Extensible SQL Parsers Using PEG
Despite their central role in processing queries, parsers have not received any noticeable attention in the data systems space. State-of-the art systems are content with ancient old parser generators. These generators create monolithic, inflexible and unforgiving parsers that hinder innovation in query languages and frustrate users. Instead, parsers should be rewritten using modern abstractions like Parser Expression Grammars (PEG), which allow dynamic changes to the accepted query syntax and b…

from my link log —
detour: load the Linux dynamic linker into a statically linked program at run time.
https://github.com/graphitemaster/detour
saved 2025-07-13

from my link log —
The impossible predicament of the death newts.
https://crookedtimber.org/2025/06/05/occasional-paper-the-impossible-predicament-of-the-death-newts/
saved 2025-06-05

from my link log —
Programming languages and dimensions of units of measure.
https://www.cl.cam.ac.uk/techreports/UCAM-CL-TR-391.html
saved 2025-07-30

from my link log —
Bril: an intermediate language for teaching compilers.
https://www.cs.cornell.edu/~asampson/blog/bril.html
saved 2024-07-27

from my link log —
No value restriction is needed for algebraic effects and handlers.
https://www.cambridge.org/core/journals/journal-of-funct…

from my link log —
Jujutsu for busy devs.
https://maddie.wtf/posts/2025-07-21-jujutsu-for-busy-devs
saved 2025-07-29 h…