Peer Revenue Publish or profit

Papers

Fresh from arXiv, typeset properly. Highlighted words trade on the market.

Computer Science Social and Information Networks

cs.SI Watch Social and Information Networks

Thursday 27 August

Social and Information Networks · Cross-listed from physics.soc-ph

Criticality and universality in network dismantling

Lorenzo Cirigliano, Claudio Castellano, Minsuk Kim et al. (+2 more)

Identifying the smallest set of elements whose removal dismantle a complex network, known as the network dismantling problem, is a fundamental task with many practical applications. Whereas network dismantling has been extensively studied over the past decade, most work has focused on developing efficient algorithms for large but finite networks. By contrast, the physics of the network dismantling process, namely how the network structural connectivity is affected by the removal of nodes or edges, remains largely unexplored in the thermodynamic limit. Here, we shed light on this understudied aspect of network dismantling by introducing an adaptive biased percolation process able to optimally dismantle a network. Through a systematic analysis of synthetic network models, we find that the proposed percolation process displays a universal phase transition, characterized by the abrupt and simultaneous disappearance of both the giant connected component and the largest 2-core, across networks with markedly different degree distributions. Simulations on real networks further support this universality, indicating that the physics of network dismantling is insensitive to a broad range of topological properties. Together, these results suggest that a topology-agnostic theory could be developed to explain the critical behavior of network dismantling.
Read the full abstract

All authors Lorenzo Cirigliano, Claudio Castellano, Minsuk Kim, Filippo Radicchi, Hanlin Sun

Social and Information Networks

Why People Share Social Media Screenshots

Tarannum Zaki, Michael L. Nelson and Michele C. Weigle

Posting screenshots of social media posts is a common way of increasing platform functionality, enabling inter-platform interoperability, and gives users more control over how content is presented and interpreted. While these are legitimate purposes, screenshot sharing is also used in ways that can remove context, hide the original source, or mislead audiences. We examine the motivations behind sharing screenshots of social media posts on social media platforms like Twitter/X, Instagram, and Facebook. By focusing on user motivations, our study contributes to understanding how screenshot practices shape the sharing and interpretation of information in online spaces.
Read the full abstract

Social and Information Networks

Community corrections have divergent downstream effects across corrected accounts

Yuwei Chuai, Thomas Renault, Nicolas Pröllochs et al. (+2 more)

Community-based fact-checking can reduce the spread of annotated misleading posts, but whether it produces lasting behavioral change among corrected authors remains unclear. Here, we conduct a large-scale quasi-experimental study of the Community Notes system on X (formerly Twitter), tracking four weeks of activity before and after note display for 19,854 accounts and 57,935 corrections (noted posts and matched controls), covering 11,909,591 original posts. Difference-in-Differences estimates show that note display is followed by an average 2.9% increase in corrected accounts' original-post activity. This aggregate conceals two divergent trajectories. Accounts corrected only once reduce their activity by 2.4% and subsequently publish less toxic and less misleading content. Repeatedly corrected accounts, which constitute 28.6% of corrected accounts but produce 73.4% of fact-checked posts, instead increase their activity by 4.4% after their first correction and show no detectable response to later ones. They exhibit no comparable content improvement, and instead publish more highly misleading posts, cite lower-quality domains, and post more political content. Community notes can thus constrain individual misleading posts without durably improving the behavior of the accounts most responsible for them, indicating that correcting content and changing its producers are distinct objectives for platform design.
Read the full abstract

All authors Yuwei Chuai, Thomas Renault, Nicolas Pröllochs, Gabriele Lenzini, Mohsen Mosleh

Social and Information Networks · Cross-listed from stat.ML

Optimal Transport for Network Comparison: A Unified Review with New Spectral Bounds and Machine Learning Applications

James Hyun and François G. Meyer

Network comparison using optimal transport is a growing area of research in network science. Unlike standard graph metrics, optimal transport computes both network dissimilarity and a transport plan that explains how one graph morphs into another. In this paper, we review how optimal transport compares undirected, unweighted simple graphs using three primary distances: the Wasserstein, Gromov-Wasserstein, and Bures-Wasserstein distances. We examine the closed form of the Wasserstein distance in one dimension via node feature probability distributions, and show how the transport plans of the Wasserstein and Gromov-Wasserstein distances visualize how mass is shifted to transform one network into another. Beyond reviewing existing transport-based approaches, we establish new spectral lower and upper bounds for the Bures-Wasserstein distance and characterize the tightness of the lower bound under eigenbasis perturbations. Finally, we evaluate these distances using a synthetic network dataset for clustering and a real-world temporal network.
Read the full abstract

Social and Information Networks · Cross-listed from cs.IR

Scaling Graph Neural Networks for Friend Recommendation: Multi-Hash User Embeddings and Temporal Neighbor Sampling

Maksim Utushkin, Andrei Ovsiannikov and Alexander D'yakonov

Friend recommendation is inherently graph-structured: the relevance of a potential connection depends on multi-hop social context rather than user attributes alone. However, deploying message-passing GNNs on a production-scale social graph with hundreds of millions of users and tens of billions of edges requires addressing numerous modeling and systems challenges. We present a scalable end-to-end GNN ranking system for production social graphs, focusing on two design choices that are critical in this setting: multi-hash ID embeddings and temporal neighbor sampling. Multi-hash embeddings are common for high-cardinality features, but industrial GNN systems typically either ignore trainable IDs or accept full embedding tables, exceeding 200 GB for our graph. We integrate multi-hash as the primary node representation, reducing the ID-embedding table size by more than 98 percent while preserving ranking quality. Temporal neighbor sampling is well understood in principle, but existing implementations scan full adjacency lists, which is a non-starter for users with tens of thousands of friends. We implement timestamp-sorted CSR storage with binary search, reducing the per-node temporal sampling cost from $O(deg(v) + k)$ to $O(\log(deg(v)) + k)$. Beyond these components, we show that this combination scales and yields measurable production impact. On a graph with 194M users and 28B edges, offline ablations isolate each design choice's contribution. In an online A/B test, our system increases friend additions from recommendations by 16 percent and unique friend adders by 11.5 percent over a strong production baseline. We release our framework for distributed training and inference on large temporal graphs.
Read the full abstract

Social and Information Networks · Cross-listed from cs.LG

When Interference Graphs Evolve: Doubly Robust Estimation of Dynamic Peer Effects

Xiaojing Du

Peer effects are difficult to estimate when interaction graphs evolve because pre-assignment network history, dynamic peer exposure, and post-assignment network change have distinct causal roles. We introduce a controlled contrast framework that indexes potential outcomes by own treatment, temporally aggregated peer exposure, and a post-assignment evolution summary. Differences between the resulting means define own-treatment, peer-exposure, controlled network-evolution, and joint controlled contrasts rather than a mediation decomposition. We develop the Dynamic Network Doubly Robust estimator, DynaNet-DR, which combines a temporally factorized propensity with normalized augmentation. Under consistency, summary sufficiency, sequential exchangeability, positivity, nuisance convergence, and weak dependence, its canonical estimator is consistent when either the outcome regression or the propensity estimator is consistent. The reported implementation adds representative-score prediction, fixed clipping, and finite-sample stabilization. Semi-synthetic benchmarks on fixed real temporal graph sequences show favorable estimation accuracy among methods targeting the full profile. These benchmarks assess summary-indexed contrasts rather than counterfactual edge generation, and the MathOverflow study is an observational illustration under the stated assumptions.
Read the full abstract

Social and Information Networks · Cross-listed from cs.AI

C-Unseen: Weak Signal Detection in Dynamic Temporal Knowledge Graphs via LLM Reasoning

Yassir Lairgi, Ludovic Moncla, Khalid Benabdeslem et al. (+2 more)

Weak signals are early, low-visibility indicators that precede significant changes before those changes become established. Existing detection methods, based on keyword frequency, topic modeling, or untyped graph topology, fail to capture the semantic and relational structure through which such signals manifest. In this paper, we propose C-Unseen, a self-interpretable framework for weak signal detection in Dynamic Temporal Knowledge Graphs (DTKGs). We define a weak signal as a rare, semantically coherent subgraph that proliferates across consecutive TKG snapshots. The framework operates through two modules: a Rare Subgraphs Extractor, in which an LLM identifies subgraphs whose content is in tension with the dominant snapshot narrative via chain-of-thought reasoning, and a Weak Signal Alerter, in which the persistence of these rare subgraphs is tracked across time steps to isolate true weak signals. Experimental results demonstrate that C-Unseen outperforms keyword-, topic-, and graph-based baselines.
Read the full abstract

All authors Yassir Lairgi, Ludovic Moncla, Khalid Benabdeslem, Rémy Cazabet, Pierre Cléau

Social and Information Networks · Cross-listed from math.PR

Explicit Bounds on the Entropy of Piecewise Hölder Graphon Models

Connor Loehde-Woolard and François G. Meyer

We study the entropy of random graphs generated by piecewise Hölder continuous graphons. We first present a result on the rate of convergence of the normalized entropy as the size of the graph grows. The core ideas of the proof are described, with the detailed proof provided in the appendix. From this result, we then derive quantitative bounds on the entropy for the stochastic block model and random geometric graph model. These bounds provide explicit formulae rather than asymptotic statements which have been found previously.
Read the full abstract

Wednesday 26 August

Social and Information Networks

Assessing Socio-Cyber Vulnerability Using Survey and Social Media Data

Shutonu Mitra, Qi Zhang, Tomas Neguyen et al. (+6 more)

The rapid growth of social media participation has increased exposure to socially engineered cyber threats (e.g., phishing, romance fraud, and tech-support scams), yet prevailing assessment tools remain fragmented: the Common Vulnerability Scoring System (CVSS) is primarily technical and largely omits human susceptibility, while the Social Vulnerability Index (SVI) is community-oriented and lacks cyber-specific modeling. To address this gap, we propose the Social Cyber Vulnerability Index (SCVI), an interpretable, uncertainty-aware metric combining two components: (i) an Individual Vulnerability Index (IVI), capturing awareness, behavior, psychological factors, and prior victimization, and (ii) an Attack Severity Index (ASI), capturing attack frequency, consequences, and sophistication. We validate SCVI across heterogeneous modalities: a nationally scoped survey (iPoll; 4,596 U.S. adults) and social-media narratives (450 Reddit r/scams reports, 2016-2024), demonstrating computation from both structured questionnaires and CI-driven feature extraction from text. Sensitivity analysis and 10,000-iteration Monte Carlo simulations show stable rankings under plausible weight variability and reveal context-dependent drivers. SCVI captures distinct socio-technical signals (Spearman correlation with CVSS $\rho = 0.33$; with SVI $\rho \approx -0.01$) and surfaces demographic and regional disparities. SCVI also provides substantially stronger separation between victim and non-victim groups than CVSS and SVI, supporting identification of high-risk populations and prioritization of interventions against emerging AI-enabled scams.
Read the full abstract

All authors Shutonu Mitra, Qi Zhang, Tomas Neguyen, Hossein Salemi, Fengxiu Zhang, Michin Hong, Chang-Tien Lu, Hemant Purohit, Jin-Hee Cho

Social and Information Networks

Epistemic Networks, Collective Misperception, and the Manipulation of Social Knowledge

Mihnea C. Moldoveanu and Joel A.C. Baum

We investigate the structure of interactive beliefs in networks: the epistemic state in which agents hold, revise, and act on their models of the epistemic states of other agents. What a group believes depends on what each member agent takes the others to believe, and on what each takes the others to believe about still others. We posit that the proper unit of social-epistemic analysis is not the individual belief but the tensor of mutual attribution, the array that records what every agent takes every agent to believe. We separate three layers of this object: what is privately held, what is publicly expressed, and what is to be believed by others. Social belief evolves by contraction of the tensor against a signed matrix of epistemic influence. Collective misperception decomposes exactly into a component that observation dissolves and a component that observation cannot touch. Social conformity amplifies pluralistic ignorance without generating it. The stable forms of collective epistemic consensus, polarization, entrenched misperception, and instability are spectral regimes of a single operator. Higher-order belief reduces to walks in the epistemic network, under a stated assumption of cognitive consistency whose boundary we mark precisely.
Read the full abstract

Social and Information Networks

Social Network Structure, Wealth, and Wealth Inequality Across Cultures

Eleanor A. Power, Monique Borgerhoff Mulder, Samuel Bowles et al. (+57 more)

Despite theory tying wealth inequality to social structure, empirical evidence has been limited to a few studies based on online social media data. This study uses a very different type of data, expands the global coverage to very different types of societies, and investigates new questions. In particular, we collect data from ~3500 sharing units (households) in 46 communities across the globe, representing considerable human social and cultural diversity. In each, we analyze the relationship between people's material wealth and the structure of social networks: borrowing money, sharing food, working together, socializing, etc. In almost all communities, a sharing unit's material wealth is positively associated with the number of other sharing units it both helps and is helped by. A sharing unit's wealth is also associated with the relative wealth of the sharing units to which it is linked—a form of economic homophily. Notably, communities with greater wealth inequality are also characterized by a network structure in which poorer sharing units are less well connected to wealthier ones. We augment our unique cross-cultural data with other community-level environmental, institutional, and economic attributes, opening new avenues for future research into the co-determination of wealth and social networks.
Read the full abstract

All authors Eleanor A. Power, Monique Borgerhoff Mulder, Samuel Bowles, Matthew O. Jackson, Jeremy Koster, Daniel Redhead, Thomas Rutter, Sahana Subramanyam, Justin Weltz, Nurul Alam, Sarah Alami, Alexandra Alvergne, Curtis Atkisson, Michele Barnes, Bret Beheim, Christine M. Beitl, Madeline Brown, Mark Caudell, Wendy Chávez-Páez, Komal Chauhan, Joshua Cinner, Siobhán Cully, Augusto Dalla Ragione, Angelina L. DeMarco, Ivan Deschenaux, Federico Fernandez, Juan Pablo Ferreiro, Drew Gerkey, Matthew Gervais, Christopher Golden, Gianluca Grimalda, Werner Hertzog, Paul L. Hooper, Karen Kramer, Geoff Kushnick, Banrida Langstieh, Rodrigo Lazo, Sheina Lew-Levy, Shane Macfarlan, Emmanuel Maliti, Karl J. Mertens, Madalena Monteban, Rafael Morais Chiaravalloti, Daniel Murphy, Kathryn Oths, Alejandro Pérez Velilla, Emily Post, Sean Prall, Cody Ross, Anirudh Sankar, Brooke Scelza, Michael Schnegg, Edmond Seabright, Mary K. Shenk, Kathrine E. Starkweather, Chun-Yi Sum, Bram Tucker, Bapu Vaitla, Vivek Venkataraman, John P. Ziker

Social and Information Networks · Cross-listed from cs.CY

Framing War Across Languages: Power, Agency, and Sentiment in Wikipedia's Multilingual War Narratives

Jiarui Xia and Diego Gomez-Zara

While Wikipedia promotes a neutral point of view on historical conflicts, its language editions are written by editors from distinct linguistic and cultural communities. In this study, we analyze 158 wars since 1900 to examine how the descriptions of combatants vary across 20 Wikipedia language editions. Using connotation frames—which assess power, agency, and sentiment toward an entity—we examine how each language portrays the parties involved in the conflict. We find systematic differences when language editions describe wars involving their own communities, although the direction of these asymmetries varies across languages. However, when language editions describe conflicts that do not involve their own linguistic communities, their narrative structures exhibit high cross-linguistic similarity. These findings show how linguistic communities influence war narratives on Wikipedia, revealing that shared historical accounts remain shaped by the perspectives of the language communities that produce them.
Read the full abstract

Tuesday 25 August

Social and Information Networks

Social Behavior Among Autonomous AI: How Large Language Models Interact in Dynamic Networks

Narges Fardnia, Fatemeh Seyedin, Matthias Becker et al. (+2 more)

Cooperation is a cornerstone of human societies, enabling collective progress in dynamic and uncertain environments. With the advent of AI systems acting autonomously, it becomes crucial to understand not only human-AI cooperation but also AI-AI interactions in adaptive networks. In this work, we examine the interactions of AI using Large Language Models – Mistral, Llama3, Gemma3, and Phi3 – in a public goods game within dynamic network structures. Our experiments were conducted under single-model and mixed-model conditions across Watts-Strogatz (WS), Barabasi-Albert (BA), and Erdos-Renyi (ER) networks. We analyzed the impact of model architecture, network topology, and prompt design on cooperative behavior. Results show that Mistral and Llama3 offer high cooperation rates, while Phi3 shows defective tendencies. Additionally, the random structure of Erdos-Renyi networks dramatically improves cooperation. Prompt design also plays a key role; a society-benefits prompt leads to a higher cooperation level. These findings offer a preliminary framework for LLM-based simulations in adaptive social networks.
Read the full abstract

All authors Narges Fardnia, Fatemeh Seyedin, Matthias Becker, Mahmoudreza Babaei, Adrian Weller

Social and Information Networks

Tabular Foundation Models for Multi-View Information Cascade Popularity Prediction

Wenting Zhu, Chenghua Gong, Sanchuan Guo et al. (+3 more)

Predicting the future popularity of information cascades is essential for understanding information diffusion on social media. Despite recent advances, existing methods face two key limitations: they focus primarily on the cascade view while overlooking other information views that drive user engagement, such as textual semantics, visual content, and tabular attributes; and they fail to capture high-order cross-view interactions. To address these issues, we propose TFM4POP, the first framework to introduce tabular foundation models (TFMs) into popularity prediction, leveraging their pre-trained tabular priors to unify the modeling of multiple heterogeneous information views. Specifically, TFM4POP adopts a dual-branch design: the static branch employs a TFM as the feature-encoding backbone that jointly reasons over all static views through in-context learning to produce the static cascade representation, while the dynamic branch captures the continuous-time cascade dynamics with a dedicated Neural-ODE-based encoder. The two representations are then fused via cross-attention for the final prediction. Furthermore, to adapt the TFM to real cascade distributions, we apply parameter-efficient IA3 fine-tuning, achieving performance competitive with or better than full fine-tuning while updating substantially fewer parameters. In addition, we construct a comprehensive multi-view cascade benchmark that covers all four information views. Extensive experiments show that TFM4POP consistently outperforms state-of-the-art baselines across multiple datasets and observation settings.
Read the full abstract

All authors Wenting Zhu, Chenghua Gong, Sanchuan Guo, Chaozhuo Li, Yueyue Zhang, Xi Zhang

Monday 24 August

Social and Information Networks

Degree Centrality Algorithms for Weighted Multilayer Networks (or w-MLNs)

Ayomide Ayowole-Obi, Abhishek Santra and Sharma Chakravarthy

Centrality measures are defined for simple graphs – directed, undirected, weighted or unweighted. Attributed graphs have to be reduced to simple graphs for computing centrality measures. However, when applications with multiple types of relationships are modeled using multilayer networks (MLNs), simple graph algorithms cannot be directly used. Existing approaches typically analyze MLNs by aggregating layers of an MLN into a single graph, which results in the loss of structural and semantic information. The semantic information loss can be more pronounced particularly, in weighted networks. This work focuses on computing degree centrality in weighted homogeneous multilayer networks (HoMLNs) using a decoupling-based framework. The framework performs independent layer-wise analysis on MLNs without reducing them to simple graphs. The decoupling approach allows use of exiting algorithms for each layer and uses minimal information from individual layers for computing degree centrality of HoMLNs. We propose heuristic-based algorithms that strike a balance between accuracy and efficiency. The proposed methods are evaluated against ground truth (GT) results obtained using Boolean OR aggregation and naive baselines. Experimental results on both synthetic and real-world HoMLN datasets demonstrate that the heuristics achieve accuracy comparable to the ground truth while significantly improving computational efficiency, thereby establishing the scalability and effectiveness of the HoMLN algorithms developed using the decoupling approach.
Read the full abstract

Social and Information Networks · Cross-listed from cs.LG

Generating Intervention Hypotheses using Explainable Explanations on Graphs: G2I, a Two-Stage Greedy Framework

Mulin Tian and Ajitesh Srivastava

Real-world decision-making in public health and social science can greatly benefit from predictive models, yet translating predictions into effective interventions requires explaining the model behavior. While Graph Neural Networks (GNNs) are well-suited for modeling relational data, existing explanation methods largely operate at the node level and fall short of supporting actionable, network-level intervention design. Existing counterfactual GNN explainers, such as CF-GNNExplainer and CF$^2$, rely on continuous mask optimization over features and edges, which implicitly assume feasible edge manipulation, may allocate effort to immutable or non-actionable attributes, and incur substantial computational overhead. Further, the method of arriving at the explanation itself is difficult to explain to a domain specialist who is not an AI expert. Can simple methods generate good explanations? To explore this, we reframe counterfactual explanation as an intervention design problem. At the local level, we generate counterfactuals via a greedy search that directly identifies minimal, actionable changes to node features and neighbor-level conditions. We derive conditions under which the greedy search provides guarantees, and empirically show that these conditions are approximately met. These counterfactuals are converted into interpretable rules suitable for real-world intervention. At the network level, we formulate intervention selection as a Disjunctive Normal Form (DNF) coverage problem under a budget constraint, which is nondecreasing and approximately submodular, enabling a greedy algorithm with theoretical guarantees. Experiments on synthetic graphs and real-world suicide risk networks demonstrate that our approach produces scalable, cost-effective intervention strategies with significantly improved efficiency over mask-based counterfactual methods.
Read the full abstract

Social and Information Networks

Temporal Portability of Numeric User Metadata on Twitter

Chako Takahashi, Mitsuo Yoshida and Muneki Yasuda

Numeric user metadata in social media are often reused over time. However, their reusability may depend on what an analysis needs to preserve. We introduce temporal portability as an analytical perspective for assessing the cross-time reuse of user features and feature-based rules. Specifically, we ask how well relevant properties are preserved when features and rules defined at a source time point are reused at a target time point. We used quarterly data on user features obtained directly from or derived from Japanese-language tweets in Twitter's 1% sample stream from 2020-Q1 to 2022-Q3. Each quarter included approximately 10.1–11.0 million unique users. We evaluated 13 numeric user features in terms of feature distributions, same-user relative ranks, selection rates, and selected-user membership. Across quarters, feature distributions changed and, for many features, same-user relative ranks were less well preserved at longer quarter lags. Reusing source-quarter thresholds also produced selection-rate drift. Target-quarter recalibration nearly matched source-quarter selection rates. However, membership turnover persisted and increased at longer quarter lags. Our results show that temporal portability should be assessed in terms of the property that an analysis needs to preserve.
Read the full abstract

Social and Information Networks

Atomic Common-Day Invoice Clearing under Causal Daily Scheduling: Path-Enabled and Bounded-Cycle Policies

Peplluis Esteva de la Rosa and Sai Srikanth Madugula

Late payment propagates working-capital pressure through supply networks because firms are simultaneously creditors and debtors. We develop an atomic-record temporal invoice-graph method for path-enabled clearing and compares it with complete-candidate bounded-cycle netting under a causal daily greedy schedule. Each invoice remains a residual record with its issue date, due date, amount, and identifier. A candidate is executable through source capacity active on every supporting edge on one common day. A non-bilateral two-edge path reduces two invoice legs, creates a direct settlement instruction between the endpoints, and preserves net positions for all participants on the combined invoice-plus-instruction state; payable-mass reduction is distinguished from invoice compression. The empirical sequence contains 749,952 invoices issued from 2012 through 2023, totalling EUR99.7 billion, and maintains one rolling state across annual boundaries so bridge invoices are introduced once and residual balances continue. Path clearing reduces 48.2% of issue-cohort mass, compared with 43.3% for length-eight cycle netting, an advantage of EUR4.841 billion and 4.855 percentage points. It leads materially in ten cohorts, is practically tied in 2013, and trails in 2012. The result survives alternative ordering, mixed path-cycle policies, cycle-length sensitivity, component resampling, acceleration constraints, and fragment replay. In reciprocal 2022, where almost all local paths lie in the cyclic core, path clearing still leads. Tractable full-information linear programs show path advantage and path-cycle complementarity. The findings establish a policy-level benefit, not global optimality or welfare dominance,and motivate future asynchronous agent-to-agent clearing built around deterministic common-day verification,private mandates,reservations, explicit consent,and atomic commit.
Read the full abstract

Social and Information Networks · Cross-listed from cs.MA

Predicting the scale limits of social mechanisms in agent societies

Zengqing Wu and Chuan Xiao

Societies of interacting language-model agents offer a controllable and repeatable way to study collective behaviour at scales that would be difficult to test with people. Their scientific value, however, depends on whether a social mechanism that works in a small group still operates when thousands of agents interact, and testing this directly requires costly large-scale runs. Here we introduce an audit that predicts a mechanism's fate as a population grows. It asks how often the mechanism can act, whether agents use the information it supplies, and whether the measurement itself creates apparent scale effects. Controlled experiments show that a single structural term can decide whether reciprocity, consensus or punishment survives scaling. For gossip, the population at which the mechanism fails is set by the reach and lifetime of its messages. In language-model societies, agents respond not only to social information but to how it is expressed: counts and percentages led to different scale behaviour. Predictions made before execution held on third-party code and a second model family, while a failed prediction exposed the boundary of the finding. The audit provides a prospective way to decide which social mechanisms can be interpreted across population scales.
Read the full abstract

Sunday 23 August

Social and Information Networks

The Emergence of Causal Curiosity from Prior Causal Belief Networks

Zhuoyu Shi, Xintong Jiang, Bohan Jiang et al. (+1 more)

Causal curiosity is foundational to human cognition. It is the desire to understand why events happen, what mechanisms underlie them, and how outcomes can be explained or anticipated. It motivates exploration, sustains attention, and fuels the search for new knowledge. However, despite consensus on the importance of causal curiosity, little is known about how causal curiosity arises from existing belief systems. In our work, we examine how causal curiosity emerges from prior knowledge structures. With Reddit data from 2020 to 2023, and leveraging language models to extract cause-and-effect relationship pairs and identify causal curiosity-driven questions, our findings reveal that causal curiosity is not random or independent, but largely rooted in prior knowledge structure. Particularly, positive nouns are more likely to be the object of causal curiosity. Moreover, our findings indicate that concepts that serve more as causes are more likely to appear in causal curiosity than those that serve more as effects. Lastly, our results also suggest that causal curiosity emerges from the central of the prior belief network. These novel insights reveal that causal curiosity is not random but systematically grounded in prior knowledge structures, and suggest their implication to facilitate the human learning process by motivating people to actively explore and construct deeper understandings rather than passively receiving information.
Read the full abstract

All authors Zhuoyu Shi, Xintong Jiang, Bohan Jiang, Fred Morstatter

Social and Information Networks

Discretization-free exact recovery in geometric community detection

Maarten Hoeneveld, Moritz Otto and Raphaël Sala

Geometric community detection seeks to recover latent communities in networks where connectivity depends jointly on community structure and continuous spatial geometry. Existing exact-recovery approaches typically discretize the underlying space, which can impose restrictive structural assumptions on the connectivity functions. We develop a polynomial-time, discretization-free algorithm for exact recovery in the Geometric Hidden Community Model (GHCM), operating directly on the continuous geometry. Our method succeeds even when connectivity functions coincide on a nontrivial portion of their visibility range and when two communities can be distinguished only through their connectivity to a third community. We prove exact recovery under these weaker conditions and provide experiments showing that the algorithm succeeds beyond the theoretically guaranteed regime.
Read the full abstract

Social and Information Networks

Gender Attribution in Causal Beliefs

Zhuoyu Shi and Fred Morstatter

For centuries, women have been cast as the source of harm in public narratives, from witch hunts in early modern Europe to contemporary stereotypes about emotional instability. These cultural patterns reflect enduring biases in how people attribute causality and assign blame, often portraying women as agents of disruption and men as figures of rational authority. In this study, we examine how such gendered causal attributions appear in everyday language. Leveraging three complete 24-hour datasets of all English-language posts on Twitter, and using language models, we extract cause-and-effect relationship pairs and identify gendered attribution of causal agents. We then analyze how gender attribution relates to sentiment, the kinds of effects invoked, and the diffusion of posts through the social networks. Our findings reveal that female-attributed causes are more often associated with negative sentiment and emotional or relational outcomes, whereas male-attributed causes are more frequently linked to positive sentiment and abstract, structural effects. Moreover, male-attributed narratives spread more widely across communities. These results suggest that longstanding gender stereotypes continue to appear in how people express and amplify causal narratives in public discourse, in decentralized, high-velocity environments like social media.
Read the full abstract

Social and Information Networks

Causal Language in Post Titles Shapes Deeper Topological Structures of Online Conversations

Zhuoyu Shi and Fred Morstatter

Causal reasoning is fundamental to human understanding and information organization. People prefer causal explanations because they offer coherence, predictability, and a sense of control. Conversational structures shape how knowledge and perspectives are shared, validated, and amplified in networked publics. Understanding the structural effects of causal language can reveal pathways to fostering deeper, more meaningful interactions online. In this work, we investigate how causal language influences the topology and temporal evolution of discussion threads in online conversations with a dataset of 17 million posts across 200 subreddits in 2023 on Reddit. Our results show that causal language is consistently associated with deeper, more sustained conversations, with effects emerging early in the lifecycle of a thread, as demonstrated through a counterfactual experiment. Importantly, emotional responses do not differ substantially between causal language and non-causal language, suggesting that structural depth arises from framing itself rather than affective escalation. A lightweight qualitative analysis shows that causal framing titles prompt users to elaborate more with reasoning and contribute personal experiences, supporting deeper multi-turn exchanges. These findings suggest that causal language acts not merely as a stylistic device, but as a cognitively grounded and structurally influential signal that shapes the topological structures of online conversations.
Read the full abstract

Saturday 22 August

Social and Information Networks · Cross-listed from cs.LG

Who Should Teach? Confidence-Aware Dual-Teacher Learning for Few-Shot Node Classification on Text-Attributed Graphs

Hojin Kim, Sujin Yoon, Sungsu Lim et al. (+2 more)

Text-Attributed Graphs (TAGs) integrate graph structures and node-associated textual attributes, and recent studies have increasingly leveraged Large Language Models (LLMs) to improve TAG learning in few-shot settings. However, existing approaches typically utilize LLM-derived information uniformly across all nodes, despite substantial variations in its reliability, while also incurring considerable monetary costs. We argue that the most appropriate source of supervision may differ across nodes, as Graph Neural Networks (GNNs) and LLMs exhibit complementary strengths in exploiting structural and semantic information, respectively. To this end, we propose CoTeach, a Confidence-aware dual-teacher learning framework that dynamically selects the more reliable teacher for each node. Experimental results demonstrate that CoTeach consistently improves few-shot node classification performance while reducing unnecessary LLM utilization and associated monetary costs.
Read the full abstract

All authors Hojin Kim, Sujin Yoon, Sungsu Lim, Dongwon Lee, David Yoon Suk Kang

Social and Information Networks

RepuLink: A Linked Data Platform for Accountable Trust

Wenbo Wu and George Konstantinidis

Trust and reputation systems underpin reliable interactions in large, distributed networks. However, conventional models typically propagate trust only forward, offering no accountability for endorsers regarding whom they vouch for, and leaving newly joined nodes without a meaningful initial reputation. RepuLink addresses these limitations by proposing a two-layer trust and reputation model that integrates direct interaction feedback with domain-specific endorsements. Crucially, it holds endorsers accountable via Backward Endorsement Penalty/Reward Propagation (BEPP/BERP). This paper demonstrates RepuLink-Tool, a deployable, full-stack reference implementation of this model. The application enables nodes to interact, rate, and endorse each other, while tracking reputation via a live dashboard and an interactive trust network graph. Furthermore, we introduce a new Linked Data layer built on top of the application. This layer features a lightweight OWL ontology encompassing nodes, interactions, ratings, endorsements, pairwise trust assessments, and computed reputation scores annotated with PROV-O provenance. It also provides an on-the-fly RDF projection of each user's trust network in multiple serialisations, alongside a scoped SPARQL endpoint that nodes can query live against their own data.
Read the full abstract

Social and Information Networks

JECHO: Scalable Echo Chamber Detection via Jaccard-based Homophily and Seed Expansion

Ali Safarpoor Dehkordi, Atsushi Miyauchi, Francesco Bonchi et al. (+1 more)

Detecting echo chambers is critical for understanding and limiting negative social phenomena, such as online polarization, misinformation, and conspiracy theory diffusion. However, the echo chamber detection (ECD) problem yet lacks a rigorous algorithmic foundation. We address this gap by formalizing a unified definition of echo chambers based on three principles: internal opinion homogeneity, opinion extremism, and structural isolation. Under such a definition, we establish the theoretical hardness of the ECD problem, proving it is NP-hard via a reduction from the conductance minimization problem. To circumvent this computational barrier, we derive a theoretical lower bound on the Jaccard-based homophily (JHO) of nodes that reside within valid echo chambers. This guarantee motivates JECHO, a novel algorithm that detects echo chambers via local seed expansion rather than global enumeration. JECHO first identifies seeds that exceed the JHO threshold and then applies a score-based expansion to optimize structural isolation. Extensive experiments on real-world and synthetic networks demonstrate that our theory-guided approach detects more structurally isolated echo chambers than state-of-the-art methods while reducing runtime by orders of magnitude.
Read the full abstract

All authors Ali Safarpoor Dehkordi, Atsushi Miyauchi, Francesco Bonchi, Ahad N. Zehmakan

Social and Information Networks · Cross-listed from cs.CL

Convergence in Science, Divergence in Religion: Calibrated Framing Differences Across Wikipedia's Language Editions

Hung-Hsuan Chen

When Wikipedia's language editions describe the same concept, how differently do they frame it? Prior work measures coverage gaps between editions; we measure framing distance for matched concepts. We analyze 2,799 valid articles from 3,000 possible concept-language observations, spanning 150 Wikidata-anchored concepts, 20 language editions, 4 domains, and a calibration set. Raw embedding distances reflect both content differences and how well the encoder aligns each language pair. Even among calibration concepts with stable cross-cultural denotations (e.g., chemical elements, numbers, colors), the largest language-pair mean distance is 3.6 times the smallest, and distances are typically smaller within language families. We define a baseline-adjusted distance (calibrated distance): the distance between two language versions of a concept minus the mean distance for calibration concepts in the same language pair. This adjustment substantially reduces pair-specific alignment differences and the language-family pattern. Across three multilingual encoders (LaBSE, multilingual MPNet, and CMLM), scientific articles align more closely than calibration articles, and all three rank religion first and science/technology last. Concept-level rankings are highly consistent across encoders (Spearman rho=0.75-0.79 for MPNet and CMLM relative to LaBSE). Religion lies significantly above the calibration baseline under LaBSE. Within politics, divergence concentrates on concepts such as censorship and refugee, while democracy and human rights are among the most aligned. Code, data, and per-language-pair calibration baselines are released.\footnote{https://github.com/hhchen1105/cross-linqual-concept}
Read the full abstract

Friday 21 August

Social and Information Networks

Omega-N: Interpretable Structural Node Descriptors and Their Applicability Domain

Alberto Acedo

A composite structural index summarises a network in one number, and for a triangle-based index it is spectrally redundant: Tr(A^3) is the third moment of the adjacency spectrum. The non-redundant content sits one level down, in diag(A^3), which depends on eigenvectors and is not spectrally determined. A corollary in the theory paper predicted that the global scalar should tie sharpened spectral baselines rather than beat them, while the node-wise attribution should do better where the number of structural epicentres is unknown. We construct Omega-N by localizing each of the four factors. The direct localization is badly conditioned; two corrections from published practice fix it, a configuration-null excess per factor and a personalized-PageRank neighbourhood at several scales, giving ten interpretable features per node, with no attributes, training or embeddings. Against a recursive feature engine at five levels of recursion, Omega-N wins on three and ties on two of the six in-domain evaluations, the sixth a declared null where every arm returns chance, with ten features against its 28 to 252 before pruning. Two statistics from the graph and labels, not from performance, partition the eight benchmarks without error, and the two they exclude are the two on which it loses. The strongest application is drug-target prioritisation on protein interaction networks: +0.032 to +0.103 AUPRC over a six-feature centrality battery and +0.084 to +0.208 over the four-feature one, across three constructions, replicated on an independent AP-MS network and label source (degree-matched: +0.0723 on STRING, +0.0560 on BioPlex, p=0.00195). Adding Omega-N to centralities plus Node2Vec changes nothing. The claim is narrow and it is the point: ten named features, computed without training, match or beat hand-crafted centralities and a recursive engine, and do not touch learned representations.
Read the full abstract

Social and Information Networks

From Propagation to Protection: Risk-Aware Diffusion for Harm Minimization in Signed Social Networks

Aaqib Zahoor, Janibul Bashir and Iqra Altaf Gillani

Real-world social relationships are not uniformly supportive. Information through hostile connections can increase resistance, anxiety, or misinformation rather than adoption. Classical models such as Independent Cascade and Linear Threshold, together with Influence Maximization (IM), which maximizes spread from a limited seed set, treat activation as discrete and irreversible. Its counterpart, Influence Minimization (Inf-Min), limits undesirable spread but similarly relies on simplified activation assumptions. Signed extensions incorporate polarity but largely retain this irreversibility, leaving no room for beliefs to weaken, reverse, or recover under competing influence. Moreover, both objectives typically treat individuals uniformly, without accounting for differences in vulnerability or prioritizing protection of those most at risk. We introduce RASH, a signed, susceptibility-aware diffusion model in which node awareness is continuous, bounded, and non-monotonic, and prove that despite this added expressiveness it remains monotone and {\gamma}-weakly submodular where only positive or negative edges exist, preserving tractable greedy approximation guarantees where strict submodularity provably fails. Building on RASH, we formulate Harm Minimization (HM), which maximizes aggregate reach while minimizing the awareness shortfall (harm). We prove HM is NP-hard, yet its harm-reduction formulation inherits the same monotonicity and weak-submodularity structure, admitting a greedy algorithm with a bounded approximation ratio. Across six structurally diverse signed networks, RASH is the only diffusion model tested to our knowledge that ever allows awareness to reverse after activation, letting sustained discouraging influence drive awareness from positive toward negative, and HM achieves the highest harm reduction of any method evaluated, including its own boundary cases (IM and Inf-Min)
Read the full abstract

Social and Information Networks

Beyond Truth Discovery: A Two-Stage Framework to Assess the Severity of False Claim during Disasters

Ruichen Yao, Tejna Dasari, Gulshat Baispay et al. (+5 more)

False information spreads rapidly on social media during disasters and can undermine emergency response efforts, public trust, and crisis communication. Existing research primarily focuses on determining whether social media posts contain false information, but provides limited insight into the specific false claims embedded within posts and the severity of individual false claims. To address the limitations, we propose a two-stage framework to assess the severity of false claims during disasters. In the first stage, we develop a false claim extraction agent that identifies false claims from multimodal social media posts containing text, images, videos, and links. A subsequent verification step validates extracted claims with supporting evidence. In the second stage, we define false claim severity as the combination of two complementary dimensions: believability, which determines the likelihood that a claim will be believed, and harmfulness, which captures the potential consequences if it is believed. Human annotators assess both dimensions to construct a claim-level severity benchmark using false claims extracted from Reddit posts related to hurricanes and wildfires. Building upon this benchmark, we investigate false claim severity assessment as a human-AI alignment problem, evaluating whether models can reproduce human judgments under a shared evaluation rubric rather than merely predicting severity labels. Experiments on the benchmark show that traditional supervised models exhibit limited alignment with human judgments, whereas Large Language Models (LLMs) achieve substantially stronger performance. Among the evaluated strategies, in-context learning consistently achieves the strongest alignment with human judgments, highlighting the importance of human examples and shared decision criteria for severity assessment.
Read the full abstract

All authors Ruichen Yao, Tejna Dasari, Gulshat Baispay, Aizhan Zaurbek, Yifan Liu, Yaokun Liu, Zelin Li, Dong Wang