{"as_of":"2026-08-09T21:39:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:06eb4b41fe13ef4e7491fa53e5aea59484e1360797760aae74b47431aec8ceff","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":31,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":31,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":31,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":31,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-09T18:42:02.587451Z","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.262293Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2310.11829","last_updated":"2025-03-10T16:14:30Z","snapshot_observed_at":"2026-07-06T16:34:54.717394Z","submitted_at":"2023-10-18T09:31:21Z","title":"Graph Foundation Models: Concepts, Opportunities and Challenges","version":4},"cited_work":{"arxiv_id":"2310.11829","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2310.11829","snapshot_observed_at":"2026-07-03T20:08:56.262293Z","title":"Yu, and Chuan Shi","venue":null,"work_id":"117053a0-f799-46f7-9169-9e226438c848","year":2023},"citing_paper":{"arxiv_id":"2501.00309","last_updated":"2025-01-08T05:16:25Z","snapshot_observed_at":"2026-08-07T12:37:34.294206Z","submitted_at":"2024-12-31T06:59:35Z","title":"Retrieval-Augmented Generation with Graphs (GraphRAG)","version":2},"reference_index":254,"source":"pdf_text","source_observed_at":"2026-05-18T04:33:39.076517Z"},"links":{"cited_paper":"/paper/2310.11829","citing_paper":"/paper/2501.00309"},"observation_digest":"sha256:59e1677883a6c0526f1dee891156ff0c2706a067da00c39a05a2057c01aa02fb","observation_id":"7c2b9748-b7c2-4a81-8098-d90a96bd4ecb","resolution":{"observed_at":"2026-05-18T04:33:39.679774Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.11829","last_updated":"2025-03-10T16:14:30Z","snapshot_observed_at":"2026-07-06T16:34:54.717394Z","submitted_at":"2023-10-18T09:31:21Z","title":"Graph Foundation Models: Concepts, Opportunities and Challenges","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.11829","snapshot_observed_at":"2026-08-09T18:42:02.587451Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.00529","last_updated":"2025-02-01T19:04:25Z","snapshot_observed_at":"2026-08-09T18:37:33.439025Z","submitted_at":"2025-02-01T19:04:25Z","title":"Graph Data Management and Graph Machine Learning: Synergies and Opportunities","version":1},"reference_index":83,"source":"pdf_text","source_observed_at":"2026-08-09T18:42:02.587451Z"},"links":{"cited_paper":"/paper/2310.11829","citing_paper":"/paper/2502.00529"},"observation_digest":"sha256:69e9f09f5ea86cdd0f9d7e005f3bebc78921d777f7c139c19f794007d59cd0d9","observation_id":"3d3dde39-6db0-4587-a28c-24f3772dcc13","resolution":{"observed_at":"2026-08-09T18:42:02.587451Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.11829","last_updated":"2025-03-10T16:14:30Z","snapshot_observed_at":"2026-07-06T16:34:54.717394Z","submitted_at":"2023-10-18T09:31:21Z","title":"Graph Foundation Models: Concepts, Opportunities and Challenges","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.11829","snapshot_observed_at":"2026-08-08T19:28:52.528473Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.05424","last_updated":"2025-04-12T06:20:31Z","snapshot_observed_at":"2026-08-09T17:57:38.577906Z","submitted_at":"2025-02-08T03:24:25Z","title":"SAMGPT: Text-free Graph Foundation Model for Multi-domain Pre-training and Cross-domain Adaptation","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-08T19:28:52.528473Z"},"links":{"cited_paper":"/paper/2310.11829","citing_paper":"/paper/2502.05424"},"observation_digest":"sha256:b48daaa6d33fc6d5d36c3acfd861029905e479c21b9adfc47744e745407eee11","observation_id":"6be79d5d-4f1c-4577-bff7-61c1b28676ad","resolution":{"observed_at":"2026-08-08T19:28:52.528473Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.11829","last_updated":"2025-03-10T16:14:30Z","snapshot_observed_at":"2026-07-06T16:34:54.717394Z","submitted_at":"2023-10-18T09:31:21Z","title":"Graph Foundation Models: Concepts, Opportunities and Challenges","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.11829","snapshot_observed_at":"2026-08-08T19:03:05.479770Z","title":"Towards graph foundation models: A survey and beyond","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.05537","last_updated":"2025-02-08T12:00:30Z","snapshot_observed_at":"2026-08-09T13:04:16.332693Z","submitted_at":"2025-02-08T12:00:30Z","title":"Sequential Stochastic Combinatorial Optimization Using Hierarchal Reinforcement Learning","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-08T19:03:05.479770Z"},"links":{"cited_paper":"/paper/2310.11829","citing_paper":"/paper/2502.05537"},"observation_digest":"sha256:b8e9294196eeddbb8ad379b0e109a5b11e96d2ce76d117ad12bd48bba2ae34d0","observation_id":"bb161e73-031d-4ca3-97ce-e66c00828c30","resolution":{"observed_at":"2026-08-08T19:03:05.479770Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.11829","last_updated":"2025-03-10T16:14:30Z","snapshot_observed_at":"2026-07-06T16:34:54.717394Z","submitted_at":"2023-10-18T09:31:21Z","title":"Graph Foundation Models: Concepts, Opportunities and Challenges","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.11829","snapshot_observed_at":"2026-08-08T05:35:36.371179Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.08333","last_updated":"2025-02-12T11:57:11Z","snapshot_observed_at":"2026-08-08T05:29:34.567357Z","submitted_at":"2025-02-12T11:57:11Z","title":"Foundation Models in Computational Pathology: A Review of Challenges, Opportunities, and Impact","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-08T05:35:36.371179Z"},"links":{"cited_paper":"/paper/2310.11829","citing_paper":"/paper/2502.08333"},"observation_digest":"sha256:2f49d6dfd7bdc3c1a5e551b56e2cb1dec26100a78961a30508f8f025dad59788","observation_id":"70567e7a-3cae-44e6-a408-51c7c3d99f43","resolution":{"observed_at":"2026-08-08T05:35:36.371179Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.11829","last_updated":"2025-03-10T16:14:30Z","snapshot_observed_at":"2026-07-06T16:34:54.717394Z","submitted_at":"2023-10-18T09:31:21Z","title":"Graph Foundation Models: Concepts, Opportunities and Challenges","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.11829","snapshot_observed_at":"2026-08-08T05:30:26.131507Z","title":"Towards graph foundation models: A survey and beyond","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.08346","last_updated":"2025-02-17T02:47:18Z","snapshot_observed_at":"2026-08-08T05:25:30.248415Z","submitted_at":"2025-02-12T12:13:51Z","title":"Graph Foundation Models for Recommendation: A Comprehensive Survey","version":3},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-08T05:30:26.131507Z"},"links":{"cited_paper":"/paper/2310.11829","citing_paper":"/paper/2502.08346"},"observation_digest":"sha256:7c07a58dd463c21a096c7509302da3eead3720b5c641a90c14bb73951a000225","observation_id":"b9f66913-ca59-4c03-aafc-173c7ee6e0ee","resolution":{"observed_at":"2026-08-08T05:30:26.131507Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.11829","last_updated":"2025-03-10T16:14:30Z","snapshot_observed_at":"2026-07-06T16:34:54.717394Z","submitted_at":"2023-10-18T09:31:21Z","title":"Graph Foundation Models: Concepts, Opportunities and Challenges","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.11829","snapshot_observed_at":"2026-08-07T10:37:17.837276Z","title":"Towards graph foundation models: A survey and beyond.arXiv preprint arXiv:2310.11829, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.04765","last_updated":"2025-06-05T08:48:46Z","snapshot_observed_at":"2026-08-09T12:05:43.007122Z","submitted_at":"2025-06-05T08:48:46Z","title":"OpenGT: A Comprehensive Benchmark For Graph Transformers","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T10:37:17.837276Z"},"links":{"cited_paper":"/paper/2310.11829","citing_paper":"/paper/2506.04765"},"observation_digest":"sha256:010aced32df80b65881fc45c7a75a7154a8e2940bbf00b650d82b06a14d3e0cd","observation_id":"89e765c8-2181-4430-aa4b-a8f835257a82","resolution":{"observed_at":"2026-08-07T10:37:17.837276Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.11829","last_updated":"2025-03-10T16:14:30Z","snapshot_observed_at":"2026-07-06T16:34:54.717394Z","submitted_at":"2023-10-18T09:31:21Z","title":"Graph Foundation Models: Concepts, Opportunities and Challenges","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.11829","snapshot_observed_at":"2026-08-07T06:04:14.422754Z","title":"S., et al","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.06157","last_updated":"2025-07-30T03:58:06Z","snapshot_observed_at":"2026-08-07T05:57:11.148750Z","submitted_at":"2025-06-06T15:21:24Z","title":"Masked Language Models are Good Heterogeneous Graph Generalizers","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T06:04:14.422754Z"},"links":{"cited_paper":"/paper/2310.11829","citing_paper":"/paper/2506.06157"},"observation_digest":"sha256:364c5d10dc97b9ffd322c3602c302a39e8c295ee9a222e68b9e4a70604d7f542","observation_id":"afab44a1-1e26-40b8-900d-afe9420f714e","resolution":{"observed_at":"2026-08-07T06:04:14.422754Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.11829","last_updated":"2025-03-10T16:14:30Z","snapshot_observed_at":"2026-07-06T16:34:54.717394Z","submitted_at":"2023-10-18T09:31:21Z","title":"Graph Foundation Models: Concepts, Opportunities and Challenges","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.11829","snapshot_observed_at":"2026-08-07T04:43:40.810245Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.21559","last_updated":"2025-06-11T16:38:01Z","snapshot_observed_at":"2026-08-08T14:59:08.856572Z","submitted_at":"2025-06-11T16:38:01Z","title":"GraphLAMA: Enabling Efficient Adaptation of Graph Language Models with Limited Annotations","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-07T04:43:40.810245Z"},"links":{"cited_paper":"/paper/2310.11829","citing_paper":"/paper/2506.21559"},"observation_digest":"sha256:e5ff150e95a9b23f39c52bcfeb93ebdad55e2292554189cb8130b155ae6c2768","observation_id":"91e175a5-a57e-4241-897a-b80391cba1ba","resolution":{"observed_at":"2026-08-07T04:43:40.810245Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.11829","last_updated":"2025-03-10T16:14:30Z","snapshot_observed_at":"2026-07-06T16:34:54.717394Z","submitted_at":"2023-10-18T09:31:21Z","title":"Graph Foundation Models: Concepts, Opportunities and Challenges","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.11829","snapshot_observed_at":"2026-08-06T20:25:27.533051Z","title":"Towards graph foundation models: A survey and beyond","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.02771","last_updated":"2025-07-03T16:34:34Z","snapshot_observed_at":"2026-08-09T00:45:22.366107Z","submitted_at":"2025-07-03T16:34:34Z","title":"Grounding Intelligence in Movement","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-06T20:25:27.533051Z"},"links":{"cited_paper":"/paper/2310.11829","citing_paper":"/paper/2507.02771"},"observation_digest":"sha256:e3deca0f84cdf4fab88596b167393ca0954ee4661c735b33aa290cca6981d7be","observation_id":"4b439068-00a7-408b-8e40-13829c15735d","resolution":{"observed_at":"2026-08-06T20:25:27.533051Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.11829","last_updated":"2025-03-10T16:14:30Z","snapshot_observed_at":"2026-07-06T16:34:54.717394Z","submitted_at":"2023-10-18T09:31:21Z","title":"Graph Foundation Models: Concepts, Opportunities and Challenges","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.11829","snapshot_observed_at":"2026-08-05T11:19:53.551247Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.02942","last_updated":"2025-09-03T02:16:50Z","snapshot_observed_at":"2026-08-08T15:39:54.110609Z","submitted_at":"2025-09-03T02:16:50Z","title":"RankGraph: Unified Heterogeneous Graph Learning for Cross-Domain Recommendation","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-05T11:19:53.551247Z"},"links":{"cited_paper":"/paper/2310.11829","citing_paper":"/paper/2509.02942"},"observation_digest":"sha256:2d3740b3b1ae14a4c712daef2939d5d47dd228942fad5daad04dbf879e4fd12d","observation_id":"74bb63b0-7e86-45c4-a5ad-4f9de8f2ad59","resolution":{"observed_at":"2026-08-05T11:19:53.551247Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.11829","last_updated":"2025-03-10T16:14:30Z","snapshot_observed_at":"2026-07-06T16:34:54.717394Z","submitted_at":"2023-10-18T09:31:21Z","title":"Graph Foundation Models: Concepts, Opportunities and Challenges","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.11829","snapshot_observed_at":"2026-08-02T23:38:52.474515Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2602.13075","last_updated":"2026-05-27T04:21:31Z","snapshot_observed_at":"2026-08-02T23:38:48.433563Z","submitted_at":"2026-02-13T16:34:55Z","title":"Unified Multi-Domain Graph Pre-training for Homogeneous and Heterogeneous Graphs via Domain-Specific Expert Encoding","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-02T23:38:52.474515Z"},"links":{"cited_paper":"/paper/2310.11829","citing_paper":"/paper/2602.13075"},"observation_digest":"sha256:fc60414c7b7a0c2e259209c1aadb756bcf242d4c1cd86f74563e64e9be20fe4f","observation_id":"3e185516-6d21-44a5-b667-a658ea7e00bc","resolution":{"observed_at":"2026-08-02T23:38:52.474515Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.11829","last_updated":"2025-03-10T16:14:30Z","snapshot_observed_at":"2026-07-06T16:34:54.717394Z","submitted_at":"2023-10-18T09:31:21Z","title":"Graph Foundation Models: Concepts, Opportunities and Challenges","version":4},"cited_work":{"arxiv_id":"2310.11829","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2310.11829","snapshot_observed_at":"2026-07-03T20:08:56.262293Z","title":"Yu, and Chuan Shi","venue":null,"work_id":"117053a0-f799-46f7-9169-9e226438c848","year":2023},"citing_paper":{"arxiv_id":"2604.19793","last_updated":"2026-04-07T09:43:52Z","snapshot_observed_at":"2026-07-06T23:06:21.774788Z","submitted_at":"2026-04-07T09:43:52Z","title":"SkillGraph: Graph Foundation Priors for LLM Agent Tool Sequence Recommendation","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-10T19:21:55.068813Z"},"links":{"cited_paper":"/paper/2310.11829","citing_paper":"/paper/2604.19793"},"observation_digest":"sha256:0f52bb05fcdd83007577388445d5e439d2f02ecad8931db9c88b87be9a577018","observation_id":"2986a500-a07d-440a-a19b-00e1e0872553","resolution":{"observed_at":"2026-05-10T23:05:48.359021Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.11829","last_updated":"2025-03-10T16:14:30Z","snapshot_observed_at":"2026-07-06T16:34:54.717394Z","submitted_at":"2023-10-18T09:31:21Z","title":"Graph Foundation Models: Concepts, Opportunities and Challenges","version":4},"cited_work":{"arxiv_id":"2310.11829","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2310.11829","snapshot_observed_at":"2026-07-03T20:08:56.262293Z","title":"Yu, and Chuan Shi","venue":null,"work_id":"117053a0-f799-46f7-9169-9e226438c848","year":2023},"citing_paper":{"arxiv_id":"2605.00731","last_updated":"2026-05-01T15:31:36Z","snapshot_observed_at":"2026-07-06T23:14:06.327027Z","submitted_at":"2026-05-01T15:31:36Z","title":"Empowering Heterogeneous Graph Foundation Models via Decoupled Relation Alignment","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-09T14:30:55.764387Z"},"links":{"cited_paper":"/paper/2310.11829","citing_paper":"/paper/2605.00731"},"observation_digest":"sha256:7aa9e79ec3df55a515e7d308faf65f4ca5a4e2b7b607aaf32ead05f48b30b7b8","observation_id":"f7fc68ab-aba9-4e3b-950c-b89c4b341f42","resolution":{"observed_at":"2026-05-11T16:56:06.579568Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.11829","last_updated":"2025-03-10T16:14:30Z","snapshot_observed_at":"2026-07-06T16:34:54.717394Z","submitted_at":"2023-10-18T09:31:21Z","title":"Graph Foundation Models: Concepts, Opportunities and Challenges","version":4},"cited_work":{"arxiv_id":"2310.11829","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2310.11829","snapshot_observed_at":"2026-07-03T20:08:56.262293Z","title":"Yu, and Chuan Shi","venue":null,"work_id":"117053a0-f799-46f7-9169-9e226438c848","year":2023},"citing_paper":{"arxiv_id":"2605.06522","last_updated":"2026-05-07T16:29:33Z","snapshot_observed_at":"2026-07-06T23:19:00.794334Z","submitted_at":"2026-05-07T16:29:33Z","title":"Agentic AIs Are the Missing Paradigm for Out-of-Distribution Generalization in Foundation Models","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-05-08T12:30:27.763123Z"},"links":{"cited_paper":"/paper/2310.11829","citing_paper":"/paper/2605.06522"},"observation_digest":"sha256:b8a354c46808a6b88dea45cccb3d2a3fb2e88677c5fc25667dba23c0ba31155a","observation_id":"3e73843b-7d81-4900-9fff-2194dc048e15","resolution":{"observed_at":"2026-05-11T19:16:07.042057Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.11829","last_updated":"2025-03-10T16:14:30Z","snapshot_observed_at":"2026-07-06T16:34:54.717394Z","submitted_at":"2023-10-18T09:31:21Z","title":"Graph Foundation Models: Concepts, Opportunities and Challenges","version":4},"cited_work":{"arxiv_id":"2310.11829","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2310.11829","snapshot_observed_at":"2026-07-03T20:08:56.262293Z","title":"Yu, and Chuan Shi","venue":null,"work_id":"117053a0-f799-46f7-9169-9e226438c848","year":2023},"citing_paper":{"arxiv_id":"2605.12061","last_updated":"2026-05-12T12:47:43Z","snapshot_observed_at":"2026-08-06T07:22:02.201477Z","submitted_at":"2026-05-12T12:47:43Z","title":"SAGE: A Self-Evolving Agentic Graph-Memory Engine for Structure-Aware Associative Memory","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-05-13T04:45:34.957298Z"},"links":{"cited_paper":"/paper/2310.11829","citing_paper":"/paper/2605.12061"},"observation_digest":"sha256:85b7bee660df322333eb4ee52e8de0116f000be707496daee654b94de8e940ea","observation_id":"6f5be73b-1161-418d-877f-5f1b6a085886","resolution":{"observed_at":"2026-05-13T04:52:17.399667Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.11829","last_updated":"2025-03-10T16:14:30Z","snapshot_observed_at":"2026-07-06T16:34:54.717394Z","submitted_at":"2023-10-18T09:31:21Z","title":"Graph Foundation Models: Concepts, Opportunities and Challenges","version":4},"cited_work":{"arxiv_id":"2310.11829","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2310.11829","snapshot_observed_at":"2026-07-03T20:08:56.262293Z","title":"Yu, and Chuan Shi","venue":null,"work_id":"117053a0-f799-46f7-9169-9e226438c848","year":2023},"citing_paper":{"arxiv_id":"2605.12197","last_updated":"2026-05-12T14:37:34Z","snapshot_observed_at":"2026-08-08T10:41:14.043063Z","submitted_at":"2026-05-12T14:37:34Z","title":"A Unified Graph Language Model for Multi-Domain Multi-Task Graph Alignment Instruction Tuning","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-05-13T06:41:55.783539Z"},"links":{"cited_paper":"/paper/2310.11829","citing_paper":"/paper/2605.12197"},"observation_digest":"sha256:85e51564fb92d61981bf31bc52bf5e1b2bf4e23b6cb9592e18a42ce8f32dd019","observation_id":"f9cafef4-85a7-4a34-9766-24b93ab2e276","resolution":{"observed_at":"2026-05-13T06:42:26.040529Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.11829","last_updated":"2025-03-10T16:14:30Z","snapshot_observed_at":"2026-07-06T16:34:54.717394Z","submitted_at":"2023-10-18T09:31:21Z","title":"Graph Foundation Models: Concepts, Opportunities and Challenges","version":4},"cited_work":{"arxiv_id":"2310.11829","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2310.11829","snapshot_observed_at":"2026-07-03T20:08:56.262293Z","title":"Yu, and Chuan Shi","venue":null,"work_id":"117053a0-f799-46f7-9169-9e226438c848","year":2023},"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":18,"source":"pdf_text","source_observed_at":"2026-05-20T12:49:18.671971Z"},"links":{"cited_paper":"/paper/2310.11829","citing_paper":"/paper/2605.18579"},"observation_digest":"sha256:a7ec8d77db04b2c17135c8af504a9e8ae894c1c63ea6e76d97325e0311f92fd5","observation_id":"24863c59-abe1-463b-a42e-28f93eca2b88","resolution":{"observed_at":"2026-05-20T12:53:17.639640Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.11829","last_updated":"2025-03-10T16:14:30Z","snapshot_observed_at":"2026-07-06T16:34:54.717394Z","submitted_at":"2023-10-18T09:31:21Z","title":"Graph Foundation Models: Concepts, Opportunities and Challenges","version":4},"cited_work":{"arxiv_id":"2310.11829","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2310.11829","snapshot_observed_at":"2026-07-03T20:08:56.262293Z","title":"Yu, and Chuan Shi","venue":null,"work_id":"117053a0-f799-46f7-9169-9e226438c848","year":2023},"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":18,"source":"pdf_text","source_observed_at":"2026-05-21T07:55:11.088587Z"},"links":{"cited_paper":"/paper/2310.11829","citing_paper":"/paper/2605.18579"},"observation_digest":"sha256:d902bb35790e5ac4fc5975e177840a96768119222cd98f85e67ab92392884045","observation_id":"d8b68de1-6ef3-4c72-8fff-3e9a672bd2ad","resolution":{"observed_at":"2026-05-21T07:59:50.862419Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.11829","last_updated":"2025-03-10T16:14:30Z","snapshot_observed_at":"2026-07-06T16:34:54.717394Z","submitted_at":"2023-10-18T09:31:21Z","title":"Graph Foundation Models: Concepts, Opportunities and Challenges","version":4},"cited_work":{"arxiv_id":"2310.11829","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2310.11829","snapshot_observed_at":"2026-07-03T20:08:56.262293Z","title":"Yu, and Chuan Shi","venue":null,"work_id":"117053a0-f799-46f7-9169-9e226438c848","year":2023},"citing_paper":{"arxiv_id":"2605.31031","last_updated":"2026-05-29T09:03:30Z","snapshot_observed_at":"2026-08-07T19:12:01.162428Z","submitted_at":"2026-05-29T09:03:30Z","title":"GraphARC: A Comprehensive Benchmark for Graph-Based Abstract Reasoning","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-06-28T22:39:04.557903Z"},"links":{"cited_paper":"/paper/2310.11829","citing_paper":"/paper/2605.31031"},"observation_digest":"sha256:a470371536196da0200ceb597123e48ce0f09f7a51fac01137d9776bf8fbb69d","observation_id":"326f40a6-caa7-4e06-becf-2a0db538fd52","resolution":{"observed_at":"2026-06-28T22:42:46.638059Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.11829","last_updated":"2025-03-10T16:14:30Z","snapshot_observed_at":"2026-07-06T16:34:54.717394Z","submitted_at":"2023-10-18T09:31:21Z","title":"Graph Foundation Models: Concepts, Opportunities and Challenges","version":4},"cited_work":{"arxiv_id":"2310.11829","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2310.11829","snapshot_observed_at":"2026-07-03T20:08:56.262293Z","title":"Yu, and Chuan Shi","venue":null,"work_id":"117053a0-f799-46f7-9169-9e226438c848","year":2023},"citing_paper":{"arxiv_id":"2606.03315","last_updated":"2026-06-02T08:27:03Z","snapshot_observed_at":"2026-08-02T01:16:29.098858Z","submitted_at":"2026-06-02T08:27:03Z","title":"A Graph Foundation Model with Spectral Parsing and Prototype-Guided Spatial Propagation","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-06-28T11:34:22.107760Z"},"links":{"cited_paper":"/paper/2310.11829","citing_paper":"/paper/2606.03315"},"observation_digest":"sha256:cb333dfee807b1d17bf5322d0e01c24e0958657699f89520396c04c8283735c3","observation_id":"ed121658-a487-455b-8dd8-87f14b2fb1e8","resolution":{"observed_at":"2026-07-02T01:46:26.696022Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.11829","last_updated":"2025-03-10T16:14:30Z","snapshot_observed_at":"2026-07-06T16:34:54.717394Z","submitted_at":"2023-10-18T09:31:21Z","title":"Graph Foundation Models: Concepts, Opportunities and Challenges","version":4},"cited_work":{"arxiv_id":"2310.11829","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2310.11829","snapshot_observed_at":"2026-07-03T20:08:56.262293Z","title":"Yu, and Chuan Shi","venue":null,"work_id":"117053a0-f799-46f7-9169-9e226438c848","year":2023},"citing_paper":{"arxiv_id":"2606.06285","last_updated":"2026-06-04T15:25:03Z","snapshot_observed_at":"2026-08-07T19:25:16.434950Z","submitted_at":"2026-06-04T15:25:03Z","title":"TRACE: A Temporal Conditional Estimation for Multimodal Time Series Foundation Models","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-06-28T01:50:24.426751Z"},"links":{"cited_paper":"/paper/2310.11829","citing_paper":"/paper/2606.06285"},"observation_digest":"sha256:b210a17cf74c06116ba5d21c583a8ae110fa5c2ffbfc491058997b766c76da86","observation_id":"f97207c3-0769-49c3-b4af-1b6f10c0d747","resolution":{"observed_at":"2026-07-02T12:46:56.998658Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.11829","last_updated":"2025-03-10T16:14:30Z","snapshot_observed_at":"2026-07-06T16:34:54.717394Z","submitted_at":"2023-10-18T09:31:21Z","title":"Graph Foundation Models: Concepts, Opportunities and Challenges","version":4},"cited_work":{"arxiv_id":"2310.11829","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2310.11829","snapshot_observed_at":"2026-07-03T20:08:56.262293Z","title":"Yu, and Chuan Shi","venue":null,"work_id":"117053a0-f799-46f7-9169-9e226438c848","year":2023},"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":24,"source":"pdf_text","source_observed_at":"2026-06-27T01:36:45.977332Z"},"links":{"cited_paper":"/paper/2310.11829","citing_paper":"/paper/2606.17667"},"observation_digest":"sha256:21b398460dbcfe00df3055a293ccf507340dbb5fa88256015e2c351e6627df4a","observation_id":"282e7bea-9b13-4d6a-a5c2-14b28b6e5b99","resolution":{"observed_at":"2026-07-03T20:08:56.265145Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.11829","last_updated":"2025-03-10T16:14:30Z","snapshot_observed_at":"2026-07-06T16:34:54.717394Z","submitted_at":"2023-10-18T09:31:21Z","title":"Graph Foundation Models: Concepts, Opportunities and Challenges","version":4},"cited_work":{"arxiv_id":"2310.11829","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2310.11829","snapshot_observed_at":"2026-07-03T20:08:56.262293Z","title":"Yu, and Chuan Shi","venue":null,"work_id":"117053a0-f799-46f7-9169-9e226438c848","year":2023},"citing_paper":{"arxiv_id":"2606.30009","last_updated":"2026-06-29T09:14:18Z","snapshot_observed_at":"2026-07-07T00:03:56.075924Z","submitted_at":"2026-06-29T09:14:18Z","title":"Node-to-Neighborhood Semantic Consistency: Text-Topology Alignment for TAGs Anomaly Detection","version":1},"reference_index":54,"source":"arxiv_source","source_observed_at":"2026-06-30T06:24:18.318819Z"},"links":{"cited_paper":"/paper/2310.11829","citing_paper":"/paper/2606.30009"},"observation_digest":"sha256:b8a4fd218b9c6b5ce8fae8e726bb19c83f024fb972768f29ec1d899af6c03512","observation_id":"352555db-2b26-4a4e-acbb-b761f94e1254","resolution":{"observed_at":"2026-06-30T06:54:21.427776Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.11829","last_updated":"2025-03-10T16:14:30Z","snapshot_observed_at":"2026-07-06T16:34:54.717394Z","submitted_at":"2023-10-18T09:31:21Z","title":"Graph Foundation Models: Concepts, Opportunities and Challenges","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.11829","snapshot_observed_at":"2026-08-01T17:46:02.689616Z","title":"arXiv preprint arXiv:2310.11829 , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.17570","last_updated":"2026-07-20T05:29:42Z","snapshot_observed_at":"2026-08-07T05:45:14.659042Z","submitted_at":"2026-07-20T05:29:42Z","title":"A Weisfeiler-Leman Characterization of Global-Attention Graph Transformers for Mixed-Integer Linear Programs","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-01T17:46:02.689616Z"},"links":{"cited_paper":"/paper/2310.11829","citing_paper":"/paper/2607.17570"},"observation_digest":"sha256:12ba869a6efd93ac9c7e2efaae50a3645bd7ded1c1fee0b14726fc11d5965b11","observation_id":"1b84fdf2-2fde-40cf-b51e-bb007de13b15","resolution":{"observed_at":"2026-08-01T17:46:02.689616Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.11829","last_updated":"2025-03-10T16:14:30Z","snapshot_observed_at":"2026-07-06T16:34:54.717394Z","submitted_at":"2023-10-18T09:31:21Z","title":"Graph Foundation Models: Concepts, Opportunities and Challenges","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.11829","snapshot_observed_at":"2026-08-02T12:58:09.948057Z","title":"S., et al.Towards graph foundation models: A survey and beyond.arXiv preprint arXiv:2310.11829(2023)","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.20477","last_updated":"2026-05-27T14:52:24Z","snapshot_observed_at":"2026-08-07T14:34:45.953978Z","submitted_at":"2026-05-27T14:52:24Z","title":"Semi-Supervised Text-Attributed Graph Distillation","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-02T12:58:09.948057Z"},"links":{"cited_paper":"/paper/2310.11829","citing_paper":"/paper/2607.20477"},"observation_digest":"sha256:6edc63cbf4618a09e25a138a9fe7527f29ae1acc2f2a32176ffaa38bfc483162","observation_id":"d54fc9d6-6616-4f5b-a7ab-93ab72c9a914","resolution":{"observed_at":"2026-08-02T12:58:09.948057Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.11829","last_updated":"2025-03-10T16:14:30Z","snapshot_observed_at":"2026-07-06T16:34:54.717394Z","submitted_at":"2023-10-18T09:31:21Z","title":"Graph Foundation Models: Concepts, Opportunities and Challenges","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.11829","snapshot_observed_at":"2026-07-31T18:33:46.367116Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.24314","last_updated":"2026-07-27T11:58:56Z","snapshot_observed_at":"2026-08-06T10:05:58.179598Z","submitted_at":"2026-07-27T11:58:56Z","title":"MEGA-CL: A Molecular Foundation Model for Generalizable ADMET Prediction through Graph External Attention and Contrastive Learning","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-07-31T18:33:46.367116Z"},"links":{"cited_paper":"/paper/2310.11829","citing_paper":"/paper/2607.24314"},"observation_digest":"sha256:863a93ca336322bf6c83898b6ba1d64b61e00bd8cf63d97ed2a5ad39feb6170a","observation_id":"27034b93-bed4-48be-8b48-981093e802d7","resolution":{"observed_at":"2026-07-31T18:33:46.367116Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.11829","last_updated":"2025-03-10T16:14:30Z","snapshot_observed_at":"2026-07-06T16:34:54.717394Z","submitted_at":"2023-10-18T09:31:21Z","title":"Graph Foundation Models: Concepts, Opportunities and Challenges","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.11829","snapshot_observed_at":"2026-07-31T21:59:22.157306Z","title":"Yu, and Chuan Shi","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.27966","last_updated":"2026-07-30T10:13:59Z","snapshot_observed_at":"2026-08-07T08:02:19.717928Z","submitted_at":"2026-07-30T10:13:59Z","title":"What Makes Graph Unified? Principles and Generative Sliding-Window Transformer for Graph Foundation Models","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-07-31T21:59:22.157306Z"},"links":{"cited_paper":"/paper/2310.11829","citing_paper":"/paper/2607.27966"},"observation_digest":"sha256:466bb236ba3c524ad23d3e5cd5f331d9c587ddbaf10ef1e9ab1d025f0ef00d85","observation_id":"983ca1e3-30f8-4221-81b3-628c748d3204","resolution":{"observed_at":"2026-07-31T21:59:22.157306Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.11829","last_updated":"2025-03-10T16:14:30Z","snapshot_observed_at":"2026-07-06T16:34:54.717394Z","submitted_at":"2023-10-18T09:31:21Z","title":"Graph Foundation Models: Concepts, Opportunities and Challenges","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.11829","snapshot_observed_at":"2026-08-03T16:12:18.124746Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.28980","last_updated":"2026-07-31T03:12:09Z","snapshot_observed_at":"2026-08-09T03:25:54.058940Z","submitted_at":"2026-07-31T03:12:09Z","title":"Beyond Feature and Structure Alignment: Learning Transferable Propagation Knowledge for Graph Foundation Models","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-03T16:12:18.124746Z"},"links":{"cited_paper":"/paper/2310.11829","citing_paper":"/paper/2607.28980"},"observation_digest":"sha256:10f8bb77829e29b0748ad86f640cad6b36b258e616189112edee07c61a862ff4","observation_id":"42829d10-22a3-4239-a952-68633a2c5e50","resolution":{"observed_at":"2026-08-03T16:12:18.124746Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.11829","last_updated":"2025-03-10T16:14:30Z","snapshot_observed_at":"2026-07-06T16:34:54.717394Z","submitted_at":"2023-10-18T09:31:21Z","title":"Graph Foundation Models: Concepts, Opportunities and Challenges","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.11829","snapshot_observed_at":"2026-08-04T13:43:49.613912Z","title":"arXiv preprint arXiv:2310.11829 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.02150","last_updated":"2026-08-05T06:57:37Z","snapshot_observed_at":"2026-08-09T07:46:30.048448Z","submitted_at":"2026-08-03T12:34:31Z","title":"PhyCheck: Fine-Grained Evidence-Grounded Dataset for Physical Law Understanding in Video-LLMs","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-04T13:43:49.613912Z"},"links":{"cited_paper":"/paper/2310.11829","citing_paper":"/paper/2608.02150"},"observation_digest":"sha256:5f5600cdabc4e1e92083a4c1d9c413a3c40290bc4de4b4a7956eddbbebdf8c3c","observation_id":"23647916-8088-497a-9085-7fc2442ba9e7","resolution":{"observed_at":"2026-08-04T13:43:49.613912Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.11829","last_updated":"2025-03-10T16:14:30Z","snapshot_observed_at":"2026-07-06T16:34:54.717394Z","submitted_at":"2023-10-18T09:31:21Z","title":"Graph Foundation Models: Concepts, Opportunities and Challenges","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.11829","snapshot_observed_at":"2026-08-07T00:11:45.032208Z","title":"arXiv preprint arXiv:2310.11829 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.02150","last_updated":"2026-08-05T06:57:37Z","snapshot_observed_at":"2026-08-09T07:46:30.048448Z","submitted_at":"2026-08-03T12:34:31Z","title":"PhyCheck: Fine-Grained Evidence-Grounded Dataset for Physical Law Understanding in Video-LLMs","version":3},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-07T00:11:45.032208Z"},"links":{"cited_paper":"/paper/2310.11829","citing_paper":"/paper/2608.02150"},"observation_digest":"sha256:8c30d0fe78871f745fca8d4defd2030afd87dc8dc02cc4d9c0261c650d2b2ed4","observation_id":"d75dc334-86e0-4d11-9fb1-0243173e09d7","resolution":{"observed_at":"2026-08-07T00:11:45.032208Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2310.11829/citation-record","integrity":"/paper/2310.11829/integrity","json":"/paper/2310.11829/citation-record.json","paper":"/paper/2310.11829"},"outbound":[],"paper":{"arxiv_id":"2310.11829","last_updated":"2025-03-10T16:14:30Z","latest_version":4,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T16:34:54.717394Z","submitted_at":"2023-10-18T09:31:21Z","title":"Graph Foundation Models: Concepts, Opportunities and Challenges"},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 31 inbound Pith citation observations for arXiv:2310.11829."}