Filing: OpenAI petitions the UK CMA to include AI chatbots with search function in Google's mandated default search engine choice screen for Chrome and Android (James Titcomb/Telegraph)
https://www.telegraph.co.uk/business/2026/03/23…
Nice here in the fediverse.
But have you ever been to Ankh-Morpork?
City of a thousand surprises
#GNUPterry #gnuterrypratchett #GNUSirPterry
More than 10,000 Americans who suffer from chronic liver disease are on a waitlist for a liver transplant,
-- but there are not enough donated organs for all of those patients.
Additionally, many people with liver failure aren’t eligible for a transplant if they are not healthy enough to tolerate the surgery.
To help those patients, MIT engineers have developed ⭐️ “mini livers” that could be injected into the body and take over the functions of the failing liver.
In a n…
Following an attack on several Wikimedia projects that comprised a large number of accounts, Wikis are now back to read and write access. Compromised accounts made automated mass edits across pages with the edit summary "Закрываем проект", among potentially other edits.
The issue was identified and fixed. Many functions have gone back to normal.
Hey folks,
here's one of the photos from my recent blog post - just in case you didn't want to read the blog post ;)
Thsi was a weeka go - before winter returned. I've some winter photos from the weekend but I haven't finished them yet .. stay tuned ;)
#hiking #mountains
Hidden Higher-Order Vulnerabilities in Simplicial Complexes Revealed by Branch-Consistent Functional Robustness
Kaiming Luo
https://arxiv.org/abs/2603.24286 https://arxiv.org/pdf/2603.24286 https://arxiv.org/html/2603.24286
arXiv:2603.24286v1 Announce Type: new
Abstract: Robustness of higher-order networks is often quantified by the instantaneous smallest positive eigenvalue of the Hodge $1$-Laplacian under simplex deletion. We show that this observable is generically ill-defined: along a deletion trajectory, eigenvalue branches can switch, so the quantity being monitored may correspond to different nonharmonic modes at different steps. The primary issue is therefore definitional rather than algorithmic. We resolve it by fixing the first nonharmonic branch of the intact complex and following that same branch throughout the damage process, which defines a branch-consistent functional robustness. Triangle sensitivities then follow directly from first-order perturbation theory, making the resulting mode-sensitive deletion protocol a consequence of the observable itself rather than an independent heuristic. Across synthetic and empirical clique complexes, removing only a small fraction of triangles is sufficient to drive the tracked mode to collapse, while graph-level observables remain unchanged because the $1$-skeleton is exactly preserved. The same framework also reveals bridge-like localization of functionally critical simplices and provides a compact predictor of dynamical timescales.
toXiv_bot_toot
Hat noch jemand Probleme mit filecrypt captchas?
Z.B. hier die Container-Links von serienfans oder funxd
Nach dem Lösen geht's einfach nicht weiter
OK, so once again I'm the last person on the planet to learn about the good things.
I have just discovered #letterboxd, which is sort of like Goodreads/Bookwyrm for films and TV programmes.
Now if only it had ActivityPub functionality it would be amazing.
#films #movies