Tootfinder

Justice Ketanji Brown Jackson criticizes Supreme Court emergency rulings
Liberal Justice Ketanji Brown Jackson sharply criticized the Supreme Court on Monday
for being quick to issue rulings that have temporarily allowed some of Donald Trump’s controversial policies to stand
while legal challenges against them play out in the courts.

The justices have signed off on the administration’s ban on transgender soldiers in the military,
the firing of independent agenc…

Justice Ketanji Brown Jackson criticizes Supreme Court emergency rulings
During a public forum, Jackson and conservative Justice Brett M. Kavanaugh offered differing views of President Trump’s wins before the high court.

Venezuela’s new mining law could spell disaster for the Amazon, critics warn
https://news.mongabay.com/2026/04/venezuelas-new-mining-law-could-spell-disaster-for-the-amazon-critics-warn/

Venezuela’s new mining law could spell disaster for the Amazon, critics warn
Venezuela is close to passing a law to update the country’s mining regulations and attract private investment in gold, silver, coltan and other minerals. But advocacy groups say the law may end up exacerbating deforestation and pollution in mining areas where environmental damage is already an issue. The legislation is part of a broader effort […]

Mining rush for critical minerals threatens Amazon land reform settlements https://news.mongabay.com/2026/03/mining-rush-for-critical-minerals-threatens-amazon-land-reform-settlements/

Mining rush for critical minerals threatens Amazon land reform settlements
Families awaiting land reform in the Amazon now face a surge in mining that can destroy their chance at a decent life.

macaque_neural: Macaque cortical connectivity (Young)
A network of cortical regions in the Macaque cortex.
This network has 47 nodes and 505 edges.
Tags: Biological, Connectome, Unweighted
https://networks.skewed.de/net/macaque_neural
Ridiculogram:

NFL rookie report cards: Grading and ranking every team's 2025 draft class https://www.nfl.com/news/nfl-rookie-report-cards-grading-and-ranking-every-team-s-2025-draft-class

'AI tools developed at the University of Oxford for analysing ... text collections. They enable the identification of keywords, topics, and categories of terms' - particularly in crowdsourced / community archives https://github.com/Digital-Scholarship-Oxfor…

GitHub - Digital-Scholarship-Oxford/crowdsourced-data-tools: Crowdsourced data tools
Crowdsourced data tools. Contribute to Digital-Scholarship-Oxford/crowdsourced-data-tools development by creating an account on GitHub.

Approximate Cartesian Tree Matching with Substitutions
Panagiotis Charalampopoulos, Jonas Ellert, Manal Mohamed
https://arxiv.org/abs/2602.08570 https://arxiv.org/pdf/2602.08570 https://arxiv.org/html/2602.08570
arXiv:2602.08570v1 Announce Type: new
Abstract: The Cartesian tree of a sequence captures the relative order of the sequence's elements. In recent years, Cartesian tree matching has attracted considerable attention, particularly due to its applications in time series analysis. Consider a text $T$ of length $n$ and a pattern $P$ of length $m$. In the exact Cartesian tree matching problem, the task is to find all length-$m$ fragments of $T$ whose Cartesian tree coincides with the Cartesian tree $CT(P)$ of the pattern. Although the exact version of the problem can be solved in linear time [Park et al., TCS 2020], it remains rather restrictive; for example, it is not robust to outliers in the pattern.
To overcome this limitation, we consider the approximate setting, where the goal is to identify all fragments of $T$ that are close to some string whose Cartesian tree matches $CT(P)$. In this work, we quantify closeness via the widely used Hamming distance metric. For a given integer parameter $k>0$, we present an algorithm that computes all fragments of $T$ that are at Hamming distance at most $k$ from a string whose Cartesian tree matches $CT(P)$. Our algorithm runs in time $\mathcal O(n \sqrt{m} \cdot k^{2.5})$ for $k \leq m^{1/5}$ and in time $\mathcal O(nk^5)$ for $k \geq m^{1/5}$, thereby improving upon the state-of-the-art $\mathcal O(nmk)$-time algorithm of Kim and Han [TCS 2025] in the regime $k = o(m^{1/4})$.
On the way to our solution, we develop a toolbox of independent interest. First, we introduce a new notion of periodicity in Cartesian trees. Then, we lift multiple well-known combinatorial and algorithmic results for string matching and periodicity in strings to Cartesian tree matching and periodicity in Cartesian trees.
toXiv_bot_toot

🇺🇦 #NowPlaying on KEXP's #VarietyMix
Curtis Mayfield:
🎵 Get Down
#CurtisMayfield
https://ramseyhercules.bandcamp.com/track/curtis-mayfield-get-down-ramsey-hercules-edit
https://open.spotify.com/track/7aZGReAQ235D3r9iiao5U5

macaque_neural: Macaque cortical connectivity (Young)
A network of cortical regions in the Macaque cortex.
This network has 47 nodes and 505 edges.
Tags: Biological, Connectome, Unweighted
https://networks.skewed.de/net/macaque_neural
Ridiculogram:

The Trump administration has stepped up an effort to unmask a Reddit user who criticized Immigration and Customs Enforcement (ICE).
After failing to obtain information through a summons issued to Reddit,
the government reportedly issued a subpoena demanding that Reddit provide the information and appear before a grand jury in Washington, DC.
The Intercept described the subpoena today.
“According to a subpoena obtained by The Intercept, Reddit has until April 14 to pro…

Report: US demands Reddit unmask ICE critic, summons firm to grand jury
Trump admin reportedly gets grand jury involved in attempt to identify Redditor.