Tootfinder

Anonymous Quantum Tokens with Classical Verification
Dmytro Gavinsky, Dar Gilboa, Siddhartha Jain, Dmitri Maslov, Jarrod R. McClean
https://arxiv.org/abs/2510.06212 https://

Anonymous Quantum Tokens with Classical Verification
The no-cloning theorem can be used as a basis for quantum money constructions which guarantee unconditionally unforgeable currency. Existing schemes, however, either (i) require long-term quantum memory and quantum communication between the user and the bank in order to verify the validity of a bill or (ii) fail to protect user privacy due to the uniqueness of each bill issued by the bank, which can allow its usage to be tracked. We introduce a construction of single-use quantum money that give…

Reconstruction of the Dipole Amplitude in the Dipole Picture as a mathematical Inverse Problem
Henri H\"anninen, Antti Kykk\"anen, Hj{\o}rdis Schl\"uter
https://arxiv.org/abs/2509.05005 …

Reconstruction of the Dipole Amplitude in the Dipole Picture as a mathematical Inverse Problem
We show that the inference problem of constraining the dipole amplitude with inclusive deep inelastic scattering data can be written into a discrete linear inverse problem, in an analogous manner as can be done for computed tomography. To this formulation of the problem, we apply standard inverse problems methods and algorithms to reconstruct known dipole amplitudes from simulated reduced cross section data with realistic precision. The main difference of this approach to previous works is that…

Session-Based Recommendation with Validated and Enriched LLM Intents
Gyuseok Lee, Yaokun Liu, Yifan Liu, Susik Yoon, Dong Wang, SeongKu Kang
https://arxiv.org/abs/2508.00570 htt…

Session-Based Recommendation with Validated and Enriched LLM Intents
Session-based recommendation (SBR) aims to predict the next item for an anonymous user in a timely manner. However, SBR suffers from data sparsity due to the short and anonymous nature of sessions. Recently, an emerging line of work has explored inferring the underlying user intents of a session using large language models (LLMs), with the generated intents serving as auxiliary training signals to enhance SBR models. Despite its promise, this approach faces three key challenges: validating inte…

On the impact of unlimited computational power in OBLOT: consequences for synchronous robots on graphs
Serafino Cicerone, Alessia Di Fonso, Gabriele Di Stefano, Alfredo Navarra
https://arxiv.org/abs/2509.04383

On the impact of unlimited computational power in OBLOT: consequences for synchronous robots on graphs
The OBLOT model has been extensively studied in theoretical swarm robotics. It assumes weak capabilities for the involved mobile robots, such as they are anonymous, disoriented, no memory of past events (oblivious), and silent. Their only means of (implicit) communication is transferred to their positioning, i.e., stigmergic information. These limited capabilities make the design of distributed algorithms a challenging task. Over the last two decades, numerous research papers have addressed the…

🇺🇦 #NowPlaying on BBCRadio3's #Breakfast
Ralph Vaughan Williams, Anonymous, Corydon Singers, Matthew Best, Jonathan Best, Mary Seers, Michael Chance & Philip Salmon:
🎵 Vaughan Williams: Mass in G Minor: V. Agnus Dei
#RalphVaughanWilliams #Anonymous #CorydonSingers

Combining Performance and Productivity: Accelerating the Network Sensing Graph Challenge with GPUs and Commodity Data Science Software
Siddharth Samsi, Dan Campbell, Emanuel Scoullos, Oded Green
https://arxiv.org/abs/2509.03653

Combining Performance and Productivity: Accelerating the Network Sensing Graph Challenge with GPUs and Commodity Data Science Software
The HPEC Graph Challenge is a collection of benchmarks representing complex workloads that test the hardware and software components of HPC systems, which traditional benchmarks, such as LINPACK, do not. The first benchmark, Subgraph Isomorphism, focused on several compute-bound and memory-bound kernels. The most recent of the challenges, the Anonymized Network Sensing Graph Challenge, represents a shift in direction, as it represents a longer end-to-end workload that requires many more softwar…