Tootfinder

Jutro chyba wejdę na Śnieżkę.
Śnieżka: https://www.openstreetmap.org/node/3889241996#map=14/51.44064/16.24380

Addressing Graph Anomaly Detection via Causal Edge Separation and Spectrum
Zengyi Wo, Wenjun Wang, Minglai Shao, Chang Liu, Yumeng Wang, Yueheng Sun
https://arxiv.org/abs/2508.14684

Addressing Graph Anomaly Detection via Causal Edge Separation and Spectrum
In the real world, anomalous entities often add more legitimate connections while hiding direct links with other anomalous entities, leading to heterophilic structures in anomalous networks that most GNN-based techniques fail to address. Several works have been proposed to tackle this issue in the spatial domain. However, these methods overlook the complex relationships between node structure encoding, node features, and their contextual environment and rely on principled guidance, research on …

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 …

The Proportional Fair Scheduler in Wavelength-Multiplexed Quantum Networks
Sanidhay Bhambay, Siddarth Koduru Joshi, Thirupathaiah Vasantam, Neil Walton
https://arxiv.org/abs/2507.13999

The Proportional Fair Scheduler in Wavelength-Multiplexed Quantum Networks
We address the problem of optimal pumping strategies in quantum networks. These networks enable secure communication by distributing entangled photon pairs to user (or node) pairs. Quantum Key Distribution (QKD) protocols, like BBM92, generate secret keys from entangled photons. While secure communication and error correction are essential for any quantum communication channel, resource contention, optimization, and fairness issues are critical for networks. In this article, we analyze the perf…

Spectral Analysis of Node- and Cell-Centered Higher-Order Compact Schemes for Fully Discrete One and Two-Dimensional Convection-Dispersion Equation
Lavanya V Salian, Vivek S Yadav, Rathan Samala, Rakesh Kumar
https://arxiv.org/abs/2507.14692

Spectral Analysis of Node- and Cell-Centered Higher-Order Compact Schemes for Fully Discrete One and Two-Dimensional Convection-Dispersion Equation
In this study, we present a comprehensive global spectral analysis of the convection dispersion equation, which is also referred to in specific contexts as the Korteweg de Vries (KdV) equation, to investigate the behaviour of high order numerical schemes across a wide range of nondimensional parameters. The motivation for this analysis stems from the equation's importance in modeling wave propagation and transport phenomena, where accurate resolution of dispersive effects is critical, and tradi…

Efficient Size Constraint Community Search over Heterogeneous Information Networks
Xinjian Zhang, Lu Chen, Chengfei Liu, Rui Zhou, Bo Ning
https://arxiv.org/abs/2508.14356 https…

Efficient Size Constraint Community Search over Heterogeneous Information Networks
The goal of community search in heterogeneous information networks (HINs) is to identify a set of closely related target nodes that includes a query target node. In practice, a size constraint is often imposed due to limited resources, which has been overlooked by most existing HIN community search works. In this paper, we introduce the size-bounded community search problem to HIN data. Specifically, we propose a refined (k, P)-truss model to measure community cohesiveness, aiming to identify t…

Improved girth approximation in weighted undirected graphs
Avi Kadria, Liam Roditty, Aaron Sidford, Virginia Vassilevska Williams, Uri Zwick
https://arxiv.org/abs/2507.13869

Improved girth approximation in weighted undirected graphs
Let $G = (V,E,\ell)$ be a $n$-node $m$-edge weighted undirected graph, where $\ell: E \rightarrow (0,\infty)$ is a real \emph{length} function defined on its edges, and let $g$ denote the girth of $G$, i.e., the length of its shortest cycle. We present an algorithm that, for any input, integer $k \geq 1$, in $O(kn^{1+1/k}\log{n} + m(k+\log{n}))$ expected time finds a cycle of length at most $\frac{4k}{3}g$. This algorithm nearly matches a $O(n^{1+1/k}\log{n})$-time algorithm of \cite{KadriaRSWZ…

NodeShield: Runtime Enforcement of Security-Enhanced SBOMs for Node.js
Eric Cornelissen, Musard Balliu
https://arxiv.org/abs/2508.13750 https://arxiv.org/p…

NodeShield: Runtime Enforcement of Security-Enhanced SBOMs for Node.js
The software supply chain is an increasingly common attack vector for malicious actors. The Node.js ecosystem has been subject to a wide array of attacks, likely due to its size and prevalence. To counter such attacks, the research community and practitioners have proposed a range of static and dynamic mechanisms, including process- and language-level sandboxing, permission systems, and taint tracking. Drawing on valuable insight from these works, this paper studies a runtime protection mechani…

Got some batteries, and now my prototype solar node is ready for being tested in the field.
#meshtastic

Revisiting the Effect of Grid-Following Converter on Frequency Dynamics -- Part II: Spatial Variation
Jiahao Liu, Cheng Wang, Tianshu Bi
https://arxiv.org/abs/2507.15362

Revisiting the Effect of Grid-Following Converter on Frequency Dynamics -- Part II: Spatial Variation
Besides the center of inertia (COI) frequency dynamics addressed in Part I, the spatial frequency variation in power systems with grid-following (GFL) converters is also crucial. Part II revisits the effect of GFLs on frequency spatial variation. Leveraging the interfacing state variables and equivalent frequency defined in Part I, an extended frequency divider (FD) formula is proposed. The linearized mapping relationship between network node frequency and synchronous generator (SG) rotor frequ…

Heute wird es heiß in #Göttingen!
> Amtliche WARNUNG vor HITZE
https://www.dwd.de/DE/wetter/warnungen/warnWetter_node.html?ort=Göttingen

Non-Dissipative Graph Propagation for Non-Local Community Detection
William Leeney, Alessio Gravina, Davide Bacciu
https://arxiv.org/abs/2508.14097 https://

Non-Dissipative Graph Propagation for Non-Local Community Detection
Community detection in graphs aims to cluster nodes into meaningful groups, a task particularly challenging in heterophilic graphs, where nodes sharing similarities and membership to the same community are typically distantly connected. This is particularly evident when this task is tackled by graph neural networks, since they rely on an inherently local message passing scheme to learn the node representations that serve to cluster nodes into communities. In this work, we argue that the ability…

Energy-Efficient Routing Algorithm for Wireless Sensor Networks: A Multi-Agent Reinforcement Learning Approach
Parham Soltani, Mehrshad Eskandarpour, Amir Ahmadizad, Hossein Soleimani
https://arxiv.org/abs/2508.14679

Energy-Efficient Routing Algorithm for Wireless Sensor Networks: A Multi-Agent Reinforcement Learning Approach
Efficient energy management is essential in Wireless Sensor Networks (WSNs) to extend network lifetime and ensure reliable data transmission. This paper presents a novel method using reinforcement learning-based cluster-head selection and a hybrid multi-hop routing algorithm, which leverages Q-learning within a multi-agent system to dynamically adapt transmission paths based on the energy distribution across sensor nodes. Each sensor node is modeled as an autonomous agent that observes local st…

Simphony: A full tight-binding package for lattice vibrations and topological phonon analysis
Francesc Ballester, Ion Errea, Maia G. Vergniory
https://arxiv.org/abs/2507.15413

Simphony: A full tight-binding package for lattice vibrations and topological phonon analysis
Simphony is an open-source software package designed for the topological analysis of lattice vibrations based on Wannier tight-binding models. Its primary function is to classify the topology of novel materials by computing bulk and slab phonon band structures, extracting phonon surface spectra, and providing analysis tools such as Wilson loop calculations and Weyl node detection. The workflow is analogous to that of established electronic topology codes like Wannier90 and WannierTools. It also…

Intermittent--synchronization in non-weakly coupled piecewise linear expanding map lattice: a geometric-combinatorics method
Junke Zhang, Yiqian Wang
https://arxiv.org/abs/2507.14646

Intermittent--synchronization in non-weakly coupled piecewise linear expanding map lattice: a geometric-combinatorics method
The coupled (chaotic) map lattices (CMLs) characterizes the collective dynamics of a spatially distributed system consisting of locally or globally coupled maps. The current research on the dynamic behavior of CMLs is based on the framework of the Perron-Frobenius operator and mainly focuses on weakly-coupled cases. In this paper, a novel geometric-combinatorics method for for non weakly-coupled CMLs is provided on the dynamical behavior of a two-node CMLs with identical piecewise linear expand…

A Generalized Multinodal Model for Plasma Particle and Energy Transport
Zefang Liu, Weston M. Stacey
https://arxiv.org/abs/2507.13627 https://

A Generalized Multinodal Model for Plasma Particle and Energy Transport
We present a generalized multinodal model for simulating particle and energy transport in toroidal plasma configurations, developed to support burning plasma analysis and reactor-scale modeling. Unlike fixed-node models, this formulation allows an arbitrary number of nodes, offering increased flexibility for coupling with core-edge or core-pedestal simulations. The model derives nodal balance equations for each plasma species by volume-averaging the continuity and energy conservation equations …

Enhancing Contrastive Link Prediction With Edge Balancing Augmentation
Chen-Hao Chang, Hui-Ju Hung, Chia-Hsun Lu, Chih-Ya Shen
https://arxiv.org/abs/2508.14808 https://

Enhancing Contrastive Link Prediction With Edge Balancing Augmentation
Link prediction is one of the most fundamental tasks in graph mining, which motivates the recent studies of leveraging contrastive learning to enhance the performance. However, we observe two major weaknesses of these studies: i) the lack of theoretical analysis for contrastive learning on link prediction, and ii) inadequate consideration of node degrees in contrastive learning. To address the above weaknesses, we provide the first formal theoretical analysis for contrastive learning on link pr…

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…

Distributed Shared Layered Storage Quantum Simulator: A novel quantum simulation system for efficient scaling and cost optimization
Mingyang Yu, Haorui Yang, Donglin Wang, Desheng Kong, Ji Du, Yulong Fu, Wei Wang, Jing Xu
https://arxiv.org/abs/2508.15542

Distributed Shared Layered Storage Quantum Simulator: A novel quantum simulation system for efficient scaling and cost optimization
Quantum simulators are essential tools for developing and testing quantum algorithms. However, the high-frequency traversal characteristic of quantum simulators represents an unprecedented demand in the history of IT, and existing distributed technologies is unable to meet this requirement, resulting in a single-node bottleneck of quantum simulator. To overcome this limitation, this paper introduces a novel Distributed Shared Layered Storage Quantum Simulator (DSLSQS). By leveraging an innovati…

In Saint Josse ten Noode / Sint Joost ten Node (BXL) finden sich interessante Kulturarrangements.

heise | Off-Grid-Messenger mit Meshfunktion: Meshtastic-Solarrouter im Eigenbau
Mit einem solarbetriebenen Meshtastic-Node hält man im Katastrophenfall die Kommunikation aufrecht. So geht der Eigenbau für wenig Geld.

🔖 Bookmarked als Lektüre für die Rente.
Schön, dass der @dnb #Lizenzierungsservice (https://www.dnb.de/DE/Professionell/Services/VW-LiS/vwlis_node.html…

Tighter Lower Bounds for Single Source Personalized PageRank
Xinpeng Jiang, Haoyu Liu, Siqiang Luo, Xiaokui Xiao
https://arxiv.org/abs/2507.14462 https://

Tighter Lower Bounds for Single Source Personalized PageRank
We study lower bounds for approximating the Single Source Personalized PageRank (SSPPR) query, which measures the probability distribution of an $α$-decay random walk starting from a source node $s$. Existing lower bounds remain loose-$Ω\left(\min(m, 1/δ)\right)$ for relative error (SSPPR-R) and $Ω\left(\min(n, 1/ε)\right)$ for additive error (SSPPR-A). To close this gap, we establish tighter bounds for both settings. For SSPPR-R, we show a lower bound of $Ω\left(\min\left(m, \frac{\log(1…

The Multi-Stage Assignment Problem: A Fairness Perspective
Vibulan J, Swapnil Dhamal, Shweta Jain
https://arxiv.org/abs/2508.13856 https://arxiv.org/pdf/25…

The Multi-Stage Assignment Problem: A Fairness Perspective
This paper explores the problem of fair assignment on Multi-Stage graphs. A multi-stage graph consists of nodes partitioned into $K$ disjoint sets (stages) structured as a sequence of weighted bipartite graphs formed across adjacent stages. The goal is to assign node-disjoint paths to $n$ agents starting from the first stage and ending in the last stage. We show that an efficient assignment that minimizes the overall sum of costs of all the agents' paths may be highly unfair and lead to signifi…

Equivariant Electronic Hamiltonian Prediction with Many-Body Message Passing
Chen Qian, Valdas Vitartas, James Kermode, Reinhard J. Maurer
https://arxiv.org/abs/2508.15108 https…

Equivariant Electronic Hamiltonian Prediction with Many-Body Message Passing
Machine learning surrogates of Kohn-Sham Density Functional Theory Hamiltonians offer a powerful tool to accelerate the prediction of electronic properties of materials, such as electronic band structures and densities-of-states. For large-scale applications, an ideal model would exhibit high generalization ability and computational efficiency. Here, we introduce the MACE-H graph neural network, which combines high body-order message passing with a node-order expansion to efficiently obtain all…

Contrastive Multi-View Graph Hashing
Yang Xu, Zuliang Yang, Kai Ming Ting
https://arxiv.org/abs/2508.12377 https://arxiv.org/pdf/2508.12377

Contrastive Multi-View Graph Hashing
Multi-view graph data, which both captures node attributes and rich relational information from diverse sources, is becoming increasingly prevalent in various domains. The effective and efficient retrieval of such data is an important task. Although multi-view hashing techniques have offered a paradigm for fusing diverse information into compact binary codes, they typically assume attributes-based inputs per view. This makes them unsuitable for multi-view graph data, where effectively encoding …

MrMARTIAN: A Multi-resolution Mass Reconstruction Algorithm Combining Free-form and Analytic Components
Sangjun Cha, M. James Jee
https://arxiv.org/abs/2508.13262 https://

MrMARTIAN: A Multi-resolution Mass Reconstruction Algorithm Combining Free-form and Analytic Components
We present ${\tt MrMARTIAN}$ (Multi-resolution MAximum-entropy Reconstruction Technique Integrating Analytic Node), a new hybrid strong lensing (SL) modeling algorithm. By incorporating physically motivated analytic nodes into the free-form method ${\tt MARS}$, ${\tt MrMARTIAN}$ enables stable and flexible mass reconstructions while mitigating oversmoothing in the inner mass profile. Its multi-resolution framework increases the degrees of freedom in regions with denser strong lensing constraint…

Unfolded Laplacian Spectral Embedding: A Theoretically Grounded Approach to Dynamic Network Representation
Haruka Ezoe, Hiroki Matsumoto, Ryohei Hisano
https://arxiv.org/abs/2508.12674

Unfolded Laplacian Spectral Embedding: A Theoretically Grounded Approach to Dynamic Network Representation
Dynamic relational structures play a central role in many AI tasks, but their evolving nature presents challenges for consistent and interpretable representation. A common approach is to learn time-varying node embeddings, whose effectiveness depends on satisfying key stability properties. In this paper, we propose Unfolded Laplacian Spectral Embedding, a new method that extends the Unfolded Adjacency Spectral Embedding framework to normalized Laplacians while preserving both cross-sectional an…

On the usage of $2$-node lines in $n$-correct and $GC_n$ sets
Hakop Hakopian, Gagik Vardanyan, Navasard Vardanyan
https://arxiv.org/abs/2508.13289 https://…

On the usage of $2$-node lines in $n$-correct and $GC_n$ sets
An $n$-correct set $\mathcal{X}$ in the plane is a set of nodes admitting unique interpolation with bivariate polynomials of total degree at most $n$. A $k$-node line is a line passing through exactly $k$ nodes of $\mathcal{X}.$ A line can pass through at most $n+1$ nodes of an $n$-correct set. An $(n+1)$-node line is called maximal line (C. de Boor, 2007). We say that a node $A\in\mathcal{X}$ uses a line $\ell,$ if $\ell$ is a factor of the fundamental polynomial of the node $A.$ Let $\mat…

Lightweight Node Selection in Hexagonal Grid Topology for TDoA-Based UAV Localization
Zexin Fang, Bin Han, Wenwen Chen, Hans D. Schotten
https://arxiv.org/abs/2506.14311

Lightweight Node Selection in Hexagonal Grid Topology for TDoA-Based UAV Localization
This paper investigates the optimization problem for TDoA-based UAV localization in low-altitude urban environments with hexagonal grid node deployment. We derive a lightweight optimized node selection strategy based on only RSSI measurements, to pre-select optimal nodes, avoiding extensive TDoA measurements in energy-constrained UAV scenarios. Theoretical and simulation results demonstrate that dynamically selecting the number of reference nodes improves localization performance while minimizi…

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

Realization and characterization of an all-bands-flat electronic lattice
Noah Lape, Simon Diubenkov, L. Q. English, P. G. Kevrekidis, Alexei Andreanov, Yeongjun Kim, Sergej Flach
https://arxiv.org/abs/2508.13571

Realization and characterization of an all-bands-flat electronic lattice
We construct an electronic all-bands-flat (ABF) lattice and experimentally generate compact localized states (CLSs) therein. The lattice is a diamond (rhombic) chain and implemented as a network of capacitors and inductors, as well as voltage inverters (using operational amplifiers) in order to introduce a \(π\)-phase flux within each diamond. The network's normal modes split into three flat bands, and the corresponding CLSs can be excited in isolation via a two-node driving at the flat band f…

Market Viability and Completeness for Multinomial Models
Nahuel I. Arca
https://arxiv.org/abs/2508.13966 https://arxiv.org/pdf/2508.13966

Market Viability and Completeness for Multinomial Models
We study a generalization of the classical binomial model that consists in allowing any finite number of branches in each node of the tree representation. In this model, we show that the two fundamental theorems of asset pricing have a geometric interpretation and, using this, we give necessary and sufficient conditions for a market to be arbitrage-free and complete. We also present an algorithm for completing arbitrage-free markets in every possible way. We apply these results to the study of …

🥳 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.
…

Simultaneous estimation of connectivity and dimensionality in samples of networks
Wenlong Jiang, Chris McKennan, Jes\'us Arroyo, Joshua Cape
https://arxiv.org/abs/2508.12483

Simultaneous estimation of connectivity and dimensionality in samples of networks
An overarching objective in contemporary statistical network analysis is extracting salient information from datasets consisting of multiple networks. To date, considerable attention has been devoted to node and network clustering, while comparatively less attention has been devoted to downstream connectivity estimation and parsimonious embedding dimension selection. Given a sample of potentially heterogeneous networks, this paper proposes a method to simultaneously estimate a latent matrix of …

Empirically-Calibrated H100 Node Power Models for Reducing Uncertainty in AI Training Energy Estimation
Alex C. Newkirk, Jared Fernandez, Jonathan Koomey, Imran Latif, Emma Strubell, Arman Shehabi, Constantine Samaras
https://arxiv.org/abs/2506.14551

Empirically-Calibrated H100 Node Power Models for Reducing Uncertainty in AI Training Energy Estimation
As AI's energy demand continues to grow, it is critical to enhance the understanding of characteristics of this demand, to improve grid infrastructure planning and environmental assessment. By combining empirical measurements from Brookhaven National Laboratory during AI training on 8-GPU H100 systems with open-source benchmarking data, we develop statistical models relating computational intensity to node-level power consumption. We measure the gap between manufacturer-rated thermal design pow…

Time series analysis of coupled slow-fast neuron models: From Hurst exponent to Granger causality
Indranil Ghosh, Hammed O. Fatoyinbo, Sishu S. Muni
https://arxiv.org/abs/2507.13570

Time series analysis of coupled slow-fast neuron models: From Hurst exponent to Granger causality
We perform time series analysis of small networks where every node is the slow-fast version of the denatured Morris--Lecar neuron proposed by Schaeffer and Cain. We choose popular coupling strategies from the literature and provide a detailed account of how varying their strength drives the dynamics of the small networks. Algorithms for time series analysis range from measuring their persistence (ability to remember past values), irregularity, chaos and quasiperiodicity, to synchronization betw…

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…

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…

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…

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

Replaced article(s) found for q-bio.NC. https://arxiv.org/list/q-bio.NC/new
[1/1]:
- Effective Stimulus Propagation in Neural Circuits: Driver Node Selection
Bulat Batuev, Arsenii Onuchin, Sergey Sukhov

So thankful to the *excellent* work that @… has done with Node.js!
Especially this: https://floss.social/@webhackfest/114699260646396693

Load-Balanced Diffusion Monte Carlo Method with Lattice Regularization
Kousuke Nakano, Sandro Sorella, Michele Casula
https://arxiv.org/abs/2508.12033 https://

Load-Balanced Diffusion Monte Carlo Method with Lattice Regularization
Ab initio quantum Monte Carlo (QMC) is a stochastic approach for solving the many-body Schrödinger equation without resorting to one-body approximations. QMC algorithms are readily parallelizable via ensembles of $N_w$ walkers, making them well suited to large-scale high-performance computing. Among the QMC techniques, Diffusion Monte Carlo (DMC) is widely regarded as the most reliable, since it provides the projection onto the ground state of a given Hamiltonian under the fixed-node approxima…

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…

Scala.js
#scala

A novel approach for converting spatio-temporal series into complex networks
G. Cigdem Yalcin, M. Berk Onder
https://arxiv.org/abs/2506.14378 https://

A novel approach for converting spatio-temporal series into complex networks
This study aims to offer a new perspective on complex network representation of real-world systems. Currently, the most well-known transformation algorithms in the literature treat each data point in a time series as a node and transform the time series into a network. In this study, we present a new approach converting spatio-temporal series into a complex network. We focus on studying this transformation by grounding it in the context of physics , with the aim of adapting it to real-world pro…

Latency-Optimal File Assignment in Geo-Distributed Storage with Preferential Demands
Srivathsa Acharya, P. Vijay Kumar, Viveck R. Cadambe
https://arxiv.org/abs/2507.12830

Latency-Optimal File Assignment in Geo-Distributed Storage with Preferential Demands
We consider the problem of data storage in a geographically distributed (or geo-distributed) network of servers (or nodes) where inter-node communication incurs certain round-trip delays. Every node serves a set of users who can request any file in the network. If the requested file is not available at the node, it communicates with other nodes to obtain the file, thus causing the user to experience latency in obtaining the file. The files can be placed uncoded, where each node stores exact cop…

Replaced article(s) found for cs.SI. https://arxiv.org/list/cs.SI/new
[1/1]:
- Fast Geometric Embedding for Node Influence Maximization
Alexander Kolpakov, Igor Rivin

Multipartite Mixed-Species Entanglement over a Quantum Network
D. Main, P. Drmota, E. M. Ainley, A. Agrawal, D. Webb, S. Saner, O. Bazavan, B. C. Nichol, R. Srinivas, D. P. Nadlinger, G. Araneda, D. M. Lucas
https://arxiv.org/abs/2506.14334

Multipartite Mixed-Species Entanglement over a Quantum Network
We generate multipartite entangled states of two, three and four matter qubits, where the entanglement is distributed over macroscopic distances via a photonic network link. Trapped-ion ${}^{88}\text{Sr}^+$ qubits are entangled directly via the optical fibre link, and the entanglement is subsequently extended to ${}^{43}\text{Ca}^+$ memory qubits co-trapped in each network node, using local mixed-species logic gates. We create remotely entangled $\text{Sr}^+$-$\text{Ca}^+$ and $\text{Ca}^+$-$\t…

DAGs for the Masses
Michael Anoprenko, Andrei Tonkikh, Alexander Spiegelman, Petr Kuznetsov
https://arxiv.org/abs/2506.13998 https://…

DAGs for the Masses
A recent approach to building consensus protocols on top of Directed Acyclic Graphs (DAGs) shows much promise due to its simplicity and stable throughput. However, as each node in the DAG typically includes a linear number of references to the nodes in the previous round, prior DAG protocols only scale up to a certain point when the overhead of maintaining the graph becomes the bottleneck. To enable large-scale deployments of DAG-based protocols, we propose a sparse DAG architecture, where ea…

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

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.

A Remedy for Over-Squashing in Graph Learning via Forman-Ricci Curvature based Graph-to-Hypergraph Structural Lifting
Michael Banf, Dominik Filipiak, Max Schattauer, Liliya Imasheva
https://arxiv.org/abs/2508.11390

A Remedy for Over-Squashing in Graph Learning via Forman-Ricci Curvature based Graph-to-Hypergraph Structural Lifting
Graph Neural Networks are highly effective at learning from relational data, leveraging node and edge features while maintaining the symmetries inherent to graph structures. However, many real-world systems, such as social or biological networks, exhibit complex interactions that are more naturally represented by higher-order topological domains. The emerging field of Geometric and Topological Deep Learning addresses this challenge by introducing methods that utilize and benefit from higher-ord…

Strain-induced Ettingshausen effect in spin-orbit coupled noncentrosymmetric metals
Gautham Varma K, Azaz Ahmad, Gargee Sharma
https://arxiv.org/abs/2508.13147 https://

Strain-induced Ettingshausen effect in spin-orbit coupled noncentrosymmetric metals
Elastic deformations couple with electronic degrees of freedom in materials to generate gauge fields that lead to interesting transport properties. Recently, it has been well studied that strain-induced chiral magnetic fields in Weyl semimetals lead to interesting magnetotransport induced by the chiral anomaly (CA). Recent studies have revealed that CA is not necessarily only a Weyl-node property, but is rather a Fermi surface property, and is also present in a more general class of materials, …

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…

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…

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…

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…

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…

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…

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://

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

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 …

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…

Identification of Authoritative Nodes and Dismantling of Illicit Networks Using a Novel Metric for Measuring Strength of a Graph
Kartikeya Kansal, Arunabha Sen
https://arxiv.org/abs/2507.12711

Identification of Authoritative Nodes and Dismantling of Illicit Networks Using a Novel Metric for Measuring Strength of a Graph
Dismantling criminal networks or containing epidemics or misinformation through node removal is a well-studied problem. To evaluate the effectiveness of such efforts, one must measure the strength of the network before and after node removal. Process P1 is considered more effective than P2 if the strength of the residual network after removing k nodes via P1 is smaller than that from P2. This leads to the central question: How should network strength be measured? Existing metrics rely solely …

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

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…

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

email_eu: Email network (EU research inst.)
An email network (anonymized) from a large European research institution, collected from October 2003 to May 2005 (18 months). Each node corresponds to an email address, and a directed edge exists between nodes i and j, if i sent at least one message to j.
This network has 265214 nodes and 420045 edges.
Tags: Social, Communication, Unweighted

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…

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 …

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'`,…

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…

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…

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…

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

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

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

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 …

spanish_highschools: Spanish high schools (2023)
Directed networks of friendships obtained through a social survey of spanish high school students.
This network has 378 nodes and 3267 edges.
Tags: Social, Offline, Weighted, Metadata
https://networks.skewed.de/net/spanish

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://

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

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

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

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 1079 nodes and 46234 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 …

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

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 …

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…

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

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

digg_votes: Digg story votes (2009)
A bipartite network between users and stories on digg.com from 2009. Each user node connects to all story nodes on which that user voted. Edges are timestamped.
This network has 142962 nodes and 3018197 edges.
Tags: Economic, Preferences, Multigraph, Timestamps
https://netwo…

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

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

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