Tootfinder

faculty_hiring_us: Faculty hiring networks in the US (2022)
Networks of faculty hiring for all PhD-granting US universities over the decade 2011–2020. Each node is a PhD-granting institution, and a directed edge (i,j) indicates that a person received their PhD from node i and was tenure-track faculty at node j during time of collection (2011-2020). This dataset is divided into separate networks for all 107 fields, as well as aggregate networks for 8 domains, and an overall network for …

Freie 3D-Software Blender 4.5: visuell programmieren und effizient rendern
Das 3D-Programm Blender 4.5 ist erschienen. Es bringt Langzeitunterstützung bis 2027, verbesserte Node-Bedienung und soll effizienter rendern als der Vorgänger.

I think I really need to sleep.
This font is weird...
https://www.gnu.org/software/make/manual/html_node/Phony-Targets.html

faculty_hiring_us: Faculty hiring networks in the US (2022)
Networks of faculty hiring for all PhD-granting US universities over the decade 2011–2020. Each node is a PhD-granting institution, and a directed edge (i,j) indicates that a person received their PhD from node i and was tenure-track faculty at node j during time of collection (2011-2020). This dataset is divided into separate networks for all 107 fields, as well as aggregate networks for 8 domains, and an overall network for …

This is the #Garbce stop on railway line 271 (Poznań — Wrocław), renovated a few years ago.
The platforms end a dozen metres from the railway crossing. However, there is no walkway from the platforms to the crossing; probably because it would need to cross a tiny stream. Instead, a 100 m long walkways have been added to the other end of the platforms, with a tunnel joining the platforms and access to a side road in the town. To reach the railway crossing, you have to walk 700 m.
Ironically, even in the general drought the tunnel manages to feature puddles of ground water. Also including the photo of a platform roofing with weird orange marks.
#rail

Dynamic Layered Decoding Scheduling for LDPC Codes Aided by Check Node Error Probabilities
Chenyuan Jia, Dongxu Chang, Ruiyuan Wang, Guanghui Wang, Guiying Yan, Cunquan Qu
https://arxiv.org/abs/2506.13507

Dynamic Layered Decoding Scheduling for LDPC Codes Aided by Check Node Error Probabilities
In this study, a new scheduling strategies for low-density parity-check (LDPC) codes under layered belief propagation (LBP) is designed. Based on the criteria of prioritizing the update of check nodes with lower error probabilities, we propose two dynamic scheduling methods: dynamic error belief propagation (Dyn-EBP) and dynamic penalty error belief propagation (Dyn-PEBP). In Dyn-EBP, each check node is restricted from being updated the same number of times, whereas Dyn-PEBP removes this restri…

Multi-Layer Perceptron-Based Relay Node Selection for Next-Generation Intelligent Delay-Tolerant Networks
Zhekun Huang, Milena Radenkovic
https://arxiv.org/abs/2509.11239 https:…

Multi-Layer Perceptron-Based Relay Node Selection for Next-Generation Intelligent Delay-Tolerant Networks
Delay Tolerant Networks (DTNs) are critical for emergency communication in highly dynamic and challenging scenarios characterized by intermittent connectivity, frequent disruptions, and unpredictable node mobility. While some protocols are widely adopted for simplicity and low overhead, their static replication strategy lacks the ability to adaptively distinguish high-quality relay nodes, often leading to inefficient and suboptimal message dissemination. To address this challenge, we propose a …

Draw a Portrait of Your Graph Data: An Instance-Level Profiling Framework for Graph-Structured Data
Tianqi Zhao, Russa Biswas, Megha Khosla
https://arxiv.org/abs/2509.12094 http…

Draw a Portrait of Your Graph Data: An Instance-Level Profiling Framework for Graph-Structured Data
Graph machine learning models often achieve similar overall performance yet behave differently at the node level, failing on different subsets of nodes with varying reliability. Standard evaluation metrics such as accuracy obscure these fine grained differences, making it difficult to diagnose when and where models fail. We introduce NodePro, a node profiling framework that enables fine-grained diagnosis of model behavior by assigning interpretable profile scores to individual nodes. These scor…

Effective Stimulus Propagation in Neural Circuits: Driver Node Selection
Bulat Batuev, Arsenii Onuchin, Sergey Sukhov
https://arxiv.org/abs/2506.13615 http…

Effective Stimulus Propagation in Neural Circuits: Driver Node Selection
Precise control of signal propagation in modular neural networks represents a fundamental challenge in computational neuroscience. We establish a framework for identifying optimal control nodes that maximize stimulus transmission between weakly coupled neural populations. Using spiking stochastic block model networks, we systematically compare driver node selection strategies - including random sampling and topology-based centrality measures (degree, betweenness, closeness, eigenvector, harmoni…

We walked 2km in the forest, uphill with a ladder and some tools in order to install this Seeed Solar Node on a dead tree.
I have a good signal from home - 12km throu forest and the coverage seems to be good too.
I'll let it be here over the winter month :)
#meshtastic #lora

FAFO: Over 1 million TPS on a single node running EVM while still Merkleizing every block
Ryan Zarick, Isaac Zhang, Daniel Wong, Thomas Kim, Bryan Pellegrino, Mignon Li, Kelvin Wong
https://arxiv.org/abs/2507.10757

FAFO: Over 1 million TPS on a single node running EVM while still Merkleizing every block
Current blockchain execution throughput is limited by data contention, reducing execution layer parallelism. Fast Ahead-of-Formation Optimization (FAFO) is the first blockchain transaction scheduler to address this problem by reordering transactions before block formation for maximum concurrency. FAFO uses CPU-optimized cache-friendly Bloom filters to efficiently detect conflicts and schedule parallel transaction execution at high throughput and low overhead. We integrate the Rust EVM client …

Distinguishing features of longitudinal magnetoconductivity for a Rarita-Schwinger-Weyl node
Ipsita Mandal
https://arxiv.org/abs/2506.12380 https://…

Distinguishing features of longitudinal magnetoconductivity for a Rarita-Schwinger-Weyl node
The band-degeneracy points in the Brillouin zones of chiral crystals exist in multiple avatars, with the high-symmetry points being able to host multifold nodes of distinct characters. A class of such crystals, assisted by the spin-orbit coupling, harbours fourfold degeneracy in the form of Rarita-Schwinger-Weyl node (RSWN) at the $Γ$-point. Our aim is to explore the nature of longitudinal magnetoconductivity, arising from applying collinear electric and magnetic fields, for such systems. Adju…

Rich Vehicle Routing Problem with diverse Vertices allowing Hierarchical and Multimodal Time-Dependant Transhipment of multiple Node- Vehicle- compatible Cargo with Cascaded Time-Minimization Objective for Emergency Decision Support Systems
Santanu Banerjee, Goutam Sen, Siddhartha Mukhopadhyay
https://arxiv.org/abs/2509.13227

Rich Vehicle Routing Problem with diverse Vertices allowing Hierarchical and Multimodal Time-Dependant Transhipment of multiple Node- Vehicle- compatible Cargo with Cascaded Time-Minimization Objective for Emergency Decision Support Systems
A rich vehicle routing problem is considered allowing multiple trips of heterogeneous vehicles stationed at distributed vehicle depots spread across diverse geographies having access to different modes of transportation. The problem arises from the real world requirement of optimizing the disaster response/preparedness time and minimizes the route duration of the vehicles to achieve the solution with the minimum highest-vehicle-route-duration. Multiple diversely-functional vertices are consider…

from my link log —
Behind the scenes of Bun npm package install.
https://bun.com/blog/behind-the-scenes-of-bun-install
saved 2025-09-11

Behind The Scenes of Bun Install
Learn how Bun is able to cut install times by up to 25×. Bun skips Node.js's overhead with direct system calls, cache-friendly data layouts, OS-level copy-on-write, and full-core parallelism.

Agglomeration based influential node ranking in path-type networks
Zeynep Nihan Berberler, Aysun Asena Kunt
https://arxiv.org/abs/2509.11659 https://arxiv.…

Agglomeration based influential node ranking in path-type networks
Identification of vital nodes contributes to the research of network robustness and vulnerability. The most influential nodes are effective in maximizing the speed and accelerating the information propagation in complex networks. Identifying and ranking the most influential nodes in complex networks has not only theoretical but also practical significance in network analysis since these nodes have a critical influence on the structure and function of complex networks. This paper is devoted to t…

Approximations for Fault-Tolerant Total and Partial Positive Influence Domination
Ioannis Lamprou, Ioannis Sigalas, Ioannis Vaxevanakis, Vassilis Zissimopoulos
https://arxiv.org/abs/2506.12828

Approximations for Fault-Tolerant Total and Partial Positive Influence Domination
In $\textit{total domination}$, given a graph $G=(V,E)$, we seek a minimum-size set of nodes $S\subseteq V$, such that every node in $V$ has at least one neighbor in $S$. We define a $\textit{fault-tolerant}$ version of total domination, where we require any node in $V \setminus S$ to have at least $m$ neighbors in $S$. Let $Δ$ denote the maximum degree in $G$. We prove a first $1 + \ln(Δ+ m - 1)$ approximation for fault-tolerant total domination. We also consider fault-tolerant variants of t…

🥳 New Kitten Release
Housekeeping:
• Updated runtime version to Node version 22.18.0 (latest LTS).
• Removed `--experimental-global-customevent` in node launch command (as `CustomEvent` is no longer behing the CLI flag since Node v19.0.0)
• Renamed `--experimental-loader` flag to `--loader` as the experimental prefix is no longer required.
…

Collaborative Beamforming for Communication Applications Using a Two-Element Fully-Wireless Open-Loop Coherent Distributed Array
Jason M. Merlo, Jeffrey A. Nanzer
https://arxiv.org/abs/2506.13014

Collaborative Beamforming for Communication Applications Using a Two-Element Fully-Wireless Open-Loop Coherent Distributed Array
In this work we demonstrate a proof of concept of a fully-wireless two-node open-loop coherent distributed communication system and evaluate its performance by transmitting QPSK , 64-, and 256-QAM constellations at a symbol rate of 2 MBd over a 58 m link in an urban environment. The system is implemented in a distributed manner with on-node processing using software-defined radios (SDRs) and wireless internode communication to share coordination information and does not rely on external time or…

Optimal Honeypot Ratio and Convergent Fictitious-Play Learning in Signaling Games for CPS Defense
Yueyue Xu, Yuewei Chen, Lin Wang, Zhaoyang Cheng, Xiaoming Hu
https://arxiv.org/abs/2507.11113

Optimal Honeypot Ratio and Convergent Fictitious-Play Learning in Signaling Games for CPS Defense
Cyber-Physical Systems (CPSs) are facing a fast-growing wave of attacks. To achieve effective proactive defense, this paper models honeypot deployment as a gamma-fixed signaling game in which node liveness serves as the only signal and normal-node signal gamma is exogenously fixed. We define the gamma-perfect Bayesian-Nash equilibrium (gamma-PBNE). Analytical expressions are obtained for all gamma-PBNEs, revealing three distinct equilibrium regimes that depend on the priori honeypot ratio. Furt…

There are two #LEGO sets with indicator lights showing which node is currently on, one is right above them, and one will be raised above the cat bed entrance. Because this #cat loves his little bed hidden in a corner:

advogato: Advogato trust network (2009)
A network of trust relationships among users on Advogato, an online community of open source software developers. Edge direction indicates that node i trusts node j, and edge weight denotes one of four increasing levels of declared trust from i to j: observer (0.4), apprentice (0.6), journeyer (0.8), and master (1.0).
This network has 6541 nodes and 51127 edges.
Tags: Social, Online, Weighted

Oto przystanek osobowy #Garbce na linii kolejowej 271 (Poznań — Wrocław), wyremontowana parę lat temu.
Jak widać, perony kończą się kilkanaście metrów przed przejazdem kolejowym. Jednak zdecydowano, by nie prowadzić chodnika do tego przejazdu — najpewniej ze względu na ten tyci strumyk. Zamiast tego, na drugim końcu peronu poprowadzono stumetrowy chodnik, który prowadzi do tunelu łączącego peron…

email_enron: Email network (Enron corpus)
The Enron email corpus, containing all the email communication from the Enron corporation, which was made public as a result of legal action. Nodes are email addresses and node i links to node j if i sent at least one email to address j. Non-Enron email addresses are also present, but only their links to/from Enron addresses are observed.
This network has 36692 nodes and 367662 edges.
Tags: Social, Communication, Unweighted, Multigr…

Quantum Graph Attention Networks: Trainable Quantum Encoders for Inductive Graph Learning
Arthur M. Faria, Mehdi Djellabi, Igor O. Sokolov, Savvas Varsamopoulos
https://arxiv.org/abs/2509.11390

Quantum Graph Attention Networks: Trainable Quantum Encoders for Inductive Graph Learning
We introduce Quantum Graph Attention Networks (QGATs) as trainable quantum encoders for inductive learning on graphs, extending the Quantum Graph Neural Networks (QGNN) framework. QGATs leverage parameterized quantum circuits to encode node features and neighborhood structures, with quantum attention mechanisms modulating the contribution of each neighbor via dynamically learned unitaries. This allows for expressive, locality-aware quantum representations that can generalize across unseen graph…

Learning Contact Dynamics for Control with Action-conditioned Face Interaction Graph Networks
Zongyao Yi, Joachim Hertzberg, Martin Atzmueller
https://arxiv.org/abs/2509.12151 h…

Learning Contact Dynamics for Control with Action-conditioned Face Interaction Graph Networks
We present a learnable physics simulator that provides accurate motion and force-torque prediction of robot end effectors in contact-rich manipulation. The proposed model extends the state-of-the-art GNN-based simulator (FIGNet) with novel node and edge types, enabling action-conditional predictions for control and state estimation tasks. In simulation, the MPC agent using our model matches the performance of the same controller with the ground truth dynamics model in a challenging peg-in-hole …

Crypto-Assisted Graph Degree Sequence Release under Local Differential Privacy
Xiaojian Zhang, Junqing Wang, Kerui Chen, Peiyuan Zhao, Huiyuan Bai
https://arxiv.org/abs/2507.10627

Crypto-Assisted Graph Degree Sequence Release under Local Differential Privacy
Given a graph $G$ defined in a domain $\mathcal{G}$, we investigate locally differentially private mechanisms to release a degree sequence on $\mathcal{G}$ that accurately approximates the actual degree distribution. Existing solutions for this problem mostly use graph projection techniques based on edge deletion process, using a threshold parameter $θ$ to bound node degrees. However, this approach presents a fundamental trade-off in threshold parameter selection. While large $θ$ values intro…

Contrastive Network Representation Learning
Zihan Dong, Xin Zhou, Ryumei Nakada, Lexin Li, Linjun Zhang
https://arxiv.org/abs/2509.11316 https://arxiv.org/…

Contrastive Network Representation Learning
Network representation learning seeks to embed networks into a low-dimensional space while preserving the structural and semantic properties, thereby facilitating downstream tasks such as classification, trait prediction, edge identification, and community detection. Motivated by challenges in brain connectivity data analysis that is characterized by subject-specific, high-dimensional, and sparse networks that lack node or edge covariates, we propose a novel contrastive learning-based statistic…

Towards Energy-Efficient Distributed Agreement
Hugo Mirault, Peter Robinson
https://arxiv.org/abs/2506.12282 https://arxiv.org/pdf/25…

Towards Energy-Efficient Distributed Agreement
We study fault-tolerant consensus in a variant of the synchronous message passing model, where, in each round, every node can choose to be awake or asleep. This is known as the sleeping model (Chatterjee, Gmyr, Pandurangan PODC 2020) and defines the awake complexity (also called \emph{energy complexity}), which measures the maximum number of rounds that any node is awake throughout the execution. Only awake nodes can send and receive messages in a given round and all messages sent to sleeping n…

@… great post! I might also give a shout to https://node-modules.dev/ from @…

CRAFT: Latency and Cost-Aware Genetic-Based Framework for Node Placement in Edge-Fog Environments
Soheil Mahdizadeh, Amir Mahdi Rasouli, Mohammad Pourashory, Sadra Galavani, Mohsen Ansari
https://arxiv.org/abs/2507.12445

CRAFT: Latency and Cost-Aware Genetic-Based Framework for Node Placement in Edge-Fog Environments
Reducing latency in the Internet of Things (IoT) is a critical concern. While cloud computing facilitates communication, it falls short of meeting real-time requirements reliably. Edge and fog computing have emerged as viable solutions by positioning computing nodes closer to end users, offering lower latency and increased processing power. An edge-fog framework comprises various components, including edge and fog nodes, whose strategic placement is crucial as it directly impacts latency and sy…

Saddle-node bifurcation during the relaminarization of turbulent puffs in pipe
Basheer Ahmad Khan, Shai Arogeti, Oriel Shoshani, Alexander Yakhot
https://arxiv.org/abs/2508.08862

Saddle-node bifurcation during the relaminarization of turbulent puffs in pipe
Turbulent puffs in a pipe persist for a long time before abruptly transitioning to laminar flow through viscous exponential decay. Direct numerical simulation results reveal a saddle-node bifurcation sequence governing the final relaminarization stage. Specifically, a universal square-root scaling law in the annihilation of critical points that is indicative of a saddle-node bifurcation. The Riccati equation has been proposed as a straightforward approach to modeling these bifurcations.

New allocation rule based on graph structures and their application to economic phenomena
Taiki Yamada, Taisuke Matsubae, Tomoya Akamatsu
https://arxiv.org/abs/2507.11808

New allocation rule based on graph structures and their application to economic phenomena
This study introduces the \emph{edge-based Shapley value}, a novel allocation rule within cooperative game theory, specifically tailored for networked systems, where value is generated through interactions represented by edges. Traditional allocation rules, such as the Shapley and Myerson values, evaluate player contributions based on node-level characteristics, or connected components. However, these approaches often fail to adequately capture the functional role of edges, which are crucial in…

Wie muss man eigentlich bei #OSM Drängelgitter/Umlaufsperren taggen, die so eng sind, dass sie mit Lastenrad nicht passierbar sind bzw. wo man das Rad drüber tragen muss?
Ich frage für https://www.openstreetmap.org/node/3860400

Node: 386040073
OpenStreetMap is a map of the world, created by people like you and free to use under an open license.

To buy or not to buy: deterministic rent-or-buy problems on node-weighted graphs
Sander Borst, Moritz Venzin
https://arxiv.org/abs/2507.08698 https://

To buy or not to buy: deterministic rent-or-buy problems on node-weighted graphs
We study the rent-or-buy variant of the online Steiner forest problem on node- and edge-weighted graphs. For $n$-node graphs with at most $\bar{n}$ non-zero node-weights, and at most $\tilde{k}$ different arriving terminal pairs, we obtain a deterministic, $O(\log n \log \bar{n})$-competitive algorithm. This improves on the previous best, $O(\log^4 n)$-competitive algorithm obtained by the black-box reduction from (Bartal et al. 2021) combined with the previously best deterministic algorithms f…

Scala.js
#scala

A Pressure-Based Diffusion Model for Influence Maximization on Social Networks
Curt Stutsman, Eliot W. Robson, Abhishek K. Umrawal
https://arxiv.org/abs/2509.12822 https://

A Pressure-Based Diffusion Model for Influence Maximization on Social Networks
In many real-world scenarios, an individual's local social network carries significant influence over the opinions they form and subsequently propagate to others. In this paper, we propose a novel diffusion model -- the Pressure Threshold model (PT) -- for dynamically simulating the spread of influence through a social network. This new model extends the popular Linear Threshold Model (LT) by adjusting a node's outgoing influence proportional to the influence it receives from its activated neig…

Enhancing Fairness in Autoencoders for Node-Level Graph Anomaly Detection
Shouju Wang, Yuchen Song, Sheng'en Li, Dongmian Zou
https://arxiv.org/abs/2508.10785 https://

Enhancing Fairness in Autoencoders for Node-Level Graph Anomaly Detection
Graph anomaly detection (GAD) has become an increasingly important task across various domains. With the rapid development of graph neural networks (GNNs), GAD methods have achieved significant performance improvements. However, fairness considerations in GAD remain largely underexplored. Indeed, GNN-based GAD models can inherit and amplify biases present in training data, potentially leading to unfair outcomes. While existing efforts have focused on developing fair GNNs, most approaches target…

A Novel Thermal Network Model and Electro-Thermal Coupling Study for NSFETs and CFETs Considering Thermal Crosstalk
Tianci Miao, Qihang Zheng, Yangyang Hu, Xiaoyu Cheng, Jie Liang, Liang Chen, Aiying Guo, Jingjing Liu, Kailin Ren, Jianhua Zhang
https://arxiv.org/abs/2506.12264

A Novel Thermal Network Model and Electro-Thermal Coupling Study for NSFETs and CFETs Considering Thermal Crosstalk
As the technology node continues to shrink, nanosheet field effect transistors (NSFETs) and complementary FETs (CFETs) become valid candidates for the 3nm and sub-nanometre nodes. However, due to the shrinking device size, self-heating and inter-device thermal crosstalk of NSFETs and CFETs become more severe. It is important to accurately calculate the self-heating and thermal crosstalk of devices and to study the electrical and thermal characteristics of logic gates, etc. In this work, a therm…

Distributed Algorithms for Potential Problems
Alkida Balliu, Thomas Boudier, Francesco d'Amore, Dennis Olivetti, Gustav Schmid, Jukka Suomela
https://arxiv.org/abs/2507.12038 …

Distributed Algorithms for Potential Problems
In this work we present a fast distributed algorithm for local potential problems: these are graph problems where the task is to find a locally optimal solution where no node can unilaterally improve the utility in its local neighborhood by changing its own label. A simple example of such a problem is the task of finding a locally optimal cut, i.e., a cut where for each node at least half of its incident edges are cut edges. The distributed round complexity of locally optimal cut has been wide …

Developing and evaluating quilts for the depiction of large layered graphs
Juhee Bae, Benjamin Watson
https://arxiv.org/abs/2507.10883 https://

Developing and evaluating quilts for the depiction of large layered graphs
Traditional layered graph depictions such as flow charts are in wide use. Yet as graphs grow more complex, these depictions can become difficult to understand. Quilts are matrix-based depictions for layered graphs designed to address this problem. In this research, we first improve Quilts by developing three design alternatives, and then compare the best of these alternatives to better-known node-link and matrix depictions. A primary weakness in Quilts is their depiction of skip links, links th…

"Flora für Alle" – autoritäre Kontinuitäten gegen feministische und emanzipatorische Politik
#FloraBleibt

Scaling Up without Fading Out: Goal-Aware Sparse GNN for RL-based Generalized Planning
Sangwoo Jeon, Juchul Shin, Gyeong-Tae Kim, YeonJe Cho, Seongwoo Kim
https://arxiv.org/abs/2508.10747

Scaling Up without Fading Out: Goal-Aware Sparse GNN for RL-based Generalized Planning
Generalized planning using deep reinforcement learning (RL) combined with graph neural networks (GNNs) has shown promising results in various symbolic planning domains described by PDDL. However, existing approaches typically represent planning states as fully connected graphs, leading to a combinatorial explosion in edge information and substantial sparsity as problem scales grow, especially evident in large grid-based environments. This dense representation results in diluted node-level infor…

PromQL. I'm trying to aggregate two rates. By itself this works:
rate(node_network_receive_bytes_total{instance="$instance",device="eth0"}[1m])*8
The equivalent for eth1 by itself also works and reports 0 b/s because eth1 has never been up.

A review of perfect quantum state transfer, from one to two and three dimensional arrays of qubits
Marzieh Asoudeh, Vahid Karimipour
https://arxiv.org/abs/2507.11016

A review of perfect quantum state transfer, from one to two and three dimensional arrays of qubits
In the light of recent advances in fabricating single layer quantum chips and a possible road toward development of multi-layer quantum chips, we review, in a detailed way, the subject of quantum state transfer with particular emphasis on perfect quantum state transfer in two and three dimensional lattices. We show how one can route an unknown quantum state from one node in a single layer of a quantum chip to another one on another layer with unit fidelity. Our method of presentation in this …

swingers: Swingers and parties (2013)
A bipartite sexual affiliation network representing “swing unit” couples (one node per couple) and the parties they attended.
This network has 96 nodes and 232 edges.
Tags: Social, Offline, Unweighted
https://networks.skewed.de/net/swingers

Uniquely-Decodable Coding for Zero-Error Network Function Computation
Xuan Guang, Jihang Yang, Ruze Zhang
https://arxiv.org/abs/2509.10775 https://arxiv.or…

Uniquely-Decodable Coding for Zero-Error Network Function Computation
We consider uniquely-decodable coding for zero-error network function computation, where in a directed acyclic graph, the single sink node is required to compute with zero error a target function multiple times, whose arguments are the information sources generated at a set of source nodes. We are interested in the computing capacity from the information theoretic point of view, which is defined as the infimum of the maximum expected number of bits transmitted on all the edges for computing the…

from my link log —
The evolution of logical replication in PostgreSQL: a historical overview.
https://www.enterprisedb.com/blog/evolution-logical-replication-postgresql-firsthand-account
saved 2025-09-12

The Evolution of Logical Replication in PostgreSQL: A Firsthand Account
PostgreSQL has come a long way from its early days as a single-node database. If you’ve worked with PostgreSQL for a while, you’ll know its journey to robust logical replication was anything but straightforward, shaped by community efforts, creative workarounds, and an ever-evolving need for high availability and flexibility. Having been closely involved in projects like londiste, pglogical, multiple iterations of PGD (BDR) and the built-in logical replication in PostgreSQL itself, I’ve h…

Performance Analysis of Communication Signals for Localization in Underwater Sensor Networks
Ashwani Koul, Gustaf Hendeby, Isaac Skog
https://arxiv.org/abs/2506.13330

Performance Analysis of Communication Signals for Localization in Underwater Sensor Networks
Fusion of passive and active measurements from sensor nodes becomes critical in localizing underwater objects and is traditionally achieved by communicating information to a central node. This causes significant inefficiencies in bandwidth, energy, and processing time, which are critical in marine applications. With integrated sensing and communication (ISAC) systems, the process of sensing, localization, and communication can be achieved jointly, and the inefficiencies can be minimized. Thus, …

Can LLMs Find Fraudsters? Multi-level LLM Enhanced Graph Fraud Detection
Tairan Huang, Yili Wang
https://arxiv.org/abs/2507.11997 https://

Can LLMs Find Fraudsters? Multi-level LLM Enhanced Graph Fraud Detection
Graph fraud detection has garnered significant attention as Graph Neural Networks (GNNs) have proven effective in modeling complex relationships within multimodal data. However, existing graph fraud detection methods typically use preprocessed node embeddings and predefined graph structures to reveal fraudsters, which ignore the rich semantic cues contained in raw textual information. Although Large Language Models (LLMs) exhibit powerful capabilities in processing textual information, it remai…

Voltage Stability of Inverter-Based Systems: Impact of Parameters and Irrelevance of Line Dynamics
Sushobhan Chatterjee, Sijia Geng
https://arxiv.org/abs/2506.13341

Voltage Stability of Inverter-Based Systems: Impact of Parameters and Irrelevance of Line Dynamics
This paper investigates voltage stability in inverter-based power systems concerning fold and saddle-node bifurcations. An analytical expression is derived for the sensitivity of the stability margin using the normal vector to the bifurcation hypersurface. Such information enables efficient identification of effective control parameters in mitigating voltage instability. Comprehensive analysis reveals that reactive loading setpoint and current controller's feedforward gain are the most influent…

bible_nouns: Bible noun phrases
A network of noun phrases (places and names) in the King James Version of the Bible. Each node is a noun phrase, and an edge exists if the noun phrases co-occur in a Bible verse. Edge weight denotes how often the two words co-occur.
This network has 1773 nodes and 9131 edges.
Tags: Informational, Language, Weighted

Versatile Wavelength-Division Multiplexed Quantum Key Distribution Network Operating Simultaneously in the O and C Bands
Davide Scalcon, Matteo Padovan, Paolo Villoresi, Giuseppe Vallone, Marco Avesani
https://arxiv.org/abs/2507.11175

Versatile Wavelength-Division Multiplexed Quantum Key Distribution Network Operating Simultaneously in the O and C Bands
Ongoing technological progress is accelerating the commercial and global-scale deployment of Quantum Key Distribution (QKD). Its ability to enable unconditionally secure communication is expected to be a key feature of future telecommunication networks, and practical demonstrations of QKD network implementations in real-world environments are crucial for ensuring reliable adoption. In this work, we demonstrate a four-node photonic QKD network that employs versatile and cost-effective wavelength…

swingers: Swingers and parties (2013)
A bipartite sexual affiliation network representing “swing unit” couples (one node per couple) and the parties they attended.
This network has 96 nodes and 232 edges.
Tags: Social, Offline, Unweighted
https://networks.skewed.de/net/swingers

On the error correction of iterative bounded distance decoding of generalized LDPC codes
David Burshtein
https://arxiv.org/abs/2507.12073 https://

On the error correction of iterative bounded distance decoding of generalized LDPC codes
Consider an ensemble of regular generalized LDPC (GLDPC) codes and assume that the same component code is associated with each parity check node. To decode a GLDPC code from the ensemble, we use the bit flipping bounded distance decoding algorithm, which is an extension of the bit flipping algorithm for LDPC codes. Previous work has shown conditions, under which, for a typical code in the ensemble with blocklength sufficiently large, a positive constant fraction of worst case errors can be corr…

Heat Kernel Goes Topological
Maximilian Krahn, Vikas Garg
https://arxiv.org/abs/2507.12380 https://arxiv.org/pdf/2507.12380

Heat Kernel Goes Topological
Topological neural networks have emerged as powerful successors of graph neural networks. However, they typically involve higher-order message passing, which incurs significant computational expense. We circumvent this issue with a novel topological framework that introduces a Laplacian operator on combinatorial complexes (CCs), enabling efficient computation of heat kernels that serve as node descriptors. Our approach captures multiscale information and enables permutation-equivariant represen…

contiguous_usa: Contiguous states (USA)
A network of contiguous states in the USA, in which each state is a node and two nodes are connected if they share a land-based geographic border. The dataset includes the lower 48 states, and the District of Columbia.
This network has 49 nodes and 107 edges.
Tags: Transportation, Roads, Unweighted

Deterministic Lower Bounds for $k$-Edge Connectivity in the Distributed Sketching Model
Peter Robinson, Ming Ming Tan
https://arxiv.org/abs/2507.11257 http…

Deterministic Lower Bounds for $k$-Edge Connectivity in the Distributed Sketching Model
We study the $k$-edge connectivity problem on undirected graphs in the distributed sketching model, where we have $n$ nodes and a referee. Each node sends a single message to the referee based on its 1-hop neighborhood in the graph, and the referee must decide whether the graph is $k$-edge connected by taking into account the received messages. We present the first lower bound for deciding a graph connectivity problem in this model with a deterministic algorithm. Concretely, we show that the …

Testing for correlation between network structure and high-dimensional node covariates
Alexander Fuchs-Kreiss, Keith Levin
https://arxiv.org/abs/2509.03772 https://

Testing for correlation between network structure and high-dimensional node covariates
In many application domains, networks are observed with node-level features. In such settings, a common problem is to assess whether or not nodal covariates are correlated with the network structure itself. Here, we present four novel methods for addressing this problem. Two of these are based on a linear model relating node-level covariates to latent node-level variables that drive network structure. The other two are based on applying canonical correlation analysis to the node features and ne…

NetMoniAI: An Agentic AI Framework for Network Security & Monitoring
Pallavi Zambare, Venkata Nikhil Thanikella, Nikhil Padmanabh Kottur, Sree Akhil Akula, Ying Liu
https://arxiv.org/abs/2508.10052

NetMoniAI: An Agentic AI Framework for Network Security & Monitoring
In this paper, we present NetMoniAI, an agentic AI framework for automatic network monitoring and security that integrates decentralized analysis with lightweight centralized coordination. The framework consists of two layers: autonomous micro-agents at each node perform local traffic analysis and anomaly detection. A central controller then aggregates insights across nodes to detect coordinated attacks and maintain system-wide situational awareness. We evaluated NetMoniAI on a local micro-test…

Optimized Sparse Network Coverage via L1-norm Minimization
Souvik Paul, Iv\'an Alexander Morales Sandoval, Giuseppe Thadeu Freitas de Abreu
https://arxiv.org/abs/2509.11994 …

Optimized Sparse Network Coverage via L1-norm Minimization
The selection of nodes that can serve as cluster heads, local sinks and gateways is a critical challenge in distributed sensor and communication networks. This paper presents a novel framework for identifying a minimal set of nexus nodes to ensure full network coverage while minimizing cost. By formulating the problem as a convex relaxation of the NP-hard set cover problem, we integrate the graph theoretic centrality measures of node degree and betweenness centrality into a cost function optimi…

moviegalaxies: Moviegalaxies, movies 410-466 (2018)
Social graphs for over 700 movies from the moviegalaxies.com website. Each node represents a character in a movie and each edge is a same-scene appearance between two characters in that movie. The weight gives the number of same-scene appearances. Networks are extracted from movie scripts automatically.
This network has 33 nodes and 61 edges.
Tags: Social, Fictional, Weighted

Delay-optimal Congestion-aware Routing and Computation Offloading in Arbitrary Network
Jinkun Zhang, Yuezhou Liu, Edmund Yeh
https://arxiv.org/abs/2506.13626

Delay-optimal Congestion-aware Routing and Computation Offloading in Arbitrary Network
Emerging edge computing paradigms enable heterogeneous devices to collaborate on complex computation applications. However, for arbitrary heterogeneous edge networks, delay-optimal forwarding and computation offloading remains an open problem. In this paper, we jointly optimize data/result routing and computation placement in arbitrary networks with heterogeneous node capabilities, and congestion-dependent nonlinear transmission and processing delay. Despite the non-convexity of the formulated …

bible_nouns: Bible noun phrases
A network of noun phrases (places and names) in the King James Version of the Bible. Each node is a noun phrase, and an edge exists if the noun phrases co-occur in a Bible verse. Edge weight denotes how often the two words co-occur.
This network has 1773 nodes and 9131 edges.
Tags: Informational, Language, Weighted

LASLiN: A Learning-Augmented Peer-to-Peer Network
Julien Dallot, Caio Caldeira, Arash Pourdamghani, Olga Goussevskaia, Stefan Schmid
https://arxiv.org/abs/2509.11904 https://

LASLiN: A Learning-Augmented Peer-to-Peer Network
We introduce a learning-augmented peer-to-peer (P2P) network design that leverages the predictions of traffic patterns to optimize the network's topology. While keeping formal guarantees on the standard P2P metrics (routing path length, maximum degree), we optimize the network in a demand-aware manner and minimize the path lengths weighted by the peer-to-peer communication demands. Our protocol is learning-augmented, meaning that each node receives an individual, possibly inaccurate prediction …

foodweb_baywet: Florida cypress wetlands food web (1998)
Networks of carbon exchanges among species in the cypress wetlands of South Florida. One network covers the wet and the other the dry season. Each node represents a taxon (similar to a species), and a directed edge indicates that one taxon uses another as food.
This network has 128 nodes and 2106 edges.
Tags: Biological, Food web, Weighted

word_assoc: Edinburgh word associations
A network of word associations showing the count of such associations as collected from subjects, from the Edinburgh Associative Thesaurus (EAT). Each node represents a word, and a directed edge (i, j) denotes that word i was used as a stimulus to which word j was given as a response. Multiple edges are allowed.
This network has 23132 nodes and 312342 edges.
Tags: Informational, Language, Unweighted, Multigraph

foodweb_baywet: Florida cypress wetlands food web (1998)
Networks of carbon exchanges among species in the cypress wetlands of South Florida. One network covers the wet and the other the dry season. Each node represents a taxon (similar to a species), and a directed edge indicates that one taxon uses another as food.
This network has 128 nodes and 2106 edges.
Tags: Biological, Food web, Weighted

faculty_hiring_us: Faculty hiring networks in the US (2022)
Networks of faculty hiring for all PhD-granting US universities over the decade 2011–2020. Each node is a PhD-granting institution, and a directed edge (i,j) indicates that a person received their PhD from node i and was tenure-track faculty at node j during time of collection (2011-2020). This dataset is divided into separate networks for all 107 fields, as well as aggregate networks for 8 domains, and an overall network for …

fly_larva: Drosophila larva brain (2023)
A complete synaptic map of the brain connectome of the larva of the fruit fly Drosophila melanogaster. Nodes are neurons, and edges are synaptic connections, traced individually from brain image sections using three-dimensional electron microscopy–based reconstruction. Node metadata include the neuron hempisphere, hemispherical homologue, cell type, annotations, and inferred cluster. Edge metadata include the type of interaction (`'aa'`,…

Graph Unlearning: Efficient Node Removal in Graph Neural Networks
Faqian Guan, Tianqing Zhu, Zhoutian Wang, Wei Ren, Wanlei Zhou
https://arxiv.org/abs/2509.04785 https://…

Graph Unlearning: Efficient Node Removal in Graph Neural Networks
With increasing concerns about privacy attacks and potential sensitive information leakage, researchers have actively explored methods to efficiently remove sensitive training data and reduce privacy risks in graph neural network (GNN) models. Node unlearning has emerged as a promising technique for protecting the privacy of sensitive nodes by efficiently removing specific training node information from GNN models. However, existing node unlearning methods either impose restrictions on the GNN …

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…

faculty_hiring: Faculty hiring networks (Comp. Sci., Business, History)
Three networks of faculty hiring in Computer Science Departments, Business Schools, and History Departments. Each node is a PhD-granting institution in the respective field, and a directed edge (i,j) indicates that a person received their PhD from node i and was tenure-track faculty at node j during time of collection (2011-2013). All data collected from faculty public rosters at the sampled institutions.
Thi…

soc_net_comms: Networks with group metadata
Snapshots of LiveJournal, Friendster, Orkut, and YouTube online social networks, as well as DBLP and Amazon. Node metadata represents a post hoc definition of a 'community' that a node belongs to, derived from topical labels of the node or interest-based 'groups' that a node links to.
This network has 334863 nodes and 925872 edges.
Tags: Online, Social, Collaboration, Informational, Relatedness, Unweighted, Metadat…

digg_reply: Digg reply network (2008)
Network of replies among users of digg.com. Each node in the network is a digg user, and each directed edge indicates that user i replied to user j.
This network has 30398 nodes and 87627 edges.
Tags: Social, Online, Unweighted, Multigraph
https://networks.skewed.de/net/di…

yahoo_ads: Yahoo! advertisement words
A network of words extracted from phrases on which advertisers bid, in Yahoo! advertisements. A node is a word and a directed edge (i, j) denotes word i comes after the word j.
This network has 653260 nodes and 2931708 edges.
Tags: Informational, Language, Unweighted
https://

ego_social: Ego networks in social media (2012)
Ego networks associated with a set of accounts of three social media platforms (Facebook, Google , and Twitter). Datasets include node features (profile metadata), circles, and ego networks, and were crawled from public sources in 2012.
This network has 851 nodes and 29357 edges.
Tags: Social, Online, Unweighted, Metadata

7th_graders: Vickers 7th Graders (1981)
A small multiplex network of friendships among 29 seventh grade students in Victoria, Australia. Students nominated classmates for three different activities (who do you get on with in the class, who are your best friends, and who would you prefer to work with). Edge direction for each of these three types of edges indicates if node i nominated node j, and the edge weight gives the frequency of this nomination. Students 1-12 are boys and 13-29 ar…

football_tsevans: NCAA college football 2000 (corrected metadata)
A network of American football games between Division IA colleges during regular season Fall 2000. This version contains some corrections made by T. S. Evans, in particular:.
This network has 115 nodes and 613 edges.
Tags: Social, Sports, Unweighted
https://

football_tsevans: NCAA college football 2000 (corrected metadata)
A network of American football games between Division IA colleges during regular season Fall 2000. This version contains some corrections made by T. S. Evans, in particular:.
This network has 115 nodes and 613 edges.
Tags: Social, Sports, Unweighted
https://

lkml_thread: Linux kernel mailing list
A bipartite network of contributions by users to threads on the Linux kernel mailing list. A left node is a person, and a right node is a thread, and each timestamped edge (i,j,t) denotes that user i contributed to thread j at time t. The date of the snapshot is not given.
This network has 379554 nodes and 1565683 edges.
Tags: Social, Communication, Unweighted, Timestamps

contiguous_usa: Contiguous states (USA)
A network of contiguous states in the USA, in which each state is a node and two nodes are connected if they share a land-based geographic border. The dataset includes the lower 48 states, and the District of Columbia.
This network has 49 nodes and 107 edges.
Tags: Transportation, Roads, Unweighted

petster: Pet owner social networks (2016)
A network of friendships among users on catster.com and dogster.com. Node represents a user, and edge exists if two users self-identify as friends on either website. The dogster/catster network also contains family links between dog and dog, cat and cat, as well as dog and cat.
This network has 623766 nodes and 15699276 edges.
Tags: Social, Online, Unweighted

moviegalaxies: Moviegalaxies, movies 410-466 (2018)
Social graphs for over 700 movies from the moviegalaxies.com website. Each node represents a character in a movie and each edge is a same-scene appearance between two characters in that movie. The weight gives the number of same-scene appearances. Networks are extracted from movie scripts automatically.
This network has 40 nodes and 188 edges.
Tags: Social, Fictional, Weighted

physician_trust: Physician trust network (1966)
A network of trust relationships among physicians in four midwestern (USA) cities in 1966. Edge direction indicates that node i trusts or asks for advice from node j. Each of the four components represent the network within a given city.
This network has 241 nodes and 1098 edges.
Tags: Social, Offline, Unweighted

ego_social: Ego networks in social media (2012)
Ego networks associated with a set of accounts of three social media platforms (Facebook, Google , and Twitter). Datasets include node features (profile metadata), circles, and ego networks, and were crawled from public sources in 2012.
This network has 168 nodes and 892 edges.
Tags: Social, Online, Unweighted, Metadata

faculty_hiring_us: Faculty hiring networks in the US (2022)
Networks of faculty hiring for all PhD-granting US universities over the decade 2011–2020. Each node is a PhD-granting institution, and a directed edge (i,j) indicates that a person received their PhD from node i and was tenure-track faculty at node j during time of collection (2011-2020). This dataset is divided into separate networks for all 107 fields, as well as aggregate networks for 8 domains, and an overall network for …

faculty_hiring_us: Faculty hiring networks in the US (2022)
Networks of faculty hiring for all PhD-granting US universities over the decade 2011–2020. Each node is a PhD-granting institution, and a directed edge (i,j) indicates that a person received their PhD from node i and was tenure-track faculty at node j during time of collection (2011-2020). This dataset is divided into separate networks for all 107 fields, as well as aggregate networks for 8 domains, and an overall network for …

faculty_hiring: Faculty hiring networks (Comp. Sci., Business, History)
Three networks of faculty hiring in Computer Science Departments, Business Schools, and History Departments. Each node is a PhD-granting institution in the respective field, and a directed edge (i,j) indicates that a person received their PhD from node i and was tenure-track faculty at node j during time of collection (2011-2013). All data collected from faculty public rosters at the sampled institutions.
Thi…

fly_larva: Drosophila larva brain (2023)
A complete synaptic map of the brain connectome of the larva of the fruit fly Drosophila melanogaster. Nodes are neurons, and edges are synaptic connections, traced individually from brain image sections using three-dimensional electron microscopy–based reconstruction. Node metadata include the neuron hempisphere, hemispherical homologue, cell type, annotations, and inferred cluster. Edge metadata include the type of interaction (`'aa'`,…

paris_transportation: Paris Transportation (2016)
A multiplex transportation network of Ile-de-France, jointly representing the road network, train network, and subway network. Nodes are intersections, rail stations or metro stations. Different modes of transportation are given by different layers. Within-layer edges represent direct transference by a particular mode of transportation, and between-layer edges represent the conjunction of those layers at that node.
This network ha…

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…

wordnet: WordNet relationships
A network of English words from the WordNet. Node is a word, and edge denotes relationships between words (synonymy, hyperonymy, meronymy, etc.). The date at which this network was extracted from WordNet is not unknown.
This network has 146005 nodes and 656999 edges.
Tags: Informational, Language, Unweighted
htt…

petster: Pet owner social networks (2016)
A network of friendships among users on catster.com and dogster.com. Node represents a user, and edge exists if two users self-identify as friends on either website. The dogster/catster network also contains family links between dog and dog, cat and cat, as well as dog and cat.
This network has 623766 nodes and 15699276 edges.
Tags: Social, Online, Unweighted

lkml_thread: Linux kernel mailing list
A bipartite network of contributions by users to threads on the Linux kernel mailing list. A left node is a person, and a right node is a thread, and each timestamped edge (i,j,t) denotes that user i contributed to thread j at time t. The date of the snapshot is not given.
This network has 379554 nodes and 1565683 edges.
Tags: Social, Communication, Unweighted, Timestamps

lkml_thread: Linux kernel mailing list
A bipartite network of contributions by users to threads on the Linux kernel mailing list. A left node is a person, and a right node is a thread, and each timestamped edge (i,j,t) denotes that user i contributed to thread j at time t. The date of the snapshot is not given.
This network has 379554 nodes and 1565683 edges.
Tags: Social, Communication, Unweighted, Timestamps

us_agencies: U.S. government agency websites (2018)
50 networks, one for each U.S. state, representing the web-based links between their associated government agencies websites. A node is an entire agency website and a directed edge (i,j) represents the existence of a hyperlink from any webpage in website i to some webpage in website j. Data was collected with a crawler. Nodes are annotated with the number of webpages per website, website name (related to its government function) and U…

word_assoc: Edinburgh word associations
A network of word associations showing the count of such associations as collected from subjects, from the Edinburgh Associative Thesaurus (EAT). Each node represents a word, and a directed edge (i, j) denotes that word i was used as a stimulus to which word j was given as a response. Multiple edges are allowed.
This network has 23132 nodes and 312342 edges.
Tags: Informational, Language, Unweighted, Multigraph

physician_trust: Physician trust network (1966)
A network of trust relationships among physicians in four midwestern (USA) cities in 1966. Edge direction indicates that node i trusts or asks for advice from node j. Each of the four components represent the network within a given city.
This network has 241 nodes and 1098 edges.
Tags: Social, Offline, Unweighted

faculty_hiring_us: Faculty hiring networks in the US (2022)
Networks of faculty hiring for all PhD-granting US universities over the decade 2011–2020. Each node is a PhD-granting institution, and a directed edge (i,j) indicates that a person received their PhD from node i and was tenure-track faculty at node j during time of collection (2011-2020). This dataset is divided into separate networks for all 107 fields, as well as aggregate networks for 8 domains, and an overall network for …