Tootfinder

sp_hypertext: Hypertext 2009 dynamic contact network
The temporal network of contacts among attendees of the ACM Hypertext 2009 conference, which spanned 2.5 days of time.
This network has 113 nodes and 20818 edges.
Tags: Social, Offline, Unweighted, Temporal
https://networks.skewed.de/net/sp_hype…

In-person, Online and Back Again -- A Tale of Three Hybrid Hackathons
Abasi-amefon Obot Affia-Jomants, Alexander Serebrenik, James D. Herbsleb, Alexander Nolte
https://arxiv.org/abs/2508.07301

In-person, Online and Back Again -- A Tale of Three Hybrid Hackathons
Hybrid hackathons, which combine in-person and online participation, present unique challenges for organizers and participants. Although such events are increasingly conducted, research on them remains fragmented, with limited integration between hackathon studies and hybrid collaboration. Existing strategies for in-person or online-only events often fail to address the unique challenges of hybrid formats, such as managing communication across physical and virtual spaces. Our work addresses thi…

Lieb's Theorem for Bose Hubbard Models
Zhong-Chao Wei, Chong Zhao
https://arxiv.org/abs/2506.10319 https://arxiv.org/pdf/2506.103…

Lieb's Theorem for Bose Hubbard Models
Using a cone-theoretical method, we prove the uniqueness of the ground state for two Bose Hubbard models. The first model is the usual Bose Hubbard model with real hopping coefficients and attractive interactions. The second model is a two-component Bose Hubbard model. Under certain conditions, we show that the ground state in the subspace with particle number $N=2n$($n$ is a positive integer) is unique for both models. For the second model, we show that the ground state has spin along the z-ax…

Improving Real-Time Concept Drift Detection using a Hybrid Transformer-Autoencoder Framework
N Harshit, K Mounvik
https://arxiv.org/abs/2508.07085 https://…

Improving Real-Time Concept Drift Detection using a Hybrid Transformer-Autoencoder Framework
In applied machine learning, concept drift, which is either gradual or abrupt changes in data distribution, can significantly reduce model performance. Typical detection methods,such as statistical tests or reconstruction-based models,are generally reactive and not very sensitive to early detection. Our study proposes a hybrid framework consisting of Transformers and Autoencoders to model complex temporal dynamics and provide online drift detection. We create a distinct Trust Score methodology,…

$\bf A^2$-robust superradiant phase transition in hybrid qubit-cavity optomechanics
Gang Liu, Wei Xiong
https://arxiv.org/abs/2508.08024 https://arxiv.org/…

$\bf A^2$-robust superradiant phase transition in hybrid qubit-cavity optomechanics
The $\mathbf{A}^2$ term presents a fundamental challenge to realizing the superradiant phase transition (SPT) in cavity quantum electrodynamics. Here, we propose a hybrid quantum system enabling SPT regardless of the presence of the $\mathbf{A}^2$ term. The system consisting of a qubit, a mechanical mode, and an optical cavity, where the qubit and mechanical mode constitute a quantum Rabi model, while the mechanical mode and cavity form an optomechanical system. Crucially, the auxiliary cavity …

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…

ScalableHD: Scalable and High-Throughput Hyperdimensional Computing Inference on Multi-Core CPUs
Dhruv Parikh, Viktor Prasanna
https://arxiv.org/abs/2506.09282

ScalableHD: Scalable and High-Throughput Hyperdimensional Computing Inference on Multi-Core CPUs
Hyperdimensional Computing (HDC) is a brain-inspired computing paradigm that represents and manipulates information using high-dimensional vectors, called hypervectors (HV). Traditional HDC methods, while robust to noise and inherently parallel, rely on single-pass, non-parametric training and often suffer from low accuracy. To address this, recent approaches adopt iterative training of base and class HVs, typically accelerated on GPUs. Inference, however, remains lightweight and well-suited fo…

Hybrid Game Control Envelope Synthesis
Aditi Kabra, Jonathan Laurent, Stefan Mitsch, Andr\'e Platzer
https://arxiv.org/abs/2508.05997 https://arxiv.org…

Hybrid Game Control Envelope Synthesis
Control problems for embedded systems like cars and trains can be modeled by two-player hybrid games. Control envelopes, which are families of safe control solutions, correspond to nondeterministic winning policies of hybrid games, where each deterministic specialization of the policy is a control solution. This paper synthesizes nondeterministic winning policies for hybrid games that are as permissive as possible. It introduces subvalue maps, a compositional representation of such policies tha…

Anderson Accelerated Primal-Dual Hybrid Gradient for solving LP
Yingxin Zhou, Stefano Cipolla, Phan Tu Vuong
https://arxiv.org/abs/2508.08062 https://arxiv…

Anderson Accelerated Primal-Dual Hybrid Gradient for solving LP
We present the Anderson Accelerated Primal-Dual Hybrid Gradient (AA-PDHG), a fixed-point-based framework designed to overcome the slow convergence of the standard PDHG method for the solution of linear programming (LP) problems. We establish the global convergence of AA-PDHG under a safeguard condition. In addition, we propose a filtered variant (FAA-PDHG) that applies angle and length filtering to preserve the uniform boundedness of the coefficient matrix, a property crucial for guaranteeing c…

sp_hypertext: Hypertext 2009 dynamic contact network
The temporal network of contacts among attendees of the ACM Hypertext 2009 conference, which spanned 2.5 days of time.
This network has 113 nodes and 20818 edges.
Tags: Social, Offline, Unweighted, Temporal
https://networks.skewed.de/net/sp_hype…