Building Digital Societies as Ecosystems: How Recognition and Repeat Relationships Sustain Cross-Community Work in Open Source

• URL: http://arxiv.org/abs/2605.25055v1
• Date: Sun, 24 May 2026 13:04:24 GMT
• Title: Building Digital Societies as Ecosystems: How Recognition and Repeat Relationships Sustain Cross-Community Work in Open Source
• Abstract summary: We measure cross-boundary collaboration in an open-source software (OSS) ecosystem by reconstructing the bipartite contributor-repository graph of 464 cybersecurity projects and 11,372 contributors active over October 2001-May 2022.
• Score: 0.525685083367962
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We measure cross-boundary collaboration in an open-source software (OSS) ecosystem by reconstructing the bipartite contributor-repository graph of 464 cybersecurity projects and 11,372 contributors active over October 2001-May 2022 (Rawsec Cybersecurity Inventory). Louvain community detection identifies 163 non-singleton communities; per-community contributor count scales superlinearly with repository count (n_contributors ~ n_repos^1.4), and community formation follows a logistic trajectory saturating around 2018. Three patterns support a recognition/repeat-relationship account of cross-boundary work. First, cross-community work concentrates in a thin carrier layer: only nine canonical humans span seven or more communities at the commit level, authoring 14% of 4,015 inter-community merged pull requests; the top 50 cross-community contributors produce 54%. Second, boundary friction is a recognition cost, not a fixed boundary property: inter-community pull-request acceptance rises from 42% at breadth k=1 to 87% at k=5-9, with median latency compressing from 147 h to 49 h. Third, community survival is cohort-structured: per-cohort residualisation hazard rises an order of magnitude between pre-2010 and 2018 cohorts, and external community reach predicts survival mainly through size, leaving late cohorts under-served despite a stable carrier layer. The corpus predates mainstream LLM coding assistants; this baseline of carrier-layer thinness, friction gradient, and cohort hazard informs debates on social coding as a template for digital societies and on what AI-mediated OSS ecosystems should not optimise away.

Related papers

• Modality-Decoupled Federated Learning for Privacy-Preserving Embodied Intelligence in 6G [90.42669277637026]
  Sixth-generation (6G) wireless networks are expected to provide a key infrastructure for large-scale embodied intelligence.<n>This article proposes FedMVLA, a modality-decoupled FL framework for privacy-preserving embodied intelligence in 6G networks.
  arXiv  Detail & Related papers  (2026-09-09T01:36:44Z)
• SENTINEL-RL: Offloading Topological Reasoning from LLM Agents in the Security Operations Center [0.0]
  Sentinel-RL is an agentic-SOC architecture that decouples topological reasoning from semantic reasoning.<n>We instantiate the system on the LANL Comprehensive, Multi-Source Cyber-Security Events dataset and the Indiana University Quartz HPC cluster.
  arXiv  Detail & Related papers  (2026-09-03T17:49:12Z)
• From Social Coding to Agentic Coding: Productivity and Relational Reconfiguration in Open-Source Communities [5.037326192621355]
  Open-source software communities generate public knowledge and interpersonal relationships through visible collaboration.<n>We study this shift using an LLM-based multi-agent simulation with real GitHub data from 1,084 active developers.<n>Generative coding agents (CAs) are an advanced tool to improve development efficiency while shifting part of activities from public human interaction to private human-agent loops.
  arXiv  Detail & Related papers  (2026-08-04T12:41:32Z)
• Industry Classification of GitHub Repositories Using the North American Industry Classification System (NAICS) [46.877501276559165]
  GitHub hosts hundreds of millions of public repositories, but the platform exposes no native mapping from repositories to standardized industry sectors.<n>We present NAICS-GH, a publicly released corpus of 6,588 GitHub repositories drawn from source pools covering the United States, the European Union, and Australia.<n>Labels are produced by a retrieve-and-verify pipeline that combines BAAI/bge-large-en embeddings, FAISS retrieval, and GPT-4.1 scoring.
  arXiv  Detail & Related papers  (2026-07-07T17:06:32Z)
• SkillDAG: Self-Evolving Typed Skill Graphs for LLM Skill Selection at Scale [54.70985426016736]
  We present SkillDAG, which models inter-skill relationships as a typed directed graph.<n>Each search returns vector matches, typed-edge neighbors, and conflict signals, and a propose-then-commit protocol lets the agent register execution-backed edges.<n>On ALFWorld and SkillsBench with MiniMax-M2.7, SkillDAG reaches 67.1% success and 27.3% reward.
  arXiv  Detail & Related papers  (2026-06-02T02:45:21Z)
• ChipCraftBrain: Validation-First RTL Generation via Multi-Agent Orchestration [0.0]
  Multi-agent approaches such as MAGE reach 95.9% on VerilogEval yet remain untested on harder industrial benchmarks.<n>We present ChipCraftBrain, a framework combining symbolic-neural reasoning with adaptive multi-agent orchestration for automated RTL generation.
  arXiv  Detail & Related papers  (2026-04-21T17:20:24Z)
• Governance by Design: A Parsonian Institutional Architecture for Internet-Wide Agent Societies [0.2900810893770133]
  We argue that governing internet-wide agent societies requires institutional design, not merely risk enumeration or process compliance.<n>Applying Talcott Parsons' AGIL framework, we derive a prescriptive sixteen-cell institutional architecture for internet-wide agent governance.<n>We conclude with a prioritized roadmap for the missing governance infrastructure.
  arXiv  Detail & Related papers  (2026-04-13T11:37:46Z)
• Computational Foundations for Strategic Coopetition: Formalizing Sequential Interaction and Reciprocity [0.33985917934283577]
  Strategic coopetition in multi-stakeholder systems requires understanding how cooperation persists through time without binding contracts.<n>This technical report extends computational foundations for strategic coopetition to sequential interaction dynamics.
  arXiv  Detail & Related papers  (2026-03-29T19:16:20Z)
• Less is More: Robust Zero-Communication 3D Pursuit-Evasion via Representational Parsimony [7.6658082440595186]
  Asymmetric 3D pursuit-evasion in cluttered voxel environments is difficult under communication latency, partial observability, and nonholonomic maneuver limits.<n>We build on an inherited path-guided decentralized pursuit scaffold to improve communication-free coordination.<n>We show that explicitly severing redundant cross-agent channels can suppress compounding error cascades and improve robustness in latency-prone deployment.
  arXiv  Detail & Related papers  (2026-03-09T11:44:04Z)
• From Memorization to Creativity: LLM as a Designer of Novel Neural-Architectures [48.83701310501069]
  Large language models (LLMs) excel in program synthesis, yet their ability to autonomously navigate neural architecture design-balancing reliability, performance, and structural novelty--remains underexplored.<n>We address this by placing a code-oriented LLM within a closed-loop synthesis framework, analyzing its evolution over 22 supervised fine-tuning cycles.
  arXiv  Detail & Related papers  (2026-01-06T13:20:28Z)
• Shared Spatial Memory Through Predictive Coding [34.221039336567415]
  We introduce a multi-agent predictive coding framework that formulates coordination as the minimization of mutual uncertainty among agents.<n>At the foundation of this framework lies a grid-cell-like metric as internal spatial coding for self-localization.<n>Agents gradually develop a bandwidth-efficient communication mechanism and specialized neural populations that encode partners' locations.
  arXiv  Detail & Related papers  (2025-11-06T10:12:46Z)
• Eigen-1: Adaptive Multi-Agent Refinement with Monitor-Based RAG for Scientific Reasoning [53.45095336430027]
  We develop a unified framework that combines implicit retrieval and structured collaboration.<n>On Humanity's Last Exam (HLE) Bio/Chem Gold, our framework achieves 48.3% accuracy.<n>Results on SuperGPQA and TRQA confirm robustness across domains.
  arXiv  Detail & Related papers  (2025-09-25T14:05:55Z)
• Fundamental Limits of Hierarchical Secure Aggregation with Cyclic User Association [93.46811590752814]
  Hierarchical secure aggregation is motivated by federated learning (FL)<n>In this paper, we consider HSA with a cyclic association pattern where each user is connected to $B$ consecutive relays.<n>We propose an efficient aggregation scheme which includes a message design for the inputs inspired by gradient coding.
  arXiv  Detail & Related papers  (2025-03-06T15:53:37Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.