{"as_of":"2026-08-18T13:52:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:2ef4e99221bf0f03700ffa3df2823b2d83c5fd4fb861bd4a96a26211ce0659fe","coverage":[{"denominator":26,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":26,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T20:36:28.921250Z","state":"measured"},{"denominator":26,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":26,"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.12614/citation-record","integrity":"/paper/2505.12614/integrity","json":"/paper/2505.12614/citation-record.json","paper":"/paper/2505.12614"},"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-15T20:36:29.431766Z","title":"Graph unlearning","venue":null,"work_id":"c7991fcb-5183-4138-ba17-90b7cfcaf2d3","year":2022},"citing_paper":{"arxiv_id":"2505.12614","last_updated":"2025-05-19T01:56:55Z","snapshot_observed_at":"2026-08-18T09:27:52.406915Z","submitted_at":"2025-05-19T01:56:55Z","title":"Adaptive Graph Unlearning","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-15T20:36:28.808923Z"},"links":{"citing_paper":"/paper/2505.12614"},"observation_digest":"sha256:c1e3d68730de5ba6a40c7b5afd90fd5987facecd634dc2049d43df251c1f75e0","observation_id":"83370cc8-97db-4b64-a79c-2be3d94a6dbc","resolution":{"observed_at":"2026-08-15T20:36:29.436217Z","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-15T20:36:29.389432Z","title":"Efficient model updates for approximate un- learning of graph-structured data","venue":null,"work_id":"b060613c-99d1-41e7-922f-85e49d1c2816","year":2023},"citing_paper":{"arxiv_id":"2505.12614","last_updated":"2025-05-19T01:56:55Z","snapshot_observed_at":"2026-08-18T09:27:52.406915Z","submitted_at":"2025-05-19T01:56:55Z","title":"Adaptive Graph Unlearning","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-15T20:36:28.822756Z"},"links":{"citing_paper":"/paper/2505.12614"},"observation_digest":"sha256:960bafcf19de0636912aabc5fedb4673de41416d98d9dc6c4752a85b96a99923","observation_id":"892652fc-e52d-4fc7-b041-f4f9cfc5e944","resolution":{"observed_at":"2026-08-15T20:36:29.394025Z","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-15T20:36:29.375040Z","title":"Grapheditor: An efficient graph representation learn- ing and unlearning approach","venue":null,"work_id":"20300216-b523-4270-bcba-9027a90ee924","year":2022},"citing_paper":{"arxiv_id":"2505.12614","last_updated":"2025-05-19T01:56:55Z","snapshot_observed_at":"2026-08-18T09:27:52.406915Z","submitted_at":"2025-05-19T01:56:55Z","title":"Adaptive Graph Unlearning","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-15T20:36:28.827614Z"},"links":{"citing_paper":"/paper/2505.12614"},"observation_digest":"sha256:0c206d6e0db112ebd0b39230fa37dd997a50e3ae6c8ce11055d29722f7de3241","observation_id":"0dfbfae1-13e2-4109-afdc-76b5c3222630","resolution":{"observed_at":"2026-08-15T20:36:29.379587Z","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-15T20:36:29.361514Z","title":"Graph neural networks","venue":null,"work_id":"1a2d987d-316b-4547-8f04-1bb55cf597cf","year":2024},"citing_paper":{"arxiv_id":"2505.12614","last_updated":"2025-05-19T01:56:55Z","snapshot_observed_at":"2026-08-18T09:27:52.406915Z","submitted_at":"2025-05-19T01:56:55Z","title":"Adaptive Graph Unlearning","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-15T20:36:28.831862Z"},"links":{"citing_paper":"/paper/2505.12614"},"observation_digest":"sha256:5fb8e721110fa0e4195a0941444a5e07e9e5fbf4aad2ce3c08020e3681f3bf75","observation_id":"6e28f1ce-81dd-4c19-a117-4c531088bdc8","resolution":{"observed_at":"2026-08-15T20:36:29.365907Z","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.02728","last_updated":"2025-01-06T02:57:32Z","snapshot_observed_at":"2026-08-15T10:44:24.301125Z","submitted_at":"2025-01-06T02:57:32Z","title":"OpenGU: A Comprehensive Benchmark for Graph Unlearning","version":1},"cited_work":{"arxiv_id":"2501.02728","doi":null,"metadata_source":"pith","pith_arxiv_id":"2501.02728","snapshot_observed_at":"2026-08-15T20:36:29.119149Z","title":"OpenGU: A Comprehensive Benchmark for Graph Unlearning","venue":"cs.LG","work_id":"846c5f70-7d89-40af-b234-fc694b359b58","year":2025},"citing_paper":{"arxiv_id":"2505.12614","last_updated":"2025-05-19T01:56:55Z","snapshot_observed_at":"2026-08-18T09:27:52.406915Z","submitted_at":"2025-05-19T01:56:55Z","title":"Adaptive Graph Unlearning","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-15T20:36:28.845518Z"},"links":{"cited_paper":"/paper/2501.02728","citing_paper":"/paper/2505.12614"},"observation_digest":"sha256:6237ab2895539ac412497c9bac15cdf7051779355d28f1bdd6d2fe3c0430f446","observation_id":"ed7d0a8c-1d62-449d-8c1a-7a0c7e544b7c","resolution":{"observed_at":"2026-08-15T20:36:29.126172Z","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-15T20:36:29.319696Z","title":"Inductive representation learning on large graphs","venue":null,"work_id":"f26bc634-7888-44da-bcd1-2f9e38b7e963","year":2017},"citing_paper":{"arxiv_id":"2505.12614","last_updated":"2025-05-19T01:56:55Z","snapshot_observed_at":"2026-08-18T09:27:52.406915Z","submitted_at":"2025-05-19T01:56:55Z","title":"Adaptive Graph Unlearning","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-15T20:36:28.850048Z"},"links":{"citing_paper":"/paper/2505.12614"},"observation_digest":"sha256:49a4d72b4a899434c4459d49dce68cdf84bf26ebf4f772931fc6726a28decf15","observation_id":"d84eadef-47e9-4dd1-ac16-c9609c936504","resolution":{"observed_at":"2026-08-15T20:36:29.324220Z","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":"1609.02907","last_updated":"2017-02-22T09:55:36Z","snapshot_observed_at":"2026-08-17T10:49:36.026134Z","submitted_at":"2016-09-09T19:48:41Z","title":"Semi-Supervised Classification with Graph Convolutional Networks","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1609.02907","snapshot_observed_at":"2026-08-15T20:36:28.858819Z","title":"Semi-supervised classification with graph convolutional networks","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2505.12614","last_updated":"2025-05-19T01:56:55Z","snapshot_observed_at":"2026-08-18T09:27:52.406915Z","submitted_at":"2025-05-19T01:56:55Z","title":"Adaptive Graph Unlearning","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-15T20:36:28.858819Z"},"links":{"cited_paper":"/paper/1609.02907","citing_paper":"/paper/2505.12614"},"observation_digest":"sha256:290bd0ea7412b8d00fdce1478a7a6f01a7433d43e6fe170e6be720a988aece9f","observation_id":"e4719909-001d-4e4e-b7be-fab1d36f0735","resolution":{"observed_at":"2026-08-15T20:36:28.858819Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.06480","last_updated":"2024-10-09T02:14:40Z","snapshot_observed_at":"2026-08-18T09:28:52.067411Z","submitted_at":"2024-10-09T02:14:40Z","title":"TCGU: Data-centric Graph Unlearning based on Transferable Condensation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.06480","snapshot_observed_at":"2026-08-15T20:36:28.868081Z","title":"TCGU: Data-centric graph unlearning based on transferable con- densation","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.12614","last_updated":"2025-05-19T01:56:55Z","snapshot_observed_at":"2026-08-18T09:27:52.406915Z","submitted_at":"2025-05-19T01:56:55Z","title":"Adaptive Graph Unlearning","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-15T20:36:28.868081Z"},"links":{"cited_paper":"/paper/2410.06480","citing_paper":"/paper/2505.12614"},"observation_digest":"sha256:122091f4b419a29c06780ae9835a2e65ccef2983a9bd9f7071e16c9a05bfd0ac","observation_id":"ed13d6f9-68d1-4ac6-b406-26a0109efea3","resolution":{"observed_at":"2026-08-15T20:36:28.868081Z","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-15T20:36:29.289548Z","title":"Remem- ber what you want to forget: Algorithms for machine un- learning","venue":null,"work_id":"b204ec5b-7bff-4792-9f63-66c6a4b11f95","year":2021},"citing_paper":{"arxiv_id":"2505.12614","last_updated":"2025-05-19T01:56:55Z","snapshot_observed_at":"2026-08-18T09:27:52.406915Z","submitted_at":"2025-05-19T01:56:55Z","title":"Adaptive Graph Unlearning","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-15T20:36:28.872908Z"},"links":{"citing_paper":"/paper/2505.12614"},"observation_digest":"sha256:cc52f6544ff14850c25a83e0a36b9459606ab679d5eacba231e32ae290c34125","observation_id":"6680e604-2396-421e-bf38-656eb435902c","resolution":{"observed_at":"2026-08-15T20:36:29.295188Z","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-15T20:36:29.245416Z","title":"Graph attention networks","venue":null,"work_id":"8cf9574c-9840-4cb8-8c35-12443ba85e33","year":2017},"citing_paper":{"arxiv_id":"2505.12614","last_updated":"2025-05-19T01:56:55Z","snapshot_observed_at":"2026-08-18T09:27:52.406915Z","submitted_at":"2025-05-19T01:56:55Z","title":"Adaptive Graph Unlearning","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-15T20:36:28.885853Z"},"links":{"citing_paper":"/paper/2505.12614"},"observation_digest":"sha256:31cbc6a3ba5101d3bbac8b2ede6f1047c1f1fff4a16e2014b4cccc63373b250b","observation_id":"3266725d-354c-4a55-b8ee-ebc2313dbaaa","resolution":{"observed_at":"2026-08-15T20:36:29.250136Z","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-15T20:36:29.230014Z","title":"Inductive graph unlearning","venue":null,"work_id":"902f2229-a2e3-4444-928b-3d550b45be55","year":2023},"citing_paper":{"arxiv_id":"2505.12614","last_updated":"2025-05-19T01:56:55Z","snapshot_observed_at":"2026-08-18T09:27:52.406915Z","submitted_at":"2025-05-19T01:56:55Z","title":"Adaptive Graph Unlearning","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-15T20:36:28.890051Z"},"links":{"citing_paper":"/paper/2505.12614"},"observation_digest":"sha256:67a27a66b44e93b2093fb92370c4409584489ba90fc4f476ad8e72f72a7735dd","observation_id":"19fedb7d-063d-4a72-a6b8-30d75b96fc37","resolution":{"observed_at":"2026-08-15T20:36:29.234687Z","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-15T20:36:29.215035Z","title":"Sim- plifying graph convolutional networks","venue":null,"work_id":"4f2e86d1-05eb-445e-ab89-6b9feec0a9d1","year":2019},"citing_paper":{"arxiv_id":"2505.12614","last_updated":"2025-05-19T01:56:55Z","snapshot_observed_at":"2026-08-18T09:27:52.406915Z","submitted_at":"2025-05-19T01:56:55Z","title":"Adaptive Graph Unlearning","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-15T20:36:28.894278Z"},"links":{"citing_paper":"/paper/2505.12614"},"observation_digest":"sha256:e4b7b117dfe7cd35108bcdb6762c45e1a7382b67befa44b28dae18fa8d60c1c5","observation_id":"2acdb415-8f1f-48a4-800a-63a3ad357265","resolution":{"observed_at":"2026-08-15T20:36:29.219869Z","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":"1810.00826","last_updated":"2019-02-22T19:15:54Z","snapshot_observed_at":"2026-08-13T05:06:48.606308Z","submitted_at":"2018-10-01T17:11:31Z","title":"How Powerful are Graph Neural Networks?","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1810.00826","snapshot_observed_at":"2026-08-15T20:36:28.898839Z","title":"How powerful are graph neural net- works? arXiv preprint arXiv:1810.00826,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2505.12614","last_updated":"2025-05-19T01:56:55Z","snapshot_observed_at":"2026-08-18T09:27:52.406915Z","submitted_at":"2025-05-19T01:56:55Z","title":"Adaptive Graph Unlearning","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-15T20:36:28.898839Z"},"links":{"cited_paper":"/paper/1810.00826","citing_paper":"/paper/2505.12614"},"observation_digest":"sha256:512938ff585897ed2d7912f839de9ccfd14b5a0e6552147d7e0e0bc5d2ccf676","observation_id":"d64555a7-3415-49be-aaae-a2ccb146d886","resolution":{"observed_at":"2026-08-15T20:36:28.898839Z","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-15T20:36:29.198490Z","title":"Revisiting semi-supervised learning with graph embeddings","venue":null,"work_id":"e3002ad0-8a82-41f3-9a7e-248b63ae59f8","year":2016},"citing_paper":{"arxiv_id":"2505.12614","last_updated":"2025-05-19T01:56:55Z","snapshot_observed_at":"2026-08-18T09:27:52.406915Z","submitted_at":"2025-05-19T01:56:55Z","title":"Adaptive Graph Unlearning","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-15T20:36:28.903582Z"},"links":{"citing_paper":"/paper/2505.12614"},"observation_digest":"sha256:c251f43f6ce4a07b228e5f5cff88ead9b78087e08eea45bb9bbd62e3ed035ca2","observation_id":"3ed96317-6e45-4c6f-9028-709cf4712e17","resolution":{"observed_at":"2026-08-15T20:36:29.203727Z","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-15T20:36:29.182759Z","title":"Erase then rectify: A training- free parameter editing approach for cost-effective graph unlearning","venue":null,"work_id":"5e99d1ba-55f2-4546-8626-1815c72c7764","year":2025},"citing_paper":{"arxiv_id":"2505.12614","last_updated":"2025-05-19T01:56:55Z","snapshot_observed_at":"2026-08-18T09:27:52.406915Z","submitted_at":"2025-05-19T01:56:55Z","title":"Adaptive Graph Unlearning","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-15T20:36:28.908628Z"},"links":{"citing_paper":"/paper/2505.12614"},"observation_digest":"sha256:e6f42915c6652bf4ed1380d7e1d73930feb29cf01eea4cf1bb9a48f53d8d71b2","observation_id":"8ab1b391-9fdb-47f3-8d89-4f26965e3df2","resolution":{"observed_at":"2026-08-15T20:36:29.187856Z","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-15T20:36:29.167833Z","title":"Scalable and cer- tifiable graph unlearning: Overcoming the approximation error barrier","venue":null,"work_id":"2eacbbbd-a5fe-4d24-9b6c-b3bf3a7ced4b","year":2025},"citing_paper":{"arxiv_id":"2505.12614","last_updated":"2025-05-19T01:56:55Z","snapshot_observed_at":"2026-08-18T09:27:52.406915Z","submitted_at":"2025-05-19T01:56:55Z","title":"Adaptive Graph Unlearning","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-15T20:36:28.912659Z"},"links":{"citing_paper":"/paper/2505.12614"},"observation_digest":"sha256:8dd6df1d98fb870f40612aabd1e6aba502fdf6ac3a7bb9a5ecb0c9dc52543646","observation_id":"2ab71058-fd68-434f-9a20-1f91355b5fea","resolution":{"observed_at":"2026-08-15T20:36:29.172685Z","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-15T20:36:29.152568Z","title":"Graph- saint: Graph sampling based inductive learning method","venue":null,"work_id":"d0982fe8-4b26-4320-afe1-460e2dab2cab","year":2019},"citing_paper":{"arxiv_id":"2505.12614","last_updated":"2025-05-19T01:56:55Z","snapshot_observed_at":"2026-08-18T09:27:52.406915Z","submitted_at":"2025-05-19T01:56:55Z","title":"Adaptive Graph Unlearning","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-15T20:36:28.916987Z"},"links":{"citing_paper":"/paper/2505.12614"},"observation_digest":"sha256:2bc17d10d4f00ac93868ec64789dd1e718547edc4cb02a2a29bc86bb31c06976","observation_id":"82a9378b-e22b-49d0-8d36-6c9e12641f7e","resolution":{"observed_at":"2026-08-15T20:36:29.157247Z","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":"2412.00789","last_updated":"2025-06-09T15:05:59Z","snapshot_observed_at":"2026-08-15T19:33:18.161417Z","submitted_at":"2024-12-01T12:23:25Z","title":"A Cognac Shot To Forget Bad Memories: Corrective Unlearning for Graph Neural Networks","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.00789","snapshot_observed_at":"2026-08-15T20:36:28.863502Z","title":"A cognac shot to forget bad memories: Corrective unlearning in gnns.arXiv preprint arXiv:2412.00789,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.12614","last_updated":"2025-05-19T01:56:55Z","snapshot_observed_at":"2026-08-18T09:27:52.406915Z","submitted_at":"2025-05-19T01:56:55Z","title":"Adaptive Graph Unlearning","version":1},"reference_index":2016,"source":"pdf_text","source_observed_at":"2026-08-15T20:36:28.863502Z"},"links":{"cited_paper":"/paper/2412.00789","citing_paper":"/paper/2505.12614"},"observation_digest":"sha256:06c0a8ad259a9bdd6d4d00df524bf67ceff9c665f120ac52fd3cda94701a83ec","observation_id":"60529417-0f62-459a-9a77-4f82ae8a78ad","resolution":{"observed_at":"2026-08-15T20:36:28.863502Z","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-15T20:36:29.304995Z","title":"A review of graph neural networks: concepts, architectures, techniques, challenges, datasets, applications, and future directions.Journal of Big Data, 11(1):18,","venue":null,"work_id":"11b83b57-68ab-4085-ad1c-96ed1d38f452","year":2024},"citing_paper":{"arxiv_id":"2505.12614","last_updated":"2025-05-19T01:56:55Z","snapshot_observed_at":"2026-08-18T09:27:52.406915Z","submitted_at":"2025-05-19T01:56:55Z","title":"Adaptive Graph Unlearning","version":1},"reference_index":2017,"source":"pdf_text","source_observed_at":"2026-08-15T20:36:28.854328Z"},"links":{"citing_paper":"/paper/2505.12614"},"observation_digest":"sha256:aaae24402bd73694ab75db8d27b889fb1091cfd6b52e4a8ec7ff83c1a02bcb19","observation_id":"1d355d27-adc7-43e5-9ed9-70a3651b0a4f","resolution":{"observed_at":"2026-08-15T20:36:29.310051Z","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-15T20:36:29.259746Z","title":"Unlink to unlearn: Simplifying edge unlearning in gnns","venue":null,"work_id":"dc57aee0-1b79-4178-a95e-10710e1743b7","year":2024},"citing_paper":{"arxiv_id":"2505.12614","last_updated":"2025-05-19T01:56:55Z","snapshot_observed_at":"2026-08-18T09:27:52.406915Z","submitted_at":"2025-05-19T01:56:55Z","title":"Adaptive Graph Unlearning","version":1},"reference_index":2018,"source":"pdf_text","source_observed_at":"2026-08-15T20:36:28.881543Z"},"links":{"citing_paper":"/paper/2505.12614"},"observation_digest":"sha256:652cf7fbce900b6a809d8325f8836d5043b7f72b2a6fdd2deb5f140c4949ca56","observation_id":"97daa11d-a959-4471-b226-7e0ea3aa9a0e","resolution":{"observed_at":"2026-08-15T20:36:29.264467Z","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-15T20:36:29.137042Z","title":"Be- yond homophily in graph neural networks: Current lim- itations and effective designs","venue":null,"work_id":"1a693eca-71e3-4e7f-9bf1-07ad421f36d8","year":2020},"citing_paper":{"arxiv_id":"2505.12614","last_updated":"2025-05-19T01:56:55Z","snapshot_observed_at":"2026-08-18T09:27:52.406915Z","submitted_at":"2025-05-19T01:56:55Z","title":"Adaptive Graph Unlearning","version":1},"reference_index":2019,"source":"pdf_text","source_observed_at":"2026-08-15T20:36:28.921250Z"},"links":{"citing_paper":"/paper/2505.12614"},"observation_digest":"sha256:f4a77991f5032e00ce3e114e5b0f3f2cf90260e5ecc9c416c1e1184c8f61ec97","observation_id":"e5ef208a-893b-4c14-901d-22dfff9632a5","resolution":{"observed_at":"2026-08-15T20:36:29.141849Z","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-15T20:36:29.274675Z","title":"Pitfalls of graph neural network evaluation","venue":null,"work_id":"0cead6c7-b58e-4aff-b20a-539446eca1df","year":2018},"citing_paper":{"arxiv_id":"2505.12614","last_updated":"2025-05-19T01:56:55Z","snapshot_observed_at":"2026-08-18T09:27:52.406915Z","submitted_at":"2025-05-19T01:56:55Z","title":"Adaptive Graph Unlearning","version":1},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-15T20:36:28.877307Z"},"links":{"citing_paper":"/paper/2505.12614"},"observation_digest":"sha256:756b24daa73f2c214f3a6c2ff9055c09553f805e7f5b2cf68fb4464760504041","observation_id":"87cbdec7-2081-45b7-a63b-8fac666a2e7c","resolution":{"observed_at":"2026-08-15T20:36:29.279393Z","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-15T20:36:29.417772Z","title":"Characterizing the influence of graph elements","venue":null,"work_id":"295f756f-3125-4b09-9ae5-1970225bfa0e","year":2023},"citing_paper":{"arxiv_id":"2505.12614","last_updated":"2025-05-19T01:56:55Z","snapshot_observed_at":"2026-08-18T09:27:52.406915Z","submitted_at":"2025-05-19T01:56:55Z","title":"Adaptive Graph Unlearning","version":1},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-15T20:36:28.814164Z"},"links":{"citing_paper":"/paper/2505.12614"},"observation_digest":"sha256:6fdc82cc03869cf91d4504786b10467255fbcf1ee9127cc29419546f1a7fa859","observation_id":"e341a494-0e9b-46ab-8a38-dc1da1b6c66c","resolution":{"observed_at":"2026-08-15T20:36:29.422531Z","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-15T20:36:29.403667Z","title":"GNNDelete: A general strategy for unlearning in graph neural networks","venue":null,"work_id":"8130a8d7-857a-4808-b3c7-59afbaf99def","year":2023},"citing_paper":{"arxiv_id":"2505.12614","last_updated":"2025-05-19T01:56:55Z","snapshot_observed_at":"2026-08-18T09:27:52.406915Z","submitted_at":"2025-05-19T01:56:55Z","title":"Adaptive Graph Unlearning","version":1},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-15T20:36:28.818471Z"},"links":{"citing_paper":"/paper/2505.12614"},"observation_digest":"sha256:a4fa18ec959b4b614b016f3276d74df1249caef60105e068cc7a2b25c5aa3b14","observation_id":"3c818d6b-ed8a-47b5-b477-dd0145aa18e5","resolution":{"observed_at":"2026-08-15T20:36:29.408325Z","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-15T20:36:29.347660Z","title":"AGU Appendix","venue":null,"work_id":"4a0b1f8d-ec2e-4e3d-99ae-8b03fabe2f6d","year":2025},"citing_paper":{"arxiv_id":"2505.12614","last_updated":"2025-05-19T01:56:55Z","snapshot_observed_at":"2026-08-18T09:27:52.406915Z","submitted_at":"2025-05-19T01:56:55Z","title":"Adaptive Graph Unlearning","version":1},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-15T20:36:28.836840Z"},"links":{"citing_paper":"/paper/2505.12614"},"observation_digest":"sha256:239839c27590be0c4163d6e7f3e4e78b866ed0e321872e36cc584e4aa2c565a3","observation_id":"83aa5edb-084a-4665-a349-73515da041d0","resolution":{"observed_at":"2026-08-15T20:36:29.352153Z","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-15T20:36:29.333395Z","title":"Idea: A flexible framework of certified unlearning for graph neural networks","venue":null,"work_id":"d62b2c8e-ca9f-4289-90c4-48eb7c313158","year":2024},"citing_paper":{"arxiv_id":"2505.12614","last_updated":"2025-05-19T01:56:55Z","snapshot_observed_at":"2026-08-18T09:27:52.406915Z","submitted_at":"2025-05-19T01:56:55Z","title":"Adaptive Graph Unlearning","version":1},"reference_index":2025,"source":"pdf_text","source_observed_at":"2026-08-15T20:36:28.841121Z"},"links":{"citing_paper":"/paper/2505.12614"},"observation_digest":"sha256:5f9894c0651b6ac08e291f25710ab8caf7ffa777e988ffbcfc0da00b2bfaa5cb","observation_id":"7fd374ed-99b0-46fa-94ce-cfb825eb4808","resolution":{"observed_at":"2026-08-15T20:36:29.337841Z","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.12614","last_updated":"2025-05-19T01:56:55Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-18T09:27:52.406915Z","submitted_at":"2025-05-19T01:56:55Z","title":"Adaptive Graph Unlearning"},"reference_resolution":{"displayed":26,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":4,"verified_exact":1,"verified_fuzzy":21},"total_outbound_references":26},"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 18 August 2026, this Paper Citation Record lists 26 of 26 outbound references and 0 inbound Pith citation observations for arXiv:2505.12614."}