Tootfinder

Aww, Serge Fiori died: https://vancouver.citynews.ca/2025/06/24/quebec-singer-songwriter-serge-fiori-founder-of-rock-group-harmonium-dead-at-73/
That name won’t mean anything except to Canadians o…

Quebec singer Serge Fiori dead at 73
Quebec singer-songwriter Serge Fiori, founder of French-Canadian rock band Harmonium, died Tuesday at the age of 73.

Dienstag: Amazon schickt weitere Satelliten ins All, Apple streitet mit der EU
Zweite Gruppe Kuiper-Internetsatelliten Apple mit EU in Disput IT-Attacke auf Polizei Googles Zusammenarbeit mit Lenovo Simulationen bestätigt

lastfm_aminer: Last.fm social graph
This network contains the social graph of last.fm, a site that provides a streaming radio service, where users can search music and get personalized recommendation. A directed edge (i,j) means that user i follows user j.
This network has 136409 nodes and 1685524 edges.
Tags: Social, Online, Unweighted

The UK CMA says it has provisionally found Google meets the legal tests to designate it with "strategic market status" in general search and search advertising (Financial Times)
https://t.co/B2evUJQFta

Google faces UK push to loosen its grip on search
Big Tech giant slams Competition and Markets Authority’s plan as ‘punitive’ and risk to economic growth

The Hiraga-Ichino-Ikeda Conjecture for Principal Series of Split p-adic Groups
Giulio Ricci
https://arxiv.org/abs/2506.19619 https://…

The Hiraga-Ichino-Ikeda Conjecture for Principal Series of Split p-adic Groups
Given a $p$-adic connected split reductive group $\mathcal{G},$ we use the local Langlands correspondence as defined by Reeder and by Aubert, Baum, Plymen and Solleveld, to prove the HII conjecture for irreducible discrete series representations contained in a principal series of $\mathcal{G}$. We verify the predicted formula relating the formal degree of such representations to the adjoint $γ$-factor of their associated Langlands parameter. First, we prove it under the assumption that the cen…

Local Search Improvements for Soft Happy Colouring
Mohammad Hadi Shekarriz, Dhananjay Thiruvady, Asef Nazari, Wilfried Imrich
https://arxiv.org/abs/2506.19284

Local Search Improvements for Soft Happy Colouring
For $0\leq ρ\leq 1$ and a coloured graph $G$, a vertex $v$ is $ρ$-happy if at least $ρ°(v)$ of its neighbours have the same colour as $v$. Soft happy colouring of a partially coloured graph $G$ is the problem of finding a vertex colouring $σ$ that preserves the precolouring and has the maximum number of $ρ$-happy vertices. It is already known that this problem is NP-hard and directly relates to the community structure of the graphs; under a certain condition on the proportion of happiness…

Black Holes in the Red-sequence Elliptical Galaxies at Redshifts $\sim 0.7-2.5$: Not Dark Energy Source but Remanants of Little Red Dots
Lei Lei, Ze-Fan Wang, Yi-Ying Wang, Lei Feng, Yi-Zhong Fan
https://arxiv.org/abs/2506.19589

Black Holes in the Red-sequence Elliptical Galaxies at Redshifts $\sim 0.7-2.5$: Not Dark Energy Source but Remanants of Little Red Dots
The nature of dark energy remains one of the most profound mysteries in modern cosmology. One intriguing proposal is that black holes (BHs) could be the astrophysical source of dark energy through a cosmological coupling mechanism, and strong evidence has been claimed via analyzing the growth of the black hole masses in the red-sequence elliptical galaxies at redshifts $\leq 2.5$. In this work, with a group of very high redshift AGNs detected by the James Webb Space Telescope (JWST) in the red-…

What Makes the Best Decomposition? Investigating Binary Decomposition Under FCG Variance
Ang Jia, He Jiang, Zhilei Ren, Xiaochen Li, Ming Fan, Ting Liu
https://arxiv.org/abs/2506.19425

What Makes the Best Decomposition? Investigating Binary Decomposition Under FCG Variance
Binary decomposition, which decomposes binary files into modules, plays a critical role in binary reuse detection. Existing binary decomposition works either apply anchor-based methods by extending anchor functions to generate modules, or apply clustering-based methods by using clustering algorithms to group binary functions, which all rely on that reused code shares similar function call relationships. However, we find that function call graphs (FCGs) vary a lot when using different compilatio…

Computing Tree Structures in Anonymous Graphs via Mobile Agents
Prabhat Kumar Chand, Manish Kumar, Anisur Rahaman Molla
https://arxiv.org/abs/2506.19365 ht…

Computing Tree Structures in Anonymous Graphs via Mobile Agents
Minimum Spanning Tree (MST) and Breadth-First Search (BFS) tree constructions are classical problems in distributed computing, traditionally studied in the message-passing model, where static nodes communicate via messages. This paper investigates MST and BFS tree construction in an agent-based network, where mobile agents explore a graph and compute. Each node hosts one agent, and communication occurs when agents meet at a node. We consider $n$ agents initially dispersed (one per node) in an a…

Empowering Graph-based Approximate Nearest Neighbor Search with Adaptive Awareness Capabilities
Jiancheng Ruan, Tingyang Chen, Renchi Yang, Xiangyu Ke, Yunjun Gao
https://arxiv.org/abs/2506.15986

Empowering Graph-based Approximate Nearest Neighbor Search with Adaptive Awareness Capabilities
Approximate Nearest Neighbor Search (ANNS) in high-dimensional spaces finds extensive applications in databases, information retrieval, recommender systems, etc. While graph-based methods have emerged as the leading solution for ANNS due to their superior query performance, they still face several challenges, such as struggling with local optima and redundant computations. These issues arise because existing methods (i) fail to fully exploit the topological information underlying the proximity …