modelDNA: Calibrated Lineage Verification and Merge Decomposition from Sampled Weight Fingerprints

• URL: http://arxiv.org/abs/2607.10617v1
• Date: Sun, 12 Jul 2026 07:29:18 GMT
• Title: modelDNA: Calibrated Lineage Verification and Merge Decomposition from Sampled Weight Fingerprints
• Abstract summary: This report describes modelDNA, a tool that fingerprints a model from roughly 100-300 MB of ranged HTTP reads.<n>It compares the fingerprint against a reference database of foundation models across four published signal families.<n>It achieves AUROC 1.0, zero false positives at its reporting threshold, and 13/13 correct top-1 parent attribution.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The lineage graph of open-weight language models is self-reported: Hugging Face's base_model metadata field is optional and unverified, and over 60% of Hub models document no parentage at all. Methods for detecting lineage from weights exist in the research literature, but each ships as paper code tied to one signal and one experiment; when a provenance dispute breaks, the analysis is redone by hand. This report describes modelDNA, a tool that fingerprints a model from roughly 100-300 MB of ranged HTTP reads (instead of a full 15 GB download for a 7B model), compares the fingerprint against a reference database of foundation models across four published signal families, and returns one of eight verdict classes with a calibrated probability, preferring honest abstention to confident error. On a benchmark of 15 real Hub models with org-documented parentage, judged against 8 candidate bases (13 positives, 107 hard negatives), the system achieves AUROC 1.0, zero false positives at its reporting threshold, and 13/13 correct top-1 parent attribution. The report's second contribution is merge decomposition. Every mainstream weight-merging method is (near-)linear per tensor, and fingerprint sample positions are deterministic functions of tensor identity, so a merged model's fingerprint is the same linear combination of its parents' fingerprints. Mixture weights can therefore be recovered from fingerprints alone by sum-to-one constrained least squares. Against merges with published mergekit configurations as ground truth, the method recovers a slerp merge's layer-interpolation curves at r = 0.999 and a dare_ties merge's mixture weights to within 0.011 of the published values, without downloading any weights beyond the fingerprints. All fingerprints, benchmarks, and the inferred lineage graph of 55 models are public and reproducible offline.

Related papers

• Structured-Prior-Guided Diffusion Inpainting with Physical Consistency for Traffic Sign Augmentation [12.366721313845483]
  General-purpose inpainting models distort digits, deform geometry and perspective, and shift colours when applied directly to sign regions.<n>We propose a structured-prior-guided diffusion inpainting framework with physical consistency.<n>We train by self-supervised reconstruction on a large set of images collected in-house at AMAP, then evaluate zero-shot on the public TT100K-2021 dataset.
  arXiv  Detail & Related papers  (2026-09-02T09:22:23Z)
• Fingerprinting Text-to-Image Diffusion Models via Collapsed Generation [38.697895774925136]
  Collapsed generation is an intrinsic, model-dependent property of the learned generation process.<n>We show collapsed generation fingerprints can distinguish different source models with low confusion.<n>These fingerprints remain verifiable in fine-tuned derivatives and under common and adaptive model- or query-level obfuscations.
  arXiv  Detail & Related papers  (2026-08-12T07:12:38Z)
• TokenPrint: A Calibrated Token-Space Fingerprint for Language-Model Provenance [8.657685524975246]
  We introduce a training-free fingerprint based on the top-$k$ vocabulary projections of late hidden states elicited by 250 fixed knowledge probes.<n>We evaluate the method on 32 open-weight models from nine families (0.6B--32B) with documented relationships.
  arXiv  Detail & Related papers  (2026-08-08T13:56:39Z)
• One Token Is Enough: Fingerprinting and Verifying Large Language Models from Single-Token Output Distributions [0.0]
  API aggregators, resellers, and inference providers consume large language models (LLMs)<n>Existing identification techniques require long generated texts, token-level log-probabilities, adversarially crafted prompts, or the model owner's cooperation.<n>We define a behavioral fingerprint of an LLM as the empirical distribution of its answers to trivial one-word prompts.
  arXiv  Detail & Related papers  (2026-07-11T10:34:17Z)
• How Far Is Document Parsing from Solved? PureDocBench: A Source-TraceableBenchmark across Clean, Degraded, and Real-World Settings [56.70440596502351]
  The past year has seen over 20 open document parsing models, yet benchmarks almost exclusively on OmniDocBench.<n>We present PureDocBench, a benchmark thatrenders document images from HTML/CSS, covering 10 domains, 66 pages, and 1,475 pages.
  arXiv  Detail & Related papers  (2026-05-08T09:30:31Z)
• A Behavioral Fingerprint for Large Language Models: Provenance Tracking via Refusal Vectors [43.11304710234668]
  We introduce a novel fingerprinting framework that leverages the behavioral patterns induced by safety alignment.<n>In a large-scale identification task across 76 offspring models, our method achieves 100% accuracy in identifying the correct base model family.<n>We propose a theoretical framework to transform this private fingerprint into a publicly verifiable, privacy-preserving artifact.
  arXiv  Detail & Related papers  (2026-02-10T05:57:35Z)
• AWM: Accurate Weight-Matrix Fingerprint for Large Language Models [44.93519442566325]
  We propose a training-free fingerprinting method based on weight matrices.<n>We leverage the Linear Assignment Problem (LAP) and an unbiased Centered Kernel Alignment (CKA) similarity to neutralize the effects of parameter manipulations.<n>Our method demonstrates exceptional robustness against all six aforementioned post-training categories while exhibiting a near-zero risk of false positives.
  arXiv  Detail & Related papers  (2025-10-08T07:51:11Z)
• CLUE: Non-parametric Verification from Experience via Hidden-State Clustering [64.50919789875233]
  We show that correctness of a solution is encoded as a geometrically separable signature within the trajectory of hidden activations.<n>ClUE consistently outperforms LLM-as-a-judge baselines and matches or exceeds modern confidence-based methods in reranking candidates.
  arXiv  Detail & Related papers  (2025-10-02T02:14:33Z)
• SeedPrints: Fingerprints Can Even Tell Which Seed Your Large Language Model Was Trained From [65.75182441010327]
  We propose a stronger and more intrinsic notion of LLM fingerprinting: SeedPrints.<n>We show that untrained models exhibit reproducible token selection biases conditioned solely on their parameters.<n> Experiments on LLaMA-style and Qwen-style models show that SeedPrints achieves seed-level distinguishability and can provide birth-to-lifecycle identity verification akin to a biometric fingerprint.
  arXiv  Detail & Related papers  (2025-09-30T15:34:08Z)
• MathBode: Understanding LLM Reasoning with Dynamical Systems [0.0]
  We present MathBode, a dynamic diagnostic for mathematical reasoning in large language models (LLMs)<n>MathBode treats each parametric problem as a system: we drive a single parameter sinusoidally and fit first-harmonic responses of model outputs and exact solutions.<n>Across five closed-form families, the diagnostic surfaces systematic low-pass behavior and growing phase lag that accuracy alone obscures.
  arXiv  Detail & Related papers  (2025-09-27T06:06:36Z)
• Model Discovery and Graph Simulation: A Lightweight Gateway to Chaos Engineering [0.0]
  Chaos engineering reveals resilience risks but is expensive and operationally risky to run broadly and often.<n>We claim that a simple connectivity-only topological model can provide fast, low-risk availability estimates under fail-stop faults.
  arXiv  Detail & Related papers  (2025-06-12T10:59:28Z)
• MergePrint: Merge-Resistant Fingerprints for Robust Black-box Ownership Verification of Large Language Models [1.9249287163937978]
  We propose a novel fingerprinting method, MergePrint, to embed robust fingerprints capable of surviving model merging.<n> MergePrint enables black-box ownership verification, where owners only need to check if a model produces target outputs for specific fingerprint inputs.
  arXiv  Detail & Related papers  (2024-10-11T08:00:49Z)
• BUMP: A Benchmark of Unfaithful Minimal Pairs for Meta-Evaluation of Faithfulness Metrics [70.52570641514146]
  We present a benchmark of unfaithful minimal pairs (BUMP) BUMP is a dataset of 889 human-written, minimally different summary pairs. Unlike non-pair-based datasets, BUMP can be used to measure the consistency of metrics.
  arXiv  Detail & Related papers  (2022-12-20T02:17:30Z)
• Learnable Boundary Guided Adversarial Training [66.57846365425598]
  We use the model logits from one clean model to guide learning of another one robust model. We achieve new state-of-the-art robustness on CIFAR-100 without additional real or synthetic data.
  arXiv  Detail & Related papers  (2020-11-23T01:36:05Z)

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.