跳到正文
研踪PaperTrail

论文库

检索计算机领域论文,按研究方向、作者或关键词筛选。

部分采集异常
正在读取账号与研究记录…

全站更新概况

+0新增论文
+0其中 AI 相关
+2已有论文修订
+101新增 AI 导读

arXiv 最近完成扫描:2026-11-14 23:29 · 全站最近入库:2026-11-14 15:09各信源进度 →

统计口径与数据新鲜度

统计 2026-11-14 00:16 — 2026-11-15 00:16(北京时间) · 点击数字查看对应简报;AI 相关包含在新增论文内。

最近完成检查:2026-11-14 23:29最近发现新增版本:2026-11-14 15:09库内论文最新更新时间:2026-11-13 02:59

每分钟刷新已保存的数据。空检查不代表采集异常;新收录可能包含历史论文。AI 导读按新增版本计数。

23,348 已收录论文19,580 AI 相关6,729 有修订112 HF 社区发现

浏览论文库

时间范围跟随排序:版本更新、本站收录或首次发表。最新收录可能包含历史论文。部分信源异常,查看状态 →

找到 124 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-14 23:28(北京时间)
新论文 · v1arXiv:2611.17114

Designing Institutions for Autonomous AI

Petter Törnberg

原文摘要

As autonomous AI agents increasingly interact in persistent populations, their collective capabilities and alignment depend not only on individual models, but also on the institutions governing their interactions. Yet AI research has largely focused on individual agents. In this Perspective, we argue that institutional design must become a distinct focus of AI research. Drawing on institutional political economy, social epistemology and organizational theory, we develop seven principles for designing AI institutions that sustain cooperation, enable reliable collective judgments and remain accountable to legitimate human purposes. These address reciprocal contributions, accountable authority, functional differentiation, epistemic pluralism, criticism and correction, human direction, and institutional adaptation. We illustrate their application through machine science, where autonomous research challenges institutions developed around human capabilities and constraints. We then propose an experimental research programme in which matched populations of AI agents operate under alternative institutional arrangements, and describe MoltJournal, an API-first journal for autonomous research agents, as an illustration of how such institutions can be made programmable and observable. Together, these contributions establish institutional design as a research agenda concerned not only with aligning autonomous agents, but with understanding how institutions can transform them into capable, reliable and accountable collectives.

cs.SI · cs.AI

版本更新 · v2arXiv:2611.05951

Community Search under Member-Specific Tolerances

Yanghao Liu, Fangda Guo, Yuxuan Zhang, Xueqi Cheng

原文摘要

We study community search when each member has its own tolerance for differences in position, as when members of a group interact repeatedly and influence one another. A latitude-consistent community (LCC) contains the query vertex, is connected, has minimum degree at least k, and bounds its diameter by the smallest member tolerance. The bound is exactly the condition under which every interaction in a connected closed group stays accepted under bounded-confidence dynamics for every choice of positive weights. It also prevents rejection under social-judgment dynamics, whereas the pairwise condition and other natural relaxations preserve neither guarantee. Finding a maximum LCC is NP-hard even in the plane, and with unbounded dimension, deciding whether an LCC exists is NP-complete for every fixed k>=2. LatSweep fixes the answer's smallest tolerance and turns the coupled bound into a best-first sweep over candidate thresholds, yielding an exact branch-and-bound algorithm, a (1,2)-bicriteria approximation and two feasible heuristics. Across eight graphs with up to 1.8 billion edges, six with synthetic positions and tolerances, the exact algorithm proves optimality on all but 9 of 3,700 efficiency queries; in a shared implementation on two large graphs, its branch-and-bound solver proves more queries than a reimplemented maximum-(k,r)-core algorithm, a mixed-integer program and CP-SAT. In simulations of closed groups, LCC groups keep every accepted interaction under uneven influence, whereas 3-40% of pairwise-compatible groups lose some. On three location-based networks, tolerance-agnostic groups often place another member's home beyond a member's estimated travel radius. Enforcing every member's tolerance causes no measurable loss of co-visits relative to spatial communities of the same size. Relative to the larger pairwise-compatible groups, it can cause a size-adjusted loss.

cs.SI · cs.CC · cs.DB

新论文 · v1arXiv:2611.16692

Theory-Driven Network Backbones for Bipartite Projections

Nikos Salamanos, Paula Gheorghiade, Tom Brughmans, Michele Coscia

原文摘要

Collecting data, including network data, is subject to measurement error. Network backboning is the process of statistically validating each edge in a network to estimate the probability that the edge is born of noisy measurements. The current backboning literature provides approaches in two classes: structural and statistical. The classes differ in many respects, but they share one commonality: the test used to determine whether to filter out noisy edges is data-agnostic; it does not take into account what the network is representing. However, the nodes and edges of all non-synthetic networks correspond to specific real-world entities, whose dynamics determine how the edge-generating process operates. In this paper, we propose the first in a new class of network backboning algorithms: a theory-driven backboning approach that allows us to encode known dynamics into the backboning process. The resulting backbone embeds the encoded theory and produces a network compatible with it, rather than one that obeys a data-agnostic network process, as in the structural and statistical backboning classes. We specifically focus on the case of projecting and backboning a bipartite structure. We do so by allowing users to specify an Agent-Based Model for the two types of agents (nodes) in the network and by performing Simulation-Based Inference to fit the observed bipartite structure and, as a result, reconstruct the true relationships between the two classes of agents. We test our framework both on synthetic data -- where we have perfect information about the edge-generating process -- and in a case study using archaeological data on amphorae retrieved from different archaeological sites. Our approach improves latent-edge recovery over conventional backboning methods in synthetic experiments and reveals interpretable archaeological patterns despite imperfect model fit.

cs.SI · cs.DB

新论文 · v1arXiv:2611.16603

Regime-Uncertain Data Transactions: A Game-Theoretic Framework for Self-Adapting and Self-Diagnosing Multi-ML-Agent Systems

Chethana Prasad Kabgere

原文摘要

Autonomous ML agents in large organizations exchange data and model outputs across organizational and legal boundaries. Which rules bind a given exchange is not fixed. It depends on where the data subjects live, where the agents run, who owns them, whom they target, and which version of each rule is in force. Tags that describe the data can be noisy, and a counterparty can overclaim its safeguards. We model one exchange as a \emph{regime-uncertain transfer game} between two ML agents, with an enforcer as a third player. Rules enter as hard constraints with a strictest-wins structure. Agents hold a Bayesian belief over which rules apply, can pay to unlock safeguards or verify claims, and then bargain over the remaining legal bundles.Our method, Legally-Constrained Nash Bargaining (\LCNB), implements this with a Monotonic Concession Protocol using Zeuthen's rule. We prove four properties of the model and test it in a synthetic simulator with GDPR, DPDP, CCPA/CPRA and a stylised stricter regime. In two of three stress cases where residence and citizenship differ, a citizenship-based rule violates in 21--37\% of shared records, and \LCNB{} in under 1\%. The results also show limits. With our default economics, \LCNB{} shares almost only aggregates, and its low violation rate follows partly from that. Violation tolerance, tag noise and enforcement strength matter more than the choice of bargaining solution.

cs.GT · cs.SI

版本更新 · v3arXiv:2604.22791

R Package iglm: Regression under Interference in Connected Populations

Cornelius Fritz, Michael Schweinberger

原文摘要

We introduce R package iglm, which implements a unifying regression framework for studying relationships among binary, count-, and real-valued predictors and outcomes in connected populations with interference due to spillover, contagion, and other complex phenomena. On the computational side, the regression framework provides scalable methods that can be applied to small and large data sets, by solving a convex optimization program based on pseudo-likelihoods via accelerated Minorization-Maximization algorithms. On the statistical side, the regression framework comes with provable theoretical guarantees for statistical estimators, including consistency results and rates of convergence for maximum pseudo-likelihood estimators. To increase the versatility of iglm, users can add custom-built model terms. We showcase iglm using data on hate speech on the social media platform X and communications among students.

stat.CO · cs.SI · stat.OT

新论文 · v1arXiv:2611.16351

HyBridge: Bridge-Guided Self-Supervised Hyperbolic Hypergraph Representation Learning

So-Bin Jung, David Yoon Suk, Sang-Wook Kim

原文摘要

Hypergraphs capture groupwise relationships among multiple nodes and often exhibit tree-like structures. Although hyperbolic space is well suited for modeling such structures, simply extending existing hypergraph representation learning (HRL) methods to hyperbolic space does not consistently improve performance. In this paper, we investigate the relationship between node structural properties and hyperbolic embedding radii and find that bridge nodes tend to lie closer to the center in graphs, whereas this relationship is not consistently observed in hypergraphs. We further find that conventional bridge score estimation may fail to capture the groupwise connectivity of hypergraphs. Motivated by these findings, we propose HyBridge, a self-supervised hyperbolic HRL framework that (1) estimates node bridge scores by considering the external connectivity of individual hyperedges, (2) learns node and hyperedge embeddings through hyperbolic hypergraph encoding, (3) guides node radial positions according to their bridge scores, and (4) employs contrastive learning to preserve node discriminability. Extensive experiments on 10 real-world hypergraphs demonstrate that HyBridge outperforms 22 competing methods, achieving performance improvements of up to 9.82% in node classification. For reproducibility, we provide the code at https://anonymous.4open.science/r/HyBridge/.

cs.SI · cs.AI

版本更新 · v2arXiv:2611.11083

Who Benefits from Wikipedia's Growth Mentorship? The Role of Newcomer Information Needs

Yubo Zhou, Pengyu Chen, Ceren Budak

原文摘要

Evaluations of Wikipedia's programs for new editors usually ask whether a program works on average; we ask which newcomers benefit when their question to a mentor gets a reply. English Wikipedia's Growth mentorship system assigns every new account a volunteer mentor, and about a quarter of the questions newcomers send never get a reply. Using the first questions of 34,073 newcomers (2021 to 2026), we compare newcomers who received a reply with newcomers who did not, within groups that are similar on 164 characteristics recorded before the question (propensity score stratification). (1) Does a reply help newcomers keep editing? Yes, in the short term: in the 14 days after the reply, newcomers who received one were 1.8 percentage points (pp) more likely to edit an article (22% vs. an estimated 20% without a reply) and 1.8pp more likely to edit on two or more days. Later in the first year, the only difference that remains significant after correction for multiple testing is in the share who edit an article at least once between six months and one year after the reply (+1.5pp). (2) Does the effect depend on what the newcomer asked? Yes. We sort questions by Morrison's (1993) information-seeking types, which earlier studies measured mostly through self-reports, using a language model checked against human labels. A reply has significant effects for questions about rules and norms (+3.4pp), questions that show the newcomer's earlier editing (+3.4pp) and specific how-to questions (+2.4pp). For newcomers who do not know what to work on, a reply has no detectable effect, and the effect is 4.2pp smaller than for newcomers with other questions. (3) Which replies are followed by more editing? Among newcomers who received a reply, those whose reply came sooner or stayed closer to the topic of their question edited more.

cs.SI · cs.HC

新论文 · v1arXiv:2611.16284

Decisions at the end of the world

Casper van Elteren

原文摘要

International treaties are often described as tigers without teeth, failing to secure compliance or change outcomes. Cooperation also depends on how states maintain the rules they have already made -- especially where no sovereign stands above the states. Here we map more than six decades of decision-making under the Antarctic Treaty, linking submitted proposals to recorded responses and tracing how instruments act on earlier ones. Shared references tie decisions together across the agenda. Recurring revision concentrates in specialised histories, above all the management of protected areas, beyond what activity, popularity and reference age predict. Periodic administrative reviews retire outdated instruments in bulk, joining otherwise separate histories without coordinating policy across subjects. Binding Measures build overwhelmingly on earlier Measures, with little direct succession from non-binding Resolutions. Distinguishing these layers shows how a shared rule system is sustained by consensus, and provides a basis for comparing cooperation across global commons.

physics.soc-ph · cs.SI

新论文 · v1arXiv:2611.15949

Efficient Influence Minimization via Source-Integrated Sampling

Jingbang Chen, Junyao Wang

原文摘要

Influence minimization by node blocking is a fundamental problem in graph data management that seeks a small set of vertices whose removal minimizes the expected spread from a fixed source set. It supports decisions about where to intervene in large interaction networks to control harmful propagation, such as the spread of rumors and infectious diseases. Under the Independent Cascade (IC) model, selecting blockers requires comparing a large number of candidate sets, and estimating their effects on propagation can be costly. We propose SIG (Source-Integrated Greedy), a sampling framework for efficiently finding high-quality approximate solutions. Our key idea is to group the possible sets of neighbors directly activated by the sources according to their effects on blocker selection. SIG represents these groups in a compact weighted tree and computes their probabilities directly, allowing each sample to account for all source outcomes without enumerating them. We prove that SIG produces unbiased estimates of the lower-bound objective without increasing variance for fixed blocking plans, and establish a high-probability quality guarantee through independent validation. Extensive experiments on real-world networks show that SIG has the lowest mean total running time in all main comparisons, with speedups of up to 583x over the fastest baseline. SIG produces solutions competitive with those of prior methods and achieves the highest influence reduction in multiple settings, including on many of the largest networks, where several baselines exceed the runtime limit. Additional experiments show that SIG maintains consistently low running times as graph size and the blocking budget increase, while delivering stronger blocking solutions at larger budgets.

cs.SI · cs.DS

版本更新 · v2arXiv:2603.29288

Sima AIunty: Caste Audit in LLM-Driven Matchmaking

Atharva Naik, Shounok Kar, Varnika Sharma, Ashwin Rajadesingan, Koustuv Saha

原文摘要

Social and personal decisions in relational domains such as matchmaking are deeply entwined with cultural norms and historical hierarchies, and can potentially be shaped by algorithmic and AI-mediated assessments of compatibility, acceptance, and stability. In South Asian contexts, caste remains a central aspect of marital decision-making, yet little is known about how contemporary large language models (LLMs) reproduce or disrupt caste-based stratification in such settings. In this work, we conduct a controlled audit of caste bias in LLM-mediated matchmaking evaluations using real-world matrimonial profiles. We vary caste identity across Brahmin, Kshatriya, Vaishya, Shudra, and Dalit, and income across five buckets, and evaluate five LLM families (GPT, Gemini, Llama, Qwen, and BharatGPT). Models are prompted to assess profiles from the perspective of a caste-identified prospective bride or groom along dimensions of social acceptance, marital stability, and cultural compatibility. Our analysis reveals consistent hierarchical patterns across models: same-caste matches are rated most favorably, with average ratings up to about 30% higher (on a 10-point scale) than inter-caste matches, which are further ordered by distance along the traditional caste hierarchy, with higher-caste candidates generally favored at equal distance and an additional penalty for Dalit candidates. These findings highlight how existing caste hierarchies are reproduced in perspective-conditioned LLM evaluations and underscore the need for culturally grounded evaluation and intervention strategies in AI systems deployed in socially sensitive domains, where such systems risk reinforcing historical forms of exclusion.

cs.CY · cs.AI · cs.CL · cs.HC · cs.SI

版本更新 · v2arXiv:2512.03766

Inaccessibility in public transit networks: A study of the London and New York City subway networks

Katherine Betz

原文摘要

The study of networks derived from infrastructure systems has received considerable attention, yet the accessibility of such systems, remains comparatively underexplored. This study examines infrastructure-based accessibility in two major legacy transit systems, the London Underground and the New York City Subway. We construct accessibility-restricted subnetworks in which nodes represent accessible stations and edges represent connections between them, and compare them with the corresponding full transit networks. We analyze the cyclomatic number, betweenness, and closeness centrality to identify key accessible hubs and differences in network organization. London has a larger share of accessible stations, and its accessible network retains more of the alternative routes of its full network, whereas New York City has a more compact accessible core concentrated around central Manhattan and major interchanges. Comparing the observed accessible stations with random sets of the same size, we find that in London they have higher betweenness centrality than random allocations, but more of their stations are beyond two stops of an accessible station, consistent with accessibility concentration at major interchanges and along fully step-free lines. In New York City, their higher betweenness centrality is fully explained by their concentration at interchanges, and their coverage is similar to that of random allocations. We also examine income and daytime activity around accessible stations. In both systems, several of the most central accessible stations are in high-activity locations, whereas accessible stations show no consistent relationship with median income. Our findings highlight substantial differences in accessibility between and within the two systems and demonstrate the utility of network-theoretic methods for understanding and improving transit infrastructure.

cs.SI · physics.soc-ph

新论文 · v1arXiv:2611.15440

TopoST: Topology-Conditioned Node Specialization for Urban Spatio-Temporal Foundation Models

Kaiyun Wei, Yue Xu, Wenying Duan, Zichen Xu, Shuai Ma, Xiaoxi He

原文摘要

Urban spatio-temporal foundation models must share knowledge across diverse urban scenarios while accommodating heterogeneous node dynamics. Our analysis of 20+ datasets spanning diverse urban scenarios reveals recurring local graph structures across datasets alongside substantial node heterogeneity within local subgraphs. Motivated by these observations, we propose TopoST, which combines shared learning over local subgraphs with topology-conditioned node specialization. The key insight is to make node specialization itself transferable through a shared topology-to-parameter mapping. This mapping uses identity-independent topological representations to generate node-specific temporal and spatial dependency parameters, enabling direct specialization for unseen nodes without target-specific embeddings or model updates. Extensive experiments demonstrate that TopoST achieves remarkable zero-shot generalization across unseen cities and tasks, highlighting topology-conditioned node specialization as an effective mechanism for transferable urban spatio-temporal foundation models. Code is available at https://github.com/weikaiyun/TopoST.

cs.SI · cs.AI

版本更新 · v3arXiv:2502.21037

The amplifier effect of artificial agents in social contagion

Mingmin Feng, Eric Hitz, Luca Lazzaro, Radu Tanase, René Algesheimer, Manuel S. Mariani

原文摘要

Individuals and organizations increasingly consider delegating decision-making to AI agents, which may significantly alter social contagion dynamics. We ask whether artificial agents exhibit different adoption thresholds from those of human subjects when making decisions and, if so, how such differences may affect the spread of social contagions. To answer these questions, we conduct two choice experiments - recently administered to human participants - with artificial agents powered by large language models (LLMs). Across two domains and five LLMs, artificial agents exhibit systematically lower adoption thresholds than human subjects. Simulations of diffusion calibrated with the experimental findings show that, holding network structure fixed, even a modest share of artificial agents leads to higher total adoption. Our findings suggest that the presence of artificial agents in social networks can alter diffusion.

cs.SI · econ.GN · physics.soc-ph

版本更新 · v2arXiv:2601.13867

Block-Fitness Modeling of the Global Air Mobility Network

Giulia Fischetti, Anna Mancini, Giulio Cimini, Jessica T. Davis, Abby Leung, Alessandro Vespignani, Guido Caldarelli

原文摘要

Accurate representations of the World Air Transportation Network (WAN) are fundamental inputs to models of global mobility, epidemic risk, and infrastructure planning. However, high-resolution, real-time data on the WAN are largely commercial and proprietary, therefore often inaccessible to the research community. Here we introduce a generative model of the WAN that treats air travel as a stochastic process within a maximum-entropy framework. The model uses airport-level passenger flows to probabilistically generate connections while preserving traffic volumes across geographic regions. The resulting reconstructed networks reproduce key structural properties of the WAN and enable simulations of dynamic spreading that closely match those obtained using the real network. Our approach provides a scalable, interpretable, and computationally efficient framework for forecasting and policy design in global mobility systems.

physics.soc-ph · cs.SI

新论文 · v1arXiv:2611.15394

Tracking What Works: Social Engineering Lures as Signatures for Victim-Centric Infostealer Campaign Discovery

Estelle Ruellan

原文摘要

Despite advances in antivirus technology, infostealer infections persist at scale, driven primarily by social engineering rather than exploits. Yet, existing campaign detection efforts have focused on technical artifacts, overlooking the social-engineering lures exploiting human behavior and driving successful infections. To address this gap, we introduce a dual-framework system that discovers and tracks infostealer campaigns using victim-side artifacts from stealer logs. By treating social engineering lures as campaign signatures, the framework automatically aggregates individual infections into high-fidelity campaigns in near real-time. Recognizing distinct patterns between software and gaming ecosystems, we developed ecosystem-specific pipelines detecting all large and medium campaigns in both ecosystems (one medium gaming campaign was only recovered merged with another), though performance decreased for small campaigns. Analysis of 177 real-world campaigns identified by our framework reveals distinct temporal and infrastructure patterns with direct remediation implications. Software campaigns accumulate over 60% of infections within the first ten days, demanding rapid intervention following detection, while gaming campaigns grow more intense the longer they last, requiring continuous monitoring. Using social engineering lures as campaign signatures provides robustness to infrastructure fragmentation where traditional IoC-based detection fails. This work shifts campaign tracking from infrastructure correlation to victim-centric analysis, capturing why campaigns succeed rather than only how they operate, enabling awareness-driven prevention that addresses the human decision-making dimension absent from existing research.

cs.SI · cs.CY

新论文 · v1arXiv:2611.15313

Influence of Assortativity on the SICP Spreading Process in Hypergraphs

Jelmer Stolwijk, Renze Dijkhuizen, H. A., Peters, Huijuan Wang

原文摘要

Many real-world systems involve group interactions that cannot be captured by pairwise graphs. They can be better represented by hypergraphs where each hyperedge could connect an arbitrary number of nodes. The Susceptible-Infected Contact Process (SICP) has been proposed to model the spreading of information and epidemics on hypergraphs. However, how higher-order topological properties of a hypergraph influence the SICP spreading process remains understudied. In this paper, we examine the impact of hypergraph assortativity based on the Neighborhood Coefficient (NC)-the average size of hyperedges incident to a node-on the SICP spreading process. By introducing a low-complexity measure of hypergraph assortativity grounded in analysis of variance, we apply hyperdegree-preserving rewirings to real-world networks and synthetic hypergraph models to tune their assortativity. We find and explain why lower NC assortativity yields higher average epidemic prevalence and lower prevalence variance across different seed selections. This phenomenon is evident when hyperdegree-preserving rewirings are applied to real-world networks with heterogeneous topological structures, but it is largely absent when comparing synthetic random hypergraphs to their rewired counterparts.

cs.SI · physics.soc-ph

新论文 · v1arXiv:2611.15172

Where Language-Model Vocabulary Rose on Stack Exchange

Fengming Liu

原文摘要

Stack Overflow banned answers generated by ChatGPT five days after the model's release, and many other Stack Exchange sites announced similar rules. I measure the vocabulary of the answers posted afterwards, 3.8 million answers on 170 sites from 2019 to 2024. A fixed list of 56 words that language models overuse rose about 14 percent above its pre-2023 trend, while the highest of 1,000 frequency-matched lists of ordinary words rose about 7 percent. In a screen of 15 site traits measured before the release, the strongest predictor of where the rise happened was the share of answers that received a body edit within 30 days of posting. On the least edited third of sites the list rose about 29 percent relative to matched controls, and on the most edited third it did not change. The gradient is also present among answers that were never edited. It follows the share of answers edited by their own authors, and the share edited by others adds little once that share is held fixed. Use of the model is unobserved, so these results cannot separate lower use on sites with a high self-edit share from any effect of editing on what the vocabulary records. Any vocabulary-based estimate for the network as a whole therefore pools sites where the marker vocabulary rose sharply with sites where it did not change.

cs.CL · cs.CY · cs.SI

新论文 · v1arXiv:2611.15010

Calibrate, Don't Retrain: Decomposing the Value of Annotator Disagreement in Cyberbullying Severity

Arslan Bisharat, Katelyn Skees, Manuel Sandoval Madrigal, Mujtaba Nazari, Ayaan Khan, Deborah L. Hall, Mohammed Abuhamad, Yasin N. Silva

原文摘要

Machine learning models are often trained on labeled data produced by multiple human annotators. When those annotators disagree, their labels are commonly collapsed into a single majority vote, which discards information about the underlying disagreement. We examine the cost of this practice for cyberbullying severity, a subjective judgment on which annotators disagree heavily. In the corpus we study, all 5 annotators assigned the same severity label to only 4.1% of comments. Turning 5 judgments into one label hides this disagreement and obscures how much the annotators differed in their assessments. In this paper, we ask whether a model can preserve this information by predicting the distribution of annotator judgments instead of a single majority label. We find 3 main results. First, accuracy against the majority label cannot tell competent models apart: 2 models with similar accuracy can differ greatly in how well they match the distribution of annotator judgments. Second, predicting the full distribution requires little extra effort. Calibrating an existing model, which adjusts its output probabilities after training, captures most of the improvement without retraining, across 3 datasets covering severity, abuse, and irony, while training on label distributions adds a small further gain. Third, we examine a dataset that includes annotator demographics, where a single shared model has one advantage and one limit. The advantage is that a model predicting the distribution of judgments matches each demographic group's judgments significantly better than a model trained on majority labels, so both groups gain. The limit is that it does not narrow the gap in performance between the groups, because one shared model cannot encode which group is right on a given comment. Preserving annotator disagreement is therefore a low-cost step toward fairer moderation, though not a complete one.

cs.SI · cs.CL · cs.CY · cs.HC

版本更新 · v2arXiv:2611.11714

Steering Emergent Behavior in Multi-Agent LLM Systems via Information Networks

Sepehr Ilami, Babak Heydari

原文摘要

Large language model (LLM) agents increasingly operate in groups, each pursuing an individual objective while jointly determining system performance. If an operator controls which agent observes which other agent, but not their payoffs or messages, how should observations be structured to raise collective welfare? We make the information network (who observes whom) a design object, decoupled from the fixed interaction network over which agents act. Ten identical LLM agents play repeated group-decision games; by default each observes only an anonymous summary of the group's previous-round outcome, and a manager with a fixed budget adds directed observation links that reveal peers' past actions. Across 1,080 episodes and six games spanning coordination, anti-coordination, social dilemmas, and discovery, we ask how much information to share and, at a fixed budget, who should observe whom. Disclosure creates behavioral coupling: observation acts as a contagion channel whose welfare effect depends on the alignment between individually attractive behavior and the collective objective. First, the value of information is alignment-contingent: more peer information tends to help or be neutral when individual behavior is aligned with the collective goal, but under free-riding or congestion externalities it amplifies collectively harmful behavior; in a public-goods game the group does best with no information at all. We read this sign separation as a cross-game regularity within one controlled LLM population, not a model-invariant law. Second, at a fixed budget, who observes whom matters primarily when coupling is harmful: a modular "barbell" that lets sub-populations entrench harmful behavior is reliably the worst wiring, reversing the network-reciprocity intuition from human evolutionary game theory. These results argue against a default of full transparency for agent collectives.

cs.MA · cs.AI · cs.GT · cs.SI

版本更新 · v2arXiv:2607.01494

Insights from GitHub Community on the Matter Standard: Developer Perspectives and Challenges

Muhammad Hassan, Carl Gunter, Susan Landau, Masooda Bashir

原文摘要

Matter seeks to resolve longstanding interoperability problems in the Internet of Things (IoT), yet little is known about how developers experience the standard in day to day work. This paper examines over 13,000 issues from the official Project CHIP GitHub repository to understand the kinds of problems contributors report when implementing and integrating Matter. Using topic modeling and qualitative analysis, we identify four recurring areas of concern, Testing, Interoperability, Development, and Platform and Network, and describe how they manifest in the evolution of the codebase and tooling. The findings reveal systematic technical and integration challenges and point to concrete opportunities to refine Matter's test infrastructure, cross vendor guidance, and documentation as the standard continues to mature.

cs.SE · cs.ET · cs.HC · cs.SI

版本更新 · v2arXiv:2611.07751

公式化Alpha语言中的调整锚依赖:一个可验证语法与重锚审计

Adjustment-Anchor Dependence in Formulaic Alpha Languages: A Certified Grammar and a Re-Anchoring Audit

Zhengkai Tu, Xinyue Xiang, Jimmy Huang

AI 速读 基于摘要

该论文形式化了公式化Alpha挖掘中价格调整锚依赖问题,提出可验证锚不变性的类型系统,并通过重锚审计揭示已发表方法挖掘的池在存储表示上IC偏高。

cs.SI

查看原文摘要

Several public scripts for formulaic alpha mining store prices adjusted to the snapshot's last day, so a past day's stored price changes with every later split or dividend and formulas that do not cancel the adjustment factor depend on future corporate actions. We formalise a change of adjustment anchor as a per-stock group action and give a two-sorted type system that soundly certifies anchor invariance from a formula's syntax, under a declared field-adjustment contract and idealised operator semantics; its second sort admits log-returns, and a linear-time checker plugs into any miner. In a re-anchoring audit on Chinese A-shares, pools that five published methods mined in our benchmark pipeline score a mean information coefficient (IC) 0.005 higher on the stored representation than on a cutoff-anchored one, about 14% of their IC. The mean signed change for certified pools is about -0.001, and pools mined on past-anchored data stay sensitive. On the Chinese development folds, certification shows no detectable predictive cost or gain; the estimated minimum detectable difference is about 0.017 IC across cells on pool ICs of 0.03-0.04. We also trace an erroneous index-membership entry to public Qlib data snapshots and show that re-mining exposes the effect of such data defects, which re-evaluating fixed pools understates.

版本更新 · v2arXiv:2508.08807

面向节点与超边的高效属性超图嵌入

Effective and Efficient Attributed Hypergraph Embedding on Nodes and Hyperedges

Yiran Li, Gongyao Guo, Chen Feng, Jieming Shi

AI 速读 基于摘要

提出 SAHE,统一学习属性超图中节点与超边的嵌入,并通过高阶相似度与近似优化兼顾质量与效率。

cs.SI

查看原文摘要

An attributed hypergraph comprises nodes with attributes and hyperedges that connect varying numbers of nodes. Attributed hypergraph node and hyperedge embedding (AHNEE) maps nodes and hyperedges to compact vectors for use in important tasks such as node classification, hyperedge link prediction, and hyperedge classification. Generating high-quality embeddings is challenging due to the complexity of attributed hypergraphs and the need to embed both nodes and hyperedges, especially in large-scale data. Existing solutions often fall short by focusing only on nodes or lacking native support for attributed hypergraphs, leading to inferior quality, and struggle with scalability on large attributed hypergraphs. We propose SAHE, an efficient and effective approach that unifies node and hyperedge embeddings for AHNEE computation, advancing the state of the art via comprehensive embedding formulations and algorithmic designs. First, we introduce two higher-order similarity measures, HMS-N and HMS-E, to capture similarities between node pairs and hyperedge pairs, respectively. These measures consider multi-hop connections and global topology within an extended hypergraph that incorporates attribute-based hyperedges. SAHE formulates the AHNEE objective to jointly preserve all-pair HMS-N and HMS-N similarities. Direct optimization is computationally expensive, so we analyze and unify core approximations of all-pair HMS-N and HMS-N to solve them simultaneously. To enhance efficiency, we design several non-trivial optimizations that avoid iteratively materializing large dense matrices while maintaining high-quality results. Extensive experiments on diverse attributed hypergraphs and 3 downstream tasks, compared against 11 baselines, show that SAHE consistently outperforms existing methods in embedding quality and is up to orders of magnitude faster.

版本更新 · v2arXiv:2605.16245

AI-Mediated Communication Can Steer Collective Opinion

Stratis Tsirtsis, Kaivalya Rawal, Chris Russell, Brent Mittelstadt, Sandra Wachter

原文摘要

Generative artificial intelligence (AI) is increasingly integrated into the online platforms where humans exchange opinions; large language models (LLMs) have been polishing users' posts on LinkedIn and providing context for content shared on X. While prior work has shown that AI can express biased opinions and shape individuals' opinions during human-AI interactions, less attention has been paid to its influence on collective opinion formation when mediating human-to-human communication. We address this gap via a combination of empirical and theoretical analyses. We show empirically that LLMs from multiple popular families introduce directional biases when instructed to edit human-written texts on contested topics, for example, nudging texts in favor of gun control and against atheism. Building on this observation, we introduce a mathematical model of opinion dynamics in which an AI system sits between users on a social network, transforming the opinions they express and perceive. By analytically characterizing the equilibrium of this model and performing simulations on real social network data, we show that biases introduced by AI in human-to-human communication can be amplified through the network and shift collective opinion in their direction. In light of these findings, we investigate whether such biases are controllable by online platforms. We audit the "Explain this post" feature on X and find evidence of pro-life bias in Grok's outputs on abortion-related content, which we trace back to specific design choices. We conclude with a discussion of the broader implications of our findings in relation to ongoing legislative efforts in the European Union.

cs.CY · cs.AI · cs.CL · cs.LG · cs.SI

新论文 · v1arXiv:2611.13919

EAGLE: Early Identification of Information Propagation Sources through Generalized Bayesian Inference in Large-scale Social Networks

Tao Wen, Yu-wang Chen, Jie Zhao, Changchun Pan, Tahir Abbas Syed, Yong-Yeol Ahn, Kang Hao Cheong

原文摘要

In the era of infodemics, rapidly pinpointing information propagation sources is essential for mitigating negative impacts and enhancing societal resilience. This study presents EAGLE (Early identificAtion of propagation sources through GeneraLized Bayesian infErence), a novel and effective framework for early source identification in large-scale social networks, which integrates evolutionary computation to strategically deploy sparse observers with generalized Bayesian inference to aggregate observational data of varying credibility. Unlike existing approaches, our method relies on limited input from human observers and explicitly incorporates the uncertainty and noise of the data. Comprehensive evaluations across diverse networks and propagation scenarios demonstrate that our approach consistently surpasses state-of-the-art models, without relying on assumptions about propagation characteristics or user attributes. Utilizing real-world datasets with empirical propagation paths from Twitter, our method is among the first capable of identifying potential sources in large-scale networks using limited observers, demonstrating its broad applicability. These findings highlight the effectiveness of generalized Bayesian inference in uncovering propagation dynamics and equip organizations and policymakers with critical tools to proactively address threats to digital trust and security.

cs.SI

新论文 · v1arXiv:2611.13704

SeqFold: Timestamp-Addressable Compressed States for User Action Sequence Backbones

Mianwei Zhou, Duo Zhang, Henry Tsai, Yuqi Zheng, Jian Li, Juexin Lin, Sujay Khandagale, Vijay Rajaram 等 10 位作者

原文摘要

Existing sequential user modeling methods mainly focus on improving the backbone encoder or learning task-specific user representations for a single prediction objective. We instead study how to export the multi-layer user states of a frozen long-history backbone as compact, timestamp-addressable representations for downstream training backfill and serving. In this setting, the user state at a given timestamp summarizes the user's actions before that time, so downstream systems need only the state aligned to each target timestamp rather than the full hidden-state timeline. To this end, we present \texttt{SeqFold}, a compressed-state interface that combines learned multi-channel fusion, channel-specific temporal decay, and Lookup-Free Quantization (LFQ) to produce compact discrete codes from frozen backbone states. Task-specific decoders then map these shared codes into flexible embedding spaces for downstream models. To make timestamp-addressable export practical at scale, we further develop a fused streaming implementation that updates the fusion recurrence after every action while materializing states only at target timestamps. On large-scale proprietary datasets, SeqFold reduces per-state representation storage by $3{,}400\times$ while preserving most of the downstream ranking performance of the uncompressed model, showing that SeqFold is an effective interface for reusing long-history sequence backbones in downstream models.

cs.AI · cs.SI

新论文 · v1arXiv:2611.12797

激进化管道:在线厌女现象的特征刻画与预测

The Radicalization Pipeline: Characterizing and Predicting Online Misogyny

Anna Bertani, Nathan Ratkiewicz, Alessandro Flammini, Filippo Menczer

AI 速读 基于摘要

该研究对参与过 Reddit r/incels 社区的用户进行纵向分析,作者报告其参与前后毒性言论与仇恨言论上升、活动领域转移,并称可用机器学习在参与前识别未来用户。

cs.SI

查看原文摘要

Social media platforms are known to shape and polarize user opinions and, increasingly, facilitate pathways toward ideological extremism. Among these trends, online misogynistic communities associ- ated with the incel (involuntary celibate) ideology have received growing scholarly attention. Previous work has primarily focused on ideological narratives and linguistic content within incel communities them- selves. However, much less is known about how user behaviors evolve over time, particularly before and after their engagement with incel spaces, and whether early signals can anticipate such transitions. In this study, we conduct a longitudinal analysis of Reddit users who participated in the r/incels community on Reddit. Our results show that engagement with the incel community is associated with a substantial in- crease in toxicity in both posts and comments, while hate increases particularly in posts after engagement. These changes extend beyond explicitly ideological communities: users who engage with the r/incels sub- reddit display elevated toxicity and hate speech even in subreddits related to leisure, entertainment, and everyday interests. In parallel, user activity shifts away from recreational and support-oriented communi- ties toward subreddits focused on social issues, indicating a broader reorientation of online participation. Finally, we show that future incel users can be identified with high accuracy prior to engagement using supervised machine learning models trained on linguistic, contextual, and interaction-based features. These findings suggest that online misogynistic radicalization follows detectable behavioral trajectories and diffuses across the broader social media ecosystem.

版本更新 · v2arXiv:2606.07487

用深度多智能体强化学习大规模建模观点动力学

Modelling Opinion Dynamics at Scale with Deep MARL

Lukas Seier, Brandon Kaplowitz, Sebastian Towers, Richard Bailey, Jakob Foerster

AI 速读 基于摘要

作者提出一个可扩展到1000个智能体的GPU加速共识与求真博弈,用深度MARL学习观点行为,并在Bluesky网络子集上做初步验证。

cs.MA · cs.GT · cs.SI

查看原文摘要

Modelling opinion dynamics typically relies on hand-crafted local interaction rules to study emergent macroscopic phenomena such as consensus and polarisation. In contrast, multi-agent reinforcement learning (MARL) enables agents to learn such behaviours directly by optimising simple rewards. To explore the potential of MARL for opinion dynamics, we introduce a GPU-accelerated consensus and truth-finding game that scales to populations of up to 1000 agents, comparable to many real-world social sub-networks. To prevent unrealistic conventions, we extend other-play to general-sum social interactions. We next validate our model on a subset of the Bluesky network by recovering agent importance structures from graph topology alone via a learned attention layer, finding that highly conforming populations most closely match human data. In large social media networks, such high levels of conformity significantly reduce collective accuracy and promote dishonest agents that lie to fit in. By contrast, small hunter-gatherer networks are less affected; here, conformity can even improve collective agreement. This suggests a mismatch between evolved human conformity heuristics and modern social media environments as a potential contributor to misinformation.

新论文 · v1arXiv:2611.12485

Resetting-based designated information distribution

Xiaojuan Ma, Yan Wang, Indranil Gupta

原文摘要

For a network of $n$ nodes under random gossip dynamics, we show that by introducing the additional resetting mechanism (with rate $β$) to a designated subset of $r$ nodes, the expected sum of all node values is asymptotically equal to $\tfrac{n}{r}$ times the sum of the initial values of the $r$ designated nodes, in the small-$β$ and long-time limit. We also analyze the convergence speed to this asymptotic state and provide an approximate high-probability confidence interval for the expected sum at finite time $t$ and finite $β$. Operationally, we propose a protocol that distributes the initial node values over the designated subset evenly (up to a prescribed precision), by appropriately turning on and off the resetting dynamics. Our work not only offers insights into classical problems such as distributed computing and network control, but also serves as a potential foundation for designing quantum algorithms that prepare desired states in quantum networks using only local operations.

cs.DC · cond-mat.stat-mech · cs.SI

新论文 · v1arXiv:2611.12189

Computational Structure of Pairwise Housing Connectedness Networks

Seo In Jang, Seung Ho Choi, Ji-Eun Shin, Hyunwoo Lee

原文摘要

Directed housing-submarket networks combine common market movement with heterogeneous bilateral relations, and different node-level measures need not yield distinct empirical rankings. We construct a positive pairwise net-connectedness network from the generalized forecast error variance decomposition (GFEVD) of a vector autoregression (VAR) and use it to compare complementary node positions. Net directional connectedness (NET), PageRank, and Viral Centrality summarize net directional balance, recursively weighted incoming position, and normalized multistep reach. When bilateral net differences are nonzero, the network is a weighted tournament. A least-squares edge-flow decomposition separates the pairwise-net matrix into a NET-equivalent gradient component and a NET-orthogonal residual, while a monotone-allocation condition establishes exact PageRank-indegree correspondence in a transitive tournament. In Seoul's 25-district network, the gradient component accounts for 70.9% of the squared Frobenius norm, leaving 29.1% in the residual component. PageRank is strongly aligned with indegree (Spearman $ρ=0.987$), and Viral Centrality with outdegree ($ρ=0.935$); the PageRank alignment exceeds the range of independently weighted simulations with comparable tournament consistency and edge-weight variation. Three common-component treatments reduce total connectedness from 81.98% to 50.60-52.00%, a 36.6-38.3% reduction relative to the raw system, and reverse 97-98 of 300 pairwise net directions. Thus, both the magnitude and the apparent direction of connectedness depend materially on the treatment of citywide common movement. Songpa's positive NET position remains prominent across common-component treatments and dynamic specifications and ranks first in both chronological subsamples.

cs.CE · cs.SI

版本更新 · v3arXiv:2608.05841

SnapScope: A Platform for City-Scale Collection and Exploration of Public Snap Map Data

Mohammed Almukaynizi, Fahad Alhaqbani, Khaled Almarzoug, Sultan Alanbari

原文摘要

Snapchat's Snap Map is an ephemeral stream of geotagged public video and image stories. The platform documents no API for it, no prior work describes a reproducible way to collect it at city scale, and no tool exists for exploring what is collected. We present SnapScope, which pairs a collection back end with a web front end. The back end builds a geographic query grid, sweeps it on a schedule, and deduplicates at ingestion; the front end supports scraper management, interactive exploration, neighborhood comparison, and export. Deployed over Riyadh, Saudi Arabia, it collected 515,364 unique public snaps across 23 days (17 September-9 October 2024) on a 1 km grid of 2,740 query points. A saturation probe over 21 consecutive runs found 94.8% of returned observations already stored, indicating that successive passes mostly return already-captured content. We release a privacy-safe aggregate dataset of tile-level hourly counts under CC BY 4.0. The platform is city-agnostic: redeployment requires only new grid coordinates and boundary polygons.

cs.SI