Tootfinder

This is a really good analysis of how #Labour became a right wing party.
I was aware of their courting of rich donors, but I'd missed the revolving door between Labour governments and the defence and private healthcare industries, and the point about Labour directing anger towards immigrants in order to divert it from the

No they want your DNA to track you.
Folks, have you seen GATTACA?
▶️ U.S. lawmakers demand answers after Canadian man says border officers made him give DNA sample | CBC News
https://www.cbc.ca/news/canada/windsor/us-bord…

U.S. lawmakers demand answers after Canadian man says border officers made him give DNA sample | CBC News
American lawmakers are demanding answers from the Trump administration after a Canadian man says U.S. customs officers held him for three hours and forced him to provide a DNA sample before sending him home.

Just got these messages from @seengoals@mastodon.social, one of the members of Gaza Verified, basically accusing me of running a fundraiser for Gaza and keeping the proceeds (I have no fundraiser on any fundraising site anywhere) and extorting me to share his fundraiser or he’ll apparently go public with it.
So here’s what’s going to happening instead: Nabil has been removed Gaza Verified (

Der Morgen ist grau, das muss ein Dienstag sein! Meine Fediverse-Zusammenfassung des #DNIPBriefing heute #AusGründen etwas kürzer.
1️⃣ Ein simpel wirkendes Prompt hat in den letzten Wochen für einige Belustigungen in Teilen der DNIP-Redaktion gesorgt:
"Ich möchte mein …

Nett, mein Fedi Circle ist voll.
#CyberCircleCreator #FediCircle

Trotz Diskussion um das Ende der #Einspeisevergütung bleibt die #Photovoltaik wirtschaftlich.
Laut Bundesverband des Solarhandwerks rechnet sich eine typische Hausanlage auch ohne Vergütung, da der

Simple Lösung für billigen Strom: "Die Solaranlage lohnt sich inzwischen immer - auch ohne Einspeisevergütung"
Der große Solar-Boom in deutschen Eigenheimen ist vorbei. Gut so, sagt das Solarhandwerk. Denn nach dem russischen Angriff auf die Ukraine wurde auf deutschen Dächern viel Schindluder getrieben. Die Technik lohnt dennoch, auch ohne Einspeisevergütung. Im Interview verrät das Solarhandwerk, warum.

Perfect Network Resilience in Polynomial Time
Matthias Bentert, Stefan Schmid
https://arxiv.org/abs/2602.03827 https://arxiv.org/pdf/2602.03827 https://arxiv.org/html/2602.03827
arXiv:2602.03827v1 Announce Type: new
Abstract: Modern communication networks support local fast rerouting mechanisms to quickly react to link failures: nodes store a set of conditional rerouting rules which define how to forward an incoming packet in case of incident link failures. The rerouting decisions at any node $v$ must rely solely on local information available at $v$: the link from which a packet arrived at $v$, the target of the packet, and the incident link failures at $v$. Ideally, such rerouting mechanisms provide perfect resilience: any packet is routed from its source to its target as long as the two are connected in the underlying graph after the link failures. Already in their seminal paper at ACM PODC '12, Feigenbaum, Godfrey, Panda, Schapira, Shenker, and Singla showed that perfect resilience cannot always be achieved. While the design of local rerouting algorithms has received much attention since then, we still lack a detailed understanding of when perfect resilience is achievable.
This paper closes this gap and presents a complete characterization of when perfect resilience can be achieved. This characterization also allows us to design an $O(n)$-time algorithm to decide whether a given instance is perfectly resilient and an $O(nm)$-time algorithm to compute perfectly resilient rerouting rules whenever it is. Our algorithm is also attractive for the simple structure of the rerouting rules it uses, known as skipping in the literature: alternative links are chosen according to an ordered priority list (per in-port), where failed links are simply skipped. Intriguingly, our result also implies that in the context of perfect resilience, skipping rerouting rules are as powerful as more general rerouting rules. This partially answers a long-standing open question by Chiesa, Nikolaevskiy, Mitrovic, Gurtov, Madry, Schapira, and Shenker [IEEE/ACM Transactions on Networking, 2017] in the affirmative.
toXiv_bot_toot

Featuring headliners such as
Robert De Niro,
Minneapolis Mayor Jacob Frey
and journalist Don Lemon,
the “State of the Swamp” address
is set to continue through Trump’s address with live rebuttals.
Attendees were encouraged to dress in green frog attire
as a symbol of defiance,
honoring the frog costumes worn by many anti-Immigration and Customs Enforcement protesters during its occupation of the city.
It is also intended to reference the “…

State of the Union live updates: Epstein survivors to attend Trump’s address
The speech comes as the president faces an angry and divided Congress, plummeting approval ratings, and a major Supreme Court loss on his tariff policy.

Training data generation for context-dependent rubric-based short answer grading
Pavel \v{S}indel\'a\v{r}, D\'avid Slivka, Christopher Bouma, Filip Pr\'a\v{s}il, Ond\v{r}ej Bojar
https://arxiv.org/abs/2603.28537 https://arxiv.org/pdf/2603.28537 https://arxiv.org/html/2603.28537
arXiv:2603.28537v1 Announce Type: new
Abstract: Every 4 years, the PISA test is administered by the OECD to test the knowledge of teenage students worldwide and allow for comparisons of educational systems. However, having to avoid language differences and annotator bias makes the grading of student answers challenging. For these reasons, it would be interesting to compare methods of automatic student answer grading. To train some of these methods, which require machine learning, or to compute parameters or select hyperparameters for those that do not, a large amount of domain-specific data is needed. In this work, we explore a small number of methods for creating a large-scale training dataset using only a relatively small confidential dataset as a reference, leveraging a set of very simple derived text formats to preserve confidentiality. Using these methods, we successfully created three surrogate datasets that are, at the very least, superficially more similar to the reference dataset than purely the result of prompt-based generation. Early experiments suggest one of these approaches might also lead to improved model training.
toXiv_bot_toot