Tootfinder

webkb: WebKB graphs (1998)
Web graphs crawled from four Computer Science departments in 1998, with each page manually classified into one of 7 categories: course, department, faculty, project, staff, student, or other. All graphs included in a single .zip; also included are 'co-citation' graphs, which links i and j if they both point to some k. Edge weights count the number of links from i to j.
This network has 346 nodes and 26832 edges.
Tags: Informational, Web gr…

End of the Internet
Congratulations! — You have finally reached the end of the internet! There's nothing more to see, no more links to visit. You've done it all. This is the very last page on the very last server at the very far end of the internet […]
🌐 https://hmpg.net

📰 Vielen Dank für Eure #Spenden zur Unterstützung der Technikkosten, um alles am Laufen zu halten. Shoutout an alle #Steady-Förderer! 👍
Es geht los: Die vermaledeiten Amazon-Affiliate-Links werden seit Februar schrittweise gelöscht.
Hier kann man Steady-Mäzen werden:

KlimaCrew
Ich informiere über Zukunftsthemen, um Menschen vor Risiken zu warnen und Fortschritte sichtbar zu machen.

So, @… on iPad with a Magic Keyboard Case keeps putting the controls at the top of the page in the same spot as the status icons. This includes links to other content. This makes the controls difficult or impossible to click.
Picking up the iPad, and turning it 90degrees, then back again resolves this.
Anyone else noticed this issue?
#iPad #Apple

inploid: Inploid: an online social Q&A platform
Inploid is a social question & answer website in Turkish. Users can follow others and see their questions and answers on the main page. Each user is associated with a reputability score which is influenced by feedback of others about questions and answers of the user. Each user can also specify interest in topics. The data is crawled in June 2017 and consist of 39,749 nodes and 57,276 directed links between them. In addition, for …

📰 Frohe Kunde: Shoutout an alle #Steady-Förderer und Spender! 👍
Vielen Dank für Eure #Spenden zur Unterstützung der Technikkosten.
Ich habe im Februar begonnen, die vermaledeiten Amazon-Affiliate-Links schrittweise zu löschen. Das wird vermutlich das ganze Jahr dauern, aber es läuft. 😊

KlimaCrew
Ich informiere über Zukunftsthemen, um Menschen vor Risiken zu warnen und Fortschritte sichtbar zu machen.

Here's a GREAT and fascinating history Wikipedia page (431 references at the bottom).
Follow all its links. THAT will have you reading for a good while!
https://en.wikipedia.org/wiki/Timeline_of_women_in_science

Timeline of women in science - Wikipedia

Last weekend I finished a good landing page for the "tokens" that I hand out to when I go out as-a-fox. I'm within sight of running out of business cards and I'm racing to make a new generation of cards that are all unique
https://gen5.info/fox/

webkb: WebKB graphs (1998)
Web graphs crawled from four Computer Science departments in 1998, with each page manually classified into one of 7 categories: course, department, faculty, project, staff, student, or other. All graphs included in a single .zip; also included are 'co-citation' graphs, which links i and j if they both point to some k. Edge weights count the number of links from i to j.
This network has 334 nodes and 32988 edges.
Tags: Informational, Web gr…

Brand Visibility in AI cartoon - Marketoonist | Tom Fishburne https://marketoonist.com/2026/01/brand-visibility-in-ai.html

FYI: If your #Mastodon #domainverification doesn't work, check if you do have upper case letters in your URL as this won't work as of this #bug report from 2022:

Never thought about this. Use the good ol' image maps to provide alt text for possibly more complicated images https://www.w3.org/WAI/tutorials/images/imagemap/
The `href` attribute for `<area>` may be omitted too

webkb: WebKB graphs (1998)
Web graphs crawled from four Computer Science departments in 1998, with each page manually classified into one of 7 categories: course, department, faculty, project, staff, student, or other. All graphs included in a single .zip; also included are 'co-citation' graphs, which links i and j if they both point to some k. Edge weights count the number of links from i to j.
This network has 434 nodes and 30462 edges.
Tags: Informational, Web gr…

Heute habe ich übrigens #Shakshuka ausprobiert. Lecker.
Und gestern Apfelrollen. Auch lecker.
Ich werde demnächst mal meine neuen #Rezepte in meine Empfehlungsliste aufnehmen, dann könnt Ihr Euch da „durchfressen“. 😱 😆
Übrigens würde ich gern die Amazon-Affiliate-Links loswerden…

KlimaCrew
Ich informiere über Zukunftsthemen, um Menschen vor Risiken zu warnen und Fortschritte sichtbar zu machen.

On Zero-Dimensional Glicci Monomial Ideals
Benjamin Mudrak
https://arxiv.org/abs/2602.03703 https://arxiv.org/pdf/2602.03703 https://arxiv.org/html/2602.03703
arXiv:2602.03703v1 Announce Type: new
Abstract: Consider the polynomial ring $R_n = k[x_1,...,x_n]$, where $k$ is a field. Let $m = (x_1,...,x_n)$ and $I$ be an $m$-primary monomial ideal in $R$. We consider the problem of determining whether such ideals are in the Gorenstein liasion class of a complete intersection (glicci). We prove that all $m$-primary monomial ideals in $k[x,y,z]$ with at most eight generators are homogeneously glicci. We also construct a large class of $m$-primary monomial ideals in $R_n$ for any $n$ with any number of minimal generators that are homogeneously glicci but not in the complete intersection liaison class of a complete intersection (licci). All Gorenstein links used are constructed explicitly and every second step links to another $m$-primary monomial ideal.
toXiv_bot_toot

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

@… hello! i’ve been following your links feed for a while
thank you for sharing them!
my feed reader only shows the permalink to the link’s landing page on your site, not the link itself, so i took a look at the feed
i think the feed has the guid/permalink and the target link swapped, based on this fragment (spaces added to suppress link rewriti…

The joys of running #proprietaryGarbage expecting an FHS environment and whatever other shenanigans on :nixos: #NixOS...
If anyone has any idea how to get the CEWE Fotobuch software to behave on NixOS, be my guest:

Getting CEWE Fotobuch to launch
I am struggling hard to get CEWE Fotobuch (a proprietary software to layout and order printed photo albums) to run on NixOS. Yes, it’s “proprietary garbage” as Tony would put it, please no discussions whether it’s good to use it or not. 🙂 It can be downloaded from this landing page, or the tarball directly from here. Apparently, there is only this one tarball link, which always points to the latest version, there are no stable links to old versions as confirmed in this thr...

The team at @oxide.computer have company docs on how they expect LLMs to be used https://semble.so/url?id=https://rfd.shared.oxide.computer/rfd/0576
Pairs nicely (and links to) @bcantrill.bsky.social’s post on using LLMs to write for you on LinkedIn

PCIe400 generic readout board qualification test
Kevin Arnaud, Antoine Back, Daniel Charlet, Gabriel Degret, Luigi Del Buono, Paolo Durante, Amaury Hervo, Fr\'ed\'eric Hachon, Xavier Lafay, Julien Langou\"et, Renaud Le Gac, Jea-Luc Meunier, Jean-Marc Nappa, Costy Nassif Mattar, Christophe Renard, Guillaume Vouters
https://arxiv.org/abs/2602.01422 https://arxiv.org/pdf/2602.01422 https://arxiv.org/html/2602.01422
arXiv:2602.01422v1 Announce Type: new
Abstract: The PCIe400 is a generic board for high-throughput data acquisition systems in high energy physics experiments. Its purpose is to interface up to 48 bidirectional links, supporting custom protocols at 1 to 26 Gbit/s, to modern commercial back-end links providing 400 Gbit/s bandwidth. It also targets clock distribution with phase determinism below 10 ps peak-to-peak. It has been designed for LHCb LS3 enhancement upgrade with experimental features to prepare LHCb Upgrade II, foreseeing an aggregated throughput of 200 Tbit/s. However, its versatility allows it to be used in several experimental environments. The board embeds Altera's flagship Agilex 7 M-series FPGA with a PCIe Gen 5 interface and an experimental QSFP112 serial interface. We present the results of qualification tests performed on prototype boards and the challenges encountered to meet specifications. Section 1 describes board-level validation, including power-up behavior and peripheral access. Section 2 focuses on high-bandwidth interface qualification through BER measurements. Finally, Section 3 investigates phase determinism in Agilex transceivers, a key requirement for precise clock distribution.
toXiv_bot_toot

webkb: WebKB graphs (1998)
Web graphs crawled from four Computer Science departments in 1998, with each page manually classified into one of 7 categories: course, department, faculty, project, staff, student, or other. All graphs included in a single .zip; also included are 'co-citation' graphs, which links i and j if they both point to some k. Edge weights count the number of links from i to j.
This network has 300 nodes and 1155 edges.
Tags: Informational, Web gra…

inploid: Inploid: an online social Q&A platform
Inploid is a social question & answer website in Turkish. Users can follow others and see their questions and answers on the main page. Each user is associated with a reputability score which is influenced by feedback of others about questions and answers of the user. Each user can also specify interest in topics. The data is crawled in June 2017 and consist of 39,749 nodes and 57,276 directed links between them. In addition, for …

The Kontsevich invariant and the action of the Grothendieck--Teichm\"{u}ller group on $2$-component string links
Hisatoshi Kodani, Yuta Nozaki
https://arxiv.org/abs/2512.19132

📰 Hier findest Du täglich Informationen zu #Klima & #Wissenschaft auf Deutsch. Aber die Rechnungen werden u.a. noch mit Amazon-Affiliate-Links bezahlt. Die will ich gern loswerden, besser früher als später. Das geht nur mit Eurer Hilfe.
Werde Mäzen:

KlimaCrew
Ich informiere über Zukunftsthemen, um Menschen vor Risiken zu warnen und Fortschritte sichtbar zu machen.

One of the stupidest fixes I ever did (after two days of searching how to fix the problem).
The problem was Kobo Books iOS app opening links to book chapters inside popups, instead of jumping to the target page.
😞
#epub #kobo

A $5$-Approximation Analysis for the Cover Small Cuts Problem
Miles Simmons, Ishan Bansal, Joe Cheriyan
https://arxiv.org/abs/2602.01462 https://arxiv.org/pdf/2602.01462 https://arxiv.org/html/2602.01462
arXiv:2602.01462v1 Announce Type: new
Abstract: In the Cover Small Cuts problem, we are given a capacitated (undirected) graph $G=(V,E,u)$ and a threshold value $\lambda$, as well as a set of links $L$ with end-nodes in $V$ and a non-negative cost for each link $\ell\in L$; the goal is to find a minimum-cost set of links such that each non-trivial cut of capacity less than $\lambda$ is covered by a link. Bansal, Cheriyan, Grout, and Ibrahimpur (arXiv:2209.11209, Algorithmica 2024) showed that the WGMV primal-dual algorithm, due to Williamson, Goemans, Mihail, and Vazirani (Combinatorica, 1995), achieves approximation ratio $16$ for the Cover Small Cuts problem; their analysis uses the notion of a pliable family of sets that satisfies a combinatorial property. Later, Bansal (arXiv:2308.15714v2, IPCO 2025) and then Nutov (arXiv:2504.03910, MFCS 2025) proved that the same algorithm achieves approximation ratio $6$. We show that the same algorithm achieves approximation ratio $5$, by using a stronger notion, namely, a pliable family of sets that satisfies symmetry and structural submodularity.
toXiv_bot_toot

Made a userscript to show me the starred date https://greasyfork.org/en/scripts/564752-github-star-date-display

„Die neuen Lager sind nicht links und rechts, sondern Mut und Angst.“ schreibt @janskudlarek – inspiriert von Zohran Mamdanis Sieg in New York. Zukunftsfähige Politik löst Alltagsprobleme, nicht Fantasiedebatten über „Stadtbilder“. Prinzipien vertreten jenseits von Umfragewerten
#Progressiv #Gesellschaft

New York, Rio, Gelsenkirchen – Was wir von Zohran Mamdani lernen
Der Sieg von Zohran Mamdani war vielleicht kein Überraschungssieg, er fühlte sich dennoch an wie ein Rausch. Ein Rausch, der sich erst langsam legt: Auch eine Woche nach…

webkb: WebKB graphs (1998)
Web graphs crawled from four Computer Science departments in 1998, with each page manually classified into one of 7 categories: course, department, faculty, project, staff, student, or other. All graphs included in a single .zip; also included are 'co-citation' graphs, which links i and j if they both point to some k. Edge weights count the number of links from i to j.
This network has 348 nodes and 33250 edges.
Tags: Informational, Web gr…

One thing which is annoying about Vivaldi and also Firefox and presumably also all the other Android web browsers is the way the "Add To Homescreen" button works on pages like Mastodon which are Progressive Web Apps.
If you add the shortcut to the homescreen then it opens as a WPA which means the browser stuff is all gone and hidden. No back button. No way to bookmark. No way to launch a link in a new browser window etc.
Ought to be two separate buttons for "Add a link to the homepage" vs "Add this app as an app to the homepage" but there isn't.
You can get around this by turning on airplane mode and adding a link to the error page to the homescreeen, which then works as a link to the website in the browser, not a WPA app, when you're online again.
I did this to the links I use with Vivaldi before I realized it's proprietary and so will not do.
Trying to rebuild them as Firefox links again and sadly something is broken now. Won't add the error page. Tells me the pixel launcher is crashing.
So I can't have the old web bookmark links to pages in WPA apps. Boo. 😦

webkb: WebKB graphs (1998)
Web graphs crawled from four Computer Science departments in 1998, with each page manually classified into one of 7 categories: course, department, faculty, project, staff, student, or other. All graphs included in a single .zip; also included are 'co-citation' graphs, which links i and j if they both point to some k. Edge weights count the number of links from i to j.
This network has 346 nodes and 26832 edges.
Tags: Informational, Web gr…

webkb: WebKB graphs (1998)
Web graphs crawled from four Computer Science departments in 1998, with each page manually classified into one of 7 categories: course, department, faculty, project, staff, student, or other. All graphs included in a single .zip; also included are 'co-citation' graphs, which links i and j if they both point to some k. Edge weights count the number of links from i to j.
This network has 286 nodes and 1002 edges.
Tags: Informational, Web gra…

Just finished up final polish on first release of my anarchy RNG library in Lua! Have you ever wanted an incremental or reversible shuffle? I've got one for you :)
Lua REAME page w/ links: #coding #rng #random

inploid: Inploid: an online social Q&A platform
Inploid is a social question & answer website in Turkish. Users can follow others and see their questions and answers on the main page. Each user is associated with a reputability score which is influenced by feedback of others about questions and answers of the user. Each user can also specify interest in topics. The data is crawled in June 2017 and consist of 39,749 nodes and 57,276 directed links between them. In addition, for …

webkb: WebKB graphs (1998)
Web graphs crawled from four Computer Science departments in 1998, with each page manually classified into one of 7 categories: course, department, faculty, project, staff, student, or other. All graphs included in a single .zip; also included are 'co-citation' graphs, which links i and j if they both point to some k. Edge weights count the number of links from i to j.
This network has 433 nodes and 1941 edges.
Tags: Informational, Web gra…

webkb: WebKB graphs (1998)
Web graphs crawled from four Computer Science departments in 1998, with each page manually classified into one of 7 categories: course, department, faculty, project, staff, student, or other. All graphs included in a single .zip; also included are 'co-citation' graphs, which links i and j if they both point to some k. Edge weights count the number of links from i to j.
This network has 286 nodes and 1002 edges.
Tags: Informational, Web gra…

inploid: Inploid: an online social Q&A platform
Inploid is a social question & answer website in Turkish. Users can follow others and see their questions and answers on the main page. Each user is associated with a reputability score which is influenced by feedback of others about questions and answers of the user. Each user can also specify interest in topics. The data is crawled in June 2017 and consist of 39,749 nodes and 57,276 directed links between them. In addition, for …

webkb: WebKB graphs (1998)
Web graphs crawled from four Computer Science departments in 1998, with each page manually classified into one of 7 categories: course, department, faculty, project, staff, student, or other. All graphs included in a single .zip; also included are 'co-citation' graphs, which links i and j if they both point to some k. Edge weights count the number of links from i to j.
This network has 433 nodes and 1941 edges.
Tags: Informational, Web gra…

inploid: Inploid: an online social Q&A platform
Inploid is a social question & answer website in Turkish. Users can follow others and see their questions and answers on the main page. Each user is associated with a reputability score which is influenced by feedback of others about questions and answers of the user. Each user can also specify interest in topics. The data is crawled in June 2017 and consist of 39,749 nodes and 57,276 directed links between them. In addition, for …

inploid: Inploid: an online social Q&A platform
Inploid is a social question & answer website in Turkish. Users can follow others and see their questions and answers on the main page. Each user is associated with a reputability score which is influenced by feedback of others about questions and answers of the user. Each user can also specify interest in topics. The data is crawled in June 2017 and consist of 39,749 nodes and 57,276 directed links between them. In addition, for …

inploid: Inploid: an online social Q&A platform
Inploid is a social question & answer website in Turkish. Users can follow others and see their questions and answers on the main page. Each user is associated with a reputability score which is influenced by feedback of others about questions and answers of the user. Each user can also specify interest in topics. The data is crawled in June 2017 and consist of 39,749 nodes and 57,276 directed links between them. In addition, for …

inploid: Inploid: an online social Q&A platform
Inploid is a social question & answer website in Turkish. Users can follow others and see their questions and answers on the main page. Each user is associated with a reputability score which is influenced by feedback of others about questions and answers of the user. Each user can also specify interest in topics. The data is crawled in June 2017 and consist of 39,749 nodes and 57,276 directed links between them. In addition, for …