{"as_of":"2026-08-16T20:46:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:83098b3ee54e16bccba6caea4c36a1944db4ed8f4931fd63f9ea4afa6bc75d72","coverage":[{"denominator":72,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":72,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T21:31:25.594383Z","state":"measured"},{"denominator":72,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":72,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2505.09702/citation-record","integrity":"/paper/2505.09702/integrity","json":"/paper/2505.09702/citation-record.json","paper":"/paper/2505.09702"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:31:27.048822Z","title":"Privacy and artificial intelligence,","venue":null,"work_id":"6bfae786-b406-449a-9c76-30f4f437919e","year":2021},"citing_paper":{"arxiv_id":"2505.09702","last_updated":"2025-05-14T18:04:02Z","snapshot_observed_at":"2026-08-16T04:04:02.072095Z","submitted_at":"2025-05-14T18:04:02Z","title":"Enabling Group Fairness in Graph Unlearning via Bi-level Debiasing","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-15T21:31:25.148290Z"},"links":{"citing_paper":"/paper/2505.09702"},"observation_digest":"sha256:9fce28c87b80e43bc45a8d7fc7c8f66a6871ed3367d36fd26b15c2aa41b13c23","observation_id":"289eb100-9025-4e7a-963f-9cf27840ab3a","resolution":{"observed_at":"2026-08-15T21:31:27.068081Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:31:27.018124Z","title":"An overview of artificial intelligence ethics,","venue":null,"work_id":"9af62ce2-efd1-4874-8b97-c86540580502","year":2022},"citing_paper":{"arxiv_id":"2505.09702","last_updated":"2025-05-14T18:04:02Z","snapshot_observed_at":"2026-08-16T04:04:02.072095Z","submitted_at":"2025-05-14T18:04:02Z","title":"Enabling Group Fairness in Graph Unlearning via Bi-level Debiasing","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-15T21:31:25.154029Z"},"links":{"citing_paper":"/paper/2505.09702"},"observation_digest":"sha256:77df55d1424889861be8b8db62293e9427f02f6b0a5f2dab79b1dea72a36cbf0","observation_id":"405eaf3d-7ae2-4c7a-9568-f8173d3557a8","resolution":{"observed_at":"2026-08-15T21:31:27.025587Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:31:26.996248Z","title":"The right to be forgotten,","venue":null,"work_id":"7f3ccc79-a02d-4c62-8b00-1697ffe61c4c","year":2011},"citing_paper":{"arxiv_id":"2505.09702","last_updated":"2025-05-14T18:04:02Z","snapshot_observed_at":"2026-08-16T04:04:02.072095Z","submitted_at":"2025-05-14T18:04:02Z","title":"Enabling Group Fairness in Graph Unlearning via Bi-level Debiasing","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-15T21:31:25.159354Z"},"links":{"citing_paper":"/paper/2505.09702"},"observation_digest":"sha256:2991074fe25c518209c4569e06c13db3c4b3e727d11417a7032732b1a29335da","observation_id":"7c0c5107-819b-4e87-92a0-25978fb2395f","resolution":{"observed_at":"2026-08-15T21:31:27.002544Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:31:26.977067Z","title":"2018 reform of eu data protection rules,","venue":null,"work_id":"00569c93-f7f8-45ee-a9e4-e74116d5b75c","year":2018},"citing_paper":{"arxiv_id":"2505.09702","last_updated":"2025-05-14T18:04:02Z","snapshot_observed_at":"2026-08-16T04:04:02.072095Z","submitted_at":"2025-05-14T18:04:02Z","title":"Enabling Group Fairness in Graph Unlearning via Bi-level Debiasing","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-15T21:31:25.165175Z"},"links":{"citing_paper":"/paper/2505.09702"},"observation_digest":"sha256:923e025e00bb0c3cc6204badb8b2259f7ca6e14bc3cdcf13f6a9a3e41762a1c0","observation_id":"4f9efdda-7cc5-4717-a9da-9f540a3a8a75","resolution":{"observed_at":"2026-08-15T21:31:26.982717Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:31:26.957336Z","title":"California consumer privacy act (ccpa),","venue":null,"work_id":"c4450c71-d38b-45d1-8cba-8604c58ebb9d","year":2018},"citing_paper":{"arxiv_id":"2505.09702","last_updated":"2025-05-14T18:04:02Z","snapshot_observed_at":"2026-08-16T04:04:02.072095Z","submitted_at":"2025-05-14T18:04:02Z","title":"Enabling Group Fairness in Graph Unlearning via Bi-level Debiasing","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-15T21:31:25.170336Z"},"links":{"citing_paper":"/paper/2505.09702"},"observation_digest":"sha256:e26fecf7a593970eaad724ba6ffde7cfbb9a0d79f6f2709523001a11c11ff351","observation_id":"f7d9c09f-c8b1-4d92-958b-0a8a2fb5f289","resolution":{"observed_at":"2026-08-15T21:31:26.963390Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:31:26.939776Z","title":"Artificial intelligence across europe: A study on awareness, attitude and trust,","venue":null,"work_id":"cc082daf-f762-4207-a369-047328abb8f6","year":2024},"citing_paper":{"arxiv_id":"2505.09702","last_updated":"2025-05-14T18:04:02Z","snapshot_observed_at":"2026-08-16T04:04:02.072095Z","submitted_at":"2025-05-14T18:04:02Z","title":"Enabling Group Fairness in Graph Unlearning via Bi-level Debiasing","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-15T21:31:25.175310Z"},"links":{"citing_paper":"/paper/2505.09702"},"observation_digest":"sha256:fa719843a62471ba8524dd19e764d0e7757691d8195d4546606946ee688490d6","observation_id":"d0d0148d-8617-4383-8d57-ee6eda8dec1d","resolution":{"observed_at":"2026-08-15T21:31:26.945223Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:31:26.923099Z","title":"Inductive rep- resentation learning on large graphs,","venue":null,"work_id":"a8b7eda9-4046-4e77-973c-2da65c412ca5","year":2017},"citing_paper":{"arxiv_id":"2505.09702","last_updated":"2025-05-14T18:04:02Z","snapshot_observed_at":"2026-08-16T04:04:02.072095Z","submitted_at":"2025-05-14T18:04:02Z","title":"Enabling Group Fairness in Graph Unlearning via Bi-level Debiasing","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-15T21:31:25.181094Z"},"links":{"citing_paper":"/paper/2505.09702"},"observation_digest":"sha256:782b8402efdae421133dd9be18d1c8456e9ac9c9380b9ab251bf0277eb5a79a4","observation_id":"486a4cbd-282a-476d-9361-838ee0b2fe53","resolution":{"observed_at":"2026-08-15T21:31:26.928498Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:31:25.186313Z","title":"Scalable graph condensation with evolving capabilities,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.09702","last_updated":"2025-05-14T18:04:02Z","snapshot_observed_at":"2026-08-16T04:04:02.072095Z","submitted_at":"2025-05-14T18:04:02Z","title":"Enabling Group Fairness in Graph Unlearning via Bi-level Debiasing","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-15T21:31:25.186313Z"},"links":{"citing_paper":"/paper/2505.09702"},"observation_digest":"sha256:1cd388c727e17d30d14c2cb60081c75ec2b3de62d9324bd5eacaed5722dc5552","observation_id":"4efdd329-eb00-49df-899f-07cf7ba431d4","resolution":{"observed_at":"2026-08-15T21:31:25.186313Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:31:26.905046Z","title":"Graph convolutional neural networks for web-scale recommender systems,","venue":null,"work_id":"58e842c2-698b-483c-addb-986f826dd25b","year":2018},"citing_paper":{"arxiv_id":"2505.09702","last_updated":"2025-05-14T18:04:02Z","snapshot_observed_at":"2026-08-16T04:04:02.072095Z","submitted_at":"2025-05-14T18:04:02Z","title":"Enabling Group Fairness in Graph Unlearning via Bi-level Debiasing","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-15T21:31:25.192589Z"},"links":{"citing_paper":"/paper/2505.09702"},"observation_digest":"sha256:c23c93975a2b1d66450badccc2574cd56e1f688e0b0c8b58523ca9d989d5d2fe","observation_id":"c25d8f9b-f4ed-4b62-9502-fb5e1d75fcbd","resolution":{"observed_at":"2026-08-15T21:31:26.910454Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:31:25.198124Z","title":"Molecular generative graph neural networks for drug discovery,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.09702","last_updated":"2025-05-14T18:04:02Z","snapshot_observed_at":"2026-08-16T04:04:02.072095Z","submitted_at":"2025-05-14T18:04:02Z","title":"Enabling Group Fairness in Graph Unlearning via Bi-level Debiasing","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-15T21:31:25.198124Z"},"links":{"citing_paper":"/paper/2505.09702"},"observation_digest":"sha256:fff83e626730b63e50374a60f38bc03657e93bc35eed761efbb1f76b4f837981","observation_id":"07920a8d-73d7-4ce8-a957-b97db8b253b0","resolution":{"observed_at":"2026-08-15T21:31:25.198124Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:31:26.869954Z","title":"A review of graph neural networks in epidemic modeling,","venue":null,"work_id":"2e58fb93-934f-4e94-bf61-7471683d043c","year":2024},"citing_paper":{"arxiv_id":"2505.09702","last_updated":"2025-05-14T18:04:02Z","snapshot_observed_at":"2026-08-16T04:04:02.072095Z","submitted_at":"2025-05-14T18:04:02Z","title":"Enabling Group Fairness in Graph Unlearning via Bi-level Debiasing","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-15T21:31:25.203333Z"},"links":{"citing_paper":"/paper/2505.09702"},"observation_digest":"sha256:abc06b941a095ee77b52249651002aa8c10ed01ab90d5b64416d0a9ca94fa924","observation_id":"76a20d5c-bf4f-40d5-8552-0bb97f428664","resolution":{"observed_at":"2026-08-15T21:31:26.879540Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:31:26.852025Z","title":"Graph unlearning,","venue":null,"work_id":"a00f92ad-12e0-4405-b183-050e4fae165c","year":2022},"citing_paper":{"arxiv_id":"2505.09702","last_updated":"2025-05-14T18:04:02Z","snapshot_observed_at":"2026-08-16T04:04:02.072095Z","submitted_at":"2025-05-14T18:04:02Z","title":"Enabling Group Fairness in Graph Unlearning via Bi-level Debiasing","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-15T21:31:25.209107Z"},"links":{"citing_paper":"/paper/2505.09702"},"observation_digest":"sha256:34016163a5172bd15998808235825f96accab169809bf748c5d33fdeefb129b2","observation_id":"09617061-b2ca-48fe-9073-6a0b8db25f8b","resolution":{"observed_at":"2026-08-15T21:31:26.856958Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2302.13406","last_updated":"2023-02-26T21:04:53Z","snapshot_observed_at":"2026-08-16T16:04:13.108191Z","submitted_at":"2023-02-26T21:04:53Z","title":"GNNDelete: A General Strategy for Unlearning in Graph Neural Networks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2302.13406","snapshot_observed_at":"2026-08-15T21:31:25.215839Z","title":"Gnndelete: A general strategy for unlearning in graph neural networks,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.09702","last_updated":"2025-05-14T18:04:02Z","snapshot_observed_at":"2026-08-16T04:04:02.072095Z","submitted_at":"2025-05-14T18:04:02Z","title":"Enabling Group Fairness in Graph Unlearning via Bi-level Debiasing","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-15T21:31:25.215839Z"},"links":{"cited_paper":"/paper/2302.13406","citing_paper":"/paper/2505.09702"},"observation_digest":"sha256:c5199fafc1917ed820f3728a0d6e9865f21d2c042183f43199deee5430d8d7d0","observation_id":"1a993085-4811-4f78-9ad0-fe014928f97f","resolution":{"observed_at":"2026-08-15T21:31:25.215839Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:31:26.834087Z","title":"Grapheditor: An efficient graph representation learning and unlearning approach,","venue":null,"work_id":"af4ba79b-f1dd-4bef-9510-4a3089526a7e","year":2022},"citing_paper":{"arxiv_id":"2505.09702","last_updated":"2025-05-14T18:04:02Z","snapshot_observed_at":"2026-08-16T04:04:02.072095Z","submitted_at":"2025-05-14T18:04:02Z","title":"Enabling Group Fairness in Graph Unlearning via Bi-level Debiasing","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-15T21:31:25.221807Z"},"links":{"citing_paper":"/paper/2505.09702"},"observation_digest":"sha256:86baa02586930acc09d08048c2311d30bad22458aec06b4acc5f362dd3623c81","observation_id":"4fb73e0f-3055-48ff-add8-919619d62b34","resolution":{"observed_at":"2026-08-15T21:31:26.839575Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:31:26.815976Z","title":"Com- bining neural networks with personalized pagerank for classification on graphs,","venue":null,"work_id":"a859124b-6559-45d8-b95b-781fddf41da9","year":2019},"citing_paper":{"arxiv_id":"2505.09702","last_updated":"2025-05-14T18:04:02Z","snapshot_observed_at":"2026-08-16T04:04:02.072095Z","submitted_at":"2025-05-14T18:04:02Z","title":"Enabling Group Fairness in Graph Unlearning via Bi-level Debiasing","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-15T21:31:25.227045Z"},"links":{"citing_paper":"/paper/2505.09702"},"observation_digest":"sha256:5279c26cafc5f9c5f85355038826a318c0fc7ead95b5016e81864c2d84b9029b","observation_id":"a4e73c7a-6b9c-4a22-a477-75595cb5fd8a","resolution":{"observed_at":"2026-08-15T21:31:26.822341Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:31:26.799169Z","title":"A survey on bias and fairness in machine learning,","venue":null,"work_id":"3fbb8cdc-75ce-4e6d-8e0e-e46191b09cd9","year":2021},"citing_paper":{"arxiv_id":"2505.09702","last_updated":"2025-05-14T18:04:02Z","snapshot_observed_at":"2026-08-16T04:04:02.072095Z","submitted_at":"2025-05-14T18:04:02Z","title":"Enabling Group Fairness in Graph Unlearning via Bi-level Debiasing","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-15T21:31:25.233010Z"},"links":{"citing_paper":"/paper/2505.09702"},"observation_digest":"sha256:84a3eb7e14c4bf05f20da61bf42d1299544b83f5fa56bf0c2fe7ea17817e5c89","observation_id":"2148f241-bbec-402d-bceb-60a1bfc307b6","resolution":{"observed_at":"2026-08-15T21:31:26.804223Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:31:26.782864Z","title":"Fairness through awareness,","venue":null,"work_id":"b18fced9-274f-4d71-a295-cf7ddc7f02ae","year":2012},"citing_paper":{"arxiv_id":"2505.09702","last_updated":"2025-05-14T18:04:02Z","snapshot_observed_at":"2026-08-16T04:04:02.072095Z","submitted_at":"2025-05-14T18:04:02Z","title":"Enabling Group Fairness in Graph Unlearning via Bi-level Debiasing","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-15T21:31:25.238296Z"},"links":{"citing_paper":"/paper/2505.09702"},"observation_digest":"sha256:416f91f0c77299aa40e899e27af4f7461b534a27c7847c572211ac8bb120c5f0","observation_id":"08b90ae5-28a8-44c0-8725-f33dc0ab0fd4","resolution":{"observed_at":"2026-08-15T21:31:26.787848Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:31:26.765271Z","title":"White admitted by stanford, black got rejections: Exploring racial stereotypes in text-to-image generation from a college admissions lens,","venue":null,"work_id":"2d06901f-a399-4c3f-bb85-6be545df61e6","year":2025},"citing_paper":{"arxiv_id":"2505.09702","last_updated":"2025-05-14T18:04:02Z","snapshot_observed_at":"2026-08-16T04:04:02.072095Z","submitted_at":"2025-05-14T18:04:02Z","title":"Enabling Group Fairness in Graph Unlearning via Bi-level Debiasing","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-15T21:31:25.243639Z"},"links":{"citing_paper":"/paper/2505.09702"},"observation_digest":"sha256:4c98f59983ae7d285dbe2e064394e3432513c09474e410f06920aaacf0850036","observation_id":"1e557a52-bfe5-426b-9e28-15891c858d9e","resolution":{"observed_at":"2026-08-15T21:31:26.771068Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:31:26.747774Z","title":"Fairness in machine learning for health- care,","venue":null,"work_id":"ec17dff5-187c-4f2b-ac45-21a58c93428c","year":2020},"citing_paper":{"arxiv_id":"2505.09702","last_updated":"2025-05-14T18:04:02Z","snapshot_observed_at":"2026-08-16T04:04:02.072095Z","submitted_at":"2025-05-14T18:04:02Z","title":"Enabling Group Fairness in Graph Unlearning via Bi-level Debiasing","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-15T21:31:25.249828Z"},"links":{"citing_paper":"/paper/2505.09702"},"observation_digest":"sha256:a0a2331f664c08dab3406b6aed9e744bebb3d998d4762c2cb2f3cdcf47d6c685","observation_id":"f898da8b-a7c7-46ef-a53b-d060ae14a659","resolution":{"observed_at":"2026-08-15T21:31:26.753398Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:31:26.729362Z","title":"Why is my classifier discriminatory?","venue":null,"work_id":"74d8124e-e120-4696-825d-05bebbf9e355","year":2018},"citing_paper":{"arxiv_id":"2505.09702","last_updated":"2025-05-14T18:04:02Z","snapshot_observed_at":"2026-08-16T04:04:02.072095Z","submitted_at":"2025-05-14T18:04:02Z","title":"Enabling Group Fairness in Graph Unlearning via Bi-level Debiasing","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-15T21:31:25.255373Z"},"links":{"citing_paper":"/paper/2505.09702"},"observation_digest":"sha256:a7d93f3e1b281751de6715b8d69ef30f0710b8ff2db83f7ad50a98aa7d85cd9a","observation_id":"56d38820-861d-4bc7-b55d-16ea97cffce1","resolution":{"observed_at":"2026-08-15T21:31:26.735089Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:31:26.710556Z","title":"Fairness in credit scoring: Assessment, implementation and profit implications,","venue":null,"work_id":"6421fc22-463d-443f-aa86-36fd435fe59b","year":2022},"citing_paper":{"arxiv_id":"2505.09702","last_updated":"2025-05-14T18:04:02Z","snapshot_observed_at":"2026-08-16T04:04:02.072095Z","submitted_at":"2025-05-14T18:04:02Z","title":"Enabling Group Fairness in Graph Unlearning via Bi-level Debiasing","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-15T21:31:25.260909Z"},"links":{"citing_paper":"/paper/2505.09702"},"observation_digest":"sha256:d980b3fd15f33426e35355b99d91d9b17b9b17e4e677466e449440fc13a6b26d","observation_id":"aef4a205-4a4c-4c85-b7a0-f20abd48f345","resolution":{"observed_at":"2026-08-15T21:31:26.715880Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:31:26.693505Z","title":"Fairness in criminal justice risk assessments: The state of the art,","venue":null,"work_id":"0e331e13-adcd-43fa-8306-0c532935f839","year":2021},"citing_paper":{"arxiv_id":"2505.09702","last_updated":"2025-05-14T18:04:02Z","snapshot_observed_at":"2026-08-16T04:04:02.072095Z","submitted_at":"2025-05-14T18:04:02Z","title":"Enabling Group Fairness in Graph Unlearning via Bi-level Debiasing","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-15T21:31:25.266442Z"},"links":{"citing_paper":"/paper/2505.09702"},"observation_digest":"sha256:1aa8018e383645ecad9407e76951d5e105eed519ce6d795801604b758f2589a8","observation_id":"4e921526-33e8-4151-8e7d-1298ce03bce4","resolution":{"observed_at":"2026-08-15T21:31:26.699080Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:31:26.675840Z","title":"Gif: A general graph unlearning strategy via influence function,","venue":null,"work_id":"c5394ba7-23e7-4666-b9c9-482579fb943e","year":2023},"citing_paper":{"arxiv_id":"2505.09702","last_updated":"2025-05-14T18:04:02Z","snapshot_observed_at":"2026-08-16T04:04:02.072095Z","submitted_at":"2025-05-14T18:04:02Z","title":"Enabling Group Fairness in Graph Unlearning via Bi-level Debiasing","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-15T21:31:25.274209Z"},"links":{"citing_paper":"/paper/2505.09702"},"observation_digest":"sha256:6ad2fa845fc01e9265c961fe748411e89cc00533560eac140696c4a258f4b813","observation_id":"cfb21ce7-443d-4512-af46-52f32de849a1","resolution":{"observed_at":"2026-08-15T21:31:26.681265Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:31:26.659464Z","title":"Fairgraph: Automated graph debiasing with gradient matching,","venue":null,"work_id":"03b1c587-7d9c-4362-af9b-6c11425ad53b","year":2023},"citing_paper":{"arxiv_id":"2505.09702","last_updated":"2025-05-14T18:04:02Z","snapshot_observed_at":"2026-08-16T04:04:02.072095Z","submitted_at":"2025-05-14T18:04:02Z","title":"Enabling Group Fairness in Graph Unlearning via Bi-level Debiasing","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-15T21:31:25.282921Z"},"links":{"citing_paper":"/paper/2505.09702"},"observation_digest":"sha256:2289c59491762e6158877007e9c5239db03dcc8919f7a6daafb013c2fe14c3dd","observation_id":"54677f73-15da-4f44-aa7e-e8e81d804683","resolution":{"observed_at":"2026-08-15T21:31:26.664772Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:31:26.642562Z","title":"Equality of oppor- tunity in supervised learning,","venue":null,"work_id":"bf78c929-a605-4f45-aa96-c2eecc7bfcdf","year":2016},"citing_paper":{"arxiv_id":"2505.09702","last_updated":"2025-05-14T18:04:02Z","snapshot_observed_at":"2026-08-16T04:04:02.072095Z","submitted_at":"2025-05-14T18:04:02Z","title":"Enabling Group Fairness in Graph Unlearning via Bi-level Debiasing","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-15T21:31:25.289903Z"},"links":{"citing_paper":"/paper/2505.09702"},"observation_digest":"sha256:26ff52100fb99cb1f041985f819183b26ea6f987bc821676edf0f33333398228","observation_id":"f208d580-2bd9-4790-9e53-02faa5f99f23","resolution":{"observed_at":"2026-08-15T21:31:26.647735Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:31:26.625512Z","title":"Fed- eraser: Enabling efficient client-level data removal from federated learning models,","venue":null,"work_id":"291c3b83-b83b-417b-a93f-7247e097dc25","year":2021},"citing_paper":{"arxiv_id":"2505.09702","last_updated":"2025-05-14T18:04:02Z","snapshot_observed_at":"2026-08-16T04:04:02.072095Z","submitted_at":"2025-05-14T18:04:02Z","title":"Enabling Group Fairness in Graph Unlearning via Bi-level Debiasing","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-15T21:31:25.297199Z"},"links":{"citing_paper":"/paper/2505.09702"},"observation_digest":"sha256:493bd58f17c452f00a3b1d605fb7041c1cb42acc3657623272f49e6c2bd647df","observation_id":"20eec577-a608-4071-97e6-1ea1c6d87c88","resolution":{"observed_at":"2026-08-15T21:31:26.630969Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2201.09441","last_updated":"2022-01-24T03:56:20Z","snapshot_observed_at":"2026-08-16T17:26:30.701956Z","submitted_at":"2022-01-24T03:56:20Z","title":"Federated Unlearning with Knowledge Distillation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2201.09441","snapshot_observed_at":"2026-08-15T21:31:25.303387Z","title":"Federated un- learning with knowledge distillation,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.09702","last_updated":"2025-05-14T18:04:02Z","snapshot_observed_at":"2026-08-16T04:04:02.072095Z","submitted_at":"2025-05-14T18:04:02Z","title":"Enabling Group Fairness in Graph Unlearning via Bi-level Debiasing","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-15T21:31:25.303387Z"},"links":{"cited_paper":"/paper/2201.09441","citing_paper":"/paper/2505.09702"},"observation_digest":"sha256:b69a1942cffd4555703ff72c32ba7283cf2b23902976f67c85d972016abc5404","observation_id":"d0b90080-5057-489d-858f-37e26da36188","resolution":{"observed_at":"2026-08-15T21:31:25.303387Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:31:26.607995Z","title":"Inductive graph unlearning,","venue":null,"work_id":"822b50e6-33f9-46d7-99ea-85f6c6c031e1","year":2023},"citing_paper":{"arxiv_id":"2505.09702","last_updated":"2025-05-14T18:04:02Z","snapshot_observed_at":"2026-08-16T04:04:02.072095Z","submitted_at":"2025-05-14T18:04:02Z","title":"Enabling Group Fairness in Graph Unlearning via Bi-level Debiasing","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-15T21:31:25.312297Z"},"links":{"citing_paper":"/paper/2505.09702"},"observation_digest":"sha256:4a9ca58b145f876f3e4bf281b22f8e41b97167403a9f2aa3b76056bdd56acf94","observation_id":"7673e3c8-8c83-4e1c-8586-57b7a5e64824","resolution":{"observed_at":"2026-08-15T21:31:26.613758Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:31:26.589058Z","title":"Machine unlearning,","venue":null,"work_id":"89dc9f71-97b9-46c8-ad76-98fa290da144","year":2021},"citing_paper":{"arxiv_id":"2505.09702","last_updated":"2025-05-14T18:04:02Z","snapshot_observed_at":"2026-08-16T04:04:02.072095Z","submitted_at":"2025-05-14T18:04:02Z","title":"Enabling Group Fairness in Graph Unlearning via Bi-level Debiasing","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-15T21:31:25.318065Z"},"links":{"citing_paper":"/paper/2505.09702"},"observation_digest":"sha256:a5df7da068f948839b7fbdfcefef87dc5f0207be8140322473e4c49a20938a28","observation_id":"9abe52b4-6d4d-49af-88b8-698817041a24","resolution":{"observed_at":"2026-08-15T21:31:26.594483Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2304.13169","last_updated":"2023-08-22T16:42:25Z","snapshot_observed_at":"2026-08-16T15:37:43.179596Z","submitted_at":"2023-04-25T22:02:09Z","title":"SAFE: Machine Unlearning With Shard Graphs","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2304.13169","snapshot_observed_at":"2026-08-15T21:31:25.324050Z","title":"Safe: Machine unlearn- ing with shard graphs,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.09702","last_updated":"2025-05-14T18:04:02Z","snapshot_observed_at":"2026-08-16T04:04:02.072095Z","submitted_at":"2025-05-14T18:04:02Z","title":"Enabling Group Fairness in Graph Unlearning via Bi-level Debiasing","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-15T21:31:25.324050Z"},"links":{"cited_paper":"/paper/2304.13169","citing_paper":"/paper/2505.09702"},"observation_digest":"sha256:248c85d90d4b992d7fa8ec4c39c25ed4e121d13051c764db7e74be5e96042b00","observation_id":"4400707d-e2ea-45af-9995-524de8d8eecd","resolution":{"observed_at":"2026-08-15T21:31:25.324050Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:31:26.571760Z","title":"Fairness beyond disparate treatment & dis- parate impact: Learning classification without disparate mistreatment,","venue":null,"work_id":"f6a7fe64-dfdc-442d-91d0-d7d4817fdf9a","year":2017},"citing_paper":{"arxiv_id":"2505.09702","last_updated":"2025-05-14T18:04:02Z","snapshot_observed_at":"2026-08-16T04:04:02.072095Z","submitted_at":"2025-05-14T18:04:02Z","title":"Enabling Group Fairness in Graph Unlearning via Bi-level Debiasing","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-15T21:31:25.330730Z"},"links":{"citing_paper":"/paper/2505.09702"},"observation_digest":"sha256:7149964eb701044d5c7e024718f708abcd0dc39bd26f70d4b5c0611bc4584747","observation_id":"ceed8ea4-e80b-455d-b2be-0ebc47c9a54e","resolution":{"observed_at":"2026-08-15T21:31:26.577262Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:31:26.553105Z","title":"Certifying and removing disparate impact,","venue":null,"work_id":"46720e66-ccba-458b-aac0-4ae9d1de6cc8","year":2015},"citing_paper":{"arxiv_id":"2505.09702","last_updated":"2025-05-14T18:04:02Z","snapshot_observed_at":"2026-08-16T04:04:02.072095Z","submitted_at":"2025-05-14T18:04:02Z","title":"Enabling Group Fairness in Graph Unlearning via Bi-level Debiasing","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-15T21:31:25.336354Z"},"links":{"citing_paper":"/paper/2505.09702"},"observation_digest":"sha256:b1bc5c2e85b4d52bd623b69730dabae25cfe3f698f120bed0e0d102e4cda7a7e","observation_id":"10bd49b9-c190-47e9-a2cd-7e45ebddce2e","resolution":{"observed_at":"2026-08-15T21:31:26.558426Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:31:26.535385Z","title":"Fair machine unlearning: Data removal while mitigating disparities,","venue":null,"work_id":"f041ba19-4f8c-4b0b-9493-35e047fe855b","year":2023},"citing_paper":{"arxiv_id":"2505.09702","last_updated":"2025-05-14T18:04:02Z","snapshot_observed_at":"2026-08-16T04:04:02.072095Z","submitted_at":"2025-05-14T18:04:02Z","title":"Enabling Group Fairness in Graph Unlearning via Bi-level Debiasing","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-15T21:31:25.341311Z"},"links":{"citing_paper":"/paper/2505.09702"},"observation_digest":"sha256:bce503542dfb2451ad7ebb49fc9c648af9823f158dc126078b41b000330dcd24","observation_id":"3377c85f-145a-4d0b-ae84-5f87b4f6dbe6","resolution":{"observed_at":"2026-08-15T21:31:26.541031Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2202.04187","last_updated":"2022-02-08T23:00:26Z","snapshot_observed_at":"2026-08-16T17:22:40.730814Z","submitted_at":"2022-02-08T23:00:26Z","title":"FMP: Toward Fair Graph Message Passing against Topology Bias","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2202.04187","snapshot_observed_at":"2026-08-15T21:31:25.348213Z","title":"Fmp: Toward fair graph message passing against topology bias,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.09702","last_updated":"2025-05-14T18:04:02Z","snapshot_observed_at":"2026-08-16T04:04:02.072095Z","submitted_at":"2025-05-14T18:04:02Z","title":"Enabling Group Fairness in Graph Unlearning via Bi-level Debiasing","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-15T21:31:25.348213Z"},"links":{"cited_paper":"/paper/2202.04187","citing_paper":"/paper/2505.09702"},"observation_digest":"sha256:178486c066d06f9bf2b9c597de7ad3db233806c89c4084f3b00b7d5f1a198ca7","observation_id":"d60ec492-d37c-4792-93a2-9551f0aa4995","resolution":{"observed_at":"2026-08-15T21:31:25.348213Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.06017","last_updated":"2024-06-18T03:55:04Z","snapshot_observed_at":"2026-08-16T16:04:43.675828Z","submitted_at":"2024-03-09T21:33:26Z","title":"Addressing Shortcomings in Fair Graph Learning Datasets: Towards a New Benchmark","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.06017","snapshot_observed_at":"2026-08-15T21:31:25.355044Z","title":"Addressing shortcomings in fair graph learning datasets: Towards a new benchmark,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.09702","last_updated":"2025-05-14T18:04:02Z","snapshot_observed_at":"2026-08-16T04:04:02.072095Z","submitted_at":"2025-05-14T18:04:02Z","title":"Enabling Group Fairness in Graph Unlearning via Bi-level Debiasing","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-15T21:31:25.355044Z"},"links":{"cited_paper":"/paper/2403.06017","citing_paper":"/paper/2505.09702"},"observation_digest":"sha256:e25f26724abefd0a04560bca94ec7b8ff1fdc1afe982df3742d5c4a9826d1b6e","observation_id":"23e613c1-a67b-40df-bc58-303e832a73b4","resolution":{"observed_at":"2026-08-15T21:31:25.355044Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:31:26.518925Z","title":"Efficient model updates for approximate unlearning of graph-structured data,","venue":null,"work_id":"52df9aed-8142-45dd-90bf-8e93e8aae64d","year":2022},"citing_paper":{"arxiv_id":"2505.09702","last_updated":"2025-05-14T18:04:02Z","snapshot_observed_at":"2026-08-16T04:04:02.072095Z","submitted_at":"2025-05-14T18:04:02Z","title":"Enabling Group Fairness in Graph Unlearning via Bi-level Debiasing","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-15T21:31:25.364622Z"},"links":{"citing_paper":"/paper/2505.09702"},"observation_digest":"sha256:452dfef1760e955254acd752fc994ec2b441e1ddf55f038de71a77cd3e3a7db9","observation_id":"fe4015fa-a801-4625-9b79-0bdaee15eb1a","resolution":{"observed_at":"2026-08-15T21:31:26.524051Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:31:26.501931Z","title":"Pri- vacy risk in machine learning: Analyzing the connection to overfitting,","venue":null,"work_id":"c2d86e1f-99d4-4e12-a0f6-727eb906847a","year":2018},"citing_paper":{"arxiv_id":"2505.09702","last_updated":"2025-05-14T18:04:02Z","snapshot_observed_at":"2026-08-16T04:04:02.072095Z","submitted_at":"2025-05-14T18:04:02Z","title":"Enabling Group Fairness in Graph Unlearning via Bi-level Debiasing","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-15T21:31:25.371707Z"},"links":{"citing_paper":"/paper/2505.09702"},"observation_digest":"sha256:997d77a30804de0e98ffa566bdf2567db5d3de75cf89e63f26ef75febe9a499e","observation_id":"ad5e6c8d-acf3-4944-a839-ea6086088b93","resolution":{"observed_at":"2026-08-15T21:31:26.507129Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:31:26.485415Z","title":"Machine unlearning: A survey,","venue":null,"work_id":"e6a25c20-b8dc-4001-9bdc-164b82b2ef18","year":2023},"citing_paper":{"arxiv_id":"2505.09702","last_updated":"2025-05-14T18:04:02Z","snapshot_observed_at":"2026-08-16T04:04:02.072095Z","submitted_at":"2025-05-14T18:04:02Z","title":"Enabling Group Fairness in Graph Unlearning via Bi-level Debiasing","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-15T21:31:25.379065Z"},"links":{"citing_paper":"/paper/2505.09702"},"observation_digest":"sha256:f9a768d19c237f85ab1ef88d3f3acda93e3b7677f44e5f04fd17a7321aa0f8db","observation_id":"53b08a21-9083-4147-9c12-507e8c521e56","resolution":{"observed_at":"2026-08-15T21:31:26.490325Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1911.04322","last_updated":"2019-11-11T15:09:32Z","snapshot_observed_at":"2026-08-16T16:04:58.463610Z","submitted_at":"2019-11-11T15:09:32Z","title":"Kernel Dependence Regularizers and Gaussian Processes with Applications to Algorithmic Fairness","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1911.04322","snapshot_observed_at":"2026-08-15T21:31:25.385870Z","title":"Kernel dependence regularizers and gaussian processes with applications to algorithmic fairness,","venue":null,"work_id":null,"year":1911},"citing_paper":{"arxiv_id":"2505.09702","last_updated":"2025-05-14T18:04:02Z","snapshot_observed_at":"2026-08-16T04:04:02.072095Z","submitted_at":"2025-05-14T18:04:02Z","title":"Enabling Group Fairness in Graph Unlearning via Bi-level Debiasing","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-15T21:31:25.385870Z"},"links":{"cited_paper":"/paper/1911.04322","citing_paper":"/paper/2505.09702"},"observation_digest":"sha256:ff2a64615cb3d73ba0d0510814ed61c0899d00d3b07c39deff9d6ff28779b319","observation_id":"5813265d-00e7-4db6-a9df-c64152eeaf43","resolution":{"observed_at":"2026-08-15T21:31:25.385870Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:31:26.467833Z","title":"Towards a unified framework for fair and stable graph representation learning,","venue":null,"work_id":"7197abe2-640e-43d7-9b10-642c6e5e2fea","year":2021},"citing_paper":{"arxiv_id":"2505.09702","last_updated":"2025-05-14T18:04:02Z","snapshot_observed_at":"2026-08-16T04:04:02.072095Z","submitted_at":"2025-05-14T18:04:02Z","title":"Enabling Group Fairness in Graph Unlearning via Bi-level Debiasing","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-15T21:31:25.393691Z"},"links":{"citing_paper":"/paper/2505.09702"},"observation_digest":"sha256:0e2de572edcb3150dd88c96e3021a7cf3a1cb4a8b6aca9d700df42fea2386861","observation_id":"0d27bfa6-8b82-481b-ad18-ff021adc3d46","resolution":{"observed_at":"2026-08-15T21:31:26.473432Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:31:26.450106Z","title":"Say no to the discrimination: Learning fair graph neural networks with limited sen- sitive attribute information,","venue":null,"work_id":"d9214c83-00b1-472a-8e49-7bc20a7ba92f","year":2021},"citing_paper":{"arxiv_id":"2505.09702","last_updated":"2025-05-14T18:04:02Z","snapshot_observed_at":"2026-08-16T04:04:02.072095Z","submitted_at":"2025-05-14T18:04:02Z","title":"Enabling Group Fairness in Graph Unlearning via Bi-level Debiasing","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-15T21:31:25.400938Z"},"links":{"citing_paper":"/paper/2505.09702"},"observation_digest":"sha256:2e8d8508e7014bb967167c0ac147c6f11e40b98923f19f2806e2f5ad50889aff","observation_id":"a40a0c57-a75d-4d14-906e-60a5df701e50","resolution":{"observed_at":"2026-08-15T21:31:26.455744Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:31:26.433330Z","title":"Edits: Modeling and mitigating data bias for graph neural networks,","venue":null,"work_id":"ebbdf2e8-ea78-42ac-a1bc-4e6167ffc6c7","year":2022},"citing_paper":{"arxiv_id":"2505.09702","last_updated":"2025-05-14T18:04:02Z","snapshot_observed_at":"2026-08-16T04:04:02.072095Z","submitted_at":"2025-05-14T18:04:02Z","title":"Enabling Group Fairness in Graph Unlearning via Bi-level Debiasing","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-15T21:31:25.408132Z"},"links":{"citing_paper":"/paper/2505.09702"},"observation_digest":"sha256:662d309f0e36e736f7412bdbab356323889cd5816777f57be2ff10506e3ae443","observation_id":"2336588b-3cce-48e9-8cc5-9c91288cc8d2","resolution":{"observed_at":"2026-08-15T21:31:26.438364Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:31:26.414947Z","title":"Stochastic methods for auc optimization subject to auc-based fairness constraints,","venue":null,"work_id":"ed857ac2-7e8e-4a57-921a-729fef691e08","year":2023},"citing_paper":{"arxiv_id":"2505.09702","last_updated":"2025-05-14T18:04:02Z","snapshot_observed_at":"2026-08-16T04:04:02.072095Z","submitted_at":"2025-05-14T18:04:02Z","title":"Enabling Group Fairness in Graph Unlearning via Bi-level Debiasing","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-15T21:31:25.413753Z"},"links":{"citing_paper":"/paper/2505.09702"},"observation_digest":"sha256:95afd398dc603aa90db4adfb404a3d2c19c63a02c4bcbb50dc87220b3768443c","observation_id":"cb8a87df-b360-4803-a860-bcaf5579680c","resolution":{"observed_at":"2026-08-15T21:31:26.421455Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:31:26.396026Z","title":"Learning fair graph representations via automated data augmenta- tions,","venue":null,"work_id":"21ce4570-2f62-4d2b-8bc3-439457d82f3b","year":2022},"citing_paper":{"arxiv_id":"2505.09702","last_updated":"2025-05-14T18:04:02Z","snapshot_observed_at":"2026-08-16T04:04:02.072095Z","submitted_at":"2025-05-14T18:04:02Z","title":"Enabling Group Fairness in Graph Unlearning via Bi-level Debiasing","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-15T21:31:25.419806Z"},"links":{"citing_paper":"/paper/2505.09702"},"observation_digest":"sha256:4ad2e098a553dc0d4760b4a56c88c3d6c45947d5dd035ab405b8051cb9ac52f3","observation_id":"6b878617-c79a-4ec4-8076-ada6ec3935f4","resolution":{"observed_at":"2026-08-15T21:31:26.401885Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:31:26.378130Z","title":"Mitigating unwanted biases with adversarial learning,","venue":null,"work_id":"05aef67d-4406-4e1b-9947-e5a98c1a5470","year":2018},"citing_paper":{"arxiv_id":"2505.09702","last_updated":"2025-05-14T18:04:02Z","snapshot_observed_at":"2026-08-16T04:04:02.072095Z","submitted_at":"2025-05-14T18:04:02Z","title":"Enabling Group Fairness in Graph Unlearning via Bi-level Debiasing","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-15T21:31:25.426609Z"},"links":{"citing_paper":"/paper/2505.09702"},"observation_digest":"sha256:a912a16a1196430443ece3335cd832d6dc59b663820e285d3529fb72d8de9d0d","observation_id":"b72caf7b-04af-4cc1-9fe9-d1455be3be32","resolution":{"observed_at":"2026-08-15T21:31:26.383469Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:31:26.361295Z","title":"Fairness-aware classifier with prejudice remover regu- larizer,","venue":null,"work_id":"5709fb75-7c14-4650-b5fb-b30c163d1cb3","year":2012},"citing_paper":{"arxiv_id":"2505.09702","last_updated":"2025-05-14T18:04:02Z","snapshot_observed_at":"2026-08-16T04:04:02.072095Z","submitted_at":"2025-05-14T18:04:02Z","title":"Enabling Group Fairness in Graph Unlearning via Bi-level Debiasing","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-15T21:31:25.433266Z"},"links":{"citing_paper":"/paper/2505.09702"},"observation_digest":"sha256:27aa9df6ba54d8a768403dd32a3160332a948bc72a45de00f75aef999cb41c76","observation_id":"88a52776-8c52-48fb-b8c8-35f5187ed592","resolution":{"observed_at":"2026-08-15T21:31:26.366397Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:31:26.343114Z","title":"Learn- ing adversarially fair and transferable representations,","venue":null,"work_id":"5ce47428-9ce2-4733-926d-a085686bba52","year":2018},"citing_paper":{"arxiv_id":"2505.09702","last_updated":"2025-05-14T18:04:02Z","snapshot_observed_at":"2026-08-16T04:04:02.072095Z","submitted_at":"2025-05-14T18:04:02Z","title":"Enabling Group Fairness in Graph Unlearning via Bi-level Debiasing","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-15T21:31:25.440307Z"},"links":{"citing_paper":"/paper/2505.09702"},"observation_digest":"sha256:50aab3be5840a4b26b1b02608be2b090c09407f914dd66131f7a07d894a79bf9","observation_id":"6e920857-656f-48b3-a844-6b8ac8febc7c","resolution":{"observed_at":"2026-08-15T21:31:26.348469Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:31:26.326472Z","title":"A comprehensive survey on trustworthy graph neural networks: Privacy, robustness, fairness, and explainability. arxiv e-prints,","venue":null,"work_id":"09025961-be5a-4b5f-9b6c-a9c26232cffb","year":2022},"citing_paper":{"arxiv_id":"2505.09702","last_updated":"2025-05-14T18:04:02Z","snapshot_observed_at":"2026-08-16T04:04:02.072095Z","submitted_at":"2025-05-14T18:04:02Z","title":"Enabling Group Fairness in Graph Unlearning via Bi-level Debiasing","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-15T21:31:25.447158Z"},"links":{"citing_paper":"/paper/2505.09702"},"observation_digest":"sha256:06a62d1b9a0612841dcc81b181de30154ea9bc3802372d65e0d82ae52dcf119c","observation_id":"c8467d18-2d1f-480c-88cb-c1203980698f","resolution":{"observed_at":"2026-08-15T21:31:26.331892Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1609.02907","last_updated":"2017-02-22T09:55:36Z","snapshot_observed_at":"2026-08-13T11:38:10.906031Z","submitted_at":"2016-09-09T19:48:41Z","title":"Semi-Supervised Classification with Graph Convolutional Networks","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1609.02907","snapshot_observed_at":"2026-08-15T21:31:25.455369Z","title":"Semi-supervised classifica- tion with graph convolutional networks,","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2505.09702","last_updated":"2025-05-14T18:04:02Z","snapshot_observed_at":"2026-08-16T04:04:02.072095Z","submitted_at":"2025-05-14T18:04:02Z","title":"Enabling Group Fairness in Graph Unlearning via Bi-level Debiasing","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-15T21:31:25.455369Z"},"links":{"cited_paper":"/paper/1609.02907","citing_paper":"/paper/2505.09702"},"observation_digest":"sha256:0618ebba637524be417813b300fa89a3265f22023e6700c6a734a3eaa4c8f846","observation_id":"a2142f3c-acdf-45f7-98cd-a40b3ca06d1d","resolution":{"observed_at":"2026-08-15T21:31:25.455369Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.08064","last_updated":"2024-07-10T21:54:12Z","snapshot_observed_at":"2026-08-16T19:11:33.709592Z","submitted_at":"2024-07-10T21:54:12Z","title":"TinyGraph: Joint Feature and Node Condensation for Graph Neural Networks","version":1},"cited_work":{"arxiv_id":"2407.08064","doi":null,"metadata_source":"pith","pith_arxiv_id":"2407.08064","snapshot_observed_at":"2026-08-15T21:31:25.742592Z","title":"TinyGraph: Joint Feature and Node Condensation for Graph Neural Networks","venue":"cs.LG","work_id":"07ba2fb7-4f25-4bc4-8fa0-1a9e52c126a2","year":2024},"citing_paper":{"arxiv_id":"2505.09702","last_updated":"2025-05-14T18:04:02Z","snapshot_observed_at":"2026-08-16T04:04:02.072095Z","submitted_at":"2025-05-14T18:04:02Z","title":"Enabling Group Fairness in Graph Unlearning via Bi-level Debiasing","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-15T21:31:25.463857Z"},"links":{"cited_paper":"/paper/2407.08064","citing_paper":"/paper/2505.09702"},"observation_digest":"sha256:364a6b2e55e0089c3a3a95238973bc3cef500bb1768dcc075a83e7a4b764faf5","observation_id":"1f57bd09-d14f-430f-9e2f-8a0ac344497c","resolution":{"observed_at":"2026-08-15T21:31:25.750718Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:31:25.470049Z","title":"Graph neural networks: A review of methods and applications,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2505.09702","last_updated":"2025-05-14T18:04:02Z","snapshot_observed_at":"2026-08-16T04:04:02.072095Z","submitted_at":"2025-05-14T18:04:02Z","title":"Enabling Group Fairness in Graph Unlearning via Bi-level Debiasing","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-15T21:31:25.470049Z"},"links":{"citing_paper":"/paper/2505.09702"},"observation_digest":"sha256:e2ffca4dc052df5b73d7be832704beb9dbfd00dd40cb5dece738cb5274a4dac7","observation_id":"b214f6af-a3af-48b3-8ce5-2bed615cf6ce","resolution":{"observed_at":"2026-08-15T21:31:25.470049Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2503.23167","last_updated":"2025-06-26T21:41:14Z","snapshot_observed_at":"2026-08-16T16:05:21.808726Z","submitted_at":"2025-03-29T17:49:34Z","title":"Graph ODEs and Beyond: A Comprehensive Survey on Integrating Differential Equations with Graph Neural Networks","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.23167","snapshot_observed_at":"2026-08-15T21:31:25.476874Z","title":"Graph odes and beyond: A comprehensive sur- vey on integrating differential equations with graph neu- ral networks,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.09702","last_updated":"2025-05-14T18:04:02Z","snapshot_observed_at":"2026-08-16T04:04:02.072095Z","submitted_at":"2025-05-14T18:04:02Z","title":"Enabling Group Fairness in Graph Unlearning via Bi-level Debiasing","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-15T21:31:25.476874Z"},"links":{"cited_paper":"/paper/2503.23167","citing_paper":"/paper/2505.09702"},"observation_digest":"sha256:cbf294e4f9a54d7810ec2b1efd33cc7992c17ff868b5d0de5299dbbedbcef97f","observation_id":"37b112c6-7aa0-41a2-aa0c-6a5d16a41928","resolution":{"observed_at":"2026-08-15T21:31:25.476874Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:31:25.482816Z","title":"A review on machine unlearning,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.09702","last_updated":"2025-05-14T18:04:02Z","snapshot_observed_at":"2026-08-16T04:04:02.072095Z","submitted_at":"2025-05-14T18:04:02Z","title":"Enabling Group Fairness in Graph Unlearning via Bi-level Debiasing","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-15T21:31:25.482816Z"},"links":{"citing_paper":"/paper/2505.09702"},"observation_digest":"sha256:fe8a55eb93b3c1a941ab195483b324973da6de55ef2d276590cd50caebb97ebd","observation_id":"ac8d14a2-390b-4420-997d-d6fe76353139","resolution":{"observed_at":"2026-08-15T21:31:25.482816Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2209.02299","last_updated":"2024-09-17T11:55:58Z","snapshot_observed_at":"2026-08-16T16:34:32.525658Z","submitted_at":"2022-09-06T08:51:53Z","title":"A Survey of Machine Unlearning","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2209.02299","snapshot_observed_at":"2026-08-15T21:31:25.487991Z","title":"A survey of machine unlearning,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.09702","last_updated":"2025-05-14T18:04:02Z","snapshot_observed_at":"2026-08-16T04:04:02.072095Z","submitted_at":"2025-05-14T18:04:02Z","title":"Enabling Group Fairness in Graph Unlearning via Bi-level Debiasing","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-15T21:31:25.487991Z"},"links":{"cited_paper":"/paper/2209.02299","citing_paper":"/paper/2505.09702"},"observation_digest":"sha256:71c3480263bcf5e874148525a50474b3a43e51d91dcb6518b530749ad73505a2","observation_id":"10a0dbf7-64e1-400a-be46-1fed54dfe90b","resolution":{"observed_at":"2026-08-15T21:31:25.487991Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:31:26.285282Z","title":"Trustworthy machine learning and ar- tificial intelligence,","venue":null,"work_id":"2c2fd18d-3e7e-4bd9-a74e-10f6acb06e94","year":2019},"citing_paper":{"arxiv_id":"2505.09702","last_updated":"2025-05-14T18:04:02Z","snapshot_observed_at":"2026-08-16T04:04:02.072095Z","submitted_at":"2025-05-14T18:04:02Z","title":"Enabling Group Fairness in Graph Unlearning via Bi-level Debiasing","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-15T21:31:25.493497Z"},"links":{"citing_paper":"/paper/2505.09702"},"observation_digest":"sha256:ab8fd801b34da1f5993cc21d96a9290145a8117da13d2e7d452357ee91805052","observation_id":"be15074a-c1f5-4310-a4f5-8988943440e4","resolution":{"observed_at":"2026-08-15T21:31:26.291107Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:31:26.262445Z","title":"Strategic and business planning practices of fast growth family firms,","venue":null,"work_id":"9971f438-d6ad-447e-9a78-ae89416295ba","year":2001},"citing_paper":{"arxiv_id":"2505.09702","last_updated":"2025-05-14T18:04:02Z","snapshot_observed_at":"2026-08-16T04:04:02.072095Z","submitted_at":"2025-05-14T18:04:02Z","title":"Enabling Group Fairness in Graph Unlearning via Bi-level Debiasing","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-15T21:31:25.498956Z"},"links":{"citing_paper":"/paper/2505.09702"},"observation_digest":"sha256:700f1114e0d5353a98c52136cf11c3a48c260dfb45a931a9df655f62e410285a","observation_id":"34df1771-2cd7-4f4d-843b-ad68c4663675","resolution":{"observed_at":"2026-08-15T21:31:26.271414Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:31:26.239598Z","title":"Charter of fundamental rights and general data protection regulation,","venue":null,"work_id":"fb785582-551b-4f4c-b89e-83aaf8866a2f","year":2019},"citing_paper":{"arxiv_id":"2505.09702","last_updated":"2025-05-14T18:04:02Z","snapshot_observed_at":"2026-08-16T04:04:02.072095Z","submitted_at":"2025-05-14T18:04:02Z","title":"Enabling Group Fairness in Graph Unlearning via Bi-level Debiasing","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-15T21:31:25.503941Z"},"links":{"citing_paper":"/paper/2505.09702"},"observation_digest":"sha256:5e30d710ac6b90ad8b2c0a7582a021acb4c3971066a33c9080ae8e7053466561","observation_id":"0cb543e1-c2e5-40ce-a65f-f65c76a60827","resolution":{"observed_at":"2026-08-15T21:31:26.245164Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:31:26.222448Z","title":"On the privacy risks of al- gorithmic fairness,","venue":null,"work_id":"77e09cbe-ee80-4b56-87a4-b1711624df55","year":2021},"citing_paper":{"arxiv_id":"2505.09702","last_updated":"2025-05-14T18:04:02Z","snapshot_observed_at":"2026-08-16T04:04:02.072095Z","submitted_at":"2025-05-14T18:04:02Z","title":"Enabling Group Fairness in Graph Unlearning via Bi-level Debiasing","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-15T21:31:25.509145Z"},"links":{"citing_paper":"/paper/2505.09702"},"observation_digest":"sha256:371a6e029c1163d31087f996a823a9d5de189194eba8dc0c3ab589cb1cfa74e0","observation_id":"13744bb8-359e-4cab-8bed-4d93d210ec79","resolution":{"observed_at":"2026-08-15T21:31:26.227730Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:31:26.204914Z","title":"Data privacy and trustworthy machine learning,","venue":null,"work_id":"08cc6971-24b2-4710-9c4d-01aa38a3693b","year":2022},"citing_paper":{"arxiv_id":"2505.09702","last_updated":"2025-05-14T18:04:02Z","snapshot_observed_at":"2026-08-16T04:04:02.072095Z","submitted_at":"2025-05-14T18:04:02Z","title":"Enabling Group Fairness in Graph Unlearning via Bi-level Debiasing","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-15T21:31:25.515120Z"},"links":{"citing_paper":"/paper/2505.09702"},"observation_digest":"sha256:f412ae99904daab3798d2b33f6c128a152b8f4845facebbab60c41bff5b4c829","observation_id":"b0c9c225-982f-46db-b42f-f62ed57dc787","resolution":{"observed_at":"2026-08-15T21:31:26.210112Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:31:26.186923Z","title":"Fairsin: Achieving fairness in graph neural networks through sensitive in- formation neutralization,","venue":null,"work_id":"59371e38-38e1-4829-b46a-bad4a1e092ca","year":2024},"citing_paper":{"arxiv_id":"2505.09702","last_updated":"2025-05-14T18:04:02Z","snapshot_observed_at":"2026-08-16T04:04:02.072095Z","submitted_at":"2025-05-14T18:04:02Z","title":"Enabling Group Fairness in Graph Unlearning via Bi-level Debiasing","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-15T21:31:25.520644Z"},"links":{"citing_paper":"/paper/2505.09702"},"observation_digest":"sha256:355a3fe3f6aaa525ecdbb5807a68aef679eae085fe850e44b0b080c76a892cfa","observation_id":"c8659b83-56aa-441d-8ca2-82ed4cca3004","resolution":{"observed_at":"2026-08-15T21:31:26.193124Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:31:26.167073Z","title":"Link prediction techniques, applications, and performance: A survey,","venue":null,"work_id":"9793fe35-7103-49e8-9144-e9fcfcea25a3","year":2020},"citing_paper":{"arxiv_id":"2505.09702","last_updated":"2025-05-14T18:04:02Z","snapshot_observed_at":"2026-08-16T04:04:02.072095Z","submitted_at":"2025-05-14T18:04:02Z","title":"Enabling Group Fairness in Graph Unlearning via Bi-level Debiasing","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-15T21:31:25.526701Z"},"links":{"citing_paper":"/paper/2505.09702"},"observation_digest":"sha256:4eb330632771f8977016a93cd7fd8552f62a7bdc33a71e3789285b9152b630d4","observation_id":"1b67cdf3-06d0-489a-80ba-9eaae0eaafe9","resolution":{"observed_at":"2026-08-15T21:31:26.172720Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1411.5118","last_updated":"2014-12-08T10:01:28Z","snapshot_observed_at":"2026-08-14T23:11:05.266492Z","submitted_at":"2014-11-19T05:51:22Z","title":"Link Prediction in Social Networks: the State-of-the-Art","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1411.5118","snapshot_observed_at":"2026-08-15T21:31:25.532038Z","title":"Link prediction 11 in social networks: the state-of-the-art,","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2505.09702","last_updated":"2025-05-14T18:04:02Z","snapshot_observed_at":"2026-08-16T04:04:02.072095Z","submitted_at":"2025-05-14T18:04:02Z","title":"Enabling Group Fairness in Graph Unlearning via Bi-level Debiasing","version":1},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-15T21:31:25.532038Z"},"links":{"cited_paper":"/paper/1411.5118","citing_paper":"/paper/2505.09702"},"observation_digest":"sha256:46444a1b99a9c2ab36064325acf38f0a9f880b3d1fcf920604bf3c57afa30372","observation_id":"062cb704-ec06-4ab2-9db3-109d318451e2","resolution":{"observed_at":"2026-08-15T21:31:25.532038Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:31:26.149112Z","title":"Fairdrop: Biased edge dropout for enhancing fairness in graph representation learning,","venue":null,"work_id":"dc2782b5-3bcf-48a2-8306-51f114909f64","year":2021},"citing_paper":{"arxiv_id":"2505.09702","last_updated":"2025-05-14T18:04:02Z","snapshot_observed_at":"2026-08-16T04:04:02.072095Z","submitted_at":"2025-05-14T18:04:02Z","title":"Enabling Group Fairness in Graph Unlearning via Bi-level Debiasing","version":1},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-15T21:31:25.537927Z"},"links":{"citing_paper":"/paper/2505.09702"},"observation_digest":"sha256:8d799f639661f7932d83fa275783343f641ef762fc675e9a76486ff1c377d027","observation_id":"88b6ca69-4f72-4752-8b14-4b3582900670","resolution":{"observed_at":"2026-08-15T21:31:26.154865Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:31:26.129981Z","title":"Promoting fairness in link prediction with graph enhancement,","venue":null,"work_id":"5cafc057-f8a4-4665-9cd7-1c334a9dd481","year":2024},"citing_paper":{"arxiv_id":"2505.09702","last_updated":"2025-05-14T18:04:02Z","snapshot_observed_at":"2026-08-16T04:04:02.072095Z","submitted_at":"2025-05-14T18:04:02Z","title":"Enabling Group Fairness in Graph Unlearning via Bi-level Debiasing","version":1},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-15T21:31:25.545861Z"},"links":{"citing_paper":"/paper/2505.09702"},"observation_digest":"sha256:fabb1d8369aaf9a5e7fbbfe64473f3b7132841c2c2e009233e85a7f311689b7f","observation_id":"c8b90d86-64bb-4817-883a-43367885923d","resolution":{"observed_at":"2026-08-15T21:31:26.135358Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:31:26.111089Z","title":"On dyadic fairness: Exploring and mitigating bias in graph connections,","venue":null,"work_id":"90659674-7e07-45b2-ad6c-a93be729e581","year":2021},"citing_paper":{"arxiv_id":"2505.09702","last_updated":"2025-05-14T18:04:02Z","snapshot_observed_at":"2026-08-16T04:04:02.072095Z","submitted_at":"2025-05-14T18:04:02Z","title":"Enabling Group Fairness in Graph Unlearning via Bi-level Debiasing","version":1},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-08-15T21:31:25.552084Z"},"links":{"citing_paper":"/paper/2505.09702"},"observation_digest":"sha256:9abea9104bccd94980fba887735f08d264afc654d5a403125f52534feae755f2","observation_id":"a945eb40-b634-46fd-825c-1ff5507a24eb","resolution":{"observed_at":"2026-08-15T21:31:26.117679Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:31:26.089249Z","title":"Towards effective and general graph unlearning via mutual evolution,","venue":null,"work_id":"c7c221f2-b757-44f5-83ea-24d896ee1e53","year":2024},"citing_paper":{"arxiv_id":"2505.09702","last_updated":"2025-05-14T18:04:02Z","snapshot_observed_at":"2026-08-16T04:04:02.072095Z","submitted_at":"2025-05-14T18:04:02Z","title":"Enabling Group Fairness in Graph Unlearning via Bi-level Debiasing","version":1},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-08-15T21:31:25.557104Z"},"links":{"citing_paper":"/paper/2505.09702"},"observation_digest":"sha256:96083a6e550e666beff67d6cb2bf2a5dba624c56bdea54e00273fef01e52ae8d","observation_id":"1e5a7e77-6b9c-430f-b99c-d8fa5ad9959d","resolution":{"observed_at":"2026-08-15T21:31:26.095031Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:31:25.563073Z","title":"Automatic differentiation in pytorch,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2505.09702","last_updated":"2025-05-14T18:04:02Z","snapshot_observed_at":"2026-08-16T04:04:02.072095Z","submitted_at":"2025-05-14T18:04:02Z","title":"Enabling Group Fairness in Graph Unlearning via Bi-level Debiasing","version":1},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-08-15T21:31:25.563073Z"},"links":{"citing_paper":"/paper/2505.09702"},"observation_digest":"sha256:e0a9e9678ee830649fb94587a5812eabd9d6cbec469fe92c058e33cf3e0c4494","observation_id":"e4154160-8422-48d0-9448-f749b9b05800","resolution":{"observed_at":"2026-08-15T21:31:25.563073Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1412.6980","last_updated":"2017-01-30T01:27:54Z","snapshot_observed_at":"2026-08-14T18:51:16.666127Z","submitted_at":"2014-12-22T13:54:29Z","title":"Adam: A Method for Stochastic Optimization","version":9},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1412.6980","snapshot_observed_at":"2026-08-15T21:31:25.569769Z","title":"Adam: A method for stochastic optimization,","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2505.09702","last_updated":"2025-05-14T18:04:02Z","snapshot_observed_at":"2026-08-16T04:04:02.072095Z","submitted_at":"2025-05-14T18:04:02Z","title":"Enabling Group Fairness in Graph Unlearning via Bi-level Debiasing","version":1},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-08-15T21:31:25.569769Z"},"links":{"cited_paper":"/paper/1412.6980","citing_paper":"/paper/2505.09702"},"observation_digest":"sha256:6d0478e1f8ee779c5395330859964a99d85592d82d7df10df0c58b15cd666fdf","observation_id":"a8947769-2832-4565-a681-1586cf5a7f67","resolution":{"observed_at":"2026-08-15T21:31:25.569769Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1903.02428","last_updated":"2019-04-25T10:06:09Z","snapshot_observed_at":"2026-08-02T18:54:43.326912Z","submitted_at":"2019-03-06T14:50:02Z","title":"Fast Graph Representation Learning with PyTorch Geometric","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1903.02428","snapshot_observed_at":"2026-08-15T21:31:25.575730Z","title":"Fast graph representa- tion learning with pytorch geometric,","venue":null,"work_id":null,"year":1903},"citing_paper":{"arxiv_id":"2505.09702","last_updated":"2025-05-14T18:04:02Z","snapshot_observed_at":"2026-08-16T04:04:02.072095Z","submitted_at":"2025-05-14T18:04:02Z","title":"Enabling Group Fairness in Graph Unlearning via Bi-level Debiasing","version":1},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-08-15T21:31:25.575730Z"},"links":{"cited_paper":"/paper/1903.02428","citing_paper":"/paper/2505.09702"},"observation_digest":"sha256:4fab6c12dcc3f163ce708917ee3847f52066090392ed9496d102fa487343e444","observation_id":"58de1a6d-aaf6-44b3-ae7c-896ecbc136af","resolution":{"observed_at":"2026-08-15T21:31:25.575730Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:31:26.055019Z","title":null,"venue":null,"work_id":"3da7d768-6201-4fc0-adff-55dd09e27477","year":1990},"citing_paper":{"arxiv_id":"2505.09702","last_updated":"2025-05-14T18:04:02Z","snapshot_observed_at":"2026-08-16T04:04:02.072095Z","submitted_at":"2025-05-14T18:04:02Z","title":"Enabling Group Fairness in Graph Unlearning via Bi-level Debiasing","version":1},"reference_index":70,"source":"pdf_text","source_observed_at":"2026-08-15T21:31:25.582137Z"},"links":{"citing_paper":"/paper/2505.09702"},"observation_digest":"sha256:3be00c366fcf66246063795000b4f6572873df2beaa9a752bf62aeaea0ad3b83","observation_id":"09f54a9e-191e-4e88-bc6c-7a123a5e30b1","resolution":{"observed_at":"2026-08-15T21:31:26.060785Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:31:26.036071Z","title":"TABLE VIII: The utility and fairness performances of FGU on German with sensitive attribute gender after unlearning","venue":null,"work_id":"c6edfba7-bdcf-43d6-89e0-4bbda9c0090c","year":null},"citing_paper":{"arxiv_id":"2505.09702","last_updated":"2025-05-14T18:04:02Z","snapshot_observed_at":"2026-08-16T04:04:02.072095Z","submitted_at":"2025-05-14T18:04:02Z","title":"Enabling Group Fairness in Graph Unlearning via Bi-level Debiasing","version":1},"reference_index":71,"source":"pdf_text","source_observed_at":"2026-08-15T21:31:25.588312Z"},"links":{"citing_paper":"/paper/2505.09702"},"observation_digest":"sha256:a5896b3bd9fbd7207e1caa61885ea1d2f5090fdf1eb7814cd15ff42b1f7173d8","observation_id":"6e5ce88f-245d-4284-b286-0bd90cd31475","resolution":{"observed_at":"2026-08-15T21:31:26.042500Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:31:26.015580Z","title":"TABLE IX: The utility and fairness performances of FGU on German with sensitive attribute gender after unlearning","venue":null,"work_id":"e4b5c0cf-a006-4c8e-a5a3-facb262cfd44","year":null},"citing_paper":{"arxiv_id":"2505.09702","last_updated":"2025-05-14T18:04:02Z","snapshot_observed_at":"2026-08-16T04:04:02.072095Z","submitted_at":"2025-05-14T18:04:02Z","title":"Enabling Group Fairness in Graph Unlearning via Bi-level Debiasing","version":1},"reference_index":72,"source":"pdf_text","source_observed_at":"2026-08-15T21:31:25.594383Z"},"links":{"citing_paper":"/paper/2505.09702"},"observation_digest":"sha256:78fcec5f435605e3fae024d4941e696559bdb878d6e22655858f3a1dcc50b67a","observation_id":"05929ec7-7071-40fb-a7e6-0d6c440593b0","resolution":{"observed_at":"2026-08-15T21:31:26.022071Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2505.09702","last_updated":"2025-05-14T18:04:02Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-16T04:04:02.072095Z","submitted_at":"2025-05-14T18:04:02Z","title":"Enabling Group Fairness in Graph Unlearning via Bi-level Debiasing"},"reference_resolution":{"displayed":72,"state_counts":{"malformed_identifier":2,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":18,"verified_exact":1,"verified_fuzzy":51},"total_outbound_references":72},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 72 of 72 outbound references and 0 inbound Pith citation observations for arXiv:2505.09702."}