{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:YLLMPMNI4BCYUHXQCBZJF53VXN","short_pith_number":"pith:YLLMPMNI","schema_version":"1.0","canonical_sha256":"c2d6c7b1a8e0458a1ef0107292f775bb7cd8f31bebf9dc4443e67cc15d83557e","source":{"kind":"arxiv","id":"2411.06611","version":2},"attestation_state":"computed","paper":{"title":"vTune: Verifiable Fine-Tuning for LLMs Through Backdooring","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.AI","cs.CY"],"primary_cat":"cs.LG","authors_text":"Akilesh Potti, Arka Pal, Eva Zhang, Micah Goldblum","submitted_at":"2024-11-10T22:08:37Z","abstract_excerpt":"As fine-tuning large language models (LLMs) becomes increasingly prevalent, users often rely on third-party services with limited visibility into their fine-tuning processes. This lack of transparency raises the question: how do consumers verify that fine-tuning services are performed correctly? For instance, a service provider could claim to fine-tune a model for each user, yet simply send all users back the same base model. To address this issue, we propose vTune, a simple method that uses a small number of backdoor data points added to the training data to provide a statistical test for ver"},"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":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2411.06611","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LG","submitted_at":"2024-11-10T22:08:37Z","cross_cats_sorted":["cs.AI","cs.CY"],"title_canon_sha256":"09764bef7d8fa29252135ce51f9e1c893172a59324cbdf45523b83ea149f913d","abstract_canon_sha256":"facca3a1a591a836b56cce4afb2cbc5be40715b52b8a01326ce952891e203aad"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:34:22.830595Z","signature_b64":"ucBZ2FXJf6Kj2qm+cFubBQEUhXtIpHtrK086hPbAvfUG+fB40sD3xfPl4+ItbU40UZHnTJIwXVOBzuyHz+N8AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c2d6c7b1a8e0458a1ef0107292f775bb7cd8f31bebf9dc4443e67cc15d83557e","last_reissued_at":"2026-07-05T09:34:22.830089Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:34:22.830089Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"vTune: Verifiable Fine-Tuning for LLMs Through Backdooring","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.AI","cs.CY"],"primary_cat":"cs.LG","authors_text":"Akilesh Potti, Arka Pal, Eva Zhang, Micah Goldblum","submitted_at":"2024-11-10T22:08:37Z","abstract_excerpt":"As fine-tuning large language models (LLMs) becomes increasingly prevalent, users often rely on third-party services with limited visibility into their fine-tuning processes. This lack of transparency raises the question: how do consumers verify that fine-tuning services are performed correctly? For instance, a service provider could claim to fine-tune a model for each user, yet simply send all users back the same base model. To address this issue, we propose vTune, a simple method that uses a small number of backdoor data points added to the training data to provide a statistical test for ver"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.06611","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2411.06611/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"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":"2411.06611","created_at":"2026-07-05T09:34:22.830158+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.06611v2","created_at":"2026-07-05T09:34:22.830158+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.06611","created_at":"2026-07-05T09:34:22.830158+00:00"},{"alias_kind":"pith_short_12","alias_value":"YLLMPMNI4BCY","created_at":"2026-07-05T09:34:22.830158+00:00"},{"alias_kind":"pith_short_16","alias_value":"YLLMPMNI4BCYUHXQ","created_at":"2026-07-05T09:34:22.830158+00:00"},{"alias_kind":"pith_short_8","alias_value":"YLLMPMNI","created_at":"2026-07-05T09:34:22.830158+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.21045","citing_title":"OVIG: Optimistic Verification of AI Training Integrity via Gradient Signals","ref_index":8,"is_internal_anchor":false},{"citing_arxiv_id":"2510.18333","citing_title":"Position: LLM Watermarking Should Align Stakeholders' Incentives for Practical Adoption","ref_index":75,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YLLMPMNI4BCYUHXQCBZJF53VXN","json":"https://pith.science/pith/YLLMPMNI4BCYUHXQCBZJF53VXN.json","graph_json":"https://pith.science/api/pith-number/YLLMPMNI4BCYUHXQCBZJF53VXN/graph.json","events_json":"https://pith.science/api/pith-number/YLLMPMNI4BCYUHXQCBZJF53VXN/events.json","paper":"https://pith.science/paper/YLLMPMNI"},"agent_actions":{"view_html":"https://pith.science/pith/YLLMPMNI4BCYUHXQCBZJF53VXN","download_json":"https://pith.science/pith/YLLMPMNI4BCYUHXQCBZJF53VXN.json","view_paper":"https://pith.science/paper/YLLMPMNI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.06611&json=true","fetch_graph":"https://pith.science/api/pith-number/YLLMPMNI4BCYUHXQCBZJF53VXN/graph.json","fetch_events":"https://pith.science/api/pith-number/YLLMPMNI4BCYUHXQCBZJF53VXN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YLLMPMNI4BCYUHXQCBZJF53VXN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YLLMPMNI4BCYUHXQCBZJF53VXN/action/storage_attestation","attest_author":"https://pith.science/pith/YLLMPMNI4BCYUHXQCBZJF53VXN/action/author_attestation","sign_citation":"https://pith.science/pith/YLLMPMNI4BCYUHXQCBZJF53VXN/action/citation_signature","submit_replication":"https://pith.science/pith/YLLMPMNI4BCYUHXQCBZJF53VXN/action/replication_record"}},"created_at":"2026-07-05T09:34:22.830158+00:00","updated_at":"2026-07-05T09:34:22.830158+00:00"}