Tootfinder

gnutella: Gnutella p2p networks (2002)
A sequence of 9 snapshots of the Gnutella peer-to-peer file sharing network from 5-31 August 2002. Nodes are hosts in the Gnutella network topology and edges are connections between them.
This network has 26518 nodes and 65369 edges.
Tags: Technological, Peer-to-peer, Unweighted
https://

Series D, Episode 11 - Orbit
PINDER: Checkmate, Egrorian!
EGRORIAN: How dare you!
PINDER: Checkmate... checkmate...
EGRORIAN: [To game board] Recall the last six moves. [Computer replays a sequence of moves]
PINDER: [Sighing] Oh...
https://blake.torpidity.net/m/411/160

Conservatives want schools to teach this strict life path they say avoids poverty
The steps are simple: Graduate from high school. Find a full-time job. Get married before having kids.

The three-pronged framework is currently taught in just a handful of classrooms.
But soon, students across the country may be told that following those steps could keep them out of poverty as adults.
The approach is getting a boost from conservatives seeking to bring it to America’s middl…

Conservatives want schools to teach this strict life path they say avoids poverty
Bills in at least seven GOP-led states would require lessons on the “success sequence.” Critics say it ignores systemic challenges and stigmatizes non-traditional families.

Sequence, which builds AI agents to automate B2B companies' revenue operations, raised a $20M Series A led by 645 Ventures, bringing its total funding to ~$40M (Ryan Lawler/Axios)
https://www.axios.com/pro/fintech-deals/2025/12/16/sequence-20-million-re…

Exclusive: Sequence raises $20M to automate revenue ops
Finance teams still bill complex software contracts with spreadsheets and rigid tools.

gnutella: Gnutella p2p networks (2002)
A sequence of 9 snapshots of the Gnutella peer-to-peer file sharing network from 5-31 August 2002. Nodes are hosts in the Gnutella network topology and edges are connections between them.
This network has 36682 nodes and 88328 edges.
Tags: Technological, Peer-to-peer, Unweighted
https://

I had to collect surveillance videos from various of private houses and businesses a lot recently.
I came across a variety of NVRs many of which were a challenge for my nerves and mental health.
Example 1:
Exporting a 15 minute sequence of 2 cameras. After 1.5 hrs the status display switched from 0% to 1%.
Example 2:
This specific NVR allowed only to set a starting time for the export. The end time was chosen _randomly_ by the NVR itself. Sometimes 2 minutes, so…

from my link log —
How to identify an "immoral maze".
https://thezvi.wordpress.com/2020/01/12/how-to-identify-an-immoral-maze/
saved 2020-01-15

How to Identify an Immoral Maze
Previously in sequence: Moloch Hasn’t Won, Perfect Competition, Imperfect Competition, Does Big Business Hate Your Family?, What is Life in an Immoral Maze?, Stripping Away the Protections, What is…

🇺🇦 #NowPlaying on KEXP's #PacificNotions
36:
🎵 First Sequence
#36
https://3six.net/track/first-sequence
https://open.spotify.com/track/3RAlGxtf9VxpLpHNsCivX3

Inter-detector differential fuzz testing for tamper detection in gamma spectrometers
Pei Yao Li, Jayson R. Vavrek, Sean Peisert
https://arxiv.org/abs/2602.00336 https://arxiv.org/pdf/2602.00336 https://arxiv.org/html/2602.00336
arXiv:2602.00336v1 Announce Type: new
Abstract: We extend physical differential fuzz testing as an anti-tamper method for radiation detectors [Vavrek et al., Science and Global Security 2025] to comparisons across multiple detector units. The method was previously introduced as a tamper detection method for authenticating a single radiation detector in nuclear safeguards and treaty verification scenarios, and works by randomly sampling detector configuration parameters to produce a sequence of spectra that form a baseline signature of an untampered system. At a later date, after potential tampering, the same random sequence of parameters is used to generate another series of spectra that can be compared against the baseline. Anomalies in the series of comparisons indicate changes in detector behavior, which may be due to tampering. One limitation of this original method is that once the detector has `gone downrange' and may have been tampered with, the original baseline is fixed, and a new trusted baseline can never be established if tests at new parameters are required. In this work, we extend our anti-tamper fuzz testing concept to multiple detector units, such that the downrange detector can be compared against a trusted or `golden copy' detector, even despite normal inter-detector manufacturing variations. We show using three NaI detectors that this inter-detector differential fuzz testing can detect a representative attack, even when the tested and golden copy detectors are from different manufacturers and have different performances. Here, detecting tampering requires visualizing the comparison metric vs. the parameter values and not just the sample number; moreover this baseline is non-linear and may require anomaly detection methods more complex than a simple threshold. Overall, this extension to multiple detectors improves prospects for operationalizing the technique in real-world treaty verification and safeguards contexts.
toXiv_bot_toot

"A very-well known Internet meme, inspired by a scene from the 2004 movie “Finding Neverland”, features a sequence of images in which a very young Freddie Highmore tearfully admits that “it works in my machine”, to which Johnny Depp replies “then we’ll ship your machine”, with the last caption stating “and that is how Docker was born”."

Shipping Your Computer
The analogy between intermodal containers and software containers sounds cliché, but it works pretty well, which is the reason why we will keep using it in this article. Let us recap: before the standardization around intermodal containers after the Second World War, freight had to be manually loaded and unloaded from boats to trains to trucks, over and over again. Before the rise of software containers of the 2010s, software had to be manually loaded and unloaded from developer laptops to tes…

🇺🇦 #NowPlaying on BBCRadio3's #Breakfast
Carl Nielsen & Fibonacci Sequence:
🎵 Serenata in vano FS.68
#CarlNielsen #FibonacciSequence
https://open.spotify.com/track/6mlDkwdvwTNTWAAmOgJnTl

First Resolution of a Main Sequence G-Star #Astrosphere Using Chandra: https://arxiv.org/abs/2512.09613 -> Young ‘Sun’ Caught Blowing Bubbles by NASA’s Chandra: https://www.nasa.gov/missions/chandra/young-sun-caught-blowing-bubbles-by-nasas-chandra/

Once in a while, when watching a video on my TV, the audio stream fails to start on the sound bar. Nothing shows that this is happening, but there's no audio.
Usually, we'll just stop/start the video (turn it off and on again).
Increasingly (it seems; maybe it's always been this way and I just notice now), videos are starting intentionally silently. The audio only starts after an intro or title sequence.
"Is it broken? Or is this just 'art’?” is a commo…

from my link log —
The Euclid-Mullin sequence of prime numbers.
https://blogs.scientificamerican.com/roots-of-unity/a-curious-sequence-of-prime-numbers/
saved 2019-05-26

A Curious Sequence of Prime Numbers
Euclid’s proof of the infinitude of primes opens the door to some interesting questions

malaria_genes: Malaria var DBLa HVR networks
Networks of recombinant antigen genes from the human malaria parasite P. falciparum. Each of the 9 networks shares the same set of vertices but has different edges, corresponding to the 9 highly variable regions (HVRs) in the DBLa domain of the var protein. Nodes are var genes, and two genes are connected if they share a substring whose length is statistically significant. Metadata includes two types of node labels, both based on sequence st…

Polygon buys crypto startups Coinme and Sequence for a total of $250M , as it seeks to bolster its stablecoin and fintech infrastructure and compete with Stripe (Ben Weiss/Fortune)
https://fortune.com/2026/01/13/polygon-labs-acquisition-coinme-seq…

Polygon Labs buys two crypto startups for $250 million as it looks to compete with Stripe
The longtime blockchain developer bought cash-to-crypto company Coinme and wallet infrastructure firm Sequence.

Fanciful Figurines flip Free Flood-It -- Polynomial-Time Miniature Painting on Co-gem-free Graphs
Christian Rosenke, Mark Scheibner
https://arxiv.org/abs/2602.00690 https://arxiv.org/pdf/2602.00690 https://arxiv.org/html/2602.00690
arXiv:2602.00690v1 Announce Type: new
Abstract: Inspired by the eponymous hobby, we introduce Miniature Painting as the computational problem to paint a given graph $G=(V,E)$ according to a prescribed template $t \colon V \rightarrow C$, which assigns colors $C$ to the vertices of $G$. In this setting, the goal is to realize the template using a shortest possible sequence of brush strokes, where each stroke overwrites a connected vertex subset with a color in $C$. We show that this problem is equivalent to a reversal of the well-studied Free Flood-It game, in which a colored graph is decolored into a single color using as few moves as possible. This equivalence allows known complexity results for Free Flood-It to be transferred directly to Miniature Painting, including NP-hardness under severe structural restrictions, such as when $G$ is a grid, a tree, or a split graph. Our main contribution is a polynomial-time algorithm for Miniature Painting on graphs that are free of induced co-gems, a graph class that strictly generalizes cographs. As a direct consequence, Free Flood-It is also polynomial-time solvable on co-gem-free graphs, independent of the initial coloring.
toXiv_bot_toot

Learning to Build Shapes by Extrusion
Thor Vestergaard Christiansen, Karran Pandey, Alba Reinders, Karan Singh, Morten Rieger Hannemose, J. Andreas B{\ae}rentzen
https://arxiv.org/abs/2601.22858 https://arxiv.org/pdf/2601.22858 https://arxiv.org/html/2601.22858
arXiv:2601.22858v1 Announce Type: new
Abstract: We introduce Text Encoded Extrusion (TEE), a text-based representation that expresses mesh construction as sequences of face extrusions rather than polygon lists, and a method for generating 3D meshes from TEE using a large language model (LLM). By learning extrusion sequences that assemble a mesh, similar to the way artists create meshes, our approach naturally supports arbitrary output face counts and produces manifold meshes by design, in contrast to recent transformer-based models. The learnt extrusion sequences can also be applied to existing meshes - enabling editing in addition to generation. To train our model, we decompose a library of quadrilateral meshes with non-self-intersecting face loops into constituent loops, which can be viewed as their building blocks, and finetune an LLM on the steps for reassembling the meshes by performing a sequence of extrusions. We demonstrate that our representation enables reconstruction, novel shape synthesis, and the addition of new features to existing meshes.
toXiv_bot_toot

🇺🇦 #NowPlaying on BBCRadio3's #EssentialClassics
Bernhard Crusell & Fibonacci Sequence:
🎵 Divertimento, Op.9
#BernhardCrusell #FibonacciSequence
Please 🔁 BOOST to share what you like
- your followers don't see if you ⭐ favourite a post

I wish my #cat were so casual about his duties. Every morning he shepherds us through this sequence:
• I use the bathroom.
• I feed him breakfast, which he ceremoniously takes a few bites of.
• I open the lounge room blind for sun and the sliding door for breeze.
• He wakes my wife to herd her to the lounge.
• I make my wife tea and breakfast.
• My wife puts the TV on.
…

GeriAQuin (@GeriAQuin@mstdn.social)
Attached: 1 image #Cat #Cats #CatsOfMastodon

gnutella: Gnutella p2p networks (2002)
A sequence of 9 snapshots of the Gnutella peer-to-peer file sharing network from 5-31 August 2002. Nodes are hosts in the Gnutella network topology and edges are connections between them.
This network has 8114 nodes and 26013 edges.
Tags: Technological, Peer-to-peer, Unweighted
https://

Oscillatory multi-timescale mechanisms underlying audiovisual sequence prediction https://direct.mit.edu/imag/article/doi/10.1162/IMAG.a.1103/134754/Oscillatory-multi-timescale-mechanisms-underlying

🇺🇦 #NowPlaying on KEXP's #MiddayShow
The Helio Sequence:
🎵 Keep Your Eyes Ahead
#TheHelioSequence
https://theheliosequence.bandcamp.com/album/keep-your-eyes-ahead
https://open.spotify.com/track/3yatRBsGMJ7wMoUIgDBzzo

after I type "This is my hole", android gboard sometimes suggests heart emojis.
I was making a note to myself in Google Keep about Amigara Fault, and got sidetracked by the heart suggestion. it's inconsistent. it behaves differently at different times in different blank notes. usually it suggests the hole emoji, but...

Students from Montrose pose in Barton Hall with flags in the background at the February Flash Dash last Sunday
https://www.behance.net/gallery/244247917/February-Flash-Dash-2026-Group-Portraits

Screen at a gas station pump. I did not wait around for the boot sequence to finish.

Calibrations for the Sasaki volume on odd spheres and the no-gap problem
Jonas Matuzas
https://arxiv.org/abs/2602.22961 https://arxiv.org/pdf/2602.22961 https://arxiv.org/html/2602.22961
arXiv:2602.22961v1 Announce Type: new
Abstract: For each odd sphere $S^{n}$ with $n=2m 1\ge 5$, we consider the Sasaki volume functional $\mathrm{Vol}^S(V)=\int_{S^{n}}\sqrt{\det(I (\nabla V)^{\top}(\nabla V))}\,d\mathrm{vol}$ on smooth unit tangent vector fields $V$. Using the Brito--Chacon--Naveira calibration $\omega=a\wedge\Theta$ on the unit tangent bundle $E=UTS^{n}$, we establish the universal calibrated lower bound $\mathrm{Vol}^S(V)\ge c(m;1)\,\mathrm{vol}(S^{n})$, where $c(m;1)=4^{m}/\binom{2m}{m}$. In the relaxed (integral-current) setting, we show that the section-constrained stable mass in $E$ equals the calibration value and is attained by an $\omega$-calibrated mass-minimizing integral $n$-cycle in the section class.
We also analyze the equality case on smooth graphs. If a smooth graph is $\omega$-calibrated on an open set, then it satisfies the rigidity system $\nabla_V V=0$ and $\nabla_X V=\lambda X$ for all $X\perp V$, hence is locally a radial distance-gradient field. In particular, for $m\ge 2$ there is no smooth unit field on $S^n$ whose graph is $\omega$-calibrated everywhere.
Finally, we construct an explicit smooth recovery sequence (presented in detail for $S^5$ and then extended to all odd dimensions) and prove a uniform nonvanishing estimate for the polar-shell normalization in the patching construction. As a consequence, $\inf_{V}\,\mathrm{Vol}^S(V)=c(m;1)\,\mathrm{vol}(S^{n})$, so there is no Lavrentiev gap.
toXiv_bot_toot

Loons… #HeatedRivalry I’m reading GC and gotten to the heart-wrenching PLAYOFFS sequence. The wrenching is actually good. Heartbreak feels good in a place like this! 🤣

A ceaseless urge beneath all appearance; an impulse not merely to persist but to intensify; life as duration, as movement, as an unbroken unfolding in time. As a technology of becoming. Life as sequence - procedural quests of forward momentum.
A language underwrites the motion; lines on lines inscribing themselves across a dark field. Pulses like pixels, moving in canon. Constructions that branch, loop, and repeat. Patterns generate patterns, as though the law of existence were simply…

Test-Time Training with KV Binding Is Secretly Linear Attention
Junchen Liu, Sven Elflein, Or Litany, Zan Gojcic, Ruilong Li
https://arxiv.org/abs/2602.21204 https://arxiv.org/pdf/2602.21204 https://arxiv.org/html/2602.21204
arXiv:2602.21204v1 Announce Type: new
Abstract: Test-time training (TTT) with KV binding as sequence modeling layer is commonly interpreted as a form of online meta-learning that memorizes a key-value mapping at test time. However, our analysis reveals multiple phenomena that contradict this memorization-based interpretation. Motivated by these findings, we revisit the formulation of TTT and show that a broad class of TTT architectures can be expressed as a form of learned linear attention operator. Beyond explaining previously puzzling model behaviors, this perspective yields multiple practical benefits: it enables principled architectural simplifications, admits fully parallel formulations that preserve performance while improving efficiency, and provides a systematic reduction of diverse TTT variants to a standard linear attention form. Overall, our results reframe TTT not as test-time memorization, but as learned linear attention with enhanced representational capacity.
toXiv_bot_toot

OK so, I've started cleaning up the PCIe code but also took this opportunity to do some tests.
I'm just writing to a random old SSD I have lying around that I used for some tests a while ago, I have no idea what writing to a random address is doing (I haven't even set a BAR on it so it's probably ignoring me) but the goal is to test the SoC not do anything real.
Here's a 128 byte memcpy to the BAR. It turns into eight 16-byte TLPs, presumably each generated by…

caida_as: CAIDA AS graphs (2004-2007)
A sequence of 122 network snapshots denoting Autonomous System (AS) relationships on the Internet, from 2004-2007, inferred using the Serial-1 method from RouteViews BGP table snapshots and a set of heuristics.
This network has 22270 nodes and 90820 edges.
Tags: Technological, Communication, Unweighted, Temporal

Detection of a giant #flare displaying quasi-periodic pulsations from a pre-main-sequence M star by the Next Generation Transit Survey: https://academic.oup.com/mnras/article/482/4/5553/5224549?login=false -> Weathering a Stellar Temper Tantrum - How space weather complicates exoplanet habitability: https://astrobites.org/2026/02/16/stellar-temper-tantrum/

🇺🇦 #NowPlaying on KEXP's #MorningShow
The Helio Sequence:
🎵 Keep Your Eyes Ahead
#TheHelioSequence
https://theheliosequence.bandcamp.com/album/keep-your-eyes-ahead
https://open.spotify.com/track/3yatRBsGMJ7wMoUIgDBzzo

"How volcanic eruptions set off a chain of events that brought the Black Death to Europe"
#Europe #BlackDeath
https://…

How volcanic eruptions set off a chain of events that brought the Black Death to Europe
Clues contained in tree rings have identified mid-14th-century volcanic activity as the first domino to fall in a sequence that led to the devastation of the Black Death in Europe.

A new #Nextcloud adventure: having installed the new Social refactoring and passed the webfinger and ssl tests, was still unable to load some profiles and no interactions went out or came in.
Then I noticed PullRequest-5 - not knowing at all what I was doing - so I installed gh, authorized it, did the pull, composer, run sequence, and while the existing open tab for Social continued as before, 'Social' was now gone from the NC admin and menu!
"app": "core",
"method": "GET",
"url": "/settings/apps/list",
"message": "Could not read app info file for app \"social\""
Google/DDG are mute on what or where an app info file might be, and NC docs only say you can register an app and maybe perhaps the tarball will contain one? Perhaps the PR munged it? 🤷
So a new adventure begins …

caida_as: CAIDA AS graphs (2004-2007)
A sequence of 122 network snapshots denoting Autonomous System (AS) relationships on the Internet, from 2004-2007, inferred using the Serial-1 method from RouteViews BGP table snapshots and a set of heuristics.
This network has 24801 nodes and 101762 edges.
Tags: Technological, Communication, Unweighted, Temporal

Towards the complete description of stationary states of a Bose-Einstein condensate in a one-dimensional quasiperiodic lattice: A coding approach
G. L. Alfimov, A. P. Fedotov, Ya. A. Murenkov, D. A. Zezyulin
https://arxiv.org/abs/2602.17172 https://arxiv.org/pdf/2602.17172 https://arxiv.org/html/2602.17172
arXiv:2602.17172v1 Announce Type: new
Abstract: We consider stationary states of an effectively one-dimensional Bose-Einstein condensate in a quasiperiodic lattice. We formulate sufficient conditions for a one-to-one correspondence between the stationary states with a fixed chemical potential and the set of bi-infinite sequences over a finite alphabet. These conditions can be checked numerically. A bi-infinite sequence can be interpreted as a code of the corresponding solution. A numerical example demonstrates the coding approach using an alphabet of three symbols.
toXiv_bot_toot

ASASSN-24fw - Candidate Gas-rich #Circumsecondary Disk Occultation of a Main-sequence Star: https://iopscience.iop.org/article/10.3847/1538-3881/ae1fd9 -> Massive Cloud With Metallic Winds Discovered Orbiting Mystery Object: https://noirlab.edu/public/news/noirlab2602/ - astronomers using the Gemini South telescope achieve unprecedented detection of vaporized metals within a dusty, gaseous cloud during rare stellar occultation.

🔊 #NowPlaying on #BBCRadio3:
#SundayMorning
- Three hours of classical sparkle
Join Sarah Walker for three hours of classical music to reflect, restore and refresh, including a calming Choral Reflection at 9.45, and another specially chosen Sunday Sequence.
Relisten now 👇
https://www.bbc.co.uk/programmes/m002q3zh

Learning from Trials and Errors: Reflective Test-Time Planning for Embodied LLMs
Yining Hong, Huang Huang, Manling Li, Li Fei-Fei, Jiajun Wu, Yejin Choi
https://arxiv.org/abs/2602.21198 https://arxiv.org/pdf/2602.21198 https://arxiv.org/html/2602.21198
arXiv:2602.21198v1 Announce Type: new
Abstract: Embodied LLMs endow robots with high-level task reasoning, but they cannot reflect on what went wrong or why, turning deployment into a sequence of independent trials where mistakes repeat rather than accumulate into experience. Drawing upon human reflective practitioners, we introduce Reflective Test-Time Planning, which integrates two modes of reflection: \textit{reflection-in-action}, where the agent uses test-time scaling to generate and score multiple candidate actions using internal reflections before execution; and \textit{reflection-on-action}, which uses test-time training to update both its internal reflection model and its action policy based on external reflections after execution. We also include retrospective reflection, allowing the agent to re-evaluate earlier decisions and perform model updates with hindsight for proper long-horizon credit assignment. Experiments on our newly-designed Long-Horizon Household benchmark and MuJoCo Cupboard Fitting benchmark show significant gains over baseline models, with ablative studies validating the complementary roles of reflection-in-action and reflection-on-action. Qualitative analyses, including real-robot trials, highlight behavioral correction through reflection.
toXiv_bot_toot

Void Stranger (2023) is a fascinating casual puzzle game.
In an ignore-my-todos mood, I picked it up from Steam on a whim, because an unrelated blog post made an offhand mention "you should play it". I hadn't heard anything about it before.
I ended up playing ~12 hours straight, hit the end credits, and there's a lot more to do that I'm trying to detach from. it's hard to talk about without spoilers, but there's a well-paced sequence of gradual revel…

malaria_genes: Malaria var DBLa HVR networks
Networks of recombinant antigen genes from the human malaria parasite P. falciparum. Each of the 9 networks shares the same set of vertices but has different edges, corresponding to the 9 highly variable regions (HVRs) in the DBLa domain of the var protein. Nodes are var genes, and two genes are connected if they share a substring whose length is statistically significant. Metadata includes two types of node labels, both based on sequence st…

Because because because because because. Because of the wonderful things he did in the last scene.
Improv teacher Steve Hoopla in today's 'story' course guided us through some "Because Games", in which scenes are to be causally connected. Each following on from prior scenes. Because that happened, this happened.
He didn't explicitly mention Pixar's "Story Spine", but the main loop in Pixar's story template is "...and because of that..." looping over and over between the introduction, call to adventure, and conclusion.
Causality is what strings a story together, gives it structure an avoids it being just a disconnected dream sequence. This scene is only happening because of the events in the prior scenes. It gives the string of scenes meaning and relevance.
So good fun to drill some of that stuff with the team and end up with sheep infestations and santa claus robot wars among other laughs.
Gonna miss next week's session due to a prior engagement, but the team is gelling well. Pretty sure we could do this show without much further guidance really. Everyone's very good.
#london #improv #hooplaImpro

Rewriting Systems on Arbitrary Monoids
Eduardo Magalh\~aes
https://arxiv.org/abs/2601.10564 https://arxiv.org/pdf/2601.10564 https://arxiv.org/html/2601.10564
arXiv:2601.10564v1 Announce Type: new
Abstract: In this paper, we introduce monoidal rewriting systems (MRS), an abstraction of string rewriting in which reductions are defined over an arbitrary ambient monoid rather than a free monoid of words. This shift is partly motivated by logic: the class of free monoids is not first-order axiomatizable, so "working in the free setting" cannot be treated internally when applying first-order methods to rewriting presentations.
To analyze these systems categorically, we define $\mathbf{NCRS_2}$ as the 2-category of Noetherian Confluent MRS. We then prove the existence of a canonical biadjunction between $\mathbf{NCRS_2}$ and $\mathbf{Mon}$.
Finally, we classify all Noetherian Confluent MRS that present a given fixed monoid. For this, we introduce Generalized Elementary Tietze Transformations (GETTs) and prove that any two presentations of a monoid are connected by a (possibly infinite) sequence of these transformations, yielding a complete characterization of generating systems up to GETT-equivalence.
toXiv_bot_toot

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

caida_as: CAIDA AS graphs (2004-2007)
A sequence of 122 network snapshots denoting Autonomous System (AS) relationships on the Internet, from 2004-2007, inferred using the Serial-1 method from RouteViews BGP table snapshots and a set of heuristics.
This network has 26242 nodes and 106348 edges.
Tags: Technological, Communication, Unweighted, Temporal

from my link log —
Why the trans flag emoji uses a sequence of 5 unicode codepoints.
https://hecate.pink/blog/2026/trans-flag-emoji/
saved 2026-01-07 …

why the trans flag emoji uses the codepoints it uses
a tale about a young transgender intern

Multi-agent learning under uncertainty: Recurrence vs. concentration
Kyriakos Lotidis, Panayotis Mertikopoulos, Nicholas Bambos, Jose Blanchet
https://arxiv.org/abs/2512.08132 https://arxiv.org/pdf/2512.08132 https://arxiv.org/html/2512.08132
arXiv:2512.08132v1 Announce Type: new
Abstract: In this paper, we examine the convergence landscape of multi-agent learning under uncertainty. Specifically, we analyze two stochastic models of regularized learning in continuous games -- one in continuous and one in discrete time with the aim of characterizing the long-run behavior of the induced sequence of play. In stark contrast to deterministic, full-information models of learning (or models with a vanishing learning rate), we show that the resulting dynamics do not converge in general. In lieu of this, we ask instead which actions are played more often in the long run, and by how much. We show that, in strongly monotone games, the dynamics of regularized learning may wander away from equilibrium infinitely often, but they always return to its vicinity in finite time (which we estimate), and their long-run distribution is sharply concentrated around a neighborhood thereof. We quantify the degree of this concentration, and we show that these favorable properties may all break down if the underlying game is not strongly monotone -- underscoring in this way the limits of regularized learning in the presence of persistent randomness and uncertainty.
toXiv_bot_toot

Untied Ulysses: Memory-Efficient Context Parallelism via Headwise Chunking
Ravi Ghadia, Maksim Abraham, Sergei Vorobyov, Max Ryabinin
https://arxiv.org/abs/2602.21196 https://arxiv.org/pdf/2602.21196 https://arxiv.org/html/2602.21196
arXiv:2602.21196v1 Announce Type: new
Abstract: Efficiently processing long sequences with Transformer models usually requires splitting the computations across accelerators via context parallelism. The dominant approaches in this family of methods, such as Ring Attention or DeepSpeed Ulysses, enable scaling over the context dimension but do not focus on memory efficiency, which limits the sequence lengths they can support. More advanced techniques, such as Fully Pipelined Distributed Transformer or activation offloading, can further extend the possible context length at the cost of training throughput. In this paper, we present UPipe, a simple yet effective context parallelism technique that performs fine-grained chunking at the attention head level. This technique significantly reduces the activation memory usage of self-attention, breaking the activation memory barrier and unlocking much longer context lengths. Our approach reduces intermediate tensor memory usage in the attention layer by as much as 87.5$\%$ for 32B Transformers, while matching previous context parallelism techniques in terms of training speed. UPipe can support the context length of 5M tokens when training Llama3-8B on a single 8$\times$H100 node, improving upon prior methods by over 25$\%$.
toXiv_bot_toot

🇺🇦 #NowPlaying on BBCRadio3's #SoundOfCinema
Cole Porter & Cole Porter:
🎵 Evil Under the Sun "Dance Sequence"
#ColePorter

from my link log —
Desperately seeking squircles.
https://www.figma.com/blog/desperately-seeking-squircles/
saved 2025-12-08 https://…

Desperately seeking squircles | Figma Blog
In a famous 1972 interview, Charles Eames answered a short sequence of fundamental questions about the nature of design.

caida_as: CAIDA AS graphs (2004-2007)
A sequence of 122 network snapshots denoting Autonomous System (AS) relationships on the Internet, from 2004-2007, inferred using the Serial-1 method from RouteViews BGP table snapshots and a set of heuristics.
This network has 24078 nodes and 98112 edges.
Tags: Technological, Communication, Unweighted, Temporal

Exploring the Impact of Parameter Update Magnitude on Forgetting and Generalization of Continual Learning
JinLi He, Liang Bai, Xian Yang
https://arxiv.org/abs/2602.20796 https://arxiv.org/pdf/2602.20796 https://arxiv.org/html/2602.20796
arXiv:2602.20796v1 Announce Type: new
Abstract: The magnitude of parameter updates are considered a key factor in continual learning. However, most existing studies focus on designing diverse update strategies, while a theoretical understanding of the underlying mechanisms remains limited. Therefore, we characterize model's forgetting from the perspective of parameter update magnitude and formalize it as knowledge degradation induced by task-specific drift in the parameter space, which has not been fully captured in previous studies due to their assumption of a unified parameter space. By deriving the optimal parameter update magnitude that minimizes forgetting, we unify two representative update paradigms, frozen training and initialized training, within an optimization framework for constrained parameter updates. Our theoretical results further reveals that sequence tasks with small parameter distances exhibit better generalization and less forgetting under frozen training rather than initialized training. These theoretical insights inspire a novel hybrid parameter update strategy that adaptively adjusts update magnitude based on gradient directions. Experiments on deep neural networks demonstrate that this hybrid approach outperforms standard training strategies, providing new theoretical perspectives and practical inspiration for designing efficient and scalable continual learning algorithms.
toXiv_bot_toot

The third #AAS247 presser https://www.youtube.com/watch?v=hfDmYXvBbV4 about News from the High-Redshift Universe and Local Analogs dealt with the papers The ALPINE-CRISTAL-JWST Survey: JWST/IFU Optical Observations for 18 Main-sequence Galaxies at z = 4–6 (https://iopscience.iop.org/article/10.3847/1538-4365/ae0928 with https://www.caltech.edu/about/news/young-galaxies-grow-up-fast and https://public.nrao.edu/news/young-galaxies-grow-up-fast/), A New Population of Point-like, Narrow-line Objects Revealed by the James Webb Space Telescope (https://arxiv.org/abs/2509.12177 with https://showme.missouri.edu/2026/scientists-discover-platypus-galaxies-in-the-early-universe/ and https://science.nasa.gov/missions/webb/scientists-identify-astronomys-platypus-with-nasas-webb-telescope/; slide), Supermassive Stars Match the Spectral Signatures of JWST's Little Red Dots (https://arxiv.org/abs/2507.12618 with https://www.cfa.harvard.edu/news/scientists-use-jwst-examine-ancient-monster-stars-may-reveal-birth-black-holes) and Discovery of SiC and Iron Dust around AGB Stars in the Very Metal-poor Sextans a Dwarf Galaxy with JWST: Implications for Dust Production at High Redshift & JWST Captures Growth of Aromatic Hydrocarbon Dust Particles in the Extremely Metal-poor Galaxy Sextans A (https://iopscience.iop.org/article/10.3847/1538-4357/adf06a / https://arxiv.org/abs/2512.04060 with https://science.nasa.gov/missions/webb/nasa-webb-finds-early-universe-analogs-unexpected-talent-for-making-dust/).

caida_as: CAIDA AS graphs (2004-2007)
A sequence of 122 network snapshots denoting Autonomous System (AS) relationships on the Internet, from 2004-2007, inferred using the Serial-1 method from RouteViews BGP table snapshots and a set of heuristics.
This network has 25158 nodes and 102468 edges.
Tags: Technological, Communication, Unweighted, Temporal

Replaced article(s) found for cs.LG. https://arxiv.org/list/cs.LG/new
[3/6]:
- Towards Scalable Oversight via Partitioned Human Supervision
Ren Yin, Takashi Ishida, Masashi Sugiyama
https://arxiv.org/abs/2510.22500 https://mastoxiv.page/@arXiv_csLG_bot/115451787490434401
- ContextPilot: Fast Long-Context Inference via Context Reuse
Yinsicheng Jiang, Yeqi Huang, Liang Cheng, Cheng Deng, Xuan Sun, Luo Mai
https://arxiv.org/abs/2511.03475 https://mastoxiv.page/@arXiv_csLG_bot/115502245581974540
- Metabolomic Biomarker Discovery for ADHD Diagnosis Using Interpretable Machine Learning
Nabil Belacel, Mohamed Rachid Boulassel
https://arxiv.org/abs/2601.11283 https://mastoxiv.page/@arXiv_csLG_bot/115921183182326799
- PhysE-Inv: A Physics-Encoded Inverse Modeling approach for Arctic Snow Depth Prediction
Akila Sampath, Vandana Janeja, Jianwu Wang
https://arxiv.org/abs/2601.17074
- SAGE-5GC: Security-Aware Guidelines for Evaluating Anomaly Detection in the 5G Core Network
Cristian Manca, Christian Scano, Giorgio Piras, Fabio Brau, Maura Pintor, Battista Biggio
https://arxiv.org/abs/2602.03596
- LORE: Jointly Learning the Intrinsic Dimensionality and Relative Similarity Structure From Ordina...
Anand, Helbling, Davenport, Berman, Alagapan, Rozell
https://arxiv.org/abs/2602.04192
- Towards Robust Scaling Laws for Optimizers
Alexandra Volkova, Mher Safaryan, Christoph H. Lampert, Dan Alistarh
https://arxiv.org/abs/2602.07712 https://mastoxiv.page/@arXiv_csLG_bot/116046369672796465
- Do We Need Adam? Surprisingly Strong and Sparse Reinforcement Learning with SGD in LLMs
Sagnik Mukherjee, Lifan Yuan, Pavan Jayasinha, Dilek Hakkani-T\"ur, Hao Peng
https://arxiv.org/abs/2602.07729 https://mastoxiv.page/@arXiv_csLG_bot/116046377539155485
- AceGRPO: Adaptive Curriculum Enhanced Group Relative Policy Optimization for Autonomous Machine L...
Yuzhu Cai, Zexi Liu, Xinyu Zhu, Cheng Wang, Siheng Chen
https://arxiv.org/abs/2602.07906 https://mastoxiv.page/@arXiv_csLG_bot/116046423413650658
- VESPO: Variational Sequence-Level Soft Policy Optimization for Stable Off-Policy LLM Training
Guobin Shen, Chenxiao Zhao, Xiang Cheng, Lei Huang, Xing Yu
https://arxiv.org/abs/2602.10693 https://mastoxiv.page/@arXiv_csLG_bot/116057229834947730
- KBVQ-MoE: KLT-guided SVD with Bias-Corrected Vector Quantization for MoE Large Language Models
Zukang Xu, Zhixiong Zhao, Xing Hu, Zhixuan Chen, Dawei Yang
https://arxiv.org/abs/2602.11184 https://mastoxiv.page/@arXiv_csLG_bot/116062537528208461
- MUSE: Multi-Tenant Model Serving With Seamless Model Updates
Correia, Ferreira, Martins, Bento, Guerreiro, Pereira, Gomes, Bono, Ferreira, Bizarro
https://arxiv.org/abs/2602.11776 https://mastoxiv.page/@arXiv_csLG_bot/116062952355379801
- Pawsterior: Variational Flow Matching for Structured Simulation-Based Inference
Jorge Carrasco-Pollo, Floor Eijkelboom, Jan-Willem van de Meent
https://arxiv.org/abs/2602.13813 https://mastoxiv.page/@arXiv_csLG_bot/116085828112928218
- Silent Inconsistency in Data-Parallel Full Fine-Tuning: Diagnosing Worker-Level Optimization Misa...
Hong Li, Zhen Zhou, Honggang Zhang, Yuping Luo, Xinyue Wang, Han Gong, Zhiyuan Liu
https://arxiv.org/abs/2602.14462 https://mastoxiv.page/@arXiv_csLG_bot/116085997857526328
- Divine Benevolence is an $x^2$: GLUs scale asymptotically faster than MLPs
Alejandro Francisco Queiruga
https://arxiv.org/abs/2602.14495 https://mastoxiv.page/@arXiv_csLG_bot/116086011618741857
- \"UberWeb: Insights from Multilingual Curation for a 20-Trillion-Token Dataset
DatologyAI, et al.
https://arxiv.org/abs/2602.15210 https://mastoxiv.page/@arXiv_csLG_bot/116090912256712568
- GLM-5: from Vibe Coding to Agentic Engineering
GLM-5-Team, et al.
https://arxiv.org/abs/2602.15763 https://mastoxiv.page/@arXiv_csLG_bot/116091080686771018
- Anatomy of Capability Emergence: Scale-Invariant Representation Collapse and Top-Down Reorganizat...
Jayadev Billa
https://arxiv.org/abs/2602.15997 https://mastoxiv.page/@arXiv_csLG_bot/116096541546306333
- AI-CARE: Carbon-Aware Reporting Evaluation Metric for AI Models
KC Santosh, Srikanth Baride, Rodrigue Rizk
https://arxiv.org/abs/2602.16042 https://mastoxiv.page/@arXiv_csLG_bot/116096581524696028
- Beyond Message Passing: A Symbolic Alternative for Expressive and Interpretable Graph Learning
Chuqin Geng, Li Zhang, Haolin Ye, Ziyu Zhao, Yuhe Jiang, Tara Saba, Xinyu Wang, Xujie Si
https://arxiv.org/abs/2602.16947 https://mastoxiv.page/@arXiv_csLG_bot/116102426238903124
toXiv_bot_toot

🔊 #NowPlaying on #BBCRadio3:
#ClassicalMixtape
- A laid-back sequence of classical music
null
Relisten now 👇
https://www.bbc.co.uk/programmes/m002mx1v

caida_as: CAIDA AS graphs (2004-2007)
A sequence of 122 network snapshots denoting Autonomous System (AS) relationships on the Internet, from 2004-2007, inferred using the Serial-1 method from RouteViews BGP table snapshots and a set of heuristics.
This network has 23390 nodes and 92190 edges.
Tags: Technological, Communication, Unweighted, Temporal

gnutella: Gnutella p2p networks (2002)
A sequence of 9 snapshots of the Gnutella peer-to-peer file sharing network from 5-31 August 2002. Nodes are hosts in the Gnutella network topology and edges are connections between them.
This network has 8114 nodes and 26013 edges.
Tags: Technological, Peer-to-peer, Unweighted
https://

🇺🇦 #NowPlaying on KEXP's #PacificNotions
OUTER:
🎵 Dream Sequence #2
#OUTER
https://ruptureldn.bandcamp.com/track/sully-x-outer-heaven-dream-sequence

Polyharmonic Cascade
Yuriy N. Bakhvalov
https://arxiv.org/abs/2512.17671 https://arxiv.org/pdf/2512.17671 https://arxiv.org/html/2512.17671
arXiv:2512.17671v1 Announce Type: new
Abstract: This paper presents a deep machine learning architecture, the "polyharmonic cascade" -- a sequence of packages of polyharmonic splines, where each layer is rigorously derived from the theory of random functions and the principles of indifference. This makes it possible to approximate nonlinear functions of arbitrary complexity while preserving global smoothness and a probabilistic interpretation. For the polyharmonic cascade, a training method alternative to gradient descent is proposed: instead of directly optimizing the coefficients, one solves a single global linear system on each batch with respect to the function values at fixed "constellations" of nodes. This yields synchronized updates of all layers, preserves the probabilistic interpretation of individual layers and theoretical consistency with the original model, and scales well: all computations reduce to 2D matrix operations efficiently executed on a GPU. Fast learning without overfitting on MNIST is demonstrated.
toXiv_bot_toot

gnutella: Gnutella p2p networks (2002)
A sequence of 9 snapshots of the Gnutella peer-to-peer file sharing network from 5-31 August 2002. Nodes are hosts in the Gnutella network topology and edges are connections between them.
This network has 26518 nodes and 65369 edges.
Tags: Technological, Peer-to-peer, Unweighted
https://

Spatially-informed transformers: Injecting geostatistical covariance biases into self-attention for spatio-temporal forecasting
Yuri Calleo
https://arxiv.org/abs/2512.17696 https://arxiv.org/pdf/2512.17696 https://arxiv.org/html/2512.17696
arXiv:2512.17696v1 Announce Type: new
Abstract: The modeling of high-dimensional spatio-temporal processes presents a fundamental dichotomy between the probabilistic rigor of classical geostatistics and the flexible, high-capacity representations of deep learning. While Gaussian processes offer theoretical consistency and exact uncertainty quantification, their prohibitive computational scaling renders them impractical for massive sensor networks. Conversely, modern transformer architectures excel at sequence modeling but inherently lack a geometric inductive bias, treating spatial sensors as permutation-invariant tokens without a native understanding of distance. In this work, we propose a spatially-informed transformer, a hybrid architecture that injects a geostatistical inductive bias directly into the self-attention mechanism via a learnable covariance kernel. By formally decomposing the attention structure into a stationary physical prior and a non-stationary data-driven residual, we impose a soft topological constraint that favors spatially proximal interactions while retaining the capacity to model complex dynamics. We demonstrate the phenomenon of ``Deep Variography'', where the network successfully recovers the true spatial decay parameters of the underlying process end-to-end via backpropagation. Extensive experiments on synthetic Gaussian random fields and real-world traffic benchmarks confirm that our method outperforms state-of-the-art graph neural networks. Furthermore, rigorous statistical validation confirms that the proposed method delivers not only superior predictive accuracy but also well-calibrated probabilistic forecasts, effectively bridging the gap between physics-aware modeling and data-driven learning.
toXiv_bot_toot

malaria_genes: Malaria var DBLa HVR networks
Networks of recombinant antigen genes from the human malaria parasite P. falciparum. Each of the 9 networks shares the same set of vertices but has different edges, corresponding to the 9 highly variable regions (HVRs) in the DBLa domain of the var protein. Nodes are var genes, and two genes are connected if they share a substring whose length is statistically significant. Metadata includes two types of node labels, both based on sequence st…

🇺🇦 #NowPlaying on BBCRadio3's #Breakfast
Franz Schubert & Fibonacci Sequence:
🎵 Octet in F major, D 803 (3rd mvt)
#FranzSchubert #FibonacciSequence

🇺🇦 #NowPlaying on BBCRadio3's #ChristmasAroundEurope
Cecilia McDowall & Ashley Grote:
🎵 O Antiphon Sequence: 07. O Emmanuel
#CeciliaMcDowall #AshleyGrote
#Christmas)

🇺🇦 #NowPlaying on BBCRadio3's #ChristmasAroundEurope
Cecilia McDowall & Ashley Grote:
🎵 O Antiphon Sequence: 6. O Rex Gentium
#CeciliaMcDowall #AshleyGrote
#Christmas)