{"as_of":"2026-08-09T20:36:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:6ffd4e55b4ec30c6016a03730fcb65da9569435b4cc161a72c8d476a57c6c6c3","coverage":[{"denominator":67,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":67,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T15:33:57.459963Z","state":"measured"},{"denominator":67,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":67,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+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.14945/citation-record","integrity":"/paper/2505.14945/integrity","json":"/paper/2505.14945/citation-record.json","paper":"/paper/2505.14945"},"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-07T15:34:12.467642Z","title":"Uk biobank: an open access resource for identifying the causes of a wide range of complex diseases of middle and old age,","venue":null,"work_id":"e82d8b81-586e-48aa-996e-7c3267bdb4e8","year":2015},"citing_paper":{"arxiv_id":"2505.14945","last_updated":"2025-05-20T22:12:53Z","snapshot_observed_at":"2026-08-09T01:18:02.155442Z","submitted_at":"2025-05-20T22:12:53Z","title":"Unlearning Algorithmic Biases over Graphs","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T15:33:49.175457Z"},"links":{"citing_paper":"/paper/2505.14945"},"observation_digest":"sha256:a18acf366377f0b08b24fb811fe38a35ab6e3283efdd32bb08f27cadf976ce75","observation_id":"7820b7db-dc47-4029-b04b-455690f8aa64","resolution":{"observed_at":"2026-08-07T15:34:12.648837Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T15:34:12.333241Z","title":"Making AI forget you: Data deletion in machine learning,","venue":null,"work_id":"de039897-933e-4c53-96a8-931accadf648","year":2019},"citing_paper":{"arxiv_id":"2505.14945","last_updated":"2025-05-20T22:12:53Z","snapshot_observed_at":"2026-08-09T01:18:02.155442Z","submitted_at":"2025-05-20T22:12:53Z","title":"Unlearning Algorithmic Biases over Graphs","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T15:33:49.314411Z"},"links":{"citing_paper":"/paper/2505.14945"},"observation_digest":"sha256:3742ceacb7c5d8d93629fda6c086c8e082f5e7d61ce5116adb44146df4063257","observation_id":"14246153-bc2b-475e-94c0-dd3c9c9ad0cd","resolution":{"observed_at":"2026-08-07T15:34:12.386385Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T15:34:12.186148Z","title":"What is GDPR, the EU’s new data protecion law?","venue":null,"work_id":"6b3a2667-f1b5-4e2c-819c-0448afd0ade2","year":2025},"citing_paper":{"arxiv_id":"2505.14945","last_updated":"2025-05-20T22:12:53Z","snapshot_observed_at":"2026-08-09T01:18:02.155442Z","submitted_at":"2025-05-20T22:12:53Z","title":"Unlearning Algorithmic Biases over Graphs","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T15:33:49.461704Z"},"links":{"citing_paper":"/paper/2505.14945"},"observation_digest":"sha256:fcf7d95f6a2a0e7ee14db1a1af7fd103b18029fd83a639aa95ca7353267063f7","observation_id":"d984ea01-616e-466d-9e63-17bef39b6bb6","resolution":{"observed_at":"2026-08-07T15:34:12.262837Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T15:34:12.025528Z","title":"Remember what you want to forget: Algorithms for machine unlearning,","venue":null,"work_id":"4f9217d5-c1ac-486d-a955-478e0ab8119f","year":2021},"citing_paper":{"arxiv_id":"2505.14945","last_updated":"2025-05-20T22:12:53Z","snapshot_observed_at":"2026-08-09T01:18:02.155442Z","submitted_at":"2025-05-20T22:12:53Z","title":"Unlearning Algorithmic Biases over Graphs","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T15:33:49.617655Z"},"links":{"citing_paper":"/paper/2505.14945"},"observation_digest":"sha256:a1a8ca8002a0c0633d2df0b74efef8f165368f2ad6ad519efb9182d5991d7e3d","observation_id":"94f77c46-1dc4-40d1-9181-a3f083446f37","resolution":{"observed_at":"2026-08-07T15:34:12.104493Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T15:34:11.836062Z","title":"Certified data removal from machine learning models,","venue":null,"work_id":"3d14060d-36fd-49cd-ac50-3a5c704dbb0b","year":2020},"citing_paper":{"arxiv_id":"2505.14945","last_updated":"2025-05-20T22:12:53Z","snapshot_observed_at":"2026-08-09T01:18:02.155442Z","submitted_at":"2025-05-20T22:12:53Z","title":"Unlearning Algorithmic Biases over Graphs","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T15:33:49.797169Z"},"links":{"citing_paper":"/paper/2505.14945"},"observation_digest":"sha256:779d538c055d753fcba4646b4ddc4c43630a59efe38e773a9d0c9c666b2ff789","observation_id":"0a0fbd17-645b-4ec5-9469-55bf67ad854f","resolution":{"observed_at":"2026-08-07T15:34:11.933581Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T15:34:11.588052Z","title":"Machine unlearning,","venue":null,"work_id":"198cfcd3-e68f-4598-8373-40d77513a2c6","year":2021},"citing_paper":{"arxiv_id":"2505.14945","last_updated":"2025-05-20T22:12:53Z","snapshot_observed_at":"2026-08-09T01:18:02.155442Z","submitted_at":"2025-05-20T22:12:53Z","title":"Unlearning Algorithmic Biases over Graphs","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T15:33:49.952520Z"},"links":{"citing_paper":"/paper/2505.14945"},"observation_digest":"sha256:78d57c4f8bacaedd1c598aec4d7dc1d54856a51394a7f0146e90889b0e4dc5c3","observation_id":"732cfeef-579f-4820-8bf6-1960f32d3e6c","resolution":{"observed_at":"2026-08-07T15:34:11.731082Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T15:34:11.447640Z","title":"Approximate data deletion from machine learning models,","venue":null,"work_id":"e86546e6-7681-4ca9-94ee-16bff51f5a88","year":2021},"citing_paper":{"arxiv_id":"2505.14945","last_updated":"2025-05-20T22:12:53Z","snapshot_observed_at":"2026-08-09T01:18:02.155442Z","submitted_at":"2025-05-20T22:12:53Z","title":"Unlearning Algorithmic Biases over Graphs","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T15:33:50.126226Z"},"links":{"citing_paper":"/paper/2505.14945"},"observation_digest":"sha256:f369377baa6f83d4b4b1dfd6583eea4ee788c773104116b217dd8dbb93c84943","observation_id":"b5c9d107-128f-48fa-8200-2a57658eb1e9","resolution":{"observed_at":"2026-08-07T15:34:11.503092Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T15:34:11.171703Z","title":"Descent-to-delete: Gradient-based methods for machine unlearning,","venue":null,"work_id":"c74b7142-624d-46d2-a43b-4c6e869c6b17","year":2021},"citing_paper":{"arxiv_id":"2505.14945","last_updated":"2025-05-20T22:12:53Z","snapshot_observed_at":"2026-08-09T01:18:02.155442Z","submitted_at":"2025-05-20T22:12:53Z","title":"Unlearning Algorithmic Biases over Graphs","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T15:33:50.267504Z"},"links":{"citing_paper":"/paper/2505.14945"},"observation_digest":"sha256:b2e38ac8646286c9100de451b3874d0e9ebc9a682c1a142d0a609f30954799aa","observation_id":"9b9e59ad-6012-4bfc-8672-471751f05a2b","resolution":{"observed_at":"2026-08-07T15:34:11.296053Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T15:34:10.998545Z","title":"Graph representation learning,","venue":null,"work_id":"02694fb0-1f3c-4075-93ee-3a214ee25177","year":2020},"citing_paper":{"arxiv_id":"2505.14945","last_updated":"2025-05-20T22:12:53Z","snapshot_observed_at":"2026-08-09T01:18:02.155442Z","submitted_at":"2025-05-20T22:12:53Z","title":"Unlearning Algorithmic Biases over Graphs","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T15:33:50.364758Z"},"links":{"citing_paper":"/paper/2505.14945"},"observation_digest":"sha256:5aca00cbf23f96a150554f93d0aef697aab5889906ed2e84532ec1bedf247cd7","observation_id":"94d1ef2f-d500-4337-b44b-223101839c64","resolution":{"observed_at":"2026-08-07T15:34:11.102324Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T15:34:10.762646Z","title":"GIF: A general graph unlearning strategy via influence function,","venue":null,"work_id":"56a8b03b-97d2-4854-86a6-1dc8558d3139","year":2023},"citing_paper":{"arxiv_id":"2505.14945","last_updated":"2025-05-20T22:12:53Z","snapshot_observed_at":"2026-08-09T01:18:02.155442Z","submitted_at":"2025-05-20T22:12:53Z","title":"Unlearning Algorithmic Biases over Graphs","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T15:33:50.507724Z"},"links":{"citing_paper":"/paper/2505.14945"},"observation_digest":"sha256:85655b013f355b56c964f608d3b50fa854eb41f0915874eb51309383f1107a23","observation_id":"12d5994d-2dd7-45b5-bc52-c217ec322a84","resolution":{"observed_at":"2026-08-07T15:34:10.846715Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T15:34:10.573513Z","title":"Certified graph unlearning,","venue":null,"work_id":"c078a9e0-fcf8-46cd-9853-21f794cedab6","year":2022},"citing_paper":{"arxiv_id":"2505.14945","last_updated":"2025-05-20T22:12:53Z","snapshot_observed_at":"2026-08-09T01:18:02.155442Z","submitted_at":"2025-05-20T22:12:53Z","title":"Unlearning Algorithmic Biases over Graphs","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T15:33:50.680800Z"},"links":{"citing_paper":"/paper/2505.14945"},"observation_digest":"sha256:14b264d0700c268d6904a479ffe1bf050cdb803112dfca8285252f051f96d3cc","observation_id":"5c49328d-56ff-4383-a075-9e23039f6e8a","resolution":{"observed_at":"2026-08-07T15:34:10.669540Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T15:34:10.369173Z","title":"Certified edge unlearning for graph neural networks,","venue":null,"work_id":"58f19815-7c67-4429-a7c8-27efeff21c56","year":2023},"citing_paper":{"arxiv_id":"2505.14945","last_updated":"2025-05-20T22:12:53Z","snapshot_observed_at":"2026-08-09T01:18:02.155442Z","submitted_at":"2025-05-20T22:12:53Z","title":"Unlearning Algorithmic Biases over Graphs","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T15:33:50.836508Z"},"links":{"citing_paper":"/paper/2505.14945"},"observation_digest":"sha256:e7741d821488b31c7ab2f2722d792d1a050d4883d69405068e3a58bb1fe83526","observation_id":"c9fd5b09-3caa-467c-9e1f-7078118a6d61","resolution":{"observed_at":"2026-08-07T15:34:10.455292Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T15:34:10.163696Z","title":"IDEA: A flexible framework of certified unlearning for graph neural networks,","venue":null,"work_id":"b019adc0-c1ce-4efd-bf37-694addd966b3","year":2024},"citing_paper":{"arxiv_id":"2505.14945","last_updated":"2025-05-20T22:12:53Z","snapshot_observed_at":"2026-08-09T01:18:02.155442Z","submitted_at":"2025-05-20T22:12:53Z","title":"Unlearning Algorithmic Biases over Graphs","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T15:33:50.988179Z"},"links":{"citing_paper":"/paper/2505.14945"},"observation_digest":"sha256:a1454f530f4a5ae20e3ad3c7178883ac300262d1df86a6dbdb4e865975e6b13f","observation_id":"ba761b12-350f-4e81-b4f0-8910a254560a","resolution":{"observed_at":"2026-08-07T15:34:10.278330Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T15:34:09.932154Z","title":"Unlearning graph classifiers with limited data resources,","venue":null,"work_id":"3430dae4-98a0-44aa-8dd8-fe2f2bd511ca","year":2023},"citing_paper":{"arxiv_id":"2505.14945","last_updated":"2025-05-20T22:12:53Z","snapshot_observed_at":"2026-08-09T01:18:02.155442Z","submitted_at":"2025-05-20T22:12:53Z","title":"Unlearning Algorithmic Biases over Graphs","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T15:33:51.108961Z"},"links":{"citing_paper":"/paper/2505.14945"},"observation_digest":"sha256:7dac73b3eb629e687958fb6fdc16c021b7f3a16254c49af4bec5327599b93627","observation_id":"e501634f-a9a3-4573-b9e9-3f4c8f4efb7a","resolution":{"observed_at":"2026-08-07T15:34:10.005103Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T15:34:09.652793Z","title":"Say no to the discrimination: Learning fair graph neural networks with limited sensitive attribute information,","venue":null,"work_id":"ba9e9706-e1ce-492c-854e-51753a433f23","year":2021},"citing_paper":{"arxiv_id":"2505.14945","last_updated":"2025-05-20T22:12:53Z","snapshot_observed_at":"2026-08-09T01:18:02.155442Z","submitted_at":"2025-05-20T22:12:53Z","title":"Unlearning Algorithmic Biases over Graphs","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T15:33:51.204960Z"},"links":{"citing_paper":"/paper/2505.14945"},"observation_digest":"sha256:6efde75b2d2b875ef75de6da05865ed1ece97795451599bb60870fbd88cf6663","observation_id":"9829edde-03fc-41b6-b352-dab4ee12f83c","resolution":{"observed_at":"2026-08-07T15:34:09.788538Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T15:34:09.412843Z","title":"Fairness in graph mining: A survey,","venue":null,"work_id":"8c927fbd-6b1b-409f-910e-05497c149fa7","year":2023},"citing_paper":{"arxiv_id":"2505.14945","last_updated":"2025-05-20T22:12:53Z","snapshot_observed_at":"2026-08-09T01:18:02.155442Z","submitted_at":"2025-05-20T22:12:53Z","title":"Unlearning Algorithmic Biases over Graphs","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T15:33:51.337745Z"},"links":{"citing_paper":"/paper/2505.14945"},"observation_digest":"sha256:f764475a44bd356c99f1787e3d4e78d08013c74427d9ebff1be529f646a5552b","observation_id":"56920406-8f57-4536-a671-79cc1394409a","resolution":{"observed_at":"2026-08-07T15:34:09.546774Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T15:34:09.158501Z","title":"Fast model debias with machine unlearning,","venue":null,"work_id":"2929188c-dcb4-4dbb-9f0f-cc8c1690ca40","year":2023},"citing_paper":{"arxiv_id":"2505.14945","last_updated":"2025-05-20T22:12:53Z","snapshot_observed_at":"2026-08-09T01:18:02.155442Z","submitted_at":"2025-05-20T22:12:53Z","title":"Unlearning Algorithmic Biases over Graphs","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T15:33:51.445418Z"},"links":{"citing_paper":"/paper/2505.14945"},"observation_digest":"sha256:533d7d78ba87033dd8459fc41561688d4b8a623c075c355417278ca032639f27","observation_id":"53c2f018-c84a-46f9-921a-3a0f8f38ce61","resolution":{"observed_at":"2026-08-07T15:34:09.275639Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T15:34:08.881758Z","title":"Debayes: A Bayesian method for debiasing network embeddings,","venue":null,"work_id":"fdeda851-88e2-492a-9dfe-626cfe8a5dcd","year":2020},"citing_paper":{"arxiv_id":"2505.14945","last_updated":"2025-05-20T22:12:53Z","snapshot_observed_at":"2026-08-09T01:18:02.155442Z","submitted_at":"2025-05-20T22:12:53Z","title":"Unlearning Algorithmic Biases over Graphs","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T15:33:51.587459Z"},"links":{"citing_paper":"/paper/2505.14945"},"observation_digest":"sha256:c25931fa2d72a64da8d29f7522ae48f7d332bcfce08e674a6b80caef53116b33","observation_id":"00d1b7fe-0b17-4c07-87c3-5453ef46290f","resolution":{"observed_at":"2026-08-07T15:34:09.033964Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T15:34:08.661489Z","title":"Compositional fairness constraints for graph embeddings,","venue":null,"work_id":"26377915-37e2-4926-99bb-513cc943cd64","year":2019},"citing_paper":{"arxiv_id":"2505.14945","last_updated":"2025-05-20T22:12:53Z","snapshot_observed_at":"2026-08-09T01:18:02.155442Z","submitted_at":"2025-05-20T22:12:53Z","title":"Unlearning Algorithmic Biases over Graphs","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T15:33:51.732980Z"},"links":{"citing_paper":"/paper/2505.14945"},"observation_digest":"sha256:996a10081a09febc012c04e49fb8203e44ab8ff83352217b1867d9078e8366bb","observation_id":"753b47ed-d2cd-4b20-95bc-4c37a0b38c33","resolution":{"observed_at":"2026-08-07T15:34:08.771020Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T15:34:08.431034Z","title":"Towards a unified framework for fair and stable graph representation learning,","venue":null,"work_id":"73bc73b7-f6a7-46b6-a3a4-7ac22c1e068a","year":2021},"citing_paper":{"arxiv_id":"2505.14945","last_updated":"2025-05-20T22:12:53Z","snapshot_observed_at":"2026-08-09T01:18:02.155442Z","submitted_at":"2025-05-20T22:12:53Z","title":"Unlearning Algorithmic Biases over Graphs","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T15:33:51.804269Z"},"links":{"citing_paper":"/paper/2505.14945"},"observation_digest":"sha256:9832d2c42705482e18b3cb37fd8f5b2a69e6ec5dc5ba0e1efc61197648ee6548","observation_id":"09282eb9-65af-410a-933d-97000e86f36a","resolution":{"observed_at":"2026-08-07T15:34:08.545368Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T15:34:08.172195Z","title":"Demystifying and mitigating bias for node representation learning,","venue":null,"work_id":"9b3ff709-2055-49c4-be0a-7e24a2fed1ba","year":2023},"citing_paper":{"arxiv_id":"2505.14945","last_updated":"2025-05-20T22:12:53Z","snapshot_observed_at":"2026-08-09T01:18:02.155442Z","submitted_at":"2025-05-20T22:12:53Z","title":"Unlearning Algorithmic Biases over Graphs","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-07T15:33:51.890768Z"},"links":{"citing_paper":"/paper/2505.14945"},"observation_digest":"sha256:e33d59d1a2471f47caff7717378761735b2f1fe6623fd6001f2a569ea6377dea","observation_id":"9657ff8e-dfd1-45dd-958f-f7d3eee57988","resolution":{"observed_at":"2026-08-07T15:34:08.319908Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T15:34:07.899809Z","title":"Fairdrop: Biased edge dropout for en- hancing fairness in graph representation learning,","venue":null,"work_id":"237c2c8a-4550-46b5-84af-997aebe9e49e","year":2021},"citing_paper":{"arxiv_id":"2505.14945","last_updated":"2025-05-20T22:12:53Z","snapshot_observed_at":"2026-08-09T01:18:02.155442Z","submitted_at":"2025-05-20T22:12:53Z","title":"Unlearning Algorithmic Biases over Graphs","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-07T15:33:51.971136Z"},"links":{"citing_paper":"/paper/2505.14945"},"observation_digest":"sha256:5277eb0a96fc4e092c00c1f8ab221a4327cc48fa47eeacdd5ec8b562eaabbe3d","observation_id":"4015d149-d905-4959-924b-2dab2b3a65ff","resolution":{"observed_at":"2026-08-07T15:34:08.034282Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T15:34:07.682371Z","title":"Graph unlearning,","venue":null,"work_id":"947ee7d4-36aa-44be-b180-3a37c82df0e5","year":2022},"citing_paper":{"arxiv_id":"2505.14945","last_updated":"2025-05-20T22:12:53Z","snapshot_observed_at":"2026-08-09T01:18:02.155442Z","submitted_at":"2025-05-20T22:12:53Z","title":"Unlearning Algorithmic Biases over Graphs","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-07T15:33:52.114075Z"},"links":{"citing_paper":"/paper/2505.14945"},"observation_digest":"sha256:20f9138971c7b5c5565c615c30fbadc5d0fb8ea4486a1a306df19606783c21a9","observation_id":"cd9637e2-7dc0-4d0e-ae62-c559078c69d2","resolution":{"observed_at":"2026-08-07T15:34:07.774504Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T15:34:07.419606Z","title":"Inductive graph unlearning,","venue":null,"work_id":"7561e2b7-dc3b-4e42-bef9-07f7766da4ce","year":2023},"citing_paper":{"arxiv_id":"2505.14945","last_updated":"2025-05-20T22:12:53Z","snapshot_observed_at":"2026-08-09T01:18:02.155442Z","submitted_at":"2025-05-20T22:12:53Z","title":"Unlearning Algorithmic Biases over Graphs","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-07T15:33:52.250474Z"},"links":{"citing_paper":"/paper/2505.14945"},"observation_digest":"sha256:a2340a6b8bc1d00ceffac47f404d37648be98cb8424146ad4c757a6a2c07c840","observation_id":"02522dc0-f8ba-4fe7-b5df-dded0c3cfa87","resolution":{"observed_at":"2026-08-07T15:34:07.540098Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T15:34:07.119773Z","title":"Graph unlearning with efficient partial retraining,","venue":null,"work_id":"e26c2dfd-ebc1-4df8-a07d-59a819fd652e","year":2024},"citing_paper":{"arxiv_id":"2505.14945","last_updated":"2025-05-20T22:12:53Z","snapshot_observed_at":"2026-08-09T01:18:02.155442Z","submitted_at":"2025-05-20T22:12:53Z","title":"Unlearning Algorithmic Biases over Graphs","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-07T15:33:52.408913Z"},"links":{"citing_paper":"/paper/2505.14945"},"observation_digest":"sha256:0d26b3ae5d5935165573156c11d5bde9463efc6310ef211e4f5b632abb654f90","observation_id":"0f14dfd2-1752-4a0b-8d46-b3c6d67e38d2","resolution":{"observed_at":"2026-08-07T15:34:07.250378Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T15:34:06.893899Z","title":"GNNDelete: A general strategy for unlearning in graph neural networks,","venue":null,"work_id":"b87e892a-9722-4316-b4a2-50d3856f8424","year":2023},"citing_paper":{"arxiv_id":"2505.14945","last_updated":"2025-05-20T22:12:53Z","snapshot_observed_at":"2026-08-09T01:18:02.155442Z","submitted_at":"2025-05-20T22:12:53Z","title":"Unlearning Algorithmic Biases over Graphs","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-07T15:33:52.537179Z"},"links":{"citing_paper":"/paper/2505.14945"},"observation_digest":"sha256:d34b483136af362669a31f6e32b201f995bb11ea6540b07c9d530a2ce03fc2d6","observation_id":"ec4581a9-7945-483a-ac6b-2acf1bc0d5e2","resolution":{"observed_at":"2026-08-07T15:34:06.974507Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T15:34:06.609406Z","title":"Towards effective and general graph unlearning via mutual evolution,","venue":null,"work_id":"b955b27a-6440-44e4-be4e-e5cb39182031","year":2024},"citing_paper":{"arxiv_id":"2505.14945","last_updated":"2025-05-20T22:12:53Z","snapshot_observed_at":"2026-08-09T01:18:02.155442Z","submitted_at":"2025-05-20T22:12:53Z","title":"Unlearning Algorithmic Biases over Graphs","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-07T15:33:52.712180Z"},"links":{"citing_paper":"/paper/2505.14945"},"observation_digest":"sha256:d675c331aa8698edcfe036825350cc8149665046225730f23bcd1871427e3688","observation_id":"58e8384f-e399-4d7d-b665-c3ab600f573c","resolution":{"observed_at":"2026-08-07T15:34:06.757774Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2501.11823","last_updated":"2025-01-21T02:02:35Z","snapshot_observed_at":"2026-07-06T20:23:36.052687Z","submitted_at":"2025-01-21T02:02:35Z","title":"Toward Scalable Graph Unlearning: A Node Influence Maximization based Approach","version":1},"cited_work":{"arxiv_id":"2501.11823","doi":null,"metadata_source":"pith","pith_arxiv_id":"2501.11823","snapshot_observed_at":"2026-08-07T15:33:58.114130Z","title":"Toward Scalable Graph Unlearning: A Node Influence Maximization based Approach","venue":"cs.LG","work_id":"f53dbf2e-7e7a-4292-ad0e-d75915c1df96","year":2025},"citing_paper":{"arxiv_id":"2505.14945","last_updated":"2025-05-20T22:12:53Z","snapshot_observed_at":"2026-08-09T01:18:02.155442Z","submitted_at":"2025-05-20T22:12:53Z","title":"Unlearning Algorithmic Biases over Graphs","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-07T15:33:52.868088Z"},"links":{"cited_paper":"/paper/2501.11823","citing_paper":"/paper/2505.14945"},"observation_digest":"sha256:b0390f26695da5e41b82d405dbab41e762150e17eab57e0e19f4c537cad87106","observation_id":"caf9101b-4002-48ca-947f-8b9da40fed49","resolution":{"observed_at":"2026-08-07T15:33:58.260786Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2309.16173","last_updated":"2024-06-08T06:50:47Z","snapshot_observed_at":"2026-08-05T03:22:27.040938Z","submitted_at":"2023-09-28T05:09:14Z","title":"Distill to Delete: Unlearning in Graph Networks with Knowledge Distillation","version":2},"cited_work":{"arxiv_id":"2309.16173","doi":null,"metadata_source":"pith","pith_arxiv_id":"2309.16173","snapshot_observed_at":"2026-08-07T15:33:57.873481Z","title":"Distill to Delete: Unlearning in Graph Networks with Knowledge Distillation","venue":"cs.LG","work_id":"2a3cae74-a06d-457a-8860-4b58b6597343","year":2023},"citing_paper":{"arxiv_id":"2505.14945","last_updated":"2025-05-20T22:12:53Z","snapshot_observed_at":"2026-08-09T01:18:02.155442Z","submitted_at":"2025-05-20T22:12:53Z","title":"Unlearning Algorithmic Biases over Graphs","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-07T15:33:52.970424Z"},"links":{"cited_paper":"/paper/2309.16173","citing_paper":"/paper/2505.14945"},"observation_digest":"sha256:e7bc85e4bd515764e5ba23f4f9bb8465e4fa6b6adae8b496ee108884fdb5b119","observation_id":"9f05ad0e-8bd9-4748-bf6a-fb9ed0133a31","resolution":{"observed_at":"2026-08-07T15:33:58.008761Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T15:34:06.323978Z","title":"When contrastive learning meets graph unlearning: Graph contrastive unlearning for link prediction,","venue":null,"work_id":"39589055-1265-4bb7-81c8-6ed2de6bbf99","year":2023},"citing_paper":{"arxiv_id":"2505.14945","last_updated":"2025-05-20T22:12:53Z","snapshot_observed_at":"2026-08-09T01:18:02.155442Z","submitted_at":"2025-05-20T22:12:53Z","title":"Unlearning Algorithmic Biases over Graphs","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-07T15:33:53.057144Z"},"links":{"citing_paper":"/paper/2505.14945"},"observation_digest":"sha256:03f60edd60d4998f2d6b782362996c4279d14f7075933f997e6b3090053866f5","observation_id":"5a2c73ea-ce1b-4903-943a-dcc98827a67a","resolution":{"observed_at":"2026-08-07T15:34:06.485261Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T15:34:06.047760Z","title":"Efficiently forgetting what you have learned in graph representation learning via projection,","venue":null,"work_id":"35d5b532-ee34-4979-b0bf-344eb2adf39c","year":2023},"citing_paper":{"arxiv_id":"2505.14945","last_updated":"2025-05-20T22:12:53Z","snapshot_observed_at":"2026-08-09T01:18:02.155442Z","submitted_at":"2025-05-20T22:12:53Z","title":"Unlearning Algorithmic Biases over Graphs","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-07T15:33:53.168979Z"},"links":{"citing_paper":"/paper/2505.14945"},"observation_digest":"sha256:4d99a0a14efc16eb0a24322cba04d031ae45cb9c306808872d49eaf872820d2d","observation_id":"c1e2a489-f431-4bc4-9a77-9b33c828bcf3","resolution":{"observed_at":"2026-08-07T15:34:06.179442Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2205.05396","last_updated":"2024-02-21T22:25:01Z","snapshot_observed_at":"2026-08-05T09:03:11.851427Z","submitted_at":"2022-05-11T10:40:56Z","title":"A Survey on Fairness for Machine Learning on Graphs","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2205.05396","snapshot_observed_at":"2026-08-07T15:33:53.278064Z","title":"A survey on fairness for machine learning on graphs,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.14945","last_updated":"2025-05-20T22:12:53Z","snapshot_observed_at":"2026-08-09T01:18:02.155442Z","submitted_at":"2025-05-20T22:12:53Z","title":"Unlearning Algorithmic Biases over Graphs","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-07T15:33:53.278064Z"},"links":{"cited_paper":"/paper/2205.05396","citing_paper":"/paper/2505.14945"},"observation_digest":"sha256:7d8951a1664cff65870df89c12acff26f08dacbeee95a5f6facf50e311dd4366","observation_id":"8b218b09-17dd-4104-bca2-d3cc8d2ef98e","resolution":{"observed_at":"2026-08-07T15:33:53.278064Z","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-07T15:34:05.768583Z","title":"Fairness in graph machine learning: Recent advances and future prospectives,","venue":null,"work_id":"0cabbda9-e1f5-4daa-bc9a-85909afa7a8a","year":2023},"citing_paper":{"arxiv_id":"2505.14945","last_updated":"2025-05-20T22:12:53Z","snapshot_observed_at":"2026-08-09T01:18:02.155442Z","submitted_at":"2025-05-20T22:12:53Z","title":"Unlearning Algorithmic Biases over Graphs","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-07T15:33:53.386678Z"},"links":{"citing_paper":"/paper/2505.14945"},"observation_digest":"sha256:0a07e8d991753efa4d858f6498ac2057a9e8b3471994e2589388f3ec73437ae3","observation_id":"4522d5f3-fb54-413f-925e-c13de6fdd400","resolution":{"observed_at":"2026-08-07T15:34:05.880613Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T15:34:05.528358Z","title":"Fairwalk: Towards fair graph embedding,","venue":null,"work_id":"cf65c1a1-f284-40ce-81e6-3e89c05749cd","year":2019},"citing_paper":{"arxiv_id":"2505.14945","last_updated":"2025-05-20T22:12:53Z","snapshot_observed_at":"2026-08-09T01:18:02.155442Z","submitted_at":"2025-05-20T22:12:53Z","title":"Unlearning Algorithmic Biases over Graphs","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-07T15:33:53.478841Z"},"links":{"citing_paper":"/paper/2505.14945"},"observation_digest":"sha256:f18bc4610ba6c69b529dd5083bfb50f7ec8a7ead34fbc4d5f95904025d2fd6e2","observation_id":"8497b5b2-1827-4854-8cd1-10180a2a6bb2","resolution":{"observed_at":"2026-08-07T15:34:05.641545Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T15:34:05.294045Z","title":"Debiasing graph representations via metadata-orthogonal train- ing,","venue":null,"work_id":"be29cb53-014a-4abf-b5c0-fa4ef7208166","year":2020},"citing_paper":{"arxiv_id":"2505.14945","last_updated":"2025-05-20T22:12:53Z","snapshot_observed_at":"2026-08-09T01:18:02.155442Z","submitted_at":"2025-05-20T22:12:53Z","title":"Unlearning Algorithmic Biases over Graphs","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-07T15:33:53.597979Z"},"links":{"citing_paper":"/paper/2505.14945"},"observation_digest":"sha256:4ef987198f71cabd0bb3767603cab35b8e7f21bec237b1c0ba7a03f87ae9235c","observation_id":"9c3252be-768b-40f5-8287-6d22837fded0","resolution":{"observed_at":"2026-08-07T15:34:05.402687Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T15:34:05.040852Z","title":"Individual fairness for graph neural networks: A ranking based approach,","venue":null,"work_id":"406cdbbd-8b43-4538-8585-232520f6acde","year":2021},"citing_paper":{"arxiv_id":"2505.14945","last_updated":"2025-05-20T22:12:53Z","snapshot_observed_at":"2026-08-09T01:18:02.155442Z","submitted_at":"2025-05-20T22:12:53Z","title":"Unlearning Algorithmic Biases over Graphs","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-07T15:33:53.725263Z"},"links":{"citing_paper":"/paper/2505.14945"},"observation_digest":"sha256:7f4c91b0629a575af1a6298f4b2ebf9c4e9dd2cbdef88a942d3231346bfb44bd","observation_id":"c1accfff-8786-4019-923a-24b7339259cd","resolution":{"observed_at":"2026-08-07T15:34:05.156807Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T15:34:04.738509Z","title":"GUIDE: Group equality informed individual fairness in graph neural networks,","venue":null,"work_id":"d2359da8-eca2-4e1b-b13f-bcfebb40a2c9","year":2022},"citing_paper":{"arxiv_id":"2505.14945","last_updated":"2025-05-20T22:12:53Z","snapshot_observed_at":"2026-08-09T01:18:02.155442Z","submitted_at":"2025-05-20T22:12:53Z","title":"Unlearning Algorithmic Biases over Graphs","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-07T15:33:53.792327Z"},"links":{"citing_paper":"/paper/2505.14945"},"observation_digest":"sha256:791e09db29df9a1870b54a896caae500d8a886dcb6f18191eb9235403963e81c","observation_id":"9ee790fe-432d-4014-b627-528311370504","resolution":{"observed_at":"2026-08-07T15:34:04.900110Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T15:34:04.547542Z","title":"Learning fair node representations with graph counterfactual fairness,","venue":null,"work_id":"c071954f-c3de-4feb-95e6-97adf35c82ef","year":2022},"citing_paper":{"arxiv_id":"2505.14945","last_updated":"2025-05-20T22:12:53Z","snapshot_observed_at":"2026-08-09T01:18:02.155442Z","submitted_at":"2025-05-20T22:12:53Z","title":"Unlearning Algorithmic Biases over Graphs","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-07T15:33:53.868751Z"},"links":{"citing_paper":"/paper/2505.14945"},"observation_digest":"sha256:0549dedd863b69727c4a07c69cedc25bf46e0911971a06147c2b8059c0e5772d","observation_id":"e79316a1-c7f9-4ff0-968a-615e319465fe","resolution":{"observed_at":"2026-08-07T15:34:04.658834Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T15:34:04.309415Z","title":"Towards fair graph neural networks via graph counterfactual,","venue":null,"work_id":"f50fc5b7-b842-4ad8-9566-12a75313f965","year":2023},"citing_paper":{"arxiv_id":"2505.14945","last_updated":"2025-05-20T22:12:53Z","snapshot_observed_at":"2026-08-09T01:18:02.155442Z","submitted_at":"2025-05-20T22:12:53Z","title":"Unlearning Algorithmic Biases over Graphs","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-07T15:33:54.021459Z"},"links":{"citing_paper":"/paper/2505.14945"},"observation_digest":"sha256:49872921a4f55a1d6fb7824cf1e4e3faddd65559bbd5869e6cdf94ee854e57d2","observation_id":"54435ae2-1732-4122-a6e2-4448f8f84963","resolution":{"observed_at":"2026-08-07T15:34:04.399587Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T15:34:04.016492Z","title":"EDITS: Modeling and mitigating data bias for graph neural networks,","venue":null,"work_id":"5c7035d6-707d-4226-8175-01cae93e1188","year":2022},"citing_paper":{"arxiv_id":"2505.14945","last_updated":"2025-05-20T22:12:53Z","snapshot_observed_at":"2026-08-09T01:18:02.155442Z","submitted_at":"2025-05-20T22:12:53Z","title":"Unlearning Algorithmic Biases over Graphs","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-07T15:33:54.153031Z"},"links":{"citing_paper":"/paper/2505.14945"},"observation_digest":"sha256:14bef463309a5ea2c7e18e4d615ae8082bd080d5dab4510ac11f8fd92ad3992b","observation_id":"e7743966-4bc6-4093-b8a0-3adc0189699c","resolution":{"observed_at":"2026-08-07T15:34:04.166374Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T15:34:03.806921Z","title":"Fair contrastive learning on graphs,","venue":null,"work_id":"81d715a1-395e-4398-a7be-6c025f84449b","year":2022},"citing_paper":{"arxiv_id":"2505.14945","last_updated":"2025-05-20T22:12:53Z","snapshot_observed_at":"2026-08-09T01:18:02.155442Z","submitted_at":"2025-05-20T22:12:53Z","title":"Unlearning Algorithmic Biases over Graphs","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-07T15:33:54.281280Z"},"links":{"citing_paper":"/paper/2505.14945"},"observation_digest":"sha256:88daccc6648b5b077d23f75f021161501e012e8688a3ca2a20ae6e5649c2751a","observation_id":"14fe5277-695d-4708-a5d7-4bd2a1ae22f6","resolution":{"observed_at":"2026-08-07T15:34:03.903066Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T15:34:03.583422Z","title":"Debiasing knowledge graph embeddings,","venue":null,"work_id":"73ed26ea-b215-4d55-b7b5-9d4601d19a7a","year":2020},"citing_paper":{"arxiv_id":"2505.14945","last_updated":"2025-05-20T22:12:53Z","snapshot_observed_at":"2026-08-09T01:18:02.155442Z","submitted_at":"2025-05-20T22:12:53Z","title":"Unlearning Algorithmic Biases over Graphs","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-07T15:33:54.429485Z"},"links":{"citing_paper":"/paper/2505.14945"},"observation_digest":"sha256:1d1f6728d9a89e1a19a068cd7067758d55b83d3281d07cfc9a10dd6e209695f5","observation_id":"7f2c0f48-97d3-4544-8f57-84e5de8d3be2","resolution":{"observed_at":"2026-08-07T15:34:03.699259Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T15:34:03.323540Z","title":"Learning fair representations via distance correlation minimization,","venue":null,"work_id":"790da857-c42f-49e0-8296-eb6a6b7e91f1","year":2022},"citing_paper":{"arxiv_id":"2505.14945","last_updated":"2025-05-20T22:12:53Z","snapshot_observed_at":"2026-08-09T01:18:02.155442Z","submitted_at":"2025-05-20T22:12:53Z","title":"Unlearning Algorithmic Biases over Graphs","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-07T15:33:54.582002Z"},"links":{"citing_paper":"/paper/2505.14945"},"observation_digest":"sha256:e02556c5dbdf2ad7ea13321ba6040235b92d0fecda515432a21bfa5b45984940","observation_id":"60310e84-2779-4e9f-8d6c-0d1634fda650","resolution":{"observed_at":"2026-08-07T15:34:03.451127Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T15:34:03.039754Z","title":"Endowing pre-trained graph models with provable fairness,","venue":null,"work_id":"4e776190-05a1-4b36-b02a-735f24c240ef","year":2024},"citing_paper":{"arxiv_id":"2505.14945","last_updated":"2025-05-20T22:12:53Z","snapshot_observed_at":"2026-08-09T01:18:02.155442Z","submitted_at":"2025-05-20T22:12:53Z","title":"Unlearning Algorithmic Biases over Graphs","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-07T15:33:54.701002Z"},"links":{"citing_paper":"/paper/2505.14945"},"observation_digest":"sha256:a8b5a7203b1b7bfd0ecfff092baf927a8c627bfc7d7a165d68b77638bbcb226c","observation_id":"c663351c-eb54-4f8e-9bc0-b27b5658b053","resolution":{"observed_at":"2026-08-07T15:34:03.153419Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T15:34:02.792443Z","title":"Bursting the filter bubble: Fairness-aware network link prediction,","venue":null,"work_id":"9366b05a-5fb8-4194-bc1a-a4353ec07cba","year":2020},"citing_paper":{"arxiv_id":"2505.14945","last_updated":"2025-05-20T22:12:53Z","snapshot_observed_at":"2026-08-09T01:18:02.155442Z","submitted_at":"2025-05-20T22:12:53Z","title":"Unlearning Algorithmic Biases over Graphs","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-07T15:33:54.808265Z"},"links":{"citing_paper":"/paper/2505.14945"},"observation_digest":"sha256:eb0223cb30e131171f7e147aed5dbad3e3b9816deefe300573e0a4d97f298770","observation_id":"2f794ee2-b71a-474d-b74d-96c66759e9b2","resolution":{"observed_at":"2026-08-07T15:34:02.925814Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T15:34:02.509061Z","title":"Inform: Individual fairness on graph mining,","venue":null,"work_id":"e0bf093d-36ec-4a54-b47a-500b18b4c2b2","year":2020},"citing_paper":{"arxiv_id":"2505.14945","last_updated":"2025-05-20T22:12:53Z","snapshot_observed_at":"2026-08-09T01:18:02.155442Z","submitted_at":"2025-05-20T22:12:53Z","title":"Unlearning Algorithmic Biases over Graphs","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-07T15:33:54.934992Z"},"links":{"citing_paper":"/paper/2505.14945"},"observation_digest":"sha256:95675456037e84f6df7b4373d2b880927efa3726e45e865f8fc02018d7d2f2bf","observation_id":"6d0577b5-90c7-408e-aa04-35d8037e39f4","resolution":{"observed_at":"2026-08-07T15:34:02.680145Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T15:34:02.262003Z","title":"Machine unlearning: Taxonomy, metrics, applications, challenges, and prospects,","venue":null,"work_id":"47e29f35-4254-4d40-8240-d74a0358a0dc","year":2025},"citing_paper":{"arxiv_id":"2505.14945","last_updated":"2025-05-20T22:12:53Z","snapshot_observed_at":"2026-08-09T01:18:02.155442Z","submitted_at":"2025-05-20T22:12:53Z","title":"Unlearning Algorithmic Biases over Graphs","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-07T15:33:55.080980Z"},"links":{"citing_paper":"/paper/2505.14945"},"observation_digest":"sha256:92913b26273e20df828b71c274b96af7e0960176604e04ba565ababafc186478","observation_id":"443687f7-e811-48ff-8aaa-bd8962f20252","resolution":{"observed_at":"2026-08-07T15:34:02.367073Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T15:34:02.041086Z","title":"Fair machine unlearning: Data removal while mitigating disparities,","venue":null,"work_id":"76ce9d67-da87-4d19-88a0-8e57c49a96a8","year":2024},"citing_paper":{"arxiv_id":"2505.14945","last_updated":"2025-05-20T22:12:53Z","snapshot_observed_at":"2026-08-09T01:18:02.155442Z","submitted_at":"2025-05-20T22:12:53Z","title":"Unlearning Algorithmic Biases over Graphs","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-07T15:33:55.216873Z"},"links":{"citing_paper":"/paper/2505.14945"},"observation_digest":"sha256:5abce2b0b49935c598456614761dbb08fdbb369c7cdd54950ed033b73b288932","observation_id":"e91be522-4937-4e21-993b-c698fa3b7e4b","resolution":{"observed_at":"2026-08-07T15:34:02.124305Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T15:34:01.747858Z","title":"To be forgotten or to be fair: Unveiling fairness implications of machine unlearning methods,","venue":null,"work_id":"e24e787e-f93c-44fb-a771-e4e93fa7a72a","year":2024},"citing_paper":{"arxiv_id":"2505.14945","last_updated":"2025-05-20T22:12:53Z","snapshot_observed_at":"2026-08-09T01:18:02.155442Z","submitted_at":"2025-05-20T22:12:53Z","title":"Unlearning Algorithmic Biases over Graphs","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-07T15:33:55.376217Z"},"links":{"citing_paper":"/paper/2505.14945"},"observation_digest":"sha256:36fa2fdcbb3566603acbc7f21eb2d6603a5d6cbf94b64e5bd908b0179937a03e","observation_id":"e550ef8a-cebf-4ff2-8639-fc6ca4db2771","resolution":{"observed_at":"2026-08-07T15:34:01.887054Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2405.16798","last_updated":"2024-05-29T16:52:43Z","snapshot_observed_at":"2026-08-07T18:59:09.883518Z","submitted_at":"2024-05-27T03:35:50Z","title":"Exploring Fairness in Educational Data Mining in the Context of the Right to be Forgotten","version":2},"cited_work":{"arxiv_id":"2405.16798","doi":null,"metadata_source":"pith","pith_arxiv_id":"2405.16798","snapshot_observed_at":"2026-08-07T15:33:57.738892Z","title":"Exploring Fairness in Educational Data Mining in the Context of the Right to be Forgotten","venue":"cs.LG","work_id":"545f5ec3-8a5c-4a50-8aaa-d96c274bea65","year":2024},"citing_paper":{"arxiv_id":"2505.14945","last_updated":"2025-05-20T22:12:53Z","snapshot_observed_at":"2026-08-09T01:18:02.155442Z","submitted_at":"2025-05-20T22:12:53Z","title":"Unlearning Algorithmic Biases over Graphs","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-07T15:33:55.489886Z"},"links":{"cited_paper":"/paper/2405.16798","citing_paper":"/paper/2505.14945"},"observation_digest":"sha256:576906c8964b4abb0e8d434a0ff8022364f9d3c5c50d789081ef1301199a1370","observation_id":"fabf32c6-c2cb-4396-813f-4bf23fb407d8","resolution":{"observed_at":"2026-08-07T15:33:57.781246Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T15:34:01.468773Z","title":"Can machine unlearning reduce social bias in language models?","venue":null,"work_id":"57a84325-3594-4311-94f0-429f4f509a87","year":2024},"citing_paper":{"arxiv_id":"2505.14945","last_updated":"2025-05-20T22:12:53Z","snapshot_observed_at":"2026-08-09T01:18:02.155442Z","submitted_at":"2025-05-20T22:12:53Z","title":"Unlearning Algorithmic Biases over Graphs","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-07T15:33:55.622617Z"},"links":{"citing_paper":"/paper/2505.14945"},"observation_digest":"sha256:d54c56b72d3b485b145257a33926d5ce5482ea9936e86e3ca88061ccc135a4e8","observation_id":"b38c4ac6-99ab-462c-8fc7-162fd3459c72","resolution":{"observed_at":"2026-08-07T15:34:01.636938Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T15:33:55.776028Z","title":"FROG: Fair removal on graphs,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.14945","last_updated":"2025-05-20T22:12:53Z","snapshot_observed_at":"2026-08-09T01:18:02.155442Z","submitted_at":"2025-05-20T22:12:53Z","title":"Unlearning Algorithmic Biases over Graphs","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-07T15:33:55.776028Z"},"links":{"citing_paper":"/paper/2505.14945"},"observation_digest":"sha256:e9f8bb69f1e7e5276fbe427d44cdb763b03141ec0d1c09f82a974dc920c261ff","observation_id":"8471c040-e761-4e6d-9dd1-ea32666d63a3","resolution":{"observed_at":"2026-08-07T15:33:55.776028Z","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-07T15:34:01.257468Z","title":"Simplifying graph convolutional networks,","venue":null,"work_id":"202ad4a1-b706-49bc-a242-b9c80783d3b5","year":2019},"citing_paper":{"arxiv_id":"2505.14945","last_updated":"2025-05-20T22:12:53Z","snapshot_observed_at":"2026-08-09T01:18:02.155442Z","submitted_at":"2025-05-20T22:12:53Z","title":"Unlearning Algorithmic Biases over Graphs","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-07T15:33:55.926652Z"},"links":{"citing_paper":"/paper/2505.14945"},"observation_digest":"sha256:9ff1b98802c5bff777d5ea699a63f5dee033dca18261fb00c8a902ca1b93b800","observation_id":"a9ab9368-011f-413b-a0ec-12a19de0d270","resolution":{"observed_at":"2026-08-07T15:34:01.344755Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T15:34:00.936492Z","title":"Semi-supervised classification with graph convolutional networks,","venue":null,"work_id":"3699c233-f035-41fd-85e8-5a967b0a0ab1","year":2017},"citing_paper":{"arxiv_id":"2505.14945","last_updated":"2025-05-20T22:12:53Z","snapshot_observed_at":"2026-08-09T01:18:02.155442Z","submitted_at":"2025-05-20T22:12:53Z","title":"Unlearning Algorithmic Biases over Graphs","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-07T15:33:56.061863Z"},"links":{"citing_paper":"/paper/2505.14945"},"observation_digest":"sha256:ebb1da6b0538c841cfd82abf8b78c3dcd7bb9f75a06d361ef63b1ca01429cc87","observation_id":"62c5aacc-1766-4e2e-b0cc-ee1c394c735e","resolution":{"observed_at":"2026-08-07T15:34:01.079192Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T15:34:00.672163Z","title":"Improving fairness in graph neural networks via mitigating sensitive attribute leakage,","venue":null,"work_id":"d38c995e-c778-466d-83e4-81c8de0e0af8","year":2022},"citing_paper":{"arxiv_id":"2505.14945","last_updated":"2025-05-20T22:12:53Z","snapshot_observed_at":"2026-08-09T01:18:02.155442Z","submitted_at":"2025-05-20T22:12:53Z","title":"Unlearning Algorithmic Biases over Graphs","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-07T15:33:56.181466Z"},"links":{"citing_paper":"/paper/2505.14945"},"observation_digest":"sha256:a8809ff0b7da9e864712bab9b9a7c30c255f2649338387feec75f90c0dc3e294","observation_id":"11b732e2-750f-43b1-a6b6-477a7df1cb26","resolution":{"observed_at":"2026-08-07T15:34:00.773574Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2108.11577","last_updated":"2023-08-07T12:33:20Z","snapshot_observed_at":"2026-08-08T06:36:46.209652Z","submitted_at":"2021-08-26T04:42:24Z","title":"Machine Unlearning of Features and Labels","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2108.11577","snapshot_observed_at":"2026-08-07T15:33:56.283886Z","title":"Machine unlearning of features and labels,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.14945","last_updated":"2025-05-20T22:12:53Z","snapshot_observed_at":"2026-08-09T01:18:02.155442Z","submitted_at":"2025-05-20T22:12:53Z","title":"Unlearning Algorithmic Biases over Graphs","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-07T15:33:56.283886Z"},"links":{"cited_paper":"/paper/2108.11577","citing_paper":"/paper/2505.14945"},"observation_digest":"sha256:8506368fa236eccaea45fb5500c63fb4c4a7c178865baf15578a28bbd37119e7","observation_id":"2f495262-edee-4af1-a5d2-f7aaf0f68dc1","resolution":{"observed_at":"2026-08-07T15:33:56.283886Z","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-07T15:34:00.449382Z","title":"Don’t forget too much: Towards machine unlearning on feature level,","venue":null,"work_id":"1dac66a7-657f-4250-881c-c7a020a492b0","year":2024},"citing_paper":{"arxiv_id":"2505.14945","last_updated":"2025-05-20T22:12:53Z","snapshot_observed_at":"2026-08-09T01:18:02.155442Z","submitted_at":"2025-05-20T22:12:53Z","title":"Unlearning Algorithmic Biases over Graphs","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-07T15:33:56.369236Z"},"links":{"citing_paper":"/paper/2505.14945"},"observation_digest":"sha256:d44fd12e10d167373ca979ec9333485a099a74862204c42ce37f1ff3042b2fe4","observation_id":"c1cac917-6af3-4e25-9c58-e9dde1558057","resolution":{"observed_at":"2026-08-07T15:34:00.551842Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2202.13295","last_updated":"2022-04-16T15:03:43Z","snapshot_observed_at":"2026-08-03T15:13:23.071175Z","submitted_at":"2022-02-27T05:25:15Z","title":"Efficient Attribute Unlearning: Towards Selective Removal of Input Attributes from Feature Representations","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2202.13295","snapshot_observed_at":"2026-08-07T15:33:56.510740Z","title":"Efficient attribute unlearning: Towards selective removal of input attributes from feature representations,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.14945","last_updated":"2025-05-20T22:12:53Z","snapshot_observed_at":"2026-08-09T01:18:02.155442Z","submitted_at":"2025-05-20T22:12:53Z","title":"Unlearning Algorithmic Biases over Graphs","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-07T15:33:56.510740Z"},"links":{"cited_paper":"/paper/2202.13295","citing_paper":"/paper/2505.14945"},"observation_digest":"sha256:1a41718ba3627999fd7998a9ee9f25540aec1a25021b49595267934af27d795e","observation_id":"d47ad4d2-4164-4c1c-8c4b-4cac0369d377","resolution":{"observed_at":"2026-08-07T15:33:56.510740Z","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-07T15:34:00.167711Z","title":"Post-training attribute unlearning in recommender systems,","venue":null,"work_id":"78c68f30-4c14-449c-8b8f-f30e82eb19f2","year":2024},"citing_paper":{"arxiv_id":"2505.14945","last_updated":"2025-05-20T22:12:53Z","snapshot_observed_at":"2026-08-09T01:18:02.155442Z","submitted_at":"2025-05-20T22:12:53Z","title":"Unlearning Algorithmic Biases over Graphs","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-07T15:33:56.607916Z"},"links":{"citing_paper":"/paper/2505.14945"},"observation_digest":"sha256:d0e1915b85fb437e8b01a27db877f1387fdd61322c7f46289d25ba71861ad012","observation_id":"0fb24845-dc9a-4b9c-bd99-d18a15d51bf6","resolution":{"observed_at":"2026-08-07T15:34:00.324961Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T15:33:59.842463Z","title":"Towards fair classifiers without sensitive attributes: Exploring biases in related features,","venue":null,"work_id":"fa7218f7-31c8-4aaf-82da-385c56c4a43c","year":2022},"citing_paper":{"arxiv_id":"2505.14945","last_updated":"2025-05-20T22:12:53Z","snapshot_observed_at":"2026-08-09T01:18:02.155442Z","submitted_at":"2025-05-20T22:12:53Z","title":"Unlearning Algorithmic Biases over Graphs","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-07T15:33:56.725308Z"},"links":{"citing_paper":"/paper/2505.14945"},"observation_digest":"sha256:9bbd8e5adb7d78016b54c027699222c28cda0ebf7034715c4379d4de53c29f61","observation_id":"fd43898f-0f1b-4ad7-91fb-2b66e5a9d2a8","resolution":{"observed_at":"2026-08-07T15:33:59.982160Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T15:33:59.645626Z","title":"Fairness through awareness,","venue":null,"work_id":"146c7e41-3783-4829-9bbc-8e2f611e8eaf","year":2012},"citing_paper":{"arxiv_id":"2505.14945","last_updated":"2025-05-20T22:12:53Z","snapshot_observed_at":"2026-08-09T01:18:02.155442Z","submitted_at":"2025-05-20T22:12:53Z","title":"Unlearning Algorithmic Biases over Graphs","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-07T15:33:56.863333Z"},"links":{"citing_paper":"/paper/2505.14945"},"observation_digest":"sha256:5d72802f905c67e90c76f15a2eae8a7948328e8e4607bc999e92ddc3b5ffe879","observation_id":"ce4bc929-7ea4-40f0-8166-0455b483ef5c","resolution":{"observed_at":"2026-08-07T15:33:59.740184Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T15:33:59.439857Z","title":"Thirteen ways to look at the correlation coefficient,","venue":null,"work_id":"cbb733ee-072c-48ea-8961-895687cd85e1","year":1988},"citing_paper":{"arxiv_id":"2505.14945","last_updated":"2025-05-20T22:12:53Z","snapshot_observed_at":"2026-08-09T01:18:02.155442Z","submitted_at":"2025-05-20T22:12:53Z","title":"Unlearning Algorithmic Biases over Graphs","version":1},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-07T15:33:56.956026Z"},"links":{"citing_paper":"/paper/2505.14945"},"observation_digest":"sha256:0411410a7b32301159669fb1f7ec428714399a11e73b4ccae5cdfae859afeeb6","observation_id":"6d9067fc-da0c-4ac3-ba0b-ca59cf282526","resolution":{"observed_at":"2026-08-07T15:33:59.539818Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1705.07215","last_updated":"2017-12-10T15:24:13Z","snapshot_observed_at":"2026-07-06T05:43:27.961693Z","submitted_at":"2017-05-19T22:41:56Z","title":"On Convergence and Stability of GANs","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1705.07215","snapshot_observed_at":"2026-08-07T15:33:57.042194Z","title":"On convergence and stability of GANs,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2505.14945","last_updated":"2025-05-20T22:12:53Z","snapshot_observed_at":"2026-08-09T01:18:02.155442Z","submitted_at":"2025-05-20T22:12:53Z","title":"Unlearning Algorithmic Biases over Graphs","version":1},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-07T15:33:57.042194Z"},"links":{"cited_paper":"/paper/1705.07215","citing_paper":"/paper/2505.14945"},"observation_digest":"sha256:e9f3e00ec915057205afffaab04c3fdc26cbfdbef791f5929acc3d3caf4a523a","observation_id":"35513a2a-8bea-4e57-8e30-d376528a5e9e","resolution":{"observed_at":"2026-08-07T15:33:57.042194Z","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-07T15:33:59.174512Z","title":"Towards a unified framework for fair and stable graph representation learning,","venue":null,"work_id":"2897ebdb-737c-4158-b7dc-a89bc7bf99bb","year":2021},"citing_paper":{"arxiv_id":"2505.14945","last_updated":"2025-05-20T22:12:53Z","snapshot_observed_at":"2026-08-09T01:18:02.155442Z","submitted_at":"2025-05-20T22:12:53Z","title":"Unlearning Algorithmic Biases over Graphs","version":1},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-07T15:33:57.148120Z"},"links":{"citing_paper":"/paper/2505.14945"},"observation_digest":"sha256:e44909ddca110b0d206a5929290dc5ee0ab68c61bf14c35116b37fc4688f6207","observation_id":"da9f7466-45a4-4280-aa98-0cb9d1333132","resolution":{"observed_at":"2026-08-07T15:33:59.280771Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T15:33:58.954438Z","title":"GNNExplainer: Generating explanations for graph neural networks,","venue":null,"work_id":"0b4d9664-d1c1-4ff1-89a4-0b29cd3247c5","year":2019},"citing_paper":{"arxiv_id":"2505.14945","last_updated":"2025-05-20T22:12:53Z","snapshot_observed_at":"2026-08-09T01:18:02.155442Z","submitted_at":"2025-05-20T22:12:53Z","title":"Unlearning Algorithmic Biases over Graphs","version":1},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-08-07T15:33:57.308835Z"},"links":{"citing_paper":"/paper/2505.14945"},"observation_digest":"sha256:236dbcfa25deb17b78098f7dd3a30a9b2c86998f2eb21232baae47efb90efa63","observation_id":"e38b0fb5-410b-48b6-b6d3-4e35db16cfa6","resolution":{"observed_at":"2026-08-07T15:33:59.052981Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T15:33:58.702440Z","title":"On the limited memory BFGS method for large scale optimization,","venue":null,"work_id":"a865e46c-acdf-41cd-aef6-75ecbd8d11e1","year":1989},"citing_paper":{"arxiv_id":"2505.14945","last_updated":"2025-05-20T22:12:53Z","snapshot_observed_at":"2026-08-09T01:18:02.155442Z","submitted_at":"2025-05-20T22:12:53Z","title":"Unlearning Algorithmic Biases over Graphs","version":1},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-08-07T15:33:57.382206Z"},"links":{"citing_paper":"/paper/2505.14945"},"observation_digest":"sha256:141d2b49378e6919ad7fe189b01402422a816760bbf076380b3dd709b9a2d176","observation_id":"efa9a5c0-69ce-4381-92af-cf86af718ce4","resolution":{"observed_at":"2026-08-07T15:33:58.844042Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T15:33:58.418863Z","title":"ℓ′ ˜z⊤ i w∗, yi [ ¯Al]ij dl i #2 σ2 ≤ ol ≤ 5 L + 1 vuuut X vi∈Vtr X vj ∈Nl(vi)","venue":null,"work_id":"9d1e877f-19bf-429f-9297-6b109312a3b2","year":2012},"citing_paper":{"arxiv_id":"2505.14945","last_updated":"2025-05-20T22:12:53Z","snapshot_observed_at":"2026-08-09T01:18:02.155442Z","submitted_at":"2025-05-20T22:12:53Z","title":"Unlearning Algorithmic Biases over Graphs","version":1},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-08-07T15:33:57.459963Z"},"links":{"citing_paper":"/paper/2505.14945"},"observation_digest":"sha256:db5eda2e175de848d400f1c86c3b505a8a0571f9f0f77e9061613dcf9223aaaf","observation_id":"4a38c2d8-92f9-47a5-8349-e2d931f824fd","resolution":{"observed_at":"2026-08-07T15:33:58.554983Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2505.14945","last_updated":"2025-05-20T22:12:53Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-09T01:18:02.155442Z","submitted_at":"2025-05-20T22:12:53Z","title":"Unlearning Algorithmic Biases over Graphs"},"reference_resolution":{"displayed":67,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":5,"verified_exact":3,"verified_fuzzy":59},"total_outbound_references":67},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 67 of 67 outbound references and 0 inbound Pith citation observations for arXiv:2505.14945."}