{"as_of":"2026-08-20T20:45:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:6f0a705ac065eb7f938a3b47dc13496ac27a9ed99170d907b218dea25a786d45","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":48,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":48,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-20T06:33:59.587034+00:00","state":"measured"},{"denominator":48,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":48,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-16T12:25:18.508749Z","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-03T20:08:56.229471Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1907.04931","last_updated":"2020-02-16T00:42:48Z","snapshot_observed_at":"2026-08-17T15:19:05.606929Z","submitted_at":"2019-07-10T21:11:13Z","title":"GraphSAINT: Graph Sampling Based Inductive Learning Method","version":4},"cited_work":{"arxiv_id":"1907.04931","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1907.04931","snapshot_observed_at":"2026-07-03T20:08:56.229471Z","title":"Graphsaint: Graph sampling based inductive learning method","venue":null,"work_id":"567878b0-3882-4280-b3f2-3148d61050a0","year":2019},"citing_paper":{"arxiv_id":"2105.14491","last_updated":"2022-01-31T07:20:20Z","snapshot_observed_at":"2026-07-06T11:14:04.454155Z","submitted_at":"2021-05-30T10:17:58Z","title":"How Attentive are Graph Attention Networks?","version":3},"reference_index":67,"source":"arxiv_source","source_observed_at":"2026-05-17T02:33:38.686468Z"},"links":{"cited_paper":"/paper/1907.04931","citing_paper":"/paper/2105.14491"},"observation_digest":"sha256:d76e6ad434393ab227a057a43dc118d63ff68b331415a16a9b725ebbec21af5f","observation_id":"a478809b-03ba-49a1-8d9f-19c2600f185b","resolution":{"observed_at":"2026-05-17T02:33:38.773994Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1907.04931","last_updated":"2020-02-16T00:42:48Z","snapshot_observed_at":"2026-08-17T15:19:05.606929Z","submitted_at":"2019-07-10T21:11:13Z","title":"GraphSAINT: Graph Sampling Based Inductive Learning Method","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1907.04931","snapshot_observed_at":"2026-08-12T18:47:53.376542Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2411.11304","last_updated":"2025-08-06T16:14:04Z","snapshot_observed_at":"2026-08-15T04:45:36.022380Z","submitted_at":"2024-11-18T05:59:29Z","title":"Personalized One-shot Federated Graph Learning for Heterogeneous Clients","version":7},"reference_index":64,"source":"arxiv_source","source_observed_at":"2026-08-12T18:47:53.376542Z"},"links":{"cited_paper":"/paper/1907.04931","citing_paper":"/paper/2411.11304"},"observation_digest":"sha256:db22ef87d9296cfd335ee4ba26098af56b23792c7104f2a66828d35a79490167","observation_id":"907b1e00-dcba-4ebc-aca7-29a707944051","resolution":{"observed_at":"2026-08-12T18:47:53.376542Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1907.04931","last_updated":"2020-02-16T00:42:48Z","snapshot_observed_at":"2026-08-17T15:19:05.606929Z","submitted_at":"2019-07-10T21:11:13Z","title":"GraphSAINT: Graph Sampling Based Inductive Learning Method","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1907.04931","snapshot_observed_at":"2026-08-12T15:37:16.871485Z","title":"Prasanna","venue":null,"work_id":null,"year":1907},"citing_paper":{"arxiv_id":"2411.14094","last_updated":"2024-11-21T12:59:39Z","snapshot_observed_at":"2026-08-19T22:41:01.101454Z","submitted_at":"2024-11-21T12:59:39Z","title":"GNN-MultiFix: Addressing the pitfalls for GNNs for multi-label node classification","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-12T15:37:16.871485Z"},"links":{"cited_paper":"/paper/1907.04931","citing_paper":"/paper/2411.14094"},"observation_digest":"sha256:794d7a655d85014454073639200cc82f3334c284ce195ab9432f025106cb41be","observation_id":"ba6e9bbe-6d3e-408c-b115-5cad7b228c50","resolution":{"observed_at":"2026-08-12T15:37:16.871485Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1907.04931","last_updated":"2020-02-16T00:42:48Z","snapshot_observed_at":"2026-08-17T15:19:05.606929Z","submitted_at":"2019-07-10T21:11:13Z","title":"GraphSAINT: Graph Sampling Based Inductive Learning Method","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1907.04931","snapshot_observed_at":"2026-08-12T11:48:09.501189Z","title":"Graphsaint: Graph sampling based induc- tive learning method,","venue":null,"work_id":null,"year":1907},"citing_paper":{"arxiv_id":"2411.18648","last_updated":"2024-12-31T02:11:04Z","snapshot_observed_at":"2026-08-18T09:13:53.538381Z","submitted_at":"2024-11-26T22:50:53Z","title":"MADE: Graph Backdoor Defense with Masked Unlearning","version":2},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-12T11:48:09.501189Z"},"links":{"cited_paper":"/paper/1907.04931","citing_paper":"/paper/2411.18648"},"observation_digest":"sha256:7300f3827aad77b1b65321cd0f5551f3390cebc1f7f349d7f8289f2a9897ecfc","observation_id":"d6eeae10-ca14-44fc-82a6-ca82ef42c892","resolution":{"observed_at":"2026-08-12T11:48:09.501189Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1907.04931","last_updated":"2020-02-16T00:42:48Z","snapshot_observed_at":"2026-08-17T15:19:05.606929Z","submitted_at":"2019-07-10T21:11:13Z","title":"GraphSAINT: Graph Sampling Based Inductive Learning Method","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1907.04931","snapshot_observed_at":"2026-08-11T15:34:27.978806Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2412.11007","last_updated":"2024-12-15T01:12:33Z","snapshot_observed_at":"2026-08-18T12:32:02.461518Z","submitted_at":"2024-12-15T01:12:33Z","title":"FlashSparse: Minimizing Computation Redundancy for Fast Sparse Matrix Multiplications on Tensor Cores","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-11T15:34:27.978806Z"},"links":{"cited_paper":"/paper/1907.04931","citing_paper":"/paper/2412.11007"},"observation_digest":"sha256:a97383da22dbf8c262af09d18d25f3475e7c110ed80ba739ce23c9097561028d","observation_id":"2d58d681-eb4c-47b5-b8db-02518fa32f0b","resolution":{"observed_at":"2026-08-11T15:34:27.978806Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1907.04931","last_updated":"2020-02-16T00:42:48Z","snapshot_observed_at":"2026-08-17T15:19:05.606929Z","submitted_at":"2019-07-10T21:11:13Z","title":"GraphSAINT: Graph Sampling Based Inductive Learning Method","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1907.04931","snapshot_observed_at":"2026-08-11T12:41:32.923791Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2412.14223","last_updated":"2025-02-23T13:40:26Z","snapshot_observed_at":"2026-08-19T11:38:57.449640Z","submitted_at":"2024-12-18T15:39:57Z","title":"Towards Precise Prediction Uncertainty in GNNs: Refining GNNs with Topology-grouping Strategy","version":2},"reference_index":73,"source":"arxiv_source","source_observed_at":"2026-08-11T12:41:32.923791Z"},"links":{"cited_paper":"/paper/1907.04931","citing_paper":"/paper/2412.14223"},"observation_digest":"sha256:25b001350c6c00a4137184fc9f900f10766dd45822194ad8099a22f6a0fe65f8","observation_id":"2a2a5051-d7d0-47a0-ac55-7f048a69a7ad","resolution":{"observed_at":"2026-08-11T12:41:32.923791Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1907.04931","last_updated":"2020-02-16T00:42:48Z","snapshot_observed_at":"2026-08-17T15:19:05.606929Z","submitted_at":"2019-07-10T21:11:13Z","title":"GraphSAINT: Graph Sampling Based Inductive Learning Method","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1907.04931","snapshot_observed_at":"2026-08-10T17:28:17.625761Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2501.12430","last_updated":"2025-01-21T15:50:51Z","snapshot_observed_at":"2026-08-20T20:17:11.406066Z","submitted_at":"2025-01-21T15:50:51Z","title":"SCFCRC: Simultaneously Counteract Feature Camouflage and Relation Camouflage for Fraud Detection","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-10T17:28:17.625761Z"},"links":{"cited_paper":"/paper/1907.04931","citing_paper":"/paper/2501.12430"},"observation_digest":"sha256:28f849c582af971635fc8a03bdb99ca8e3e68009f806f22f083d62067d33c5f6","observation_id":"8612cfcd-c5c7-4029-bb88-a4788c087bb1","resolution":{"observed_at":"2026-08-10T17:28:17.625761Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1907.04931","last_updated":"2020-02-16T00:42:48Z","snapshot_observed_at":"2026-08-17T15:19:05.606929Z","submitted_at":"2019-07-10T21:11:13Z","title":"GraphSAINT: Graph Sampling Based Inductive Learning Method","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1907.04931","snapshot_observed_at":"2026-08-10T14:05:43.950839Z","title":"Graph- saint: Graph sampling based inductive learning method","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2501.15696","last_updated":"2025-01-26T22:55:34Z","snapshot_observed_at":"2026-08-16T13:52:18.863266Z","submitted_at":"2025-01-26T22:55:34Z","title":"Random Walk Guided Hyperbolic Graph Distillation","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-10T14:05:43.950839Z"},"links":{"cited_paper":"/paper/1907.04931","citing_paper":"/paper/2501.15696"},"observation_digest":"sha256:57fea43f716a6696545dc34f1b6b23655b8afe719791f847245c4e8ccd2e2fe2","observation_id":"9559f085-2461-4517-b19e-c6511ddb4593","resolution":{"observed_at":"2026-08-10T14:05:43.950839Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1907.04931","last_updated":"2020-02-16T00:42:48Z","snapshot_observed_at":"2026-08-17T15:19:05.606929Z","submitted_at":"2019-07-10T21:11:13Z","title":"GraphSAINT: Graph Sampling Based Inductive Learning Method","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1907.04931","snapshot_observed_at":"2026-08-10T13:54:34.859325Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2501.16002","last_updated":"2025-01-30T11:40:01Z","snapshot_observed_at":"2026-08-18T19:54:04.000514Z","submitted_at":"2025-01-27T12:39:16Z","title":"ScaDyG:A New Paradigm for Large-scale Dynamic Graph Learning","version":2},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-10T13:54:34.859325Z"},"links":{"cited_paper":"/paper/1907.04931","citing_paper":"/paper/2501.16002"},"observation_digest":"sha256:9ed7440098db4d9901ed8bb63774f292d53564fc2654a1038cc3c4ca033ac154","observation_id":"809f22bc-41db-4684-b14b-e0a36ee641c0","resolution":{"observed_at":"2026-08-10T13:54:34.859325Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1907.04931","last_updated":"2020-02-16T00:42:48Z","snapshot_observed_at":"2026-08-17T15:19:05.606929Z","submitted_at":"2019-07-10T21:11:13Z","title":"GraphSAINT: Graph Sampling Based Inductive Learning Method","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1907.04931","snapshot_observed_at":"2026-08-09T21:29:27.805046Z","title":"Graphsaint: Graph sampling based inductive learning method","venue":null,"work_id":null,"year":1907},"citing_paper":{"arxiv_id":"2501.19089","last_updated":"2025-05-16T21:51:27Z","snapshot_observed_at":"2026-08-17T20:51:07.568861Z","submitted_at":"2025-01-31T12:34:09Z","title":"Resolving Oversmoothing with Opinion Dissensus","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-09T21:29:27.805046Z"},"links":{"cited_paper":"/paper/1907.04931","citing_paper":"/paper/2501.19089"},"observation_digest":"sha256:b944fcba84c0dd1b64f6f56907ff11b5d8993b7fb673581a2591df6c46b84929","observation_id":"2bd85920-8f49-477a-8ff4-7c571f927aeb","resolution":{"observed_at":"2026-08-09T21:29:27.805046Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1907.04931","last_updated":"2020-02-16T00:42:48Z","snapshot_observed_at":"2026-08-17T15:19:05.606929Z","submitted_at":"2019-07-10T21:11:13Z","title":"GraphSAINT: Graph Sampling Based Inductive Learning Method","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1907.04931","snapshot_observed_at":"2026-08-09T15:57:30.011561Z","title":"Graphsaint: Graph sampling based inductive learning method.arXiv preprint arXiv:1907.04931, 2019","venue":null,"work_id":null,"year":1907},"citing_paper":{"arxiv_id":"2502.01272","last_updated":"2026-06-09T11:03:20Z","snapshot_observed_at":"2026-08-18T20:11:12.596032Z","submitted_at":"2025-02-03T11:41:42Z","title":"Boosting Graph Robustness Against Backdoor Attacks: An Over-Similarity Perspective","version":3},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-09T15:57:30.011561Z"},"links":{"cited_paper":"/paper/1907.04931","citing_paper":"/paper/2502.01272"},"observation_digest":"sha256:8dd875f040796be73da587e9191db31b3d0eeb7b53e2bca3a879910ca994f87b","observation_id":"9c6db122-2660-4f01-8a39-4e89f8363819","resolution":{"observed_at":"2026-08-09T15:57:30.011561Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1907.04931","last_updated":"2020-02-16T00:42:48Z","snapshot_observed_at":"2026-08-17T15:19:05.606929Z","submitted_at":"2019-07-10T21:11:13Z","title":"GraphSAINT: Graph Sampling Based Inductive Learning Method","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1907.04931","snapshot_observed_at":"2026-08-16T12:25:18.508749Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2504.13034","last_updated":"2025-05-09T23:06:21Z","snapshot_observed_at":"2026-08-20T13:36:19.841789Z","submitted_at":"2025-04-17T15:42:13Z","title":"Inference-friendly Graph Compression for Graph Neural Networks","version":3},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-16T12:25:18.508749Z"},"links":{"cited_paper":"/paper/1907.04931","citing_paper":"/paper/2504.13034"},"observation_digest":"sha256:d9b731442e4301c634da4685a5a57d4736176664cdfc1979d54fae7debcd0a9e","observation_id":"9351fc88-cc10-45eb-bb4a-cfce5ac68941","resolution":{"observed_at":"2026-08-16T12:25:18.508749Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1907.04931","last_updated":"2020-02-16T00:42:48Z","snapshot_observed_at":"2026-08-17T15:19:05.606929Z","submitted_at":"2019-07-10T21:11:13Z","title":"GraphSAINT: Graph Sampling Based Inductive Learning Method","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1907.04931","snapshot_observed_at":"2026-08-16T11:59:26.877672Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2504.14188","last_updated":"2025-08-14T06:48:27Z","snapshot_observed_at":"2026-08-20T05:07:33.373973Z","submitted_at":"2025-04-19T05:24:40Z","title":"Rethinking Client-oriented Federated Graph Learning","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-16T11:59:26.877672Z"},"links":{"cited_paper":"/paper/1907.04931","citing_paper":"/paper/2504.14188"},"observation_digest":"sha256:f37e7434fc98f35757e8d38eceee2d0ee182d89d7e0c80527921270b600e93c8","observation_id":"4a035f75-1c93-4c51-b943-2748954244f1","resolution":{"observed_at":"2026-08-16T11:59:26.877672Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1907.04931","last_updated":"2020-02-16T00:42:48Z","snapshot_observed_at":"2026-08-17T15:19:05.606929Z","submitted_at":"2019-07-10T21:11:13Z","title":"GraphSAINT: Graph Sampling Based Inductive Learning Method","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1907.04931","snapshot_observed_at":"2026-08-16T05:16:13.925104Z","title":"Graphsaint: Graph sampling based inductive learning method","venue":null,"work_id":null,"year":1907},"citing_paper":{"arxiv_id":"2504.21206","last_updated":"2025-05-26T01:53:07Z","snapshot_observed_at":"2026-08-20T17:53:29.381783Z","submitted_at":"2025-04-29T22:23:35Z","title":"FedHERO: A Federated Learning Approach for Node Classification Task on Heterophilic Graphs","version":2},"reference_index":87,"source":"arxiv_source","source_observed_at":"2026-08-16T05:16:13.925104Z"},"links":{"cited_paper":"/paper/1907.04931","citing_paper":"/paper/2504.21206"},"observation_digest":"sha256:e4d9c2443b75f0dd758fd48f78a8277e4ea48f354498440f3e766bde70ed6cb6","observation_id":"58934daf-2ed1-4ced-8506-af569cbf50bd","resolution":{"observed_at":"2026-08-16T05:16:13.925104Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1907.04931","last_updated":"2020-02-16T00:42:48Z","snapshot_observed_at":"2026-08-17T15:19:05.606929Z","submitted_at":"2019-07-10T21:11:13Z","title":"GraphSAINT: Graph Sampling Based Inductive Learning Method","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1907.04931","snapshot_observed_at":"2026-08-15T22:07:36.884918Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2505.08098","last_updated":"2025-05-12T22:09:05Z","snapshot_observed_at":"2026-08-18T16:06:50.213312Z","submitted_at":"2025-05-12T22:09:05Z","title":"Fused3S: Fast Sparse Attention on Tensor Cores","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-15T22:07:36.884918Z"},"links":{"cited_paper":"/paper/1907.04931","citing_paper":"/paper/2505.08098"},"observation_digest":"sha256:79bcf6dcad09d5a89715b005b8cfd8da058f6f78ef780078cb89df9fe2378ef6","observation_id":"ab0b6da7-6668-4f17-8a5b-8e88b0af569c","resolution":{"observed_at":"2026-08-15T22:07:36.884918Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1907.04931","last_updated":"2020-02-16T00:42:48Z","snapshot_observed_at":"2026-08-17T15:19:05.606929Z","submitted_at":"2019-07-10T21:11:13Z","title":"GraphSAINT: Graph Sampling Based Inductive Learning Method","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1907.04931","snapshot_observed_at":"2026-08-15T22:05:50.867735Z","title":"Graph SAINT : Graph sampling based inductive learning method","venue":null,"work_id":null,"year":1907},"citing_paper":{"arxiv_id":"2505.08266","last_updated":"2025-06-06T09:03:54Z","snapshot_observed_at":"2026-08-16T15:49:16.999854Z","submitted_at":"2025-05-13T06:32:23Z","title":"Open Your Eyes: Vision Enhances Message Passing Neural Networks in Link Prediction","version":3},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-08-15T22:05:50.867735Z"},"links":{"cited_paper":"/paper/1907.04931","citing_paper":"/paper/2505.08266"},"observation_digest":"sha256:0caf6947ddab5f63b4d667446ef3a83eae8298076b57e24cce49cf4932afe060","observation_id":"63c5cbfb-a485-4ab0-9b07-dd50b0fd182b","resolution":{"observed_at":"2026-08-15T22:05:50.867735Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1907.04931","last_updated":"2020-02-16T00:42:48Z","snapshot_observed_at":"2026-08-17T15:19:05.606929Z","submitted_at":"2019-07-10T21:11:13Z","title":"GraphSAINT: Graph Sampling Based Inductive Learning Method","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1907.04931","snapshot_observed_at":"2026-08-15T21:06:59.969678Z","title":"Graph- saint: Graph sampling based inductive learning method,","venue":null,"work_id":null,"year":1907},"citing_paper":{"arxiv_id":"2505.10806","last_updated":"2025-05-16T03:01:47Z","snapshot_observed_at":"2026-08-17T23:28:07.047888Z","submitted_at":"2025-05-16T03:01:47Z","title":"RapidGNN: Communication Efficient Large-Scale Distributed Training of Graph Neural Networks","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-15T21:06:59.969678Z"},"links":{"cited_paper":"/paper/1907.04931","citing_paper":"/paper/2505.10806"},"observation_digest":"sha256:ee75ae2944bf8b0a4905875d3c049823a2bf9d765ee8b8e19a0787990ebed5cd","observation_id":"4a733702-5ca8-48c3-8a43-67b58e1ab08e","resolution":{"observed_at":"2026-08-15T21:06:59.969678Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1907.04931","last_updated":"2020-02-16T00:42:48Z","snapshot_observed_at":"2026-08-17T15:19:05.606929Z","submitted_at":"2019-07-10T21:11:13Z","title":"GraphSAINT: Graph Sampling Based Inductive Learning Method","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1907.04931","snapshot_observed_at":"2026-08-15T20:42:42.899699Z","title":"Graphsaint: Graph sampling based inductive learning method,","venue":null,"work_id":null,"year":1907},"citing_paper":{"arxiv_id":"2505.12323","last_updated":"2025-05-18T09:33:10Z","snapshot_observed_at":"2026-08-19T19:24:16.307293Z","submitted_at":"2025-05-18T09:33:10Z","title":"GraphFLEx: Structure Learning Framework for Large Expanding Graphs","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-15T20:42:42.899699Z"},"links":{"cited_paper":"/paper/1907.04931","citing_paper":"/paper/2505.12323"},"observation_digest":"sha256:e9916ae4b6b3c9ddb213373455660c0129d396578886d920a40fb2139329119f","observation_id":"d41d32cb-86ee-4450-ae52-aed3bafa8f4d","resolution":{"observed_at":"2026-08-15T20:42:42.899699Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1907.04931","last_updated":"2020-02-16T00:42:48Z","snapshot_observed_at":"2026-08-17T15:19:05.606929Z","submitted_at":"2019-07-10T21:11:13Z","title":"GraphSAINT: Graph Sampling Based Inductive Learning Method","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1907.04931","snapshot_observed_at":"2026-08-15T20:43:48.369886Z","title":"Graphsaint: Graph sampling based inductive learning method,","venue":null,"work_id":null,"year":1907},"citing_paper":{"arxiv_id":"2505.15842","last_updated":"2025-05-18T09:57:33Z","snapshot_observed_at":"2026-08-16T17:12:31.224404Z","submitted_at":"2025-05-18T09:57:33Z","title":"AH-UGC: Adaptive and Heterogeneous-Universal Graph Coarsening","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-15T20:43:48.369886Z"},"links":{"cited_paper":"/paper/1907.04931","citing_paper":"/paper/2505.15842"},"observation_digest":"sha256:6f525bba7f594507976a9e9cf39739e2423f7ce9159bbfd534498d1a1af1202c","observation_id":"3b948bfb-bb43-40a4-a346-eff6871ac35b","resolution":{"observed_at":"2026-08-15T20:43:48.369886Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1907.04931","last_updated":"2020-02-16T00:42:48Z","snapshot_observed_at":"2026-08-17T15:19:05.606929Z","submitted_at":"2019-07-10T21:11:13Z","title":"GraphSAINT: Graph Sampling Based Inductive Learning Method","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1907.04931","snapshot_observed_at":"2026-08-07T13:55:24.022359Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2505.20807","last_updated":"2025-05-27T07:13:10Z","snapshot_observed_at":"2026-08-19T17:08:54.809417Z","submitted_at":"2025-05-27T07:13:10Z","title":"Simple yet Effective Graph Distillation via Clustering","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-07T13:55:24.022359Z"},"links":{"cited_paper":"/paper/1907.04931","citing_paper":"/paper/2505.20807"},"observation_digest":"sha256:ffd8a10d35264100232820ec25fdcf05fb1aea51baad658cc9c8df9929c8404a","observation_id":"595b85d4-0f70-4a53-83c3-3e8bb48bc70d","resolution":{"observed_at":"2026-08-07T13:55:24.022359Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1907.04931","last_updated":"2020-02-16T00:42:48Z","snapshot_observed_at":"2026-08-17T15:19:05.606929Z","submitted_at":"2019-07-10T21:11:13Z","title":"GraphSAINT: Graph Sampling Based Inductive Learning Method","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1907.04931","snapshot_observed_at":"2026-08-07T12:16:51.715489Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2506.00191","last_updated":"2025-05-30T20:02:43Z","snapshot_observed_at":"2026-08-20T16:09:53.412255Z","submitted_at":"2025-05-30T20:02:43Z","title":"Heterogeneous Graph Backdoor Attack","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-07T12:16:51.715489Z"},"links":{"cited_paper":"/paper/1907.04931","citing_paper":"/paper/2506.00191"},"observation_digest":"sha256:ab43411e80683abb8e8bf2df02b5092f7045ddbd886246223133c89b3fd33498","observation_id":"b9e5bd52-4794-4aec-a3f1-f52d616a4018","resolution":{"observed_at":"2026-08-07T12:16:51.715489Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1907.04931","last_updated":"2020-02-16T00:42:48Z","snapshot_observed_at":"2026-08-17T15:19:05.606929Z","submitted_at":"2019-07-10T21:11:13Z","title":"GraphSAINT: Graph Sampling Based Inductive Learning Method","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1907.04931","snapshot_observed_at":"2026-08-15T19:12:36.534628Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2506.21612","last_updated":"2025-06-21T08:06:06Z","snapshot_observed_at":"2026-08-19T07:30:36.401381Z","submitted_at":"2025-06-21T08:06:06Z","title":"AdaptGOT: A Pre-trained Model for Adaptive Contextual POI Representation Learning","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-15T19:12:36.534628Z"},"links":{"cited_paper":"/paper/1907.04931","citing_paper":"/paper/2506.21612"},"observation_digest":"sha256:1bd1532a65f24b28ad88bbfd1aaf58d47918412bfece481e98f3ffff5bceb981","observation_id":"5c4d3f92-08c8-4185-b9e5-6a7ee95359d1","resolution":{"observed_at":"2026-08-15T19:12:36.534628Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1907.04931","last_updated":"2020-02-16T00:42:48Z","snapshot_observed_at":"2026-08-17T15:19:05.606929Z","submitted_at":"2019-07-10T21:11:13Z","title":"GraphSAINT: Graph Sampling Based Inductive Learning Method","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1907.04931","snapshot_observed_at":"2026-08-06T19:25:28.211581Z","title":"Graphsaint: Graph sampling based inductive learning method","venue":null,"work_id":null,"year":1907},"citing_paper":{"arxiv_id":"2507.05649","last_updated":"2025-07-14T14:12:59Z","snapshot_observed_at":"2026-08-17T01:28:30.267575Z","submitted_at":"2025-07-08T04:01:53Z","title":"DESIGN: Encrypted GNN Inference via Server-Side Input Graph Pruning","version":2},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-06T19:25:28.211581Z"},"links":{"cited_paper":"/paper/1907.04931","citing_paper":"/paper/2507.05649"},"observation_digest":"sha256:304d0600fe6b6e07906268ea5839f696a5af4f36b37999c8424b745fa6e7dde2","observation_id":"5c97689c-2403-40b9-89eb-48f2dfbd9c8d","resolution":{"observed_at":"2026-08-06T19:25:28.211581Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1907.04931","last_updated":"2020-02-16T00:42:48Z","snapshot_observed_at":"2026-08-17T15:19:05.606929Z","submitted_at":"2019-07-10T21:11:13Z","title":"GraphSAINT: Graph Sampling Based Inductive Learning Method","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1907.04931","snapshot_observed_at":"2026-08-06T18:59:23.667922Z","title":"Graphsaint: Graph sampling based inductive learning method","venue":null,"work_id":null,"year":1907},"citing_paper":{"arxiv_id":"2507.13368","last_updated":"2025-08-05T09:24:58Z","snapshot_observed_at":"2026-08-18T02:44:20.792740Z","submitted_at":"2025-07-09T13:42:43Z","title":"Scalable Attribute-Missing Graph Clustering via Neighborhood Differentiation","version":2},"reference_index":67,"source":"arxiv_source","source_observed_at":"2026-08-06T18:59:23.667922Z"},"links":{"cited_paper":"/paper/1907.04931","citing_paper":"/paper/2507.13368"},"observation_digest":"sha256:cc3088cfb6a598230a5567f9a540e9024716c5196a07167367ee51b2c92c4dc0","observation_id":"bc23273a-296e-496f-9c60-4ae78a3547cb","resolution":{"observed_at":"2026-08-06T18:59:23.667922Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1907.04931","last_updated":"2020-02-16T00:42:48Z","snapshot_observed_at":"2026-08-17T15:19:05.606929Z","submitted_at":"2019-07-10T21:11:13Z","title":"GraphSAINT: Graph Sampling Based Inductive Learning Method","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1907.04931","snapshot_observed_at":"2026-08-06T11:41:58.510672Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2507.22524","last_updated":"2026-06-18T06:54:38Z","snapshot_observed_at":"2026-08-14T10:04:51.191690Z","submitted_at":"2025-07-30T09:50:43Z","title":"HGCN(O): A Self-Tuning GCN HyperModel Toolkit for Outcome Prediction in Event-Sequence Data","version":3},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-06T11:41:58.510672Z"},"links":{"cited_paper":"/paper/1907.04931","citing_paper":"/paper/2507.22524"},"observation_digest":"sha256:26e05469cb7d1b1c0a552aa4171a91352fbd6d65d263284439b930216d9a62cb","observation_id":"3ff07029-4c61-436c-8654-aa401294cd59","resolution":{"observed_at":"2026-08-06T11:41:58.510672Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1907.04931","last_updated":"2020-02-16T00:42:48Z","snapshot_observed_at":"2026-08-17T15:19:05.606929Z","submitted_at":"2019-07-10T21:11:13Z","title":"GraphSAINT: Graph Sampling Based Inductive Learning Method","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1907.04931","snapshot_observed_at":"2026-08-06T10:19:03.413357Z","title":", Zhou , H","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2508.00267","last_updated":"2025-08-01T02:22:03Z","snapshot_observed_at":"2026-08-15T17:40:25.522174Z","submitted_at":"2025-08-01T02:22:03Z","title":"Neighbor-Sampling Based Momentum Stochastic Methods for Training Graph Neural Networks","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-06T10:19:03.413357Z"},"links":{"cited_paper":"/paper/1907.04931","citing_paper":"/paper/2508.00267"},"observation_digest":"sha256:048e3751d4db89d336a8ccc69e65ae5cae9200713487227cb759e36441896917","observation_id":"59510a0f-e7e3-48c3-95d5-a20c00bdc9e3","resolution":{"observed_at":"2026-08-06T10:19:03.413357Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1907.04931","last_updated":"2020-02-16T00:42:48Z","snapshot_observed_at":"2026-08-17T15:19:05.606929Z","submitted_at":"2019-07-10T21:11:13Z","title":"GraphSAINT: Graph Sampling Based Inductive Learning Method","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1907.04931","snapshot_observed_at":"2026-08-05T21:34:39.985472Z","title":"Graph- saint: Graph sampling based inductive learning method,","venue":null,"work_id":null,"year":1907},"citing_paper":{"arxiv_id":"2508.08456","last_updated":"2025-08-11T20:30:21Z","snapshot_observed_at":"2026-08-11T02:43:47.351940Z","submitted_at":"2025-08-11T20:30:21Z","title":"From free-evolution to tomographic representation","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-05T21:34:39.985472Z"},"links":{"cited_paper":"/paper/1907.04931","citing_paper":"/paper/2508.08456"},"observation_digest":"sha256:2bd77dcb2c242fc2e66d912f2c67bbc6ac45c907b003c7ca0504da4a680aae90","observation_id":"8f506cd3-8dc7-40bc-b9ca-9d99e7f43798","resolution":{"observed_at":"2026-08-05T21:34:39.985472Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1907.04931","last_updated":"2020-02-16T00:42:48Z","snapshot_observed_at":"2026-08-17T15:19:05.606929Z","submitted_at":"2019-07-10T21:11:13Z","title":"GraphSAINT: Graph Sampling Based Inductive Learning Method","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1907.04931","snapshot_observed_at":"2026-08-05T05:33:03.256264Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2509.05207","last_updated":"2025-09-05T16:10:20Z","snapshot_observed_at":"2026-08-19T18:51:17.260004Z","submitted_at":"2025-09-05T16:10:20Z","title":"RapidGNN: Energy and Communication-Efficient Distributed Training on Large-Scale Graph Neural Networks","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-05T05:33:03.256264Z"},"links":{"cited_paper":"/paper/1907.04931","citing_paper":"/paper/2509.05207"},"observation_digest":"sha256:585fd222ce0e53ac5ac14f5b0c9e97fe73a61da152e8f39c2ab7ab129d9a52bc","observation_id":"0f72a4ea-75b4-4adc-8462-7aaa72690231","resolution":{"observed_at":"2026-08-05T05:33:03.256264Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1907.04931","last_updated":"2020-02-16T00:42:48Z","snapshot_observed_at":"2026-08-17T15:19:05.606929Z","submitted_at":"2019-07-10T21:11:13Z","title":"GraphSAINT: Graph Sampling Based Inductive Learning Method","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1907.04931","snapshot_observed_at":"2026-08-04T23:12:24.226668Z","title":"Graphsaint: Graph sampling based inductive learning method,","venue":null,"work_id":null,"year":1907},"citing_paper":{"arxiv_id":"2509.06777","last_updated":"2026-08-18T10:06:13Z","snapshot_observed_at":"2026-08-20T20:17:19.787767Z","submitted_at":"2025-09-08T15:03:05Z","title":"Asynchronous Message Passing for Addressing Oversquashing in Graph Neural Networks","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-04T23:12:24.226668Z"},"links":{"cited_paper":"/paper/1907.04931","citing_paper":"/paper/2509.06777"},"observation_digest":"sha256:ed04e12dafcc97b08ea9dd9a78189caf660f181f98ee6bcf147b283ad87acd31","observation_id":"46badaef-09db-4a61-94da-b106b506d120","resolution":{"observed_at":"2026-08-04T23:12:24.226668Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1907.04931","last_updated":"2020-02-16T00:42:48Z","snapshot_observed_at":"2026-08-17T15:19:05.606929Z","submitted_at":"2019-07-10T21:11:13Z","title":"GraphSAINT: Graph Sampling Based Inductive Learning Method","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1907.04931","snapshot_observed_at":"2026-08-15T15:51:51.424703Z","title":"Graph- saint: Graph sampling based inductive learning method.arXiv preprint arXiv:1907.04931,","venue":null,"work_id":null,"year":1907},"citing_paper":{"arxiv_id":"2509.21489","last_updated":"2026-06-22T12:04:16Z","snapshot_observed_at":"2026-08-15T22:18:32.163404Z","submitted_at":"2025-09-25T19:47:49Z","title":"GraphPFN: A Prior-Data Fitted Graph Foundation Model","version":3},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-15T15:51:51.424703Z"},"links":{"cited_paper":"/paper/1907.04931","citing_paper":"/paper/2509.21489"},"observation_digest":"sha256:c69f21a23f6ec461f0412ad6aa95f1dcc8809f1f0f6638c5e285833937030196","observation_id":"69a38783-e5fa-450a-9bc8-66da53ec451f","resolution":{"observed_at":"2026-08-15T15:51:51.424703Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1907.04931","last_updated":"2020-02-16T00:42:48Z","snapshot_observed_at":"2026-08-17T15:19:05.606929Z","submitted_at":"2019-07-10T21:11:13Z","title":"GraphSAINT: Graph Sampling Based Inductive Learning Method","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1907.04931","snapshot_observed_at":"2026-08-04T08:28:05.715817Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2510.20640","last_updated":"2026-06-29T13:42:49Z","snapshot_observed_at":"2026-08-17T19:32:42.530985Z","submitted_at":"2025-10-23T15:14:09Z","title":"Attention Enhanced Entity Recommendation for Intelligent Monitoring in Cloud Systems","version":2},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-04T08:28:05.715817Z"},"links":{"cited_paper":"/paper/1907.04931","citing_paper":"/paper/2510.20640"},"observation_digest":"sha256:ce9f6ae982cf68135e31763feb4910f1f5769ba3c600a5c1d3f14fcaa5bc547b","observation_id":"8ec21f5e-ac26-4c97-bf56-99c2f73670cd","resolution":{"observed_at":"2026-08-04T08:28:05.715817Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1907.04931","last_updated":"2020-02-16T00:42:48Z","snapshot_observed_at":"2026-08-17T15:19:05.606929Z","submitted_at":"2019-07-10T21:11:13Z","title":"GraphSAINT: Graph Sampling Based Inductive Learning Method","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1907.04931","snapshot_observed_at":"2026-08-03T21:50:37.746200Z","title":"In: International Conference on Learning Representations (ICLR) (2020),https://arxiv.org/abs/1907.04931","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2511.13645","last_updated":"2026-06-23T08:11:32Z","snapshot_observed_at":"2026-08-17T04:44:04.741288Z","submitted_at":"2025-11-17T17:57:18Z","title":"FuseSampleAgg: One-Pass Neighborhood Estimation for Budgeted Knowledge-Graph Refresh and Validation","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-03T21:50:37.746200Z"},"links":{"cited_paper":"/paper/1907.04931","citing_paper":"/paper/2511.13645"},"observation_digest":"sha256:b82fe729d26965b5fbc5ff0452067a8c415ea45cba2bb7dbd4b95414dd9a4ae1","observation_id":"ad07ed6f-db8f-45dc-8c79-58fc0afbf992","resolution":{"observed_at":"2026-08-03T21:50:37.746200Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1907.04931","last_updated":"2020-02-16T00:42:48Z","snapshot_observed_at":"2026-08-17T15:19:05.606929Z","submitted_at":"2019-07-10T21:11:13Z","title":"GraphSAINT: Graph Sampling Based Inductive Learning Method","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1907.04931","snapshot_observed_at":"2026-08-03T01:22:44.715677Z","title":"Graphsaint: Graph sampling based inductive learning method.arXiv preprint arXiv:1907.04931, 2019","venue":null,"work_id":null,"year":1907},"citing_paper":{"arxiv_id":"2603.09161","last_updated":"2026-07-31T10:22:18Z","snapshot_observed_at":"2026-08-19T14:46:12.457270Z","submitted_at":"2026-03-10T03:52:41Z","title":"Wrong Code, Right Structure: Learning Netlist Representations from Imperfect LLM-Generated RTL","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-03T01:22:44.715677Z"},"links":{"cited_paper":"/paper/1907.04931","citing_paper":"/paper/2603.09161"},"observation_digest":"sha256:be0066abba27170ed792b3554121667b1dcccf4385f2083bbce465d8d44c5348","observation_id":"38cccb8c-10eb-4714-90f6-c26b47d1ae49","resolution":{"observed_at":"2026-08-03T01:22:44.715677Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1907.04931","last_updated":"2020-02-16T00:42:48Z","snapshot_observed_at":"2026-08-17T15:19:05.606929Z","submitted_at":"2019-07-10T21:11:13Z","title":"GraphSAINT: Graph Sampling Based Inductive Learning Method","version":4},"cited_work":{"arxiv_id":"1907.04931","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1907.04931","snapshot_observed_at":"2026-07-03T20:08:56.229471Z","title":"Graphsaint: Graph sampling based inductive learning method","venue":null,"work_id":"567878b0-3882-4280-b3f2-3148d61050a0","year":2019},"citing_paper":{"arxiv_id":"2604.02651","last_updated":"2026-04-03T02:30:27Z","snapshot_observed_at":"2026-08-15T01:11:14.535875Z","submitted_at":"2026-04-03T02:30:27Z","title":"Communication-free Sampling and 4D Hybrid Parallelism for Scalable Mini-batch GNN Training","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-05-13T20:38:31.444109Z"},"links":{"cited_paper":"/paper/1907.04931","citing_paper":"/paper/2604.02651"},"observation_digest":"sha256:76a807d0abb92dc61b787fa7eacdcf0bfd06c875a0de9a7aa5c0c3517c89a591","observation_id":"65ca95ce-efdc-41d9-93b9-2b57dd091a6f","resolution":{"observed_at":"2026-05-13T20:43:15.364748Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1907.04931","last_updated":"2020-02-16T00:42:48Z","snapshot_observed_at":"2026-08-17T15:19:05.606929Z","submitted_at":"2019-07-10T21:11:13Z","title":"GraphSAINT: Graph Sampling Based Inductive Learning Method","version":4},"cited_work":{"arxiv_id":"1907.04931","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1907.04931","snapshot_observed_at":"2026-07-03T20:08:56.229471Z","title":"Graphsaint: Graph sampling based inductive learning method","venue":null,"work_id":"567878b0-3882-4280-b3f2-3148d61050a0","year":2019},"citing_paper":{"arxiv_id":"2604.27356","last_updated":"2026-04-30T03:13:10Z","snapshot_observed_at":"2026-08-10T22:52:08.358065Z","submitted_at":"2026-04-30T03:13:10Z","title":"TypeBandit: Type-Level Context Allocation and Reweighting for Effective Attribute Completion in Heterogeneous Graph Neural Networks","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-05-07T08:10:54.129668Z"},"links":{"cited_paper":"/paper/1907.04931","citing_paper":"/paper/2604.27356"},"observation_digest":"sha256:585d620c8a85f770dae15f65b270bac3dca6588c84dc43b745dde00d5980537a","observation_id":"72be9bc9-c677-46bc-8883-42c258da46e8","resolution":{"observed_at":"2026-05-12T10:01:29.274391Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1907.04931","last_updated":"2020-02-16T00:42:48Z","snapshot_observed_at":"2026-08-17T15:19:05.606929Z","submitted_at":"2019-07-10T21:11:13Z","title":"GraphSAINT: Graph Sampling Based Inductive Learning Method","version":4},"cited_work":{"arxiv_id":"1907.04931","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1907.04931","snapshot_observed_at":"2026-07-03T20:08:56.229471Z","title":"Graphsaint: Graph sampling based inductive learning method","venue":null,"work_id":"567878b0-3882-4280-b3f2-3148d61050a0","year":2019},"citing_paper":{"arxiv_id":"2605.08278","last_updated":"2026-05-14T09:35:31Z","snapshot_observed_at":"2026-08-16T02:06:07.788712Z","submitted_at":"2026-05-08T07:02:25Z","title":"Trapping Attacker in Dilemma: Examining Internal Correlations and External Influences of Trigger for Defending GNN Backdoors","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-05-12T00:57:11.563029Z"},"links":{"cited_paper":"/paper/1907.04931","citing_paper":"/paper/2605.08278"},"observation_digest":"sha256:0cf4f96cd37adc1728587a49f3c83ef8ddafb98b8fe6344c15d83f22889b54a1","observation_id":"cc56265b-1ca7-4d60-b3f8-cf594015c8b4","resolution":{"observed_at":"2026-05-12T08:36:25.536237Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1907.04931","last_updated":"2020-02-16T00:42:48Z","snapshot_observed_at":"2026-08-17T15:19:05.606929Z","submitted_at":"2019-07-10T21:11:13Z","title":"GraphSAINT: Graph Sampling Based Inductive Learning Method","version":4},"cited_work":{"arxiv_id":"1907.04931","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1907.04931","snapshot_observed_at":"2026-07-03T20:08:56.229471Z","title":"Graphsaint: Graph sampling based inductive learning method","venue":null,"work_id":"567878b0-3882-4280-b3f2-3148d61050a0","year":2019},"citing_paper":{"arxiv_id":"2605.08278","last_updated":"2026-05-14T09:35:31Z","snapshot_observed_at":"2026-08-16T02:06:07.788712Z","submitted_at":"2026-05-08T07:02:25Z","title":"Trapping Attacker in Dilemma: Examining Internal Correlations and External Influences of Trigger for Defending GNN Backdoors","version":2},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-05-15T06:34:23.355531Z"},"links":{"cited_paper":"/paper/1907.04931","citing_paper":"/paper/2605.08278"},"observation_digest":"sha256:77712f21951a96d7e3edd45b8cda78e1f5a6668e61465ccc4198fe861e4200a3","observation_id":"2cd35de1-4aa2-4162-a5d4-fcdad14671c8","resolution":{"observed_at":"2026-05-15T06:35:09.367593Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1907.04931","last_updated":"2020-02-16T00:42:48Z","snapshot_observed_at":"2026-08-17T15:19:05.606929Z","submitted_at":"2019-07-10T21:11:13Z","title":"GraphSAINT: Graph Sampling Based Inductive Learning Method","version":4},"cited_work":{"arxiv_id":"1907.04931","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1907.04931","snapshot_observed_at":"2026-07-03T20:08:56.229471Z","title":"Graphsaint: Graph sampling based inductive learning method","venue":null,"work_id":"567878b0-3882-4280-b3f2-3148d61050a0","year":2019},"citing_paper":{"arxiv_id":"2605.16815","last_updated":"2026-05-25T01:36:11Z","snapshot_observed_at":"2026-08-15T14:10:26.768808Z","submitted_at":"2026-05-16T05:15:36Z","title":"Universal Graph Backdoor Defense: A Feature-based Homophily Perspective","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-05-19T21:11:10.472301Z"},"links":{"cited_paper":"/paper/1907.04931","citing_paper":"/paper/2605.16815"},"observation_digest":"sha256:c19d28848d1c64282d4391deb8d96f5000ae582d5e2964fef8e7e2b4fb45395b","observation_id":"ee27b772-070d-4ee5-997f-f5c1c8e21dcf","resolution":{"observed_at":"2026-05-19T21:12:47.023277Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1907.04931","last_updated":"2020-02-16T00:42:48Z","snapshot_observed_at":"2026-08-17T15:19:05.606929Z","submitted_at":"2019-07-10T21:11:13Z","title":"GraphSAINT: Graph Sampling Based Inductive Learning Method","version":4},"cited_work":{"arxiv_id":"1907.04931","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1907.04931","snapshot_observed_at":"2026-07-03T20:08:56.229471Z","title":"Graphsaint: Graph sampling based inductive learning method","venue":null,"work_id":"567878b0-3882-4280-b3f2-3148d61050a0","year":2019},"citing_paper":{"arxiv_id":"2605.16815","last_updated":"2026-05-25T01:36:11Z","snapshot_observed_at":"2026-08-15T14:10:26.768808Z","submitted_at":"2026-05-16T05:15:36Z","title":"Universal Graph Backdoor Defense: A Feature-based Homophily Perspective","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-06-30T19:38:55.719784Z"},"links":{"cited_paper":"/paper/1907.04931","citing_paper":"/paper/2605.16815"},"observation_digest":"sha256:8e8792421028795b97014f9a9546629f65d7d04e543ad7a2d3178c4f9fb40ab6","observation_id":"f25c9512-a40e-4297-b1f7-7a1cdb866a41","resolution":{"observed_at":"2026-06-30T19:45:00.922718Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1907.04931","last_updated":"2020-02-16T00:42:48Z","snapshot_observed_at":"2026-08-17T15:19:05.606929Z","submitted_at":"2019-07-10T21:11:13Z","title":"GraphSAINT: Graph Sampling Based Inductive Learning Method","version":4},"cited_work":{"arxiv_id":"1907.04931","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1907.04931","snapshot_observed_at":"2026-07-03T20:08:56.229471Z","title":"Graphsaint: Graph sampling based inductive learning method","venue":null,"work_id":"567878b0-3882-4280-b3f2-3148d61050a0","year":2019},"citing_paper":{"arxiv_id":"2605.17854","last_updated":"2026-05-18T04:52:07Z","snapshot_observed_at":"2026-08-15T22:31:04.376286Z","submitted_at":"2026-05-18T04:52:07Z","title":"Learning over Positive and Negative Edges with Contrastive Message Passing","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-05-20T12:31:19.969760Z"},"links":{"cited_paper":"/paper/1907.04931","citing_paper":"/paper/2605.17854"},"observation_digest":"sha256:730b138532ed89b9cc33198749bb067032788e94f3c7711c064d3ba936a01681","observation_id":"90f4d609-f592-4039-be58-c963a1564299","resolution":{"observed_at":"2026-05-20T12:33:16.874578Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1907.04931","last_updated":"2020-02-16T00:42:48Z","snapshot_observed_at":"2026-08-17T15:19:05.606929Z","submitted_at":"2019-07-10T21:11:13Z","title":"GraphSAINT: Graph Sampling Based Inductive Learning Method","version":4},"cited_work":{"arxiv_id":"1907.04931","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1907.04931","snapshot_observed_at":"2026-07-03T20:08:56.229471Z","title":"Graphsaint: Graph sampling based inductive learning method","venue":null,"work_id":"567878b0-3882-4280-b3f2-3148d61050a0","year":2019},"citing_paper":{"arxiv_id":"2605.18872","last_updated":"2026-05-15T18:25:49Z","snapshot_observed_at":"2026-08-15T08:01:48.812111Z","submitted_at":"2026-05-15T18:25:49Z","title":"EUPHORIA: Efficient Universal Planning via Hybrid Optimization for Robust Industrial Robotic Assembly","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-05-20T20:02:49.971295Z"},"links":{"cited_paper":"/paper/1907.04931","citing_paper":"/paper/2605.18872"},"observation_digest":"sha256:c295e841fcc8c56655a25fd17a5015525c06f1b3ef4977c9812227556b7e679f","observation_id":"a65f15f1-a212-42c9-b87f-1def9aa8ba10","resolution":{"observed_at":"2026-05-20T20:03:43.374641Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1907.04931","last_updated":"2020-02-16T00:42:48Z","snapshot_observed_at":"2026-08-17T15:19:05.606929Z","submitted_at":"2019-07-10T21:11:13Z","title":"GraphSAINT: Graph Sampling Based Inductive Learning Method","version":4},"cited_work":{"arxiv_id":"1907.04931","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1907.04931","snapshot_observed_at":"2026-07-03T20:08:56.229471Z","title":"Graphsaint: Graph sampling based inductive learning method","venue":null,"work_id":"567878b0-3882-4280-b3f2-3148d61050a0","year":2019},"citing_paper":{"arxiv_id":"2605.24207","last_updated":"2026-05-22T20:47:07Z","snapshot_observed_at":"2026-08-14T22:08:02.009682Z","submitted_at":"2026-05-22T20:47:07Z","title":"Incorporating Deep Learning Design in Database Queries","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-06-30T14:17:08.586047Z"},"links":{"cited_paper":"/paper/1907.04931","citing_paper":"/paper/2605.24207"},"observation_digest":"sha256:83f38b232d6cd18af8ca92b874a8cce6f1306304cf59ee42f153e99171390d43","observation_id":"d1967980-de1c-425f-ba4e-6093bf6fb9ba","resolution":{"observed_at":"2026-06-30T14:24:45.232962Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1907.04931","last_updated":"2020-02-16T00:42:48Z","snapshot_observed_at":"2026-08-17T15:19:05.606929Z","submitted_at":"2019-07-10T21:11:13Z","title":"GraphSAINT: Graph Sampling Based Inductive Learning Method","version":4},"cited_work":{"arxiv_id":"1907.04931","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1907.04931","snapshot_observed_at":"2026-07-03T20:08:56.229471Z","title":"Graphsaint: Graph sampling based inductive learning method","venue":null,"work_id":"567878b0-3882-4280-b3f2-3148d61050a0","year":2019},"citing_paper":{"arxiv_id":"2606.05046","last_updated":"2026-06-03T16:07:24Z","snapshot_observed_at":"2026-07-06T23:45:02.342193Z","submitted_at":"2026-06-03T16:07:24Z","title":"Graph Cascades: Contagion-Based Mesoscopic Rewiring for Structure-Aware Graph Machine Learning","version":1},"reference_index":176,"source":"arxiv_source","source_observed_at":"2026-06-28T07:37:20.073677Z"},"links":{"cited_paper":"/paper/1907.04931","citing_paper":"/paper/2606.05046"},"observation_digest":"sha256:5b8889282d5591fc0a81411b99a22136211e79d117cb22996e2a9818c0c342d3","observation_id":"bd92cf33-cb8f-4611-b1bd-73b279a51e5f","resolution":{"observed_at":"2026-07-02T06:06:41.472963Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1907.04931","last_updated":"2020-02-16T00:42:48Z","snapshot_observed_at":"2026-08-17T15:19:05.606929Z","submitted_at":"2019-07-10T21:11:13Z","title":"GraphSAINT: Graph Sampling Based Inductive Learning Method","version":4},"cited_work":{"arxiv_id":"1907.04931","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1907.04931","snapshot_observed_at":"2026-07-03T20:08:56.229471Z","title":"Graphsaint: Graph sampling based inductive learning method","venue":null,"work_id":"567878b0-3882-4280-b3f2-3148d61050a0","year":2019},"citing_paper":{"arxiv_id":"2606.09392","last_updated":"2026-06-08T12:07:13Z","snapshot_observed_at":"2026-08-13T08:52:05.912189Z","submitted_at":"2026-06-08T12:07:13Z","title":"From Coarse to Fine: Managing Temporal Granularity in Spatio-Temporal Data for Fine-Grained Traffic Prediction","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-06-27T16:40:14.247942Z"},"links":{"cited_paper":"/paper/1907.04931","citing_paper":"/paper/2606.09392"},"observation_digest":"sha256:fa91a17deb4714cd8b2a01272657a8680856111689d6502d29b9344a5c768f1d","observation_id":"5b954183-7135-4ef3-8b1b-323a9d6c7ac4","resolution":{"observed_at":"2026-07-03T01:17:30.932262Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1907.04931","last_updated":"2020-02-16T00:42:48Z","snapshot_observed_at":"2026-08-17T15:19:05.606929Z","submitted_at":"2019-07-10T21:11:13Z","title":"GraphSAINT: Graph Sampling Based Inductive Learning Method","version":4},"cited_work":{"arxiv_id":"1907.04931","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1907.04931","snapshot_observed_at":"2026-07-03T20:08:56.229471Z","title":"Graphsaint: Graph sampling based inductive learning method","venue":null,"work_id":"567878b0-3882-4280-b3f2-3148d61050a0","year":2019},"citing_paper":{"arxiv_id":"2606.17667","last_updated":"2026-06-16T08:29:34Z","snapshot_observed_at":"2026-08-16T12:45:24.831739Z","submitted_at":"2026-06-16T08:29:34Z","title":"Handling Feature Heterogeneity with Learnable Graph Patches","version":1},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-06-27T01:36:45.977332Z"},"links":{"cited_paper":"/paper/1907.04931","citing_paper":"/paper/2606.17667"},"observation_digest":"sha256:1fc27cfe17cacc8ede6378f5a739e9f110c9c84c73351746066bb9bb7e6d5834","observation_id":"e62ee49f-fe5b-40e8-b19f-e30c9a3be7d5","resolution":{"observed_at":"2026-07-03T20:08:56.231515Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1907.04931","last_updated":"2020-02-16T00:42:48Z","snapshot_observed_at":"2026-08-17T15:19:05.606929Z","submitted_at":"2019-07-10T21:11:13Z","title":"GraphSAINT: Graph Sampling Based Inductive Learning Method","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1907.04931","snapshot_observed_at":"2026-08-04T14:42:49.212802Z","title":"Graphsaint: Graph sampling based inductive learning method.arXiv preprint arXiv:1907.04931, 2019","venue":null,"work_id":null,"year":1907},"citing_paper":{"arxiv_id":"2608.02128","last_updated":"2026-08-03T12:18:58Z","snapshot_observed_at":"2026-08-17T13:02:49.987223Z","submitted_at":"2026-08-03T12:18:58Z","title":"CoRe-GNN: Multilevel Message passing on Coarsened graphs","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-04T14:42:49.212802Z"},"links":{"cited_paper":"/paper/1907.04931","citing_paper":"/paper/2608.02128"},"observation_digest":"sha256:e7824ef895e8fcd1e48d517fa3504a9acccff4b137b9fe08bf9a9b8f8f922f62","observation_id":"86407185-c58a-433d-a023-7516b0ac4bb5","resolution":{"observed_at":"2026-08-04T14:42:49.212802Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1907.04931","last_updated":"2020-02-16T00:42:48Z","snapshot_observed_at":"2026-08-17T15:19:05.606929Z","submitted_at":"2019-07-10T21:11:13Z","title":"GraphSAINT: Graph Sampling Based Inductive Learning Method","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1907.04931","snapshot_observed_at":"2026-08-10T13:54:58.536204Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2608.07158","last_updated":"2026-08-07T12:26:15Z","snapshot_observed_at":"2026-08-19T19:23:38.156897Z","submitted_at":"2026-08-07T12:26:15Z","title":"Edge Sparsification via Temporal Forman-Ricci Curvature for Dynamic Graph Learning","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-10T13:54:58.536204Z"},"links":{"cited_paper":"/paper/1907.04931","citing_paper":"/paper/2608.07158"},"observation_digest":"sha256:96639643b8e0448fc5f8f199e2d395ccd046b20f25fe55eb66ba7af1746b8c13","observation_id":"251419e7-15f1-4b30-a814-06d37d03a996","resolution":{"observed_at":"2026-08-10T13:54:58.536204Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1907.04931","last_updated":"2020-02-16T00:42:48Z","snapshot_observed_at":"2026-08-17T15:19:05.606929Z","submitted_at":"2019-07-10T21:11:13Z","title":"GraphSAINT: Graph Sampling Based Inductive Learning Method","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1907.04931","snapshot_observed_at":"2026-08-11T00:24:53.939265Z","title":"Graphsaint: Graph sampling based inductive learning method,","venue":null,"work_id":null,"year":1907},"citing_paper":{"arxiv_id":"2608.07733","last_updated":"2026-08-07T19:55:45Z","snapshot_observed_at":"2026-08-17T08:04:24.402148Z","submitted_at":"2026-08-07T19:55:45Z","title":"LGNNIC: Acceleration of Large-Scale GNN Training using SmartNICs","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-11T00:24:53.939265Z"},"links":{"cited_paper":"/paper/1907.04931","citing_paper":"/paper/2608.07733"},"observation_digest":"sha256:399cee29a8f796892a34a074a2d4500609000cb7d23279542cbd0c7dd4695bb4","observation_id":"3a539935-9515-4825-9f19-69cb56d735ba","resolution":{"observed_at":"2026-08-11T00:24:53.939265Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/1907.04931/citation-record","integrity":"/paper/1907.04931/integrity","json":"/paper/1907.04931/citation-record.json","paper":"/paper/1907.04931"},"outbound":[],"paper":{"arxiv_id":"1907.04931","last_updated":"2020-02-16T00:42:48Z","latest_version":4,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-17T15:19:05.606929Z","submitted_at":"2019-07-10T21:11:13Z","title":"GraphSAINT: Graph Sampling Based Inductive Learning Method"},"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-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"thesis":"As of 20 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 48 inbound Pith citation observations for arXiv:1907.04931."}