Tootfinder

Entre o controle algorítmico e o fechamento identitšrio, uma nova configuração de poder ganha forma.
Para Donatella Di Cesare, não se trata de retorno ao passado, mas de uma mutação em curso, que reorganiza a política sem precisar suspendê-la formalmente.
#ai #ia

Not the best-phrased headline ever, but this news warms my heart. They're disinterring them because they have enough family DNA samples to finally identify them.
https://www.stripes.com/veterans/2026-03-04/pearl-harbor-identification-dpaa-2094…

Plans set to disinter USS Arizona unknowns from Hawaii cemetery 85 years after Pearl Harbor
DPAA has committed to exhuming the remains of dozens of sailors who were aboard the USS Arizona during the Japanese attack on Pearl Harbor in 1941.

Impressed (commendatory) that it takes until the fifth paragraph of this article to — still indirectly — identify *which* Canadian Olympic hockey team it's about. https://www.cbc.ca/sports/olympics/winter/hockey/canada-us-women…

Un utente di Reddit ha criticato l'ICE. Trump sta cercando di smascherarli trascinando l'agenzia davanti a un gran giurì segreto.
La richiesta dell'ICE di rivelare l'identitŠ dell'utente è fallita. Gli attivisti temono che il ricorso a un gran giurì segnali un'escalation nella guerra al dissenso.
https:…

Source: federal prosecutors have subpoenaed Reddit to appear before a grand jury, to provide personal data on an anonymous user who criticized ICE (Ryan Devereaux/The Intercept)
https://theintercept.com/2026/04/10/reddit-ice-protest-grand-jury/

A Redditor Criticized ICE. Trump Is Trying to Unmask Them by Dragging the Company to a Secret Grand Jury.
An ICE summons to get the user’s identity failed. Advocates worry the move to a grand jury signals an escalation of the war on dissent.

Basics of RF Electronics
Amos Christopher Dexter
https://arxiv.org/abs/2602.15205 https://arxiv.org/pdf/2602.15205 https://arxiv.org/html/2602.15205
arXiv:2602.15205v1 Announce Type: new
Abstract: The focus of this educational text is selected examples of high-frequency electronic circuits and their components employed for the accurate phasing and synchronisation of accelerator cavities. Examples have been chosen to describe the basics of RF electronics. The starting point is transmission lines, connectors, discontinuities, and the handling of reflection. The application of simple surface mount components is discussed. The use of the Kuroda identities for converting lumped circuit designs to printed circuit designs is demonstrated. The accelerator example used to demonstrate the use of components is a circuit designed for the synchronisation of the CLIC crab cavities. This example employs co-planar waveguide, SMA connectors, Wilkinson splitters, and surface-mount double-balanced mixers. For the control of cavity phase and amplitude, the benefit of I&Q controllers will be explained. The text will then discuss the operation and use of I&Q modulators and VCOs.
toXiv_bot_toot

Grr and argh.
The people who make government websites generally tend to do a halfway decent job of meeting the spec, but they really really need to learn to push back when the spec is FUCKING STUPID.
Having just completed my "Annual Filing" with Companies House - and why is that even a thing, we're not posting fucking vellum to Victorian clerks who scurry up ladders to deposit the sacred paperwork in the appropriate filing cabinet any more - I got a new scary emai…

Feds Try Secret Grand Jury to Unmask Reddit ICE Critic #ice

A Redditor Criticized ICE. Trump Is Trying to Unmask Them by Dragging the Company to a Secret Grand Jury.
An ICE summons to get the user’s identity failed. Advocates worry the move to a grand jury signals an escalation of the war on dissent.

Hardness and Tractability of T_{h 1}-Free Edge Deletion
Ajinkya Gaikwad, Soumen Maity, Leeja R
https://arxiv.org/abs/2602.00644 https://arxiv.org/pdf/2602.00644 https://arxiv.org/html/2602.00644
arXiv:2602.00644v1 Announce Type: new
Abstract: We study the parameterized complexity of the T(h 1)-Free Edge Deletion problem. Given a graph G and integers k and h, the task is to delete at most k edges so that every connected component of the resulting graph has size at most h. The problem is NP-complete for every fixed h at least 3, while it is solvable in polynomial time for h at most 2.
Recent work showed strong hardness barriers: the problem is W[1]-hard when parameterized by the solution size together with the size of a feedback edge set, ruling out fixed-parameter tractability for many classical structural parameters. We significantly strengthen these negative results by proving W[1]-hardness when parameterized by the vertex deletion distance to a disjoint union of paths, the vertex deletion distance to a disjoint union of stars, or the twin cover number. These results unify and extend known hardness results for treewidth, pathwidth, and feedback vertex set, and show that several restrictive parameters, including treedepth, cluster vertex deletion number, and modular width, do not yield fixed-parameter tractability when h is unbounded.
On the positive side, we identify parameterizations that restore tractability. We show that the problem is fixed-parameter tractable when parameterized by cluster vertex deletion together with h, and also when parameterized by neighborhood diversity together with h via an integer linear programming formulation. We further present a fixed-parameter tractable bicriteria approximation algorithm parameterized by k. Finally, we show that the problem admits fixed-parameter tractable algorithms on split graphs and interval graphs, and we establish hardness for a directed generalization even on directed acyclic graphs.
toXiv_bot_toot

The Unitary Conjugation Groupoid as a Universal Mediator of the Baum--Connes Assembly Map
Shih-Yu Chang
https://arxiv.org/abs/2603.22162 https://arxiv.org/pdf/2603.22162 https://arxiv.org/html/2603.22162
arXiv:2603.22162v1 Announce Type: new
Abstract: We show that the Baum--Connes assembly map factors canonically through the unitary conjugation groupoid, which serves as a universal mediator among groupoid models that are Morita equivalent to a given transformation groupoid. This establishes a structural link between groupoid-based index theory and the Baum--Connes program at the level of K-theory. Building on our previous development of unitary conjugation groupoids and their associated index theory, we extend the $K_1$ index framework beyond the Type I setting to non-Type I examples, including the irrational rotation algebra and amenable crossed products. Using Morita equivalence, we relate unitary conjugation groupoids to transformation and action groupoids, enabling the transfer of descent-type index constructions to these settings. Our main result shows that, among all groupoid realizations that are Morita equivalent to a transformation groupoid, the factorization through the unitary conjugation groupoid is canonical at the level of K-theory. This identifies the unitary conjugation groupoid as a universal intermediary for the Baum--Connes assembly map. As applications, we recover the classical index pairing with the tracial state for the irrational rotation algebra in the sense of Connes, and we prove that for amenable crossed products the descent construction agrees with the analytic Baum--Connes assembly map under Morita equivalence. These results provide a conceptual interpretation of the assembly map in terms of internal symmetries of crossed product algebras and suggest a unified framework connecting Fredholm-type index data with equivariant K-theory via groupoid methods.
toXiv_bot_toot