{"as_of":"2026-08-18T05:52:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:7e4ebad711741ef93088249e05a16ed23792e1afb859c7ba1ed76a656df44d3c","coverage":[{"denominator":34,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":34,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-09T14:27:33.530979Z","state":"measured"},{"denominator":34,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":34,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-17T06:30:58.91139+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2502.01809/citation-record","integrity":"/paper/2502.01809/integrity","json":"/paper/2502.01809/citation-record.json","paper":"/paper/2502.01809"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T14:27:34.357294Z","title":"Subgraph neural net- works","venue":null,"work_id":"57b817cf-1eb7-44a4-8fc6-1e530fc5f622","year":2020},"citing_paper":{"arxiv_id":"2502.01809","last_updated":"2025-02-03T20:40:33Z","snapshot_observed_at":"2026-08-17T23:25:47.571823Z","submitted_at":"2025-02-03T20:40:33Z","title":"Self-supervised Subgraph Neural Network With Deep Reinforcement Walk Exploration","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-09T14:27:33.312981Z"},"links":{"citing_paper":"/paper/2502.01809"},"observation_digest":"sha256:5c96d56894d593f4e1ccaf70484d125a5edd3a429e56b91fbbad9dae9bf3e002","observation_id":"4315b5e4-9058-48ae-ba9b-43903f4e3809","resolution":{"observed_at":"2026-08-09T14:27:34.364329Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.20082","last_updated":"2024-03-20T18:22:16Z","snapshot_observed_at":"2026-08-16T14:47:25.088473Z","submitted_at":"2023-10-30T23:41:05Z","title":"Efficient Subgraph GNNs by Learning Effective Selection Policies","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.20082","snapshot_observed_at":"2026-08-09T14:27:33.322943Z","title":"Efficient subgraph gnns by learning effective selection policies","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.01809","last_updated":"2025-02-03T20:40:33Z","snapshot_observed_at":"2026-08-17T23:25:47.571823Z","submitted_at":"2025-02-03T20:40:33Z","title":"Self-supervised Subgraph Neural Network With Deep Reinforcement Walk Exploration","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-09T14:27:33.322943Z"},"links":{"cited_paper":"/paper/2310.20082","citing_paper":"/paper/2502.01809"},"observation_digest":"sha256:b414dfa5751983ee6b4d67401e1bc4da09a21fdf39b70bba8c7417297582d2a6","observation_id":"5ff4e672-fd14-406b-80b2-b58aa3ebe9e6","resolution":{"observed_at":"2026-08-09T14:27:33.322943Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2110.02910","last_updated":"2022-03-16T22:16:25Z","snapshot_observed_at":"2026-08-16T17:51:23.311342Z","submitted_at":"2021-10-06T16:45:07Z","title":"Equivariant Subgraph Aggregation Networks","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2110.02910","snapshot_observed_at":"2026-08-09T14:27:33.332769Z","title":"Equivariant subgraph ag- gregation networks","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.01809","last_updated":"2025-02-03T20:40:33Z","snapshot_observed_at":"2026-08-17T23:25:47.571823Z","submitted_at":"2025-02-03T20:40:33Z","title":"Self-supervised Subgraph Neural Network With Deep Reinforcement Walk Exploration","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-09T14:27:33.332769Z"},"links":{"cited_paper":"/paper/2110.02910","citing_paper":"/paper/2502.01809"},"observation_digest":"sha256:687ea7363f4393bae522ce76230ef345ebf4496ecc8f4037be281dc1e7ae5be4","observation_id":"0c9bacc9-5e84-4465-81a8-ee2f1beae748","resolution":{"observed_at":"2026-08-09T14:27:33.332769Z","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-09T14:27:34.336867Z","title":"Protein function prediction via graph kernels","venue":null,"work_id":"5ed47c40-c764-43df-b426-a13378cb2f62","year":2005},"citing_paper":{"arxiv_id":"2502.01809","last_updated":"2025-02-03T20:40:33Z","snapshot_observed_at":"2026-08-17T23:25:47.571823Z","submitted_at":"2025-02-03T20:40:33Z","title":"Self-supervised Subgraph Neural Network With Deep Reinforcement Walk Exploration","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-09T14:27:33.339333Z"},"links":{"citing_paper":"/paper/2502.01809"},"observation_digest":"sha256:bbf8bcf1fe2e640d0e79b2147eea98429ab5c7496c57eee4bc0cab4317452fc6","observation_id":"3577788a-ad12-458e-b35b-124987f1568a","resolution":{"observed_at":"2026-08-09T14:27:34.343733Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-09T14:27:34.302538Z","title":"Structure-activity relationship of mutagenic aromatic and heteroaromatic nitro compounds","venue":null,"work_id":"c95bc2ad-36b8-4477-8aa8-fc93e1e52e96","year":1991},"citing_paper":{"arxiv_id":"2502.01809","last_updated":"2025-02-03T20:40:33Z","snapshot_observed_at":"2026-08-17T23:25:47.571823Z","submitted_at":"2025-02-03T20:40:33Z","title":"Self-supervised Subgraph Neural Network With Deep Reinforcement Walk Exploration","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-09T14:27:33.345768Z"},"links":{"citing_paper":"/paper/2502.01809"},"observation_digest":"sha256:38b051a6f8c76f5dd61e40ebb1fc50b25869ca7dd36f778cfe1716d52632c41d","observation_id":"db439e3c-79c7-48ef-bd4c-114f3d59d299","resolution":{"observed_at":"2026-08-09T14:27:34.312824Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1903.02428","last_updated":"2019-04-25T10:06:09Z","snapshot_observed_at":"2026-08-02T18:54:43.326912Z","submitted_at":"2019-03-06T14:50:02Z","title":"Fast Graph Representation Learning with PyTorch Geometric","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1903.02428","snapshot_observed_at":"2026-08-09T14:27:33.353066Z","title":"Fast graph representation learning with pytorch geometric","venue":null,"work_id":null,"year":1903},"citing_paper":{"arxiv_id":"2502.01809","last_updated":"2025-02-03T20:40:33Z","snapshot_observed_at":"2026-08-17T23:25:47.571823Z","submitted_at":"2025-02-03T20:40:33Z","title":"Self-supervised Subgraph Neural Network With Deep Reinforcement Walk Exploration","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-09T14:27:33.353066Z"},"links":{"cited_paper":"/paper/1903.02428","citing_paper":"/paper/2502.01809"},"observation_digest":"sha256:9a317f2482f250d87c38ad0934ec0c032b5deb14278079f8e2019bf646d20c92","observation_id":"7b82f74d-4d56-42af-b8cc-fa50fc5e99ba","resolution":{"observed_at":"2026-08-09T14:27:33.353066Z","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-09T14:27:33.359323Z","title":"Inductive representation learning on large graphs","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2502.01809","last_updated":"2025-02-03T20:40:33Z","snapshot_observed_at":"2026-08-17T23:25:47.571823Z","submitted_at":"2025-02-03T20:40:33Z","title":"Self-supervised Subgraph Neural Network With Deep Reinforcement Walk Exploration","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-09T14:27:33.359323Z"},"links":{"citing_paper":"/paper/2502.01809"},"observation_digest":"sha256:c3ccab3d25002eac0580cb4c630de501d7c0049d1616791d6d0fc796c7ffd7c5","observation_id":"301830f3-428e-4b79-b269-c720be2cfad8","resolution":{"observed_at":"2026-08-09T14:27:33.359323Z","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-09T14:27:34.246679Z","title":"King, Stefan Kramer, and Ashwin Srinivasan","venue":null,"work_id":"e355a080-7cc4-410b-8f15-00e3ab861171","year":2000},"citing_paper":{"arxiv_id":"2502.01809","last_updated":"2025-02-03T20:40:33Z","snapshot_observed_at":"2026-08-17T23:25:47.571823Z","submitted_at":"2025-02-03T20:40:33Z","title":"Self-supervised Subgraph Neural Network With Deep Reinforcement Walk Exploration","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-09T14:27:33.365919Z"},"links":{"citing_paper":"/paper/2502.01809"},"observation_digest":"sha256:86597b42ff56c2adef63a3bdc1876c9ba5950d89814b9de8db7d8a5094b07228","observation_id":"62d6dd8a-d514-4abf-8212-a749fcf8af58","resolution":{"observed_at":"2026-08-09T14:27:34.254900Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-09T14:27:34.210902Z","title":"Finding frequent subgraphs in longitudinal social network data using a weighted graph mining approach","venue":null,"work_id":"49d441fc-e613-4038-ad27-cb6a58b512c4","year":2010},"citing_paper":{"arxiv_id":"2502.01809","last_updated":"2025-02-03T20:40:33Z","snapshot_observed_at":"2026-08-17T23:25:47.571823Z","submitted_at":"2025-02-03T20:40:33Z","title":"Self-supervised Subgraph Neural Network With Deep Reinforcement Walk Exploration","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-09T14:27:33.371489Z"},"links":{"citing_paper":"/paper/2502.01809"},"observation_digest":"sha256:b7ac5e28ea674bb479b41ec4dc1cb9c2527618ea3b2f9930cdb060d841e69a64","observation_id":"e47b8727-8bdb-4c95-974a-e34968d899ec","resolution":{"observed_at":"2026-08-09T14:27:34.223839Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1611.07308","last_updated":"2016-11-21T11:37:17Z","snapshot_observed_at":"2026-08-14T21:29:27.927932Z","submitted_at":"2016-11-21T11:37:17Z","title":"Variational Graph Auto-Encoders","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1611.07308","snapshot_observed_at":"2026-08-09T14:27:33.379376Z","title":"Variational graph auto-encoders","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2502.01809","last_updated":"2025-02-03T20:40:33Z","snapshot_observed_at":"2026-08-17T23:25:47.571823Z","submitted_at":"2025-02-03T20:40:33Z","title":"Self-supervised Subgraph Neural Network With Deep Reinforcement Walk Exploration","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-09T14:27:33.379376Z"},"links":{"cited_paper":"/paper/1611.07308","citing_paper":"/paper/2502.01809"},"observation_digest":"sha256:82155ea109f26bbfb34c86fa57a323efd39098e9e5b093493282c1973d91c211","observation_id":"a30a6bf0-5c7a-4a1c-b77e-65658551f4ad","resolution":{"observed_at":"2026-08-09T14:27:33.379376Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1609.02907","last_updated":"2017-02-22T09:55:36Z","snapshot_observed_at":"2026-08-17T10:49:36.026134Z","submitted_at":"2016-09-09T19:48:41Z","title":"Semi-Supervised Classification with Graph Convolutional Networks","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1609.02907","snapshot_observed_at":"2026-08-09T14:27:33.390203Z","title":"Kipf and Max Welling","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2502.01809","last_updated":"2025-02-03T20:40:33Z","snapshot_observed_at":"2026-08-17T23:25:47.571823Z","submitted_at":"2025-02-03T20:40:33Z","title":"Self-supervised Subgraph Neural Network With Deep Reinforcement Walk Exploration","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-09T14:27:33.390203Z"},"links":{"cited_paper":"/paper/1609.02907","citing_paper":"/paper/2502.01809"},"observation_digest":"sha256:ec3c376b40409fa6d95e6adf3decdbd317cc8bc9e28d2d65f671a260e7b625e2","observation_id":"95713ae2-d7f4-4f03-a31d-2524a59609da","resolution":{"observed_at":"2026-08-09T14:27:33.390203Z","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-09T14:27:33.401011Z","title":"Orphicx: A causality-inspired latent variable model for interpreting graph neural networks","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2502.01809","last_updated":"2025-02-03T20:40:33Z","snapshot_observed_at":"2026-08-17T23:25:47.571823Z","submitted_at":"2025-02-03T20:40:33Z","title":"Self-supervised Subgraph Neural Network With Deep Reinforcement Walk Exploration","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-09T14:27:33.401011Z"},"links":{"citing_paper":"/paper/2502.01809"},"observation_digest":"sha256:5a82b7edaa4a959a476c00de0ab1a1fdb5c58124c7f9158143ee0c5d70a720a8","observation_id":"7fc30e16-0ea7-4f3c-9e79-58cac6baea5a","resolution":{"observed_at":"2026-08-09T14:27:33.401011Z","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-09T14:27:34.152039Z","title":"Parameterized explainer for graph neural network","venue":null,"work_id":"aa03ff06-b271-46be-bb15-e002bdb14020","year":2020},"citing_paper":{"arxiv_id":"2502.01809","last_updated":"2025-02-03T20:40:33Z","snapshot_observed_at":"2026-08-17T23:25:47.571823Z","submitted_at":"2025-02-03T20:40:33Z","title":"Self-supervised Subgraph Neural Network With Deep Reinforcement Walk Exploration","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-09T14:27:33.407967Z"},"links":{"citing_paper":"/paper/2502.01809"},"observation_digest":"sha256:60e9e177721d36b0fb29bdd4a7db3db3723becb8413ba55246f5d581e6b495ca","observation_id":"9d61f112-199c-4ffb-809f-0254bf612837","resolution":{"observed_at":"2026-08-09T14:27:34.158458Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-09T14:27:34.122669Z","title":"Provably powerful graph networks","venue":null,"work_id":"6d86b7e6-295f-4855-9801-b8158bb15b7d","year":2019},"citing_paper":{"arxiv_id":"2502.01809","last_updated":"2025-02-03T20:40:33Z","snapshot_observed_at":"2026-08-17T23:25:47.571823Z","submitted_at":"2025-02-03T20:40:33Z","title":"Self-supervised Subgraph Neural Network With Deep Reinforcement Walk Exploration","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-09T14:27:33.416140Z"},"links":{"citing_paper":"/paper/2502.01809"},"observation_digest":"sha256:5d90aa813ad9b50690f8187b0d4fff89ffa623b0b7f06218a9e108834410e215","observation_id":"0876f81e-1697-4175-8397-056fc82dad1d","resolution":{"observed_at":"2026-08-09T14:27:34.130051Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1312.5602","last_updated":"2013-12-19T16:00:08Z","snapshot_observed_at":"2026-08-17T17:19:33.060917Z","submitted_at":"2013-12-19T16:00:08Z","title":"Playing Atari with Deep Reinforcement Learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1312.5602","snapshot_observed_at":"2026-08-09T14:27:33.421477Z","title":"Playing atari with deep reinforcement learning","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2502.01809","last_updated":"2025-02-03T20:40:33Z","snapshot_observed_at":"2026-08-17T23:25:47.571823Z","submitted_at":"2025-02-03T20:40:33Z","title":"Self-supervised Subgraph Neural Network With Deep Reinforcement Walk Exploration","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-09T14:27:33.421477Z"},"links":{"cited_paper":"/paper/1312.5602","citing_paper":"/paper/2502.01809"},"observation_digest":"sha256:3ed1173216e82bf79f7b57ca924c61600abb29e925c638520e88f8d5ab83c195","observation_id":"6220d501-973a-49c8-9a06-6a02901e4357","resolution":{"observed_at":"2026-08-09T14:27:33.421477Z","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-09T14:27:34.089452Z","title":"Kriege, Franka Bause, Kristian Kersting, Petra Mutzel, and Mar- ion Neumann","venue":null,"work_id":"d54c859a-15b7-49ea-876b-e4ae8951ae49","year":2020},"citing_paper":{"arxiv_id":"2502.01809","last_updated":"2025-02-03T20:40:33Z","snapshot_observed_at":"2026-08-17T23:25:47.571823Z","submitted_at":"2025-02-03T20:40:33Z","title":"Self-supervised Subgraph Neural Network With Deep Reinforcement Walk Exploration","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-09T14:27:33.427958Z"},"links":{"citing_paper":"/paper/2502.01809"},"observation_digest":"sha256:7efbed5327ed8704240a089520bb12ec73a92b2a935b543f3fae02dee7864f7e","observation_id":"e603bff5-d98b-4e09-a440-9d64c4a79750","resolution":{"observed_at":"2026-08-09T14:27:34.098460Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-09T14:27:33.433614Z","title":"Weisfeiler and leman go neural: Higher-order graph neural networks","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2502.01809","last_updated":"2025-02-03T20:40:33Z","snapshot_observed_at":"2026-08-17T23:25:47.571823Z","submitted_at":"2025-02-03T20:40:33Z","title":"Self-supervised Subgraph Neural Network With Deep Reinforcement Walk Exploration","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-09T14:27:33.433614Z"},"links":{"citing_paper":"/paper/2502.01809"},"observation_digest":"sha256:4981384275ce4b684212c5b6c80f8ebdaf8b2a7a2cca8a08f52357cb5d34a4f1","observation_id":"2db5f82d-5ba7-46fb-a918-98944ad7eaca","resolution":{"observed_at":"2026-08-09T14:27:33.433614Z","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-09T14:27:34.035102Z","title":"Biological network comparison using graphlet degree distribution","venue":null,"work_id":"c232ecd3-350f-4cc2-a3e3-e159f8d7649d","year":2007},"citing_paper":{"arxiv_id":"2502.01809","last_updated":"2025-02-03T20:40:33Z","snapshot_observed_at":"2026-08-17T23:25:47.571823Z","submitted_at":"2025-02-03T20:40:33Z","title":"Self-supervised Subgraph Neural Network With Deep Reinforcement Walk Exploration","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-09T14:27:33.439040Z"},"links":{"citing_paper":"/paper/2502.01809"},"observation_digest":"sha256:daaa79197a9f6fa2878e8c60fd42f650a669ed9329943399ebec4afcda6510c2","observation_id":"ba437d8f-a21a-4c7c-b45d-1633922b4292","resolution":{"observed_at":"2026-08-09T14:27:34.044613Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-09T14:27:34.007729Z","title":"Reinforcement learning enhanced explainer for graph neural networks","venue":null,"work_id":"1f710b32-9b78-4d8f-8513-cee5d2e24c9d","year":2021},"citing_paper":{"arxiv_id":"2502.01809","last_updated":"2025-02-03T20:40:33Z","snapshot_observed_at":"2026-08-17T23:25:47.571823Z","submitted_at":"2025-02-03T20:40:33Z","title":"Self-supervised Subgraph Neural Network With Deep Reinforcement Walk Exploration","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-09T14:27:33.444196Z"},"links":{"citing_paper":"/paper/2502.01809"},"observation_digest":"sha256:f3275ee4104dc37c8fd7897d21fd8340deaee90dc82f1ee9af5124d6f3252714","observation_id":"1285c42d-07bf-4a28-a8fe-0f1f0e7bb8b2","resolution":{"observed_at":"2026-08-09T14:27:34.015967Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-09T14:27:33.980558Z","title":"Shervashidze, P","venue":null,"work_id":"eba60c99-dbcd-4d24-9cd9-6abdc349e788","year":2011},"citing_paper":{"arxiv_id":"2502.01809","last_updated":"2025-02-03T20:40:33Z","snapshot_observed_at":"2026-08-17T23:25:47.571823Z","submitted_at":"2025-02-03T20:40:33Z","title":"Self-supervised Subgraph Neural Network With Deep Reinforcement Walk Exploration","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-09T14:27:33.449200Z"},"links":{"citing_paper":"/paper/2502.01809"},"observation_digest":"sha256:21012b5805fea432fb9ad6dc289fd3450cd668db886a70f697e1fcf780d34bc7","observation_id":"3de74502-b198-44d5-8ed4-2210f0f7f4aa","resolution":{"observed_at":"2026-08-09T14:27:33.987253Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-09T14:27:33.957856Z","title":"Sugar: Subgraph neural network with reinforcement pooling and self-supervised mutual information mechanism","venue":null,"work_id":"a07285ad-4937-4953-9eef-2447c9a688a0","year":2021},"citing_paper":{"arxiv_id":"2502.01809","last_updated":"2025-02-03T20:40:33Z","snapshot_observed_at":"2026-08-17T23:25:47.571823Z","submitted_at":"2025-02-03T20:40:33Z","title":"Self-supervised Subgraph Neural Network With Deep Reinforcement Walk Exploration","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-09T14:27:33.455064Z"},"links":{"citing_paper":"/paper/2502.01809"},"observation_digest":"sha256:d80bcd5f7b0d022c9c0bded7e94705c38457713acca1244af0ac7f1c1abc8986","observation_id":"04831206-059e-481a-8967-eae108b444a0","resolution":{"observed_at":"2026-08-09T14:27:33.964296Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-09T14:27:33.934568Z","title":"Spline-fitting with a genetic algorithm: A method for developing classification structure-activity relationships","venue":null,"work_id":"21fa71ef-f400-45f8-aa18-e8fe6689be91","year":1906},"citing_paper":{"arxiv_id":"2502.01809","last_updated":"2025-02-03T20:40:33Z","snapshot_observed_at":"2026-08-17T23:25:47.571823Z","submitted_at":"2025-02-03T20:40:33Z","title":"Self-supervised Subgraph Neural Network With Deep Reinforcement Walk Exploration","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-09T14:27:33.460131Z"},"links":{"citing_paper":"/paper/2502.01809"},"observation_digest":"sha256:afe713fc1b45394d382e6ee6e0ff71ad4a2d538c93043934b5783d90962f12eb","observation_id":"4bf9255c-6913-46fd-9fb0-1ae44582d677","resolution":{"observed_at":"2026-08-09T14:27:33.941831Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-09T14:27:33.911884Z","title":"Optimal transport for structured data with application on graphs","venue":null,"work_id":"ea927623-b28e-4b4e-8c80-07e71f0f43ff","year":2019},"citing_paper":{"arxiv_id":"2502.01809","last_updated":"2025-02-03T20:40:33Z","snapshot_observed_at":"2026-08-17T23:25:47.571823Z","submitted_at":"2025-02-03T20:40:33Z","title":"Self-supervised Subgraph Neural Network With Deep Reinforcement Walk Exploration","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-09T14:27:33.465857Z"},"links":{"citing_paper":"/paper/2502.01809"},"observation_digest":"sha256:336f43e2f4e418e3c626211cd7e01dd9acfc575f0d7a7e4fd53dacffb5b66d98","observation_id":"500c7355-2bde-4ada-83ff-1107481664e0","resolution":{"observed_at":"2026-08-09T14:27:33.919433Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-09T14:27:33.890514Z","title":"Wasserstein weisfeiler-lehman graph kernels","venue":null,"work_id":"7d0837a9-9273-434e-b556-c35acf4ff85b","year":2019},"citing_paper":{"arxiv_id":"2502.01809","last_updated":"2025-02-03T20:40:33Z","snapshot_observed_at":"2026-08-17T23:25:47.571823Z","submitted_at":"2025-02-03T20:40:33Z","title":"Self-supervised Subgraph Neural Network With Deep Reinforcement Walk Exploration","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-09T14:27:33.472448Z"},"links":{"citing_paper":"/paper/2502.01809"},"observation_digest":"sha256:f7ddd52d545a8034e08a79d9ba0953c7443870f363287e0eb1f57e2e72f4c9fd","observation_id":"98d930d4-863d-4aaf-a965-6ea8cabe58a1","resolution":{"observed_at":"2026-08-09T14:27:33.896296Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-09T14:27:33.872067Z","title":"Graphopt: Learning optimization models of graph formation","venue":null,"work_id":"d5fc69aa-5fd9-415c-96cf-e9f95202b0e8","year":2020},"citing_paper":{"arxiv_id":"2502.01809","last_updated":"2025-02-03T20:40:33Z","snapshot_observed_at":"2026-08-17T23:25:47.571823Z","submitted_at":"2025-02-03T20:40:33Z","title":"Self-supervised Subgraph Neural Network With Deep Reinforcement Walk Exploration","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-09T14:27:33.478290Z"},"links":{"citing_paper":"/paper/2502.01809"},"observation_digest":"sha256:fff303335b040356429ac9f7adc7e6ead71688434be2869de83e9015087ba097","observation_id":"e76a4eb5-e1ef-4f3b-838a-c03f924ab147","resolution":{"observed_at":"2026-08-09T14:27:33.876988Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-09T14:27:33.853670Z","title":"Comparison of descriptor spaces for chemical compound retrieval and classification","venue":null,"work_id":"b79865d7-890a-4981-95d2-4a33f9f65cf0","year":2008},"citing_paper":{"arxiv_id":"2502.01809","last_updated":"2025-02-03T20:40:33Z","snapshot_observed_at":"2026-08-17T23:25:47.571823Z","submitted_at":"2025-02-03T20:40:33Z","title":"Self-supervised Subgraph Neural Network With Deep Reinforcement Walk Exploration","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-09T14:27:33.484784Z"},"links":{"citing_paper":"/paper/2502.01809"},"observation_digest":"sha256:57dbe419e7fcb48c424a0df6e9b98b3f099e887d8eebff5bbf8063b52511ed72","observation_id":"7c1313ff-4515-4835-8a63-3d913e3b2365","resolution":{"observed_at":"2026-08-09T14:27:33.859458Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-09T14:27:33.835282Z","title":"Dynamic graph cnn for learning on point clouds","venue":null,"work_id":"5057e353-85ee-43de-9421-8e777c7786cb","year":2019},"citing_paper":{"arxiv_id":"2502.01809","last_updated":"2025-02-03T20:40:33Z","snapshot_observed_at":"2026-08-17T23:25:47.571823Z","submitted_at":"2025-02-03T20:40:33Z","title":"Self-supervised Subgraph Neural Network With Deep Reinforcement Walk Exploration","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-09T14:27:33.490687Z"},"links":{"citing_paper":"/paper/2502.01809"},"observation_digest":"sha256:9ef62ac73a1d8aa65f9073da307330e4ac629a26f2f7ee59028f1ad06afd2f98","observation_id":"8a5cc49c-621d-4b9a-a1a7-b985cfe06c9f","resolution":{"observed_at":"2026-08-09T14:27:33.840816Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-09T14:27:33.815074Z","title":"Q-learning","venue":null,"work_id":"2b309b61-9715-4469-9fe5-6d589c9bc8bf","year":1992},"citing_paper":{"arxiv_id":"2502.01809","last_updated":"2025-02-03T20:40:33Z","snapshot_observed_at":"2026-08-17T23:25:47.571823Z","submitted_at":"2025-02-03T20:40:33Z","title":"Self-supervised Subgraph Neural Network With Deep Reinforcement Walk Exploration","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-09T14:27:33.497038Z"},"links":{"citing_paper":"/paper/2502.01809"},"observation_digest":"sha256:56719b467ed84e798b1e868656f4c5caaceeb0fd2d503f1918ffbe10985b3189","observation_id":"ff2fcc47-7660-4fd5-9891-57b09d38227a","resolution":{"observed_at":"2026-08-09T14:27:33.820429Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-09T14:27:33.794453Z","title":"A new perspective on” how graph neural networks go beyond weisfeiler-lehman?”","venue":null,"work_id":"9c8490a8-fc76-4f49-826f-30665655e84b","year":2021},"citing_paper":{"arxiv_id":"2502.01809","last_updated":"2025-02-03T20:40:33Z","snapshot_observed_at":"2026-08-17T23:25:47.571823Z","submitted_at":"2025-02-03T20:40:33Z","title":"Self-supervised Subgraph Neural Network With Deep Reinforcement Walk Exploration","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-09T14:27:33.503574Z"},"links":{"citing_paper":"/paper/2502.01809"},"observation_digest":"sha256:ecb814c0807e93ccb74bbadf4a669310a4d5e8a17876675ba61fba5ac655b4c5","observation_id":"0d873a97-967e-428a-b2b8-74ea952ffad2","resolution":{"observed_at":"2026-08-09T14:27:33.800776Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-09T14:27:33.508915Z","title":"How powerful are graph neural networks? In International Conference on Learning Representations (ICLR), 2019","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2502.01809","last_updated":"2025-02-03T20:40:33Z","snapshot_observed_at":"2026-08-17T23:25:47.571823Z","submitted_at":"2025-02-03T20:40:33Z","title":"Self-supervised Subgraph Neural Network With Deep Reinforcement Walk Exploration","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-09T14:27:33.508915Z"},"links":{"citing_paper":"/paper/2502.01809"},"observation_digest":"sha256:5a8c372b4ae4ee519dcb27850dc347444bcda50f250b713dfbddf85d8ce44654","observation_id":"e991d409-b9b4-4dc8-ab7a-7ec04fa828af","resolution":{"observed_at":"2026-08-09T14:27:33.508915Z","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-09T14:27:33.760583Z","title":"Deep graph kernels","venue":null,"work_id":"028ee1f1-3d99-4b3f-ab85-7107089e3eab","year":2015},"citing_paper":{"arxiv_id":"2502.01809","last_updated":"2025-02-03T20:40:33Z","snapshot_observed_at":"2026-08-17T23:25:47.571823Z","submitted_at":"2025-02-03T20:40:33Z","title":"Self-supervised Subgraph Neural Network With Deep Reinforcement Walk Exploration","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-09T14:27:33.514655Z"},"links":{"citing_paper":"/paper/2502.01809"},"observation_digest":"sha256:721912df79558d0edc5f89c02bc1b6c35dd829a15a43a2d3067e339bc515a7d8","observation_id":"c05193e9-7fb6-4cf0-b346-f0a51eec27a1","resolution":{"observed_at":"2026-08-09T14:27:33.767414Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-09T14:27:33.520124Z","title":"Gnnexplainer: Generating explanations for graph neural networks","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2502.01809","last_updated":"2025-02-03T20:40:33Z","snapshot_observed_at":"2026-08-17T23:25:47.571823Z","submitted_at":"2025-02-03T20:40:33Z","title":"Self-supervised Subgraph Neural Network With Deep Reinforcement Walk Exploration","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-09T14:27:33.520124Z"},"links":{"citing_paper":"/paper/2502.01809"},"observation_digest":"sha256:620fa193b0621dd97abfd886b62fe6604d6b5cd5571f5a59e5f1d9be6a4c224e","observation_id":"25f3e03f-37e2-4f04-b594-f742ca568c93","resolution":{"observed_at":"2026-08-09T14:27:33.520124Z","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-09T14:27:33.726065Z","title":"On explainability of graph neural networks via subgraph explorations","venue":null,"work_id":"dcaf1d4f-231e-454e-bbe7-5bf485271cd9","year":2021},"citing_paper":{"arxiv_id":"2502.01809","last_updated":"2025-02-03T20:40:33Z","snapshot_observed_at":"2026-08-17T23:25:47.571823Z","submitted_at":"2025-02-03T20:40:33Z","title":"Self-supervised Subgraph Neural Network With Deep Reinforcement Walk Exploration","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-09T14:27:33.525379Z"},"links":{"citing_paper":"/paper/2502.01809"},"observation_digest":"sha256:17fb0ffcbb903c8c95ea147ad1d109065fc671d344a72766df2851c95e3d86e7","observation_id":"9a4e7106-5e5c-4d01-be1b-cac0f625de26","resolution":{"observed_at":"2026-08-09T14:27:33.734402Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-09T14:27:33.701548Z","title":"A survey on deep graph generation: Methods and applications","venue":null,"work_id":"0f0c576b-6e62-4fdf-b50b-622a1ff2239c","year":2022},"citing_paper":{"arxiv_id":"2502.01809","last_updated":"2025-02-03T20:40:33Z","snapshot_observed_at":"2026-08-17T23:25:47.571823Z","submitted_at":"2025-02-03T20:40:33Z","title":"Self-supervised Subgraph Neural Network With Deep Reinforcement Walk Exploration","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-09T14:27:33.530979Z"},"links":{"citing_paper":"/paper/2502.01809"},"observation_digest":"sha256:4b89c8f9babcff61db1aef834fde505661d93d9e9be5e7470c2c32793e32ff0b","observation_id":"8944dc9b-0f06-49f7-a294-30dd72342275","resolution":{"observed_at":"2026-08-09T14:27:33.711547Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2502.01809","last_updated":"2025-02-03T20:40:33Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-17T23:25:47.571823Z","submitted_at":"2025-02-03T20:40:33Z","title":"Self-supervised Subgraph Neural Network With Deep Reinforcement Walk Exploration"},"reference_resolution":{"displayed":34,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":11,"verified_exact":0,"verified_fuzzy":23},"total_outbound_references":34},"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-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 34 of 34 outbound references and 0 inbound Pith citation observations for arXiv:2502.01809."}