[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"doc-detail-85234-en":3,"doc-seo-85234-105":30,"detail-sidebar-cat-0-en-105":91},{"code":4,"msg":5,"data":6},0,"success",{"doc_id":7,"user_id":8,"nickname":9,"user_avatar":10,"doc_module":4,"category_id":11,"category_name":12,"doc_title":13,"doc_description":14,"doc_content":15,"file_id":16,"file_url":17,"file_type":18,"file_size":19,"view_count":20,"is_deleted":4,"is_public":21,"is_downloadable":21,"audit_status":21,"page_count":22,"language":23,"language_code":24,"site_id":25,"html_lang":24,"table_of_contents":26,"faqs":27,"seo_title":13,"seo_description":14,"update_tm":28,"read_time":29},85234,13056703019662,"Evangeline","https://ap-avatar.wpscdn.com/avatar/be000253a8e92610077?_k=1778726343310543188",8,"Research & Report","modelDNA：基于采样权重指纹的校准谱系验证与合并分解","Open-weight language model lineage is often self-reported: Hugging Face’s base_model metadata is optional and frequently absent, making provenance disputes hard to resolve and forcing manual re-analysis. modelDNA fingerprints a model using only ~100–300MB of HTTP byte-range reads, compares it to a reference database across four signal families, and outputs one of eight calibrated verdicts with abstention to avoid false accusations. On 15 Hub models with org-documented ancestry, it reaches AUROC 1.0 and correct top-1 attribution. It also derives merge decomposition by recovering mixture weights from fingerprints via constrained least squares. Fingerprints, benchmarks, and an inferred lineage graph for 55 models are publicly reproducible offline.","modelDNA: Calibrated Lineage Verification and Merge Decomposition from Sampled Weight Fingerprints Muhammad Awais Bin Adil · SaadAamir  \nIndependent · [binadilawais@gmail.com](binadilawais@gmail.com) · [saadaamir473@gmail.com](saadaamir473@gmail.com)[ ](saadaamir473@gmail.com)[v1.0](v1.0), July 2026  \nCode: [https://github.com/AwaisAdilKhokhar/modelDNA](https://github.com/AwaisAdilKhokhar/modelDNA) · Live scanner:  \n[https://huggingface.co/spaces/AwaisAdilKhokhar/modelDNA](https://huggingface.co/spaces/AwaisAdilKhokhar/modelDNA) · Data: [https://huggingface.co/datasets/AwaisAdilKhokhar/modeldna-atlas](https://huggingface.co/datasets/AwaisAdilKhokhar/modeldna-atlas)  \nAbstract  \nThe 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](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, which is algebraically a well-conditioned regression in task-vector space. 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.  \n1. Introduction  \nHugging Face hosts nearly three million model repositories (2 . 9M as of July 2026), and the graph of who fine-tuned whom is almost entirely on the honor system. The base_model metadata field is optional, unverified, and frequently absent: Horwitz et al. [5], building their Model Atlas, measured that more than 60% of Hub models carry no documented parentage, and had to manually inspect the largest connected components of their own dataset just to fill in missing values. Hugging Face itself ran a volunteer sprint asking the community to open metadata PRs by hand.  \nThis matters beyond bookkeeping. Three well-documented incidents shaped this project. In July 2025, an anonymous group published an analysis showing a 0.927 correlation between the per-layer  \nattention-projection standard-deviation curves of Huawei’s Pangu Pro MoE and Alibaba’s Qwen2 . 5-14B, against an unrelated-pair background of roughly 0.3-0.7 [1]; Huawei denied derivation, the analysis repo was taken down, and the dispute ran in the international press with no neutral party able to rerun the numbers. In September 2024, Reflection-70B was marketed as a breakthrough fine-tune until community weight-diffing showed the claims didn’t hold up. In June 2024, the Llama3-V project was shown to be substantially copied from MiniCPM-Llama3-V 2.5. In each case the i","cbCaiinGlfaa2kbs","https://ap.wps.com/l/cbCaiinGlfaa2kbs","pdf",363508,3,1,13,"English","en",105,"# Introduction\n## Lineage metadata limitations\n## Why lineage disputes matter\n## Existing methods and the missing tool\n## Design asymmetry: avoiding false accusations\n# Contributions\n## Fingerprint design based on published signal families\n## Calibrated verdict engine with abstention\n## Merge decomposition from fingerprints","[{\"question\":\"modelDNA如何在不完整下载权重的情况下对模型进行指纹识别？\",\"answer\":\"modelDNA通过约100–300MB的HTTP字节范围读取生成指纹，而不是下载完整的7B权重。指纹采样位置由确定性函数生成，从而保证不同模型之间可直接比较。\"},{\"question\":\"当证据不足时，modelDNA如何避免错误指控？\",\"answer\":\"系统采用保守阈值与“弃权区间”，并在输出时提供校准概率。背景分布用于对缺失证据进行不偏倚处理，优先选择诚实弃权以降低误报风险。\"},{\"question\":\"modelDNA的合并分解（merge decomposition）方法依赖什么关键性质？\",\"answer\":\"主流权重合并对每个张量近似线性；同时指纹采样位置是张量身份的确定函数。因此，合并模型的指纹等于父模型指纹的同一线性组合，可用满足和为1约束的最小二乘在指纹空间回归合并混合权重。\"}]",1784201906,33,{"code":4,"msg":31,"data":32},"ok",{"site_id":25,"language":24,"slug":33,"title":13,"keywords":34,"description":14,"schema_data":35,"social_meta":86,"head_meta":88,"extra_data":90,"updated_unix":28},"modeldna-calibrated-lineage-verification-and-merge-decomposition-from-sampled-weight-fingerprints","",{"@graph":36,"@context":85},[37,53,68],{"@type":38,"itemListElement":39},"BreadcrumbList",[40,44,48,50],{"item":41,"name":42,"@type":43,"position":21},"https://docshare.wps.com","Home","ListItem",{"item":45,"name":46,"@type":43,"position":47},"https://docshare.wps.com/document/","Document",2,{"item":49,"name":12,"@type":43,"position":20},"https://docshare.wps.com/document/research-report/",{"item":51,"name":13,"@type":43,"position":52},"https://docshare.wps.com/document/modeldna-calibrated-lineage-verification-and-merge-decomposition-from-sampled-weight-fingerprints/85234/",4,{"url":51,"name":13,"@type":54,"author":55,"headline":13,"publisher":57,"fileFormat":60,"inLanguage":24,"description":14,"dateModified":61,"datePublished":62,"encodingFormat":60,"isAccessibleForFree":63,"interactionStatistic":64},"DigitalDocument",{"name":9,"@type":56},"Person",{"url":41,"name":58,"@type":59},"DocShare","Organization","application/pdf","2026-07-23","2026-07-16",true,{"@type":65,"interactionType":66,"userInteractionCount":20},"InteractionCounter",{"@type":67},"ViewAction",{"@type":69,"mainEntity":70},"FAQPage",[71,77,81],{"name":72,"@type":73,"acceptedAnswer":74},"modelDNA如何在不完整下载权重的情况下对模型进行指纹识别？","Question",{"text":75,"@type":76},"modelDNA通过约100–300MB的HTTP字节范围读取生成指纹，而不是下载完整的7B权重。指纹采样位置由确定性函数生成，从而保证不同模型之间可直接比较。","Answer",{"name":78,"@type":73,"acceptedAnswer":79},"当证据不足时，modelDNA如何避免错误指控？",{"text":80,"@type":76},"系统采用保守阈值与“弃权区间”，并在输出时提供校准概率。背景分布用于对缺失证据进行不偏倚处理，优先选择诚实弃权以降低误报风险。",{"name":82,"@type":73,"acceptedAnswer":83},"modelDNA的合并分解（merge decomposition）方法依赖什么关键性质？",{"text":84,"@type":76},"主流权重合并对每个张量近似线性；同时指纹采样位置是张量身份的确定函数。因此，合并模型的指纹等于父模型指纹的同一线性组合，可用满足和为1约束的最小二乘在指纹空间回归合并混合权重。","https://schema.org",{"og:url":51,"og:type":87,"og:title":13,"og:site_name":58,"og:description":14},"article",{"robots":89,"canonical":51},"index,follow",{"doc_id":7,"site_id":25},{"code":4,"msg":5,"data":92},[93,97,101,105,110,115,120,123,128,131,135],{"id":21,"doc_module":4,"doc_module_name":46,"category_name":94,"show_sort_weight":95,"slug":96},"Story & Novel",90,"story-novel",{"id":47,"doc_module":4,"doc_module_name":46,"category_name":98,"show_sort_weight":99,"slug":100},"Literature",80,"literature",{"id":52,"doc_module":4,"doc_module_name":46,"category_name":102,"show_sort_weight":103,"slug":104},"Exam",70,"exam",{"id":106,"doc_module":4,"doc_module_name":46,"category_name":107,"show_sort_weight":108,"slug":109},5,"Comic",60,"comic",{"id":111,"doc_module":4,"doc_module_name":46,"category_name":112,"show_sort_weight":113,"slug":114},6,"Technology",50,"technology",{"id":116,"doc_module":4,"doc_module_name":46,"category_name":117,"show_sort_weight":118,"slug":119},7,"Healthcare",40,"healthcare",{"id":11,"doc_module":4,"doc_module_name":46,"category_name":12,"show_sort_weight":121,"slug":122},30,"research-report",{"id":124,"doc_module":4,"doc_module_name":46,"category_name":125,"show_sort_weight":126,"slug":127},9,"Religion & Spirituality",20,"religion-spirituality",{"id":126,"doc_module":4,"doc_module_name":46,"category_name":129,"show_sort_weight":126,"slug":130},"World Cup","world-cup",{"id":132,"doc_module":4,"doc_module_name":46,"category_name":133,"show_sort_weight":132,"slug":134},10,"Lifestyle","lifestyle",{"id":136,"doc_module":4,"doc_module_name":46,"category_name":137,"show_sort_weight":106,"slug":138},19,"General","general"]