{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:AVYX74M7QB6UASGVPFJM7RADFX","short_pith_number":"pith:AVYX74M7","schema_version":"1.0","canonical_sha256":"05717ff19f807d4048d57952cfc4032dfa072bf49732ab3f13cb7f60ae8cfb4a","source":{"kind":"arxiv","id":"2310.16789","version":3},"attestation_state":"computed","paper":{"title":"Detecting Pretraining Data from Large Language Models","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Min-K% Prob detects if text was in an LLM's pretraining data by averaging the lowest-probability tokens.","cross_cats":["cs.CR","cs.LG"],"primary_cat":"cs.CL","authors_text":"Anirudh Ajith, Danqi Chen, Daogao Liu, Luke Zettlemoyer, Mengzhou Xia, Terra Blevins, Weijia Shi, Yangsibo Huang","submitted_at":"2023-10-25T17:21:23Z","abstract_excerpt":"Although large language models (LLMs) are widely deployed, the data used to train them is rarely disclosed. Given the incredible scale of this data, up to trillions of tokens, it is all but certain that it includes potentially problematic text such as copyrighted materials, personally identifiable information, and test data for widely reported reference benchmarks. However, we currently have no way to know which data of these types is included or in what proportions. In this paper, we study the pretraining data detection problem: given a piece of text and black-box access to an LLM without kno"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":true,"formal_links_present":false},"canonical_record":{"source":{"id":"2310.16789","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2023-10-25T17:21:23Z","cross_cats_sorted":["cs.CR","cs.LG"],"title_canon_sha256":"eab3e6f8bd1ab37ec5727705f226b4a49b4c5d1b21a3097644eb670981474e65","abstract_canon_sha256":"c0edcfe54c48ba8be05af857532100278a4dad7c829824b0fd3ffbd5584273ec"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:38:13.447891Z","signature_b64":"YiGnw1vUnKo9G85xBdtxfQ/JiQg4os6tle9cTxsFYdf67aLj51O97Gj4IYd0U42om5vikFlJdpHf7kQi7S1qAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"05717ff19f807d4048d57952cfc4032dfa072bf49732ab3f13cb7f60ae8cfb4a","last_reissued_at":"2026-05-17T23:38:13.446899Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:38:13.446899Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Detecting Pretraining Data from Large Language Models","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Min-K% Prob detects if text was in an LLM's pretraining data by averaging the lowest-probability tokens.","cross_cats":["cs.CR","cs.LG"],"primary_cat":"cs.CL","authors_text":"Anirudh Ajith, Danqi Chen, Daogao Liu, Luke Zettlemoyer, Mengzhou Xia, Terra Blevins, Weijia Shi, Yangsibo Huang","submitted_at":"2023-10-25T17:21:23Z","abstract_excerpt":"Although large language models (LLMs) are widely deployed, the data used to train them is rarely disclosed. Given the incredible scale of this data, up to trillions of tokens, it is all but certain that it includes potentially problematic text such as copyrighted materials, personally identifiable information, and test data for widely reported reference benchmarks. However, we currently have no way to know which data of these types is included or in what proportions. In this paper, we study the pretraining data detection problem: given a piece of text and black-box access to an LLM without kno"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"Min-K% Prob achieves a 7.4% improvement on WIKIMIA over these previous methods. We apply Min-K% Prob to three real-world scenarios, copyrighted book detection, contaminated downstream example detection and privacy auditing of machine unlearning, and find it a consistently effective solution.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"An unseen example is likely to contain a few outlier words with low probabilities under the LLM, while a seen example is less likely to have words with such low probabilities.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Min-K% Prob detects pretraining data in LLMs by flagging outlier low-probability words in text, achieving 7.4% better performance than prior methods on the new WIKIMIA benchmark.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Min-K% Prob detects if text was in an LLM's pretraining data by averaging the lowest-probability tokens.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"cbeff4c1f9e7685aa941265fdbac4461889b75aa027e8579a4782975078bd432"},"source":{"id":"2310.16789","kind":"arxiv","version":3},"verdict":{"id":"78a240a8-5928-4796-90b4-4f4a5990df5c","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-17T18:01:57.778273Z","strongest_claim":"Min-K% Prob achieves a 7.4% improvement on WIKIMIA over these previous methods. We apply Min-K% Prob to three real-world scenarios, copyrighted book detection, contaminated downstream example detection and privacy auditing of machine unlearning, and find it a consistently effective solution.","one_line_summary":"Min-K% Prob detects pretraining data in LLMs by flagging outlier low-probability words in text, achieving 7.4% better performance than prior methods on the new WIKIMIA benchmark.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"An unseen example is likely to contain a few outlier words with low probabilities under the LLM, while a seen example is less likely to have words with such low probabilities.","pith_extraction_headline":"Min-K% Prob detects if text was in an LLM's pretraining data by averaging the lowest-probability tokens."},"references":{"count":130,"sample":[{"doi":"","year":2020,"title":"Stability of stochastic gradient descent on nonsmooth convex losses","work_id":"4c7008d6-92a6-49e9-8b4d-63cdeff75cf0","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2023,"title":"Pythia: A suite for analyzing large language models across training and scaling","work_id":"f0f0e465-e8ac-4001-9e07-e6720a687022","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2022,"title":"S., Purohit, S., Reynolds, L., Tow, J., Wang, B., and Weinbach, S","work_id":"168a55d5-675d-49cf-be47-a17ee8cd742e","ref_index":3,"cited_arxiv_id":"2204.06745","is_internal_anchor":true},{"doi":"","year":2021,"title":"Machine unlearning","work_id":"4d425956-f000-49d7-9d36-97aa726d7a61","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1901,"title":"Language models are few-shot learners","work_id":"6c597039-6bb7-4ed9-9d83-5c66c8dfa4d6","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":130,"snapshot_sha256":"d902b7528a369d6a69e1ba7de7a4aa893b3b9ca3ab21ede50001a7c3980f3010","internal_anchors":7},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2310.16789","created_at":"2026-05-17T23:38:13.447035+00:00"},{"alias_kind":"arxiv_version","alias_value":"2310.16789v3","created_at":"2026-05-17T23:38:13.447035+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.16789","created_at":"2026-05-17T23:38:13.447035+00:00"},{"alias_kind":"pith_short_12","alias_value":"AVYX74M7QB6U","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_16","alias_value":"AVYX74M7QB6UASGV","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_8","alias_value":"AVYX74M7","created_at":"2026-05-18T12:33:33.725879+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":20,"internal_anchor_count":20,"sample":[{"citing_arxiv_id":"2509.14594","citing_title":"SynBench: A Benchmark for Differentially Private Text Generation","ref_index":39,"is_internal_anchor":true},{"citing_arxiv_id":"2406.11794","citing_title":"DataComp-LM: In search of the next generation of training sets for language models","ref_index":164,"is_internal_anchor":true},{"citing_arxiv_id":"2501.18837","citing_title":"Constitutional Classifiers: Defending against Universal Jailbreaks across Thousands of Hours of Red Teaming","ref_index":4,"is_internal_anchor":true},{"citing_arxiv_id":"2511.14045","citing_title":"Auditing Data Membership in Reinforcement Learning With Verifiable Rewards","ref_index":23,"is_internal_anchor":true},{"citing_arxiv_id":"2404.05868","citing_title":"Negative Preference Optimization: From Catastrophic Collapse to Effective Unlearning","ref_index":20,"is_internal_anchor":true},{"citing_arxiv_id":"2401.06121","citing_title":"TOFU: A Task of Fictitious Unlearning for LLMs","ref_index":32,"is_internal_anchor":true},{"citing_arxiv_id":"2605.14591","citing_title":"Privacy Auditing with Zero (0) Training Run","ref_index":34,"is_internal_anchor":true},{"citing_arxiv_id":"2605.12574","citing_title":"DistractMIA: Black-Box Membership Inference on Vision-Language Models via Semantic Distraction","ref_index":22,"is_internal_anchor":true},{"citing_arxiv_id":"2604.03199","citing_title":"Learning the Signature of Memorization in Autoregressive Language Models","ref_index":19,"is_internal_anchor":true},{"citing_arxiv_id":"2605.12382","citing_title":"Pretraining Exposure Explains Popularity Judgments in Large Language Models","ref_index":21,"is_internal_anchor":true},{"citing_arxiv_id":"2604.23338","citing_title":"A Systematic Survey of Security Threats and Defenses in LLM-Based AI Agents: A Layered Attack Surface Framework","ref_index":69,"is_internal_anchor":true},{"citing_arxiv_id":"2605.00553","citing_title":"Stable-GFlowNet: Toward Diverse and Robust LLM Red-Teaming via Contrastive Trajectory Balance","ref_index":42,"is_internal_anchor":true},{"citing_arxiv_id":"2605.00364","citing_title":"Unlearning What Matters: Token-Level Attribution for Precise Language Model Unlearning","ref_index":15,"is_internal_anchor":true},{"citing_arxiv_id":"2604.07650","citing_title":"How Independent are Large Language Models? A Statistical Framework for Auditing Behavioral Entanglement and Reweighting Verifier Ensembles","ref_index":16,"is_internal_anchor":true},{"citing_arxiv_id":"2604.07825","citing_title":"Filling the Gaps: Selective Knowledge Augmentation for LLM Recommenders","ref_index":48,"is_internal_anchor":true},{"citing_arxiv_id":"2605.06865","citing_title":"Dataset Watermarking for Closed LLMs with Provable Detection","ref_index":15,"is_internal_anchor":true},{"citing_arxiv_id":"2403.07974","citing_title":"LiveCodeBench: Holistic and Contamination Free Evaluation of Large Language Models for Code","ref_index":219,"is_internal_anchor":true},{"citing_arxiv_id":"2604.17396","citing_title":"Representation-Guided Parameter-Efficient LLM Unlearning","ref_index":108,"is_internal_anchor":true},{"citing_arxiv_id":"2604.17771","citing_title":"SPENCE: A Syntactic Probe for Detecting Contamination in NL2SQL Benchmarks","ref_index":14,"is_internal_anchor":true},{"citing_arxiv_id":"2604.20932","citing_title":"Adaptive Defense Orchestration for RAG: A Sentinel-Strategist Architecture against Multi-Vector Attacks","ref_index":29,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/AVYX74M7QB6UASGVPFJM7RADFX","json":"https://pith.science/pith/AVYX74M7QB6UASGVPFJM7RADFX.json","graph_json":"https://pith.science/api/pith-number/AVYX74M7QB6UASGVPFJM7RADFX/graph.json","events_json":"https://pith.science/api/pith-number/AVYX74M7QB6UASGVPFJM7RADFX/events.json","paper":"https://pith.science/paper/AVYX74M7"},"agent_actions":{"view_html":"https://pith.science/pith/AVYX74M7QB6UASGVPFJM7RADFX","download_json":"https://pith.science/pith/AVYX74M7QB6UASGVPFJM7RADFX.json","view_paper":"https://pith.science/paper/AVYX74M7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2310.16789&json=true","fetch_graph":"https://pith.science/api/pith-number/AVYX74M7QB6UASGVPFJM7RADFX/graph.json","fetch_events":"https://pith.science/api/pith-number/AVYX74M7QB6UASGVPFJM7RADFX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AVYX74M7QB6UASGVPFJM7RADFX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AVYX74M7QB6UASGVPFJM7RADFX/action/storage_attestation","attest_author":"https://pith.science/pith/AVYX74M7QB6UASGVPFJM7RADFX/action/author_attestation","sign_citation":"https://pith.science/pith/AVYX74M7QB6UASGVPFJM7RADFX/action/citation_signature","submit_replication":"https://pith.science/pith/AVYX74M7QB6UASGVPFJM7RADFX/action/replication_record"}},"created_at":"2026-05-17T23:38:13.447035+00:00","updated_at":"2026-05-17T23:38:13.447035+00:00"}