{"as_of":"2026-08-19T06:00:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:77d83a06a7d959ffa07cc7f65fa69fdccdb331d3dce8c657538c8ff167c07ecc","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-18T06:34:40.430872+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-18T01:02:34.213431Z","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:ea8b6de77d91344ab1fb8879e9cd1e0398398e223f780e06659127f4979d8071","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-18T01:02:34.213431Z","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:6b48f8ad894a5065723430bfc5bd3f151b2a6af1e06b5fb6a475446a3d3bf659","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-18T01:02:34.213431Z","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:415ab58e26c7f6692312c3563cc757fe939a900bb5877ba27b3ff25b7b909a8f","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-18T01:02:34.213431Z","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:4c1bfbbceb4cb1541ce7ca30271fb957667f0b2dcc18cd4baed812163740878a","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-18T01:02:34.213431Z","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:a3818b08566f1904d77989f6636cea07dbb1217cb376b18a67c323f23f186803","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-18T01:02:34.213431Z","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:1163980be83732dffbafdd98bf7c12179eff8d4258bbf55344f7a6ed9fb364f9","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-18T01:02:34.213431Z","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:238339eeb577395bc52a31ba07c13c5fd4d777df291c83e2df950c74324cf0c2","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-18T01:02:34.213431Z","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:b9fb195985efc27e27df249ce3aca61a4e288e4fbdf42b0709d37d24dec457f8","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-18T01:02:34.213431Z","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:0328d1df2d3a633f46520760642ad98d64bc8764774b2ab174d615b87d443bb6","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-18T01:02:34.213431Z","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:1d33c31cd32c28d378ad9efe0541dc4462e0c116e75531dabdb1d9553dbe9c10","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-18T01:02:34.213431Z","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:22c85ba7eb53af93cf596f1b5ae9552995aef8a7af50fdc789ac3b43da7bf9fc","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-18T01:02:34.213431Z","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:0fe14a8dd753207e6dfe156e454f0eeb374acf445a6180d052ac487e0256f7d6","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-18T01:02:34.213431Z","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:9c99cfe5efda20334973d47ff4cdeec82f62f1d5e0ee1fcefebb304e0b87ec0c","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-18T01:02:34.213431Z","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:f8286a7d8bf546b16afe080767e6e4e251e08207693d26fa6add00f1d67461b4","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-18T01:02:34.213431Z","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:5f154fd4c66993ac3b7bffa5d6f4f18ce7728b656e59b443be866bf42a413224","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-18T01:02:34.213431Z","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:b8e39394e10e5601d0ac2c3606e830b33ddda1a8ebe2dfce45f6f310c0cd19b0","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-18T01:02:34.213431Z","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:14b1030e7a2434650f67f152cfc407fe61d234c9aa8a5a374a2693309b8d36d8","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-18T01:02:34.213431Z","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:78dab01802f298e9ec1e24c466ca69a19dfd147f0700962d8ad0663d76cb46ca","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-18T01:02:34.213431Z","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:31c491f45edbeaf7eb513c653ed9450e9af22589d614ec2d392152e9becddc31","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-18T01:02:34.213431Z","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:2b16a43389e5b6e5a66835a13d61a74944e500475af22a8d4bad907a6c188d7c","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-18T01:02:34.213431Z","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:febbb23ecde3f7d67b6922a269a04016b93d29d9a4daa0163f62b55376435c78","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-18T01:02:34.213431Z","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:044a3e2a8b19de9de2bef17cdbcffa0c59a270bdded11e6f2ed1744c2c6244b1","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-18T01:02:34.213431Z","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:083eb19ebf1cd81475beb3c824a9dc68ed2afcdf53167b33a7fccc5e4b018c8a","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-18T01:02:34.213431Z","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:a12614c7bf8710ae09a700d06f37f49ad6fc2c136112f23579713567ba238da3","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-18T01:02:34.213431Z","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:bd4ca92d1e76503e6289de45d27a296b8399576a33dcdaa875b2a15b5b5254e3","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-18T01:02:34.213431Z","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:8f0aeb4ec424682da769827ca0d19cc9cce38088f7d3ea444496091d5df0595c","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-18T01:02:34.213431Z","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:7e64728f5c1fe71a9be0b28a5ebcea4c56663de5f15943034c0c73d8b5c3f256","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-08-15T18:08:49.621104Z","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-18T01:02:34.213431Z","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:b1f3bfa1eb101f4b94bae29db936fd1961db5d1ad0a2b555c6b81eb6616be1b8","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-18T18:34:20.862529Z","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-18T01:02:34.213431Z","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:00751e79565ecbb5f534d87b49862872c4317c755e13094de206e50eb7eafb04","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-18T01:02:34.213431Z","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:c64653d69be3c0e41a8dcc0601ae3f6fe81ebdfcd2a9457c90d637649dc0b560","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-18T01:02:34.213431Z","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:1c144891ac0e4d63c4258773b024acf75ff2d8033818d7006594f3777a3cc981","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-18T19:47:45.911234Z","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-18T01:02:34.213431Z","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:3c821eea0441eb650fa868c711f52e99bf38d1a70740a910b3775c9623afbeb7","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-18T01:02:34.213431Z","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:b687c3c5a12186e77677a7cd8f8f171b4f22cf9e7c51d691fdb3b5a338a0bfe9","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-18T01:02:34.213431Z","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:23160c36b8b886c8d62ece0fe7a28fd2437910df0100c584b16e2ed53659bc91","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-18T01:02:34.213431Z","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:77e38e343a18fcdf2e97b3446b08fc7e9cbb11bd4e37c2532781427fa53bff14","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-18T01:02:34.213431Z","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:ef7ee22ead21ad81005617ff77602c1c47d422da9305f62fb0379e6779494cbc","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-18T01:02:34.213431Z","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:892e9cab34262e13656444d2fa074c06da7eece34e9441059ac70da9647bd3d8","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-18T01:02:34.213431Z","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:ff05834cc9173d8cafc5bf01be1793bd1b7bce53b1598fb4405d2b93e9d20c78","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-18T01:02:34.213431Z","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:35db66de4c3b25907b24040e1f76b7bba41108fa0c4116b3860243858de46218","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-18T01:02:34.213431Z","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:3d0588552d4cc8dbc7c2b580082af0e035ce9b898008670e705897ff29665b3b","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-18T01:02:34.213431Z","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:9a05e0fdc21f6f4061e56d948dfc8f1427397689df38b2d47e8361e2ccf7d45d","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-18T01:02:34.213431Z","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:0c3152e96f4076e62ba9227742ea52491bfe7cfe97879831be264a2e027d51d3","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-18T01:02:34.213431Z","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:4dd36194a8e21037b74d9686bbba2acd6818eb41a7e0252e2a9093bd11a315ae","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-18T01:02:34.213431Z","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:12715aa9e3fcd7fbf5192789c4b1badba074210bb994f97ba1403e8abb6a7ef5","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-18T01:02:34.213431Z","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:e7a81bd0c1e215a0ad35033856a9a30b5d0f0eea19dc8b5463faf893cc215ebe","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-18T01:02:34.213431Z","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:bd1c35c43993ee834e538c709274c792bd45b7e126479726d0a9d8e5aec2d981","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-18T01:02:34.213431Z","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:113eed0dea6452ed6ef4b91f31b32501bb6eea4c66359392fcd883dcf8fd8acb","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-18T01:02:34.213431Z","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:c5fb0859ce1b501e6c5f204a05e5021374b3db1c98c3c029449ad1bec0badfbf","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-18T01:02:34.213431Z","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:cf3b6857939b1825214636afb7482433a64f150a081b861d819eee95cd3c88fc","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T13:49:12.894756Z","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-18T01:02:34.213431Z","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:8564bea3bbc2aa228678d221b2c9736bcaa8630705df62647b341309494219d2","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-18T01:02:34.213431Z","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:46ee3d63a7e0dd39553dc75cc8a93548e126caf9dc8c80b981ac76f15d3b5c88","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-18T01:02:34.213431Z","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:ee8dd3518ae3af20658b7c44ce0e5c2f736b5f4b4882e97b3c998486a9824cfc","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-18T01:02:34.213431Z","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:50de2ff773b9c7d8fc5ffd9f9a0144d54e0485830a74a4e863692246ce444354","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-18T01:02:34.213431Z","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:542615c9945a0ad82545faf58cac2c84886761205dbfaa62cd2bed2e42937e5a","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-18T01:02:34.213431Z","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:1fd0a5b26165991ffa620bbf4aad665f33f5d1db9eb643be19db0d954a6a136a","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-18T17:58:08.799481Z","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-18T01:02:34.213431Z","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:21dd0870ad4d02e9e314828e89a744929b91e23422bffd017f160dc08afeab96","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-18T01:02:34.213431Z","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:edbc3feb4509d1d9bec41c31f5a4f21d829f5d4ead765028a6b43b99371c67ed","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T17:18:22.192670Z","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-18T01:02:34.213431Z","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:8efbd8ffe52fde0e33f163fee23880deacca52a43dc7e724e02dd0d7dfae5603","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-18T01:02:34.213431Z","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:1634e372ec5561de636a7c703ef5d012fe0414fd08fd1c862f4d12c24d9fa1c7","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-18T01:02:34.213431Z","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:ed51fcc51152969a5db37ee7b0f2ec21c0a662bfcd54b03592cae545b5258e00","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-18T01:02:34.213431Z","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:4cad7108e8132b779cc7fd1a15ed7ab3f90d042c92b29ec6ef758039f3c6de06","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-18T01:02:34.213431Z","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:6ce0b3fef94cb3413192d77373797d74f45861a0e7f9b811550d4105802ded32","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-08-14T20:59:26.167385Z","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-18T01:02:34.213431Z","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:e29a61341ccf08390a99ec6a97c90432e44adea7cb7531ca18368a58b2f22773","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-18T01:02:34.213431Z","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:a5b154403b32a2913b554b50977c76daab9745f680fbd7b59f3c60082d47e6d0","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-18T01:02:34.213431Z","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:21fb88f184edec69cc21e2c49a655c5bb724611b2906ef0ed47943c229d0cc72","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-18T01:02:34.213431Z","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:f98adddcde7dd0fae136d8f423eabd1a0620a30800e1a2c4c1ae505dcb0a3e3b","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-18T01:02:34.213431Z","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:3707038d490e8ceb4d649c258949f2e7e406709182f6dc125c813b1816013342","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-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-18T01:02:34.213431Z","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-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 19 August 2026, this Paper Citation Record lists 67 of 67 outbound references and 0 inbound Pith citation observations for arXiv:2505.14945."}