{"as_of":"2026-08-08T21:10:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:f089dd0b49d79dbc0655bd4442be5e29834984b696d3c127d2101de00edc0f10","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":50,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":50,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":50,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":50,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-08T18:19:35.762953Z","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-04T16:19:56.407223Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2007.02901","last_updated":"2022-01-09T23:19:38Z","snapshot_observed_at":"2026-07-06T09:35:50.977461Z","submitted_at":"2020-07-06T17:25:47Z","title":"Wiki-CS: A Wikipedia-Based Benchmark for Graph Neural Networks","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2007.02901","snapshot_observed_at":"2026-08-08T18:19:35.762953Z","title":"and Cangea, C","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2502.05724","last_updated":"2025-05-21T07:07:55Z","snapshot_observed_at":"2026-08-08T18:10:43.991042Z","submitted_at":"2025-02-08T23:51:05Z","title":"Rethinking Link Prediction for Directed Graphs","version":2},"reference_index":2000,"source":"pdf_text","source_observed_at":"2026-08-08T18:19:35.762953Z"},"links":{"cited_paper":"/paper/2007.02901","citing_paper":"/paper/2502.05724"},"observation_digest":"sha256:c973371457e1c722f84f8d09c73ec7459f67a47a56f7d6ce04292ba77fb0112a","observation_id":"97535510-0e0d-495b-a54d-40c8d4c99180","resolution":{"observed_at":"2026-08-08T18:19:35.762953Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2007.02901","last_updated":"2022-01-09T23:19:38Z","snapshot_observed_at":"2026-07-06T09:35:50.977461Z","submitted_at":"2020-07-06T17:25:47Z","title":"Wiki-CS: A Wikipedia-Based Benchmark for Graph Neural Networks","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2007.02901","snapshot_observed_at":"2026-08-08T13:03:13.930965Z","title":"Wiki-cs: A wikipedia-based benchmark for graph neural networks.arXiv preprint arXiv:2007.02901, 2020","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2502.07364","last_updated":"2025-05-29T01:54:10Z","snapshot_observed_at":"2026-08-08T12:56:03.938601Z","submitted_at":"2025-02-11T08:36:38Z","title":"Effects of Dropout on Performance in Long-range Graph Learning Tasks","version":2},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-08T13:03:13.930965Z"},"links":{"cited_paper":"/paper/2007.02901","citing_paper":"/paper/2502.07364"},"observation_digest":"sha256:9b4af81205d6cd31bc3a043b6f93814e01b90537f617d6f4a0768a4783a72078","observation_id":"df81117f-8e8f-468a-a2f2-a270cf1211dc","resolution":{"observed_at":"2026-08-08T13:03:13.930965Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2007.02901","last_updated":"2022-01-09T23:19:38Z","snapshot_observed_at":"2026-07-06T09:35:50.977461Z","submitted_at":"2020-07-06T17:25:47Z","title":"Wiki-CS: A Wikipedia-Based Benchmark for Graph Neural Networks","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2007.02901","snapshot_observed_at":"2026-08-07T14:28:34.567236Z","title":"and Cangea, C","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2505.19024","last_updated":"2025-05-25T08:20:34Z","snapshot_observed_at":"2026-08-07T14:19:19.197066Z","submitted_at":"2025-05-25T08:20:34Z","title":"Learn Beneficial Noise as Graph Augmentation","version":1},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-07T14:28:34.567236Z"},"links":{"cited_paper":"/paper/2007.02901","citing_paper":"/paper/2505.19024"},"observation_digest":"sha256:078f871ff07ed4c188b22b2056a6810de436f4763cc3bd66e4777b54021cf981","observation_id":"0821edb3-541e-46df-9aeb-4b09348b9dcf","resolution":{"observed_at":"2026-08-07T14:28:34.567236Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2007.02901","last_updated":"2022-01-09T23:19:38Z","snapshot_observed_at":"2026-07-06T09:35:50.977461Z","submitted_at":"2020-07-06T17:25:47Z","title":"Wiki-CS: A Wikipedia-Based Benchmark for Graph Neural Networks","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2007.02901","snapshot_observed_at":"2026-08-07T12:54:21.034872Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2505.23345","last_updated":"2025-06-15T04:04:46Z","snapshot_observed_at":"2026-08-07T12:45:32.756495Z","submitted_at":"2025-05-29T11:10:11Z","title":"Graph Positional Autoencoders as Self-supervised Learners","version":2},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-07T12:54:21.034872Z"},"links":{"cited_paper":"/paper/2007.02901","citing_paper":"/paper/2505.23345"},"observation_digest":"sha256:41568a671056453642b6e206c278016c42b0ceb5935fc3cbe392ce6cd1eabbca","observation_id":"8c87cb08-bf5d-4588-924d-202772e2c58d","resolution":{"observed_at":"2026-08-07T12:54:21.034872Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2007.02901","last_updated":"2022-01-09T23:19:38Z","snapshot_observed_at":"2026-07-06T09:35:50.977461Z","submitted_at":"2020-07-06T17:25:47Z","title":"Wiki-CS: A Wikipedia-Based Benchmark for Graph Neural Networks","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2007.02901","snapshot_observed_at":"2026-08-07T10:36:54.534673Z","title":"and Cangea, C","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2506.05039","last_updated":"2025-06-05T13:43:24Z","snapshot_observed_at":"2026-08-08T19:10:53.227687Z","submitted_at":"2025-06-05T13:43:24Z","title":"iN2V: Bringing Transductive Node Embeddings to Inductive Graphs","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-07T10:36:54.534673Z"},"links":{"cited_paper":"/paper/2007.02901","citing_paper":"/paper/2506.05039"},"observation_digest":"sha256:0d45797f74ae81674ad7d9967a31ee5cbdac26c5b23126158779fc0c72f3ee70","observation_id":"3886432c-2490-4fcc-877b-2f31a5b29601","resolution":{"observed_at":"2026-08-07T10:36:54.534673Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2007.02901","last_updated":"2022-01-09T23:19:38Z","snapshot_observed_at":"2026-07-06T09:35:50.977461Z","submitted_at":"2020-07-06T17:25:47Z","title":"Wiki-CS: A Wikipedia-Based Benchmark for Graph Neural Networks","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2007.02901","snapshot_observed_at":"2026-08-07T10:30:12.609891Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2506.05214","last_updated":"2025-06-05T16:28:12Z","snapshot_observed_at":"2026-08-07T10:20:11.830589Z","submitted_at":"2025-06-05T16:28:12Z","title":"Mitigating Degree Bias Adaptively with Hard-to-Learn Nodes in Graph Contrastive Learning","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-07T10:30:12.609891Z"},"links":{"cited_paper":"/paper/2007.02901","citing_paper":"/paper/2506.05214"},"observation_digest":"sha256:5227866a098ba2f9dd6f02d1136154aaa2a06da55ab1bee56ddb4300bf1c7ec7","observation_id":"e40c20d7-d3b8-4b14-97c7-de3e6cddd1b8","resolution":{"observed_at":"2026-08-07T10:30:12.609891Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2007.02901","last_updated":"2022-01-09T23:19:38Z","snapshot_observed_at":"2026-07-06T09:35:50.977461Z","submitted_at":"2020-07-06T17:25:47Z","title":"Wiki-CS: A Wikipedia-Based Benchmark for Graph Neural Networks","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2007.02901","snapshot_observed_at":"2026-08-07T05:42:42.158643Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.07288","last_updated":"2025-08-01T08:06:28Z","snapshot_observed_at":"2026-08-07T05:34:49.256951Z","submitted_at":"2025-06-08T21:21:12Z","title":"EVINET: Towards Open-World Graph Learning via Evidential Reasoning Network","version":3},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-07T05:42:42.158643Z"},"links":{"cited_paper":"/paper/2007.02901","citing_paper":"/paper/2506.07288"},"observation_digest":"sha256:e8f3c9dc604c9e79bf2fdff7143d0f0c60f47ef6e79b45d2e36b8b5d9cc5df1c","observation_id":"b9da3af4-5fde-4657-9b33-037fc8c269e3","resolution":{"observed_at":"2026-08-07T05:42:42.158643Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2007.02901","last_updated":"2022-01-09T23:19:38Z","snapshot_observed_at":"2026-07-06T09:35:50.977461Z","submitted_at":"2020-07-06T17:25:47Z","title":"Wiki-CS: A Wikipedia-Based Benchmark for Graph Neural Networks","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2007.02901","snapshot_observed_at":"2026-08-07T00:55:54.787135Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2506.12468","last_updated":"2025-06-17T03:17:11Z","snapshot_observed_at":"2026-08-07T00:46:40.868394Z","submitted_at":"2025-06-14T12:14:15Z","title":"Delving into Instance-Dependent Label Noise in Graph Data: A Comprehensive Study and Benchmark","version":2},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-07T00:55:54.787135Z"},"links":{"cited_paper":"/paper/2007.02901","citing_paper":"/paper/2506.12468"},"observation_digest":"sha256:3dbaedcf2cfbc281f6ef2642c0a96c0219a5930d97beb0020af38624131a1561","observation_id":"b7a826a9-fff9-4dde-b1a9-f832eb6c0152","resolution":{"observed_at":"2026-08-07T00:55:54.787135Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2007.02901","last_updated":"2022-01-09T23:19:38Z","snapshot_observed_at":"2026-07-06T09:35:50.977461Z","submitted_at":"2020-07-06T17:25:47Z","title":"Wiki-CS: A Wikipedia-Based Benchmark for Graph Neural Networks","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2007.02901","snapshot_observed_at":"2026-08-06T14:45:06.870257Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2507.18153","last_updated":"2025-07-25T04:04:58Z","snapshot_observed_at":"2026-08-08T20:40:22.132752Z","submitted_at":"2025-07-24T07:39:07Z","title":"When Noisy Labels Meet Class Imbalance on Graphs: A Graph Augmentation Method with LLM and Pseudo Label","version":2},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-06T14:45:06.870257Z"},"links":{"cited_paper":"/paper/2007.02901","citing_paper":"/paper/2507.18153"},"observation_digest":"sha256:d388dc1a2e15c720e3fa75ab190c30e0af386e4122c9f2b968265504994ae719","observation_id":"c04b7827-1c74-4765-baa3-85e4e0f1bf79","resolution":{"observed_at":"2026-08-06T14:45:06.870257Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2007.02901","last_updated":"2022-01-09T23:19:38Z","snapshot_observed_at":"2026-07-06T09:35:50.977461Z","submitted_at":"2020-07-06T17:25:47Z","title":"Wiki-CS: A Wikipedia-Based Benchmark for Graph Neural Networks","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2007.02901","snapshot_observed_at":"2026-08-06T15:51:12.824411Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2507.19526","last_updated":"2025-07-20T09:18:02Z","snapshot_observed_at":"2026-08-07T21:17:18.027532Z","submitted_at":"2025-07-20T09:18:02Z","title":"Quantizing Text-attributed Graphs for Semantic-Structural Integration","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-06T15:51:12.824411Z"},"links":{"cited_paper":"/paper/2007.02901","citing_paper":"/paper/2507.19526"},"observation_digest":"sha256:861c2a1099db79b09f7692f2cb1cf825a6b01bb9cbc44f540f8ddd13933203ef","observation_id":"57f5205c-0a85-4baf-ab52-fb09cf8a4643","resolution":{"observed_at":"2026-08-06T15:51:12.824411Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2007.02901","last_updated":"2022-01-09T23:19:38Z","snapshot_observed_at":"2026-07-06T09:35:50.977461Z","submitted_at":"2020-07-06T17:25:47Z","title":"Wiki-CS: A Wikipedia-Based Benchmark for Graph Neural Networks","version":2},"cited_work":{"arxiv_id":"2007.02901","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2007.02901","snapshot_observed_at":"2026-07-04T16:19:56.407223Z","title":"and Cangea, C","venue":null,"work_id":"e4ceb7de-e4e0-4a74-94a6-4d8848ca54e3","year":2007},"citing_paper":{"arxiv_id":"2508.07117","last_updated":"2026-04-22T15:08:37Z","snapshot_observed_at":"2026-07-06T22:10:35.711171Z","submitted_at":"2025-08-09T23:22:38Z","title":"From Nodes to Narratives: Explaining Graph Neural Networks with LLMs and Graph Context","version":3},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-18T23:30:11.590032Z"},"links":{"cited_paper":"/paper/2007.02901","citing_paper":"/paper/2508.07117"},"observation_digest":"sha256:8c795d0096278419f2805ef89eced9ef7a99905094f551dcc58a4f1d18b66c79","observation_id":"f52bc730-4656-4f8a-8303-83b748e464a2","resolution":{"observed_at":"2026-05-18T23:31:54.457662Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2007.02901","last_updated":"2022-01-09T23:19:38Z","snapshot_observed_at":"2026-07-06T09:35:50.977461Z","submitted_at":"2020-07-06T17:25:47Z","title":"Wiki-CS: A Wikipedia-Based Benchmark for Graph Neural Networks","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2007.02901","snapshot_observed_at":"2026-08-05T15:39:56.216787Z","title":"Wiki-cs: A wikipedia-based bench- mark for graph neural networks,","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2508.19641","last_updated":"2025-08-27T07:37:52Z","snapshot_observed_at":"2026-08-08T08:19:58.466694Z","submitted_at":"2025-08-27T07:37:52Z","title":"Intellectual Property in Graph-Based Machine Learning as a Service: Attacks and Defenses","version":1},"reference_index":197,"source":"pdf_text","source_observed_at":"2026-08-05T15:39:56.216787Z"},"links":{"cited_paper":"/paper/2007.02901","citing_paper":"/paper/2508.19641"},"observation_digest":"sha256:74f9841baa9fba76ddf59f64e7a508472ba9b47039f59a8c760c51cd7a233203","observation_id":"7d13d513-5a3b-4a29-a10f-5bc804660b9b","resolution":{"observed_at":"2026-08-05T15:39:56.216787Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2007.02901","last_updated":"2022-01-09T23:19:38Z","snapshot_observed_at":"2026-07-06T09:35:50.977461Z","submitted_at":"2020-07-06T17:25:47Z","title":"Wiki-CS: A Wikipedia-Based Benchmark for Graph Neural Networks","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2007.02901","snapshot_observed_at":"2026-08-05T14:47:53.885634Z","title":"Wiki-cs: A wikipedia-based benchmark for graph neural net- works.arXiv preprint arXiv:2007.02901,","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2508.20906","last_updated":"2026-06-22T12:08:08Z","snapshot_observed_at":"2026-08-05T14:47:53.287879Z","submitted_at":"2025-08-28T15:36:37Z","title":"Turning Tabular Foundation Models into Graph Foundation Models","version":3},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-05T14:47:53.885634Z"},"links":{"cited_paper":"/paper/2007.02901","citing_paper":"/paper/2508.20906"},"observation_digest":"sha256:1921a054c2a4db66c453d467c2cfcb1cdbef2a943dafa387e00affda8e779777","observation_id":"bf7c9955-b711-45c5-96f0-6a2084db6f42","resolution":{"observed_at":"2026-08-05T14:47:53.885634Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2007.02901","last_updated":"2022-01-09T23:19:38Z","snapshot_observed_at":"2026-07-06T09:35:50.977461Z","submitted_at":"2020-07-06T17:25:47Z","title":"Wiki-CS: A Wikipedia-Based Benchmark for Graph Neural Networks","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2007.02901","snapshot_observed_at":"2026-08-04T11:30:51.047069Z","title":"Wiki-cs: A wikipedia-based benchmark for graph neural networks","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2510.04567","last_updated":"2026-06-10T08:33:20Z","snapshot_observed_at":"2026-08-07T03:05:55.764331Z","submitted_at":"2025-10-06T08:09:15Z","title":"GILT: An LLM-Free, Tuning-Free Graph Foundational Model for In-Context Learning","version":3},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-04T11:30:51.047069Z"},"links":{"cited_paper":"/paper/2007.02901","citing_paper":"/paper/2510.04567"},"observation_digest":"sha256:71bc306f6eea7818ef68011c992e5d51208c3bce57ae9b846d518b97657a746f","observation_id":"251860ae-6cbe-46c7-ba94-81958a84b818","resolution":{"observed_at":"2026-08-04T11:30:51.047069Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2007.02901","last_updated":"2022-01-09T23:19:38Z","snapshot_observed_at":"2026-07-06T09:35:50.977461Z","submitted_at":"2020-07-06T17:25:47Z","title":"Wiki-CS: A Wikipedia-Based Benchmark for Graph Neural Networks","version":2},"cited_work":{"arxiv_id":"2007.02901","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2007.02901","snapshot_observed_at":"2026-07-04T16:19:56.407223Z","title":"and Cangea, C","venue":null,"work_id":"e4ceb7de-e4e0-4a74-94a6-4d8848ca54e3","year":2007},"citing_paper":{"arxiv_id":"2510.08952","last_updated":"2026-05-05T05:35:19Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-10-10T02:59:19Z","title":"When LLM Agents Meet Graph Optimization: An Automated Data Quality Improvement Approach","version":4},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-05-18T08:45:51.992431Z"},"links":{"cited_paper":"/paper/2007.02901","citing_paper":"/paper/2510.08952"},"observation_digest":"sha256:63ced77f57e3fc6d401d1e87337479051430c381d35807f5c68673e7d3b971c4","observation_id":"3f7aaf59-4c08-4e82-937a-cd29482e9cdf","resolution":{"observed_at":"2026-05-18T08:46:07.705383Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2007.02901","last_updated":"2022-01-09T23:19:38Z","snapshot_observed_at":"2026-07-06T09:35:50.977461Z","submitted_at":"2020-07-06T17:25:47Z","title":"Wiki-CS: A Wikipedia-Based Benchmark for Graph Neural Networks","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2007.02901","snapshot_observed_at":"2026-08-04T09:18:32.201014Z","title":"Wiki-cs: A wikipedia-based benchmark for graph neural networks,","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2510.16311","last_updated":"2026-06-18T15:18:42Z","snapshot_observed_at":"2026-08-04T17:53:13.686912Z","submitted_at":"2025-10-18T02:46:53Z","title":"Toward General Digraph Contrastive Learning: A Dual Spatial Perspective","version":3},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-04T09:18:32.201014Z"},"links":{"cited_paper":"/paper/2007.02901","citing_paper":"/paper/2510.16311"},"observation_digest":"sha256:c5485ef07c94196904b9f5479f916f74961b526a965d2699e1eca1a1a7e7d941","observation_id":"06f4439a-3834-4523-85e0-f620260c0f12","resolution":{"observed_at":"2026-08-04T09:18:32.201014Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2007.02901","last_updated":"2022-01-09T23:19:38Z","snapshot_observed_at":"2026-07-06T09:35:50.977461Z","submitted_at":"2020-07-06T17:25:47Z","title":"Wiki-CS: A Wikipedia-Based Benchmark for Graph Neural Networks","version":2},"cited_work":{"arxiv_id":"2007.02901","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2007.02901","snapshot_observed_at":"2026-07-04T16:19:56.407223Z","title":"and Cangea, C","venue":null,"work_id":"e4ceb7de-e4e0-4a74-94a6-4d8848ca54e3","year":2007},"citing_paper":{"arxiv_id":"2512.24062","last_updated":"2026-04-07T08:07:30Z","snapshot_observed_at":"2026-07-06T22:40:23.205898Z","submitted_at":"2025-12-30T08:11:37Z","title":"Energy-Balanced Hyperspherical Graph Representation Learning via Structural Binding and Entropic Dispersion","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-05-16T19:20:32.868784Z"},"links":{"cited_paper":"/paper/2007.02901","citing_paper":"/paper/2512.24062"},"observation_digest":"sha256:b7bcc7aefe01d47989ebb764e66b663d9964b90f03156bdd6fd99eb01b4d67e8","observation_id":"78aa819f-569c-4731-ba0a-d29c8de01f79","resolution":{"observed_at":"2026-05-16T19:21:12.135441Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2007.02901","last_updated":"2022-01-09T23:19:38Z","snapshot_observed_at":"2026-07-06T09:35:50.977461Z","submitted_at":"2020-07-06T17:25:47Z","title":"Wiki-CS: A Wikipedia-Based Benchmark for Graph Neural Networks","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2007.02901","snapshot_observed_at":"2026-08-03T07:43:53.861189Z","title":"URL https: //doi.org/10.1023/A:1009953814988","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2601.19449","last_updated":"2026-06-03T09:24:25Z","snapshot_observed_at":"2026-08-03T07:43:44.694621Z","submitted_at":"2026-01-27T10:36:31Z","title":"Fixed Aggregation Features Can Rival GNNs","version":2},"reference_index":2000,"source":"pdf_text","source_observed_at":"2026-08-03T07:43:53.861189Z"},"links":{"cited_paper":"/paper/2007.02901","citing_paper":"/paper/2601.19449"},"observation_digest":"sha256:f08d58619037e43f1ec740a7781050559e451465842f26aa43dfdaf478beaaee","observation_id":"1282ec0f-3e10-4d2c-b3bd-b3177002e708","resolution":{"observed_at":"2026-08-03T07:43:53.861189Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2007.02901","last_updated":"2022-01-09T23:19:38Z","snapshot_observed_at":"2026-07-06T09:35:50.977461Z","submitted_at":"2020-07-06T17:25:47Z","title":"Wiki-CS: A Wikipedia-Based Benchmark for Graph Neural Networks","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2007.02901","snapshot_observed_at":"2026-08-04T06:16:57.728507Z","title":"and Cangea, C","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2601.21369","last_updated":"2026-08-01T12:38:31Z","snapshot_observed_at":"2026-08-06T23:10:55.699930Z","submitted_at":"2026-01-29T07:50:00Z","title":"Rethinking Federated Graph Foundation Models: A Graph-Language Alignment-based Approach","version":2},"reference_index":2017,"source":"pdf_text","source_observed_at":"2026-08-04T06:16:57.728507Z"},"links":{"cited_paper":"/paper/2007.02901","citing_paper":"/paper/2601.21369"},"observation_digest":"sha256:7338e76da1a24bb5148a59da6713e8904afeb3dee388f2c5a1703baf63eaff42","observation_id":"9e65ecd7-eaf7-46d7-ae16-2066456f4b4d","resolution":{"observed_at":"2026-08-04T06:16:57.728507Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2007.02901","last_updated":"2022-01-09T23:19:38Z","snapshot_observed_at":"2026-07-06T09:35:50.977461Z","submitted_at":"2020-07-06T17:25:47Z","title":"Wiki-CS: A Wikipedia-Based Benchmark for Graph Neural Networks","version":2},"cited_work":{"arxiv_id":"2007.02901","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2007.02901","snapshot_observed_at":"2026-07-04T16:19:56.407223Z","title":"and Cangea, C","venue":null,"work_id":"e4ceb7de-e4e0-4a74-94a6-4d8848ca54e3","year":2007},"citing_paper":{"arxiv_id":"2602.11629","last_updated":"2026-05-22T02:58:25Z","snapshot_observed_at":"2026-08-02T17:31:07.804176Z","submitted_at":"2026-02-12T06:25:21Z","title":"GP2F: Cross-Domain Graph Prompting with Adaptive Fusion of Pre-trained Graph Neural Networks","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-25T07:34:42.234291Z"},"links":{"cited_paper":"/paper/2007.02901","citing_paper":"/paper/2602.11629"},"observation_digest":"sha256:0614c3c272b1e7f828c800943d787f8c3d818791c9ea15efdd9ad3302ef7bd61","observation_id":"d09b3b8b-84c2-4d1d-85c0-65878dbc3a8d","resolution":{"observed_at":"2026-05-25T07:35:28.051068Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2007.02901","last_updated":"2022-01-09T23:19:38Z","snapshot_observed_at":"2026-07-06T09:35:50.977461Z","submitted_at":"2020-07-06T17:25:47Z","title":"Wiki-CS: A Wikipedia-Based Benchmark for Graph Neural Networks","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2007.02901","snapshot_observed_at":"2026-08-03T00:07:41.193389Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2602.11641","last_updated":"2026-05-31T02:32:04Z","snapshot_observed_at":"2026-08-04T07:46:12.428271Z","submitted_at":"2026-02-12T06:53:35Z","title":"Both Topology and Text Matter: Revisiting LLM-guided Out-of-Distribution Detection on Text-attributed Graphs","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-03T00:07:41.193389Z"},"links":{"cited_paper":"/paper/2007.02901","citing_paper":"/paper/2602.11641"},"observation_digest":"sha256:f83d0a341edc353c0e2f52016b8dad1cc606c1f87970090a20fbff1c46c3b420","observation_id":"caebab9b-ba05-4752-9146-e647aecee8cc","resolution":{"observed_at":"2026-08-03T00:07:41.193389Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2007.02901","last_updated":"2022-01-09T23:19:38Z","snapshot_observed_at":"2026-07-06T09:35:50.977461Z","submitted_at":"2020-07-06T17:25:47Z","title":"Wiki-CS: A Wikipedia-Based Benchmark for Graph Neural Networks","version":2},"cited_work":{"arxiv_id":"2007.02901","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2007.02901","snapshot_observed_at":"2026-07-04T16:19:56.407223Z","title":"and Cangea, C","venue":null,"work_id":"e4ceb7de-e4e0-4a74-94a6-4d8848ca54e3","year":2007},"citing_paper":{"arxiv_id":"2602.17071","last_updated":"2026-04-11T12:06:12Z","snapshot_observed_at":"2026-08-01T04:28:59.324747Z","submitted_at":"2026-02-19T04:26:57Z","title":"AdvSynGNN: Structure-Adaptive Graph Neural Nets via Adversarial Synthesis and Self-Corrective Propagation","version":2},"reference_index":77,"source":"pdf_text","source_observed_at":"2026-05-15T21:30:43.925179Z"},"links":{"cited_paper":"/paper/2007.02901","citing_paper":"/paper/2602.17071"},"observation_digest":"sha256:e1ef755eb2b7f2d60214ec5683ede1d7b89436f9ac02f1de8def8118ef54b57d","observation_id":"588e436c-eb4f-4130-b2cb-c8a504521124","resolution":{"observed_at":"2026-05-15T21:31:39.404771Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2007.02901","last_updated":"2022-01-09T23:19:38Z","snapshot_observed_at":"2026-07-06T09:35:50.977461Z","submitted_at":"2020-07-06T17:25:47Z","title":"Wiki-CS: A Wikipedia-Based Benchmark for Graph Neural Networks","version":2},"cited_work":{"arxiv_id":"2007.02901","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2007.02901","snapshot_observed_at":"2026-07-04T16:19:56.407223Z","title":"and Cangea, C","venue":null,"work_id":"e4ceb7de-e4e0-4a74-94a6-4d8848ca54e3","year":2007},"citing_paper":{"arxiv_id":"2603.02938","last_updated":"2026-05-21T07:56:15Z","snapshot_observed_at":"2026-07-06T22:47:41.997192Z","submitted_at":"2026-03-03T12:47:44Z","title":"Beyond One-Size-Fits-All: Adaptive Subgraph Denoising for Zero-Shot Graph Learning with Large Language Models","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-05-22T10:30:01.910920Z"},"links":{"cited_paper":"/paper/2007.02901","citing_paper":"/paper/2603.02938"},"observation_digest":"sha256:e916ea07ed85a3ec24fc6a2e6322157ea269d874faec89adecedb5e546dff458","observation_id":"8faab4c6-92d2-4b06-b320-6620dff9822b","resolution":{"observed_at":"2026-05-22T10:31:25.509877Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2007.02901","last_updated":"2022-01-09T23:19:38Z","snapshot_observed_at":"2026-07-06T09:35:50.977461Z","submitted_at":"2020-07-06T17:25:47Z","title":"Wiki-CS: A Wikipedia-Based Benchmark for Graph Neural Networks","version":2},"cited_work":{"arxiv_id":"2007.02901","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2007.02901","snapshot_observed_at":"2026-07-04T16:19:56.407223Z","title":"and Cangea, C","venue":null,"work_id":"e4ceb7de-e4e0-4a74-94a6-4d8848ca54e3","year":2007},"citing_paper":{"arxiv_id":"2604.06391","last_updated":"2026-04-07T19:21:21Z","snapshot_observed_at":"2026-07-06T22:54:53.308309Z","submitted_at":"2026-04-07T19:21:21Z","title":"Toward a universal foundation model for graph-structured data","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-05-10T18:31:39.746121Z"},"links":{"cited_paper":"/paper/2007.02901","citing_paper":"/paper/2604.06391"},"observation_digest":"sha256:2c48753ed90cea85d295f0fc1329116feaaf83fd621f03bee34caae4e69b2ebc","observation_id":"a217ee93-e637-4c0e-a692-0c6ded0aa527","resolution":{"observed_at":"2026-05-11T00:25:51.998524Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2007.02901","last_updated":"2022-01-09T23:19:38Z","snapshot_observed_at":"2026-07-06T09:35:50.977461Z","submitted_at":"2020-07-06T17:25:47Z","title":"Wiki-CS: A Wikipedia-Based Benchmark for Graph Neural Networks","version":2},"cited_work":{"arxiv_id":"2007.02901","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2007.02901","snapshot_observed_at":"2026-07-04T16:19:56.407223Z","title":"and Cangea, C","venue":null,"work_id":"e4ceb7de-e4e0-4a74-94a6-4d8848ca54e3","year":2007},"citing_paper":{"arxiv_id":"2604.08980","last_updated":"2026-04-10T05:35:21Z","snapshot_observed_at":"2026-07-06T22:57:59.555972Z","submitted_at":"2026-04-10T05:35:21Z","title":"Neighbourhood Transformer: Switchable Attention for Monophily-Aware Graph Learning","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-05-10T18:00:47.753649Z"},"links":{"cited_paper":"/paper/2007.02901","citing_paper":"/paper/2604.08980"},"observation_digest":"sha256:1e850b8c435a94a54ff9121c48a5792903e4cc2c200f5cc54cd48fc3cd51ae7a","observation_id":"d2ebbfbf-c0b7-4e2f-a4b7-af30ef829d80","resolution":{"observed_at":"2026-05-11T05:40:58.454333Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2007.02901","last_updated":"2022-01-09T23:19:38Z","snapshot_observed_at":"2026-07-06T09:35:50.977461Z","submitted_at":"2020-07-06T17:25:47Z","title":"Wiki-CS: A Wikipedia-Based Benchmark for Graph Neural Networks","version":2},"cited_work":{"arxiv_id":"2007.02901","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2007.02901","snapshot_observed_at":"2026-07-04T16:19:56.407223Z","title":"and Cangea, C","venue":null,"work_id":"e4ceb7de-e4e0-4a74-94a6-4d8848ca54e3","year":2007},"citing_paper":{"arxiv_id":"2604.14746","last_updated":"2026-04-16T07:57:11Z","snapshot_observed_at":"2026-07-29T20:39:55.580501Z","submitted_at":"2026-04-16T07:57:11Z","title":"Disentangle-then-Refine: LLM-Guided Decoupling and Structure-Aware Refinement for Graph Contrastive Learning","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-05-10T11:03:28.089449Z"},"links":{"cited_paper":"/paper/2007.02901","citing_paper":"/paper/2604.14746"},"observation_digest":"sha256:3c6f500002cc179d3f9e7d89fa62c9a57325217e1d3eb4969b096d43c4ebf3b3","observation_id":"94592973-37b5-4daa-a5f0-56689f84a5bc","resolution":{"observed_at":"2026-05-10T11:05:08.487784Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2007.02901","last_updated":"2022-01-09T23:19:38Z","snapshot_observed_at":"2026-07-06T09:35:50.977461Z","submitted_at":"2020-07-06T17:25:47Z","title":"Wiki-CS: A Wikipedia-Based Benchmark for Graph Neural Networks","version":2},"cited_work":{"arxiv_id":"2007.02901","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2007.02901","snapshot_observed_at":"2026-07-04T16:19:56.407223Z","title":"and Cangea, C","venue":null,"work_id":"e4ceb7de-e4e0-4a74-94a6-4d8848ca54e3","year":2007},"citing_paper":{"arxiv_id":"2604.17411","last_updated":"2026-04-19T12:36:18Z","snapshot_observed_at":"2026-07-06T23:04:32.734175Z","submitted_at":"2026-04-19T12:36:18Z","title":"DuConTE: Dual-Granularity Text Encoder with Topology-Constrained Attention for Text-attributed Graphs","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-05-10T05:49:52.864722Z"},"links":{"cited_paper":"/paper/2007.02901","citing_paper":"/paper/2604.17411"},"observation_digest":"sha256:44a63179e02c1933183b91a5fe97fadb64832e6cefd5a77d51a53cf9347c65dd","observation_id":"75e8afd5-88bd-49b8-bf75-b1b9fee54835","resolution":{"observed_at":"2026-05-10T05:51:09.931115Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2007.02901","last_updated":"2022-01-09T23:19:38Z","snapshot_observed_at":"2026-07-06T09:35:50.977461Z","submitted_at":"2020-07-06T17:25:47Z","title":"Wiki-CS: A Wikipedia-Based Benchmark for Graph Neural Networks","version":2},"cited_work":{"arxiv_id":"2007.02901","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2007.02901","snapshot_observed_at":"2026-07-04T16:19:56.407223Z","title":"and Cangea, C","venue":null,"work_id":"e4ceb7de-e4e0-4a74-94a6-4d8848ca54e3","year":2007},"citing_paper":{"arxiv_id":"2604.27462","last_updated":"2026-04-30T06:02:16Z","snapshot_observed_at":"2026-07-06T23:12:57.730833Z","submitted_at":"2026-04-30T06:02:16Z","title":"Improving Graph Few-shot Learning with Hyperbolic Space and Denoising Diffusion","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-07T09:51:38.704274Z"},"links":{"cited_paper":"/paper/2007.02901","citing_paper":"/paper/2604.27462"},"observation_digest":"sha256:cb8e646a68a414d6ad771ef5d48fe739a86e344c5ca4cb07c0cbda67207bbde9","observation_id":"c00b4cde-db82-4924-ba76-d4e0b08b8cd2","resolution":{"observed_at":"2026-05-12T09:41:26.633904Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2007.02901","last_updated":"2022-01-09T23:19:38Z","snapshot_observed_at":"2026-07-06T09:35:50.977461Z","submitted_at":"2020-07-06T17:25:47Z","title":"Wiki-CS: A Wikipedia-Based Benchmark for Graph Neural Networks","version":2},"cited_work":{"arxiv_id":"2007.02901","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2007.02901","snapshot_observed_at":"2026-07-04T16:19:56.407223Z","title":"and Cangea, C","venue":null,"work_id":"e4ceb7de-e4e0-4a74-94a6-4d8848ca54e3","year":2007},"citing_paper":{"arxiv_id":"2605.03514","last_updated":"2026-05-05T08:50:28Z","snapshot_observed_at":"2026-07-06T23:16:25.301792Z","submitted_at":"2026-05-05T08:50:28Z","title":"Revisiting Graph-Tokenizing Large Language Models: A Systematic Evaluation of Graph Token Understanding","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-05-07T16:49:54.542437Z"},"links":{"cited_paper":"/paper/2007.02901","citing_paper":"/paper/2605.03514"},"observation_digest":"sha256:fedd389f46687b0c6660a3ce8549f1547f537fd1676f415d2fbfef29c85c19c1","observation_id":"77faf7f7-c451-4d45-b57f-d29b9f448d0e","resolution":{"observed_at":"2026-05-12T11:01:31.294877Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2007.02901","last_updated":"2022-01-09T23:19:38Z","snapshot_observed_at":"2026-07-06T09:35:50.977461Z","submitted_at":"2020-07-06T17:25:47Z","title":"Wiki-CS: A Wikipedia-Based Benchmark for Graph Neural Networks","version":2},"cited_work":{"arxiv_id":"2007.02901","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2007.02901","snapshot_observed_at":"2026-07-04T16:19:56.407223Z","title":"and Cangea, C","venue":null,"work_id":"e4ceb7de-e4e0-4a74-94a6-4d8848ca54e3","year":2007},"citing_paper":{"arxiv_id":"2605.09862","last_updated":"2026-05-11T01:49:05Z","snapshot_observed_at":"2026-07-06T23:21:54.140120Z","submitted_at":"2026-05-11T01:49:05Z","title":"UFO: A Unified Flow-Oriented Framework for Robust Continual Graph Learning","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-05-12T05:11:57.184620Z"},"links":{"cited_paper":"/paper/2007.02901","citing_paper":"/paper/2605.09862"},"observation_digest":"sha256:dc43ce6a9056024d529df9992810650e772ed37b2f0a462347f9e54c7557e042","observation_id":"0cb28157-1ecc-4b6b-8732-fa8c35401a60","resolution":{"observed_at":"2026-05-12T05:31:25.368340Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2007.02901","last_updated":"2022-01-09T23:19:38Z","snapshot_observed_at":"2026-07-06T09:35:50.977461Z","submitted_at":"2020-07-06T17:25:47Z","title":"Wiki-CS: A Wikipedia-Based Benchmark for Graph Neural Networks","version":2},"cited_work":{"arxiv_id":"2007.02901","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2007.02901","snapshot_observed_at":"2026-07-04T16:19:56.407223Z","title":"and Cangea, C","venue":null,"work_id":"e4ceb7de-e4e0-4a74-94a6-4d8848ca54e3","year":2007},"citing_paper":{"arxiv_id":"2605.18579","last_updated":"2026-05-20T03:15:37Z","snapshot_observed_at":"2026-08-02T23:11:13.880944Z","submitted_at":"2026-05-18T15:56:19Z","title":"S2Aligner: Pair-Efficient and Transferable Pre-Training for Sparse Text-Attributed Graphs","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-05-20T12:49:18.671971Z"},"links":{"cited_paper":"/paper/2007.02901","citing_paper":"/paper/2605.18579"},"observation_digest":"sha256:a1f53cb5ea21ea59875a0dd75438d4d3c89a7a2de18093077f1ba629024dce2f","observation_id":"fa288478-6c66-402f-a382-e183142c2fe7","resolution":{"observed_at":"2026-05-20T12:53:17.646836Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2007.02901","last_updated":"2022-01-09T23:19:38Z","snapshot_observed_at":"2026-07-06T09:35:50.977461Z","submitted_at":"2020-07-06T17:25:47Z","title":"Wiki-CS: A Wikipedia-Based Benchmark for Graph Neural Networks","version":2},"cited_work":{"arxiv_id":"2007.02901","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2007.02901","snapshot_observed_at":"2026-07-04T16:19:56.407223Z","title":"and Cangea, C","venue":null,"work_id":"e4ceb7de-e4e0-4a74-94a6-4d8848ca54e3","year":2007},"citing_paper":{"arxiv_id":"2605.18579","last_updated":"2026-05-20T03:15:37Z","snapshot_observed_at":"2026-08-02T23:11:13.880944Z","submitted_at":"2026-05-18T15:56:19Z","title":"S2Aligner: Pair-Efficient and Transferable Pre-Training for Sparse Text-Attributed Graphs","version":3},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-05-21T07:55:11.088587Z"},"links":{"cited_paper":"/paper/2007.02901","citing_paper":"/paper/2605.18579"},"observation_digest":"sha256:cd44346be04d916a2f9b6f9c9e3211f5c78826e9829575831e4a87cb1d41178b","observation_id":"2d92804a-5eeb-4063-b40e-164802ad10f0","resolution":{"observed_at":"2026-05-21T07:59:50.854881Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2007.02901","last_updated":"2022-01-09T23:19:38Z","snapshot_observed_at":"2026-07-06T09:35:50.977461Z","submitted_at":"2020-07-06T17:25:47Z","title":"Wiki-CS: A Wikipedia-Based Benchmark for Graph Neural Networks","version":2},"cited_work":{"arxiv_id":"2007.02901","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2007.02901","snapshot_observed_at":"2026-07-04T16:19:56.407223Z","title":"and Cangea, C","venue":null,"work_id":"e4ceb7de-e4e0-4a74-94a6-4d8848ca54e3","year":2007},"citing_paper":{"arxiv_id":"2605.19916","last_updated":"2026-05-19T14:40:51Z","snapshot_observed_at":"2026-08-01T14:04:27.787769Z","submitted_at":"2026-05-19T14:40:51Z","title":"Fast and Featureless Node Representation Learning with Partial Pairwise Supervision","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-05-20T06:39:02.277629Z"},"links":{"cited_paper":"/paper/2007.02901","citing_paper":"/paper/2605.19916"},"observation_digest":"sha256:4ff19339922d81e78d4d1fb2eef50fcd4801d6b15f8fae922b8f75cadfb572f0","observation_id":"1acc81a9-0756-40a5-bf26-38aef5a3e1aa","resolution":{"observed_at":"2026-05-20T06:43:06.031345Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2007.02901","last_updated":"2022-01-09T23:19:38Z","snapshot_observed_at":"2026-07-06T09:35:50.977461Z","submitted_at":"2020-07-06T17:25:47Z","title":"Wiki-CS: A Wikipedia-Based Benchmark for Graph Neural Networks","version":2},"cited_work":{"arxiv_id":"2007.02901","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2007.02901","snapshot_observed_at":"2026-07-04T16:19:56.407223Z","title":"and Cangea, C","venue":null,"work_id":"e4ceb7de-e4e0-4a74-94a6-4d8848ca54e3","year":2007},"citing_paper":{"arxiv_id":"2605.20248","last_updated":"2026-05-18T06:47:41Z","snapshot_observed_at":"2026-07-06T23:30:53.900592Z","submitted_at":"2026-05-18T06:47:41Z","title":"Graph Transductive Sharpening: Leveraging Unlabeled Predictions in Node Classification","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-05-21T08:32:32.410473Z"},"links":{"cited_paper":"/paper/2007.02901","citing_paper":"/paper/2605.20248"},"observation_digest":"sha256:6ac68f7b768a90e9bb13964cd14e9de0515343c3a447db1fad3c985fd2566b6d","observation_id":"ce7c194f-9a4c-43b3-aa89-e0994fcc4940","resolution":{"observed_at":"2026-05-21T08:34:05.481817Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2007.02901","last_updated":"2022-01-09T23:19:38Z","snapshot_observed_at":"2026-07-06T09:35:50.977461Z","submitted_at":"2020-07-06T17:25:47Z","title":"Wiki-CS: A Wikipedia-Based Benchmark for Graph Neural Networks","version":2},"cited_work":{"arxiv_id":"2007.02901","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2007.02901","snapshot_observed_at":"2026-07-04T16:19:56.407223Z","title":"and Cangea, C","venue":null,"work_id":"e4ceb7de-e4e0-4a74-94a6-4d8848ca54e3","year":2007},"citing_paper":{"arxiv_id":"2605.27913","last_updated":"2026-05-27T03:41:04Z","snapshot_observed_at":"2026-07-06T23:37:36.244456Z","submitted_at":"2026-05-27T03:41:04Z","title":"Where LLM Annotators Fail: Label-Free Learning on Graphs with LLMs","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-06-29T14:26:07.597446Z"},"links":{"cited_paper":"/paper/2007.02901","citing_paper":"/paper/2605.27913"},"observation_digest":"sha256:1eff932a400e28f586b579badf8338829cbd7d4d7bf2b228110b76799aa82941","observation_id":"7f47057d-52d7-41e9-b9ef-b07c26943325","resolution":{"observed_at":"2026-06-29T14:33:30.687530Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2007.02901","last_updated":"2022-01-09T23:19:38Z","snapshot_observed_at":"2026-07-06T09:35:50.977461Z","submitted_at":"2020-07-06T17:25:47Z","title":"Wiki-CS: A Wikipedia-Based Benchmark for Graph Neural Networks","version":2},"cited_work":{"arxiv_id":"2007.02901","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2007.02901","snapshot_observed_at":"2026-07-04T16:19:56.407223Z","title":"and Cangea, C","venue":null,"work_id":"e4ceb7de-e4e0-4a74-94a6-4d8848ca54e3","year":2007},"citing_paper":{"arxiv_id":"2606.03232","last_updated":"2026-06-02T06:48:34Z","snapshot_observed_at":"2026-08-08T00:12:22.049003Z","submitted_at":"2026-06-02T06:48:34Z","title":"GFFMERGE: Efficient Merging of Graph Neural Force Fields and Beyond","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-06-28T11:15:53.211895Z"},"links":{"cited_paper":"/paper/2007.02901","citing_paper":"/paper/2606.03232"},"observation_digest":"sha256:11101f1d9ec532a476b1bd3bc9bbfa16adbcbf26aca899c4234b8f1442526ec7","observation_id":"9c9a2a2f-e20e-4790-8495-bfcd37ef675f","resolution":{"observed_at":"2026-07-02T02:06:26.659158Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2007.02901","last_updated":"2022-01-09T23:19:38Z","snapshot_observed_at":"2026-07-06T09:35:50.977461Z","submitted_at":"2020-07-06T17:25:47Z","title":"Wiki-CS: A Wikipedia-Based Benchmark for Graph Neural Networks","version":2},"cited_work":{"arxiv_id":"2007.02901","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2007.02901","snapshot_observed_at":"2026-07-04T16:19:56.407223Z","title":"and Cangea, C","venue":null,"work_id":"e4ceb7de-e4e0-4a74-94a6-4d8848ca54e3","year":2007},"citing_paper":{"arxiv_id":"2606.03307","last_updated":"2026-06-03T03:07:00Z","snapshot_observed_at":"2026-08-07T14:34:07.062842Z","submitted_at":"2026-06-02T08:21:57Z","title":"Generalizing Graph Foundation Models via Hyperbolic Retrieval-Augmented Generation","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-06-28T08:25:09.062736Z"},"links":{"cited_paper":"/paper/2007.02901","citing_paper":"/paper/2606.03307"},"observation_digest":"sha256:7a666452268e3b3375e8a0fe87e5ad8390d77ff0c9c9e432ee391c02f39ef9b9","observation_id":"6f15d046-b8d8-401f-931b-903c6c519f3b","resolution":{"observed_at":"2026-07-02T05:16:39.238645Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2007.02901","last_updated":"2022-01-09T23:19:38Z","snapshot_observed_at":"2026-07-06T09:35:50.977461Z","submitted_at":"2020-07-06T17:25:47Z","title":"Wiki-CS: A Wikipedia-Based Benchmark for Graph Neural Networks","version":2},"cited_work":{"arxiv_id":"2007.02901","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2007.02901","snapshot_observed_at":"2026-07-04T16:19:56.407223Z","title":"and Cangea, C","venue":null,"work_id":"e4ceb7de-e4e0-4a74-94a6-4d8848ca54e3","year":2007},"citing_paper":{"arxiv_id":"2606.10461","last_updated":"2026-06-09T06:16:40Z","snapshot_observed_at":"2026-08-01T22:24:19.374600Z","submitted_at":"2026-06-09T06:16:40Z","title":"ERAlign: Energy-based Representation Alignment of GNNs and LLMs on Text-attributed Graphs","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-06-27T13:52:15.860919Z"},"links":{"cited_paper":"/paper/2007.02901","citing_paper":"/paper/2606.10461"},"observation_digest":"sha256:9108dbfac04d8e5e8406c1170775977b12604a5bd68b34a8e3c88a84a18e98f9","observation_id":"fefefd74-1bb6-494f-bf7f-318e9cf352fd","resolution":{"observed_at":"2026-07-03T04:27:37.280545Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2007.02901","last_updated":"2022-01-09T23:19:38Z","snapshot_observed_at":"2026-07-06T09:35:50.977461Z","submitted_at":"2020-07-06T17:25:47Z","title":"Wiki-CS: A Wikipedia-Based Benchmark for Graph Neural Networks","version":2},"cited_work":{"arxiv_id":"2007.02901","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2007.02901","snapshot_observed_at":"2026-07-04T16:19:56.407223Z","title":"and Cangea, C","venue":null,"work_id":"e4ceb7de-e4e0-4a74-94a6-4d8848ca54e3","year":2007},"citing_paper":{"arxiv_id":"2606.11562","last_updated":"2026-06-10T01:41:53Z","snapshot_observed_at":"2026-08-05T13:59:17.197329Z","submitted_at":"2026-06-10T01:41:53Z","title":"GraphInfer-Bench: Benchmarking LLM's Inference Capability on Graphs","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-06-27T10:41:37.290485Z"},"links":{"cited_paper":"/paper/2007.02901","citing_paper":"/paper/2606.11562"},"observation_digest":"sha256:521c8cdaf7636a0006e1fee50c6f981616e7f5b6626fe961a3ae233dbf4c9d4b","observation_id":"9e25fed0-a343-46d9-85ad-31304c60c26e","resolution":{"observed_at":"2026-07-03T08:57:47.513194Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2007.02901","last_updated":"2022-01-09T23:19:38Z","snapshot_observed_at":"2026-07-06T09:35:50.977461Z","submitted_at":"2020-07-06T17:25:47Z","title":"Wiki-CS: A Wikipedia-Based Benchmark for Graph Neural Networks","version":2},"cited_work":{"arxiv_id":"2007.02901","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2007.02901","snapshot_observed_at":"2026-07-04T16:19:56.407223Z","title":"and Cangea, C","venue":null,"work_id":"e4ceb7de-e4e0-4a74-94a6-4d8848ca54e3","year":2007},"citing_paper":{"arxiv_id":"2606.11583","last_updated":"2026-06-10T02:15:56Z","snapshot_observed_at":"2026-07-06T23:50:39.386691Z","submitted_at":"2026-06-10T02:15:56Z","title":"Beyond the Golden Teacher: Enhancing Graph Learning through LLM-GNN Co-teaching","version":1},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-06-27T10:33:02.954683Z"},"links":{"cited_paper":"/paper/2007.02901","citing_paper":"/paper/2606.11583"},"observation_digest":"sha256:a7d25b26eb44bf1a3ed1ec43edc444ecf24b290743298d6fe3afbdd773c92838","observation_id":"e3cb08df-f17e-484d-a671-2b4539fd5924","resolution":{"observed_at":"2026-07-03T09:07:47.674460Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2007.02901","last_updated":"2022-01-09T23:19:38Z","snapshot_observed_at":"2026-07-06T09:35:50.977461Z","submitted_at":"2020-07-06T17:25:47Z","title":"Wiki-CS: A Wikipedia-Based Benchmark for Graph Neural Networks","version":2},"cited_work":{"arxiv_id":"2007.02901","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2007.02901","snapshot_observed_at":"2026-07-04T16:19:56.407223Z","title":"and Cangea, C","venue":null,"work_id":"e4ceb7de-e4e0-4a74-94a6-4d8848ca54e3","year":2007},"citing_paper":{"arxiv_id":"2606.11898","last_updated":"2026-06-11T03:22:55Z","snapshot_observed_at":"2026-08-07T05:39:04.404942Z","submitted_at":"2026-06-10T10:25:59Z","title":"GraspLLM: Towards Zero-Shot Generalization on Text-Attributed Graphs with LLMs","version":2},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-06-27T09:41:14.904868Z"},"links":{"cited_paper":"/paper/2007.02901","citing_paper":"/paper/2606.11898"},"observation_digest":"sha256:c5a4c5bc43e47e6e367133ff4f9568e6884f75bdef54916ec943f7f82bc64e51","observation_id":"cdcbca95-8b43-4a9a-8d5e-3067d9131fb2","resolution":{"observed_at":"2026-07-03T11:08:03.238106Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2007.02901","last_updated":"2022-01-09T23:19:38Z","snapshot_observed_at":"2026-07-06T09:35:50.977461Z","submitted_at":"2020-07-06T17:25:47Z","title":"Wiki-CS: A Wikipedia-Based Benchmark for Graph Neural Networks","version":2},"cited_work":{"arxiv_id":"2007.02901","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2007.02901","snapshot_observed_at":"2026-07-04T16:19:56.407223Z","title":"and Cangea, C","venue":null,"work_id":"e4ceb7de-e4e0-4a74-94a6-4d8848ca54e3","year":2007},"citing_paper":{"arxiv_id":"2606.12581","last_updated":"2026-06-10T18:29:54Z","snapshot_observed_at":"2026-08-06T22:35:19.633874Z","submitted_at":"2026-06-10T18:29:54Z","title":"Graph Reduction in Multirelational Networks: A Spreading-Oriented Reduction Benchmark","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-06-27T07:22:49.577516Z"},"links":{"cited_paper":"/paper/2007.02901","citing_paper":"/paper/2606.12581"},"observation_digest":"sha256:eb859b56aaa5926bcc60f07d811c59c8979e6f863ab88ec22d43445181ea15b5","observation_id":"51287a9c-aba3-4284-85e0-ce2b94db5617","resolution":{"observed_at":"2026-07-03T13:58:21.797178Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2007.02901","last_updated":"2022-01-09T23:19:38Z","snapshot_observed_at":"2026-07-06T09:35:50.977461Z","submitted_at":"2020-07-06T17:25:47Z","title":"Wiki-CS: A Wikipedia-Based Benchmark for Graph Neural Networks","version":2},"cited_work":{"arxiv_id":"2007.02901","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2007.02901","snapshot_observed_at":"2026-07-04T16:19:56.407223Z","title":"and Cangea, C","venue":null,"work_id":"e4ceb7de-e4e0-4a74-94a6-4d8848ca54e3","year":2007},"citing_paper":{"arxiv_id":"2606.20283","last_updated":"2026-07-22T04:59:00Z","snapshot_observed_at":"2026-08-07T21:47:30.792237Z","submitted_at":"2026-06-18T14:28:10Z","title":"Boundary Embedding Shaping with Adaptive Contrastive Learning for Graph Structural Disentanglement","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-06-26T17:59:12.258042Z"},"links":{"cited_paper":"/paper/2007.02901","citing_paper":"/paper/2606.20283"},"observation_digest":"sha256:059e2c198de83c8362007bc2bae3637db88617643e6a85cbceff101fc79ba89f","observation_id":"675733b6-a5ca-400b-b4da-3e6c8db126a6","resolution":{"observed_at":"2026-07-04T03:29:30.968673Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2007.02901","last_updated":"2022-01-09T23:19:38Z","snapshot_observed_at":"2026-07-06T09:35:50.977461Z","submitted_at":"2020-07-06T17:25:47Z","title":"Wiki-CS: A Wikipedia-Based Benchmark for Graph Neural Networks","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2007.02901","snapshot_observed_at":"2026-08-02T10:54:00.462812Z","title":"and Cangea, C","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2606.20283","last_updated":"2026-07-22T04:59:00Z","snapshot_observed_at":"2026-08-07T21:47:30.792237Z","submitted_at":"2026-06-18T14:28:10Z","title":"Boundary Embedding Shaping with Adaptive Contrastive Learning for Graph Structural Disentanglement","version":2},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-02T10:54:00.462812Z"},"links":{"cited_paper":"/paper/2007.02901","citing_paper":"/paper/2606.20283"},"observation_digest":"sha256:9852c200421620789ec19a70091f4b01ae1e936c2a65a38093fccec4a5fd38b3","observation_id":"2aa0be4f-659e-44bb-ab61-8727a622508f","resolution":{"observed_at":"2026-08-02T10:54:00.462812Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2007.02901","last_updated":"2022-01-09T23:19:38Z","snapshot_observed_at":"2026-07-06T09:35:50.977461Z","submitted_at":"2020-07-06T17:25:47Z","title":"Wiki-CS: A Wikipedia-Based Benchmark for Graph Neural Networks","version":2},"cited_work":{"arxiv_id":"2007.02901","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2007.02901","snapshot_observed_at":"2026-07-04T16:19:56.407223Z","title":"and Cangea, C","venue":null,"work_id":"e4ceb7de-e4e0-4a74-94a6-4d8848ca54e3","year":2007},"citing_paper":{"arxiv_id":"2606.22975","last_updated":"2026-06-22T07:55:55Z","snapshot_observed_at":"2026-08-08T04:34:49.846299Z","submitted_at":"2026-06-22T07:55:55Z","title":"TaLK: Text-attributed Graph Dataset Distillation via Coupling Language Model with Graph-Aware Kernel","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-06-26T08:53:13.162764Z"},"links":{"cited_paper":"/paper/2007.02901","citing_paper":"/paper/2606.22975"},"observation_digest":"sha256:bb9477604fcdb2fae84a58882e663f944297c90169127107a69d92c84952ff20","observation_id":"15470418-8bbc-4812-b640-1c2c3063da44","resolution":{"observed_at":"2026-07-04T10:29:44.391064Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2007.02901","last_updated":"2022-01-09T23:19:38Z","snapshot_observed_at":"2026-07-06T09:35:50.977461Z","submitted_at":"2020-07-06T17:25:47Z","title":"Wiki-CS: A Wikipedia-Based Benchmark for Graph Neural Networks","version":2},"cited_work":{"arxiv_id":"2007.02901","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2007.02901","snapshot_observed_at":"2026-07-04T16:19:56.407223Z","title":"and Cangea, C","venue":null,"work_id":"e4ceb7de-e4e0-4a74-94a6-4d8848ca54e3","year":2007},"citing_paper":{"arxiv_id":"2606.24956","last_updated":"2026-06-23T08:49:51Z","snapshot_observed_at":"2026-08-08T09:01:39.484256Z","submitted_at":"2026-06-23T08:49:51Z","title":"Convex--Concave Quadratic Spectral Filtering for Graph Neural Networks","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-06-26T00:49:17.654830Z"},"links":{"cited_paper":"/paper/2007.02901","citing_paper":"/paper/2606.24956"},"observation_digest":"sha256:ff0cfd395b468602d4f46e650eefccefc9dbcf34733f0a6783c36af7f94184e5","observation_id":"b4905a43-3ba9-4df1-bd4e-69e69f62f183","resolution":{"observed_at":"2026-07-04T16:19:56.409084Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2007.02901","last_updated":"2022-01-09T23:19:38Z","snapshot_observed_at":"2026-07-06T09:35:50.977461Z","submitted_at":"2020-07-06T17:25:47Z","title":"Wiki-CS: A Wikipedia-Based Benchmark for Graph Neural Networks","version":2},"cited_work":{"arxiv_id":"2007.02901","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2007.02901","snapshot_observed_at":"2026-07-04T16:19:56.407223Z","title":"and Cangea, C","venue":null,"work_id":"e4ceb7de-e4e0-4a74-94a6-4d8848ca54e3","year":2007},"citing_paper":{"arxiv_id":"2606.30291","last_updated":"2026-06-29T13:35:05Z","snapshot_observed_at":"2026-08-03T01:16:02.602622Z","submitted_at":"2026-06-29T13:35:05Z","title":"PromptGNN-sim: Deep Fusion and Alignment of GNN and LLMs for Text-Attributed Graph Learning","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-06-30T06:06:46.108334Z"},"links":{"cited_paper":"/paper/2007.02901","citing_paper":"/paper/2606.30291"},"observation_digest":"sha256:05fc47b4792c5ab9d5847c95f0e30fc9976c48d09c925dce065bdff0785052fc","observation_id":"c2d434d7-29ec-4772-9bfd-e3afb0b1ed1f","resolution":{"observed_at":"2026-06-30T08:24:26.885204Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2007.02901","last_updated":"2022-01-09T23:19:38Z","snapshot_observed_at":"2026-07-06T09:35:50.977461Z","submitted_at":"2020-07-06T17:25:47Z","title":"Wiki-CS: A Wikipedia-Based Benchmark for Graph Neural Networks","version":2},"cited_work":{"arxiv_id":"2007.02901","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2007.02901","snapshot_observed_at":"2026-07-04T16:19:56.407223Z","title":"and Cangea, C","venue":null,"work_id":"e4ceb7de-e4e0-4a74-94a6-4d8848ca54e3","year":2007},"citing_paper":{"arxiv_id":"2607.01553","last_updated":"2026-07-02T00:20:58Z","snapshot_observed_at":"2026-08-06T13:59:03.632634Z","submitted_at":"2026-07-02T00:20:58Z","title":"X-LogSMask: Expand Transformer for Graph-Structured Data","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-07-03T01:00:18.263578Z"},"links":{"cited_paper":"/paper/2007.02901","citing_paper":"/paper/2607.01553"},"observation_digest":"sha256:ea90cbc4958498575bd468d404abee3dca9520009d1400f7d57e880b71276cbe","observation_id":"2077b1db-091a-4c11-8884-861f1d6001e2","resolution":{"observed_at":"2026-07-03T01:07:29.732047Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2007.02901","last_updated":"2022-01-09T23:19:38Z","snapshot_observed_at":"2026-07-06T09:35:50.977461Z","submitted_at":"2020-07-06T17:25:47Z","title":"Wiki-CS: A Wikipedia-Based Benchmark for Graph Neural Networks","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2007.02901","snapshot_observed_at":"2026-08-01T13:29:57.675045Z","title":"arXiv preprint arXiv:2007.02901 , year=","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2607.19108","last_updated":"2026-07-21T13:50:24Z","snapshot_observed_at":"2026-08-08T00:54:55.183688Z","submitted_at":"2026-07-21T13:50:24Z","title":"OpenRTAG: A Comprehensive Benchmark for Robust Text-Attributed Graph Learning under Data Quality Degradation","version":1},"reference_index":65,"source":"arxiv_source","source_observed_at":"2026-08-01T13:29:57.675045Z"},"links":{"cited_paper":"/paper/2007.02901","citing_paper":"/paper/2607.19108"},"observation_digest":"sha256:37fc8e6fdd3a4bfa11683d821debca22eec5bce353682fa00b3deb0dbda8d256","observation_id":"72f0c56e-1aa7-4fd7-a8b2-79ee5de4a263","resolution":{"observed_at":"2026-08-01T13:29:57.675045Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2007.02901","last_updated":"2022-01-09T23:19:38Z","snapshot_observed_at":"2026-07-06T09:35:50.977461Z","submitted_at":"2020-07-06T17:25:47Z","title":"Wiki-CS: A Wikipedia-Based Benchmark for Graph Neural Networks","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2007.02901","snapshot_observed_at":"2026-08-01T01:52:01.491244Z","title":"Wiki-cs: A wikipedia-based benchmark for graph neural networks.arXiv preprint arXiv:2007.02901, 2020","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2607.27767","last_updated":"2026-07-30T07:03:23Z","snapshot_observed_at":"2026-08-04T03:48:40.303718Z","submitted_at":"2026-07-30T07:03:23Z","title":"Train Small, Deploy Large: Zero-Shot GNN Transfer Through Geometric Renormalization","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-01T01:52:01.491244Z"},"links":{"cited_paper":"/paper/2007.02901","citing_paper":"/paper/2607.27767"},"observation_digest":"sha256:84dae881b2309157fd1d2c725a59f949038d81ec215dc525ff3f04989ffeb6f6","observation_id":"4a4c427c-fea8-447d-8dba-434c0aae292a","resolution":{"observed_at":"2026-08-01T01:52:01.491244Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2007.02901/citation-record","integrity":"/paper/2007.02901/integrity","json":"/paper/2007.02901/citation-record.json","paper":"/paper/2007.02901"},"outbound":[],"paper":{"arxiv_id":"2007.02901","last_updated":"2022-01-09T23:19:38Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T09:35:50.977461Z","submitted_at":"2020-07-06T17:25:47Z","title":"Wiki-CS: A Wikipedia-Based Benchmark for Graph Neural Networks"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 50 inbound Pith citation observations for arXiv:2007.02901."}