{"as_of":"2026-08-07T10:11:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:00b2add71d07002aed02881830d8600db3a55f7250a272384eeb87175d2aba3e","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":24,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":24,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+00:00","state":"measured"},{"denominator":24,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":24,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T19:25:28.211581Z","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-05T00:16:40.110456Z","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:0b0c6b33887bc90e8a132957b99a97fac262d9303df996b73c9ef0d3e2345452","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T00:16:40.110456Z","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-07T03:05:36.777394Z","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:b16730cf3b3dc1b7649240791ab37d0ede218f74e2ba35ab00aec66eb00e05a1","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-05T00:16:40.110456Z","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-06T18:50:33.528644Z","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:e115002ee09f75c6f892e5189bc5dfc617ced9ce7631b8ad6a30c004c555bd63","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-05T00:16:40.110456Z","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-06T11:41:57.266296Z","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:48fc5cbc1be2661783e77f7f8c9f0223daf7e5ffbaf38bb5bd6fae2d2eeb35a0","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-05T00:16:40.110456Z","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-06T10:18:46.396679Z","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:0c64b0bcf90057410b5a19eda51fdc28a00139bd717caf3ce5da34be5755b24c","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-05T00:16:40.110456Z","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-06T22:51:34.706117Z","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:b22b8c7a4f26236a992333c6c5847d4d918c8075957f2ce6c17a716efbc246be","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-05T00:16:40.110456Z","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-06T22:51:22.930035Z","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:0c43d4b5b36c0185694eb9f9258b2f76248e8ed0972ca83dbe7fc840fae097bb","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-05T00:16:40.110456Z","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":"2025-09-08T15:03:05Z","snapshot_observed_at":"2026-08-04T23:12:20.493932Z","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:9023bf843ffd05fa449de7a108c5c1dd7d56e1c40feb43182a6964cd4b4fdcf8","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-05T00:16:40.110456Z","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-04T08:28:01.204538Z","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:f46f24232f8bae06808c53fdcb4691e5ba46e05c0c8a21e0b1e2e752ec82fb70","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-05T00:16:40.110456Z","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-06T22:50:41.268674Z","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:35da9bfc07a8b47ba28546c4feb113d78e6b0c8c2c1ad60e0ff1805dc77dd950","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-05T00:16:40.110456Z","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-07T00:24:22.833010Z","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:5cc8e303bfd88eb4218799535837906429b17b90ba374b5b2efcfd80f0b25ad3","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-05T00:16:40.110456Z","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-07-06T22:51:57.889822Z","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:3e89e936893aee60700af9412f4edee522571193545d3e8686d671e210db4ab6","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T00:16:40.110456Z","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-07-06T23:12:52.141592Z","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:3758846942aa0b361e874a28196882170d53aeb1515222d91d430f463dd0e267","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T00:16:40.110456Z","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-07-06T23:20:33.816373Z","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:15e0af7ea914d0d38fa1162be40b5cf5b2da8527671ca5601cf97562df0aadad","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T00:16:40.110456Z","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-07-06T23:20:33.816373Z","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:6609f09c55af2eef0ab1256eb8af2d10b53ce654613cdc30da3d6508e714cc39","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T00:16:40.110456Z","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-07-06T23:27:52.850836Z","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:9ce8bdf7bc354cef3ccbca92a5cb045b37124863b2585a9ba7fd25f3e89bd2a6","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T00:16:40.110456Z","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-07-06T23:27:52.850836Z","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:c512c041ae694e2275438881ab34a724d681209b60bf373e98da97ccfa5db5c0","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T00:16:40.110456Z","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-07-06T23:28:50.117638Z","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:b4e4fa30606e3b47556618793d15c5f7b229e203a4ed0ab770a72f231503fbb1","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T00:16:40.110456Z","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-07-06T23:29:42.583875Z","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:613f92d5b88f522390e7192634670c3a0607b7a3916cd7ecaa4e044dbf1d601f","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T00:16:40.110456Z","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-03T07:39:40.135312Z","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:36cbd5986954f70caeae1710b8a2af5523f9209e8aa78257897fc714129f6f98","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T00:16:40.110456Z","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:dce06d95d6ea7fe369b2cb0f0f573b0dd97403c3265c8508304778b1cef6e7c5","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T00:16:40.110456Z","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-07-06T23:48:44.159537Z","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:ee1e594decc5abf127da42ec5b70ebfb3715d8d38f20c062a9b85a28b57c1bcf","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T00:16:40.110456Z","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-03T03:23:46.290922Z","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:22ea3a6efc9d83f62d73cdb4c1512ec54f63231c9eda6b4abdf73140cb33a17e","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T00:16:40.110456Z","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-06T23:36:55.839939Z","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:053d16a197f42ac2e801ae996ec2eaf1c06e3c999de1136a12a389149c09cf50","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"}}],"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-05T00:16:40.110456Z","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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 7 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 24 inbound Pith citation observations for arXiv:1907.04931."}