{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:LPH6T5NM6EZ3BVPTSI7NPVSVZ6","short_pith_number":"pith:LPH6T5NM","canonical_record":{"source":{"id":"2605.01735","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2026-05-03T06:20:03Z","cross_cats_sorted":[],"title_canon_sha256":"d0dca146ca6ae22b09ad7a3a1b68227629cf8b01ce07edf5f79e8523fbec5cb9","abstract_canon_sha256":"cd49f95c3619721b41c2f54a7b45db22a147bc8f16cb6f123b2c130f4fe60b06"},"schema_version":"1.0"},"canonical_sha256":"5bcfe9f5acf133b0d5f3923ed7d655cfbddc63545e95bdba97fcc61944227ad5","source":{"kind":"arxiv","id":"2605.01735","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.01735","created_at":"2026-05-28T01:05:12Z"},{"alias_kind":"arxiv_version","alias_value":"2605.01735v2","created_at":"2026-05-28T01:05:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.01735","created_at":"2026-05-28T01:05:12Z"},{"alias_kind":"pith_short_12","alias_value":"LPH6T5NM6EZ3","created_at":"2026-05-28T01:05:12Z"},{"alias_kind":"pith_short_16","alias_value":"LPH6T5NM6EZ3BVPT","created_at":"2026-05-28T01:05:12Z"},{"alias_kind":"pith_short_8","alias_value":"LPH6T5NM","created_at":"2026-05-28T01:05:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:LPH6T5NM6EZ3BVPTSI7NPVSVZ6","target":"record","payload":{"canonical_record":{"source":{"id":"2605.01735","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2026-05-03T06:20:03Z","cross_cats_sorted":[],"title_canon_sha256":"d0dca146ca6ae22b09ad7a3a1b68227629cf8b01ce07edf5f79e8523fbec5cb9","abstract_canon_sha256":"cd49f95c3619721b41c2f54a7b45db22a147bc8f16cb6f123b2c130f4fe60b06"},"schema_version":"1.0"},"canonical_sha256":"5bcfe9f5acf133b0d5f3923ed7d655cfbddc63545e95bdba97fcc61944227ad5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-28T01:05:12.458057Z","signature_b64":"u7JE9+Hean6Kt2shkiRLsJCrvbK9Cm3kkc4sYrt1eE1Cyq3YB11oqUXjvgLHHxPtKswN5qmHAAZX5Xxmv0iSAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5bcfe9f5acf133b0d5f3923ed7d655cfbddc63545e95bdba97fcc61944227ad5","last_reissued_at":"2026-05-28T01:05:12.457391Z","signature_status":"signed_v1","first_computed_at":"2026-05-28T01:05:12.457391Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.01735","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-28T01:05:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Tiu46RGxLsOmIU9ZFeML3GWxuLPEI9v9dmFGUyU75W5Om8nauJSOcUWS/p9VaOWIzECuMaKtV15e95VD20NTAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T20:36:03.832125Z"},"content_sha256":"04ce586124eaa7ff29ec6246712395b988b167f617ef0e19f933035ef7dd9d09","schema_version":"1.0","event_id":"sha256:04ce586124eaa7ff29ec6246712395b988b167f617ef0e19f933035ef7dd9d09"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:LPH6T5NM6EZ3BVPTSI7NPVSVZ6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Less is More: Geometric Unlearning for LLMs with Minimal Data Disclosure","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Geometric Unlearning lets LLMs forget specific private facts using only a handful of synthetic prompts while retaining general performance.","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Chenchen Tan, Cunjian Chen, Longxiang Gao, Shujie Cui, Xinghao Li, Youyang Qu","submitted_at":"2026-05-03T06:20:03Z","abstract_excerpt":"As large language models (LLMs) are increasingly deployed in real-world systems, they must support post-hoc removal of specific content to meet privacy and governance requirements. This motivates selective unlearning, which suppresses information about a particular entity or topic while preserving the LLM's general utility. However, most existing LLM unlearning methods require access to the original training corpus and rely on output-level refusal tuning or broad gradient updates, creating a tension among unlearning strength, non-target preservation, and data availability. We propose Geometric"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"Across privacy-oriented unlearning benchmarks (ToFU and UnlearnPII), GU achieves strong target suppression with minimal impact on non-target performance, demonstrating that effective unlearning can be achieved with minimal synthetic data.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The assumption that a compact low-rank geometry distilled from safe reference prompts, combined with projection-based alignment using synthetic anchors, can effectively suppress target information in the model's hidden states without access to the original training corpus or significant utility loss.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Geometric Unlearning suppresses specific knowledge in LLMs by projecting hidden planning states onto a low-rank safe geometry derived from minimal reference prompts.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Geometric Unlearning lets LLMs forget specific private facts using only a handful of synthetic prompts while retaining general performance.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"60b0f8712d9d23ca96357302aab8f3362d99a638b9a2f4d51e0250f8b44530c0"},"source":{"id":"2605.01735","kind":"arxiv","version":2},"verdict":{"id":"504d7cdf-3774-41e3-b5cf-790afc4c786a","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-10T15:58:11.548449Z","strongest_claim":"Across privacy-oriented unlearning benchmarks (ToFU and UnlearnPII), GU achieves strong target suppression with minimal impact on non-target performance, demonstrating that effective unlearning can be achieved with minimal synthetic data.","one_line_summary":"Geometric Unlearning suppresses specific knowledge in LLMs by projecting hidden planning states onto a low-rank safe geometry derived from minimal reference prompts.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The assumption that a compact low-rank geometry distilled from safe reference prompts, combined with projection-based alignment using synthetic anchors, can effectively suppress target information in the model's hidden states without access to the original training corpus or significant utility loss.","pith_extraction_headline":"Geometric Unlearning lets LLMs forget specific private facts using only a handful of synthetic prompts while retaining general performance."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.01735/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"ai_meta_artifact","ran_at":"2026-05-20T17:37:19.650148Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_title_agreement","ran_at":"2026-05-20T05:01:23.091965Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T17:00:50.088978Z","status":"completed","version":"1.0.0","findings_count":0}],"snapshot_sha256":"2792726b88a81447be03310858e3b22ff01e6d40439872c768522f65e9d3fe66"},"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"},"verdict_id":"504d7cdf-3774-41e3-b5cf-790afc4c786a"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-28T01:05:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vDpYGtrIDCmVOHz050at+IbtsMDOICEJGefWSwcYUtL6lg1udS06Ee5Vdbobo4lxqw+2vgGKl0TQ3saKnv5UBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T20:36:03.833107Z"},"content_sha256":"20eff7e0bdb5729bcaef425e3344f100c7aa981277d81e923fb4aeb25bde9412","schema_version":"1.0","event_id":"sha256:20eff7e0bdb5729bcaef425e3344f100c7aa981277d81e923fb4aeb25bde9412"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LPH6T5NM6EZ3BVPTSI7NPVSVZ6/bundle.json","state_url":"https://pith.science/pith/LPH6T5NM6EZ3BVPTSI7NPVSVZ6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LPH6T5NM6EZ3BVPTSI7NPVSVZ6/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-05T20:36:03Z","links":{"resolver":"https://pith.science/pith/LPH6T5NM6EZ3BVPTSI7NPVSVZ6","bundle":"https://pith.science/pith/LPH6T5NM6EZ3BVPTSI7NPVSVZ6/bundle.json","state":"https://pith.science/pith/LPH6T5NM6EZ3BVPTSI7NPVSVZ6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LPH6T5NM6EZ3BVPTSI7NPVSVZ6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:LPH6T5NM6EZ3BVPTSI7NPVSVZ6","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"cd49f95c3619721b41c2f54a7b45db22a147bc8f16cb6f123b2c130f4fe60b06","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2026-05-03T06:20:03Z","title_canon_sha256":"d0dca146ca6ae22b09ad7a3a1b68227629cf8b01ce07edf5f79e8523fbec5cb9"},"schema_version":"1.0","source":{"id":"2605.01735","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.01735","created_at":"2026-05-28T01:05:12Z"},{"alias_kind":"arxiv_version","alias_value":"2605.01735v2","created_at":"2026-05-28T01:05:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.01735","created_at":"2026-05-28T01:05:12Z"},{"alias_kind":"pith_short_12","alias_value":"LPH6T5NM6EZ3","created_at":"2026-05-28T01:05:12Z"},{"alias_kind":"pith_short_16","alias_value":"LPH6T5NM6EZ3BVPT","created_at":"2026-05-28T01:05:12Z"},{"alias_kind":"pith_short_8","alias_value":"LPH6T5NM","created_at":"2026-05-28T01:05:12Z"}],"graph_snapshots":[{"event_id":"sha256:20eff7e0bdb5729bcaef425e3344f100c7aa981277d81e923fb4aeb25bde9412","target":"graph","created_at":"2026-05-28T01:05:12Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"Across privacy-oriented unlearning benchmarks (ToFU and UnlearnPII), GU achieves strong target suppression with minimal impact on non-target performance, demonstrating that effective unlearning can be achieved with minimal synthetic data."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The assumption that a compact low-rank geometry distilled from safe reference prompts, combined with projection-based alignment using synthetic anchors, can effectively suppress target information in the model's hidden states without access to the original training corpus or significant utility loss."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Geometric Unlearning suppresses specific knowledge in LLMs by projecting hidden planning states onto a low-rank safe geometry derived from minimal reference prompts."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Geometric Unlearning lets LLMs forget specific private facts using only a handful of synthetic prompts while retaining general performance."}],"snapshot_sha256":"60b0f8712d9d23ca96357302aab8f3362d99a638b9a2f4d51e0250f8b44530c0"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-20T17:37:19.650148Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_title_agreement","ran_at":"2026-05-20T05:01:23.091965Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T17:00:50.088978Z","status":"completed","version":"1.0.0"}],"endpoint":"/pith/2605.01735/integrity.json","findings":[],"snapshot_sha256":"2792726b88a81447be03310858e3b22ff01e6d40439872c768522f65e9d3fe66","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"As large language models (LLMs) are increasingly deployed in real-world systems, they must support post-hoc removal of specific content to meet privacy and governance requirements. This motivates selective unlearning, which suppresses information about a particular entity or topic while preserving the LLM's general utility. However, most existing LLM unlearning methods require access to the original training corpus and rely on output-level refusal tuning or broad gradient updates, creating a tension among unlearning strength, non-target preservation, and data availability. We propose Geometric","authors_text":"Chenchen Tan, Cunjian Chen, Longxiang Gao, Shujie Cui, Xinghao Li, Youyang Qu","cross_cats":[],"headline":"Geometric Unlearning lets LLMs forget specific private facts using only a handful of synthetic prompts while retaining general performance.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2026-05-03T06:20:03Z","title":"Less is More: Geometric Unlearning for LLMs with Minimal Data Disclosure"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.01735","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-10T15:58:11.548449Z","id":"504d7cdf-3774-41e3-b5cf-790afc4c786a","model_set":{"reader":"grok-4.3"},"one_line_summary":"Geometric Unlearning suppresses specific knowledge in LLMs by projecting hidden planning states onto a low-rank safe geometry derived from minimal reference prompts.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Geometric Unlearning lets LLMs forget specific private facts using only a handful of synthetic prompts while retaining general performance.","strongest_claim":"Across privacy-oriented unlearning benchmarks (ToFU and UnlearnPII), GU achieves strong target suppression with minimal impact on non-target performance, demonstrating that effective unlearning can be achieved with minimal synthetic data.","weakest_assumption":"The assumption that a compact low-rank geometry distilled from safe reference prompts, combined with projection-based alignment using synthetic anchors, can effectively suppress target information in the model's hidden states without access to the original training corpus or significant utility loss."}},"verdict_id":"504d7cdf-3774-41e3-b5cf-790afc4c786a"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:04ce586124eaa7ff29ec6246712395b988b167f617ef0e19f933035ef7dd9d09","target":"record","created_at":"2026-05-28T01:05:12Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"cd49f95c3619721b41c2f54a7b45db22a147bc8f16cb6f123b2c130f4fe60b06","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2026-05-03T06:20:03Z","title_canon_sha256":"d0dca146ca6ae22b09ad7a3a1b68227629cf8b01ce07edf5f79e8523fbec5cb9"},"schema_version":"1.0","source":{"id":"2605.01735","kind":"arxiv","version":2}},"canonical_sha256":"5bcfe9f5acf133b0d5f3923ed7d655cfbddc63545e95bdba97fcc61944227ad5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5bcfe9f5acf133b0d5f3923ed7d655cfbddc63545e95bdba97fcc61944227ad5","first_computed_at":"2026-05-28T01:05:12.457391Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-28T01:05:12.457391Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"u7JE9+Hean6Kt2shkiRLsJCrvbK9Cm3kkc4sYrt1eE1Cyq3YB11oqUXjvgLHHxPtKswN5qmHAAZX5Xxmv0iSAQ==","signature_status":"signed_v1","signed_at":"2026-05-28T01:05:12.458057Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.01735","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:04ce586124eaa7ff29ec6246712395b988b167f617ef0e19f933035ef7dd9d09","sha256:20eff7e0bdb5729bcaef425e3344f100c7aa981277d81e923fb4aeb25bde9412"],"state_sha256":"249fab17275084a2aa3f6b865f00912cc4546c5d3d409383901053e162bfbb4d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WkG+GlgFTUcN7w3on0g8j6mlln2UEyn1J5oJlnhAPz3tC7LItPMdfRrzMgYR+WLymXGXIy60NYUxAfNJz5cRBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T20:36:03.837337Z","bundle_sha256":"58df35edb94f5833b1d07872dd13a6713d843558486e5d6a3ff3100c12f21df6"}}