{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:75WDI6X3ENLVEIYIGWS5OJTWU4","short_pith_number":"pith:75WDI6X3","schema_version":"1.0","canonical_sha256":"ff6c347afb235752230835a5d72676a70d7409d10be5753672d15253dd47eb8f","source":{"kind":"arxiv","id":"2503.13690","version":2},"attestation_state":"computed","paper":{"title":"Atyaephyra at SemEval-2025 Task 4: Low-Rank Negative Preference Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.CL","authors_text":"Applied Linguistics), Faculty of Mathematics, Institute of Formal, Jan Bronec (1), Jind\\v{r}ich Helcl (1) ((1) Charles University, Physics","submitted_at":"2025-03-17T19:59:19Z","abstract_excerpt":"We present a submission to the SemEval 2025 shared task on unlearning sensitive content from LLMs. Our approach employs negative preference optimization using low-rank adaptation. We show that we can utilize this combination to efficiently compute additional regularization terms, which help with unlearning stabilization. The results of our approach significantly exceed the shared task baselines."},"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.13690","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2025-03-17T19:59:19Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"77fd448b9ccdd8948b6c9f3c9ea795b858b50f429edcc78f964bd729fa47be35","abstract_canon_sha256":"b1d174d5dfb5b4cfe3816acd351145f63d488cee8b6aad8d1bebdd6a4eeafd3b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:00:05.610422Z","signature_b64":"QNyUk3Z7Qao44aAbDi8dcFQqy7OWaLdD0sK8/xVz0ONH2uPF2XGQx+9Xg+a//oQiiuW48PdR75TXA+Yh9BygDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ff6c347afb235752230835a5d72676a70d7409d10be5753672d15253dd47eb8f","last_reissued_at":"2026-07-05T11:00:05.609889Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:00:05.609889Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Atyaephyra at SemEval-2025 Task 4: Low-Rank Negative Preference Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.CL","authors_text":"Applied Linguistics), Faculty of Mathematics, Institute of Formal, Jan Bronec (1), Jind\\v{r}ich Helcl (1) ((1) Charles University, Physics","submitted_at":"2025-03-17T19:59:19Z","abstract_excerpt":"We present a submission to the SemEval 2025 shared task on unlearning sensitive content from LLMs. Our approach employs negative preference optimization using low-rank adaptation. We show that we can utilize this combination to efficiently compute additional regularization terms, which help with unlearning stabilization. The results of our approach significantly exceed the shared task baselines."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.13690","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/2503.13690/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.13690","created_at":"2026-07-05T11:00:05.609939+00:00"},{"alias_kind":"arxiv_version","alias_value":"2503.13690v2","created_at":"2026-07-05T11:00:05.609939+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.13690","created_at":"2026-07-05T11:00:05.609939+00:00"},{"alias_kind":"pith_short_12","alias_value":"75WDI6X3ENLV","created_at":"2026-07-05T11:00:05.609939+00:00"},{"alias_kind":"pith_short_16","alias_value":"75WDI6X3ENLVEIYI","created_at":"2026-07-05T11:00:05.609939+00:00"},{"alias_kind":"pith_short_8","alias_value":"75WDI6X3","created_at":"2026-07-05T11:00:05.609939+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":37,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/75WDI6X3ENLVEIYIGWS5OJTWU4","json":"https://pith.science/pith/75WDI6X3ENLVEIYIGWS5OJTWU4.json","graph_json":"https://pith.science/api/pith-number/75WDI6X3ENLVEIYIGWS5OJTWU4/graph.json","events_json":"https://pith.science/api/pith-number/75WDI6X3ENLVEIYIGWS5OJTWU4/events.json","paper":"https://pith.science/paper/75WDI6X3"},"agent_actions":{"view_html":"https://pith.science/pith/75WDI6X3ENLVEIYIGWS5OJTWU4","download_json":"https://pith.science/pith/75WDI6X3ENLVEIYIGWS5OJTWU4.json","view_paper":"https://pith.science/paper/75WDI6X3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2503.13690&json=true","fetch_graph":"https://pith.science/api/pith-number/75WDI6X3ENLVEIYIGWS5OJTWU4/graph.json","fetch_events":"https://pith.science/api/pith-number/75WDI6X3ENLVEIYIGWS5OJTWU4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/75WDI6X3ENLVEIYIGWS5OJTWU4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/75WDI6X3ENLVEIYIGWS5OJTWU4/action/storage_attestation","attest_author":"https://pith.science/pith/75WDI6X3ENLVEIYIGWS5OJTWU4/action/author_attestation","sign_citation":"https://pith.science/pith/75WDI6X3ENLVEIYIGWS5OJTWU4/action/citation_signature","submit_replication":"https://pith.science/pith/75WDI6X3ENLVEIYIGWS5OJTWU4/action/replication_record"}},"created_at":"2026-07-05T11:00:05.609939+00:00","updated_at":"2026-07-05T11:00:05.609939+00:00"}