{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:FTKVIVYMJYLL7IMDZ4S2FXBRQJ","short_pith_number":"pith:FTKVIVYM","schema_version":"1.0","canonical_sha256":"2cd554570c4e16bfa183cf25a2dc31824a4c8eda5a6361332731aed7a96004b8","source":{"kind":"arxiv","id":"2503.14900","version":1},"attestation_state":"computed","paper":{"title":"Deep Contrastive Unlearning for Language Models","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CL","authors_text":"Estrid He, Ibrahim Khalil, Ke Wang, Tabinda Sarwar, Xun Yi","submitted_at":"2025-03-19T04:58:45Z","abstract_excerpt":"The past a few years have witnessed the great success of large language models, demonstrating powerful capabilities in comprehending textual data and generating human-like languages. Large language models achieve success by being trained on vast amounts of textual data, including online sources with copyrighted content and user-generated knowledge. However, this comes at a cost: the potential risk of exposing users' privacy and violating copyright protections. Thus, to safeguard individuals' \"right to be forgotten\", there has been increasing interests in machine unlearning -- the process of re"},"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":"2503.14900","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2025-03-19T04:58:45Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"0339c89f01d9ff5c40d5efc346cfc3212b1ee9cec9961f86a5a4fdc03e8bc2f4","abstract_canon_sha256":"109f0867339eb50ba7df1d5a450d60949edc5163f707c6df5cca2d32bad1d337"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:34:26.995705Z","signature_b64":"g0LdRVNtJxrIQo10reLU7JaNBwzoQA1ZhY/6+TuGkLzgThgi8/5kMVfmxvN/9M/BAltRIy5mV7Z3GGOmFeQQCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2cd554570c4e16bfa183cf25a2dc31824a4c8eda5a6361332731aed7a96004b8","last_reissued_at":"2026-07-05T10:34:26.995205Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:34:26.995205Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Deep Contrastive Unlearning for Language Models","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CL","authors_text":"Estrid He, Ibrahim Khalil, Ke Wang, Tabinda Sarwar, Xun Yi","submitted_at":"2025-03-19T04:58:45Z","abstract_excerpt":"The past a few years have witnessed the great success of large language models, demonstrating powerful capabilities in comprehending textual data and generating human-like languages. Large language models achieve success by being trained on vast amounts of textual data, including online sources with copyrighted content and user-generated knowledge. However, this comes at a cost: the potential risk of exposing users' privacy and violating copyright protections. Thus, to safeguard individuals' \"right to be forgotten\", there has been increasing interests in machine unlearning -- the process of re"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.14900","kind":"arxiv","version":1},"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/2503.14900/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":"2503.14900","created_at":"2026-07-05T10:34:26.995264+00:00"},{"alias_kind":"arxiv_version","alias_value":"2503.14900v1","created_at":"2026-07-05T10:34:26.995264+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.14900","created_at":"2026-07-05T10:34:26.995264+00:00"},{"alias_kind":"pith_short_12","alias_value":"FTKVIVYMJYLL","created_at":"2026-07-05T10:34:26.995264+00:00"},{"alias_kind":"pith_short_16","alias_value":"FTKVIVYMJYLL7IMD","created_at":"2026-07-05T10:34:26.995264+00:00"},{"alias_kind":"pith_short_8","alias_value":"FTKVIVYM","created_at":"2026-07-05T10:34:26.995264+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.15076","citing_title":"Learning-Time Encoding Shapes Unlearning in LLMs","ref_index":51,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FTKVIVYMJYLL7IMDZ4S2FXBRQJ","json":"https://pith.science/pith/FTKVIVYMJYLL7IMDZ4S2FXBRQJ.json","graph_json":"https://pith.science/api/pith-number/FTKVIVYMJYLL7IMDZ4S2FXBRQJ/graph.json","events_json":"https://pith.science/api/pith-number/FTKVIVYMJYLL7IMDZ4S2FXBRQJ/events.json","paper":"https://pith.science/paper/FTKVIVYM"},"agent_actions":{"view_html":"https://pith.science/pith/FTKVIVYMJYLL7IMDZ4S2FXBRQJ","download_json":"https://pith.science/pith/FTKVIVYMJYLL7IMDZ4S2FXBRQJ.json","view_paper":"https://pith.science/paper/FTKVIVYM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2503.14900&json=true","fetch_graph":"https://pith.science/api/pith-number/FTKVIVYMJYLL7IMDZ4S2FXBRQJ/graph.json","fetch_events":"https://pith.science/api/pith-number/FTKVIVYMJYLL7IMDZ4S2FXBRQJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FTKVIVYMJYLL7IMDZ4S2FXBRQJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FTKVIVYMJYLL7IMDZ4S2FXBRQJ/action/storage_attestation","attest_author":"https://pith.science/pith/FTKVIVYMJYLL7IMDZ4S2FXBRQJ/action/author_attestation","sign_citation":"https://pith.science/pith/FTKVIVYMJYLL7IMDZ4S2FXBRQJ/action/citation_signature","submit_replication":"https://pith.science/pith/FTKVIVYMJYLL7IMDZ4S2FXBRQJ/action/replication_record"}},"created_at":"2026-07-05T10:34:26.995264+00:00","updated_at":"2026-07-05T10:34:26.995264+00:00"}