Deforking the World of Code: A Project-Provenance Map that Recovers Cross-Forge Fork Families that Platform Graphs Cannot See

• URL: http://arxiv.org/abs/2606.29550v2
• Date: Thu, 02 Jul 2026 18:44:22 GMT
• Title: Deforking the World of Code: A Project-Provenance Map that Recovers Cross-Forge Fork Families that Platform Graphs Cannot See
• Abstract summary: We release a curated deforking map for the World of Code (WoC) version V2604: p2PFull.<n>It collapses every raw repository p into the deforked project P to which it belongs.<n>We validate the map against GitHub's declared fork graph reconstructed from GH ForkEvents.
• Score: 2.788646205877688
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Forks share git history, so a commit surfaces in many repositories and any spread- or popularity-based measure over raw repositories is inflated by orders of magnitude. We release a curated deforking map for the World of Code (WoC) version V2604: p2PFull, which collapses every raw repository p into the deforked project P to which it belongs, built from the global shared-commit relation (51.79M shared-commit groups) via a hub-node star encoding and parallel Louvain clustering, plus capped variants (cap250/cap500) that bound mega-cluster size. The naive shared-history union over-merges: the project graph welds unrelated software into giant clusters (largest uncapped cluster 861,948 repositories, bridged by shared-commit groups as large as 267,200), for the same structural reason author-identity graphs do. A cheap size cap removes the boilerplate-hub bridges; a structural-bridge diagnostic, the cut that dissolved the analogous author mega-cluster, run here but deliberately not applied, shows the post-cap residual is genuine vendored history, robust to the cut, so we leave it intact. We validate the map against GitHub's declared fork graph reconstructed from GHArchive ForkEvents, finding 99.01% edge agreement conditional on both repositories being in WoC. Disagreements fall into two classes: a completeness byproduct (edges GitHub asserts but WoC has not ingested) and the central contribution, WoC-only fork families that GitHub's platform graph cannot represent, including 5.41% multi-forge families and 1.51% whose fork root is not on GitHub. We additionally release a refreshed fork-exclusion list (134.1M children, 3.4x the GHTorrent-era 39.5M) and a detached-fork inventory (455,550 hard-detached edges; 240,441 genuine independent origins). All artifacts are a self-contained, independently hosted replication package keyed to the WoC V2604 collection.

Related papers

• GRAND-HC: Graph-Refined Author Name Disambiguation [58.02589236670033]
  From-Scratch Name Disambiguation (SND) groups papers sharing an ambiguous name into clusters of distinct real-world authors.<n>We propose textbfGRAND-HC, a complete end-to-end SND framework.
  arXiv  Detail & Related papers  (2026-08-24T08:21:28Z)
• More Structure, Not More Capacity: Object-Centric Representations for Visuomotor Imitation Learning [54.65906330923846]
  We show that object-centric slot representations are a structured alternative to pre-trained vision models.<n>A dense patch grid with 16x the tokens performs no better than the global feature.<n>An explicit 2D spatial goal and native-resolution rendering raises the full system to 68.7$pm$4.2%, just below a privileged 3D-oracle upper bound.
  arXiv  Detail & Related papers  (2026-07-10T10:35:24Z)
• Scaling Author Identity Disambiguation to the World of Code: A Methodology [2.788646205877688]
  We describe the methodology used to alias the World of Code (WoC) collection (version V2604, 107M distinct author strings over 6B commits) into canonical persons.<n>At this scale the central problem is over-merge, not missed merges.<n>We report the full experimental record (more than twenty experiments, including unsuccessful ones) behind the deployed design.
  arXiv  Detail & Related papers  (2026-07-08T02:30:26Z)
• Claimed or Attested? A Commit-Signature Dataset and Identity Trust Tiers across the World of Code [2.788646205877688]
  We release the first commit-signature axis for the World of Code (WoC)<n>Over the V2604 corpus of 5,866,595,698 commits, 17.59% carry a signature.<n>All artifacts are released as a self-contained, in dependently hosted replication package keyed to the WoC V2604 collection.
  arXiv  Detail & Related papers  (2026-07-07T12:19:25Z)
• A Global Author-Identity Map for the World of Code:62.7M Developer Identities from 106.8M Author Strings over 5.87B Commits [2.788646205877688]
  We release a curated author-identity map for World of Code (WoC) version V2604 covering all 5,866,595,698 commits.<n>The map is mega-cluster free, its largest cluster 6,910 ids (one GitHub noreply identity), and it resolves 73.5% of six billion commits into multi-id identities.<n>We report both error families, splitting and clumping, and show the high precision claimed by global-scale union maps can be an artifact of never measuring the conflated region.
  arXiv  Detail & Related papers  (2026-07-07T12:09:45Z)
• Was It Never Collected, or Rewritten Away? A Commit-Provenance Dataset Separating Ingestion Gaps from Upstream History Edits across the World of Code [2.788646205877688]
  We release a commit-provenance dataset that separates missing commits at scale.<n>Over 1,118,116,350 advertised commits, 53.35% are present in World of Code (WoC)<n>About one missing-commit case in fifteen is a rewrite the project erased, not a mirror gap.
  arXiv  Detail & Related papers  (2026-07-02T21:12:43Z)
• Fractional Verkle Trees: A Hypertree Decomposition and Verified Proof Serialization Architecture for High-Performance Blockchain State Accumulators [0.0]
  We present Fractional Verkle Trees (FVT), a hypertree serialization decomposition global state into N independent sub-accumulators coordinated by a Merkle commitment tree.<n> Benchmarks on Apple M1 Pro show 57% heap allocation reduction (566,760 to 242,004 bytes per 10K$), parallel insertion at 2,433 ns/op, and network-wide elimination of 4.85 PB/year across 6,000 full nodes.
  arXiv  Detail & Related papers  (2026-06-15T07:16:07Z)
• CommitDistill: A Lightweight Knowledge-Centric Memory Layer for Software Repositories [0.5872014229110213]
  Software accumulate large amounts of unstructured knowledge in commit messages, pull-request discussions, and issue threads.<n>Recent work on typed-memory architectures for agents (MemGPT, generative agents, and the PlugMem module of Yang et al.) argues that agent memory should be distilled, typed knowledge rather than raw interaction text.<n>We adapt that stance to a software repository's own git history under a constrained regime: deterministic, dependency-free, local-only, no embeddings.
  arXiv  Detail & Related papers  (2026-05-18T12:14:28Z)
• What's Inside a GitHub Repository? An Empirical Study on the Contents of 10K Projects [1.439946676159516]
  This paper presents an initial empirical analysis to better understand the contents of real-world GitHub.<n>We analyze the files, directories, and extensions present in 10,000 GitHub repositories, as well as their evolution over ten years.
  arXiv  Detail & Related papers  (2026-05-15T23:30:44Z)
• Mapping Text to Multiplex Graph: Prompt Compression as Lévy Walk-Guided Graph Pruning [55.43705665875779]
  RAGP formulates prompt compression as Redundancy-Aware Graph Pruning on a multiplex graph.<n> Experiments on LongBench show that RAGP achieves an average score of 49.3 under a 4x compression ratio.
  arXiv  Detail & Related papers  (2026-05-04T01:41:31Z)
• Weaponizing the Commons: A Taxonomy and Detection Framework of Abuse on GitHub [31.618034402766018]
  GitHub plays a critical role in modern software supply chains, making its security an important research concern.<n>Existing studies have primarily focused on CI/CD automation, collaboration patterns, and community management, while abuse behaviors on GitHub have received little systematic investigation.<n>In this paper, we systematically review and summarize reported GitHub abuse behaviors and conduct an empirical analysis of publicly available abuse cases.<n>Based on this investigation, we propose a comprehensive taxonomy that characterizes their diverse symptoms and root causes from a software security perspective.
  arXiv  Detail & Related papers  (2026-04-20T07:37:03Z)
• SwingArena: Competitive Programming Arena for Long-context GitHub Issue Solving [90.32201622392137]
  We present SwingArena, a competitive evaluation framework for Large Language Models (LLMs)<n>Unlike traditional static benchmarks, SwingArena models the collaborative process of software by pairing LLMs as iterations, who generate patches, and reviewers, who create test cases and verify the patches through continuous integration (CI) pipelines.
  arXiv  Detail & Related papers  (2025-05-29T18:28:02Z)
• Unveiling A Hidden Risk: Exposing Educational but Malicious Repositories in GitHub [0.0]
  We use ChatGPT to understand and annotate the content published in software repositories. We carry out a systematic study on a collection of 35.2K GitHub repositories claimed to be created for educational purposes only.
  arXiv  Detail & Related papers  (2024-03-07T11:36:09Z)
• Generative and Contrastive Paradigms Are Complementary for Graph Self-Supervised Learning [56.45977379288308]
  Masked autoencoder (MAE) learns to reconstruct masked graph edges or node features. Contrastive Learning (CL) maximizes the similarity between augmented views of the same graph. We propose graph contrastive masked autoencoder (GCMAE) framework to unify MAE and CL.
  arXiv  Detail & Related papers  (2023-10-24T05:06:06Z)
• Dink-Net: Neural Clustering on Large Graphs [59.10189693120368]
  A deep graph clustering method (Dink-Net) is proposed with the idea of dilation and shrink. By discriminating nodes, whether being corrupted by augmentations, representations are learned in a self-supervised manner. The clustering distribution is optimized by minimizing the proposed cluster dilation loss and cluster shrink loss. Compared to the runner-up, Dink-Net 9.62% achieves NMI improvement on the ogbn-papers100M dataset with 111 million nodes and 1.6 billion edges.
  arXiv  Detail & Related papers  (2023-05-28T15:33:24Z)
• 1st Place Solution of The Robust Vision Challenge (RVC) 2022 Semantic Segmentation Track [67.56316745239629]
  This report describes the winning solution to the semantic segmentation task of the Robust Vision Challenge on ECCV 2022. Our method adopts the FAN-B-Hybrid model as the encoder and uses Segformer as the segmentation framework. The proposed method could serve as a strong baseline for the multi-domain segmentation task and benefit future works.
  arXiv  Detail & Related papers  (2022-10-23T20:52:22Z)

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.