{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:4BQG55S2D3OPYTBSKRLLGAZTN7","short_pith_number":"pith:4BQG55S2","schema_version":"1.0","canonical_sha256":"e0606ef65a1edcfc4c325456b303336fc02c6fa940ea5516e00ea9ffbcb5228b","source":{"kind":"arxiv","id":"2501.11823","version":1},"attestation_state":"computed","paper":{"title":"Toward Scalable Graph Unlearning: A Node Influence Maximization based Approach","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.AI","cs.DB","cs.SI"],"primary_cat":"cs.LG","authors_text":"Bowen Fan, Guoren Wang, Rong-Hua Li, Xunkai Li, Zhengyu Wu, Zhiyu Li","submitted_at":"2025-01-21T02:02:35Z","abstract_excerpt":"Machine unlearning, as a pivotal technology for enhancing model robustness and data privacy, has garnered significant attention in prevalent web mining applications, especially in thriving graph-based scenarios. However, most existing graph unlearning (GU) approaches face significant challenges due to the intricate interactions among web-scale graph elements during the model training: (1) The gradient-driven node entanglement hinders the complete knowledge removal in response to unlearning requests; (2) The billion-level graph elements in the web scenarios present inevitable scalability issues"},"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":"2501.11823","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LG","submitted_at":"2025-01-21T02:02:35Z","cross_cats_sorted":["cs.AI","cs.DB","cs.SI"],"title_canon_sha256":"144b48969e8b43ae93c8b1d404a7182c94fe93fb33d49a23f26443d26ad10645","abstract_canon_sha256":"dbf0444b5e5732e44e1fc5dc2d8cc8eb82ce17450eca0c2b57951573c592458a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:03:14.347449Z","signature_b64":"RxRwsUoXfjkgE+KEeKw44XxBjNVQR/E1jcO2AcpJgkMnM2/VVBFwAh5gGGs4wQyVuiWiMwzB5suV/4BqhAN8CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e0606ef65a1edcfc4c325456b303336fc02c6fa940ea5516e00ea9ffbcb5228b","last_reissued_at":"2026-07-05T10:03:14.346958Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:03:14.346958Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Toward Scalable Graph Unlearning: A Node Influence Maximization based Approach","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.AI","cs.DB","cs.SI"],"primary_cat":"cs.LG","authors_text":"Bowen Fan, Guoren Wang, Rong-Hua Li, Xunkai Li, Zhengyu Wu, Zhiyu Li","submitted_at":"2025-01-21T02:02:35Z","abstract_excerpt":"Machine unlearning, as a pivotal technology for enhancing model robustness and data privacy, has garnered significant attention in prevalent web mining applications, especially in thriving graph-based scenarios. However, most existing graph unlearning (GU) approaches face significant challenges due to the intricate interactions among web-scale graph elements during the model training: (1) The gradient-driven node entanglement hinders the complete knowledge removal in response to unlearning requests; (2) The billion-level graph elements in the web scenarios present inevitable scalability issues"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.11823","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/2501.11823/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":"2501.11823","created_at":"2026-07-05T10:03:14.347036+00:00"},{"alias_kind":"arxiv_version","alias_value":"2501.11823v1","created_at":"2026-07-05T10:03:14.347036+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.11823","created_at":"2026-07-05T10:03:14.347036+00:00"},{"alias_kind":"pith_short_12","alias_value":"4BQG55S2D3OP","created_at":"2026-07-05T10:03:14.347036+00:00"},{"alias_kind":"pith_short_16","alias_value":"4BQG55S2D3OPYTBS","created_at":"2026-07-05T10:03:14.347036+00:00"},{"alias_kind":"pith_short_8","alias_value":"4BQG55S2","created_at":"2026-07-05T10:03:14.347036+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.14945","citing_title":"Unlearning Algorithmic Biases over Graphs","ref_index":28,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4BQG55S2D3OPYTBSKRLLGAZTN7","json":"https://pith.science/pith/4BQG55S2D3OPYTBSKRLLGAZTN7.json","graph_json":"https://pith.science/api/pith-number/4BQG55S2D3OPYTBSKRLLGAZTN7/graph.json","events_json":"https://pith.science/api/pith-number/4BQG55S2D3OPYTBSKRLLGAZTN7/events.json","paper":"https://pith.science/paper/4BQG55S2"},"agent_actions":{"view_html":"https://pith.science/pith/4BQG55S2D3OPYTBSKRLLGAZTN7","download_json":"https://pith.science/pith/4BQG55S2D3OPYTBSKRLLGAZTN7.json","view_paper":"https://pith.science/paper/4BQG55S2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2501.11823&json=true","fetch_graph":"https://pith.science/api/pith-number/4BQG55S2D3OPYTBSKRLLGAZTN7/graph.json","fetch_events":"https://pith.science/api/pith-number/4BQG55S2D3OPYTBSKRLLGAZTN7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4BQG55S2D3OPYTBSKRLLGAZTN7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4BQG55S2D3OPYTBSKRLLGAZTN7/action/storage_attestation","attest_author":"https://pith.science/pith/4BQG55S2D3OPYTBSKRLLGAZTN7/action/author_attestation","sign_citation":"https://pith.science/pith/4BQG55S2D3OPYTBSKRLLGAZTN7/action/citation_signature","submit_replication":"https://pith.science/pith/4BQG55S2D3OPYTBSKRLLGAZTN7/action/replication_record"}},"created_at":"2026-07-05T10:03:14.347036+00:00","updated_at":"2026-07-05T10:03:14.347036+00:00"}