Tootfinder

The UK government begins its review of the BBC's charter, set to expire in 2027, as ministers consider licence fee reforms and allowing more commercial revenue (Jake Kanter/Deadline)
https://deadline.com/2025/12/bbc-charter-review-launched-1236649702/

BBC Charter Review Launched: Government Opens Door To More Commercial Funding & Board Duties On Workplace Misconduct
The UK government has fired the starting gun on BBC charter review, a once-in-a-decade review of the broadcaster's funding and operations.

You can't “overbuild” internet infrastructure. Just like highways, demand always catches up. Except fiber doesn't kill forests.
#fiber #unifi #network

Dominating Hadwiger's Conjecture holds for all $2K_2$-free graphs
Zi-Xia Song, Thomas Tibbetts
https://arxiv.org/abs/2510.12567 https://arxiv.org/pdf/2…

Dominating Hadwiger's Conjecture holds for all $2K_2$-free graphs
A dominating $K_t$ minor in a graph $G$ is a sequence $(T_1,\dots,T_t)$ of pairwise disjoint non-empty connected subgraphs of $G$, such that for $1 \leq i

Approximate Proximal Operators for Analog Compressed Sensing Using PN-junction Diode
Soma Furusawa, Taisei Kato, Ryo Hayakawa, Kazunori Hayashi
https://arxiv.org/abs/2510.12065 …

Approximate Proximal Operators for Analog Compressed Sensing Using PN-junction Diode
In order to realize analog compressed sensing, the paper considers approximate proximal operators of the $\ell_1$ and minimax concave penalty (MCP) regularization functions. Specifically, we propose to realize the approximate functions by an electric analog circuit using forward voltage-current (V-I) characteristics of the PN-junction diodes. To confirm the validity of the proposed approach, we employ the proposed approximate proximal operators for the $\ell_1$ and MCP regularization functions …

SBS Dutch - SBS Nederlands
Independent news and stories connecting you to life in Australia and Dutch-speaking Australians...
Great Australian Pods Podcast Directory: https://www.greataustralianpods.com/sbs-dutch/

cora: CORA citations (1998)
Citations among papers indexed by CORA, from 1998, an early computer science research paper search engine. If a paper i cites a paper j also in this data set, then a directed edge connects i to j. (Papers not in the data set are excluded.) Self-loops may be present. The dates of these snapshots are uncertain.
This network has 23166 nodes and 91500 edges.
Tags: Informational, Citation, Unweighted

Sublinear Metric Steiner Forest via Maximal Independent Set
Sepideh Mahabadi, Mohammad Roghani, Jakub Tarnawski, Ali Vakilian
https://arxiv.org/abs/2510.11627 https://

Sublinear Metric Steiner Forest via Maximal Independent Set
In this work we consider the Metric Steiner Forest problem in the sublinear time model. Given a set $V$ of $n$ points in a metric space where distances are provided by means of query access to an $n\times n$ distance matrix, along with a set of $k$ terminal pairs $(s_1,t_1), \dots, (s_k,t_k)\in V\times V$, the goal is to find a minimum-weight subset of edges that connects each terminal pair. Although sublinear time algorithms have been studied for estimating the weight of a minimum spanning tre…

Selling Privacy in Blockchain Transactions
Georgios Chionas, Olga Gorelkina, Piotr Krysta, Rida Laraki
https://arxiv.org/abs/2512.08096 https://arxiv.org/pdf/2512.08096 https://arxiv.org/html/2512.08096
arXiv:2512.08096v1 Announce Type: new
Abstract: We study methods to enhance privacy in blockchain transactions from an economic angle. We consider mechanisms for privacy-aware users whose utility depends not only on the outcome of the mechanism but also negatively on the exposure of their economic preferences. Specifically, we study two auction-theoretic settings with privacy-aware users. First, we analyze an order flow auction, where a user auctions off to specialized agents, called searchers, the right to execute her transaction while maintaining a degree of privacy. We examine how the degree of privacy affects the revenue of the auction and, broadly, the net utility of the privacy-aware user. In this new setting, we describe the optimal auction, which is a sealed-bid auction. Subsequently, we analyze a variant of a Dutch auction in which the user gradually decreases the price and the degree of privacy until the transaction is sold. We compare the revenue of this auction to that of the optimal one as a function of the number of communication rounds. Then, we introduce a two-sided market - a privacy marketplace - with multiple users selling their transactions under their privacy preferences to multiple searchers. We propose a posted-price mechanism for the two-sided market that guarantees constant approximation of the optimal social welfare while maintaining incentive compatibility (from both sides of the market) and budget balance. This work builds on the emerging line of research that attempts to improve the performance of economic mechanisms by appending cryptographic primitives to them.
toXiv_bot_toot

Cyclic and alternating $U$-statistics
Svante Janson
https://arxiv.org/abs/2510.12480 https://arxiv.org/pdf/2510.12480…

Cyclic and alternating $U$-statistics
We define cyclic $U$-statistics as a variant of $U$-statistics based on variables $X_1,\dots,X_n$ that are assumed to be cyclically ordered. We also define alternating $U$-statistics where in the definition terms are summed with alternating sings (in three different ways). Only $U$-statistics of order 2 are considered. The definitions are inspired by special cases studied by Chebikin (2008) and Even-Zohar (2017) for random permutations. We show limit theorems similar to well-known results for…

Optimal run-tumble navigation in disordered landscapes
Yang Bai, Caiyun He, Weirong Liu, Songtao Cheng, Pan Chu, Liang Luo, Chenli Liu, Xiongfei Fu
https://arxiv.org/abs/2510.12106

Optimal run-tumble navigation in disordered landscapes
Active navigation in disordered media is governed by the interplay between self-propulsion and environmental constraints. Using the chemotaxis of E. coli in agar gels as a model system, we uncover a universal trade-off between persistence and obstacle avoidance that dictates optimal search strategies. We find that populations evolving under pressure for rapid expansion adapt by shortening their mean run time (τ_f), counter to the intuition that longer runs always favor faster migration. Contro…