{"as_of":"2026-08-14T23:31:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a7a51ce3c49f807c750f626a52fe75e6e3a5dae31226e732370967045451dc54","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"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-14T06:32:32.682623+00:00","state":"measured"},{"denominator":34,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":34,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T18:47:53.145704Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-07-04T00:09:14.386849Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1810.05997","last_updated":"2022-04-05T11:39:26Z","snapshot_observed_at":"2026-08-14T18:15:03.106171Z","submitted_at":"2018-10-14T08:36:54Z","title":"Predict then Propagate: Graph Neural Networks meet Personalized PageRank","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1810.05997","snapshot_observed_at":"2026-08-12T18:47:53.145704Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2411.11304","last_updated":"2025-08-06T16:14:04Z","snapshot_observed_at":"2026-08-13T09:21:12.741719Z","submitted_at":"2024-11-18T05:59:29Z","title":"Personalized One-shot Federated Graph Learning for Heterogeneous Clients","version":7},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-12T18:47:53.145704Z"},"links":{"cited_paper":"/paper/1810.05997","citing_paper":"/paper/2411.11304"},"observation_digest":"sha256:5f65c919f47306e0f50c57276b84d7f9ec594e50ae2e4e7ad5b19a1cfaedbaca","observation_id":"1e9f9c74-af81-42d9-8c13-7ef1e9f51604","resolution":{"observed_at":"2026-08-12T18:47:53.145704Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1810.05997","last_updated":"2022-04-05T11:39:26Z","snapshot_observed_at":"2026-08-14T18:15:03.106171Z","submitted_at":"2018-10-14T08:36:54Z","title":"Predict then Propagate: Graph Neural Networks meet Personalized PageRank","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1810.05997","snapshot_observed_at":"2026-08-12T18:37:07.224372Z","title":"Predict then propagate: Graph neural networks meet personalized pagerank,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2411.11448","last_updated":"2024-11-18T10:30:34Z","snapshot_observed_at":"2026-08-12T18:28:25.943500Z","submitted_at":"2024-11-18T10:30:34Z","title":"Unveiling the Inflexibility of Adaptive Embedding in Traffic Forecasting","version":1},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-08-12T18:37:07.224372Z"},"links":{"cited_paper":"/paper/1810.05997","citing_paper":"/paper/2411.11448"},"observation_digest":"sha256:1a066aec38270505ce98ec3dc9414788bfad462f3c3302c67c466be1f1deea3f","observation_id":"c6a0e28f-86c4-4b8e-9133-be0ceb02dc83","resolution":{"observed_at":"2026-08-12T18:37:07.224372Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1810.05997","last_updated":"2022-04-05T11:39:26Z","snapshot_observed_at":"2026-08-14T18:15:03.106171Z","submitted_at":"2018-10-14T08:36:54Z","title":"Predict then Propagate: Graph Neural Networks meet Personalized PageRank","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1810.05997","snapshot_observed_at":"2026-08-12T11:48:09.373547Z","title":"Predict then propagate: Graph neural networks meet personal- ized pagerank,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2411.18648","last_updated":"2024-12-31T02:11:04Z","snapshot_observed_at":"2026-08-14T20:51:13.326158Z","submitted_at":"2024-11-26T22:50:53Z","title":"MADE: Graph Backdoor Defense with Masked Unlearning","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-12T11:48:09.373547Z"},"links":{"cited_paper":"/paper/1810.05997","citing_paper":"/paper/2411.18648"},"observation_digest":"sha256:3763cfd251497818bda8a3a1dc48e7ef766551555557784a1e2fc0540b8edee3","observation_id":"cdb881e4-ece8-4679-9f83-30728c9d9aac","resolution":{"observed_at":"2026-08-12T11:48:09.373547Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1810.05997","last_updated":"2022-04-05T11:39:26Z","snapshot_observed_at":"2026-08-14T18:15:03.106171Z","submitted_at":"2018-10-14T08:36:54Z","title":"Predict then Propagate: Graph Neural Networks meet Personalized PageRank","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1810.05997","snapshot_observed_at":"2026-08-12T10:53:21.533963Z","title":"Personalized embedding propagation: Combining neural networks on graphs with personalized pagerank,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2411.18875","last_updated":"2025-01-14T03:46:32Z","snapshot_observed_at":"2026-08-14T10:05:27.110800Z","submitted_at":"2024-11-28T03:00:27Z","title":"Know Your Account: Double Graph Inference-based Account De-anonymization on Ethereum","version":2},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-12T10:53:21.533963Z"},"links":{"cited_paper":"/paper/1810.05997","citing_paper":"/paper/2411.18875"},"observation_digest":"sha256:3c8ec406dfcc40d3d29849601f1ef1069ee1194fd639c745ede5be6c3c562a4d","observation_id":"bbafa31e-e790-414e-821e-86d5a2886953","resolution":{"observed_at":"2026-08-12T10:53:21.533963Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1810.05997","last_updated":"2022-04-05T11:39:26Z","snapshot_observed_at":"2026-08-14T18:15:03.106171Z","submitted_at":"2018-10-14T08:36:54Z","title":"Predict then Propagate: Graph Neural Networks meet Personalized PageRank","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1810.05997","snapshot_observed_at":"2026-08-11T15:45:14.570935Z","title":"Predict then propagate: Graph neural networks meet personalized pagerank","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2412.10789","last_updated":"2024-12-14T10:56:02Z","snapshot_observed_at":"2026-08-13T02:09:39.853069Z","submitted_at":"2024-12-14T10:56:02Z","title":"Scaling Up Graph Propagation Computation on Large Graphs: A Local Chebyshev Approximation Approach","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-11T15:45:14.570935Z"},"links":{"cited_paper":"/paper/1810.05997","citing_paper":"/paper/2412.10789"},"observation_digest":"sha256:d1d4121da101ddd992551346b6dab985f7b199df5d16a265233bf22ad2eec52d","observation_id":"7be7de5a-074c-4e36-97fa-c89d388f6545","resolution":{"observed_at":"2026-08-11T15:45:14.570935Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1810.05997","last_updated":"2022-04-05T11:39:26Z","snapshot_observed_at":"2026-08-14T18:15:03.106171Z","submitted_at":"2018-10-14T08:36:54Z","title":"Predict then Propagate: Graph Neural Networks meet Personalized PageRank","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1810.05997","snapshot_observed_at":"2026-08-11T12:48:48.843823Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2412.13842","last_updated":"2024-12-18T13:36:03Z","snapshot_observed_at":"2026-08-14T10:05:29.598325Z","submitted_at":"2024-12-18T13:36:03Z","title":"Graph Coarsening via Supervised Granular-Ball for Scalable Graph Neural Network Training","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-11T12:48:48.843823Z"},"links":{"cited_paper":"/paper/1810.05997","citing_paper":"/paper/2412.13842"},"observation_digest":"sha256:685fca8840785ce74aa5f011ce425f93f8d214cabb2411bc0062b95240b6ac54","observation_id":"5aa6995e-fd9a-476f-a5da-ebf2c71f4b0d","resolution":{"observed_at":"2026-08-11T12:48:48.843823Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1810.05997","last_updated":"2022-04-05T11:39:26Z","snapshot_observed_at":"2026-08-14T18:15:03.106171Z","submitted_at":"2018-10-14T08:36:54Z","title":"Predict then Propagate: Graph Neural Networks meet Personalized PageRank","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1810.05997","snapshot_observed_at":"2026-08-11T10:38:15.887975Z","title":"Predict then propagate: Graph neural networks meet personalized pagerank","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2412.16435","last_updated":"2025-01-10T19:49:12Z","snapshot_observed_at":"2026-08-14T06:24:14.036865Z","submitted_at":"2024-12-21T01:52:03Z","title":"THeGCN: Temporal Heterophilic Graph Convolutional Network","version":2},"reference_index":2016,"source":"pdf_text","source_observed_at":"2026-08-11T10:38:15.887975Z"},"links":{"cited_paper":"/paper/1810.05997","citing_paper":"/paper/2412.16435"},"observation_digest":"sha256:91d5fc1dda3edb56bfa08437d98880f54b00741dc6fcf4d9b172f107c6913cc9","observation_id":"8a22d087-b40c-414f-ba08-718e31e183c0","resolution":{"observed_at":"2026-08-11T10:38:15.887975Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1810.05997","last_updated":"2022-04-05T11:39:26Z","snapshot_observed_at":"2026-08-14T18:15:03.106171Z","submitted_at":"2018-10-14T08:36:54Z","title":"Predict then Propagate: Graph Neural Networks meet Personalized PageRank","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1810.05997","snapshot_observed_at":"2026-08-10T22:52:59.256874Z","title":"Predict then propagate: Graph neural networks meet personalized pagerank,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2501.00743","last_updated":"2025-01-01T06:19:56Z","snapshot_observed_at":"2026-08-14T11:01:53.279488Z","submitted_at":"2025-01-01T06:19:56Z","title":"AttriReBoost: A Gradient-Free Propagation Optimization Method for Cold Start Mitigation in Attribute Missing Graphs","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-10T22:52:59.256874Z"},"links":{"cited_paper":"/paper/1810.05997","citing_paper":"/paper/2501.00743"},"observation_digest":"sha256:2c005652a0374acde3e84abd6ee834a45d0782fe79de3087158a74f2f5b42d6c","observation_id":"24bb7931-328c-40d8-8bb3-e7a1d330c514","resolution":{"observed_at":"2026-08-10T22:52:59.256874Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1810.05997","last_updated":"2022-04-05T11:39:26Z","snapshot_observed_at":"2026-08-14T18:15:03.106171Z","submitted_at":"2018-10-14T08:36:54Z","title":"Predict then Propagate: Graph Neural Networks meet Personalized PageRank","version":6},"cited_work":{"arxiv_id":"1810.05997","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1810.05997","snapshot_observed_at":"2026-07-04T00:09:14.386849Z","title":"Predict then propa- gate: Graph neural networks meet personalized pagerank","venue":null,"work_id":"5ff976ea-9a28-41a2-899e-3ff7520f7a84","year":2018},"citing_paper":{"arxiv_id":"2501.15461","last_updated":"2026-04-10T08:17:30Z","snapshot_observed_at":"2026-08-14T22:39:15.122427Z","submitted_at":"2025-01-26T09:09:44Z","title":"Mamba-Based Graph Convolutional Networks: Tackling Over-smoothing with Selective State Space","version":4},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-23T04:41:50.959730Z"},"links":{"cited_paper":"/paper/1810.05997","citing_paper":"/paper/2501.15461"},"observation_digest":"sha256:f1b470d91dd2c6806ec3cc6fa0f8b56dcc800694f0ba5ac2f805d6295bb04d7c","observation_id":"28f171e5-659d-4873-9ee5-8b695020aa36","resolution":{"observed_at":"2026-05-23T04:42:33.248844Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1810.05997","last_updated":"2022-04-05T11:39:26Z","snapshot_observed_at":"2026-08-14T18:15:03.106171Z","submitted_at":"2018-10-14T08:36:54Z","title":"Predict then Propagate: Graph Neural Networks meet Personalized PageRank","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1810.05997","snapshot_observed_at":"2026-08-09T19:15:14.573752Z","title":"Predict then propagate: Graph neural networks meet personalized pagerank","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2502.00401","last_updated":"2025-06-04T19:39:52Z","snapshot_observed_at":"2026-08-12T07:54:14.078930Z","submitted_at":"2025-02-01T11:31:01Z","title":"Spectro-Riemannian Graph Neural Networks","version":2},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-09T19:15:14.573752Z"},"links":{"cited_paper":"/paper/1810.05997","citing_paper":"/paper/2502.00401"},"observation_digest":"sha256:97e1f94cbd1328d8690119e989ebc29010e9f5c3122a57e4ba7f475a906416e9","observation_id":"606af63e-79be-41b9-8a0d-4082881f48bc","resolution":{"observed_at":"2026-08-09T19:15:14.573752Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1810.05997","last_updated":"2022-04-05T11:39:26Z","snapshot_observed_at":"2026-08-14T18:15:03.106171Z","submitted_at":"2018-10-14T08:36:54Z","title":"Predict then Propagate: Graph Neural Networks meet Personalized PageRank","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1810.05997","snapshot_observed_at":"2026-08-08T16:13:44.644163Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2502.06280","last_updated":"2025-02-10T09:23:22Z","snapshot_observed_at":"2026-08-09T19:55:15.362244Z","submitted_at":"2025-02-10T09:23:22Z","title":"IceBerg: Debiased Self-Training for Class-Imbalanced Node Classification","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-08T16:13:44.644163Z"},"links":{"cited_paper":"/paper/1810.05997","citing_paper":"/paper/2502.06280"},"observation_digest":"sha256:e351f2f27870e3370e0a9a5d58b341ac054e1f52c4b42900dd5aa42671dad223","observation_id":"e44d8743-bc71-4b90-bb69-8f315d63285b","resolution":{"observed_at":"2026-08-08T16:13:44.644163Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1810.05997","last_updated":"2022-04-05T11:39:26Z","snapshot_observed_at":"2026-08-14T18:15:03.106171Z","submitted_at":"2018-10-14T08:36:54Z","title":"Predict then Propagate: Graph Neural Networks meet Personalized PageRank","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1810.05997","snapshot_observed_at":"2026-08-07T19:17:33.120351Z","title":"Predict then propagate: Graph neural networks meet personalized pagerank,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2502.10151","last_updated":"2025-02-14T13:25:29Z","snapshot_observed_at":"2026-08-14T10:05:37.380875Z","submitted_at":"2025-02-14T13:25:29Z","title":"Semantica: Decentralized Search using a LLM-Guided Semantic Tree Overlay","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T19:17:33.120351Z"},"links":{"cited_paper":"/paper/1810.05997","citing_paper":"/paper/2502.10151"},"observation_digest":"sha256:7c240275b28889990769b23b26ebd393d024fea73b4fde72402da7b58cfdcb04","observation_id":"4c13a040-e4f1-4023-a60e-2ab806063d93","resolution":{"observed_at":"2026-08-07T19:17:33.120351Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1810.05997","last_updated":"2022-04-05T11:39:26Z","snapshot_observed_at":"2026-08-14T18:15:03.106171Z","submitted_at":"2018-10-14T08:36:54Z","title":"Predict then Propagate: Graph Neural Networks meet Personalized PageRank","version":6},"cited_work":{"arxiv_id":"1810.05997","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1810.05997","snapshot_observed_at":"2026-07-04T00:09:14.386849Z","title":"Predict then propa- gate: Graph neural networks meet personalized pagerank","venue":null,"work_id":"5ff976ea-9a28-41a2-899e-3ff7520f7a84","year":2018},"citing_paper":{"arxiv_id":"2505.23875","last_updated":"2025-05-29T12:59:36Z","snapshot_observed_at":"2026-08-11T02:23:58.701113Z","submitted_at":"2025-05-29T12:59:36Z","title":"A Benchmark Dataset for Graph Regression with Homogeneous and Multi-Relational Variants","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-19T13:10:12.353451Z"},"links":{"cited_paper":"/paper/1810.05997","citing_paper":"/paper/2505.23875"},"observation_digest":"sha256:cd787b12f12950e97fa0b6d21e0857950b47eefc6f16af2131c03561e7bde128","observation_id":"57abf8ee-1e81-4af8-8797-dd4e32fbcb48","resolution":{"observed_at":"2026-05-19T13:12:18.280097Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1810.05997","last_updated":"2022-04-05T11:39:26Z","snapshot_observed_at":"2026-08-14T18:15:03.106171Z","submitted_at":"2018-10-14T08:36:54Z","title":"Predict then Propagate: Graph Neural Networks meet Personalized PageRank","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1810.05997","snapshot_observed_at":"2026-08-07T10:37:17.393239Z","title":"Predict then propagate: Graph neural networks meet personalized pagerank.arXiv preprint arXiv:1810.05997, 2018","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2506.04765","last_updated":"2025-06-05T08:48:46Z","snapshot_observed_at":"2026-08-09T12:05:43.007122Z","submitted_at":"2025-06-05T08:48:46Z","title":"OpenGT: A Comprehensive Benchmark For Graph Transformers","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T10:37:17.393239Z"},"links":{"cited_paper":"/paper/1810.05997","citing_paper":"/paper/2506.04765"},"observation_digest":"sha256:7e669600303ab06e2b323369695c01fe12f94bb87a45429edb0071db400b57fe","observation_id":"0f6bbdbe-1f00-4782-94a8-86fb168560d8","resolution":{"observed_at":"2026-08-07T10:37:17.393239Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1810.05997","last_updated":"2022-04-05T11:39:26Z","snapshot_observed_at":"2026-08-14T18:15:03.106171Z","submitted_at":"2018-10-14T08:36:54Z","title":"Predict then Propagate: Graph Neural Networks meet Personalized PageRank","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1810.05997","snapshot_observed_at":"2026-08-07T04:33:14.186144Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2506.10347","last_updated":"2025-06-12T04:56:10Z","snapshot_observed_at":"2026-08-14T10:06:31.251360Z","submitted_at":"2025-06-12T04:56:10Z","title":"LightKG: Efficient Knowledge-Aware Recommendations with Simplified GNN Architecture","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T04:33:14.186144Z"},"links":{"cited_paper":"/paper/1810.05997","citing_paper":"/paper/2506.10347"},"observation_digest":"sha256:9ff4dfe04399a8288b5bed2fe772de1cfb61a11da3ae5adce7e940ca07397096","observation_id":"adfc73fe-5dc2-4a59-80aa-cf6930a843f6","resolution":{"observed_at":"2026-08-07T04:33:14.186144Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1810.05997","last_updated":"2022-04-05T11:39:26Z","snapshot_observed_at":"2026-08-14T18:15:03.106171Z","submitted_at":"2018-10-14T08:36:54Z","title":"Predict then Propagate: Graph Neural Networks meet Personalized PageRank","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1810.05997","snapshot_observed_at":"2026-08-07T00:42:11.088355Z","title":"Predict then propagate: Graph neural networks meet personalized pagerank,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2506.13083","last_updated":"2025-06-16T03:59:38Z","snapshot_observed_at":"2026-08-09T18:30:06.013695Z","submitted_at":"2025-06-16T03:59:38Z","title":"Uncertainty-Aware Graph Neural Networks: A Multi-Hop Evidence Fusion Approach","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-07T00:42:11.088355Z"},"links":{"cited_paper":"/paper/1810.05997","citing_paper":"/paper/2506.13083"},"observation_digest":"sha256:c87144932f66d83599128d8e5ca1628888e415d32fe1fb1e199823b09b8f27c3","observation_id":"f39056b9-d891-4e67-a224-c6f614eb73cb","resolution":{"observed_at":"2026-08-07T00:42:11.088355Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1810.05997","last_updated":"2022-04-05T11:39:26Z","snapshot_observed_at":"2026-08-14T18:15:03.106171Z","submitted_at":"2018-10-14T08:36:54Z","title":"Predict then Propagate: Graph Neural Networks meet Personalized PageRank","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1810.05997","snapshot_observed_at":"2026-08-06T20:16:09.322992Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2507.03560","last_updated":"2025-07-16T07:00:43Z","snapshot_observed_at":"2026-08-14T10:05:34.804868Z","submitted_at":"2025-07-04T13:12:09Z","title":"Simplifying Graph Kernels for Efficient","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-06T20:16:09.322992Z"},"links":{"cited_paper":"/paper/1810.05997","citing_paper":"/paper/2507.03560"},"observation_digest":"sha256:3f67ccfc652c39ce4f963e0baaba9f65e4f7a52801292c13a7d4128086c1a8ae","observation_id":"182f9110-4ee9-4ab4-aad6-762b0376a255","resolution":{"observed_at":"2026-08-06T20:16:09.322992Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1810.05997","last_updated":"2022-04-05T11:39:26Z","snapshot_observed_at":"2026-08-14T18:15:03.106171Z","submitted_at":"2018-10-14T08:36:54Z","title":"Predict then Propagate: Graph Neural Networks meet Personalized PageRank","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1810.05997","snapshot_observed_at":"2026-08-06T16:22:59.307341Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2507.13825","last_updated":"2025-07-18T11:29:15Z","snapshot_observed_at":"2026-08-14T01:43:19.649131Z","submitted_at":"2025-07-18T11:29:15Z","title":"When Speed meets Accuracy: an Efficient and Effective Graph Model for Temporal Link Prediction","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-06T16:22:59.307341Z"},"links":{"cited_paper":"/paper/1810.05997","citing_paper":"/paper/2507.13825"},"observation_digest":"sha256:6026d6bb1bad867860de1abe15987d7ae52beacc03b4fde39a89bbb34b2310d1","observation_id":"f483cdbc-f97e-4143-9f78-173b0ac1cf8b","resolution":{"observed_at":"2026-08-06T16:22:59.307341Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1810.05997","last_updated":"2022-04-05T11:39:26Z","snapshot_observed_at":"2026-08-14T18:15:03.106171Z","submitted_at":"2018-10-14T08:36:54Z","title":"Predict then Propagate: Graph Neural Networks meet Personalized PageRank","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1810.05997","snapshot_observed_at":"2026-08-05T15:28:42.798926Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2508.19907","last_updated":"2025-08-27T14:10:16Z","snapshot_observed_at":"2026-08-12T18:23:16.593024Z","submitted_at":"2025-08-27T14:10:16Z","title":"GegenNet: Spectral Convolutional Neural Networks for Link Sign Prediction in Signed Bipartite Graphs","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-05T15:28:42.798926Z"},"links":{"cited_paper":"/paper/1810.05997","citing_paper":"/paper/2508.19907"},"observation_digest":"sha256:461db974a794edb9c7e37e82067013cc6eeee97557b011be822c5b482eab14fe","observation_id":"3bfafab8-1a20-4474-96a8-37fa9313907f","resolution":{"observed_at":"2026-08-05T15:28:42.798926Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1810.05997","last_updated":"2022-04-05T11:39:26Z","snapshot_observed_at":"2026-08-14T18:15:03.106171Z","submitted_at":"2018-10-14T08:36:54Z","title":"Predict then Propagate: Graph Neural Networks meet Personalized PageRank","version":6},"cited_work":{"arxiv_id":"1810.05997","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1810.05997","snapshot_observed_at":"2026-07-04T00:09:14.386849Z","title":"Predict then propa- gate: Graph neural networks meet personalized pagerank","venue":null,"work_id":"5ff976ea-9a28-41a2-899e-3ff7520f7a84","year":2018},"citing_paper":{"arxiv_id":"2510.12369","last_updated":"2026-05-27T13:44:50Z","snapshot_observed_at":"2026-08-12T20:27:48.702959Z","submitted_at":"2025-10-14T10:36:43Z","title":"A Hierarchical Quantized Tokenization Framework for Task-Adaptive Graph Representation Learning","version":3},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-05-25T07:49:39.057087Z"},"links":{"cited_paper":"/paper/1810.05997","citing_paper":"/paper/2510.12369"},"observation_digest":"sha256:364ed4c8a42fc8afc7186223e5a2a08cdec8d53eb19996b9ac6050cf425f60d2","observation_id":"686990de-1a97-4f0b-927d-662056cdea87","resolution":{"observed_at":"2026-05-25T07:50:28.968689Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1810.05997","last_updated":"2022-04-05T11:39:26Z","snapshot_observed_at":"2026-08-14T18:15:03.106171Z","submitted_at":"2018-10-14T08:36:54Z","title":"Predict then Propagate: Graph Neural Networks meet Personalized PageRank","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1810.05997","snapshot_observed_at":"2026-08-04T10:00:48.099409Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2510.12369","last_updated":"2026-05-27T13:44:50Z","snapshot_observed_at":"2026-08-12T20:27:48.702959Z","submitted_at":"2025-10-14T10:36:43Z","title":"A Hierarchical Quantized Tokenization Framework for Task-Adaptive Graph Representation Learning","version":4},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-04T10:00:48.099409Z"},"links":{"cited_paper":"/paper/1810.05997","citing_paper":"/paper/2510.12369"},"observation_digest":"sha256:4517874e909d43993fa5bf8a1a88d8ca7ce68d3adaf0238e2c8362e67fad260e","observation_id":"98e5b1e2-ce6f-4137-8278-3de8902f1158","resolution":{"observed_at":"2026-08-04T10:00:48.099409Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1810.05997","last_updated":"2022-04-05T11:39:26Z","snapshot_observed_at":"2026-08-14T18:15:03.106171Z","submitted_at":"2018-10-14T08:36:54Z","title":"Predict then Propagate: Graph Neural Networks meet Personalized PageRank","version":6},"cited_work":{"arxiv_id":"1810.05997","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1810.05997","snapshot_observed_at":"2026-07-04T00:09:14.386849Z","title":"Predict then propa- gate: Graph neural networks meet personalized pagerank","venue":null,"work_id":"5ff976ea-9a28-41a2-899e-3ff7520f7a84","year":2018},"citing_paper":{"arxiv_id":"2601.01123","last_updated":"2026-05-17T16:57:28Z","snapshot_observed_at":"2026-08-13T12:47:08.793489Z","submitted_at":"2026-01-03T08:51:38Z","title":"Learning from Historical Activations in Graph Neural Networks","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-05-21T17:14:52.859473Z"},"links":{"cited_paper":"/paper/1810.05997","citing_paper":"/paper/2601.01123"},"observation_digest":"sha256:24a8440c801dbb89e5e8dd45db4a639f8b7f04f702ac49d0293574850f6f2b03","observation_id":"c49e513b-8ace-4e00-8673-db39d883acdd","resolution":{"observed_at":"2026-05-21T17:15:25.362041Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1810.05997","last_updated":"2022-04-05T11:39:26Z","snapshot_observed_at":"2026-08-14T18:15:03.106171Z","submitted_at":"2018-10-14T08:36:54Z","title":"Predict then Propagate: Graph Neural Networks meet Personalized PageRank","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1810.05997","snapshot_observed_at":"2026-08-03T06:35:48.545179Z","title":"Predict then propagate: Graph neural networks meet personalized pagerank","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2601.22943","last_updated":"2026-05-29T12:37:09Z","snapshot_observed_at":"2026-08-14T22:25:09.770662Z","submitted_at":"2026-01-30T13:02:26Z","title":"Scalable Topology-Preserving Graph Coarsening: Concepts and Algorithms","version":2},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-03T06:35:48.545179Z"},"links":{"cited_paper":"/paper/1810.05997","citing_paper":"/paper/2601.22943"},"observation_digest":"sha256:605a61006dac30a7dceafc4fbf777fcca23eb43befae56e05d968d4a676c269a","observation_id":"ed2ee696-4dcd-4ae4-9793-8cafd680d19a","resolution":{"observed_at":"2026-08-03T06:35:48.545179Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1810.05997","last_updated":"2022-04-05T11:39:26Z","snapshot_observed_at":"2026-08-14T18:15:03.106171Z","submitted_at":"2018-10-14T08:36:54Z","title":"Predict then Propagate: Graph Neural Networks meet Personalized PageRank","version":6},"cited_work":{"arxiv_id":"1810.05997","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1810.05997","snapshot_observed_at":"2026-07-04T00:09:14.386849Z","title":"Predict then propa- gate: Graph neural networks meet personalized pagerank","venue":null,"work_id":"5ff976ea-9a28-41a2-899e-3ff7520f7a84","year":2018},"citing_paper":{"arxiv_id":"2604.12329","last_updated":"2026-04-14T06:04:37Z","snapshot_observed_at":"2026-07-06T23:00:32.607699Z","submitted_at":"2026-04-14T06:04:37Z","title":"UniDetect: LLM-Driven Universal Fraud Detection across Heterogeneous Blockchains","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-05-10T16:00:39.657115Z"},"links":{"cited_paper":"/paper/1810.05997","citing_paper":"/paper/2604.12329"},"observation_digest":"sha256:86ac1793656a3532f103bf5bf14fe071d4d450ac5db9f5d27928870f7566ebec","observation_id":"acf77921-77da-4223-9d6a-d8d59b8ea80d","resolution":{"observed_at":"2026-05-11T09:26:03.339937Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1810.05997","last_updated":"2022-04-05T11:39:26Z","snapshot_observed_at":"2026-08-14T18:15:03.106171Z","submitted_at":"2018-10-14T08:36:54Z","title":"Predict then Propagate: Graph Neural Networks meet Personalized PageRank","version":6},"cited_work":{"arxiv_id":"1810.05997","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1810.05997","snapshot_observed_at":"2026-07-04T00:09:14.386849Z","title":"Predict then propa- gate: Graph neural networks meet personalized pagerank","venue":null,"work_id":"5ff976ea-9a28-41a2-899e-3ff7520f7a84","year":2018},"citing_paper":{"arxiv_id":"2604.20283","last_updated":"2026-04-22T07:30:16Z","snapshot_observed_at":"2026-08-12T22:17:17.153605Z","submitted_at":"2026-04-22T07:30:16Z","title":"Multi-Perspective Evidence Synthesis and Reasoning for Unsupervised Multimodal Entity Linking","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-05-10T00:34:00.258761Z"},"links":{"cited_paper":"/paper/1810.05997","citing_paper":"/paper/2604.20283"},"observation_digest":"sha256:7e666c774ba0ff8611a5945e6df6cd6cd48b22a6f5d02b27e4b09ab3cbbe4dcb","observation_id":"93484e19-a855-43c2-9138-38d57880b05a","resolution":{"observed_at":"2026-05-10T00:34:47.678192Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1810.05997","last_updated":"2022-04-05T11:39:26Z","snapshot_observed_at":"2026-08-14T18:15:03.106171Z","submitted_at":"2018-10-14T08:36:54Z","title":"Predict then Propagate: Graph Neural Networks meet Personalized PageRank","version":6},"cited_work":{"arxiv_id":"1810.05997","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1810.05997","snapshot_observed_at":"2026-07-04T00:09:14.386849Z","title":"Predict then propa- gate: Graph neural networks meet personalized pagerank","venue":null,"work_id":"5ff976ea-9a28-41a2-899e-3ff7520f7a84","year":2018},"citing_paper":{"arxiv_id":"2605.08679","last_updated":"2026-05-09T04:33:14Z","snapshot_observed_at":"2026-08-02T13:27:25.888990Z","submitted_at":"2026-05-09T04:33:14Z","title":"Attention-based graph neural networks: a survey","version":1},"reference_index":117,"source":"arxiv_source","source_observed_at":"2026-05-12T01:07:43.805485Z"},"links":{"cited_paper":"/paper/1810.05997","citing_paper":"/paper/2605.08679"},"observation_digest":"sha256:fcc948e5a1342257aab2b44ca283bcdd23f33f8e42010afad4a3990a99cae274","observation_id":"cc069e7b-5799-4323-b50b-25ce11dabdb3","resolution":{"observed_at":"2026-05-12T08:26:24.937256Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1810.05997","last_updated":"2022-04-05T11:39:26Z","snapshot_observed_at":"2026-08-14T18:15:03.106171Z","submitted_at":"2018-10-14T08:36:54Z","title":"Predict then Propagate: Graph Neural Networks meet Personalized PageRank","version":6},"cited_work":{"arxiv_id":"1810.05997","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1810.05997","snapshot_observed_at":"2026-07-04T00:09:14.386849Z","title":"Predict then propa- gate: Graph neural networks meet personalized pagerank","venue":null,"work_id":"5ff976ea-9a28-41a2-899e-3ff7520f7a84","year":2018},"citing_paper":{"arxiv_id":"2605.21247","last_updated":"2026-05-31T15:52:48Z","snapshot_observed_at":"2026-08-13T00:11:42.951853Z","submitted_at":"2026-05-20T14:36:52Z","title":"Graph Navier Stokes Networks","version":3},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-06-30T17:11:15.801586Z"},"links":{"cited_paper":"/paper/1810.05997","citing_paper":"/paper/2605.21247"},"observation_digest":"sha256:b15c924b45d81b8717a26c1255385c0a2dc288d11a4945e14fa4c010e376cf74","observation_id":"34db17f6-d829-4d82-98fb-3b53e5073523","resolution":{"observed_at":"2026-06-30T17:14:56.828115Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1810.05997","last_updated":"2022-04-05T11:39:26Z","snapshot_observed_at":"2026-08-14T18:15:03.106171Z","submitted_at":"2018-10-14T08:36:54Z","title":"Predict then Propagate: Graph Neural Networks meet Personalized PageRank","version":6},"cited_work":{"arxiv_id":"1810.05997","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1810.05997","snapshot_observed_at":"2026-07-04T00:09:14.386849Z","title":"Predict then propa- gate: Graph neural networks meet personalized pagerank","venue":null,"work_id":"5ff976ea-9a28-41a2-899e-3ff7520f7a84","year":2018},"citing_paper":{"arxiv_id":"2605.31016","last_updated":"2026-05-29T08:49:17Z","snapshot_observed_at":"2026-08-09T11:30:45.633308Z","submitted_at":"2026-05-29T08:49:17Z","title":"An Efficient and Scalable Graph Condensation with Structure-Preserving","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-06-29T00:03:13.278727Z"},"links":{"cited_paper":"/paper/1810.05997","citing_paper":"/paper/2605.31016"},"observation_digest":"sha256:c80726e2d6fa26edc72411a7ad01cbf96c261920de29b3176bb1c5e4914df1a3","observation_id":"889ec963-7ce0-48b8-9381-e1c59f8c63d8","resolution":{"observed_at":"2026-06-29T00:12:50.265265Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1810.05997","last_updated":"2022-04-05T11:39:26Z","snapshot_observed_at":"2026-08-14T18:15:03.106171Z","submitted_at":"2018-10-14T08:36:54Z","title":"Predict then Propagate: Graph Neural Networks meet Personalized PageRank","version":6},"cited_work":{"arxiv_id":"1810.05997","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1810.05997","snapshot_observed_at":"2026-07-04T00:09:14.386849Z","title":"Predict then propa- gate: Graph neural networks meet personalized pagerank","venue":null,"work_id":"5ff976ea-9a28-41a2-899e-3ff7520f7a84","year":2018},"citing_paper":{"arxiv_id":"2606.07538","last_updated":"2026-04-29T14:07:19Z","snapshot_observed_at":"2026-07-06T23:47:10.030985Z","submitted_at":"2026-04-29T14:07:19Z","title":"Bidirectional Semantic Complementary Tool Retrieval for Remote Sensing Agents","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-07-01T08:40:29.728679Z"},"links":{"cited_paper":"/paper/1810.05997","citing_paper":"/paper/2606.07538"},"observation_digest":"sha256:1b13badb3b1f1bfda761c9d5538be87f750ba9bf80b4e14c46c2a01bfcdff695","observation_id":"5c23a937-6200-48de-9f1a-d965d52c2968","resolution":{"observed_at":"2026-07-01T08:45:34.958798Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1810.05997","last_updated":"2022-04-05T11:39:26Z","snapshot_observed_at":"2026-08-14T18:15:03.106171Z","submitted_at":"2018-10-14T08:36:54Z","title":"Predict then Propagate: Graph Neural Networks meet Personalized PageRank","version":6},"cited_work":{"arxiv_id":"1810.05997","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1810.05997","snapshot_observed_at":"2026-07-04T00:09:14.386849Z","title":"Predict then propa- gate: Graph neural networks meet personalized pagerank","venue":null,"work_id":"5ff976ea-9a28-41a2-899e-3ff7520f7a84","year":2018},"citing_paper":{"arxiv_id":"2606.09051","last_updated":"2026-06-08T05:40:19Z","snapshot_observed_at":"2026-08-13T15:41:57.216431Z","submitted_at":"2026-06-08T05:40:19Z","title":"Beyond Convolution: Advancing Hypergraph Neural Networks with Hypergraph U-Nets","version":1},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-06-27T17:21:28.096446Z"},"links":{"cited_paper":"/paper/1810.05997","citing_paper":"/paper/2606.09051"},"observation_digest":"sha256:5701eb7fdcd8388158a55f1ae97c7dd23e3c3c7b9659f233cac320f38145cfea","observation_id":"beb59dc6-d0a8-467f-abc0-37578537463b","resolution":{"observed_at":"2026-07-03T00:17:29.148134Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1810.05997","last_updated":"2022-04-05T11:39:26Z","snapshot_observed_at":"2026-08-14T18:15:03.106171Z","submitted_at":"2018-10-14T08:36:54Z","title":"Predict then Propagate: Graph Neural Networks meet Personalized PageRank","version":6},"cited_work":{"arxiv_id":"1810.05997","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1810.05997","snapshot_observed_at":"2026-07-04T00:09:14.386849Z","title":"Predict then propa- gate: Graph neural networks meet personalized pagerank","venue":null,"work_id":"5ff976ea-9a28-41a2-899e-3ff7520f7a84","year":2018},"citing_paper":{"arxiv_id":"2606.11583","last_updated":"2026-06-10T02:15:56Z","snapshot_observed_at":"2026-07-06T23:50:39.386691Z","submitted_at":"2026-06-10T02:15:56Z","title":"Beyond the Golden Teacher: Enhancing Graph Learning through LLM-GNN Co-teaching","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-06-27T10:33:02.954683Z"},"links":{"cited_paper":"/paper/1810.05997","citing_paper":"/paper/2606.11583"},"observation_digest":"sha256:b87f3a4a903f0ca039cda1990daf54542199860092f8316d681c433959a5b017","observation_id":"726a6ac9-64a8-4be2-be16-3ca003ae37be","resolution":{"observed_at":"2026-07-03T09:07:47.659196Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1810.05997","last_updated":"2022-04-05T11:39:26Z","snapshot_observed_at":"2026-08-14T18:15:03.106171Z","submitted_at":"2018-10-14T08:36:54Z","title":"Predict then Propagate: Graph Neural Networks meet Personalized PageRank","version":6},"cited_work":{"arxiv_id":"1810.05997","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1810.05997","snapshot_observed_at":"2026-07-04T00:09:14.386849Z","title":"Predict then propa- gate: Graph neural networks meet personalized pagerank","venue":null,"work_id":"5ff976ea-9a28-41a2-899e-3ff7520f7a84","year":2018},"citing_paper":{"arxiv_id":"2606.19185","last_updated":"2026-06-17T15:24:37Z","snapshot_observed_at":"2026-08-08T05:43:23.884916Z","submitted_at":"2026-06-17T15:24:37Z","title":"AGDN: Learning to Solve Traveling Salesman Problem with Anisotropic Graph Diffusion Network","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-06-26T21:29:20.129182Z"},"links":{"cited_paper":"/paper/1810.05997","citing_paper":"/paper/2606.19185"},"observation_digest":"sha256:812b89fa9299ec9e31a7a6fbfb656c75c116cb9c42575f1f3fbf05eb716b8447","observation_id":"a9fa032d-3220-4e1a-93b6-1b9889f696ac","resolution":{"observed_at":"2026-07-04T00:09:14.390111Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1810.05997","last_updated":"2022-04-05T11:39:26Z","snapshot_observed_at":"2026-08-14T18:15:03.106171Z","submitted_at":"2018-10-14T08:36:54Z","title":"Predict then Propagate: Graph Neural Networks meet Personalized PageRank","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1810.05997","snapshot_observed_at":"2026-08-02T03:40:58.569203Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.13837","last_updated":"2026-07-15T13:45:26Z","snapshot_observed_at":"2026-08-10T13:03:21.402074Z","submitted_at":"2026-07-15T13:45:26Z","title":"NodeImport: Imbalanced Node Classification with Node Importance Assessment","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-02T03:40:58.569203Z"},"links":{"cited_paper":"/paper/1810.05997","citing_paper":"/paper/2607.13837"},"observation_digest":"sha256:3cdbf5ae146904fea6758bed04d4206e4adacfc1e853b799747caf452598dcfd","observation_id":"e0f7bc80-3a83-4666-bf5d-4236b42530f8","resolution":{"observed_at":"2026-08-02T03:40:58.569203Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1810.05997","last_updated":"2022-04-05T11:39:26Z","snapshot_observed_at":"2026-08-14T18:15:03.106171Z","submitted_at":"2018-10-14T08:36:54Z","title":"Predict then Propagate: Graph Neural Networks meet Personalized PageRank","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1810.05997","snapshot_observed_at":"2026-08-08T04:18:57.940487Z","title":"InProceedings of the 33rd AAAI conferenceonartificialintelligence(AAAI2019),volume33, 3558–3565","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2608.03006","last_updated":"2026-08-04T01:41:01Z","snapshot_observed_at":"2026-08-14T10:05:37.968701Z","submitted_at":"2026-08-04T01:41:01Z","title":"ProPRL: Property-Aware Prerequisite Relation Learning in Educational Knowledge Graphs","version":1},"reference_index":2019,"source":"pdf_text","source_observed_at":"2026-08-08T04:18:57.940487Z"},"links":{"cited_paper":"/paper/1810.05997","citing_paper":"/paper/2608.03006"},"observation_digest":"sha256:39d9ba2b9964063c63a89c45c98294472427a916e2381e76047d3f65a7cb2b22","observation_id":"5712a9bc-a0ab-4e3f-9dfa-5da4ab16c695","resolution":{"observed_at":"2026-08-08T04:18:57.940487Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/1810.05997/citation-record","integrity":"/paper/1810.05997/integrity","json":"/paper/1810.05997/citation-record.json","paper":"/paper/1810.05997"},"outbound":[],"paper":{"arxiv_id":"1810.05997","last_updated":"2022-04-05T11:39:26Z","latest_version":6,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-14T18:15:03.106171Z","submitted_at":"2018-10-14T08:36:54Z","title":"Predict then Propagate: Graph Neural Networks meet Personalized PageRank"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"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-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"thesis":"As of 14 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 34 inbound Pith citation observations for arXiv:1810.05997."}