Tootfinder

Moment-like maps and real algebraic functions with prescribed preimages
Naoki Kitazawa
https://arxiv.org/abs/2506.17791 https://arxiv…

Moment-like maps and real algebraic functions with prescribed preimages
We discuss a problem on singularity theory of differentiable (smooth) or real algebraic maps which is different from knowing existence and has been difficult: constructing explcit real algebraic functions. We discuss construction of real algebraic functions with exactly one singular value, the singular points being of definite type, and prescribed preimages of single points. We discuss generalizations of the canonical projection of the unit sphere around the pole and the Morse-Bott functions …

A Simple but Accurate Approximation for Multivariate Gaussian Rate-Distortion Function and Its Application in Maximal Coding Rate Reduction
Zhenglin Huang, Qifa Yan, Bin Dai, Xiaohu Tang
https://arxiv.org/abs/2506.18613

A Simple but Accurate Approximation for Multivariate Gaussian Rate-Distortion Function and Its Application in Maximal Coding Rate Reduction
The multivariate Gaussian rate-distortion (RD) function is crucial in various applications, such as digital communications, data storage, or neural networks. However, the complex form of the multivariate Gaussian RD function prevents its application in many neural network-based scenarios that rely on its analytical properties, for example, white-box neural networks, multi-device task-oriented communication, and semantic communication. This paper proposes a simple but accurate approximation for …

in the 18th century, some wealthy landowners hired ornamental hermits to reside on their estates. they'd sometimes be asked to make themselves available to guests, answering questions, providing guidance, or intrigue alone. but in some cases, the hermit would not communicate with visitors at all, functioning instead like a perpetual stage play or live diorama. life lived as background dressing to another, in exchange for just enough to keep it going.

Sizing Antenna Arrays for Near-field Communication and Sensing
Marcin Wachowiak, Andr\'e Bourdoux, Sofie Pollin
https://arxiv.org/abs/2506.18465 https:…

Sizing Antenna Arrays for Near-field Communication and Sensing
This paper presents key performance metrics for near-field communication and sensing systems with a focus on their scaling behavior as a function of the antenna array aperture. Analytical expressions are derived for several standard array geometries to enable the design of the large antenna arrays for given system requirements. First, the near-field beam focusing is analyzed and the minimum beamdepth is observed to rapidly saturate to a low asymptotic limit as the array aperture increases. In c…

What's coming in the next version of XS (eXtended Shell)? cpu and us commands. You can now run a single fragment as another user (us) and even on another host (cpu). Example: ```
cpu host {
echo This command is running remotely on `hostname
}
us root {
echo This command is running as `{id -u}
}
```
`ssh` and `sudo` are used to provide this functionality. You can get the source at

DHMS: A Digital Hostel Management System Integrating Campus ChatBot, Predictive Intelligence, and Real-Time Automation
Riddhi Heda, Sidhant Singh, Umair Yasir, Tanmay Jaiswal, Anil Mokhade
https://arxiv.org/abs/2507.17759

DHMS: A Digital Hostel Management System Integrating Campus ChatBot, Predictive Intelligence, and Real-Time Automation
Traditional hostel management practices in academic institutions often suffer from inefficiencies, delays, and fragmented communication. These systems fail to meet the expectations of digitally native students and place a significant operational burden on hostel staff. This paper introduces DHMS (Digital Hostel Management System), a modular and integrated platform designed to digitize and streamline essential hostel management functions. DHMS leverages modern web technologies, artificial intell…

From Atoms to Dynamics: Learning the Committor Without Collective Variables
Sergio Contreras Arredondo, Chenyu Tang, Radu A. Talmazan, Alberto Meg\'ias, Cheng Giuseppe Chen, Christophe Chipot
https://arxiv.org/abs/2507.17700

From Atoms to Dynamics: Learning the Committor Without Collective Variables
This Brief Communication introduces a graph-neural-network architecture built on geometric vector perceptrons to predict the committor function directly from atomic coordinates, bypassing the need for hand-crafted collective variables (CVs). The method offers atom-level interpretability, pinpointing the key atomic players in complex transitions without relying on prior assumptions. Applied across diverse molecular systems, the method accurately infers the committor function and highlights the i…

Just finished "Get a Life, Chloe Brown" by Talia Hibbert. It's... much less chaste than most of the other romances I've been reading, but also incredibly sweet and positive, so I enjoyed it a lot.
My one reservation is that it does the thing a lot of romance novels do where they equate physical desire with romantic desire, and physical flirtations/advances with actual communication, and yes people equate those things in the real world all the time, by it's often really harmful when they do that.
This novel does better with consent than 99% of the field probably, and legitimately deserves props for that, so this isn't the harsh criticism I'd level if it seriously broke the "would this be okay if we didn't have access to interior monologues" test, but it skirts the edges of that a bit.
#AmReading

Noise Quantification and Control in Circuits via Strong Data-Processing Inequalities
Chenyang Sun
https://arxiv.org/abs/2507.15108 https://

Noise Quantification and Control in Circuits via Strong Data-Processing Inequalities
This essay explores strong data-processing inequalities (SPDI's) as they appear in the work of Evans and Schulman \cite{ES} and von Neumann \cite{vN} on computing with noisy circuits. We first develop the framework in \cite{ES}, which leads to lower bounds on depth and upper bounds on noise that permit reliable computation. We then introduce the $3$-majority gate, introduced by \cite{vN} for the purpose of controlling noise, and obtain an upper bound on noise necessary for its function. We end …

On Designing Modulation for Over-the-Air Computation -- Part II: Pyramid Sampling
Saeed Razavikia, Carlo Fischione
https://arxiv.org/abs/2506.16208 https:/…

On Designing Modulation for Over-the-Air Computation -- Part II: Pyramid Sampling
Over-the-air computation (OAC) harnesses the natural superposition of wireless signals to compute aggregate functions during transmission, thereby collapsing communication and computation into a single step and significantly reducing latency and resource usage. In Part I, digital OAC was formulated as a noise-aware constellation design problem by casting encoder design as a max-min optimization that aligns minimum Euclidean distances between superimposed constellation points with squared differ…