Tootfinder

LLM as an Execution Estimator: Recovering Missing Dependency for Practical Time-travelling Debugging
Yunrui Pei, Hongshu Wang, Wenjie Zhang, Yun Lin, Weiyu Kong, Jin song Dong
https://arxiv.org/abs/2508.18721

LLM as an Execution Estimator: Recovering Missing Dependency for Practical Time-travelling Debugging
Dynamic data dependency, answering "why a variable has this value?", is critical for debugging. Given a program step `s` reading a variable `v`, finding the dynamic definition of `v` is challenging. Traditional methods require either (1) exhaustive instrumentation of all possible definitions of `v` in one run or (2) replicating the run to re-examine reads/writes - both costly. If `v` is defined in a library, instrumentation becomes expensive; for non-deterministic programs, replication is infea…

Finding a dense submatrix of a random matrix. Sharp bounds for online algorithms
Shankar Bhamidi, David Gamarnik, Shuyang Gong
https://arxiv.org/abs/2507.19259 https://

Finding a dense submatrix of a random matrix. Sharp bounds for online algorithms
We consider the problem of finding a dense submatrix of a matrix with i.i.d. Gaussian entries, where density is measured by average value. This problem arose from practical applications in biology and social sciences \cites{madeira-survey,shabalin2009finding} and is known to exhibit a computation-to-optimization gap between the optimal value and best values achievable by existing polynomial time algorithms. In this paper we consider the class of online algorithms, which includes the best known …

Our Coding Adventure: Using LLMs to Personalise the Narrative of a Tangible Programming Robot for Preschoolers
Martin Ruskov
https://arxiv.org/abs/2506.20982

Our Coding Adventure: Using LLMs to Personalise the Narrative of a Tangible Programming Robot for Preschoolers
Finding balanced ways to employ Large Language Models (LLMs) in education is a challenge due to inherent risks of poor understanding of the technology and of a susceptible audience. This is particularly so with younger children, who are known to have difficulties with pervasive screen time. Working with a tangible programming robot called Cubetto, we propose an approach to benefit from the capabilities of LLMs by employing such models in the preparation of personalised storytelling, necessary f…

Cycle-factors of regular graphs via entropy
Micha Christoph, Nemanja Dragani\'c, Ant\'onio Gir\~ao, Eoin Hurley, Lukas Michel, Alp M\"uyesser
https://arxiv.org/abs/2507.19417

Cycle-factors of regular graphs via entropy
It is a classical result that a random permutation of $n$ elements has, on average, about $\log n$ cycles. We generalise this fact to all directed $d$-regular graphs on $n$ vertices by showing that, on average, a random cycle-factor of such a graph has $\mathcal{O}((n\log d)/d)$ cycles. This is tight up to the constant factor and improves the best previous bound of the form $\mathcal{O}(n/\sqrt{\log d})$ due to Vishnoi. Our results also yield randomised polynomial-time algorithms for finding su…

A Slice-Based Change Impact Analysis for Regression Test Case Prioritization of Object-Oriented Programs
S. Panda, D. Munjal, D. P. Mohapatra
https://arxiv.org/abs/2508.19056 ht…

A Slice-Based Change Impact Analysis for Regression Test Case Prioritization of Object-Oriented Programs
Test case prioritization focuses on finding a suitable order of execution of the test cases in a test suite to meet some performance goals like detecting faults early. It is likely that some test cases execute the program parts that are more prone to errors and will detect more errors if executed early during the testing process. Finding an optimal order of execution for the selected regression test cases saves time and cost of retesting. This paper presents a static approach to prioritizing th…

Fresh from intimidating ABC and CBS with meritless lawsuits,
Donald Trumpis suing Rupert Murdoch and the Wall Street Journal reporters who broke the story of a lewd birthday message for Jeffrey Epstein.
But, unlike with the frivolous allegations against the big broadcasters,
there’s clearly a fact of the matter here:
an authentic letter either exists or it does not;
-- and there is plenty to be revealed in the process of finding out.
Trump’s time-proven …

Budget Allocation Policies for Real-Time Multi-Agent Path Finding
Raz Beck, Roni Stern
https://arxiv.org/abs/2507.16874 https://arxiv.org/pdf/2507.16874

Budget Allocation Policies for Real-Time Multi-Agent Path Finding
Multi-Agent Pathfinding (MAPF) is the problem of finding paths for a set of agents such that each agent reaches its desired destination while avoiding collisions with the other agents. Many MAPF solvers are designed to run offline, that is, first generate paths for all agents and then execute them. Real-Time MAPF (RT-MAPF) embodies a realistic MAPF setup in which one cannot wait until a complete path for each agent has been found before they start to move. Instead, planning and execution are in…

🏃🏿‍♀️‍➡️ Researchers find that individual practice is the secret to maintaining high team performance over time
https://phys.org/news/2025-07-individual-secret-high-team.html

Researchers find that individual practice is the secret to maintaining high team performance over time
When it comes to learning and retaining complex skills, a new study from Texas A&M University uncovered a surprising finding: in the context of teams, having employees practice skills alone may be the best way to help the team succeed.

Sliding Window Informative Canonical Correlation Analysis
Arvind Prasadan
https://arxiv.org/abs/2507.17921 https://arxiv.org/pdf/2507.17921

Sliding Window Informative Canonical Correlation Analysis
Canonical correlation analysis (CCA) is a technique for finding correlated sets of features between two datasets. In this paper, we propose a novel extension of CCA to the online, streaming data setting: Sliding Window Informative Canonical Correlation Analysis (SWICCA). Our method uses a streaming principal component analysis (PCA) algorithm as a backend and uses these outputs combined with a small sliding window of samples to estimate the CCA components in real time. We motivate and describe …

MuseControlLite: Multifunctional Music Generation with Lightweight Conditioners
Fang-Duo Tsai, Shih-Lun Wu, Weijaw Lee, Sheng-Ping Yang, Bo-Rui Chen, Hao-Chung Cheng, Yi-Hsuan Yang
https://arxiv.org/abs/2506.18729

MuseControlLite: Multifunctional Music Generation with Lightweight Conditioners
We propose MuseControlLite, a lightweight mechanism designed to fine-tune text-to-music generation models for precise conditioning using various time-varying musical attributes and reference audio signals. The key finding is that positional embeddings, which have been seldom used by text-to-music generation models in the conditioner for text conditions, are critical when the condition of interest is a function of time. Using melody control as an example, our experiments show that simply adding …

I follow a lot of bands on Tidal I don't like yet because I believe they could release something I would like.
Finding music I like it a big time sink!
#music

Quantum Advantage in Learning Quantum Dynamics via Fourier coefficient extraction
Alice Barthe, Mahtab Yaghubi Rad, Michele Grossi, Vedran Dunjko
https://arxiv.org/abs/2506.17089 …

Quantum Advantage in Learning Quantum Dynamics via Fourier coefficient extraction
One of the key challenges in quantum machine learning is finding relevant machine learning tasks with a provable quantum advantage. A natural candidate for this is learning unknown Hamiltonian dynamics. Here, we tackle the supervised learning version of this problem, where we are given random examples of the inputs to the dynamics as classical data, paired with the expectation values of some observable after the time evolution, as corresponding output labels. The task is to replicate the corres…

Semirandom Planted Clique via 1-norm Isometry Property
Venkatesan Guruswami, Hsin-Po Wang
https://arxiv.org/abs/2506.17916 https://ar…

Semirandom Planted Clique via 1-norm Isometry Property
We give a polynomial-time algorithm that finds a planted clique of size $k \ge \sqrt{n \log n}$ in the semirandom model, improving the state-of-the-art $\sqrt{n} (\log n)^2$ bound. This $\textit{semirandom planted clique problem}$ concerns finding the planted subset $S$ of $k$ vertices of a graph $G$ on $V$, where the induced subgraph $G[S]$ is complete, the cut edges in $G[S; V \setminus S]$ are random, and the remaining edges in $G[V \setminus S]$ are adversarial. An elegant greedy algorith…

Systematic Constraint Formulation and Collision-Free Trajectory Planning Using Space-Time Graphs of Convex Sets
Matthew D. Osburn, Cameron K. Peterson, John L. Salmon
https://arxiv.org/abs/2508.10203

Systematic Constraint Formulation and Collision-Free Trajectory Planning Using Space-Time Graphs of Convex Sets
In this paper, we create optimal, collision-free, time-dependent trajectories through cluttered dynamic environments. The many spatial and temporal constraints make finding an initial guess for a numerical solver difficult. Graphs of Convex Sets (GCS) and the recently developed Space-Time Graphs of Convex Sets formulation (ST-GCS) enable us to generate optimal minimum distance collision-free trajectories without providing an initial guess to the solver. We also explore the derivation of general…

As @pluralistic writes here, “the American right is a brittle coalition:”
https://pluralistic.net/2024/07/14/fracture-lines/
We imagine the right as monolithic at our peril. Reply guys love, love, love to lecture me about how These People are all the same. Here’s the thing: they are not, and imagining they are is self-defeating. The right has been •incredibly• effective at finding fracture points on the left and jamming a crowbar into them. It’s time we did the same.
4/

First time cooking artichoke tonight. We nuked it which worked well but main finding is wotta lotta hassle for some wee bites. Our 16yo liked it and wants to have it again so it was a success in that respect!

Comic book artist Ian Bertram on encouraging your inner artist https://thecreativeindependent.com/people/comic…

Comic book artist Ian Bertram on encouraging your inner artist – The Creative Independent
Comic book artist Ian Bertram discusses making time and space for creativity, finding an overall balance, and the difficulty of describing your own work.

All jokes about the disaster that is finding documents in Sharepoint or moving images in Word aside, is Microsoft really ready to unleash AI on the world? Outlook's 'book time to meet' feature doesn't recognise all of Outlook's options for pre-booked time, showing time marked as 'working elsewhere' as free.

Sound and Solution-Complete CCBS
Alvin Combrink, Sabino Francesco Roselli, Martin Fabian
https://arxiv.org/abs/2508.16410 https://arxiv.org/pdf/2508.16410

Sound and Solution-Complete CCBS
Continuous-time Conflict Based-Search (CCBS) has long been viewed as the de-facto optimal solver for multi-agent path finding in continuous time (MAPFR). Recent findings, however, show that the original theoretical variant of CCBS can suffer from non-termination, while the widely used implementation can return sub-optimal solutions. We introduce an analytical framework that yields simple and sufficient conditions under which any CCBS-style algorithm is both sound, i.e., returns only optimal sol…

Sonnet 082 - LXXXII
I grant thou wert not married to my Muse,
And therefore mayst without attaint o'erlook
The dedicated words which writers use
Of their fair subject, blessing every book.
Thou art as fair in knowledge as in hue,
Finding thy worth a limit past my praise;
And therefore art enforced to seek anew
Some fresher stamp of the time-bettering days.
And do so, love; yet when they have devis'd,
What strained touches rh…

Generalized Spectral Statistics in the Kicked Ising model
Divij Gupta, Brian Swingle
https://arxiv.org/abs/2506.15816 https://arxiv.o…

Generalized Spectral Statistics in the Kicked Ising model
The kicked Ising model has been studied extensively as a model of quantum chaos. Bertini, Kos, and Prosen studied the system in the thermodynamic limit, finding an analytic expression for the spectral form factor, $K(t)$, at the self-dual point with periodic boundary conditions. The spectral form factor is the 2nd moment of the trace of the time evolution operator, and we study the higher moments of this random variable in the kicked Ising model. A previous study of these higher moments by Flac…

Local limit theorems on relatively hyperbolic groups with respect to virtually nilpotent subgroups
Matthieu Dussaule
https://arxiv.org/abs/2507.15408 https…

Local limit theorems on relatively hyperbolic groups with respect to virtually nilpotent subgroups
Given a probability measure on a finitely generated group, the local limit problem consists in finding asymptotics of $p_n(e,e)$, the probability that the random walk at time $n$ is at the origin. We give the classification of all possible local limit theorems, up to bounded error, for finitely supported, symmetric, admissible probability measures on a relatively hyperbolic group with respect to virtually nilpotent subgroups.

Swap Regression Methodology for Predicting Relationship with Historical Bivariate Data
Viral Chitlangia, Mosuk Chow, Sharmishtha Mitra
https://arxiv.org/abs/2508.15479 https://

Swap Regression Methodology for Predicting Relationship with Historical Bivariate Data
This study revisits regression for samples with alternating predictors (SWAP) proposed in Chow et al.[2015] with the purpose of finding the best fit model when the role of the response and the explanatory variables was established. In the current work, we explore the directional relationship between the two variables at a given point of time, by a novel approach which draws direct inspiration from the concept of SWAP regression. Our method, based on the Gaussian Mixture Model (GMM) and the beta…

#LB Eu acho que realmente preciso ler Terry Pratchett rs.
https://frikiverse.zone/@terrybot/115036206410170877

Dak, offense finding explosiveness https://www.dallascowboys.com/news/dak-offense-finding-explosiveness

alright im going through my old files again and rediscovered a shitty unfinished sci-fi epic poem thing i was writing sometime when i was 14/15/idfk. all i remember about it is that it was gonna keep doing this countdown and changing structure accordingly for a really long time, i was thinking of depicting the character finding love in an ethereal sorta way for the ending, and it was gonna incorporate a enochian number square for some reason.

A Linear Time Algorithm for Finding Minimum Flip Sequences between Plane Spanning Paths in Convex Point Sets
Oswin Aichholzer, Joseph Dorfer
https://arxiv.org/abs/2507.02740

A Linear Time Algorithm for Finding Minimum Flip Sequences between Plane Spanning Paths in Convex Point Sets
We provide a linear time algorithm to determine the flip distance between two plane spanning paths on a point set in convex position. At the same time, we show that the happy edge property does not hold in this setting. This has to be seen in contrast to several results for reconfiguration problems where the absence of the happy edge property implies algorithmic hardness of the flip distance problem. Further, we show that our algorithm can be adapted for (1) compatible flips (2) local flips and…

Fast Algorithms for Graph Arboricity and Related Problems
Ruoxu Cen, Henry Fleischmann, George Z. Li, Jason Li, Debmalya Panigrahi
https://arxiv.org/abs/2507.15598

Fast Algorithms for Graph Arboricity and Related Problems
We give an algorithm for finding the arboricity of a weighted, undirected graph, defined as the minimum number of spanning forests that cover all edges of the graph, in $\sqrt{n} m^{1+o(1)}$ time. This improves on the previous best bound of $\tilde{O}(nm)$ for weighted graphs and $\tilde{O}(m^{3/2}) $ for unweighted graphs (Gabow 1995) for this problem. The running time of our algorithm is dominated by a logarithmic number of calls to a directed global minimum cut subroutine -- if the running t…

Modified Cubic B-spline Based Differential Quadrature Methods for Time-fractional Black-Scholes Equation
Nizamudheen V, Riyasudheen TK, Noufal Asharaf, Shefeeq T
https://arxiv.org/abs/2508.06780

Modified Cubic B-spline Based Differential Quadrature Methods for Time-fractional Black-Scholes Equation
The time-fractional Black-Scholes equation (TFBSE) is intended to price the options for which the underlying price fluctuates within a correlated fractal transmission system. Although the TFBSE is an influential approach for grasping the long-term memory traits of financial markets, the non-local nature of fractional derivatives makes significant challenges in finding an accurate solution. We perform an efficient use of the differential quadrature method (DQM) based on modified cubic B-splines …

Chameleon Channels: Measuring YouTube Accounts Repurposed for Deception and Profit
Alejandro Cuevas, Manoel Horta Ribeiro, Nicolas Christin
https://arxiv.org/abs/2507.16045

Chameleon Channels: Measuring YouTube Accounts Repurposed for Deception and Profit
Online content creators spend significant time and effort building their user base through a long, often arduous process, which requires finding the right ``niche'' to cater to. So, what incentive is there for an established content creator known for cat memes to completely reinvent their page channel and start promoting cryptocurrency services or cover electoral news events? And, if they do, do their existing subscribers not notice? We explore this problem of \textit{repurposed channels}, wher…

The Consequences of Rubin Observatory Time-Domain Survey Design and Host-Galaxy Contamination on the Identification of Binary Supermassive Black Holes
Megan C. Davis, Jonathan R. Trump, Maria Charisi, Jessie C. Runnoe, W. N. Brandt, Kaylee E. Grace, London E. Willson
https://arxiv.org/abs/2508.05742

The Consequences of Rubin Observatory Time-Domain Survey Design and Host-Galaxy Contamination on the Identification of Binary Supermassive Black Holes
Binary supermassive black holes (SMBHs) are consequences of galaxy mergers and dominate the low-frequency gravitational wave background. Finding binary SMBHs in existing time-domain observations has proven difficult, as their periodic, electromagnetic signals can be confused with the natural variability of single quasars. In this work, we investigate the effects of host-galaxy contamination and survey design (cadence and duration) on the detectability of binary SMBHs with the upcoming Rubin Obs…

Finding a solution to the Erd\H{o}s-Ginzburg-Ziv theorem in $O(n\log\log\log n)$ time
Yui Hin Arvin Leung
https://arxiv.org/abs/2507.08139 https://

Finding a solution to the Erdős-Ginzburg-Ziv theorem in $O(n\log\log\log n)$ time
The Erdős-Ginzburg-Ziv theorem states that for any sequence of $2n-1$ integers, there exists a subsequence of $n$ elements whose sum is divisible by $n$. In this article, we provide a simple, practical $O(n\log\log n)$ algorithm and a theoretical $O(n\log\log\log n)$ algorithm, both of which improve upon the best previously known $O(n\log n)$ approach. This shows that a specific variant of boolean convolution can be implemented in time faster than the usual $O(n\log n)$ expected from FFT-based…

Unfortunately & conversely, this (below) is the same framing tech bros (and parts of the population) are finding so attractive to anthropomorphize LLMs: These are not machines, and them making mistakes is normal and expected... At the same time, the other card being played (by politics, military & law enforcement) is that AI-driven insights and decision making are _already_ considered superior, infallible and unchallengeable... in the middle of this two pronged rhetoric is the fate o…

Channel Formation Enhances Target Consumption by Chemotactic Active Brownian Particles
Vladimir Yu. Rudyak, Shahar Shinehorn, Yael Roichman
https://arxiv.org/abs/2507.11328

Channel Formation Enhances Target Consumption by Chemotactic Active Brownian Particles
In many situations, simply finding a target during a search is not enough. It is equally important to be able to return to that target repeatedly or to enable a larger community to locate and utilize it. While first passage time is commonly used to measure search success, relatively little is known about increasing the average rate of target encounters over time. Here, using an active Brownian particle model with chemotaxis, we demonstrate that when a searcher has no memory and there is no comm…

Evidence for an Inverse Cascade of Magnetic Helicity in the Inner Heliosphere
Masatomi Iizawa, Yasuhito Narita, Tommaso Alberti, Stuart D. Bale, Axel Brandenburg, Abraham C. -L. Chian, Horia Comi\c{s}el, Shuichi Matsukiyo, Nobumitsu Yokoi
https://arxiv.org/abs/2507.13213

Evidence for an Inverse Cascade of Magnetic Helicity in the Inner Heliosphere
To elucidate the cascade direction of the solar wind turbulence, we analyzed magnetic helicity density spectra from the Parker Solar Probe data across more than 500 heliocentric distances. For the first time, we confirmed a persistent inverse cascade extending from the Sun to Mercury's orbital vicinity. This finding challenges the conventional hypothesis that the magnetic helicity density within the inner heliosphere is random. Furthermore, our analysis revealed a radial sign change of the spec…

250 Magnetic Tunnel Junctions-Based Probabilistic Ising Machine
Shuhan Yang, Andrea Grimaldi, Youwei Bao, Eleonora Raimondo, Jia Si, Giovanni Finocchio, Hyunsoo Yang
https://arxiv.org/abs/2506.14590

250 Magnetic Tunnel Junctions-Based Probabilistic Ising Machine
In combinatorial optimization, probabilistic Ising machines (PIMs) have gained significant attention for their acceleration of Monte Carlo sampling with the potential to reduce time-to-solution in finding approximate ground states. However, to be viable in real applications, further improvements in scalability and energy efficiency are necessary. One of the promising paths toward achieving this objective is the development of a co-design approach combining different technology layers including …

A guy I know said he just got his teen an ebike, and got it from TST Group.
Anyone know anything about them? Are they good or garbage? (He did not do any research ahead of time.)
Will he have issues finding a shop that will do repairs or maintenance if needed?
https://tstebike.com/

TST E-Bikes | Best Moped-style Electric Bikes, Fat Tire Ebikes
TST brand was established, focusing on high-power, cost-effective electric bikes.

Going to lament about the changes on Drive World in Roblox, because somehow they somehow do the "you get some, you lose some" updates every time.
Who thought that it is a good idea to change the trucking and delivery system? Now that all of this is replaced with the "Daniel" system (finding trailers on the wild and delivering it to a place), it is now harder to do them.
#DriveWorld

WordPress may be run by… that guy, but it still has a massive user base. They all need better accessibility documentation.
@… wants to improve it, but needs sponsors:
https://

Like other large #FreeSoftware projects, #Gentoo developers have varying degrees of activity. There are some people who dedicate a lot of their free time to Gentoo, maintain hundreds of packages, participate in multiple areas. Then, there are people with narrower interests, lower commit counts, but they are still putting an effort and making Gentoo a better distribution — and that matters. But then, there is the tail.
There is a few of developers whose main talents seem to be 1) finding packages that require absolutely minimal maintenance effort, and 2) justifying their developer status with long essays. I mean, this is getting beyond absurd. It is not just "my packages are all up-to-date". It is not even "my packages require very low maintenance, that's why I'm not doing much". It is literally "I deliberately choose low-maintenance packages, so I don't have to do anything". But of course, all these people definitely need commit access to Gentoo, and show off their Gentoo developer badges, and it's *so damn unfair*.
And in the meantime, other developers are overburdened, and getting burned out. And they step down from more things. And who takes these things over? Of course, not the developers who just admitted to not having much to do…

Variability-finding in Rubin Data Preview 1 with LSDB
Konstantin Malanchev, Melissa DeLucchi, Neven Caplar, Alex I. Malz, Wilson Beebe, Doug Branton, Sandro Campos, Andrew Connolly, Mi Dai, Jeremy Kubica, Olivia Lynn, Rachel Mandelbaum, Sean McGuire, Eric Aubourg, Robert David Blum, Jeffrey L. Carlin, Francisco Delgado, Emmanuel Gangler, Buell T. Jannuzi, Tim Jenness, Yijung Kang, Arun Kannawadi, Marc Moniez, Andr\'es A. Plazas Malag\'on, Wouter van Reeven, David Sanmartim, Ela…

Variability-finding in Rubin Data Preview 1 with LSDB
The Vera C. Rubin Observatory recently released Data Preview 1 (DP1) in advance of the upcoming Legacy Survey of Space and Time (LSST), which will enable boundless discoveries in time-domain astronomy over the next ten years. DP1 provides an ideal sandbox for validating innovative data analysis approaches for the LSST mission, whose scale challenges established software infrastructure paradigms. This note presents a pair of such pipelines for variability-finding using powerful software infrastr…

Parameterized Restless Temporal Path
Justine Cauvi (DI-ENS, ARGO, ENS de Lyon), Laurent Viennot (DI-ENS, ARGO)
https://arxiv.org/abs/2507.05760 https://

Parameterized Restless Temporal Path
Recently, Bumpus and Meeks introduced a purely temporal parameter, called vertex-interval-membership-width, which is promising for the design of fixed-parameter tractable (FPT) algorithms for vertex reachability problems in temporal graphs. We study this newly introduced parameter for the problem of restless temporal paths, in which the waiting time at each node is restricted. In this article, we prove that, in the interval model, where arcs are present for entire time intervals, finding a rest…

FrameShift: Learning to Resize Fuzzer Inputs Without Breaking Them
Harrison Green, Claire Le Goues, Fraser Brown
https://arxiv.org/abs/2507.05421 https://

FrameShift: Learning to Resize Fuzzer Inputs Without Breaking Them
Coverage-guided fuzzers are powerful automated bug-finding tools. They mutate program inputs, observe coverage, and save any input that hits an unexplored path for future mutation. Unfortunately, without knowledge of input formats--for example, the relationship between formats' data fields and sizes--fuzzers are prone to generate destructive frameshift mutations. These time-wasting mutations yield malformed inputs that are rejected by the target program. To avoid such breaking mutations, this p…

Self-Supervised Spatial Correspondence Across Modalities
Ayush Shrivastava, Andrew Owens
https://arxiv.org/abs/2506.03148 https://arx…

Self-Supervised Spatial Correspondence Across Modalities
We present a method for finding cross-modal space-time correspondences. Given two images from different visual modalities, such as an RGB image and a depth map, our model identifies which pairs of pixels correspond to the same physical points in the scene. To solve this problem, we extend the contrastive random walk framework to simultaneously learn cycle-consistent feature representations for both cross-modal and intra-modal matching. The resulting model is simple and has no explicit photo-con…

This https://arxiv.org/abs/2503.23630 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csIR_…

Finding Interest Needle in Popularity Haystack: Improving Retrieval by Modeling Item Exposure
Recommender systems operate in closed feedback loops, where user interactions reinforce popularity bias, leading to over-recommendation of already popular items while under-exposing niche or novel content. Existing bias mitigation methods, such as Inverse Propensity Scoring (IPS) and Off-Policy Correction (OPC), primarily operate at the ranking stage or during training, lacking explicit real-time control over exposure dynamics. In this work, we introduce an exposure-aware retrieval scoring appr…

AI-Driven SEEG Channel Ranking for Epileptogenic Zone Localization
Saeed Hashemi, Genchang Peng, Mehrdad Nourani, Omar Nofal, Jay Harvey
https://arxiv.org/abs/2506.09255

AI-Driven SEEG Channel Ranking for Epileptogenic Zone Localization
Stereo-electroencephalography (SEEG) is an invasive technique to implant depth electrodes and collect data for pre-surgery evaluation. Visual inspection of signals recorded from hundreds of channels is time consuming and inefficient. We propose a machine learning approach to rank the impactful channels by incorporating clinician's selection and computational finding. A classification model using XGBoost is trained to learn the discriminative features of each channel during ictal periods. Then, …

Same
https://circumstances.run/@ukapala/114931320298481917

This https://arxiv.org/abs/2202.13250 has been replaced.
link: https://scholar.google.com/scholar?q=a

TabID: Automatic Identification and Tabulation of Subproblems in Constraint Models
The performance of a constraint model can often be improved by converting a subproblem into a single table constraint (referred to as tabulation). Finding subproblems to tabulate is traditionally a manual and time-intensive process, even for expert modellers. This paper presents TabID, an entirely automated method to identify promising subproblems for tabulation in constraint programming. We introduce a diverse set of heuristics designed to identify promising candidates for tabulation, aiming t…

Extraction of classical ergotropy
Michele Campisi
https://arxiv.org/abs/2508.12797 https://arxiv.org/pdf/2508.12797…

Extraction of classical ergotropy
Finding the time dependent perturbation that extracts the maximal amount of energy (a.k.a. ergotropy) from a thermally isolated quantum system is a central, solved, problem in quantum thermodynamics. Notably, the same problem has been long studied for classical systems as well, e.g., in the field of plasma physics, but a general solution is still missing there. By building on the analogy with the quantum solution, we provide the classical ergotropy extraction driving: it consists of an instanta…

Where Are All The Tourists From 3025?
Andrew Jackson
https://arxiv.org/abs/2508.09157 https://arxiv.org/pdf/2508.09157

Where Are All The Tourists From 3025?
This paper examines the distinct lack of clear examples of time-travellers and proposes an explanation for their absence without assuming technical barriers to constructing time machines. Instead, it develops and then analyses a model of the consequences of time-travellers; finding that time travel is self-suppressing.

Finding Partite Hypergraphs Efficiently
Ferran Espu\~na
https://arxiv.org/abs/2508.10641 https://arxiv.org/pdf/2508.10641

Finding Partite Hypergraphs Efficiently
We provide a deterministic polynomial-time algorithm that, for a given $k$-uniform hypergraph $H$ with $n$ vertices and edge density $d$, finds a complete $k$-partite subgraph of $H$ with parts of size at least ${c(d, k)(\log n)^{1/(k-1)}}$. This generalizes work by Mubayi and Turán on bipartite graphs. The value we obtain for the part size matches the order of magnitude guaranteed by the non-constructive proof due to Erdős and is tight up to a constant factor.

Quantum-Guided Cluster Algorithms for Combinatorial Optimization
Peter J. Eder, Aron Kerschbaumer, Jernej Rudi Fin\v{z}gar, Raimel A. Medina, Martin J. A. Schuetz, Helmut G. Katzgraber, Sarah Braun, Christian B. Mendl
https://arxiv.org/abs/2508.10656

Quantum-Guided Cluster Algorithms for Combinatorial Optimization
Finding the ground state of Ising spin glasses is notoriously difficult due to disorder and frustration. Often, this challenge is framed as a combinatorial optimization problem, for which a common strategy employs simulated annealing, a Monte Carlo (MC)-based algorithm that updates spins one at a time. Yet, these localized updates can cause the system to become trapped in local minima. Cluster algorithms (CAs) were developed to address this limitation and have demonstrated considerable success …

Mergers of galaxies
Sugata Kaviraj
https://arxiv.org/abs/2506.09136 https://arxiv.org/pdf/2506.09136…

Mergers of galaxies
The evolution of our Universe is strongly influenced by the attractive force of gravity. A key aspect of this evolution, therefore, is the merging of galaxies. Here, we explore the role of mergers in shaping the properties of massive galaxies over cosmic time. Observational methods of finding mergers include identifying galaxy pairs in close proximity, visual inspection of galaxy images to identify signatures of mergers (e.g. tidal features) and using morphological parameters such as Asymmetry …

Identifying Present-Biased Discount Functions in Dynamic Discrete Choice Models
Jaap H. Abbring, {\O}ystein Daljord, Fedor Iskhakov
https://arxiv.org/abs/2507.07286

Identifying Present-Biased Discount Functions in Dynamic Discrete Choice Models
We study the identification of dynamic discrete choice models with sophisticated, quasi-hyperbolic time preferences under exclusion restrictions. We consider both standard finite horizon problems and empirically useful infinite horizon ones, which we prove to always have solutions. We reduce identification to finding the present-bias and standard discount factors that solve a system of polynomial equations with coefficients determined by the data and use this to bound the cardinality of the ide…

Finding Order-Preserving Subgraphs
Haruya Imamura, Yasuaki Kobayashi, Yota Otachi, Toshiki Saitoh, Keita Sato, Asahi Takaoka, Ryo Yoshinaka
https://arxiv.org/abs/2507.11115

Finding Order-Preserving Subgraphs
(Induced) Subgraph Isomorphism and Maximum Common (Induced) Subgraph are fundamental problems in graph pattern matching and similarity computation. In graphs derived from time-series data or protein structures, a natural total ordering of vertices often arises from their underlying structure, such as temporal sequences or amino acid sequences. This motivates the study of problem variants that respect this inherent ordering. This paper addresses Ordered (Induced) Subgraph Isomorphism (O(I)SI) an…

Decremental Greedy Polygons and Polyhedra Without Sharp Angles
David Eppstein
https://arxiv.org/abs/2507.04538 https://arxiv.org/pdf/…

Decremental Greedy Polygons and Polyhedra Without Sharp Angles
We show that the max-min-angle polygon in a planar point set can be found in time $O(n\log n)$ and a max-min-solid-angle convex polyhedron in a three-dimensional point set can be found in time $O(n^2)$. We also study the maxmin-angle polygonal curve in 3d, which we show to be $\mathsf{NP}$-hard to find if repetitions are forbidden but can be found in near-cubic time if repeated vertices or line segments are allowed, by reducing the problem to finding a bottleneck cycle in a graph. We formalize …

Two-Sided Manipulation Games in Stable Matching Markets
Hadi Hosseini, Grzegorz Lisowski, Shraddha Pathak
https://arxiv.org/abs/2506.00554 https://

Two-Sided Manipulation Games in Stable Matching Markets
The Deferred Acceptance (DA) algorithm is an elegant procedure for finding a stable matching in two-sided matching markets. It ensures that no pair of agents prefers each other to their matched partners. In this work, we initiate the study of two-sided manipulations in matching markets as non-cooperative games. We introduce the accomplice manipulation game, where a man misreports to help a specific woman obtain a better partner, whenever possible. We provide a polynomial time algorithm for find…

A Graph Width Perspective on Partially Ordered Hamiltonian Paths and Cycles I: Treewidth, Pathwidth, and Grid Graphs
Jesse Beisegel, Katharina Klost, Kristin Knorr, Fabienne Ratajczak, Robert Scheffler
https://arxiv.org/abs/2506.23790

A Graph Width Perspective on Partially Ordered Hamiltonian Paths and Cycles I: Treewidth, Pathwidth, and Grid Graphs
We consider the problem of finding a Hamiltonian path or a Hamiltonian cycle with precedence constraints in the form of a partial order on the vertex set. We show that the path problem is $\mathsf{NP}$-complete for graphs of pathwidth 4 while the cycle problem is $\mathsf{NP}$-complete on graphs of pathwidth 5. We complement these results by giving polynomial-time algorithms for graphs of pathwidth 3 and treewidth 2 for Hamiltonian paths as well as pathwidth 4 and treewidth 3 for Hamiltonian cy…

This https://arxiv.org/abs/2412.09433 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csCC_…

Solving Multiagent Path Finding on Highly Centralized Networks
The Mutliagent Path Finding (MAPF) problem consists of identifying the trajectories that a set of agents should follow inside a given network in order to reach their desired destinations as soon as possible, but without colliding with each other. We aim to minimize the maximum time any agent takes to reach their goal, ensuring optimal path length. In this work, we complement a recent thread of results that aim to systematically study the algorithmic behavior of this problem, through the paramet…

👬 Analyzing the size and homogeneity of acquaintanceship networks in the Netherlands
https://phys.org/news/2025-07-size-homogeneity-acquaintanceship-networks-netherlands.html

Analyzing the size and homogeneity of acquaintanceship networks in the Netherlands
Young people, working people, those with higher education and people with high incomes have the largest social networks. Having a larger network is useful. "It can help in finding work or social support," said Bas Hofstra, a sociologist at Radboud University. "People with a smaller network often have a harder time."

Isometric-Universal Graphs for Trees
Edgar Baucher, Fran\c{c}ois Dross, Cyril Gavoille
https://arxiv.org/abs/2506.11704 https://arxiv…

Isometric-Universal Graphs for Trees
We consider the problem of finding the smallest graph that contains two input trees each with at most $n$ vertices preserving their distances. In other words, we look for an isometric-universal graph with the minimum number of vertices for two given trees. We prove that this problem can be solved in time $O(n^{5/2}\log{n})$. We extend this result to forests instead of trees, and propose an algorithm with running time $O(n^{7/2}\log{n})$. As a key ingredient, we show that a smallest isometric-un…

This https://arxiv.org/abs/2503.11688 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csNE_…

Towards Resilient and Sustainable Global Industrial Systems: An Evolutionary-Based Approach
This paper presents a new complex optimization problem in the field of automatic design of advanced industrial systems and proposes a hybrid optimization approach to solve the problem. The problem is multi-objective as it aims at finding solutions that minimize CO2 emissions, transportation time, and costs. The optimization approach combines an evolutionary algorithm and classical mathematical programming to design resilient and sustainable global manufacturing networks. Further, it makes use o…

This https://arxiv.org/abs/2411.13558 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_qfi…

Finding the nonnegative minimal solutions of Cauchy PDEs in a volatility-stabilized market
The strong relative arbitrage problem in Stochastic Portfolio Theory seeks an investment strategy that almost surely outperforms a benchmark portfolio at the end of a given time horizon. The highest relative return in relative arbitrage opportunities is characterized by the smallest nonnegative continuous solution of a Cauchy problem for a partial differential equation (PDE). However, solving this type of PDE poses analytical and numerical challenges, due to the high dimensionality and its non-…

Searching for sub-TeV IceCube neutrinos correlated to sub-threshold GW events
Tista Mukherjee (for the IceCube collaboration)
https://arxiv.org/abs/2506.09694

Searching for sub-TeV IceCube neutrinos correlated to sub-threshold GW events
The IceCube Neutrino Observatory is active in multi-messenger follow-ups of Gravitational Wave (GW) events. Since the release of the Gravitational Wave Transient Catalogue (GWTC)-2.1 by the LIGO-Virgo-KAGRA (LVK) collaboration, sub-threshold GW candidates have been made publicly available. However, they were not followed up in real-time to search for neutrino counterparts. For a deeper understanding of these sub-threshold candidates, archival searches are essential. Finding evidence for a neutr…

Path Planning using a One-shot-sampling Skeleton Map
Gabriel O. Flores-Aquino, Octavio Gutierrez-Frias, Juan Irving Vasquez
https://arxiv.org/abs/2507.02328

Path Planning using a One-shot-sampling Skeleton Map
Path planning algorithms aim to compute a collision-free path, and many works focus on finding the optimal distance path. However, for some applications, a more suitable approach is to balance response time, safety of the paths, and path length. In this context, a skeleton map is a useful tool in graph-based schemes, as it provides an intrinsic representation of free configuration space. However, skeletonization algorithms are very resource-intensive, being primarily oriented towards image proc…

When Agents Break Down in Multiagent Path Finding
Foivos Fioravantes, Du\v{s}an Knop, Nikolaos Melissinos, Michal Opler
https://arxiv.org/abs/2508.03777 https://

When Agents Break Down in Multiagent Path Finding
In Multiagent Path Finding (MAPF), the goal is to compute efficient, collision-free paths for multiple agents navigating a network from their sources to targets, minimizing the schedule's makespan-the total time until all agents reach their destinations. We introduce a new variant that formally models scenarios where some agents may experience delays due to malfunctions, posing significant challenges for maintaining optimal schedules. Recomputing an entirely new schedule from scratch after ea…

Consistent quantum treatments of non-convex kinetic energies
C. Koliofoti, M. A. Javed, R. -P. Riwar
https://arxiv.org/abs/2507.21993 https://arxiv.org/pdf…

Consistent quantum treatments of non-convex kinetic energies
The task of finding a consistent relationship between a quantum Hamiltonian and a classical Lagrangian is of utmost importance for basic, but ubiquitous techniques like canonical quantization and path integrals. Nonconvex kinetic energies (which appear, e.g., in Wilczek and Shapere's classical time crystal, or nonlinear capacitors) pose a fundamental problem: the Legendre transformation is ill-defined, and the more general Legendre-Fenchel transformation removes nonconvexity essentially by defi…

A Differential Evolution Algorithm with Neighbor-hood Mutation for DOA Estimation
Bo Zhou, Kaijie Xu, Yinghui Quan, Mengdao Xing
https://arxiv.org/abs/2507.06020

A Differential Evolution Algorithm with Neighbor-hood Mutation for DOA Estimation
Two-dimensional (2D) Multiple Signal Classification algorithm is a powerful technique for high-resolution direction-of-arrival (DOA) estimation in array signal processing. However, the exhaustive search over the 2D an-gular domain leads to high computa-tional cost, limiting its applicability in real-time scenarios. In this work, we reformulate the peak-finding process as a multimodal optimization prob-lem, and propose a Differential Evolu-tion algorithm with Neighborhood Mutation (DE-NM) to eff…

Rare Events, Many Searchers, and Fast Target Reaching in a Finite Domain
Elisabetta Ellettari, Giacomo Nasuti, Alberto Bassanoni, Alessandro Vezzani, Raffaella Burioni
https://arxiv.org/abs/2507.09452

Rare Events, Many Searchers, and Fast Target Reaching in a Finite Domain
Finding a target in a complex environment is a fundamental challenge in nature, from chemical reactions to sperm reaching an egg. An effective strategy to reduce the time needed to reach a target is to deploy many searchers, increasing the likelihood that at least one will succeed by using the statistics of rare events. When the underlying stochastic process involves broadly distributed step sizes, rare long jumps dominate the dynamics, making the use of multiple searchers particularly powerful…

Strain dependent viscous response describes the mechanics of cohesionless soft granular materials
Chandan Shakya, Luca Placidi, Anil Misra, Lars Kool, Anke Lindner, Jasper van der Gucht, Joshua A. Dijksman
https://arxiv.org/abs/2506.08855

Strain dependent viscous response describes the mechanics of cohesionless soft granular materials
Granular materials are ubiquitous in nature and are used extensively in daily life and in industry. The modeling of these materials remains challenging; therefore, finding models with acceptable predictive accuracy that at the same time also reflect the complexity of the granular dynamics is a central research theme in the field. Soft particle packings present additional modeling challenges, as it has become clear that soft particles also have particle-level relaxation timescales that affect th…

This https://arxiv.org/abs/2501.13862 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_qu…

Efficient Fermi-Hubbard model ground-state preparation by coupling to a classical reservoir in the instantaneous-response limit
Preparing the ground state of the Fermi-Hubbard model is challenging, in part due to the exponentially large Hilbert space, which complicates efficiently finding a path from an initial state to the ground state using the variational principle. In this work, we propose an approach for ground state preparation of interacting models by involving a classical reservoir, simplified to the instantaneous-response limit, which can be described using a Hamiltonian formalism. The resulting time evolution …

This https://arxiv.org/abs/2502.06044 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_sta…

Scalable Differentially Private Bayesian Optimization
In recent years, there has been much work on scaling Bayesian Optimization to high-dimensional problems, for example hyperparameter tuning in large machine learning models. These scalable methods have been successful, finding high objective values much more quickly than traditional global Bayesian Optimization or random search-based methods. At the same time, these large models often use sensitive data, but preservation of Differential Privacy has not scaled alongside these modern Bayesian Opti…

On Deterministically Finding an Element of High Order Modulo a Composite
Ziv Oznovich, Ben Lee Volk
https://arxiv.org/abs/2506.07668 https://

On Deterministically Finding an Element of High Order Modulo a Composite
We give a deterministic algorithm that, given a composite number $N$ and a target order $D \ge N^{1/6}$, runs in time $D^{1/2+o(1)}$ and finds either an element $a \in \mathbb{Z}_N^*$ of multiplicative order at least $D$, or a nontrivial factor of $N$. Our algorithm improves upon an algorithm of Hittmeir (arXiv:1608.08766), who designed a similar algorithm under the stronger assumption $D \ge N^{2/5}$. Hittmeir's algorithm played a crucial role in the recent breakthrough deterministic integer f…

This https://arxiv.org/abs/2503.11688 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csNE_…

Towards Resilient and Sustainable Global Industrial Systems: An Evolutionary-Based Approach
This paper presents a new complex optimization problem in the field of automatic design of advanced industrial systems and proposes a hybrid optimization approach to solve the problem. The problem is multi-objective as it aims at finding solutions that minimize CO2 emissions, transportation time, and costs. The optimization approach combines an evolutionary algorithm and classical mathematical programming to design resilient and sustainable global manufacturing networks. Further, it makes use o…

BTPG-max: Achieving Local Maximal Bidirectional Pairs for Bidirectional Temporal Plan Graphs
Yifan Su, Rishi Veerapaneni, Jiaoyang Li
https://arxiv.org/abs/2508.04849 https://…

BTPG-max: Achieving Local Maximal Bidirectional Pairs for Bidirectional Temporal Plan Graphs
Multi-Agent Path Finding (MAPF) requires computing collision-free paths for multiple agents in shared environment. Most MAPF planners assume that each agent reaches a specific location at a specific timestep, but this is infeasible to directly follow on real systems where delays often occur. To address collisions caused by agents deviating due to delays, the Temporal Plan Graph (TPG) was proposed, which converts a MAPF time dependent solution into a time independent set of inter-agent dependenc…

On Finding $\ell$-th Smallest Perfect Matchings
Nicolas El Maalouly, Sebastian Haslebacher, Adrian Taubner, Lasse Wulf
https://arxiv.org/abs/2506.22619 htt…

On Finding $\ell$-th Smallest Perfect Matchings
Given an undirected weighted graph $G$ and an integer $k$, Exact-Weight Perfect Matching (EWPM) is the problem of finding a perfect matching of weight exactly $k$ in $G$. In this paper, we study EWPM and its variants. The EWPM problem is famous, since in the case of unary encoded weights, Mulmuley, Vazirani, and Vazirani showed almost 40 years ago that the problem can be solved in randomized polynomial time. However, up to this date no derandomization is known. Our first result is a simple de…

This https://arxiv.org/abs/2506.04086 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csCG_…

Optimizing Mesh to Improve the Triangular Expansion Algorithm for Computing Visibility Regions
This paper addresses the problem of improving the query performance of the triangular expansion algorithm (TEA) for computing visibility regions by finding the most advantageous instance of the triangular mesh, the preprocessing structure. The TEA recursively traverses the mesh while keeping track of the visible region, the set of all points visible from a query point in a polygonal world. We show that the measured query time is approximately proportional to the number of triangle edge expansio…

More sophisticated is not always better: comparison of similarity measures for unsupervised learning of pathways in biomolecular simulations
Miriam J\"ager, Steffen Wolf
https://arxiv.org/abs/2507.01725

More sophisticated is not always better: comparison of similarity measures for unsupervised learning of pathways in biomolecular simulations
Finding process pathways in molecular simulations such as the unbinding paths of small molecule ligands from their binding sites at protein targets in a set of trajectories via unsupervised learning approaches requires the definition of a suitable similarity measure between trajectories. We here evaluate the performance of four such measures with varying degree of sophistication, i.e., Euclidean and Wasserstein distances, Procrustes analysis and dynamical time warping, when analyzing trajectory…

This https://arxiv.org/abs/2404.11389 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_mat…

Finding $d$-Cuts in Graphs of Bounded Diameter, Graphs of Bounded Radius and $H$-Free Graphs
The $d$-Cut problem is to decide if a graph has an edge cut such that each vertex has at most $d$ neighbours at the opposite side of the cut. If $d=1$, we obtain the intensively studied Matching Cut problem. The $d$-Cut problem has been studied as well, but a systematic study for special graph classes was lacking. We initiate such a study and consider classes of bounded diameter, bounded radius and $H$-free graphs. We prove that for all $d\geq 2$, $d$-Cut is polynomial-time solvable for graphs …

Optimizing Mesh to Improve the Triangular Expansion Algorithm for Computing Visibility Regions
Jan Mikula (Czech Institute of Informatics, Robotics and Cybernetics, Czech Technical University in Prague, Department of Cybernetics, Faculty of Electrical Engineering, Czech Technical University in Prague), Miroslav Kulich (Czech Institute of Informatics, Robotics and Cybernetics, Czech Technical University in Prague)

Optimizing Mesh to Improve the Triangular Expansion Algorithm for Computing Visibility Regions
This paper addresses the problem of improving the query performance of the triangular expansion algorithm (TEA) for computing visibility regions by finding the most advantageous instance of the triangular mesh, the preprocessing structure. The TEA recursively traverses the mesh while keeping track of the visible region, the set of all points visible from a query point in a polygonal world. We show that the measured query time is approximately proportional to the number of triangle edge expansio…

Faster exponential algorithms for cut problems via geometric data structures
L\'aszl\'o Kozma, Junqi Tan
https://arxiv.org/abs/2506.22281 https://

Faster exponential algorithms for cut problems via geometric data structures
For many hard computational problems, simple algorithms that run in time $2^n \cdot n^{O(1)}$ arise, say, from enumerating all subsets of a size-$n$ set. Finding (exponentially) faster algorithms is a natural goal that has driven much of the field of exact exponential algorithms (e.g., see Fomin and Kratsch, 2010). In this paper we obtain algorithms with running time $O(1.9999977^n)$ on input graphs with $n$ vertices, for the following well-studied problems: - $d$-Cut: find a proper cut in wh…