{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:YSDIDJUMEF5V6HP76ZLB24PESF","short_pith_number":"pith:YSDIDJUM","schema_version":"1.0","canonical_sha256":"c48681a68c217b5f1dfff6561d71e49150855f47bf82cc4dcd04bb81820adf41","source":{"kind":"arxiv","id":"2403.12830","version":2},"attestation_state":"computed","paper":{"title":"Towards Lifecycle Unlearning Commitment Management: Measuring Sample-level Approximate Unlearning Completeness","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"cs.LG","authors_text":"Cheng-Long Wang, Di Wang, Qi Li, Yinzhi Cao, Zihang Xiang","submitted_at":"2024-03-19T15:37:27Z","abstract_excerpt":"By adopting a more flexible definition of unlearning and adjusting the model distribution to simulate training without the targeted data, approximate machine unlearning provides a less resource-demanding alternative to the more laborious exact unlearning methods. Yet, the unlearning completeness of target samples-even when the approximate algorithms are executed faithfully without external threats-remains largely unexamined, raising questions about those approximate algorithms' ability to fulfill their commitment of unlearning during the lifecycle.\n  In this paper, we introduce the task of Lif"},"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":"2403.12830","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-03-19T15:37:27Z","cross_cats_sorted":["cs.CR"],"title_canon_sha256":"9b2850b49b6941a1c94747f0e351463c41884f7b8f5b536b16964cc943e4312a","abstract_canon_sha256":"52ec4cf6dd69cbeb2b48e5e2f1e2d81bfa39174b3540dadf93dc6f9a61c5f7a5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:14:04.768261Z","signature_b64":"R8WWI1y92H/csktQgIC3k7pfsoQInyb9xzfpVFbTYg0xhASEocRgNbCvSOSu6vnUVAfASui9RBh3imykDirJBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c48681a68c217b5f1dfff6561d71e49150855f47bf82cc4dcd04bb81820adf41","last_reissued_at":"2026-07-05T08:14:04.767873Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:14:04.767873Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Towards Lifecycle Unlearning Commitment Management: Measuring Sample-level Approximate Unlearning Completeness","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"cs.LG","authors_text":"Cheng-Long Wang, Di Wang, Qi Li, Yinzhi Cao, Zihang Xiang","submitted_at":"2024-03-19T15:37:27Z","abstract_excerpt":"By adopting a more flexible definition of unlearning and adjusting the model distribution to simulate training without the targeted data, approximate machine unlearning provides a less resource-demanding alternative to the more laborious exact unlearning methods. Yet, the unlearning completeness of target samples-even when the approximate algorithms are executed faithfully without external threats-remains largely unexamined, raising questions about those approximate algorithms' ability to fulfill their commitment of unlearning during the lifecycle.\n  In this paper, we introduce the task of Lif"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.12830","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/2403.12830/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":"2403.12830","created_at":"2026-07-05T08:14:04.767937+00:00"},{"alias_kind":"arxiv_version","alias_value":"2403.12830v2","created_at":"2026-07-05T08:14:04.767937+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.12830","created_at":"2026-07-05T08:14:04.767937+00:00"},{"alias_kind":"pith_short_12","alias_value":"YSDIDJUMEF5V","created_at":"2026-07-05T08:14:04.767937+00:00"},{"alias_kind":"pith_short_16","alias_value":"YSDIDJUMEF5V6HP7","created_at":"2026-07-05T08:14:04.767937+00:00"},{"alias_kind":"pith_short_8","alias_value":"YSDIDJUM","created_at":"2026-07-05T08:14:04.767937+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2506.15115","citing_title":"Towards Reliable Forgetting: A Survey on Machine Unlearning Verification","ref_index":102,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YSDIDJUMEF5V6HP76ZLB24PESF","json":"https://pith.science/pith/YSDIDJUMEF5V6HP76ZLB24PESF.json","graph_json":"https://pith.science/api/pith-number/YSDIDJUMEF5V6HP76ZLB24PESF/graph.json","events_json":"https://pith.science/api/pith-number/YSDIDJUMEF5V6HP76ZLB24PESF/events.json","paper":"https://pith.science/paper/YSDIDJUM"},"agent_actions":{"view_html":"https://pith.science/pith/YSDIDJUMEF5V6HP76ZLB24PESF","download_json":"https://pith.science/pith/YSDIDJUMEF5V6HP76ZLB24PESF.json","view_paper":"https://pith.science/paper/YSDIDJUM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2403.12830&json=true","fetch_graph":"https://pith.science/api/pith-number/YSDIDJUMEF5V6HP76ZLB24PESF/graph.json","fetch_events":"https://pith.science/api/pith-number/YSDIDJUMEF5V6HP76ZLB24PESF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YSDIDJUMEF5V6HP76ZLB24PESF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YSDIDJUMEF5V6HP76ZLB24PESF/action/storage_attestation","attest_author":"https://pith.science/pith/YSDIDJUMEF5V6HP76ZLB24PESF/action/author_attestation","sign_citation":"https://pith.science/pith/YSDIDJUMEF5V6HP76ZLB24PESF/action/citation_signature","submit_replication":"https://pith.science/pith/YSDIDJUMEF5V6HP76ZLB24PESF/action/replication_record"}},"created_at":"2026-07-05T08:14:04.767937+00:00","updated_at":"2026-07-05T08:14:04.767937+00:00"}