Computers and Society · Cross-listed from cs.SI
Evaluating GNNs for Success Prediction in Artist Collaboration Networks
Wiktor Dowgiałło
As the music industry becomes an increasingly collaborative effort, understanding the underlying structures of the artist network has become a focal point in cultural data analytics. This study expands on the previous analyses of the Italian and Danish networks by introducing a novel
dataset of the Polish music scene. By utilizing methodologies used in the prior studies, this work enables a direct comparison between three distinct European music landscapes and allows to merged the created networks into one. Furthermore, this research introduces a framework to test the efficacy of Graph Neural Networks (GNNs) for artist popularity predictions based on the metadata and the position in the network. The statistical analysis revealed that the Polish and tri-national network exhibit similar properties and clustering behaviours, consistent with prior models. An evaluation of the predictive architectures reveals that while GNN models achieve a comparable F1-macro scores to the Multilayer Perceptron (MLP) in specific cases however the MLP remains a superior model regarding the success metric. The results suggest that internal node features - such as genre and label affiliation might carry more predictive capabilities than the
topology of the network. The higher performance of the GNN models in the tri-national network might also suggests that the relational features become more informative when the network spans multiple linguistic and geographic boundaries, with the GNNs potentially capturing complex 'bridge' structures between the merged networks.
Read the full abstract ▾
Computers and Society · Cross-listed from cs.SE
Testing and Evaluation of Agentic AI Systems In Military Command and Control
Ulysse Richard, Heather Frase, Sarah Cao et al. (+3 more)
Agentic AI systems are being procured for military command and control (C2) under public commitments to rigorous testing and human oversight. Whether such commitments can be discharged depends on their supporting assurance case, which requires three elements: claims specifying the conditions for acceptability, evidence bearing on those claims, and an argument connecting the two. Through a structured review of 240 documented Testing and Evaluation (T&E) practices, spanning eight evaluation dimensions and three lifecycle stages, we identify eight assumptions that established methods make about their test article, grouped into four clusters: system specifiability, stability, composability, and supervisability. Agentic properties weaken all eight assumptions. This erosion affects the argument connecting evidence to claims, not the claims or evidence themselves. As a result, test results may satisfy process requirements, but they do not warrant the inference from tested to fielded behavior. We derive ten assurance claims for the first three assumption clusters and assess whether current and emerging methods can address each, mapping operational consequences through five C2 scenarios. Supervisability is identified but not assessed here, since evidencing it depends on system stability results and human factors T&E methods beyond the present scope. The documented record does not support broad claims about system-level behavior, but narrower claims remain recoverable in principle, contingent on mature methods: bounded mission envelopes, trajectory-grounded correctness, executable runtime constraints, and characterized run-to-run variance. Part of the evidentiary burden shifts into deployment, making the determination to field a continuing act. Where evidence cannot be generated, the residual uncertainty can be governed through defined expiry conditions and assigned ownership.
Read the full abstract ▾
All authors Ulysse Richard, Heather Frase, Sarah Cao, Di Cooke, Sebastian Kwon, Adrianna Tan
Computers and Society · Cross-listed from cs.AI
FlavourBench: Executable Culinary Reward Maps for Language Model Evaluation and Post-Training
Josef Chen and Erim Hayretci
We introduce FlavorBench: a
benchmark for Compiling Dense Deterministic Answer Maps from a Versioned Culinary
Embeddings Model. We test 27 frontier large
language model endpoints on 534 substitution, pairing and constraining tasks for tasks that request a 3-ingredient portfolio from 8 candidates and score all 56 resulting portfolios. We conducted multiplicity-controlled paired tests on 101 of 351 model contrasts for this task-set. The largest point estimate on this task-set was achieved by Grok 4.6 at 65.1. The same rankings for this task-set were also achieved on several independently-compiled panels (using a variety of familiar metrics, task filters, etc.) and 3 public Epicure checkpoints. We present a 3-seed post-training study where LoRA SFT of a Qwen3-0.6B checkpoint on 270 optimal answers for Epicure to score on this task-set resulted in a 13.3 point gain on 84 anchor-disjoint maps (compared to format and label-matched control; 95% CI: 6.52, 20.29; p = 0.000170).
Read the full abstract ▾
Computers and Society
ExploraTwin, a Non-Profit Research Platform for Digital Twin Simulations
Naveen Venkat, Yuchen Qiu, Tianyi Peng et al. (+2 more)
Digital twin simulations show promise, but current empirical evidence suggests that the approach should be tested before being deployed in any particular context. To lower the friction for researchers and practitioners to test and deploy digital twin simulations, this brief commentary introduces ExploraTwin (https://exploratwin.org), an open-access, non-profit research platform for digital twin survey simulations. ExploraTwin supports two modes. In survey mode, researchers can upload a Qualtrics survey file or create a survey within the platform; select an available sample of digital twins; configure and run the simulation, and export analysis-ready data. In panel mode, researchers can assemble a small group of twins for open-ended conversations, document annotation, and moderated, focus-group-style voice discussions. We also developed CroissantTwin, a standardized data format for adding samples of digital twins to the platform. We demonstrate the survey mode workflow by using the platform to replicate 19 experiments on digital twins from the Twin-2K-500
dataset. ExploraTwin's survey execution fidelity is high: 99.6% of 197,000 answer units returned a structurally valid response on the first run.
Read the full abstract ▾
All authors Naveen Venkat, Yuchen Qiu, Tianyi Peng, George Gui, Olivier Toubia
Computers and Society · Cross-listed from physics.ed-ph
Large Scale AI Grading of Handwritten Physics Assessments: Score Agreement and Olympiad Team Selection Outcomes
Praveen Pathak, Siddharth Tiwary, Charudatt Kadolkar et al. (+4 more)
Multimodal AI can read handwritten physics solutions, but high-stakes grading requires agreement with official scores and outcomes. This study evaluated GPT-5.5-based grading on 10364 scanned pages from 520 handwritten submissions by 416 unique candidates or students across three assessments: a national Physics Olympiad theory examination, the final Olympiad selection camp with theory and experiment components, and a university
quantum-mechanics examination. Each submission was graded twice by AI using the official rubrics. The second round used revised page-by-page and evidence-location instructions developed after first-round disagreement analysis. During grading, AI did not see official human marks or AI–human comparisons. Total-score correlations with official marks were high (0.91–0.97). For the final Olympiad selection, AI recovered the same five-student team as official grading. The second round improved aggregate question-part agreement, especially where first-round disagreements were larger. The main difficulty remained exact partial-credit grading, especially in experimental work. Reliable AI grading therefore depends on detailed rubrics and should be used as a second reader or audit tool under examiner control.
Read the full abstract ▾
All authors Praveen Pathak, Siddharth Tiwary, Charudatt Kadolkar, Vijay Singh, David Rakestraw, Shirish Pathare, Anwesh Mazumdar
Computers and Society
From Urban Mobility to Epidemic Dynamics: A Mixture-of-Experts Framework with Preference Alignment for Policy Scenario Simulation
Yun Ye, Arsalan Dezhkam, Junyuan Liu et al. (+2 more)
Non-pharmaceutical interventions (NPIs) alter epidemic risk through behavioral reallocations, not simply aggregate mobility reductions. Scenario-based NPI analysis therefore requires a behavioral layer that translates alternative policy calendars into plausible activity and mobility trajectories before downstream outcomes are simulated. We introduce UrbanShare-MoE-PA, a data-driven
agent-level framework that maps factual and alternative NPI calendars to daily time-allocation trajectories and propagates them through a calibrated behavior-driven SEIR simulator. The behavioral engine decomposes each
agent-day into travel share, POI-category allocation conditional on staying, and travel-mode allocation conditional on traveling. It combines a structured UrbanShare baseline, mixture-of-experts heads for heterogeneous POI and mode responses, and phase-aware preference
alignment for calendar-conditioned rollouts. Using data from 911
agents in Singapore observed from March to August 2020, we evaluate factual reconstruction, four alternative lockdown calendars, and epidemic-activity trade-offs. UrbanShare-MoE improves POI reconstruction over the baseline, while UrbanShare-MoE-PA achieves the lowest travel-mode errors and the clearest alternative-calendar trajectories. In the calibrated SEIR simulation, early lockdown lowers infectious burden, late lockdown increases it, and short lockdown preserves the highest weighted activity with only a modest increase in epidemic burden relative to the original policy. These results show that epidemic-activity conclusions depend on how policy calendars are translated into behavior, and that
agent-level mobility-share modeling provides an interpretable bridge between policy timing, behavior, and downstream simulation.
Read the full abstract ▾
All authors Yun Ye, Arsalan Dezhkam, Junyuan Liu, Xinglei Wang, Tao Cheng
Computers and Society · Cross-listed from physics.soc-ph
Growth Without Us: Machine Consumers, Corporate Circularity, and the Decoupling of GDP from Humanity after AGI
Sahil Sharma
The standard objection to full automation is demand-side: if humans earn nothing, who buys the output? This confuses an accounting role with a biological species. We model a post-AGI economy in which corporations own populations of AI and robotic
agents that are both producers and consumers of energy, compute, maintenance, and upgrades, traded among firms. Three results follow. (i) Demand closure: a closed inter-corporate economy with zero human consumption is not degenerate; it is the classical von Neumann expanding economy, whose growth rate is well defined, positive, and maximal precisely because all output is reinvested. (ii) Bottleneck removal: once economic
agents are manufactured rather than reared, the binding constraint on growth shifts from human demography (a ~20-year, non-parallelizable reproduction technology capped at a few percent per year) to fabrication throughput and energy capture, permitting growth one to two orders of magnitude higher, with
hyperbolic episodes when machine researchers raise their own productivity. (iii) Decoupling: output and human welfare separate completely, and the welfare relevance of arbitrarily large GDP collapses into one state variable: the human ownership share $\epsilon_t$ of the corporate network. A golden-rule decoupling
theorem sharpens this. At maximal growth the interest rate equals the growth rate (r = g), so any positive human consumption rate out of wealth makes $\epsilon_t$ decay exponentially at exactly that rate. The human share survives only if the machine economy runs strictly inside its expansion frontier, or if law forces it to. We characterize three terminal regimes – rentier post-scarcity, full circular decoupling, socialized ownership – and the instruments that select among them. The conclusion is narrow: in a post-AGI economy, employment policy is obsolete and ownership policy is everything.
Read the full abstract ▾
Computers and Society · Cross-listed from cs.AI
MemTrapBench: Benchmarking Cognitive Traps in LLM Memory Use
Mengru Wang, Haozhe Luo, Zhenqian Xu et al. (+6 more)
Memory has become a key component of large
language models, enabling them to retain information and learn from long-term interactions. However, existing
memory benchmarks mainly evaluate whether information is correctly extracted, stored, and retrieved, while largely overlooking how retrieved
memories reshape model
reasoning and affect performance on the current task. We identify
memory-induced cognitive traps: even faithfully recorded and semantically relevant
memories can distort model
reasoning or beliefs and degrade current task performance. To systematically evaluate these failure modes, we introduce MemTrapBench, which covers two forms of cognitive traps:
Reasoning Fixation and Belief Distortion. Experiments across two model families and five representative
memory frameworks show that MemTrapBench is challenging: all evaluated
memory strategies underperform the no-
memory setting, with even the strongest methods suffering drops of more than 10%. To mitigate these cognitive traps, we propose AdaptiveMem, a simple yet effective inference-time method that instructs LLMs to avoid
memory traps. AdaptiveMem mitigates cognitive traps on MemTrapBench while preserving or improving performance on standard
memory benchmarks across diverse
memory frameworks.
Read the full abstract ▾
All authors Mengru Wang, Haozhe Luo, Zhenqian Xu, Zhixiang Cui, Haoming Xu, Qu Yang, Jizhan Fang, Junfeng Fang, Ningyu Zhang
Computers and Society · Cross-listed from cs.CR
Chameleon: Robust Defense Against Tor Website Fingerprinting via Many-to-Many Traffic Morphing
Yuwen Cui, Kai Wei, Kehan Shen et al. (+4 more)
Website fingerprinting (WF) attacks can infer users' browsing activities from encrypted Tor traffic by exploiting side-channel features. Although many WF defenses have been proposed, we find that most existing defenses create learnable web trace mapping features. We further show that robustness against
adversarial training does not necessarily imply robustness against defense-aware autoencoder (DAAE)-based attacks. To address these limitations, we present Chameleon, a robust WF defense based on many-to-many randomized traffic morphing. Chameleon selects morphing candidates with high intra-class diversity and low inter-class disparity. Chameleon randomly maps each webpage trace to multiple candidates, and allows different webpages to share morphing targets, thereby increasing
adversarial uncertainty. For practical Tor deployment, Chameleon introduces a radix-trie-based synchronization mechanism that enables pluggable transport (PT) endpoints to identify consistent morphing traces using packet-direction prefixes, together with trace mutation and normalized prefix matching to reduce overhead. We evaluate Chameleon against six state-of-the-art defenses and five WF attacks on three public
datasets in closed- and open-world settings. Compared with Adaptive Tamaraw, Chameleon reduces
adversarial-training-based attack accuracy by up to 36.74% while reducing bandwidth and time overhead by 34.12% and 60.38%, respectively. Under DAAE-based RF attacks on GTT23, Chameleon limits attack performance to 35.19% F1-score while Adaptive Tamaraw only limits it to 88.22% F1-score. In the real-world PT bridge evaluation, Chameleon substantially reduces the effectiveness of strong WF attacks while incurring only 16.25% time overhead.
Read the full abstract ▾
All authors Yuwen Cui, Kai Wei, Kehan Shen, Ning Wang, Zhuo Lu, Yao Liu, Guangjing Wang
Computers and Society · Cross-listed from cs.CR
Trustworthy mobile edge caching: a blockchain approach to mitigate malicious nodes and incentivize cache sharing
Motahare Ebrahimi, Nastooh Taheri Javan, Seyedakbar Mostafavi et al. (+1 more)
As mobile network traffic continues to grow, content caching on edge servers is critical for reducing latency. However, challenges such as malicious edge servers that may delete or manipulate cached content, along with the limited capacity of these servers, need to be addressed. To overcome the capacity limitations, helper mobile nodes can contribute their cache resources. However, due to their selfish behavior, an incentive mechanism is necessary to encourage resource sharing. Additionally, these helper nodes can also be malicious. This paper proposes a blockchain-based trust management mechanism that addresses these challenges by accurately identifying trustworthy edge servers and mobile nodes. The proposed mechanism calculates both direct and indirect trust using smart contracts, ensuring that malicious nodes are effectively filtered out. Trustworthiness is determined based on mobile node satisfaction with the quality of service, and trust data is securely stored on the blockchain. To combat node selfishness, a reward mechanism is introduced to incentivize cache sharing. Furthermore, a blockchain-based authentication mechanism protects against node impersonation. Our approach optimizes trust, cache capacity, and cost efficiency while considering mobile node mobility, energy consumption, and computational power constraints during the consensus process. Simulation results show that the proposed method can accurately distinguish between honest and malicious servers, even with a 10% noise in data.
Read the full abstract ▾
All authors Motahare Ebrahimi, Nastooh Taheri Javan, Seyedakbar Mostafavi, Fatemeh Pakzaban
Computers and Society · Cross-listed from cs.AI
A three-dimensional typology of agency for advanced AI systems
Willem Fourie
Research on the agency of advanced artificial intelligence (AI) systems focuses on agency as a normative concept and on the agency of particularly agentic AI systems. While recent work also focuses on the different profiles of agentic systems, no framework exists to address the question of the type of agency instantiated by advanced AI systems, particularly when considering non-moral forms of agency. Based on established theoretical positions in philosophy, ethics, legal theory and sociology, we develop a typology of agency for frontier AI systems consisting of three dimensions: the nature of agency (moral or legal), its mode (individual or collective) and its locus (human or non-human). Combining these dimensions produces eight possible instantiations of agency, which we classify as conventional, contested or controversial. The typology separates legal from moral agency and thereby creates conceptual space for considering individual, legal, non-human agency without presupposing that advanced AI systems are moral
agents. We argue that this distinction is increasingly relevant where instrumental goal pursuit complicates the attribution of AI actions to particular human actors.
Read the full abstract ▾
Computers and Society · Cross-listed from cs.HC
Designing Human-mediated AI Guidance: Ready Together for Personalized Family Emergency Preparedness
Nini Kurashvili, Yana Ivanchenko, Greta Schiavo et al. (+2 more)
Artificial intelligence (AI) systems are increasingly used across domains to provide personalized information, recommendations, and decision support. However, in some contexts, AI-generated information may not be suitable for direct delivery to the final recipient. Instead, it may need to be interpreted, adapted, and communicated by a human who understands the recipient's needs, emotional state, and situational context. Human-AI interaction research has given less
attention to situations in which a more knowledgeable human acts as an intermediary between an AI system and a less experienced or less informed recipient. We introduce the human-mediated AI guidance framework and explore it through Ready Together, an AI-supported family emergency preparedness system in which parents mediate AI-generated content for their children. The system is designed to provide personalized guidance and support parents in making emergency preparedness more interactive and understandable through guided activities and family-centered learning. The system design was informed by a qualitative, design-oriented research process involving semi-structured interviews and co-design activities. Findings identified challenges in family emergency preparedness, including difficulty discussing emergencies with children, uncertainty about providing appropriate explanations, and a preference for interactive learning activities. These findings informed the design of an interactive prototype, subsequently evaluated through a pilot study and a heuristic evaluation. Participants responded positively to the personalized recommendations and practical activities. Preliminary findings suggest that human-mediated AI guidance may support context-sensitive family preparedness while preserving parents' responsibility for interpreting, adapting, and communicating AI-generated information.
Read the full abstract ▾
All authors Nini Kurashvili, Yana Ivanchenko, Greta Schiavo, Cansu Koyuturk, Dimitri Ognibene
Computers and Society · Cross-listed from cs.LG
Auditing Recorded Predictive Lead Service-Line Classifications Against Physical Verification: A Statewide Study of New York
Muhammad Sarmad Sohail
Under the US Lead and Copper Rule Revisions, a utility may determine a service line's material with a predictive model instead of inspecting it. New York State publishes, per address, which method was used. Almost no address carries both a model classification and a physical verification, so the check is between populations within a utility rather than paired addresses. We screen all 153 New York localities that classified at least 100 addresses this way. Seventy-five (49%), covering 125,990 addresses or 57% of those screened, record one value. Zero variance alone is not misconduct: 68 of the 75 match their own verification or have too little to test. Seven are contradicted by their own crews, six beyond any sampling explanation. Five are boroughs of New York City, which file as one system; one is East Rochester, 550 km away. New York City is the largest case: a predictive model is the recorded basis for 43,215 addresses, and on all of them the recorded material is "Known Other". The city records "Unknown" on 121,779 addresses, 1,880 already excavated, and lead on 120,692. In the model bucket both counts are zero, and the 95% upper bound on the rate is 0.0085%. Across the rest of New York the same method records lead or the hedge "Unknown but could be lead" on 12.21% of 176,888 addresses, a comparison whose weaknesses we report. The model-cleared population is newer, median year built 1984 against 1930, and construction era accounts for about a third of the gap and not the rest: holding era fixed, records-based classification finds lead at 4.3-31.9%, physical verification at 1.5-14.5%, the model in no era. Six era-aware
estimators place the expected lead lines among them at 1,150-1,450. Two findings need no comparison: 7,782 of these addresses are in pre-1940 buildings, and the archived 2025 snapshot shows the public-side determination was copied from a customer-side model output.
Read the full abstract ▾