{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:AEH2VDLKX2C7E63Z2T2OCNYCJL","short_pith_number":"pith:AEH2VDLK","canonical_record":{"source":{"id":"2505.09702","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-05-14T18:04:02Z","cross_cats_sorted":[],"title_canon_sha256":"0b82e62fe9b39a7bc4ec02f395ef90ed8177fb6520d1404f19beb811f6bbcee1","abstract_canon_sha256":"2f273ab262a9de4b87b8a4bda0da744af557a818eea168071cfb384e6171e242"},"schema_version":"1.0"},"canonical_sha256":"010faa8d6abe85f27b79d4f4e137024ae5d8b31554bd730f309bbe25dcaeeca3","source":{"kind":"arxiv","id":"2505.09702","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.09702","created_at":"2026-07-05T11:03:27Z"},{"alias_kind":"arxiv_version","alias_value":"2505.09702v1","created_at":"2026-07-05T11:03:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.09702","created_at":"2026-07-05T11:03:27Z"},{"alias_kind":"pith_short_12","alias_value":"AEH2VDLKX2C7","created_at":"2026-07-05T11:03:27Z"},{"alias_kind":"pith_short_16","alias_value":"AEH2VDLKX2C7E63Z","created_at":"2026-07-05T11:03:27Z"},{"alias_kind":"pith_short_8","alias_value":"AEH2VDLK","created_at":"2026-07-05T11:03:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:AEH2VDLKX2C7E63Z2T2OCNYCJL","target":"record","payload":{"canonical_record":{"source":{"id":"2505.09702","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-05-14T18:04:02Z","cross_cats_sorted":[],"title_canon_sha256":"0b82e62fe9b39a7bc4ec02f395ef90ed8177fb6520d1404f19beb811f6bbcee1","abstract_canon_sha256":"2f273ab262a9de4b87b8a4bda0da744af557a818eea168071cfb384e6171e242"},"schema_version":"1.0"},"canonical_sha256":"010faa8d6abe85f27b79d4f4e137024ae5d8b31554bd730f309bbe25dcaeeca3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:03:27.205871Z","signature_b64":"4NjacS9KtWULZYpAia9SWysZPMCaqHzyypFtbm/CudpoRxXK5MXN4SXVQMvaq1dCzEpQ4aHeH+bODdQ1mxXNAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"010faa8d6abe85f27b79d4f4e137024ae5d8b31554bd730f309bbe25dcaeeca3","last_reissued_at":"2026-07-05T11:03:27.205394Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:03:27.205394Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2505.09702","source_version":1,"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-07-05T11:03:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1a5aqbePNLl/Rr95BPePvwFobXXACyZ415y9jc/OA0VWe6mdvw3kLBkmVBexcVdSwU7v1aJfXBTE12mrW0yxBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T05:06:01.922612Z"},"content_sha256":"9d32ae6fa492e60282575f912cbebdaa23f9bfd02f52b98d2880caa677d66860","schema_version":"1.0","event_id":"sha256:9d32ae6fa492e60282575f912cbebdaa23f9bfd02f52b98d2880caa677d66860"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:AEH2VDLKX2C7E63Z2T2OCNYCJL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Enabling Group Fairness in Graph Unlearning via Bi-level Debiasing","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Hanning Chen, Mohsen Imani, Prathyush Poduval, Wenjun Huang, Yang Ni, Yezi Liu","submitted_at":"2025-05-14T18:04:02Z","abstract_excerpt":"Graph unlearning is a crucial approach for protecting user privacy by erasing the influence of user data on trained graph models. Recent developments in graph unlearning methods have primarily focused on maintaining model prediction performance while removing user information. However, we have observed that when user information is deleted from the model, the prediction distribution across different sensitive groups often changes. Furthermore, graph models are shown to be prone to amplifying biases, making the study of fairness in graph unlearning particularly important. This raises the questi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.09702","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/2505.09702/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T11:03:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cgpTejLXznUHPzfmwhglqnf8eJ9ORK7rl6tUYdMH2POtGnFlk1LIGy7txkIssNTAbnwA3HsEBtILmHjq8cqvDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T05:06:01.923098Z"},"content_sha256":"4bf22d3e8b52434786de8893bbd9f9e3d638ad54c6948375e429b511641accb1","schema_version":"1.0","event_id":"sha256:4bf22d3e8b52434786de8893bbd9f9e3d638ad54c6948375e429b511641accb1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AEH2VDLKX2C7E63Z2T2OCNYCJL/bundle.json","state_url":"https://pith.science/pith/AEH2VDLKX2C7E63Z2T2OCNYCJL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AEH2VDLKX2C7E63Z2T2OCNYCJL/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-08-16T05:06:01Z","links":{"resolver":"https://pith.science/pith/AEH2VDLKX2C7E63Z2T2OCNYCJL","bundle":"https://pith.science/pith/AEH2VDLKX2C7E63Z2T2OCNYCJL/bundle.json","state":"https://pith.science/pith/AEH2VDLKX2C7E63Z2T2OCNYCJL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AEH2VDLKX2C7E63Z2T2OCNYCJL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:AEH2VDLKX2C7E63Z2T2OCNYCJL","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":"2f273ab262a9de4b87b8a4bda0da744af557a818eea168071cfb384e6171e242","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-05-14T18:04:02Z","title_canon_sha256":"0b82e62fe9b39a7bc4ec02f395ef90ed8177fb6520d1404f19beb811f6bbcee1"},"schema_version":"1.0","source":{"id":"2505.09702","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.09702","created_at":"2026-07-05T11:03:27Z"},{"alias_kind":"arxiv_version","alias_value":"2505.09702v1","created_at":"2026-07-05T11:03:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.09702","created_at":"2026-07-05T11:03:27Z"},{"alias_kind":"pith_short_12","alias_value":"AEH2VDLKX2C7","created_at":"2026-07-05T11:03:27Z"},{"alias_kind":"pith_short_16","alias_value":"AEH2VDLKX2C7E63Z","created_at":"2026-07-05T11:03:27Z"},{"alias_kind":"pith_short_8","alias_value":"AEH2VDLK","created_at":"2026-07-05T11:03:27Z"}],"graph_snapshots":[{"event_id":"sha256:4bf22d3e8b52434786de8893bbd9f9e3d638ad54c6948375e429b511641accb1","target":"graph","created_at":"2026-07-05T11:03:27Z","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":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2505.09702/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Graph unlearning is a crucial approach for protecting user privacy by erasing the influence of user data on trained graph models. Recent developments in graph unlearning methods have primarily focused on maintaining model prediction performance while removing user information. However, we have observed that when user information is deleted from the model, the prediction distribution across different sensitive groups often changes. Furthermore, graph models are shown to be prone to amplifying biases, making the study of fairness in graph unlearning particularly important. This raises the questi","authors_text":"Hanning Chen, Mohsen Imani, Prathyush Poduval, Wenjun Huang, Yang Ni, Yezi Liu","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-05-14T18:04:02Z","title":"Enabling Group Fairness in Graph Unlearning via Bi-level Debiasing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.09702","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:9d32ae6fa492e60282575f912cbebdaa23f9bfd02f52b98d2880caa677d66860","target":"record","created_at":"2026-07-05T11:03:27Z","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":"2f273ab262a9de4b87b8a4bda0da744af557a818eea168071cfb384e6171e242","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-05-14T18:04:02Z","title_canon_sha256":"0b82e62fe9b39a7bc4ec02f395ef90ed8177fb6520d1404f19beb811f6bbcee1"},"schema_version":"1.0","source":{"id":"2505.09702","kind":"arxiv","version":1}},"canonical_sha256":"010faa8d6abe85f27b79d4f4e137024ae5d8b31554bd730f309bbe25dcaeeca3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"010faa8d6abe85f27b79d4f4e137024ae5d8b31554bd730f309bbe25dcaeeca3","first_computed_at":"2026-07-05T11:03:27.205394Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:03:27.205394Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4NjacS9KtWULZYpAia9SWysZPMCaqHzyypFtbm/CudpoRxXK5MXN4SXVQMvaq1dCzEpQ4aHeH+bODdQ1mxXNAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T11:03:27.205871Z","signed_message":"canonical_sha256_bytes"},"source_id":"2505.09702","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9d32ae6fa492e60282575f912cbebdaa23f9bfd02f52b98d2880caa677d66860","sha256:4bf22d3e8b52434786de8893bbd9f9e3d638ad54c6948375e429b511641accb1"],"state_sha256":"7d7714f5a4e6b54ee0b8eed83f8c1bf9ebec8338c6407f9effbad1f4048cd061"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8h7RLjp6i2B+utJwRlsuiudozaNTwyhbJcH7DJThm+6MnpChb+dsTGJHs5werGtZuBuViZUiuPXpdK3ERDw3Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T05:06:01.926431Z","bundle_sha256":"672fd9205b5863718af24cb15e917d93ee0c83781196a8c5ba1fa7b5e569fdf1"}}