Tootfinder

Evaluating the Quality of Randomness and Entropy in Tasks Supported by Large Language Models
Rabimba Karanjai, Yang Lu, Ranjith Chodavarapu, Lei Xu, Weidong Shi
https://arxiv.org/abs/2510.12080

Evaluating the Quality of Randomness and Entropy in Tasks Supported by Large Language Models
The rapid advancement of large language model (LLM) technology has led to diverse applications, many of which inherently require randomness, such as stochastic decision-making, gaming, scheduling, AI agents, and cryptography-related tasks. However, the capabilities of LLMs in handling randomness, particularly in generating and utilizing random numbers effectively, remain unclear. This paper investigates the capacity of LLMs for handling tasks that involve randomness through a series of experime…

A central limit theorem for unbalanced step-reinforced random walks
Zhishui Hu, Liang Dong
https://arxiv.org/abs/2510.10898 https://arxiv.org/pdf/2510.1089…

A central limit theorem for unbalanced step-reinforced random walks
In this paper, we study a class of unbalanced step-reinforced random walks that unifies the elephant random walk, the positively step-reinforced random walk, and the negatively step-reinforced random walk. By establishing a connection with bond percolation on random recursive trees, these processes can be represented as randomly weighted sums of independent and identically distributed random variables. We first derive normal and stable central limit theorems for such randomly weighted sums, and…

Trump drops Marjorie Taylor Greene endorsement, calls her a 'ranting lunatic,' hints at backing primary rival (Jasmine Baehr/Fox News)
https://www.foxnews.com/politics/trump-drops-marjorie-taylor-greene-endorsement-calls-her-ranting-lunatic-hints-backing-primary-rival
http://www.memeorandum.com/251114/p138#a251114p138

Statistical Quantum Mechanics of the Random Permutation Sorting System (RPSS): A Self-Stabilizing True Uniform RNG
Randy Kuang
https://arxiv.org/abs/2509.10174 https://

Statistical Quantum Mechanics of the Random Permutation Sorting System (RPSS): A Self-Stabilizing True Uniform RNG
We present the Random Permutation Sorting System (RPSS), a novel framework for true uniform randomness generation grounded in statistical quantum mechanics. RPSS is built on a pair of conjugate observables, the permutation count and the elapsed sorting time, whose heavy-tailed raw distributions synchronously converge to uniformity through modular reduction. This mathematically proven convergence establishes RPSS as a True Uniform Random Number Generator (TURNG). A practical implementation, QPP-…

Runtime Composition in Dynamic System of Systems: A Systematic Review of Challenges, Solutions, Tools, and Evaluation Methods
Muhammad Ashfaq, Ahmed R. Sadik, Teerath Das, Muhammad Waseem, Niko Makitalo, Tommi Mikkonen
https://arxiv.org/abs/2510.12616

Runtime Composition in Dynamic System of Systems: A Systematic Review of Challenges, Solutions, Tools, and Evaluation Methods
Context: Modern Systems of Systems (SoSs) increasingly operate in dynamic environments (e.g., smart cities, autonomous vehicles) where runtime composition -- the on-the-fly discovery, integration, and coordination of constituent systems (CSs)--is crucial for adaptability. Despite growing interest, the literature lacks a cohesive synthesis of runtime composition in dynamic SoSs. Objective: This study synthesizes research on runtime composition in dynamic SoSs and identifies core challenges, solu…

There seem to be so few (Linux desktop) music players that get random album play right.
I get that playing entire albums is considered a thing of the past and that streaming services like Spotify have even influenced album releases to be more amenable to random track play.
But I still consider the album to be the unit of creative expression, so I'd like to play them randomly

Adding All Flavors: A Hybrid Random Number Generator for dApps and Web3
Ranjith Chodavarapu, Rabimba Karanjai, Xinxin Fan, Weidong Shi, Lei Xu
https://arxiv.org/abs/2510.12062 h…

Adding All Flavors: A Hybrid Random Number Generator for dApps and Web3
Random numbers play a vital role in many decentralized applications (dApps), such as gaming and decentralized finance (DeFi) applications. Existing random number provision mechanisms can be roughly divided into two categories, on-chain, and off-chain. On-chain approaches usually rely on the blockchain as the major input and all computations are done by blockchain nodes. The major risk for this type of method is that the input itself is susceptible to the adversary's influence. Off-chain…

Beim Thema "Rentenreform" wird es noch richtig spannend. Da will die Regierung etwas beschließen und ausgerechnet eine Gruppe junger CDU-Abgeordneter will im Bundestag dagegen stimmen.
Sie haben bisher keine detaillierte Alternative zum Rentenpaket vorgelegt, mit der sie das bestehende Gesetzespaket ersetzen wollen. Ihr Hauptvorschlag ist, das Rentenniveau nur bis zum Jahr 2031 bei 48 Prozent zu stabilisieren, wie es im Koalitionsvertrag vereinbart ist.

Fluctuation-guided adaptive random compiler for Hamiltonian simulation
Yu-Xia Wu, Yun-Zhuo Fan, Dan-Bo Zhang
https://arxiv.org/abs/2509.10158 https://arxiv…

Fluctuation-guided adaptive random compiler for Hamiltonian simulation
Stochastic methods offer an effective way to suppress coherent errors in quantum simulation. In particular, the randomized compilation protocol may reduce circuit depth by randomly sampling Hamiltonian terms rather than following the deterministic Trotter-Suzuki sequence. However, its fixed sampling distribution does not adapt to the dynamics of the system, limiting its accuracy. In this work, we propose a fluctuation-guided adaptive algorithm that adaptively updates sampling probabilities base…

The Diameter of (Threshold) Geometric Inhomogeneous Random Graphs
Zylan Benjert, Kostas Lakis, Johannes Lengler, Raghu Raman Ravi
https://arxiv.org/abs/2510.12543 https://

The Diameter of (Threshold) Geometric Inhomogeneous Random Graphs
We prove that the diameter of threshold (zero temperature) Geometric Inhomogeneous Random Graphs (GIRG) is $Θ(\log n)$. This has strong implications for the runtime of many distributed protocols on those graphs, which often have runtimes bounded as a function of the diameter. The GIRG model exhibits many properties empirically found in real-world networks, and the runtime of various practical algorithms has empirically been found to scale in the same way for GIRG and for real-world networks,…