{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:F34WO5HJRBAR52ZSHNH4ZGFENJ","short_pith_number":"pith:F34WO5HJ","schema_version":"1.0","canonical_sha256":"2ef96774e988411eeb323b4fcc98a46a71f88341a4ba44dd3ff3d9823fcad8f6","source":{"kind":"arxiv","id":"2506.14515","version":1},"attestation_state":"computed","paper":{"title":"Train Once, Forget Precisely: Anchored Optimization for Efficient Post-Hoc Unlearning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV"],"primary_cat":"cs.LG","authors_text":"Arun K. Dubey, Jaskaran Singh, Prabhav Sanga","submitted_at":"2025-06-17T13:40:48Z","abstract_excerpt":"As machine learning systems increasingly rely on data subject to privacy regulation, selectively unlearning specific information from trained models has become essential. In image classification, this involves removing the influence of particular training samples, semantic classes, or visual styles without full retraining. We introduce \\textbf{Forget-Aligned Model Reconstruction (FAMR)}, a theoretically grounded and computationally efficient framework for post-hoc unlearning in deep image classifiers. FAMR frames forgetting as a constrained optimization problem that minimizes a uniform-predict"},"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":"2506.14515","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-06-17T13:40:48Z","cross_cats_sorted":["cs.CV"],"title_canon_sha256":"fb6b5a599234cc7faee1fccde88e2eafb3e79d1c2280aaf20fa09c26da3b0b33","abstract_canon_sha256":"a5a17306624b4e06c76a723f392e24fa47d31367c20dcb8e9494b1cae13913ef"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:22:57.999934Z","signature_b64":"OUcjlcEgG3e5Tvdnlp8npiY1O5PTye8yobESIxeRLwMFLMUqeBHr21G2SLkyngQ43suZbY6BLdz2h64rd9dACg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2ef96774e988411eeb323b4fcc98a46a71f88341a4ba44dd3ff3d9823fcad8f6","last_reissued_at":"2026-07-05T11:22:57.999499Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:22:57.999499Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Train Once, Forget Precisely: Anchored Optimization for Efficient Post-Hoc Unlearning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV"],"primary_cat":"cs.LG","authors_text":"Arun K. Dubey, Jaskaran Singh, Prabhav Sanga","submitted_at":"2025-06-17T13:40:48Z","abstract_excerpt":"As machine learning systems increasingly rely on data subject to privacy regulation, selectively unlearning specific information from trained models has become essential. In image classification, this involves removing the influence of particular training samples, semantic classes, or visual styles without full retraining. We introduce \\textbf{Forget-Aligned Model Reconstruction (FAMR)}, a theoretically grounded and computationally efficient framework for post-hoc unlearning in deep image classifiers. FAMR frames forgetting as a constrained optimization problem that minimizes a uniform-predict"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.14515","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/2506.14515/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":"2506.14515","created_at":"2026-07-05T11:22:57.999557+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.14515v1","created_at":"2026-07-05T11:22:57.999557+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.14515","created_at":"2026-07-05T11:22:57.999557+00:00"},{"alias_kind":"pith_short_12","alias_value":"F34WO5HJRBAR","created_at":"2026-07-05T11:22:57.999557+00:00"},{"alias_kind":"pith_short_16","alias_value":"F34WO5HJRBAR52ZS","created_at":"2026-07-05T11:22:57.999557+00:00"},{"alias_kind":"pith_short_8","alias_value":"F34WO5HJ","created_at":"2026-07-05T11:22:57.999557+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2511.19339","citing_title":"POUR: A Provably Optimal Method for Unlearning Representations via Neural Collapse","ref_index":29,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/F34WO5HJRBAR52ZSHNH4ZGFENJ","json":"https://pith.science/pith/F34WO5HJRBAR52ZSHNH4ZGFENJ.json","graph_json":"https://pith.science/api/pith-number/F34WO5HJRBAR52ZSHNH4ZGFENJ/graph.json","events_json":"https://pith.science/api/pith-number/F34WO5HJRBAR52ZSHNH4ZGFENJ/events.json","paper":"https://pith.science/paper/F34WO5HJ"},"agent_actions":{"view_html":"https://pith.science/pith/F34WO5HJRBAR52ZSHNH4ZGFENJ","download_json":"https://pith.science/pith/F34WO5HJRBAR52ZSHNH4ZGFENJ.json","view_paper":"https://pith.science/paper/F34WO5HJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.14515&json=true","fetch_graph":"https://pith.science/api/pith-number/F34WO5HJRBAR52ZSHNH4ZGFENJ/graph.json","fetch_events":"https://pith.science/api/pith-number/F34WO5HJRBAR52ZSHNH4ZGFENJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/F34WO5HJRBAR52ZSHNH4ZGFENJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/F34WO5HJRBAR52ZSHNH4ZGFENJ/action/storage_attestation","attest_author":"https://pith.science/pith/F34WO5HJRBAR52ZSHNH4ZGFENJ/action/author_attestation","sign_citation":"https://pith.science/pith/F34WO5HJRBAR52ZSHNH4ZGFENJ/action/citation_signature","submit_replication":"https://pith.science/pith/F34WO5HJRBAR52ZSHNH4ZGFENJ/action/replication_record"}},"created_at":"2026-07-05T11:22:57.999557+00:00","updated_at":"2026-07-05T11:22:57.999557+00:00"}