{"as_of":"2026-08-20T07:17:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:032185390f0fc156f99d56458ea797504bb456dce870d11fb66d0965ea295e27","coverage":[{"denominator":81,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":81,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T17:55:15.922930Z","state":"measured"},{"denominator":82,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":82,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-20T06:33:59.587034+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T15:33:52.868088Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-07T15:33:58.114130Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2501.11823","last_updated":"2025-01-21T02:02:35Z","snapshot_observed_at":"2026-08-19T15:53:37.510951Z","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:773badea0e7e30e75c6e7e9569e00da8eddd29d3b79acfaca2a78294fa5b78b3","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-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2501.11823/citation-record","integrity":"/paper/2501.11823/integrity","json":"/paper/2501.11823/citation-record.json","paper":"/paper/2501.11823"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:55:15.442980Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2501.11823","last_updated":"2025-01-21T02:02:35Z","snapshot_observed_at":"2026-08-19T15:53:37.510951Z","submitted_at":"2025-01-21T02:02:35Z","title":"Toward Scalable Graph Unlearning: A Node Influence Maximization based Approach","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-10T17:55:15.442980Z"},"links":{"citing_paper":"/paper/2501.11823"},"observation_digest":"sha256:bae5c253068718b21720ee4dd86b6722ad72584ab56a9d8ca4fc6759faa07ecd","observation_id":"9ac342d1-fade-404f-aaa3-39c2394f172a","resolution":{"observed_at":"2026-08-10T17:55:15.442980Z","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-10T17:55:17.270491Z","title":"Bruna, W","venue":null,"work_id":"c8ab7d5f-6cf0-49a5-b5ec-d62b10190f39","year":2013},"citing_paper":{"arxiv_id":"2501.11823","last_updated":"2025-01-21T02:02:35Z","snapshot_observed_at":"2026-08-19T15:53:37.510951Z","submitted_at":"2025-01-21T02:02:35Z","title":"Toward Scalable Graph Unlearning: A Node Influence Maximization based Approach","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-10T17:55:15.448486Z"},"links":{"citing_paper":"/paper/2501.11823"},"observation_digest":"sha256:86a4244481a6521d1b1d54a96d3f6c45dd4ea73d881b99241ab2d1e5169a586d","observation_id":"235c5877-1416-499a-84f8-da9b19dc8c5c","resolution":{"observed_at":"2026-08-10T17:55:17.275398Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-10T17:55:15.453405Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2501.11823","last_updated":"2025-01-21T02:02:35Z","snapshot_observed_at":"2026-08-19T15:53:37.510951Z","submitted_at":"2025-01-21T02:02:35Z","title":"Toward Scalable Graph Unlearning: A Node Influence Maximization based Approach","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-10T17:55:15.453405Z"},"links":{"citing_paper":"/paper/2501.11823"},"observation_digest":"sha256:f59b4eb73424cac586c611cebb790181f58192578431a45821c1d40a7b72a822","observation_id":"e7e64cab-0041-492c-8ec0-39e6c81e6415","resolution":{"observed_at":"2026-08-10T17:55:15.453405Z","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-10T17:55:17.230179Z","title":null,"venue":null,"work_id":"7ab594b0-ca9d-4713-9162-6320610574d3","year":2021},"citing_paper":{"arxiv_id":"2501.11823","last_updated":"2025-01-21T02:02:35Z","snapshot_observed_at":"2026-08-19T15:53:37.510951Z","submitted_at":"2025-01-21T02:02:35Z","title":"Toward Scalable Graph Unlearning: A Node Influence Maximization based Approach","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-10T17:55:15.464178Z"},"links":{"citing_paper":"/paper/2501.11823"},"observation_digest":"sha256:8e2d99b1c937bbec236d0c7eeb91042a175d748c28141eb5d8ece0529534907b","observation_id":"70980a48-4e7c-40f1-9d97-1019ce838887","resolution":{"observed_at":"2026-08-10T17:55:17.234876Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-10T17:55:17.214891Z","title":null,"venue":null,"work_id":"1e92ce15-7ede-42f8-9d63-164dc29b165e","year":2020},"citing_paper":{"arxiv_id":"2501.11823","last_updated":"2025-01-21T02:02:35Z","snapshot_observed_at":"2026-08-19T15:53:37.510951Z","submitted_at":"2025-01-21T02:02:35Z","title":"Toward Scalable Graph Unlearning: A Node Influence Maximization based Approach","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-10T17:55:15.468988Z"},"links":{"citing_paper":"/paper/2501.11823"},"observation_digest":"sha256:23155ac66af87dd35be0b4cee431b09746a3781c374fc621d4b864e2b0e68b11","observation_id":"ec97725a-4e24-4ffe-998a-793c4cdc512e","resolution":{"observed_at":"2026-08-10T17:55:17.219652Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-10T17:55:17.199375Z","title":null,"venue":null,"work_id":"01dcc760-5898-44d8-97ad-b4f9ad762f39","year":2022},"citing_paper":{"arxiv_id":"2501.11823","last_updated":"2025-01-21T02:02:35Z","snapshot_observed_at":"2026-08-19T15:53:37.510951Z","submitted_at":"2025-01-21T02:02:35Z","title":"Toward Scalable Graph Unlearning: A Node Influence Maximization based Approach","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-10T17:55:15.473763Z"},"links":{"citing_paper":"/paper/2501.11823"},"observation_digest":"sha256:a38eb945285778df7440dcb5f6dbdc1bf7744947b9c257e99fc9037c6e89ba98","observation_id":"71249191-2d08-4685-a97c-07107b7c31f7","resolution":{"observed_at":"2026-08-10T17:55:17.204083Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-10T17:55:15.478967Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2501.11823","last_updated":"2025-01-21T02:02:35Z","snapshot_observed_at":"2026-08-19T15:53:37.510951Z","submitted_at":"2025-01-21T02:02:35Z","title":"Toward Scalable Graph Unlearning: A Node Influence Maximization based Approach","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-10T17:55:15.478967Z"},"links":{"citing_paper":"/paper/2501.11823"},"observation_digest":"sha256:656906e477a3470fb9fa9a0acffa8f5855f0455d5125fc93735e87b5be73f3af","observation_id":"18a9f7d5-902b-45c0-b91e-8b88dc255e48","resolution":{"observed_at":"2026-08-10T17:55:15.478967Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:55:15.488254Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2501.11823","last_updated":"2025-01-21T02:02:35Z","snapshot_observed_at":"2026-08-19T15:53:37.510951Z","submitted_at":"2025-01-21T02:02:35Z","title":"Toward Scalable Graph Unlearning: A Node Influence Maximization based Approach","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-10T17:55:15.488254Z"},"links":{"citing_paper":"/paper/2501.11823"},"observation_digest":"sha256:6602d8ce771098705dae2f7a1da1ea88fb3ebe261d30cf5cdf59ed5c65c9679b","observation_id":"0e1f9d29-bf37-4725-b6e8-1958649747af","resolution":{"observed_at":"2026-08-10T17:55:15.488254Z","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-10T17:55:17.174316Z","title":"In International Conference on Learning Representations, ICLR","venue":null,"work_id":"5ee4a36f-283b-4d15-9bac-df97b481ba36","year":null},"citing_paper":{"arxiv_id":"2501.11823","last_updated":"2025-01-21T02:02:35Z","snapshot_observed_at":"2026-08-19T15:53:37.510951Z","submitted_at":"2025-01-21T02:02:35Z","title":"Toward Scalable Graph Unlearning: A Node Influence Maximization based Approach","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-10T17:55:15.483554Z"},"links":{"citing_paper":"/paper/2501.11823"},"observation_digest":"sha256:e346c9dee1dc48f0d85976ed91acada412d5f3fa9deec923d574466ddce8d4dd","observation_id":"816fef46-b8bd-4a87-9b05-5ad2528ab64d","resolution":{"observed_at":"2026-08-10T17:55:17.179556Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-10T17:55:17.119956Z","title":null,"venue":null,"work_id":"9030d2bb-c3da-465f-a501-69612d493d51","year":2024},"citing_paper":{"arxiv_id":"2501.11823","last_updated":"2025-01-21T02:02:35Z","snapshot_observed_at":"2026-08-19T15:53:37.510951Z","submitted_at":"2025-01-21T02:02:35Z","title":"Toward Scalable Graph Unlearning: A Node Influence Maximization based Approach","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-10T17:55:15.610380Z"},"links":{"citing_paper":"/paper/2501.11823"},"observation_digest":"sha256:4d596699f63cd0ed9226a5d52d41d03cda02d71fa060f20bdf8d2b4d163fe35d","observation_id":"61023f2c-107d-46f8-891b-4bf8963f3011","resolution":{"observed_at":"2026-08-10T17:55:17.124699Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-10T17:55:17.104589Z","title":null,"venue":null,"work_id":"7f5086c9-5762-4d08-88fb-9529741d5652","year":2022},"citing_paper":{"arxiv_id":"2501.11823","last_updated":"2025-01-21T02:02:35Z","snapshot_observed_at":"2026-08-19T15:53:37.510951Z","submitted_at":"2025-01-21T02:02:35Z","title":"Toward Scalable Graph Unlearning: A Node Influence Maximization based Approach","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-10T17:55:15.615111Z"},"links":{"citing_paper":"/paper/2501.11823"},"observation_digest":"sha256:b661673e51707cb802a0bfa95ced4491e251c1e20ff75275e9ae440656ed1fd3","observation_id":"5151856d-f5e7-4db2-be39-9b5afff71b3b","resolution":{"observed_at":"2026-08-10T17:55:17.109487Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-10T17:55:17.134873Z","title":null,"venue":null,"work_id":"d45ca299-696d-43fd-98bb-a01f3bc82647","year":2022},"citing_paper":{"arxiv_id":"2501.11823","last_updated":"2025-01-21T02:02:35Z","snapshot_observed_at":"2026-08-19T15:53:37.510951Z","submitted_at":"2025-01-21T02:02:35Z","title":"Toward Scalable Graph Unlearning: A Node Influence Maximization based Approach","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-10T17:55:15.605772Z"},"links":{"citing_paper":"/paper/2501.11823"},"observation_digest":"sha256:0045d68b3e862a9f3ca82a29176c08be14508ebcbdd7138ed04b9bdcab19d6b6","observation_id":"35212205-92c8-4e17-aa10-6a20ccf83e99","resolution":{"observed_at":"2026-08-10T17:55:17.139525Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2309.00976","last_updated":"2024-10-14T14:11:22Z","snapshot_observed_at":"2026-08-16T16:21:11.435032Z","submitted_at":"2023-09-02T16:20:41Z","title":"Pure Message Passing Can Estimate Common Neighbor for Link Prediction","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.00976","snapshot_observed_at":"2026-08-10T17:55:15.624070Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2501.11823","last_updated":"2025-01-21T02:02:35Z","snapshot_observed_at":"2026-08-19T15:53:37.510951Z","submitted_at":"2025-01-21T02:02:35Z","title":"Toward Scalable Graph Unlearning: A Node Influence Maximization based Approach","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-10T17:55:15.624070Z"},"links":{"cited_paper":"/paper/2309.00976","citing_paper":"/paper/2501.11823"},"observation_digest":"sha256:f6ad7dc0c1ea502bad109dc7ee520dad32f3e4871de34ed331bf9abdd0f520a7","observation_id":"f48a2032-dfe4-4e85-b669-58219f865d59","resolution":{"observed_at":"2026-08-10T17:55:15.624070Z","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-10T17:55:17.072004Z","title":null,"venue":null,"work_id":"003e7c20-1ebe-473e-b1e1-d5c2edd45eb1","year":2022},"citing_paper":{"arxiv_id":"2501.11823","last_updated":"2025-01-21T02:02:35Z","snapshot_observed_at":"2026-08-19T15:53:37.510951Z","submitted_at":"2025-01-21T02:02:35Z","title":"Toward Scalable Graph Unlearning: A Node Influence Maximization based Approach","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-10T17:55:15.629051Z"},"links":{"citing_paper":"/paper/2501.11823"},"observation_digest":"sha256:93dfa5715ca317d5a8282785cad38a08ce0bf5a9f42950ac53da1b0b6450767d","observation_id":"fd8db67f-0533-473d-ad78-14eebe54eab2","resolution":{"observed_at":"2026-08-10T17:55:17.076767Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-10T17:55:17.087890Z","title":null,"venue":null,"work_id":"a435bfc4-b017-4fb1-881d-3a866c4273ae","year":2023},"citing_paper":{"arxiv_id":"2501.11823","last_updated":"2025-01-21T02:02:35Z","snapshot_observed_at":"2026-08-19T15:53:37.510951Z","submitted_at":"2025-01-21T02:02:35Z","title":"Toward Scalable Graph Unlearning: A Node Influence Maximization based Approach","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-10T17:55:15.619608Z"},"links":{"citing_paper":"/paper/2501.11823"},"observation_digest":"sha256:5df6c74626b285c58cbe19713e55fffc8e57123a706dc499dbbf69ea2a99a417","observation_id":"af2628bc-adb6-4ee5-b6cd-ab6a27d2e089","resolution":{"observed_at":"2026-08-10T17:55:17.093036Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-10T17:55:17.056448Z","title":null,"venue":null,"work_id":"3ba35c90-ff90-4504-9a5f-f3500a54819d","year":2022},"citing_paper":{"arxiv_id":"2501.11823","last_updated":"2025-01-21T02:02:35Z","snapshot_observed_at":"2026-08-19T15:53:37.510951Z","submitted_at":"2025-01-21T02:02:35Z","title":"Toward Scalable Graph Unlearning: A Node Influence Maximization based Approach","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-10T17:55:15.639025Z"},"links":{"citing_paper":"/paper/2501.11823"},"observation_digest":"sha256:0de0eed34bbdf5c4981a336c6db26f8f35939eb26338c593642ce2dc9f47aad9","observation_id":"c14dc454-071d-4e7f-8398-9671f3778ad6","resolution":{"observed_at":"2026-08-10T17:55:17.061582Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-10T17:55:17.041331Z","title":null,"venue":null,"work_id":"c4f12079-7211-4d37-845a-64b3b6a779df","year":2020},"citing_paper":{"arxiv_id":"2501.11823","last_updated":"2025-01-21T02:02:35Z","snapshot_observed_at":"2026-08-19T15:53:37.510951Z","submitted_at":"2025-01-21T02:02:35Z","title":"Toward Scalable Graph Unlearning: A Node Influence Maximization based Approach","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-10T17:55:15.643454Z"},"links":{"citing_paper":"/paper/2501.11823"},"observation_digest":"sha256:3833c8a5fbfa894467a66900379a503a95dce6313341c154da134e0b76505b2b","observation_id":"631d889c-d45c-43b8-9e05-42b307c05e4f","resolution":{"observed_at":"2026-08-10T17:55:17.046201Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2004.11198","last_updated":"2020-11-03T19:20:22Z","snapshot_observed_at":"2026-08-18T16:51:06.422299Z","submitted_at":"2020-04-23T14:46:10Z","title":"SIGN: Scalable Inception Graph Neural Networks","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2004.11198","snapshot_observed_at":"2026-08-10T17:55:15.633785Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2501.11823","last_updated":"2025-01-21T02:02:35Z","snapshot_observed_at":"2026-08-19T15:53:37.510951Z","submitted_at":"2025-01-21T02:02:35Z","title":"Toward Scalable Graph Unlearning: A Node Influence Maximization based Approach","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-10T17:55:15.633785Z"},"links":{"cited_paper":"/paper/2004.11198","citing_paper":"/paper/2501.11823"},"observation_digest":"sha256:e3cb21cdf1864aecdc05ebaa53d0d64ab0192c64a2ef59ecd78fe1f5f70a3a6c","observation_id":"45599743-420b-4dad-affa-090f32745fbb","resolution":{"observed_at":"2026-08-10T17:55:15.633785Z","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-10T17:55:17.009835Z","title":null,"venue":null,"work_id":"3f954d20-77b6-4a71-ae84-ddc2ddf445f8","year":2017},"citing_paper":{"arxiv_id":"2501.11823","last_updated":"2025-01-21T02:02:35Z","snapshot_observed_at":"2026-08-19T15:53:37.510951Z","submitted_at":"2025-01-21T02:02:35Z","title":"Toward Scalable Graph Unlearning: A Node Influence Maximization based Approach","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-10T17:55:15.652869Z"},"links":{"citing_paper":"/paper/2501.11823"},"observation_digest":"sha256:1d13a8b667d25232d8d0e1b3443e0616121d841eb85d088baffc463bf51d5000","observation_id":"9768a97e-bb9d-48fd-8f0a-f124a8f6909c","resolution":{"observed_at":"2026-08-10T17:55:17.014505Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-10T17:55:15.657503Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2501.11823","last_updated":"2025-01-21T02:02:35Z","snapshot_observed_at":"2026-08-19T15:53:37.510951Z","submitted_at":"2025-01-21T02:02:35Z","title":"Toward Scalable Graph Unlearning: A Node Influence Maximization based Approach","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-10T17:55:15.657503Z"},"links":{"citing_paper":"/paper/2501.11823"},"observation_digest":"sha256:4ffa98cbe3b66857b5aeced89ab64b88cfa0c36bd8f328920278e94cadf7f7e1","observation_id":"1fee35cb-593b-4d0d-bd82-a805a4dd7036","resolution":{"observed_at":"2026-08-10T17:55:15.657503Z","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-10T17:55:17.025426Z","title":null,"venue":null,"work_id":"28603d4c-2e46-45fa-b282-272e33947f68","year":2020},"citing_paper":{"arxiv_id":"2501.11823","last_updated":"2025-01-21T02:02:35Z","snapshot_observed_at":"2026-08-19T15:53:37.510951Z","submitted_at":"2025-01-21T02:02:35Z","title":"Toward Scalable Graph Unlearning: A Node Influence Maximization based Approach","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-10T17:55:15.648107Z"},"links":{"citing_paper":"/paper/2501.11823"},"observation_digest":"sha256:57e58bd05e8649d1772d746ec92722d859996e2b107dcb03351853e8155d57fd","observation_id":"e85e1b19-7b3e-4f0a-84ad-7ac63d79193b","resolution":{"observed_at":"2026-08-10T17:55:17.030382Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-10T17:55:16.953086Z","title":null,"venue":null,"work_id":"b08dd628-dc64-417e-acd9-edad9abfa873","year":2021},"citing_paper":{"arxiv_id":"2501.11823","last_updated":"2025-01-21T02:02:35Z","snapshot_observed_at":"2026-08-19T15:53:37.510951Z","submitted_at":"2025-01-21T02:02:35Z","title":"Toward Scalable Graph Unlearning: A Node Influence Maximization based Approach","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-10T17:55:15.673027Z"},"links":{"citing_paper":"/paper/2501.11823"},"observation_digest":"sha256:fc1eee44ebac39f2dcf1b7e1529eb7f3d9c381e856a70991dc850677f33e1863","observation_id":"63e3fc16-0f84-41f5-a79d-f2674699d0c2","resolution":{"observed_at":"2026-08-10T17:55:16.958338Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-10T17:55:16.936668Z","title":null,"venue":null,"work_id":"65997e1a-00be-48ea-bfd1-0204d98930e0","year":1986},"citing_paper":{"arxiv_id":"2501.11823","last_updated":"2025-01-21T02:02:35Z","snapshot_observed_at":"2026-08-19T15:53:37.510951Z","submitted_at":"2025-01-21T02:02:35Z","title":"Toward Scalable Graph Unlearning: A Node Influence Maximization based Approach","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-10T17:55:15.677652Z"},"links":{"citing_paper":"/paper/2501.11823"},"observation_digest":"sha256:15b918b419af5dd5d5a8e8673b35b04cbe9a44a3d135fb27d1c4429a57a6d0be","observation_id":"7ec13125-eec6-44f2-a88f-6883af9839dd","resolution":{"observed_at":"2026-08-10T17:55:16.941900Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-10T17:55:16.921358Z","title":null,"venue":null,"work_id":"dd1b0586-f7d9-4271-be43-30f23022aefb","year":2003},"citing_paper":{"arxiv_id":"2501.11823","last_updated":"2025-01-21T02:02:35Z","snapshot_observed_at":"2026-08-19T15:53:37.510951Z","submitted_at":"2025-01-21T02:02:35Z","title":"Toward Scalable Graph Unlearning: A Node Influence Maximization based Approach","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-10T17:55:15.681919Z"},"links":{"citing_paper":"/paper/2501.11823"},"observation_digest":"sha256:ddddfd1be7c022ded84ce4cb236856ea9448c9f613c753695ef43dd22ca020c6","observation_id":"b9d360ad-e4f0-41e3-9afc-ac17f59fa9b1","resolution":{"observed_at":"2026-08-10T17:55:16.926044Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-10T17:55:16.968790Z","title":null,"venue":null,"work_id":"e9bd2201-20bc-4773-8757-f4abd2636f59","year":2020},"citing_paper":{"arxiv_id":"2501.11823","last_updated":"2025-01-21T02:02:35Z","snapshot_observed_at":"2026-08-19T15:53:37.510951Z","submitted_at":"2025-01-21T02:02:35Z","title":"Toward Scalable Graph Unlearning: A Node Influence Maximization based Approach","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-10T17:55:15.667501Z"},"links":{"citing_paper":"/paper/2501.11823"},"observation_digest":"sha256:de7dbf8f4fcf95e7f6ec7fc0d8c7e97e4bb194c4a80c0fbd3b1e38b17c89011d","observation_id":"2561e11e-11d3-485c-b8d6-05a8c9bc10d2","resolution":{"observed_at":"2026-08-10T17:55:16.973480Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-10T17:55:16.890319Z","title":null,"venue":null,"work_id":"866b169a-4754-4a33-b0f7-d4f8c5aa3888","year":2017},"citing_paper":{"arxiv_id":"2501.11823","last_updated":"2025-01-21T02:02:35Z","snapshot_observed_at":"2026-08-19T15:53:37.510951Z","submitted_at":"2025-01-21T02:02:35Z","title":"Toward Scalable Graph Unlearning: A Node Influence Maximization based Approach","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-10T17:55:15.691166Z"},"links":{"citing_paper":"/paper/2501.11823"},"observation_digest":"sha256:1c947d7658cb2b95a4f535417a32e7deff622f9518baa01c061aae0617e15539","observation_id":"2585c765-a84e-4cab-8af7-659ed122e92e","resolution":{"observed_at":"2026-08-10T17:55:16.895033Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-10T17:55:16.875479Z","title":null,"venue":null,"work_id":"ffe36f0a-990f-4abd-8340-bf598a3e73d3","year":2024},"citing_paper":{"arxiv_id":"2501.11823","last_updated":"2025-01-21T02:02:35Z","snapshot_observed_at":"2026-08-19T15:53:37.510951Z","submitted_at":"2025-01-21T02:02:35Z","title":"Toward Scalable Graph Unlearning: A Node Influence Maximization based Approach","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-10T17:55:15.695840Z"},"links":{"citing_paper":"/paper/2501.11823"},"observation_digest":"sha256:bb3d10bfe069056a9c3909b3c2446b76f8b842fab778d958f3d0b8f587fe8728","observation_id":"9dd6367f-f380-48cd-9eca-e13a19895013","resolution":{"observed_at":"2026-08-10T17:55:16.880120Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-10T17:55:15.700204Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.11823","last_updated":"2025-01-21T02:02:35Z","snapshot_observed_at":"2026-08-19T15:53:37.510951Z","submitted_at":"2025-01-21T02:02:35Z","title":"Toward Scalable Graph Unlearning: A Node Influence Maximization based Approach","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-10T17:55:15.700204Z"},"links":{"citing_paper":"/paper/2501.11823"},"observation_digest":"sha256:bbd1fd268ec1c7df9bab2ad349bca644ba07ce77a9fe805df56bed1e258feb24","observation_id":"6e5e5420-6444-49ce-a9c6-3738c2620bbc","resolution":{"observed_at":"2026-08-10T17:55:15.700204Z","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-10T17:55:16.906031Z","title":null,"venue":null,"work_id":"20bfbc28-4c22-447d-915e-ee3cea872513","year":2017},"citing_paper":{"arxiv_id":"2501.11823","last_updated":"2025-01-21T02:02:35Z","snapshot_observed_at":"2026-08-19T15:53:37.510951Z","submitted_at":"2025-01-21T02:02:35Z","title":"Toward Scalable Graph Unlearning: A Node Influence Maximization based Approach","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-10T17:55:15.686462Z"},"links":{"citing_paper":"/paper/2501.11823"},"observation_digest":"sha256:0edf1a8439f53d0b43cb5c59a7c4f930af8e8e5d06c403389b4c45142e0eb379","observation_id":"cee93d24-ecf8-4250-aa6f-c078c8e800da","resolution":{"observed_at":"2026-08-10T17:55:16.911010Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2307.15960","last_updated":"2023-07-29T11:36:38Z","snapshot_observed_at":"2026-08-16T15:12:19.201402Z","submitted_at":"2023-07-29T11:36:38Z","title":"Recommendation Unlearning via Matrix Correction","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2307.15960","snapshot_observed_at":"2026-08-10T17:55:15.709464Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2501.11823","last_updated":"2025-01-21T02:02:35Z","snapshot_observed_at":"2026-08-19T15:53:37.510951Z","submitted_at":"2025-01-21T02:02:35Z","title":"Toward Scalable Graph Unlearning: A Node Influence Maximization based Approach","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-10T17:55:15.709464Z"},"links":{"cited_paper":"/paper/2307.15960","citing_paper":"/paper/2501.11823"},"observation_digest":"sha256:bb2b41ca1fe48056d1bd32e2266793125aab848f8a632dd1d3565500841b5d9e","observation_id":"46e4c738-79e0-48bc-bcec-1175fa0abcb0","resolution":{"observed_at":"2026-08-10T17:55:15.709464Z","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-10T17:55:16.833794Z","title":null,"venue":null,"work_id":"e24d0f57-d9ef-447f-a550-64b317830ffc","year":2022},"citing_paper":{"arxiv_id":"2501.11823","last_updated":"2025-01-21T02:02:35Z","snapshot_observed_at":"2026-08-19T15:53:37.510951Z","submitted_at":"2025-01-21T02:02:35Z","title":"Toward Scalable Graph Unlearning: A Node Influence Maximization based Approach","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-10T17:55:15.714496Z"},"links":{"citing_paper":"/paper/2501.11823"},"observation_digest":"sha256:2730101f337551e837923c0d623cb805b4054afdee4437c712fa898727e21ca4","observation_id":"7ff552f9-9297-4136-a2cd-f3c9c3ba0bc5","resolution":{"observed_at":"2026-08-10T17:55:16.838595Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-10T17:55:16.818748Z","title":null,"venue":null,"work_id":"fe344159-59e0-40ff-b0a4-d7683908eae2","year":1978},"citing_paper":{"arxiv_id":"2501.11823","last_updated":"2025-01-21T02:02:35Z","snapshot_observed_at":"2026-08-19T15:53:37.510951Z","submitted_at":"2025-01-21T02:02:35Z","title":"Toward Scalable Graph Unlearning: A Node Influence Maximization based Approach","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-10T17:55:15.719006Z"},"links":{"citing_paper":"/paper/2501.11823"},"observation_digest":"sha256:2ebea4ddd281cd390a3b29e374f2794ea20b6aa5b07a66077cb8c894d6defd78","observation_id":"33a32e51-55e8-4236-acf5-7924008ac657","resolution":{"observed_at":"2026-08-10T17:55:16.823615Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-10T17:55:16.849108Z","title":null,"venue":null,"work_id":"8a02e1e8-6e70-4559-b22d-40e0ed3e4ea3","year":2024},"citing_paper":{"arxiv_id":"2501.11823","last_updated":"2025-01-21T02:02:35Z","snapshot_observed_at":"2026-08-19T15:53:37.510951Z","submitted_at":"2025-01-21T02:02:35Z","title":"Toward Scalable Graph Unlearning: A Node Influence Maximization based Approach","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-10T17:55:15.704848Z"},"links":{"citing_paper":"/paper/2501.11823"},"observation_digest":"sha256:377e591c41af475a1ff666b1ebf6aba848cc76c93814ccfe568e72909b39cde9","observation_id":"ea2411cb-971b-4c84-a40b-b06cf9855c76","resolution":{"observed_at":"2026-08-10T17:55:16.853741Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-10T17:55:16.787649Z","title":null,"venue":null,"work_id":"b729dd2c-763f-46a1-8ab9-d8b2f544a50a","year":2023},"citing_paper":{"arxiv_id":"2501.11823","last_updated":"2025-01-21T02:02:35Z","snapshot_observed_at":"2026-08-19T15:53:37.510951Z","submitted_at":"2025-01-21T02:02:35Z","title":"Toward Scalable Graph Unlearning: A Node Influence Maximization based Approach","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-10T17:55:15.727953Z"},"links":{"citing_paper":"/paper/2501.11823"},"observation_digest":"sha256:963de9f3c378f5235ceeade30fbb3e9e6750b93e996ee816d6b6bf330fcc6853","observation_id":"248bd909-8af3-4632-b1ce-e5da24fd30de","resolution":{"observed_at":"2026-08-10T17:55:16.793025Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-10T17:55:15.732606Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2501.11823","last_updated":"2025-01-21T02:02:35Z","snapshot_observed_at":"2026-08-19T15:53:37.510951Z","submitted_at":"2025-01-21T02:02:35Z","title":"Toward Scalable Graph Unlearning: A Node Influence Maximization based Approach","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-10T17:55:15.732606Z"},"links":{"citing_paper":"/paper/2501.11823"},"observation_digest":"sha256:8d95816d52e44985ea2a02aa7773ea7ba84ddf74650936839ad3ba63cf05cd26","observation_id":"b8d087d0-615d-452e-8439-77b0b3e5c815","resolution":{"observed_at":"2026-08-10T17:55:15.732606Z","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-10T17:55:16.747748Z","title":null,"venue":null,"work_id":"253dd127-e609-4d86-970a-8eb351edcee9","year":2023},"citing_paper":{"arxiv_id":"2501.11823","last_updated":"2025-01-21T02:02:35Z","snapshot_observed_at":"2026-08-19T15:53:37.510951Z","submitted_at":"2025-01-21T02:02:35Z","title":"Toward Scalable Graph Unlearning: A Node Influence Maximization based Approach","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-10T17:55:15.741587Z"},"links":{"citing_paper":"/paper/2501.11823"},"observation_digest":"sha256:0f1eaa5dd366f704c042c7d5a39a30d5ff6e0a6cf9f44040873e4364577a7ae5","observation_id":"3e0f4b02-8b2b-4779-9d2c-d20025af3402","resolution":{"observed_at":"2026-08-10T17:55:16.752295Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-10T17:55:16.803732Z","title":null,"venue":null,"work_id":"3657ef8e-9a0d-433d-8069-b39a68a738a4","year":2020},"citing_paper":{"arxiv_id":"2501.11823","last_updated":"2025-01-21T02:02:35Z","snapshot_observed_at":"2026-08-19T15:53:37.510951Z","submitted_at":"2025-01-21T02:02:35Z","title":"Toward Scalable Graph Unlearning: A Node Influence Maximization based Approach","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-10T17:55:15.723616Z"},"links":{"citing_paper":"/paper/2501.11823"},"observation_digest":"sha256:1b6beb6d6923549fe2a33e68b698cca242f36a9c1c7998764c9943396255e1ff","observation_id":"a7ded0b6-d7eb-465e-abfb-f54f8199c9f9","resolution":{"observed_at":"2026-08-10T17:55:16.808491Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-10T17:55:16.732838Z","title":null,"venue":null,"work_id":"e8eb8a9c-733c-4ea4-93a2-d06f23cda898","year":2023},"citing_paper":{"arxiv_id":"2501.11823","last_updated":"2025-01-21T02:02:35Z","snapshot_observed_at":"2026-08-19T15:53:37.510951Z","submitted_at":"2025-01-21T02:02:35Z","title":"Toward Scalable Graph Unlearning: A Node Influence Maximization based Approach","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-10T17:55:15.750673Z"},"links":{"citing_paper":"/paper/2501.11823"},"observation_digest":"sha256:c6a7dc34539183e01419fad608985b17ab51441ee917db0662e46389fae46707","observation_id":"8fa785a7-3c1a-4cf5-be74-f8fa93e3255a","resolution":{"observed_at":"2026-08-10T17:55:16.737475Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1811.05868","last_updated":"2019-06-18T13:15:39Z","snapshot_observed_at":"2026-08-14T17:59:20.424546Z","submitted_at":"2018-11-14T15:53:19Z","title":"Pitfalls of Graph Neural Network Evaluation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1811.05868","snapshot_observed_at":"2026-08-10T17:55:15.755289Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2501.11823","last_updated":"2025-01-21T02:02:35Z","snapshot_observed_at":"2026-08-19T15:53:37.510951Z","submitted_at":"2025-01-21T02:02:35Z","title":"Toward Scalable Graph Unlearning: A Node Influence Maximization based Approach","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-10T17:55:15.755289Z"},"links":{"cited_paper":"/paper/1811.05868","citing_paper":"/paper/2501.11823"},"observation_digest":"sha256:f7a1143b475ebf9a3016b4ea9040b2f993a054aba23789aca924a80a8ab7ef17","observation_id":"acf14da4-a009-4206-86ca-28681a8af320","resolution":{"observed_at":"2026-08-10T17:55:15.755289Z","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-10T17:55:16.762180Z","title":"Advances in Neural Information Processing Systems, NeurIPS (2023)","venue":null,"work_id":"17d85d4a-c571-4b66-9f30-1068547fba3b","year":2023},"citing_paper":{"arxiv_id":"2501.11823","last_updated":"2025-01-21T02:02:35Z","snapshot_observed_at":"2026-08-19T15:53:37.510951Z","submitted_at":"2025-01-21T02:02:35Z","title":"Toward Scalable Graph Unlearning: A Node Influence Maximization based Approach","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-10T17:55:15.737213Z"},"links":{"citing_paper":"/paper/2501.11823"},"observation_digest":"sha256:63b64fbd272d671905af8e13fc977f485b2460c232dd9631f0eaa56aecaf1af4","observation_id":"f86f1f9e-1fd3-4a8a-93fa-814205e0d576","resolution":{"observed_at":"2026-08-10T17:55:16.767034Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.16173","snapshot_observed_at":"2026-08-10T17:55:15.764488Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2501.11823","last_updated":"2025-01-21T02:02:35Z","snapshot_observed_at":"2026-08-19T15:53:37.510951Z","submitted_at":"2025-01-21T02:02:35Z","title":"Toward Scalable Graph Unlearning: A Node Influence Maximization based Approach","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-10T17:55:15.764488Z"},"links":{"cited_paper":"/paper/2309.16173","citing_paper":"/paper/2501.11823"},"observation_digest":"sha256:a45474edc750c2b95152d8cfb4274c96b07f2719dd0dfe7aeb7db7ebb06dd383","observation_id":"edcf94d3-185b-4742-b07a-e4cc5384ab89","resolution":{"observed_at":"2026-08-10T17:55:15.764488Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:55:15.745978Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2501.11823","last_updated":"2025-01-21T02:02:35Z","snapshot_observed_at":"2026-08-19T15:53:37.510951Z","submitted_at":"2025-01-21T02:02:35Z","title":"Toward Scalable Graph Unlearning: A Node Influence Maximization based Approach","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-10T17:55:15.745978Z"},"links":{"citing_paper":"/paper/2501.11823"},"observation_digest":"sha256:d9800998b7d91f1ba8c64190e741c9cf419eeeecf9c963e6a52cd3490fa135bc","observation_id":"839940c4-82d2-456d-b31e-464cb3c89f72","resolution":{"observed_at":"2026-08-10T17:55:15.745978Z","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-10T17:55:16.684372Z","title":null,"venue":null,"work_id":"eb7b988c-0fd5-4d50-bfe7-5b296660598a","year":2024},"citing_paper":{"arxiv_id":"2501.11823","last_updated":"2025-01-21T02:02:35Z","snapshot_observed_at":"2026-08-19T15:53:37.510951Z","submitted_at":"2025-01-21T02:02:35Z","title":"Toward Scalable Graph Unlearning: A Node Influence Maximization based Approach","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-10T17:55:15.773980Z"},"links":{"citing_paper":"/paper/2501.11823"},"observation_digest":"sha256:e5d1a80f8d3b14e2494cb62e904d330cf3e21d596fd894bfe2bac5ed52ab2aeb","observation_id":"57b25a42-51a1-4c28-8710-79d38bef4ebb","resolution":{"observed_at":"2026-08-10T17:55:16.689199Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-10T17:55:16.669311Z","title":null,"venue":null,"work_id":"302c7d24-ee7f-4f80-8b34-c273fa04e0b6","year":2015},"citing_paper":{"arxiv_id":"2501.11823","last_updated":"2025-01-21T02:02:35Z","snapshot_observed_at":"2026-08-19T15:53:37.510951Z","submitted_at":"2025-01-21T02:02:35Z","title":"Toward Scalable Graph Unlearning: A Node Influence Maximization based Approach","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-10T17:55:15.778411Z"},"links":{"citing_paper":"/paper/2501.11823"},"observation_digest":"sha256:5eeb433eb3ef046424e73376cfa97673abc10b2093d8529131b9b0db0fbe85fa","observation_id":"84b6b695-1fef-4070-b373-acb8c4b863a3","resolution":{"observed_at":"2026-08-10T17:55:16.674094Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-10T17:55:16.716885Z","title":null,"venue":null,"work_id":"005bf1c8-f251-4b9a-9443-b2ac819aefb4","year":2017},"citing_paper":{"arxiv_id":"2501.11823","last_updated":"2025-01-21T02:02:35Z","snapshot_observed_at":"2026-08-19T15:53:37.510951Z","submitted_at":"2025-01-21T02:02:35Z","title":"Toward Scalable Graph Unlearning: A Node Influence Maximization based Approach","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-10T17:55:15.760060Z"},"links":{"citing_paper":"/paper/2501.11823"},"observation_digest":"sha256:6528039c531a050c4f503f65509b1af22aeac290929a826372feac468d4c8a4b","observation_id":"f22fe99b-0538-4a45-bd23-915f35e8a8bc","resolution":{"observed_at":"2026-08-10T17:55:16.722148Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2304.03093","last_updated":"2023-04-07T05:59:48Z","snapshot_observed_at":"2026-08-18T10:47:20.480694Z","submitted_at":"2023-04-06T14:21:48Z","title":"Inductive Graph Unlearning","version":2},"cited_work":{"arxiv_id":"2304.03093","doi":null,"metadata_source":"pith","pith_arxiv_id":"2304.03093","snapshot_observed_at":"2026-08-10T17:55:16.011003Z","title":"Inductive Graph Unlearning","venue":"cs.LG","work_id":"c1b36b76-708c-41d3-afde-5f77fd7234f8","year":2023},"citing_paper":{"arxiv_id":"2501.11823","last_updated":"2025-01-21T02:02:35Z","snapshot_observed_at":"2026-08-19T15:53:37.510951Z","submitted_at":"2025-01-21T02:02:35Z","title":"Toward Scalable Graph Unlearning: A Node Influence Maximization based Approach","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-10T17:55:15.787451Z"},"links":{"cited_paper":"/paper/2304.03093","citing_paper":"/paper/2501.11823"},"observation_digest":"sha256:c88ea97480d3691eeed45a8fd143cbff876a041a0c6156b1e243035bf5459f8f","observation_id":"bb7fae58-e21f-4644-944a-3214048bc546","resolution":{"observed_at":"2026-08-10T17:55:16.017299Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-10T17:55:16.699811Z","title":null,"venue":null,"work_id":"97223e68-8e3a-4bc7-b03e-d83133dc2e24","year":2019},"citing_paper":{"arxiv_id":"2501.11823","last_updated":"2025-01-21T02:02:35Z","snapshot_observed_at":"2026-08-19T15:53:37.510951Z","submitted_at":"2025-01-21T02:02:35Z","title":"Toward Scalable Graph Unlearning: A Node Influence Maximization based Approach","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-10T17:55:15.769411Z"},"links":{"citing_paper":"/paper/2501.11823"},"observation_digest":"sha256:e33c27a317a32b7821e5a2113615acdc24b3fccfd885dde53cd5a2ac26490d84","observation_id":"6de04cd8-f102-4898-856b-1107df898867","resolution":{"observed_at":"2026-08-10T17:55:16.705179Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-10T17:55:15.796718Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2501.11823","last_updated":"2025-01-21T02:02:35Z","snapshot_observed_at":"2026-08-19T15:53:37.510951Z","submitted_at":"2025-01-21T02:02:35Z","title":"Toward Scalable Graph Unlearning: A Node Influence Maximization based Approach","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-10T17:55:15.796718Z"},"links":{"citing_paper":"/paper/2501.11823"},"observation_digest":"sha256:e6d7757ec32059c659e46b3b694a06191abc4cd1b2ced1dcf85621e720bae54e","observation_id":"4a6125bd-ac33-4716-9dfc-ee60c121cef9","resolution":{"observed_at":"2026-08-10T17:55:15.796718Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.11034","last_updated":"2024-05-17T18:11:11Z","snapshot_observed_at":"2026-08-17T18:36:16.926537Z","submitted_at":"2024-05-17T18:11:11Z","title":"Safety in Graph Machine Learning: Threats and Safeguards","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.11034","snapshot_observed_at":"2026-08-10T17:55:15.801271Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.11823","last_updated":"2025-01-21T02:02:35Z","snapshot_observed_at":"2026-08-19T15:53:37.510951Z","submitted_at":"2025-01-21T02:02:35Z","title":"Toward Scalable Graph Unlearning: A Node Influence Maximization based Approach","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-10T17:55:15.801271Z"},"links":{"cited_paper":"/paper/2405.11034","citing_paper":"/paper/2501.11823"},"observation_digest":"sha256:a57fbf54ecc3fe404512694bec208365d036a627dddc0c6b3079050557fbec13","observation_id":"e35b6c7a-537d-4d2a-b7cf-07ca62c0f433","resolution":{"observed_at":"2026-08-10T17:55:15.801271Z","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-10T17:55:16.653984Z","title":null,"venue":null,"work_id":"6a741d5b-fefc-4222-bde2-e8989697e120","year":2018},"citing_paper":{"arxiv_id":"2501.11823","last_updated":"2025-01-21T02:02:35Z","snapshot_observed_at":"2026-08-19T15:53:37.510951Z","submitted_at":"2025-01-21T02:02:35Z","title":"Toward Scalable Graph Unlearning: A Node Influence Maximization based Approach","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-10T17:55:15.782767Z"},"links":{"citing_paper":"/paper/2501.11823"},"observation_digest":"sha256:5f1858f38a4a197a69ee61d94ade75fcc9c989c36f2beb23cf139cc0f7dc6389","observation_id":"dcdd0b48-3997-4a59-a9dd-e367d495f231","resolution":{"observed_at":"2026-08-10T17:55:16.658675Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-10T17:55:16.599917Z","title":null,"venue":null,"work_id":"c2e62aae-fd23-4480-bf6a-9eccea1dce71","year":2023},"citing_paper":{"arxiv_id":"2501.11823","last_updated":"2025-01-21T02:02:35Z","snapshot_observed_at":"2026-08-19T15:53:37.510951Z","submitted_at":"2025-01-21T02:02:35Z","title":"Toward Scalable Graph Unlearning: A Node Influence Maximization based Approach","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-10T17:55:15.810167Z"},"links":{"citing_paper":"/paper/2501.11823"},"observation_digest":"sha256:0c6dedc9ea1f70343b08bb2eee875f64bcf5a37bfa4769b38d4dcb0098389d5e","observation_id":"01f9addd-6aa0-44f8-ab66-f8fc23f39a7e","resolution":{"observed_at":"2026-08-10T17:55:16.604450Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-10T17:55:16.639065Z","title":null,"venue":null,"work_id":"469c6aa1-4ab5-42e1-aac2-27d3186ab95b","year":2021},"citing_paper":{"arxiv_id":"2501.11823","last_updated":"2025-01-21T02:02:35Z","snapshot_observed_at":"2026-08-19T15:53:37.510951Z","submitted_at":"2025-01-21T02:02:35Z","title":"Toward Scalable Graph Unlearning: A Node Influence Maximization based Approach","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-10T17:55:15.792251Z"},"links":{"citing_paper":"/paper/2501.11823"},"observation_digest":"sha256:cc151b49e63ff6ad4a464c8ee6d2c06500eb1eb6eacaf6e7c0892f26810ac803","observation_id":"73c42836-7e90-4e44-9293-c0c67a156077","resolution":{"observed_at":"2026-08-10T17:55:16.643773Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-10T17:55:16.569856Z","title":null,"venue":null,"work_id":"660b86de-49b6-493b-9fad-8868de7e30e1","year":2023},"citing_paper":{"arxiv_id":"2501.11823","last_updated":"2025-01-21T02:02:35Z","snapshot_observed_at":"2026-08-19T15:53:37.510951Z","submitted_at":"2025-01-21T02:02:35Z","title":"Toward Scalable Graph Unlearning: A Node Influence Maximization based Approach","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-10T17:55:15.819181Z"},"links":{"citing_paper":"/paper/2501.11823"},"observation_digest":"sha256:47c818aedb7ab3d3c13e953ce0df4ca7337a96807793e09ef5c6935a6d6e532f","observation_id":"ce5370e3-29f7-4021-8140-6e0fb553aeef","resolution":{"observed_at":"2026-08-10T17:55:16.574914Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-10T17:55:16.555049Z","title":null,"venue":null,"work_id":"beb93005-e89c-42ea-871e-62a62f5de878","year":2023},"citing_paper":{"arxiv_id":"2501.11823","last_updated":"2025-01-21T02:02:35Z","snapshot_observed_at":"2026-08-19T15:53:37.510951Z","submitted_at":"2025-01-21T02:02:35Z","title":"Toward Scalable Graph Unlearning: A Node Influence Maximization based Approach","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-10T17:55:15.823678Z"},"links":{"citing_paper":"/paper/2501.11823"},"observation_digest":"sha256:a1e30f2f51b22ccb2888a1bb0b81500c51686e0d945ae14e796a706ecf2a5c78","observation_id":"2ac0a64c-58b0-4328-8fce-706030601d96","resolution":{"observed_at":"2026-08-10T17:55:16.559736Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-10T17:55:16.614292Z","title":null,"venue":null,"work_id":"b53ae999-7ccb-4fe6-8b20-524b76382116","year":2024},"citing_paper":{"arxiv_id":"2501.11823","last_updated":"2025-01-21T02:02:35Z","snapshot_observed_at":"2026-08-19T15:53:37.510951Z","submitted_at":"2025-01-21T02:02:35Z","title":"Toward Scalable Graph Unlearning: A Node Influence Maximization based Approach","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-10T17:55:15.805816Z"},"links":{"citing_paper":"/paper/2501.11823"},"observation_digest":"sha256:81cede0955fbcb157383791dbdc70b487d02653360e5cf1f7f8135a987a74d98","observation_id":"ed65c4fa-42b3-4a2a-b50a-7c6d4f8a3098","resolution":{"observed_at":"2026-08-10T17:55:16.618684Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-10T17:55:16.524222Z","title":null,"venue":null,"work_id":"eada2b33-62d3-4586-916b-0aff549d8237","year":2019},"citing_paper":{"arxiv_id":"2501.11823","last_updated":"2025-01-21T02:02:35Z","snapshot_observed_at":"2026-08-19T15:53:37.510951Z","submitted_at":"2025-01-21T02:02:35Z","title":"Toward Scalable Graph Unlearning: A Node Influence Maximization based Approach","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-10T17:55:15.832246Z"},"links":{"citing_paper":"/paper/2501.11823"},"observation_digest":"sha256:2a1e77c4a59f90be06b5dd0f5146662bfb84bca986cb827c2ee44298fc02acd7","observation_id":"e24238b5-286d-430a-8276-d26734ce6c01","resolution":{"observed_at":"2026-08-10T17:55:16.529250Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-10T17:55:16.585212Z","title":null,"venue":null,"work_id":"01ef7443-5009-4edb-8f19-7cd33aa5c37b","year":2019},"citing_paper":{"arxiv_id":"2501.11823","last_updated":"2025-01-21T02:02:35Z","snapshot_observed_at":"2026-08-19T15:53:37.510951Z","submitted_at":"2025-01-21T02:02:35Z","title":"Toward Scalable Graph Unlearning: A Node Influence Maximization based Approach","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-10T17:55:15.814646Z"},"links":{"citing_paper":"/paper/2501.11823"},"observation_digest":"sha256:e9c71ca56e97d54c096ef2561a02d6ec39ac93a8a5243299413de3691a346920","observation_id":"37c8fdf5-2876-4c93-b8a4-3c3a59e01b38","resolution":{"observed_at":"2026-08-10T17:55:16.590077Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-10T17:55:16.475197Z","title":"Cohen, and Ruslan Salakhutdinov","venue":null,"work_id":"fb1dc1fc-e038-4904-a571-d212a34d5cc2","year":2016},"citing_paper":{"arxiv_id":"2501.11823","last_updated":"2025-01-21T02:02:35Z","snapshot_observed_at":"2026-08-19T15:53:37.510951Z","submitted_at":"2025-01-21T02:02:35Z","title":"Toward Scalable Graph Unlearning: A Node Influence Maximization based Approach","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-10T17:55:15.845171Z"},"links":{"citing_paper":"/paper/2501.11823"},"observation_digest":"sha256:53f4b298a78938a1fb15c6b199c0ac1ae27c3bd615137325df312788f2fe5bef","observation_id":"dbfb7d34-699d-4317-ba4a-a8b9bdf92bcc","resolution":{"observed_at":"2026-08-10T17:55:16.479984Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2408.09212","last_updated":"2025-02-18T01:24:24Z","snapshot_observed_at":"2026-08-16T13:25:50.641931Z","submitted_at":"2024-08-17T14:41:02Z","title":"Scalable and Certifiable Graph Unlearning: Overcoming the Approximation Error Barrier","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.09212","snapshot_observed_at":"2026-08-10T17:55:15.849416Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.11823","last_updated":"2025-01-21T02:02:35Z","snapshot_observed_at":"2026-08-19T15:53:37.510951Z","submitted_at":"2025-01-21T02:02:35Z","title":"Toward Scalable Graph Unlearning: A Node Influence Maximization based Approach","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-10T17:55:15.849416Z"},"links":{"cited_paper":"/paper/2408.09212","citing_paper":"/paper/2501.11823"},"observation_digest":"sha256:784bc7b44423e5d05ef3742f892227b69f7d55710370f4e804538e68d9e0ad70","observation_id":"03d2bec5-5d0e-45aa-b99c-8e572a8f6312","resolution":{"observed_at":"2026-08-10T17:55:15.849416Z","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-10T17:55:16.540101Z","title":null,"venue":null,"work_id":"77cc5bc2-072c-473c-acef-fbe9154ccf3f","year":2024},"citing_paper":{"arxiv_id":"2501.11823","last_updated":"2025-01-21T02:02:35Z","snapshot_observed_at":"2026-08-19T15:53:37.510951Z","submitted_at":"2025-01-21T02:02:35Z","title":"Toward Scalable Graph Unlearning: A Node Influence Maximization based Approach","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-10T17:55:15.828025Z"},"links":{"citing_paper":"/paper/2501.11823"},"observation_digest":"sha256:48c15c49f20e2678a2f57b58c955a1d4fa41d8abb39681f02eb2e50fddda2bf1","observation_id":"35c13de5-556f-47d1-9657-dbaa98c583f2","resolution":{"observed_at":"2026-08-10T17:55:16.544805Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-10T17:55:15.863576Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2501.11823","last_updated":"2025-01-21T02:02:35Z","snapshot_observed_at":"2026-08-19T15:53:37.510951Z","submitted_at":"2025-01-21T02:02:35Z","title":"Toward Scalable Graph Unlearning: A Node Influence Maximization based Approach","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-10T17:55:15.863576Z"},"links":{"citing_paper":"/paper/2501.11823"},"observation_digest":"sha256:f0f61095329c0a921fcb45a7626430b4ab8bf3440c6c6d06541a67330b95dca9","observation_id":"e0f9af11-4c4e-49fe-a5a4-19b2527daf62","resolution":{"observed_at":"2026-08-10T17:55:15.863576Z","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-10T17:55:16.507240Z","title":null,"venue":null,"work_id":"5aed50b4-d7bc-4a38-a01f-ddb8bce53693","year":null},"citing_paper":{"arxiv_id":"2501.11823","last_updated":"2025-01-21T02:02:35Z","snapshot_observed_at":"2026-08-19T15:53:37.510951Z","submitted_at":"2025-01-21T02:02:35Z","title":"Toward Scalable Graph Unlearning: A Node Influence Maximization based Approach","version":1},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-10T17:55:15.836495Z"},"links":{"citing_paper":"/paper/2501.11823"},"observation_digest":"sha256:b411c1a60eb27cb7cb2f60327b545f3d88378180f12f32bd4fc4c9bea43ae7c9","observation_id":"67f9cab5-ecac-4c9a-b0a2-11903b17e729","resolution":{"observed_at":"2026-08-10T17:55:16.512099Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-10T17:55:16.388063Z","title":null,"venue":null,"work_id":"47705bdd-5a9c-4d85-9834-ec6bd276e4c2","year":2024},"citing_paper":{"arxiv_id":"2501.11823","last_updated":"2025-01-21T02:02:35Z","snapshot_observed_at":"2026-08-19T15:53:37.510951Z","submitted_at":"2025-01-21T02:02:35Z","title":"Toward Scalable Graph Unlearning: A Node Influence Maximization based Approach","version":1},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-10T17:55:15.876683Z"},"links":{"citing_paper":"/paper/2501.11823"},"observation_digest":"sha256:fc5c9fc3bfdea7326defaedaf97a54c951874a35857844100baa5380e18d4663","observation_id":"2e37d411-cd8c-4f52-b48c-d0e47f80a038","resolution":{"observed_at":"2026-08-10T17:55:16.392648Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-10T17:55:16.373003Z","title":null,"venue":null,"work_id":"cd9afbef-aadd-4d3d-8128-36267713e43c","year":2018},"citing_paper":{"arxiv_id":"2501.11823","last_updated":"2025-01-21T02:02:35Z","snapshot_observed_at":"2026-08-19T15:53:37.510951Z","submitted_at":"2025-01-21T02:02:35Z","title":"Toward Scalable Graph Unlearning: A Node Influence Maximization based Approach","version":1},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-10T17:55:15.881042Z"},"links":{"citing_paper":"/paper/2501.11823"},"observation_digest":"sha256:b992b2fbceb2cf6a7868e355b83e9125264cdb9d88a9b821488893a84753cfa7","observation_id":"d4a9a8a1-a6cf-42e5-a4de-8ae43ca02f27","resolution":{"observed_at":"2026-08-10T17:55:16.377648Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-10T17:55:16.358046Z","title":null,"venue":null,"work_id":"78a52f93-06a1-42e1-89e2-6e3c6a8ecca1","year":2022},"citing_paper":{"arxiv_id":"2501.11823","last_updated":"2025-01-21T02:02:35Z","snapshot_observed_at":"2026-08-19T15:53:37.510951Z","submitted_at":"2025-01-21T02:02:35Z","title":"Toward Scalable Graph Unlearning: A Node Influence Maximization based Approach","version":1},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-08-10T17:55:15.885647Z"},"links":{"citing_paper":"/paper/2501.11823"},"observation_digest":"sha256:2993c82ed92aef4ec5cb7f33ca10a7b04b95c5382689ba3c227d44b3b58bebf3","observation_id":"2e12ed3c-4e61-40df-b592-743bcafdeccc","resolution":{"observed_at":"2026-08-10T17:55:16.362666Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-10T17:55:16.459307Z","title":null,"venue":null,"work_id":"e12425a7-a4e9-4afc-98b2-0bd60eb903a3","year":null},"citing_paper":{"arxiv_id":"2501.11823","last_updated":"2025-01-21T02:02:35Z","snapshot_observed_at":"2026-08-19T15:53:37.510951Z","submitted_at":"2025-01-21T02:02:35Z","title":"Toward Scalable Graph Unlearning: A Node Influence Maximization based Approach","version":1},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-08-10T17:55:15.854170Z"},"links":{"citing_paper":"/paper/2501.11823"},"observation_digest":"sha256:2b57459c8a4442adc843769ade53a26d7b3a24685665058647d1d115b34e9346","observation_id":"be4d75f2-6eee-40a5-a573-1de11399848a","resolution":{"observed_at":"2026-08-10T17:55:16.464666Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-10T17:55:16.444197Z","title":"In Proceedings of the ACM International Conference on Web Search and Data Mining, WSDM","venue":null,"work_id":"05485a34-ca5b-474f-b953-0a45d031bc65","year":null},"citing_paper":{"arxiv_id":"2501.11823","last_updated":"2025-01-21T02:02:35Z","snapshot_observed_at":"2026-08-19T15:53:37.510951Z","submitted_at":"2025-01-21T02:02:35Z","title":"Toward Scalable Graph Unlearning: A Node Influence Maximization based Approach","version":1},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-08-10T17:55:15.859081Z"},"links":{"citing_paper":"/paper/2501.11823"},"observation_digest":"sha256:dc4c830e393ba7f1cc606a2944442969b31a5277f00a76fd30844e2045894bf6","observation_id":"0bd378c0-a8a7-4e6f-9e48-64032e75c042","resolution":{"observed_at":"2026-08-10T17:55:16.449030Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-10T17:55:16.312175Z","title":null,"venue":null,"work_id":"fec1ec4e-6bcf-4965-8200-ce716ae5fa13","year":null},"citing_paper":{"arxiv_id":"2501.11823","last_updated":"2025-01-21T02:02:35Z","snapshot_observed_at":"2026-08-19T15:53:37.510951Z","submitted_at":"2025-01-21T02:02:35Z","title":"Toward Scalable Graph Unlearning: A Node Influence Maximization based Approach","version":1},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-08-10T17:55:15.899785Z"},"links":{"citing_paper":"/paper/2501.11823"},"observation_digest":"sha256:bf1c047c00a07c22aae47447e6499301133af9b5cea3469160612092e066c3b2","observation_id":"44508d46-dc83-4fbe-bd1f-d5de1feee408","resolution":{"observed_at":"2026-08-10T17:55:16.317152Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-10T17:55:16.417778Z","title":"Advances in Neural Information Processing Systems, NeurIPS (2021)","venue":null,"work_id":"fa81396a-4ff8-4326-b165-1418c3981687","year":2021},"citing_paper":{"arxiv_id":"2501.11823","last_updated":"2025-01-21T02:02:35Z","snapshot_observed_at":"2026-08-19T15:53:37.510951Z","submitted_at":"2025-01-21T02:02:35Z","title":"Toward Scalable Graph Unlearning: A Node Influence Maximization based Approach","version":1},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-08-10T17:55:15.867929Z"},"links":{"citing_paper":"/paper/2501.11823"},"observation_digest":"sha256:25c86edbd399ec3e85b9615bf3e13f134a3cae78422c24a49b0d6b6700b7b0ab","observation_id":"aa7c69b0-f9a1-468e-84b8-ac3e25adb2e1","resolution":{"observed_at":"2026-08-10T17:55:16.423523Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-10T17:55:16.403027Z","title":null,"venue":null,"work_id":"d2ac9ae3-b5ff-445d-9560-c5913c1d7ff5","year":2020},"citing_paper":{"arxiv_id":"2501.11823","last_updated":"2025-01-21T02:02:35Z","snapshot_observed_at":"2026-08-19T15:53:37.510951Z","submitted_at":"2025-01-21T02:02:35Z","title":"Toward Scalable Graph Unlearning: A Node Influence Maximization based Approach","version":1},"reference_index":70,"source":"pdf_text","source_observed_at":"2026-08-10T17:55:15.872315Z"},"links":{"citing_paper":"/paper/2501.11823"},"observation_digest":"sha256:1d07d3704893c9fcecf5e12979f1338c923fa715ddc687322119355ff17ead5c","observation_id":"4eb6ee7c-3bad-4ef3-9deb-9db6d201dfac","resolution":{"observed_at":"2026-08-10T17:55:16.407796Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2202.07082","last_updated":"2026-04-18T08:18:16Z","snapshot_observed_at":"2026-08-02T07:00:41.767213Z","submitted_at":"2022-02-14T23:07:47Z","title":"Graph Neural Networks for Graphs with Heterophily: A Survey","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2202.07082","snapshot_observed_at":"2026-08-10T17:55:15.918149Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2501.11823","last_updated":"2025-01-21T02:02:35Z","snapshot_observed_at":"2026-08-19T15:53:37.510951Z","submitted_at":"2025-01-21T02:02:35Z","title":"Toward Scalable Graph Unlearning: A Node Influence Maximization based Approach","version":1},"reference_index":71,"source":"pdf_text","source_observed_at":"2026-08-10T17:55:15.918149Z"},"links":{"cited_paper":"/paper/2202.07082","citing_paper":"/paper/2501.11823"},"observation_digest":"sha256:00a4b21bb51c7daffbaaca64d4dda309e379e6f7c8062ec3a5dfc91d3f0aa0ca","observation_id":"a7aaffd0-27d0-4fb4-a7d8-eafd4327f2e3","resolution":{"observed_at":"2026-08-10T17:55:15.918149Z","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-10T17:55:16.251455Z","title":null,"venue":null,"work_id":"8bef7012-76f8-432d-9675-b5ab866f7c49","year":2021},"citing_paper":{"arxiv_id":"2501.11823","last_updated":"2025-01-21T02:02:35Z","snapshot_observed_at":"2026-08-19T15:53:37.510951Z","submitted_at":"2025-01-21T02:02:35Z","title":"Toward Scalable Graph Unlearning: A Node Influence Maximization based Approach","version":1},"reference_index":72,"source":"pdf_text","source_observed_at":"2026-08-10T17:55:15.922930Z"},"links":{"citing_paper":"/paper/2501.11823"},"observation_digest":"sha256:021cedb6bb68c0a15de107b98351bdc693a54025fd59a55db4c44af08dec91d8","observation_id":"16550375-f44a-4912-bbf1-4814d2c2ff4a","resolution":{"observed_at":"2026-08-10T17:55:16.256212Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-10T17:55:16.342834Z","title":null,"venue":null,"work_id":"bd859c72-b7c8-44f6-aa86-e74d12d8bb01","year":2021},"citing_paper":{"arxiv_id":"2501.11823","last_updated":"2025-01-21T02:02:35Z","snapshot_observed_at":"2026-08-19T15:53:37.510951Z","submitted_at":"2025-01-21T02:02:35Z","title":"Toward Scalable Graph Unlearning: A Node Influence Maximization based Approach","version":1},"reference_index":74,"source":"pdf_text","source_observed_at":"2026-08-10T17:55:15.890154Z"},"links":{"citing_paper":"/paper/2501.11823"},"observation_digest":"sha256:24930fada4c038f78cfbdf10469bfe7e065c78ccc31b45301f15181659122596","observation_id":"3ee33509-72f7-4d3d-8e74-515eeb394eae","resolution":{"observed_at":"2026-08-10T17:55:16.348201Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-10T17:55:16.327996Z","title":null,"venue":null,"work_id":"e3cc0f1f-0f3a-416a-87e5-5af86fac848d","year":2021},"citing_paper":{"arxiv_id":"2501.11823","last_updated":"2025-01-21T02:02:35Z","snapshot_observed_at":"2026-08-19T15:53:37.510951Z","submitted_at":"2025-01-21T02:02:35Z","title":"Toward Scalable Graph Unlearning: A Node Influence Maximization based Approach","version":1},"reference_index":75,"source":"pdf_text","source_observed_at":"2026-08-10T17:55:15.895204Z"},"links":{"citing_paper":"/paper/2501.11823"},"observation_digest":"sha256:c7cfd95b7d881ec1bdcf0036ac56d41cb3b1a7329c8543da9052fbe2941b8fe7","observation_id":"427c51d3-9eb8-41d5-ac99-2a28df92b939","resolution":{"observed_at":"2026-08-10T17:55:16.332547Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-10T17:55:16.296770Z","title":"Proceedings of the VLDB Endowment (2021)","venue":null,"work_id":"e1fb6334-405d-4b3c-bc1a-6281ef61b110","year":2021},"citing_paper":{"arxiv_id":"2501.11823","last_updated":"2025-01-21T02:02:35Z","snapshot_observed_at":"2026-08-19T15:53:37.510951Z","submitted_at":"2025-01-21T02:02:35Z","title":"Toward Scalable Graph Unlearning: A Node Influence Maximization based Approach","version":1},"reference_index":77,"source":"pdf_text","source_observed_at":"2026-08-10T17:55:15.904323Z"},"links":{"citing_paper":"/paper/2501.11823"},"observation_digest":"sha256:ab8e02c838c1fda0791cecc6b5c5f925c661b63dd37325280775a7d418f0a914","observation_id":"54daeb1e-6f8e-4064-8765-98b399207871","resolution":{"observed_at":"2026-08-10T17:55:16.301657Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-10T17:55:16.281896Z","title":null,"venue":null,"work_id":"8b833e65-313f-42c6-8ad2-ccce45afadf3","year":2022},"citing_paper":{"arxiv_id":"2501.11823","last_updated":"2025-01-21T02:02:35Z","snapshot_observed_at":"2026-08-19T15:53:37.510951Z","submitted_at":"2025-01-21T02:02:35Z","title":"Toward Scalable Graph Unlearning: A Node Influence Maximization based Approach","version":1},"reference_index":78,"source":"pdf_text","source_observed_at":"2026-08-10T17:55:15.908943Z"},"links":{"citing_paper":"/paper/2501.11823"},"observation_digest":"sha256:dd8403f8f1064ac67bdc32140f16c9ae7a1927bedef0303b70e3e7ca2264812e","observation_id":"37b837bb-5272-41b5-86d7-a99fac81c430","resolution":{"observed_at":"2026-08-10T17:55:16.286513Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-10T17:55:16.266686Z","title":null,"venue":null,"work_id":"316c9876-7144-4db0-8756-e0409c261103","year":2021},"citing_paper":{"arxiv_id":"2501.11823","last_updated":"2025-01-21T02:02:35Z","snapshot_observed_at":"2026-08-19T15:53:37.510951Z","submitted_at":"2025-01-21T02:02:35Z","title":"Toward Scalable Graph Unlearning: A Node Influence Maximization based Approach","version":1},"reference_index":79,"source":"pdf_text","source_observed_at":"2026-08-10T17:55:15.913400Z"},"links":{"citing_paper":"/paper/2501.11823"},"observation_digest":"sha256:c1ed1d0fbb0bc48663921fd69f45160012ce4d73f755e7c5620b930b77c9808b","observation_id":"7ecbd6e6-fbe6-455b-b5b8-d83fb74fe058","resolution":{"observed_at":"2026-08-10T17:55:16.271660Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-10T17:55:16.490815Z","title":"In Machine Learning and Knowledge Discovery in Databases: European Conference, ECML PKDD 2012, Bristol, UK, September 24-28, 2012","venue":null,"work_id":"e173f342-4520-4b14-a660-2fe6ac0a5c1b","year":2012},"citing_paper":{"arxiv_id":"2501.11823","last_updated":"2025-01-21T02:02:35Z","snapshot_observed_at":"2026-08-19T15:53:37.510951Z","submitted_at":"2025-01-21T02:02:35Z","title":"Toward Scalable Graph Unlearning: A Node Influence Maximization based Approach","version":1},"reference_index":2012,"source":"pdf_text","source_observed_at":"2026-08-10T17:55:15.841039Z"},"links":{"citing_paper":"/paper/2501.11823"},"observation_digest":"sha256:b96e592cdad9c4b5bda2d94f20da86d5f29c87e40f2c798d35914a22220980c2","observation_id":"d342654b-c065-4bd9-8cd8-99cafa90265e","resolution":{"observed_at":"2026-08-10T17:55:16.495980Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-10T17:55:17.149583Z","title":"In Proceedings of the ACM SIGKDD Conference on Knowledge Discovery and Data Mining, KDD","venue":null,"work_id":"dd535f3e-481b-4c98-9999-4dbbb408ac47","year":null},"citing_paper":{"arxiv_id":"2501.11823","last_updated":"2025-01-21T02:02:35Z","snapshot_observed_at":"2026-08-19T15:53:37.510951Z","submitted_at":"2025-01-21T02:02:35Z","title":"Toward Scalable Graph Unlearning: A Node Influence Maximization based Approach","version":1},"reference_index":2019,"source":"pdf_text","source_observed_at":"2026-08-10T17:55:15.600333Z"},"links":{"citing_paper":"/paper/2501.11823"},"observation_digest":"sha256:7d77b45e5c91c6dea285f0a424b405a9cea879193f2b63921f2687d5653ae869","observation_id":"c289e714-8923-45d5-af13-6ea85c45c959","resolution":{"observed_at":"2026-08-10T17:55:17.154477Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-10T17:55:16.983711Z","title":"In USENIX Security Symposium, USENIX","venue":null,"work_id":"85f8af83-e4cb-476d-a856-ef6cd24f0c9d","year":null},"citing_paper":{"arxiv_id":"2501.11823","last_updated":"2025-01-21T02:02:35Z","snapshot_observed_at":"2026-08-19T15:53:37.510951Z","submitted_at":"2025-01-21T02:02:35Z","title":"Toward Scalable Graph Unlearning: A Node Influence Maximization based Approach","version":1},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-10T17:55:15.663076Z"},"links":{"citing_paper":"/paper/2501.11823"},"observation_digest":"sha256:73cb1a53e2809af968c270b2bf3e39d96184f6e18c57c4735036afcae31484ec","observation_id":"5b5e5f57-4026-4d9d-9a9d-6c9cde3ea772","resolution":{"observed_at":"2026-08-10T17:55:16.988636Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-10T17:55:17.245320Z","title":"Inter- national Conference on Learning Representations, ICLR (2023)","venue":null,"work_id":"b4c1ca5e-d49b-4321-acce-dc1f8ff8bd30","year":2023},"citing_paper":{"arxiv_id":"2501.11823","last_updated":"2025-01-21T02:02:35Z","snapshot_observed_at":"2026-08-19T15:53:37.510951Z","submitted_at":"2025-01-21T02:02:35Z","title":"Toward Scalable Graph Unlearning: A Node Influence Maximization based Approach","version":1},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-10T17:55:15.459331Z"},"links":{"citing_paper":"/paper/2501.11823"},"observation_digest":"sha256:c45b80940f45eb67726fe031eb36b627d0d406ab39a6f351d92673122f098cec","observation_id":"76bf8e85-4157-4b46-8e4e-c23227e638fc","resolution":{"observed_at":"2026-08-10T17:55:17.250288Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2501.11823","last_updated":"2025-01-21T02:02:35Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-19T15:53:37.510951Z","submitted_at":"2025-01-21T02:02:35Z","title":"Toward Scalable Graph Unlearning: A Node Influence Maximization based Approach"},"reference_resolution":{"displayed":81,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":69,"verified_exact":1,"verified_fuzzy":11},"total_outbound_references":81},"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-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"thesis":"As of 20 August 2026, this Paper Citation Record lists 81 of 81 outbound references and 1 inbound Pith citation observation for arXiv:2501.11823."}