{"as_of":"2026-08-08T18:42:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:998d0f454d05b18c61dd19cc7c7385a2272e9723ea0f15abe01ebc50a7896437","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":21,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":21,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":21,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":21,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T05:53:47.615563Z","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-03T00:17:29.135309Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2006.07988","last_updated":"2021-10-26T20:07:59Z","snapshot_observed_at":"2026-07-06T09:28:59.431672Z","submitted_at":"2020-06-14T19:27:39Z","title":"Adaptive Universal Generalized PageRank Graph Neural Network","version":6},"cited_work":{"arxiv_id":"2006.07988","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2006.07988","snapshot_observed_at":"2026-07-03T00:17:29.135309Z","title":"Adaptive universal generalized pagerank graph neural network","venue":null,"work_id":"efc6c2d7-b6dc-40ab-9611-8af721fe02f0","year":2006},"citing_paper":{"arxiv_id":"2501.15461","last_updated":"2026-04-10T08:17:30Z","snapshot_observed_at":"2026-07-06T20:26:17.112340Z","submitted_at":"2025-01-26T09:09:44Z","title":"Mamba-Based Graph Convolutional Networks: Tackling Over-smoothing with Selective State Space","version":4},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-23T04:41:50.959730Z"},"links":{"cited_paper":"/paper/2006.07988","citing_paper":"/paper/2501.15461"},"observation_digest":"sha256:da4ffdaa0d9976708eacb0c943f0166bcac6dd81da55b863eded9183a9708730","observation_id":"2d1f61ad-4456-4465-93d8-d70f112cb40f","resolution":{"observed_at":"2026-05-23T04:42:33.273744Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2006.07988","last_updated":"2021-10-26T20:07:59Z","snapshot_observed_at":"2026-07-06T09:28:59.431672Z","submitted_at":"2020-06-14T19:27:39Z","title":"Adaptive Universal Generalized PageRank Graph Neural Network","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2006.07988","snapshot_observed_at":"2026-08-07T05:53:47.615563Z","title":"arXiv preprint arXiv:2006.07988 (2020)","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2506.06809","last_updated":"2025-06-07T14:17:30Z","snapshot_observed_at":"2026-08-07T05:46:38.695991Z","submitted_at":"2025-06-07T14:17:30Z","title":"IMPA-HGAE:Intra-Meta-Path Augmented Heterogeneous Graph Autoencoder","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T05:53:47.615563Z"},"links":{"cited_paper":"/paper/2006.07988","citing_paper":"/paper/2506.06809"},"observation_digest":"sha256:80154ac91b4a82f40c51fd57e4932f6462b0b6256478cef9d7f2865da0b1a1fa","observation_id":"a8777c70-061c-42a8-8b4f-6e8abd1d50b5","resolution":{"observed_at":"2026-08-07T05:53:47.615563Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2006.07988","last_updated":"2021-10-26T20:07:59Z","snapshot_observed_at":"2026-07-06T09:28:59.431672Z","submitted_at":"2020-06-14T19:27:39Z","title":"Adaptive Universal Generalized PageRank Graph Neural Network","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2006.07988","snapshot_observed_at":"2026-08-06T15:42:33.676091Z","title":"Adaptive universal generalized pagerank graph neural network","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2507.15253","last_updated":"2025-07-21T05:29:53Z","snapshot_observed_at":"2026-08-06T15:34:09.889484Z","submitted_at":"2025-07-21T05:29:53Z","title":"Disentangling Homophily and Heterophily in Multimodal Graph Clustering","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-06T15:42:33.676091Z"},"links":{"cited_paper":"/paper/2006.07988","citing_paper":"/paper/2507.15253"},"observation_digest":"sha256:2d0c89ea52d526b81215378e6c41c0964a3943c1b8bd3752ecfa5ed289de9589","observation_id":"7c94806d-ddac-400e-8d69-598c2019c4e9","resolution":{"observed_at":"2026-08-06T15:42:33.676091Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2006.07988","last_updated":"2021-10-26T20:07:59Z","snapshot_observed_at":"2026-07-06T09:28:59.431672Z","submitted_at":"2020-06-14T19:27:39Z","title":"Adaptive Universal Generalized PageRank Graph Neural Network","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2006.07988","snapshot_observed_at":"2026-08-06T10:13:22.148189Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2508.00429","last_updated":"2026-07-21T03:39:21Z","snapshot_observed_at":"2026-08-07T16:26:02.368347Z","submitted_at":"2025-08-01T08:37:54Z","title":"Node-as-Agent: Graph Agentic Network","version":5},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-06T10:13:22.148189Z"},"links":{"cited_paper":"/paper/2006.07988","citing_paper":"/paper/2508.00429"},"observation_digest":"sha256:9857f57eda155a2f333430d8d05d2a8a2c4168f37ebadebc386d395328b98a0b","observation_id":"c0e6e0ca-c38f-4ce8-9271-597337f5784a","resolution":{"observed_at":"2026-08-06T10:13:22.148189Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2006.07988","last_updated":"2021-10-26T20:07:59Z","snapshot_observed_at":"2026-07-06T09:28:59.431672Z","submitted_at":"2020-06-14T19:27:39Z","title":"Adaptive Universal Generalized PageRank Graph Neural Network","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2006.07988","snapshot_observed_at":"2026-08-05T13:19:10.015533Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2509.00772","last_updated":"2025-08-31T10:03:15Z","snapshot_observed_at":"2026-08-07T06:27:59.198185Z","submitted_at":"2025-08-31T10:03:15Z","title":"Flow Matters: Directional and Expressive GNNs for Heterophilic Graphs","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-05T13:19:10.015533Z"},"links":{"cited_paper":"/paper/2006.07988","citing_paper":"/paper/2509.00772"},"observation_digest":"sha256:65a4bbd5107767c1f39669a140d9747504e74b1f61efcb058cf1b5fd4552e1ab","observation_id":"f8d9307d-4fbb-4ac0-a4dd-20bc686b3987","resolution":{"observed_at":"2026-08-05T13:19:10.015533Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2006.07988","last_updated":"2021-10-26T20:07:59Z","snapshot_observed_at":"2026-07-06T09:28:59.431672Z","submitted_at":"2020-06-14T19:27:39Z","title":"Adaptive Universal Generalized PageRank Graph Neural Network","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2006.07988","snapshot_observed_at":"2026-08-05T12:54:37.399149Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2509.01170","last_updated":"2025-09-01T06:42:19Z","snapshot_observed_at":"2026-08-07T21:13:17.842116Z","submitted_at":"2025-09-01T06:42:19Z","title":"ADMP-GNN: Adaptive Depth Message Passing GNN","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-05T12:54:37.399149Z"},"links":{"cited_paper":"/paper/2006.07988","citing_paper":"/paper/2509.01170"},"observation_digest":"sha256:12e76d21eb11261f3092aa73120646528444913b43daa29bccc8e829ccde111e","observation_id":"c9532d7f-2b8e-4183-af53-5ceea8fe8c94","resolution":{"observed_at":"2026-08-05T12:54:37.399149Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2006.07988","last_updated":"2021-10-26T20:07:59Z","snapshot_observed_at":"2026-07-06T09:28:59.431672Z","submitted_at":"2020-06-14T19:27:39Z","title":"Adaptive Universal Generalized PageRank Graph Neural Network","version":6},"cited_work":{"arxiv_id":"2006.07988","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2006.07988","snapshot_observed_at":"2026-07-03T00:17:29.135309Z","title":"Adaptive universal generalized pagerank graph neural network","venue":null,"work_id":"efc6c2d7-b6dc-40ab-9611-8af721fe02f0","year":2006},"citing_paper":{"arxiv_id":"2510.12369","last_updated":"2026-05-27T13:44:50Z","snapshot_observed_at":"2026-08-04T10:00:45.966173Z","submitted_at":"2025-10-14T10:36:43Z","title":"A Hierarchical Quantized Tokenization Framework for Task-Adaptive Graph Representation Learning","version":3},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-05-25T07:49:39.057087Z"},"links":{"cited_paper":"/paper/2006.07988","citing_paper":"/paper/2510.12369"},"observation_digest":"sha256:8cbe344eddaee77029830c0ab57fe5fac4e1e9dddf993733ab89927925b0d49c","observation_id":"ae3c043b-00bb-49b7-a0d3-c946d3d0114e","resolution":{"observed_at":"2026-05-25T07:50:29.016399Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2006.07988","last_updated":"2021-10-26T20:07:59Z","snapshot_observed_at":"2026-07-06T09:28:59.431672Z","submitted_at":"2020-06-14T19:27:39Z","title":"Adaptive Universal Generalized PageRank Graph Neural Network","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2006.07988","snapshot_observed_at":"2026-08-04T10:00:47.510092Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2510.12369","last_updated":"2026-05-27T13:44:50Z","snapshot_observed_at":"2026-08-04T10:00:45.966173Z","submitted_at":"2025-10-14T10:36:43Z","title":"A Hierarchical Quantized Tokenization Framework for Task-Adaptive Graph Representation Learning","version":4},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-04T10:00:47.510092Z"},"links":{"cited_paper":"/paper/2006.07988","citing_paper":"/paper/2510.12369"},"observation_digest":"sha256:4a49348de5277508fb4b4fb16aa716071f84dfb67e3b086ed7f7918e608ace77","observation_id":"2ac2562d-e366-4432-82b8-212c7ccc8087","resolution":{"observed_at":"2026-08-04T10:00:47.510092Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2006.07988","last_updated":"2021-10-26T20:07:59Z","snapshot_observed_at":"2026-07-06T09:28:59.431672Z","submitted_at":"2020-06-14T19:27:39Z","title":"Adaptive Universal Generalized PageRank Graph Neural Network","version":6},"cited_work":{"arxiv_id":"2006.07988","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2006.07988","snapshot_observed_at":"2026-07-03T00:17:29.135309Z","title":"Adaptive universal generalized pagerank graph neural network","venue":null,"work_id":"efc6c2d7-b6dc-40ab-9611-8af721fe02f0","year":2006},"citing_paper":{"arxiv_id":"2511.06443","last_updated":"2025-11-09T16:25:37Z","snapshot_observed_at":"2026-08-01T02:52:13.483898Z","submitted_at":"2025-11-09T16:25:37Z","title":"How Wide and How Deep? Mitigating Over-Squashing of GNNs via Channel Capacity Constrained Estimation","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-05-17T23:23:07.672908Z"},"links":{"cited_paper":"/paper/2006.07988","citing_paper":"/paper/2511.06443"},"observation_digest":"sha256:4990267c28e51e141a8469f44f888a124d94d26dcbe34c693d1aa6a7bb46203b","observation_id":"6d2d8520-5de2-4b95-bf7b-14e250b0dfc6","resolution":{"observed_at":"2026-05-17T23:25:28.593943Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2006.07988","last_updated":"2021-10-26T20:07:59Z","snapshot_observed_at":"2026-07-06T09:28:59.431672Z","submitted_at":"2020-06-14T19:27:39Z","title":"Adaptive Universal Generalized PageRank Graph Neural Network","version":6},"cited_work":{"arxiv_id":"2006.07988","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2006.07988","snapshot_observed_at":"2026-07-03T00:17:29.135309Z","title":"Adaptive universal generalized pagerank graph neural network","venue":null,"work_id":"efc6c2d7-b6dc-40ab-9611-8af721fe02f0","year":2006},"citing_paper":{"arxiv_id":"2601.01123","last_updated":"2026-05-17T16:57:28Z","snapshot_observed_at":"2026-08-06T06:45:06.116751Z","submitted_at":"2026-01-03T08:51:38Z","title":"Learning from Historical Activations in Graph Neural Networks","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-21T17:14:52.859473Z"},"links":{"cited_paper":"/paper/2006.07988","citing_paper":"/paper/2601.01123"},"observation_digest":"sha256:bc8ad3ce9aae65b38ff768b8f7bea0f804ac07f2e05bdf1642f03087a40d0ee8","observation_id":"f60a4df4-a28d-4e56-9459-14f9bd8f2747","resolution":{"observed_at":"2026-05-21T17:15:25.414242Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2006.07988","last_updated":"2021-10-26T20:07:59Z","snapshot_observed_at":"2026-07-06T09:28:59.431672Z","submitted_at":"2020-06-14T19:27:39Z","title":"Adaptive Universal Generalized PageRank Graph Neural Network","version":6},"cited_work":{"arxiv_id":"2006.07988","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2006.07988","snapshot_observed_at":"2026-07-03T00:17:29.135309Z","title":"Adaptive universal generalized pagerank graph neural network","venue":null,"work_id":"efc6c2d7-b6dc-40ab-9611-8af721fe02f0","year":2006},"citing_paper":{"arxiv_id":"2604.19186","last_updated":"2026-04-21T07:55:19Z","snapshot_observed_at":"2026-07-06T23:05:53.378585Z","submitted_at":"2026-04-21T07:55:19Z","title":"Inductive Subgraphs as Shortcuts: Causal Disentanglement for Heterophilic Graph Learning","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-10T02:54:22.394142Z"},"links":{"cited_paper":"/paper/2006.07988","citing_paper":"/paper/2604.19186"},"observation_digest":"sha256:63a0bbf053d79263180d6f0fac60f8da66cfbb0986d7d12f04041d4f7e915297","observation_id":"9e695c38-fbee-4d24-8f0b-7021ebb29bcc","resolution":{"observed_at":"2026-05-11T12:51:02.715741Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2006.07988","last_updated":"2021-10-26T20:07:59Z","snapshot_observed_at":"2026-07-06T09:28:59.431672Z","submitted_at":"2020-06-14T19:27:39Z","title":"Adaptive Universal Generalized PageRank Graph Neural Network","version":6},"cited_work":{"arxiv_id":"2006.07988","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2006.07988","snapshot_observed_at":"2026-07-03T00:17:29.135309Z","title":"Adaptive universal generalized pagerank graph neural network","venue":null,"work_id":"efc6c2d7-b6dc-40ab-9611-8af721fe02f0","year":2006},"citing_paper":{"arxiv_id":"2605.16809","last_updated":"2026-05-16T04:46:59Z","snapshot_observed_at":"2026-07-31T11:39:01.490551Z","submitted_at":"2026-05-16T04:46:59Z","title":"Informative Graph Structure Learning","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-05-19T21:08:51.920408Z"},"links":{"cited_paper":"/paper/2006.07988","citing_paper":"/paper/2605.16809"},"observation_digest":"sha256:01624751d5187f6ddd6a3185544d8b15e5d316f4510c6d56854f5923e1468e23","observation_id":"fae7d696-3957-41bd-a04a-8cb210a9c9ed","resolution":{"observed_at":"2026-05-19T21:12:47.208475Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2006.07988","last_updated":"2021-10-26T20:07:59Z","snapshot_observed_at":"2026-07-06T09:28:59.431672Z","submitted_at":"2020-06-14T19:27:39Z","title":"Adaptive Universal Generalized PageRank Graph Neural Network","version":6},"cited_work":{"arxiv_id":"2006.07988","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2006.07988","snapshot_observed_at":"2026-07-03T00:17:29.135309Z","title":"Adaptive universal generalized pagerank graph neural network","venue":null,"work_id":"efc6c2d7-b6dc-40ab-9611-8af721fe02f0","year":2006},"citing_paper":{"arxiv_id":"2605.20248","last_updated":"2026-05-18T06:47:41Z","snapshot_observed_at":"2026-07-06T23:30:53.900592Z","submitted_at":"2026-05-18T06:47:41Z","title":"Graph Transductive Sharpening: Leveraging Unlabeled Predictions in Node Classification","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-21T08:32:32.410473Z"},"links":{"cited_paper":"/paper/2006.07988","citing_paper":"/paper/2605.20248"},"observation_digest":"sha256:7e4618b8d7f9b75819a5c90dda8db10cb9f61d28686d0a8b803fbda8e07d30d5","observation_id":"e4c82bf4-483b-4150-8c4f-645e454b45c9","resolution":{"observed_at":"2026-05-21T08:34:05.393239Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2006.07988","last_updated":"2021-10-26T20:07:59Z","snapshot_observed_at":"2026-07-06T09:28:59.431672Z","submitted_at":"2020-06-14T19:27:39Z","title":"Adaptive Universal Generalized PageRank Graph Neural Network","version":6},"cited_work":{"arxiv_id":"2006.07988","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2006.07988","snapshot_observed_at":"2026-07-03T00:17:29.135309Z","title":"Adaptive universal generalized pagerank graph neural network","venue":null,"work_id":"efc6c2d7-b6dc-40ab-9611-8af721fe02f0","year":2006},"citing_paper":{"arxiv_id":"2605.21247","last_updated":"2026-05-31T15:52:48Z","snapshot_observed_at":"2026-08-02T05:32:25.292328Z","submitted_at":"2026-05-20T14:36:52Z","title":"Graph Navier Stokes Networks","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-05-21T05:12:39.203165Z"},"links":{"cited_paper":"/paper/2006.07988","citing_paper":"/paper/2605.21247"},"observation_digest":"sha256:f7fcdeb899c98d2a003041d62cf526be24f837d862c7e660aef7006c0c704b35","observation_id":"7b2ca5f3-8573-4a32-afe7-4250f16c8161","resolution":{"observed_at":"2026-05-21T05:13:58.212983Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2006.07988","last_updated":"2021-10-26T20:07:59Z","snapshot_observed_at":"2026-07-06T09:28:59.431672Z","submitted_at":"2020-06-14T19:27:39Z","title":"Adaptive Universal Generalized PageRank Graph Neural Network","version":6},"cited_work":{"arxiv_id":"2006.07988","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2006.07988","snapshot_observed_at":"2026-07-03T00:17:29.135309Z","title":"Adaptive universal generalized pagerank graph neural network","venue":null,"work_id":"efc6c2d7-b6dc-40ab-9611-8af721fe02f0","year":2006},"citing_paper":{"arxiv_id":"2605.21247","last_updated":"2026-05-31T15:52:48Z","snapshot_observed_at":"2026-08-02T05:32:25.292328Z","submitted_at":"2026-05-20T14:36:52Z","title":"Graph Navier Stokes Networks","version":3},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-06-30T17:11:15.801586Z"},"links":{"cited_paper":"/paper/2006.07988","citing_paper":"/paper/2605.21247"},"observation_digest":"sha256:21dcb0fa52fdb80fbcc62f783f28c096a617370788fd78d2ebbc425c58d073b9","observation_id":"4e45d848-2557-4f78-9521-6e00d63c117e","resolution":{"observed_at":"2026-06-30T17:14:56.822590Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2006.07988","last_updated":"2021-10-26T20:07:59Z","snapshot_observed_at":"2026-07-06T09:28:59.431672Z","submitted_at":"2020-06-14T19:27:39Z","title":"Adaptive Universal Generalized PageRank Graph Neural Network","version":6},"cited_work":{"arxiv_id":"2006.07988","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2006.07988","snapshot_observed_at":"2026-07-03T00:17:29.135309Z","title":"Adaptive universal generalized pagerank graph neural network","venue":null,"work_id":"efc6c2d7-b6dc-40ab-9611-8af721fe02f0","year":2006},"citing_paper":{"arxiv_id":"2606.09051","last_updated":"2026-06-08T05:40:19Z","snapshot_observed_at":"2026-07-06T23:48:26.076260Z","submitted_at":"2026-06-08T05:40:19Z","title":"Beyond Convolution: Advancing Hypergraph Neural Networks with Hypergraph U-Nets","version":1},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-06-27T17:21:28.096446Z"},"links":{"cited_paper":"/paper/2006.07988","citing_paper":"/paper/2606.09051"},"observation_digest":"sha256:4edab678a87a80975c0f789d5cffe96d43c046611fc4954630fec9bcd9a13426","observation_id":"f9820178-be05-422a-9f79-121bbc491687","resolution":{"observed_at":"2026-07-03T00:17:29.136960Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2006.07988","last_updated":"2021-10-26T20:07:59Z","snapshot_observed_at":"2026-07-06T09:28:59.431672Z","submitted_at":"2020-06-14T19:27:39Z","title":"Adaptive Universal Generalized PageRank Graph Neural Network","version":6},"cited_work":{"arxiv_id":"2006.07988","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2006.07988","snapshot_observed_at":"2026-07-03T00:17:29.135309Z","title":"Adaptive universal generalized pagerank graph neural network","venue":null,"work_id":"efc6c2d7-b6dc-40ab-9611-8af721fe02f0","year":2006},"citing_paper":{"arxiv_id":"2606.28134","last_updated":"2026-06-26T14:34:28Z","snapshot_observed_at":"2026-07-07T00:02:14.441610Z","submitted_at":"2026-06-26T14:34:28Z","title":"Beyond Sparse Supervision: Diffusion-Guided Learning for Few-Shot Graph Fraud Detection","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-06-29T04:58:01.688785Z"},"links":{"cited_paper":"/paper/2006.07988","citing_paper":"/paper/2606.28134"},"observation_digest":"sha256:e9e87ba05152031af702e6c96b5fc9d0bd52202a5edde3a9c9b45d14be171c9f","observation_id":"09cb028a-eef0-46af-82a9-91b30bac5fb1","resolution":{"observed_at":"2026-06-29T19:03:52.250338Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2006.07988","last_updated":"2021-10-26T20:07:59Z","snapshot_observed_at":"2026-07-06T09:28:59.431672Z","submitted_at":"2020-06-14T19:27:39Z","title":"Adaptive Universal Generalized PageRank Graph Neural Network","version":6},"cited_work":{"arxiv_id":"2006.07988","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2006.07988","snapshot_observed_at":"2026-07-03T00:17:29.135309Z","title":"Adaptive universal generalized pagerank graph neural network","venue":null,"work_id":"efc6c2d7-b6dc-40ab-9611-8af721fe02f0","year":2006},"citing_paper":{"arxiv_id":"2607.00671","last_updated":"2026-07-01T09:17:28Z","snapshot_observed_at":"2026-08-03T01:36:19.747428Z","submitted_at":"2026-07-01T09:17:28Z","title":"Multi-Label Node Classification with Label Influence Propagation","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-07-02T15:50:20.012826Z"},"links":{"cited_paper":"/paper/2006.07988","citing_paper":"/paper/2607.00671"},"observation_digest":"sha256:96304889707112a271b899e7c5eb3d8e001eb8229f7e4f2dde47d52f4122a324","observation_id":"029ccaf4-ad20-4280-b506-1410bc75eb5d","resolution":{"observed_at":"2026-07-02T15:57:06.507655Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2006.07988","last_updated":"2021-10-26T20:07:59Z","snapshot_observed_at":"2026-07-06T09:28:59.431672Z","submitted_at":"2020-06-14T19:27:39Z","title":"Adaptive Universal Generalized PageRank Graph Neural Network","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2006.07988","snapshot_observed_at":"2026-08-02T03:40:57.779442Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.13837","last_updated":"2026-07-15T13:45:26Z","snapshot_observed_at":"2026-08-04T01:39:39.151520Z","submitted_at":"2026-07-15T13:45:26Z","title":"NodeImport: Imbalanced Node Classification with Node Importance Assessment","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-02T03:40:57.779442Z"},"links":{"cited_paper":"/paper/2006.07988","citing_paper":"/paper/2607.13837"},"observation_digest":"sha256:42b31e35229c26a86d50f4af60e840554296c49e0c5cb620b72adae15140f589","observation_id":"73aea58d-40b6-48ca-8c88-3e30590dfee2","resolution":{"observed_at":"2026-08-02T03:40:57.779442Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2006.07988","last_updated":"2021-10-26T20:07:59Z","snapshot_observed_at":"2026-07-06T09:28:59.431672Z","submitted_at":"2020-06-14T19:27:39Z","title":"Adaptive Universal Generalized PageRank Graph Neural Network","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2006.07988","snapshot_observed_at":"2026-08-01T02:57:52.513534Z","title":"Adaptive universal general- ized pagerank graph neural network,","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2607.25273","last_updated":"2026-07-28T04:20:34Z","snapshot_observed_at":"2026-08-05T10:36:26.620712Z","submitted_at":"2026-07-28T04:20:34Z","title":"HeAD-CP: Heterophily-Aware Diffused Conformal Prediction Sets for Graph Neural Networks","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-01T02:57:52.513534Z"},"links":{"cited_paper":"/paper/2006.07988","citing_paper":"/paper/2607.25273"},"observation_digest":"sha256:b5916d37f6927ec4a265d2b2b14122fc178a9c66ac0684fa3b99dec056b182b7","observation_id":"d8c6afdf-ed9b-4855-831e-bfdd0c8f58f9","resolution":{"observed_at":"2026-08-01T02:57:52.513534Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2006.07988","last_updated":"2021-10-26T20:07:59Z","snapshot_observed_at":"2026-07-06T09:28:59.431672Z","submitted_at":"2020-06-14T19:27:39Z","title":"Adaptive Universal Generalized PageRank Graph Neural Network","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2006.07988","snapshot_observed_at":"2026-07-31T04:39:46.819692Z","title":"arXiv preprint arXiv:2006.07988 , year=","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2607.28525","last_updated":"2026-07-30T17:01:20Z","snapshot_observed_at":"2026-08-03T00:12:16.079391Z","submitted_at":"2026-07-30T17:01:20Z","title":"Same Graph Cross-Task Transfer in GNNs: Protocols and Predictors","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-07-31T04:39:46.819692Z"},"links":{"cited_paper":"/paper/2006.07988","citing_paper":"/paper/2607.28525"},"observation_digest":"sha256:98edd4255b099d5d7454911ab57af44a0e6048dda2a701055d397b7013d69b03","observation_id":"f28259fc-7e44-459e-942f-ea65c1d86c7e","resolution":{"observed_at":"2026-07-31T04:39:46.819692Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2006.07988/citation-record","integrity":"/paper/2006.07988/integrity","json":"/paper/2006.07988/citation-record.json","paper":"/paper/2006.07988"},"outbound":[],"paper":{"arxiv_id":"2006.07988","last_updated":"2021-10-26T20:07:59Z","latest_version":6,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T09:28:59.431672Z","submitted_at":"2020-06-14T19:27:39Z","title":"Adaptive Universal Generalized PageRank Graph Neural Network"},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 21 inbound Pith citation observations for arXiv:2006.07988."}