{"as_of":"2026-08-23T06:05:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:c28d1ff6e2df84753d7c15491ba37c8d39d75dadb01bd6c67615e6cc6fa45b2d","coverage":[{"denominator":299,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":100,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T15:25:39.279631Z","state":"measured"},{"denominator":122,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":122,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-22T06:32:14.747728+00:00","state":"measured"},{"denominator":22,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":22,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T04:37:21.354774Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":1,"source":"pith","source_observed_at":"2026-08-05T02:28:24.338817Z","state":"measured"}],"external_citation_measurements":[{"count":2,"observed_at":"2026-08-05T02:28:24.338817Z","source":"pith"}],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2505.15116","last_updated":"2025-05-21T05:08:00Z","snapshot_observed_at":"2026-08-19T22:16:45.375639Z","submitted_at":"2025-05-21T05:08:00Z","title":"Graph Foundation Models: A Comprehensive Survey","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.15116","snapshot_observed_at":"2026-08-07T05:17:17.230060Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.08326","last_updated":"2025-06-10T01:27:19Z","snapshot_observed_at":"2026-08-14T17:39:02.979064Z","submitted_at":"2025-06-10T01:27:19Z","title":"Graph Prompting for Graph Learning Models: Recent Advances and Future Directions","version":1},"reference_index":115,"source":"pdf_text","source_observed_at":"2026-08-07T05:17:17.230060Z"},"links":{"cited_paper":"/paper/2505.15116","citing_paper":"/paper/2506.08326"},"observation_digest":"sha256:8c998633e7bad96bb7f1df124aac4145be9f3e00edc657b69b8122f75a88b16c","observation_id":"2b5ea99c-5867-4cee-92e0-6d613fd55154","resolution":{"observed_at":"2026-08-07T05:17:17.230060Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.15116","last_updated":"2025-05-21T05:08:00Z","snapshot_observed_at":"2026-08-19T22:16:45.375639Z","submitted_at":"2025-05-21T05:08:00Z","title":"Graph Foundation Models: A Comprehensive Survey","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.15116","snapshot_observed_at":"2026-08-05T14:47:53.895750Z","title":"4dbinfer: A 4d benchmarking toolbox for graph-centric predictive modeling on relational dbs.Advances in Neural Information Processing Systems, 37, 2024a","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2508.20906","last_updated":"2026-06-22T12:08:08Z","snapshot_observed_at":"2026-08-13T11:07:16.278063Z","submitted_at":"2025-08-28T15:36:37Z","title":"Turning Tabular Foundation Models into Graph Foundation Models","version":3},"reference_index":2018,"source":"pdf_text","source_observed_at":"2026-08-05T14:47:53.895750Z"},"links":{"cited_paper":"/paper/2505.15116","citing_paper":"/paper/2508.20906"},"observation_digest":"sha256:37acaf5adb83ba01f9035a99373510a7146aecd8234a63b9d3916cdc86d9f013","observation_id":"d9445f5c-9a89-4ffe-a770-b24a41642a97","resolution":{"observed_at":"2026-08-05T14:47:53.895750Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.15116","last_updated":"2025-05-21T05:08:00Z","snapshot_observed_at":"2026-08-19T22:16:45.375639Z","submitted_at":"2025-05-21T05:08:00Z","title":"Graph Foundation Models: A Comprehensive Survey","version":1},"cited_work":{"arxiv_id":"2505.15116","doi":"10.48550/arxiv.2505.15116","metadata_source":"pith","pith_arxiv_id":"2505.15116","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Graph founda- tion models: A comprehensive survey.arXiv preprint arXiv:2505.15116","venue":"cs.LG","work_id":"a2d2734e-af16-43d7-8fa5-e88b5f41ca5a","year":2025},"citing_paper":{"arxiv_id":"2510.12369","last_updated":"2026-05-27T13:44:50Z","snapshot_observed_at":"2026-08-18T22:34:48.984542Z","submitted_at":"2025-10-14T10:36:43Z","title":"A Hierarchical Quantized Tokenization Framework for Task-Adaptive Graph Representation Learning","version":3},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-05-25T07:49:39.057087Z"},"links":{"cited_paper":"/paper/2505.15116","citing_paper":"/paper/2510.12369"},"observation_digest":"sha256:2899fe20653928a3d1bc62326e65c273a1c082a421831ea61f7bab22e49c1b95","observation_id":"8cc0c169-f5e9-4eed-b4cf-84ce4c53082e","resolution":{"observed_at":"2026-05-25T07:50:28.998814Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-07-11T01:19:48.163035+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-11T01:19:48.163035+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.15116","last_updated":"2025-05-21T05:08:00Z","snapshot_observed_at":"2026-08-19T22:16:45.375639Z","submitted_at":"2025-05-21T05:08:00Z","title":"Graph Foundation Models: A Comprehensive Survey","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.15116","snapshot_observed_at":"2026-08-04T10:00:51.685962Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2510.12369","last_updated":"2026-05-27T13:44:50Z","snapshot_observed_at":"2026-08-18T22:34:48.984542Z","submitted_at":"2025-10-14T10:36:43Z","title":"A Hierarchical Quantized Tokenization Framework for Task-Adaptive Graph Representation Learning","version":4},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-04T10:00:51.685962Z"},"links":{"cited_paper":"/paper/2505.15116","citing_paper":"/paper/2510.12369"},"observation_digest":"sha256:a2e15134c3e65d8f5407e1ac185f80d83aa383934245560dc2c8baa06e837e47","observation_id":"2678112d-6648-4472-a45d-a0803d7dde13","resolution":{"observed_at":"2026-08-04T10:00:51.685962Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.15116","last_updated":"2025-05-21T05:08:00Z","snapshot_observed_at":"2026-08-19T22:16:45.375639Z","submitted_at":"2025-05-21T05:08:00Z","title":"Graph Foundation Models: A Comprehensive Survey","version":1},"cited_work":{"arxiv_id":"2505.15116","doi":"10.48550/arxiv.2505.15116","metadata_source":"pith","pith_arxiv_id":"2505.15116","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Graph founda- tion models: A comprehensive survey.arXiv preprint arXiv:2505.15116","venue":"cs.LG","work_id":"a2d2734e-af16-43d7-8fa5-e88b5f41ca5a","year":2025},"citing_paper":{"arxiv_id":"2604.06666","last_updated":"2026-04-08T04:34:19Z","snapshot_observed_at":"2026-08-11T14:25:17.825132Z","submitted_at":"2026-04-08T04:34:19Z","title":"A Graph-Enhanced Defense Framework for Explainable Fake News Detection with LLM","version":1},"reference_index":72,"source":"pdf_text","source_observed_at":"2026-05-10T17:58:08.142822Z"},"links":{"cited_paper":"/paper/2505.15116","citing_paper":"/paper/2604.06666"},"observation_digest":"sha256:cbdef6acf0364308e7b9b4e24069cee6150ad1af553f8f1ee56f6341982b4279","observation_id":"53eeb16f-dad2-45dc-b904-770cf568d089","resolution":{"observed_at":"2026-05-11T05:45:57.431322Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-07-11T01:19:48.163035+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-11T01:19:48.163035+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.15116","last_updated":"2025-05-21T05:08:00Z","snapshot_observed_at":"2026-08-19T22:16:45.375639Z","submitted_at":"2025-05-21T05:08:00Z","title":"Graph Foundation Models: A Comprehensive Survey","version":1},"cited_work":{"arxiv_id":"2505.15116","doi":"10.48550/arxiv.2505.15116","metadata_source":"pith","pith_arxiv_id":"2505.15116","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Graph founda- tion models: A comprehensive survey.arXiv preprint arXiv:2505.15116","venue":"cs.LG","work_id":"a2d2734e-af16-43d7-8fa5-e88b5f41ca5a","year":2025},"citing_paper":{"arxiv_id":"2605.06154","last_updated":"2026-05-07T12:47:34Z","snapshot_observed_at":"2026-08-10T21:02:53.885662Z","submitted_at":"2026-05-07T12:47:34Z","title":"Graphlets as Building Blocks for Structural Vocabulary in Knowledge Graph Foundation Models","version":1},"reference_index":67,"source":"arxiv_source","source_observed_at":"2026-05-08T10:28:53.266354Z"},"links":{"cited_paper":"/paper/2505.15116","citing_paper":"/paper/2605.06154"},"observation_digest":"sha256:89fd690be709a1d6cc3306ceeb42c76d4728a31e7b7cc012e6230a3ceef59b26","observation_id":"52e5a5c5-22fa-4330-8c45-350e0401512b","resolution":{"observed_at":"2026-05-11T20:01:11.973713Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-07-11T01:19:48.163035+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-11T01:19:48.163035+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.15116","last_updated":"2025-05-21T05:08:00Z","snapshot_observed_at":"2026-08-19T22:16:45.375639Z","submitted_at":"2025-05-21T05:08:00Z","title":"Graph Foundation Models: A Comprehensive Survey","version":1},"cited_work":{"arxiv_id":"2505.15116","doi":"10.48550/arxiv.2505.15116","metadata_source":"pith","pith_arxiv_id":"2505.15116","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Graph founda- tion models: A comprehensive survey.arXiv preprint arXiv:2505.15116","venue":"cs.LG","work_id":"a2d2734e-af16-43d7-8fa5-e88b5f41ca5a","year":2025},"citing_paper":{"arxiv_id":"2605.06576","last_updated":"2026-05-07T17:06:19Z","snapshot_observed_at":"2026-08-11T16:26:23.282859Z","submitted_at":"2026-05-07T17:06:19Z","title":"On the Safety of Graph Representation Learning","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-05-08T12:17:28.087347Z"},"links":{"cited_paper":"/paper/2505.15116","citing_paper":"/paper/2605.06576"},"observation_digest":"sha256:eae6282c3ab94b327945c268c850a8be587aad90ac49382fc1a3cdb6412c4f17","observation_id":"42761da6-279c-4dd9-99cc-6928329edc6c","resolution":{"observed_at":"2026-05-11T19:21:07.101844Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-07-11T01:19:48.163035+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-11T01:19:48.163035+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.15116","last_updated":"2025-05-21T05:08:00Z","snapshot_observed_at":"2026-08-19T22:16:45.375639Z","submitted_at":"2025-05-21T05:08:00Z","title":"Graph Foundation Models: A Comprehensive Survey","version":1},"cited_work":{"arxiv_id":"2505.15116","doi":"10.48550/arxiv.2505.15116","metadata_source":"pith","pith_arxiv_id":"2505.15116","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Graph founda- tion models: A comprehensive survey.arXiv preprint arXiv:2505.15116","venue":"cs.LG","work_id":"a2d2734e-af16-43d7-8fa5-e88b5f41ca5a","year":2025},"citing_paper":{"arxiv_id":"2605.08689","last_updated":"2026-05-09T04:56:21Z","snapshot_observed_at":"2026-08-17T23:08:52.236003Z","submitted_at":"2026-05-09T04:56:21Z","title":"Structure-Centric Graph Foundation Model via Geometric Bases","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-05-12T01:28:38.030340Z"},"links":{"cited_paper":"/paper/2505.15116","citing_paper":"/paper/2605.08689"},"observation_digest":"sha256:d189265d13a6d1b156f1be22efaa547038da030064540a88f1ed2e9595ab9c00","observation_id":"0866a81e-64ca-4594-b511-9a3872eea6d4","resolution":{"observed_at":"2026-05-12T07:56:30.553918Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-07-11T01:19:48.163035+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-11T01:19:48.163035+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.15116","last_updated":"2025-05-21T05:08:00Z","snapshot_observed_at":"2026-08-19T22:16:45.375639Z","submitted_at":"2025-05-21T05:08:00Z","title":"Graph Foundation Models: A Comprehensive Survey","version":1},"cited_work":{"arxiv_id":"2505.15116","doi":"10.48550/arxiv.2505.15116","metadata_source":"pith","pith_arxiv_id":"2505.15116","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Graph founda- tion models: A comprehensive survey.arXiv preprint arXiv:2505.15116","venue":"cs.LG","work_id":"a2d2734e-af16-43d7-8fa5-e88b5f41ca5a","year":2025},"citing_paper":{"arxiv_id":"2605.12197","last_updated":"2026-05-12T14:37:34Z","snapshot_observed_at":"2026-08-14T09:26:07.085169Z","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":50,"source":"pdf_text","source_observed_at":"2026-05-13T06:41:55.783539Z"},"links":{"cited_paper":"/paper/2505.15116","citing_paper":"/paper/2605.12197"},"observation_digest":"sha256:4436ebdef9245b7ee02a75bb177300b30d4ed632ea985fcf22b0e60668289491","observation_id":"578d909a-f493-4ae7-a188-5e2727d4d414","resolution":{"observed_at":"2026-05-13T06:42:26.013613Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-07-11T01:19:48.163035+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-11T01:19:48.163035+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.15116","last_updated":"2025-05-21T05:08:00Z","snapshot_observed_at":"2026-08-19T22:16:45.375639Z","submitted_at":"2025-05-21T05:08:00Z","title":"Graph Foundation Models: A Comprehensive Survey","version":1},"cited_work":{"arxiv_id":"2505.15116","doi":"10.48550/arxiv.2505.15116","metadata_source":"pith","pith_arxiv_id":"2505.15116","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Graph founda- tion models: A comprehensive survey.arXiv preprint arXiv:2505.15116","venue":"cs.LG","work_id":"a2d2734e-af16-43d7-8fa5-e88b5f41ca5a","year":2025},"citing_paper":{"arxiv_id":"2605.19021","last_updated":"2026-05-22T18:44:04Z","snapshot_observed_at":"2026-08-16T03:25:47.347996Z","submitted_at":"2026-05-18T18:42:19Z","title":"Deep Neural Sheaf Diffusion","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-05-20T12:09:32.772060Z"},"links":{"cited_paper":"/paper/2505.15116","citing_paper":"/paper/2605.19021"},"observation_digest":"sha256:e3bde10b217c357213d24ed417c84790102be02dc67a5a1ab65ed9c9ac36e7bb","observation_id":"ad958949-40e6-4d2b-b4ad-e3719c28ed4b","resolution":{"observed_at":"2026-05-20T12:13:16.461708Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-07-11T01:19:48.163035+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-11T01:19:48.163035+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.15116","last_updated":"2025-05-21T05:08:00Z","snapshot_observed_at":"2026-08-19T22:16:45.375639Z","submitted_at":"2025-05-21T05:08:00Z","title":"Graph Foundation Models: A Comprehensive Survey","version":1},"cited_work":{"arxiv_id":"2505.15116","doi":"10.48550/arxiv.2505.15116","metadata_source":"pith","pith_arxiv_id":"2505.15116","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Graph founda- tion models: A comprehensive survey.arXiv preprint arXiv:2505.15116","venue":"cs.LG","work_id":"a2d2734e-af16-43d7-8fa5-e88b5f41ca5a","year":2025},"citing_paper":{"arxiv_id":"2605.19021","last_updated":"2026-05-22T18:44:04Z","snapshot_observed_at":"2026-08-16T03:25:47.347996Z","submitted_at":"2026-05-18T18:42:19Z","title":"Deep Neural Sheaf Diffusion","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-06-30T18:21:54.773942Z"},"links":{"cited_paper":"/paper/2505.15116","citing_paper":"/paper/2605.19021"},"observation_digest":"sha256:fe635c78c06d951460153c3d69c6f77e5185d01e3e9a0b2e062a6575c01f091f","observation_id":"f94cc82e-d410-4bae-8ca5-0580348e44b4","resolution":{"observed_at":"2026-06-30T18:25:00.119669Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-07-11T01:19:48.163035+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-11T01:19:48.163035+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.15116","last_updated":"2025-05-21T05:08:00Z","snapshot_observed_at":"2026-08-19T22:16:45.375639Z","submitted_at":"2025-05-21T05:08:00Z","title":"Graph Foundation Models: A Comprehensive Survey","version":1},"cited_work":{"arxiv_id":"2505.15116","doi":"10.48550/arxiv.2505.15116","metadata_source":"pith","pith_arxiv_id":"2505.15116","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Graph founda- tion models: A comprehensive survey.arXiv preprint arXiv:2505.15116","venue":"cs.LG","work_id":"a2d2734e-af16-43d7-8fa5-e88b5f41ca5a","year":2025},"citing_paper":{"arxiv_id":"2605.29228","last_updated":"2026-05-28T01:37:12Z","snapshot_observed_at":"2026-08-14T20:28:51.382184Z","submitted_at":"2026-05-28T01:37:12Z","title":"Traditional machine learning vs. deep learning from dynamic graph representations of proteins' 3D folds in the task of protein structure classification","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-06-29T08:37:31.950133Z"},"links":{"cited_paper":"/paper/2505.15116","citing_paper":"/paper/2605.29228"},"observation_digest":"sha256:44b75475202baebdd3d6ca6e2f94344e1e912a0a511d11bfc89f3cb756610fb0","observation_id":"bc614796-4e01-4382-bd3b-e23832ac7923","resolution":{"observed_at":"2026-06-29T08:43:15.436680Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-07-11T01:19:48.163035+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-11T01:19:48.163035+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.15116","last_updated":"2025-05-21T05:08:00Z","snapshot_observed_at":"2026-08-19T22:16:45.375639Z","submitted_at":"2025-05-21T05:08:00Z","title":"Graph Foundation Models: A Comprehensive Survey","version":1},"cited_work":{"arxiv_id":"2505.15116","doi":"10.48550/arxiv.2505.15116","metadata_source":"pith","pith_arxiv_id":"2505.15116","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Graph founda- tion models: A comprehensive survey.arXiv preprint arXiv:2505.15116","venue":"cs.LG","work_id":"a2d2734e-af16-43d7-8fa5-e88b5f41ca5a","year":2025},"citing_paper":{"arxiv_id":"2605.31031","last_updated":"2026-05-29T09:03:30Z","snapshot_observed_at":"2026-08-17T17:47:06.462184Z","submitted_at":"2026-05-29T09:03:30Z","title":"GraphARC: A Comprehensive Benchmark for Graph-Based Abstract Reasoning","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-06-28T22:39:04.557903Z"},"links":{"cited_paper":"/paper/2505.15116","citing_paper":"/paper/2605.31031"},"observation_digest":"sha256:ce6c31d9458f33ebe6b36378f2fd65bb3b378cc3c4b171ef5be03bfbd2016bc9","observation_id":"4ebbd1ed-041e-4b87-bde2-01d637b37a25","resolution":{"observed_at":"2026-06-28T22:42:46.627404Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-07-11T01:19:48.163035+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-11T01:19:48.163035+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.15116","last_updated":"2025-05-21T05:08:00Z","snapshot_observed_at":"2026-08-19T22:16:45.375639Z","submitted_at":"2025-05-21T05:08:00Z","title":"Graph Foundation Models: A Comprehensive Survey","version":1},"cited_work":{"arxiv_id":"2505.15116","doi":"10.48550/arxiv.2505.15116","metadata_source":"pith","pith_arxiv_id":"2505.15116","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Graph founda- tion models: A comprehensive survey.arXiv preprint arXiv:2505.15116","venue":"cs.LG","work_id":"a2d2734e-af16-43d7-8fa5-e88b5f41ca5a","year":2025},"citing_paper":{"arxiv_id":"2606.03315","last_updated":"2026-06-02T08:27:03Z","snapshot_observed_at":"2026-08-14T01:00:55.194672Z","submitted_at":"2026-06-02T08:27:03Z","title":"A Graph Foundation Model with Spectral Parsing and Prototype-Guided Spatial Propagation","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-06-28T11:34:22.107760Z"},"links":{"cited_paper":"/paper/2505.15116","citing_paper":"/paper/2606.03315"},"observation_digest":"sha256:fa302f69da1027615abc27d4ae97fceb0e6a52dc5411b0a51424747d6872104e","observation_id":"0ff47bb9-5e18-46bd-9d9a-e8e9583a2fc4","resolution":{"observed_at":"2026-07-02T01:46:26.712782Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-07-11T01:19:48.163035+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-11T01:19:48.163035+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.15116","last_updated":"2025-05-21T05:08:00Z","snapshot_observed_at":"2026-08-19T22:16:45.375639Z","submitted_at":"2025-05-21T05:08:00Z","title":"Graph Foundation Models: A Comprehensive Survey","version":1},"cited_work":{"arxiv_id":"2505.15116","doi":"10.48550/arxiv.2505.15116","metadata_source":"pith","pith_arxiv_id":"2505.15116","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Graph founda- tion models: A comprehensive survey.arXiv preprint arXiv:2505.15116","venue":"cs.LG","work_id":"a2d2734e-af16-43d7-8fa5-e88b5f41ca5a","year":2025},"citing_paper":{"arxiv_id":"2606.04320","last_updated":"2026-06-03T00:48:44Z","snapshot_observed_at":"2026-08-13T21:48:34.487669Z","submitted_at":"2026-06-03T00:48:44Z","title":"OpenRFM: Dissecting Relational In-Context Learning","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-06-28T07:37:38.063200Z"},"links":{"cited_paper":"/paper/2505.15116","citing_paper":"/paper/2606.04320"},"observation_digest":"sha256:3e64e3e829ae8dcdaeef6e64c28f3ba9f89c53df7dbf70ccb834e0dc07644585","observation_id":"e629c128-26f6-4b4f-bf5a-3a2cfa3b9c52","resolution":{"observed_at":"2026-07-02T06:06:41.439996Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-07-11T01:19:48.163035+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-11T01:19:48.163035+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.15116","last_updated":"2025-05-21T05:08:00Z","snapshot_observed_at":"2026-08-19T22:16:45.375639Z","submitted_at":"2025-05-21T05:08:00Z","title":"Graph Foundation Models: A Comprehensive Survey","version":1},"cited_work":{"arxiv_id":"2505.15116","doi":"10.48550/arxiv.2505.15116","metadata_source":"pith","pith_arxiv_id":"2505.15116","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Graph founda- tion models: A comprehensive survey.arXiv preprint arXiv:2505.15116","venue":"cs.LG","work_id":"a2d2734e-af16-43d7-8fa5-e88b5f41ca5a","year":2025},"citing_paper":{"arxiv_id":"2606.06397","last_updated":"2026-06-05T07:21:56Z","snapshot_observed_at":"2026-08-12T21:02:06.750754Z","submitted_at":"2026-06-04T17:05:36Z","title":"The Post-GCN Decade Revisited: Curvature-Stratified Evaluation of Relational Learning","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-06-28T02:40:03.713695Z"},"links":{"cited_paper":"/paper/2505.15116","citing_paper":"/paper/2606.06397"},"observation_digest":"sha256:5598e917d638227ac674398a8458dac533376d7c16ee52427f89639ae317b8b5","observation_id":"025cc9f2-bbb4-4e5a-a8f3-ec8d505abf93","resolution":{"observed_at":"2026-07-02T11:56:55.662059Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-07-11T01:19:48.163035+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-11T01:19:48.163035+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.15116","last_updated":"2025-05-21T05:08:00Z","snapshot_observed_at":"2026-08-19T22:16:45.375639Z","submitted_at":"2025-05-21T05:08:00Z","title":"Graph Foundation Models: A Comprehensive Survey","version":1},"cited_work":{"arxiv_id":"2505.15116","doi":"10.48550/arxiv.2505.15116","metadata_source":"pith","pith_arxiv_id":"2505.15116","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Graph founda- tion models: A comprehensive survey.arXiv preprint arXiv:2505.15116","venue":"cs.LG","work_id":"a2d2734e-af16-43d7-8fa5-e88b5f41ca5a","year":2025},"citing_paper":{"arxiv_id":"2606.11560","last_updated":"2026-06-10T01:39:41Z","snapshot_observed_at":"2026-08-22T10:35:05.883840Z","submitted_at":"2026-06-10T01:39:41Z","title":"LLMs+Graphs: Toward Graph-Native, Synergistic AI Systems","version":1},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-06-27T08:00:38.559294Z"},"links":{"cited_paper":"/paper/2505.15116","citing_paper":"/paper/2606.11560"},"observation_digest":"sha256:9d014634ce5bbdf0b01e2cd99a9017d2d5e8579c713adae750db47fefa8c38a0","observation_id":"601aa878-04a3-4b29-8954-5770e2a3b0fc","resolution":{"observed_at":"2026-07-03T13:28:19.006691Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-07-11T01:19:48.163035+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-11T01:19:48.163035+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.15116","last_updated":"2025-05-21T05:08:00Z","snapshot_observed_at":"2026-08-19T22:16:45.375639Z","submitted_at":"2025-05-21T05:08:00Z","title":"Graph Foundation Models: A Comprehensive Survey","version":1},"cited_work":{"arxiv_id":"2505.15116","doi":"10.48550/arxiv.2505.15116","metadata_source":"pith","pith_arxiv_id":"2505.15116","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Graph founda- tion models: A comprehensive survey.arXiv preprint arXiv:2505.15116","venue":"cs.LG","work_id":"a2d2734e-af16-43d7-8fa5-e88b5f41ca5a","year":2025},"citing_paper":{"arxiv_id":"2607.06224","last_updated":"2026-07-07T12:48:38Z","snapshot_observed_at":"2026-08-20T00:38:54.173940Z","submitted_at":"2026-07-07T12:48:38Z","title":"Canopy: A Heterograph Foundation Model for Metabolic Engineering","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-07-08T13:00:45.071926Z"},"links":{"cited_paper":"/paper/2505.15116","citing_paper":"/paper/2607.06224"},"observation_digest":"sha256:16430ae9b0b2f58800c75b2a30f2feda21e9b43e4b81d2750e4baa1f7c77afdb","observation_id":"e2f51f26-3ff3-4142-8884-ec7e4fe4080f","resolution":{"observed_at":"2026-07-08T13:04:56.503962Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-07-11T01:19:48.163035+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-11T01:19:48.163035+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.15116","last_updated":"2025-05-21T05:08:00Z","snapshot_observed_at":"2026-08-19T22:16:45.375639Z","submitted_at":"2025-05-21T05:08:00Z","title":"Graph Foundation Models: A Comprehensive Survey","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.15116","snapshot_observed_at":"2026-08-01T00:53:53.532539Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.26023","last_updated":"2026-07-28T17:35:26Z","snapshot_observed_at":"2026-08-15T09:02:52.839852Z","submitted_at":"2026-07-28T17:35:26Z","title":"CHARM: A Multimodal Graph Foundation Model with Hierarchical Context Modeling for Zero-Shot Transfer","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-01T00:53:53.532539Z"},"links":{"cited_paper":"/paper/2505.15116","citing_paper":"/paper/2607.26023"},"observation_digest":"sha256:a25f453a8c672e6300d0f9c698fc7eb96d673f47550433808ecec560955df8c8","observation_id":"f60906c2-6c9c-4b8e-9e7b-29a31828aa06","resolution":{"observed_at":"2026-08-01T00:53:53.532539Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.15116","last_updated":"2025-05-21T05:08:00Z","snapshot_observed_at":"2026-08-19T22:16:45.375639Z","submitted_at":"2025-05-21T05:08:00Z","title":"Graph Foundation Models: A Comprehensive Survey","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.15116","snapshot_observed_at":"2026-07-31T21:59:23.099471Z","title":"Chawla, Chuxu Zhang, and Yanfang Ye","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.27966","last_updated":"2026-07-30T10:13:59Z","snapshot_observed_at":"2026-08-16T02:50:59.197016Z","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":34,"source":"pdf_text","source_observed_at":"2026-07-31T21:59:23.099471Z"},"links":{"cited_paper":"/paper/2505.15116","citing_paper":"/paper/2607.27966"},"observation_digest":"sha256:c90ed5dd520e5b4a5fc7f63c1ccd78363de5854e742155bd0b8ea00b7cd86f95","observation_id":"db924e7f-34f0-4a31-a6a3-5180cea912f5","resolution":{"observed_at":"2026-07-31T21:59:23.099471Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.15116","last_updated":"2025-05-21T05:08:00Z","snapshot_observed_at":"2026-08-19T22:16:45.375639Z","submitted_at":"2025-05-21T05:08:00Z","title":"Graph Foundation Models: A Comprehensive Survey","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.15116","snapshot_observed_at":"2026-08-03T16:12:20.521397Z","title":"Chawla, Chuxu Zhang, and Yanfang Ye","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.28980","last_updated":"2026-07-31T03:12:09Z","snapshot_observed_at":"2026-08-15T20:01:10.631676Z","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":36,"source":"pdf_text","source_observed_at":"2026-08-03T16:12:20.521397Z"},"links":{"cited_paper":"/paper/2505.15116","citing_paper":"/paper/2607.28980"},"observation_digest":"sha256:311ead43fbe1aeb08de70b1686b857cbec8ac95dc4f97a06cbe8c9511a5de0d8","observation_id":"24427022-1887-4c00-91bc-f942150839d8","resolution":{"observed_at":"2026-08-03T16:12:20.521397Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.15116","last_updated":"2025-05-21T05:08:00Z","snapshot_observed_at":"2026-08-19T22:16:45.375639Z","submitted_at":"2025-05-21T05:08:00Z","title":"Graph Foundation Models: A Comprehensive Survey","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.15116","snapshot_observed_at":"2026-08-14T04:37:21.354774Z","title":"Graph Foundation Models: A Comprehensive Survey, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.08536","last_updated":"2026-08-09T07:14:13Z","snapshot_observed_at":"2026-08-19T18:44:33.828775Z","submitted_at":"2026-08-09T07:14:13Z","title":"Can Graph Learning Learn Circuits?","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-14T04:37:21.354774Z"},"links":{"cited_paper":"/paper/2505.15116","citing_paper":"/paper/2608.08536"},"observation_digest":"sha256:ce2a9eef3e51dec057aa2d71f88c9838d71b7f89c43a3c5a6b5c373a606d2bd1","observation_id":"295d127f-ebb1-47a7-9025-363dca0e9df1","resolution":{"observed_at":"2026-08-14T04:37:21.354774Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2505.15116/citation-record","integrity":"/paper/2505.15116/integrity","json":"/paper/2505.15116/citation-record.json","paper":"/paper/2505.15116"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:25:28.439185Z","title":"Machine learning algorithms-a review","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2505.15116","last_updated":"2025-05-21T05:08:00Z","snapshot_observed_at":"2026-08-19T22:16:45.375639Z","submitted_at":"2025-05-21T05:08:00Z","title":"Graph Foundation Models: A Comprehensive Survey","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T15:25:28.439185Z"},"links":{"citing_paper":"/paper/2505.15116"},"observation_digest":"sha256:e1b5f005187df2b202ac2ca0089b989bd4ec87ef9e8bd8a5dfcb703a0d2d0dfc","observation_id":"d6c96622-da38-46ef-9360-8763fcc971d1","resolution":{"observed_at":"2026-08-07T15:25:28.439185Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:25:28.540420Z","title":"Feature engineering for machine learning and data analytics","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2505.15116","last_updated":"2025-05-21T05:08:00Z","snapshot_observed_at":"2026-08-19T22:16:45.375639Z","submitted_at":"2025-05-21T05:08:00Z","title":"Graph Foundation Models: A Comprehensive Survey","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T15:25:28.540420Z"},"links":{"citing_paper":"/paper/2505.15116"},"observation_digest":"sha256:af47b63c6cf847df2b866ec673c184ddb3bc54a83fb3d6ddc0d50f6dd1fc8e2f","observation_id":"880237bb-36ed-444c-854c-095f7cf9d11a","resolution":{"observed_at":"2026-08-07T15:25:28.540420Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:25:28.622554Z","title":"A comparative study of training algorithms for supervised machine learning","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2505.15116","last_updated":"2025-05-21T05:08:00Z","snapshot_observed_at":"2026-08-19T22:16:45.375639Z","submitted_at":"2025-05-21T05:08:00Z","title":"Graph Foundation Models: A Comprehensive Survey","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T15:25:28.622554Z"},"links":{"citing_paper":"/paper/2505.15116"},"observation_digest":"sha256:a8e2e63b731976fa3b93d8680da8161a605f1c29ec9bf8374bb9efc215f86240","observation_id":"3ba71234-9024-4e7c-9723-4f01d0ef8c1d","resolution":{"observed_at":"2026-08-07T15:25:28.622554Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:25:28.757687Z","title":"Machine learning","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.15116","last_updated":"2025-05-21T05:08:00Z","snapshot_observed_at":"2026-08-19T22:16:45.375639Z","submitted_at":"2025-05-21T05:08:00Z","title":"Graph Foundation Models: A Comprehensive Survey","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T15:25:28.757687Z"},"links":{"citing_paper":"/paper/2505.15116"},"observation_digest":"sha256:4d9724d366ddb2a1e8ff8d07bd84b9616fd525d840ac71466aa6a2dac2ab9040","observation_id":"058c5307-9b13-4dd7-b9a5-0953cf7b728f","resolution":{"observed_at":"2026-08-07T15:25:28.757687Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:25:28.895403Z","title":"Deep learning","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2505.15116","last_updated":"2025-05-21T05:08:00Z","snapshot_observed_at":"2026-08-19T22:16:45.375639Z","submitted_at":"2025-05-21T05:08:00Z","title":"Graph Foundation Models: A Comprehensive Survey","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T15:25:28.895403Z"},"links":{"citing_paper":"/paper/2505.15116"},"observation_digest":"sha256:57c031267d0f5f28e4baba0a942c56c494ecf5987cd47149998d65c8b935a884","observation_id":"672152a2-2ff7-4d8b-b90b-a657137cec3f","resolution":{"observed_at":"2026-08-07T15:25:28.895403Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:25:28.982217Z","title":"Deep residual learning for image recognition","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2505.15116","last_updated":"2025-05-21T05:08:00Z","snapshot_observed_at":"2026-08-19T22:16:45.375639Z","submitted_at":"2025-05-21T05:08:00Z","title":"Graph Foundation Models: A Comprehensive Survey","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T15:25:28.982217Z"},"links":{"citing_paper":"/paper/2505.15116"},"observation_digest":"sha256:51675f6ac197593707ad9522565497d924c8dc42ed27c6ee42b92bf838318819","observation_id":"e5a3e376-f7cc-49ed-8983-8ddcb53a8a46","resolution":{"observed_at":"2026-08-07T15:25:28.982217Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:25:29.078119Z","title":"Long short-term memory","venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2505.15116","last_updated":"2025-05-21T05:08:00Z","snapshot_observed_at":"2026-08-19T22:16:45.375639Z","submitted_at":"2025-05-21T05:08:00Z","title":"Graph Foundation Models: A Comprehensive Survey","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T15:25:29.078119Z"},"links":{"citing_paper":"/paper/2505.15116"},"observation_digest":"sha256:8d3a6b37d512f423362cc947a79d695864df0d5201e8466601272413a3be8b9a","observation_id":"4c614fa9-a1bf-47bd-b1d2-b78c9256b7cc","resolution":{"observed_at":"2026-08-07T15:25:29.078119Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:25:29.172671Z","title":"Empirical evaluation of gated recurrent neural networks on sequence modeling","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2505.15116","last_updated":"2025-05-21T05:08:00Z","snapshot_observed_at":"2026-08-19T22:16:45.375639Z","submitted_at":"2025-05-21T05:08:00Z","title":"Graph Foundation Models: A Comprehensive Survey","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T15:25:29.172671Z"},"links":{"citing_paper":"/paper/2505.15116"},"observation_digest":"sha256:34144f2ed545f7017e7f149fbf98facb327b3a105c375c76681318886b5815cc","observation_id":"ed7790ac-1507-4f88-803a-aff24f7af631","resolution":{"observed_at":"2026-08-07T15:25:29.172671Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:25:29.281517Z","title":"A comprehensive survey on transfer learning","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2505.15116","last_updated":"2025-05-21T05:08:00Z","snapshot_observed_at":"2026-08-19T22:16:45.375639Z","submitted_at":"2025-05-21T05:08:00Z","title":"Graph Foundation Models: A Comprehensive Survey","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T15:25:29.281517Z"},"links":{"citing_paper":"/paper/2505.15116"},"observation_digest":"sha256:93a6131f9195d99ce7bf07b1acd81a7deb0edec204e3cde3e8988ca4e05f0bb5","observation_id":"d76ea71d-262d-4595-9827-043d568627ac","resolution":{"observed_at":"2026-08-07T15:25:29.281517Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:25:29.320050Z","title":"Self-supervised learning: Generative or contrastive","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.15116","last_updated":"2025-05-21T05:08:00Z","snapshot_observed_at":"2026-08-19T22:16:45.375639Z","submitted_at":"2025-05-21T05:08:00Z","title":"Graph Foundation Models: A Comprehensive Survey","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T15:25:29.320050Z"},"links":{"citing_paper":"/paper/2505.15116"},"observation_digest":"sha256:b90ddc0cbb555683b7504caf9074cf409be9bf7ceb99ff0da64a10c43bd35df6","observation_id":"f7cd56ba-9457-4dfb-998a-c9c53857bac1","resolution":{"observed_at":"2026-08-07T15:25:29.320050Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:25:29.366871Z","title":"On the opportunities and risks of foundation models","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.15116","last_updated":"2025-05-21T05:08:00Z","snapshot_observed_at":"2026-08-19T22:16:45.375639Z","submitted_at":"2025-05-21T05:08:00Z","title":"Graph Foundation Models: A Comprehensive Survey","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T15:25:29.366871Z"},"links":{"citing_paper":"/paper/2505.15116"},"observation_digest":"sha256:015105ddbd59caebe7b99e7c2cd6e4c59c3587b6359dc988b28c4ff221702bed","observation_id":"194282a0-0262-423c-bbbf-fda3a06ae8fb","resolution":{"observed_at":"2026-08-07T15:25:29.366871Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:25:29.407758Z","title":"Scaling laws for neural language models","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2505.15116","last_updated":"2025-05-21T05:08:00Z","snapshot_observed_at":"2026-08-19T22:16:45.375639Z","submitted_at":"2025-05-21T05:08:00Z","title":"Graph Foundation Models: A Comprehensive Survey","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T15:25:29.407758Z"},"links":{"citing_paper":"/paper/2505.15116"},"observation_digest":"sha256:faa6442567acec07bff17800771ad2443de83e0073dcab2625ca8d1884ce811d","observation_id":"edd57c8e-692a-4aea-a5fb-e3fd8efbefb5","resolution":{"observed_at":"2026-08-07T15:25:29.407758Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:25:29.456883Z","title":"Scaling llm test-time compute optimally can be more effective than scaling model parameters","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.15116","last_updated":"2025-05-21T05:08:00Z","snapshot_observed_at":"2026-08-19T22:16:45.375639Z","submitted_at":"2025-05-21T05:08:00Z","title":"Graph Foundation Models: A Comprehensive Survey","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T15:25:29.456883Z"},"links":{"citing_paper":"/paper/2505.15116"},"observation_digest":"sha256:b8cf987cd74c0791162ba6b83cc5a3f13cfe2046dd77b48be9f056407af37ab3","observation_id":"3e1a8786-1749-40d2-928e-c39cb99847dd","resolution":{"observed_at":"2026-08-07T15:25:29.456883Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:25:29.510713Z","title":"Gpt-4 technical report","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.15116","last_updated":"2025-05-21T05:08:00Z","snapshot_observed_at":"2026-08-19T22:16:45.375639Z","submitted_at":"2025-05-21T05:08:00Z","title":"Graph Foundation Models: A Comprehensive Survey","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T15:25:29.510713Z"},"links":{"citing_paper":"/paper/2505.15116"},"observation_digest":"sha256:e66782dca6d12fc6fef6f9918e11eeb55885bb0f0efab92917cd32876b14d031","observation_id":"8d0593c0-ab5a-4164-9ccc-7cde1aad0a14","resolution":{"observed_at":"2026-08-07T15:25:29.510713Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:25:29.640858Z","title":"A comprehensive survey on pretrained foundation models: A history from bert to chatgpt","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.15116","last_updated":"2025-05-21T05:08:00Z","snapshot_observed_at":"2026-08-19T22:16:45.375639Z","submitted_at":"2025-05-21T05:08:00Z","title":"Graph Foundation Models: A Comprehensive Survey","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T15:25:29.640858Z"},"links":{"citing_paper":"/paper/2505.15116"},"observation_digest":"sha256:1f197cff8a70a8abfff1122f888f5b96e3f2a433a0d14f979d1b58effb729a24","observation_id":"486db1ce-0427-401a-ae0f-98358aac589b","resolution":{"observed_at":"2026-08-07T15:25:29.640858Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:25:29.757783Z","title":"Florence: A new foundation model for computer vision","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.15116","last_updated":"2025-05-21T05:08:00Z","snapshot_observed_at":"2026-08-19T22:16:45.375639Z","submitted_at":"2025-05-21T05:08:00Z","title":"Graph Foundation Models: A Comprehensive Survey","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T15:25:29.757783Z"},"links":{"citing_paper":"/paper/2505.15116"},"observation_digest":"sha256:638c7bfdf9996435b17849f55b589d727f5ffaa77e9158b9d82d37c367f0ecd9","observation_id":"5b78e7ac-2de5-4146-a2d6-7e29ab737689","resolution":{"observed_at":"2026-08-07T15:25:29.757783Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:25:29.908138Z","title":"Language model beats diffusion–tokenizer is key to visual generation","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.15116","last_updated":"2025-05-21T05:08:00Z","snapshot_observed_at":"2026-08-19T22:16:45.375639Z","submitted_at":"2025-05-21T05:08:00Z","title":"Graph Foundation Models: A Comprehensive Survey","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T15:25:29.908138Z"},"links":{"citing_paper":"/paper/2505.15116"},"observation_digest":"sha256:b97f5f01ae1368488e286609db9ac3e3b45c108739e35228d77a5cf0ff2a8ca9","observation_id":"7dc8a444-1f1a-41dc-b21e-d0f01b709447","resolution":{"observed_at":"2026-08-07T15:25:29.908138Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:25:30.000416Z","title":"Sequential modeling enables scalable learning for large vision models","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.15116","last_updated":"2025-05-21T05:08:00Z","snapshot_observed_at":"2026-08-19T22:16:45.375639Z","submitted_at":"2025-05-21T05:08:00Z","title":"Graph Foundation Models: A Comprehensive Survey","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T15:25:30.000416Z"},"links":{"citing_paper":"/paper/2505.15116"},"observation_digest":"sha256:28b7b12e7955ee6a1001f3227f1866de3f995acb24085826f3ff3ad9eefb80a9","observation_id":"7343c257-5659-4d07-8afa-e5d14cf5316c","resolution":{"observed_at":"2026-08-07T15:25:30.000416Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:25:30.118702Z","title":"Kipf and Max Welling","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2505.15116","last_updated":"2025-05-21T05:08:00Z","snapshot_observed_at":"2026-08-19T22:16:45.375639Z","submitted_at":"2025-05-21T05:08:00Z","title":"Graph Foundation Models: A Comprehensive Survey","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T15:25:30.118702Z"},"links":{"citing_paper":"/paper/2505.15116"},"observation_digest":"sha256:4332a241baf5883a15473adb4fd7a0eb4e54d4cb23e701553314366045a08343","observation_id":"880fb0ed-810a-4f29-a95f-a5f113452146","resolution":{"observed_at":"2026-08-07T15:25:30.118702Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:25:30.198120Z","title":"Graph attention networks","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2505.15116","last_updated":"2025-05-21T05:08:00Z","snapshot_observed_at":"2026-08-19T22:16:45.375639Z","submitted_at":"2025-05-21T05:08:00Z","title":"Graph Foundation Models: A Comprehensive Survey","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T15:25:30.198120Z"},"links":{"citing_paper":"/paper/2505.15116"},"observation_digest":"sha256:cf5a4630f20f75086b976b1a28569a30db08c587da8618fcf70bda9af234bb85","observation_id":"ab8a91e9-f8b1-4e69-a29f-6d889b47b512","resolution":{"observed_at":"2026-08-07T15:25:30.198120Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:25:30.302100Z","title":"Inductive representation learning on large graphs","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2505.15116","last_updated":"2025-05-21T05:08:00Z","snapshot_observed_at":"2026-08-19T22:16:45.375639Z","submitted_at":"2025-05-21T05:08:00Z","title":"Graph Foundation Models: A Comprehensive Survey","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-07T15:25:30.302100Z"},"links":{"citing_paper":"/paper/2505.15116"},"observation_digest":"sha256:6f718f74e41a64e4c32a67bc99f945efeecd02ab64d96a39ee119b29f660247d","observation_id":"c69bd90d-a6c1-4f6d-b8e3-e7ff69b82ece","resolution":{"observed_at":"2026-08-07T15:25:30.302100Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:25:30.461528Z","title":"One for all: Towards training one graph model for all classification tasks","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.15116","last_updated":"2025-05-21T05:08:00Z","snapshot_observed_at":"2026-08-19T22:16:45.375639Z","submitted_at":"2025-05-21T05:08:00Z","title":"Graph Foundation Models: A Comprehensive Survey","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-07T15:25:30.461528Z"},"links":{"citing_paper":"/paper/2505.15116"},"observation_digest":"sha256:616a949f90aac1f833aace67729067bf3d27d8e77103c3cabc75a228549133a1","observation_id":"c68f90fe-caf1-4876-ae5d-fdaaf1c032c9","resolution":{"observed_at":"2026-08-07T15:25:30.461528Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:25:30.536670Z","title":"GFT: Graph foundation model with transferable tree vocabulary","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.15116","last_updated":"2025-05-21T05:08:00Z","snapshot_observed_at":"2026-08-19T22:16:45.375639Z","submitted_at":"2025-05-21T05:08:00Z","title":"Graph Foundation Models: A Comprehensive Survey","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-07T15:25:30.536670Z"},"links":{"citing_paper":"/paper/2505.15116"},"observation_digest":"sha256:24a35b5597a70b20a4666b02de31eed9a39da43fd76a319bc0c32db6e8b5505f","observation_id":"01e64873-59a0-478e-88a9-6ef53fccf4ac","resolution":{"observed_at":"2026-08-07T15:25:30.536670Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:25:30.641293Z","title":"Zerog: Investigating cross-dataset zero-shot transferability in graphs","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.15116","last_updated":"2025-05-21T05:08:00Z","snapshot_observed_at":"2026-08-19T22:16:45.375639Z","submitted_at":"2025-05-21T05:08:00Z","title":"Graph Foundation Models: A Comprehensive Survey","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-07T15:25:30.641293Z"},"links":{"citing_paper":"/paper/2505.15116"},"observation_digest":"sha256:85df6a6d2e6a1b236cfbefc84a77a0fa8743d0428233999734d7c275f036b9d4","observation_id":"f21eb6c3-5e18-4e84-be22-2292691af0ea","resolution":{"observed_at":"2026-08-07T15:25:30.641293Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:25:30.727339Z","title":"All in one and one for all: A simple yet effective method towards cross-domain graph pretraining","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.15116","last_updated":"2025-05-21T05:08:00Z","snapshot_observed_at":"2026-08-19T22:16:45.375639Z","submitted_at":"2025-05-21T05:08:00Z","title":"Graph Foundation Models: A Comprehensive Survey","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-07T15:25:30.727339Z"},"links":{"citing_paper":"/paper/2505.15116"},"observation_digest":"sha256:b5c8594f27871207761845f9a0beb1d40f6cb8b547bd5669870f0192bccdff98","observation_id":"01c59653-57ab-4bd9-99d3-2028f0807280","resolution":{"observed_at":"2026-08-07T15:25:30.727339Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:25:30.821003Z","title":"AnomalyGFM: Graph Foundation Model for Zero/Few-shot Anomaly Detection","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.15116","last_updated":"2025-05-21T05:08:00Z","snapshot_observed_at":"2026-08-19T22:16:45.375639Z","submitted_at":"2025-05-21T05:08:00Z","title":"Graph Foundation Models: A Comprehensive Survey","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-07T15:25:30.821003Z"},"links":{"citing_paper":"/paper/2505.15116"},"observation_digest":"sha256:f690f6bf0eb260d6bc0767b1ed7f38ed5b7595037544cac2fe31ee958c628e9a","observation_id":"05ef17a4-faaa-400b-b965-b88bce01f8ce","resolution":{"observed_at":"2026-08-07T15:25:30.821003Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:25:30.926571Z","title":"An unified search and recommendation foundation model for cold-start scenario","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.15116","last_updated":"2025-05-21T05:08:00Z","snapshot_observed_at":"2026-08-19T22:16:45.375639Z","submitted_at":"2025-05-21T05:08:00Z","title":"Graph Foundation Models: A Comprehensive Survey","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-07T15:25:30.926571Z"},"links":{"citing_paper":"/paper/2505.15116"},"observation_digest":"sha256:e2067da83e3950afa43a5fadf06d08a508fa8a29403237baa3c749310bbec787","observation_id":"3f72dab7-fd82-4cf4-a0da-ed7644071fe9","resolution":{"observed_at":"2026-08-07T15:25:30.926571Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:25:31.010406Z","title":"Towards foundation models for knowledge graph reasoning","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.15116","last_updated":"2025-05-21T05:08:00Z","snapshot_observed_at":"2026-08-19T22:16:45.375639Z","submitted_at":"2025-05-21T05:08:00Z","title":"Graph Foundation Models: A Comprehensive Survey","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-07T15:25:31.010406Z"},"links":{"citing_paper":"/paper/2505.15116"},"observation_digest":"sha256:c31e8b92755b36c7f2bb0443e6527e202d3eede87e5ece4969c453f6dbffbb24","observation_id":"040e82fc-0789-4b87-a77f-bd1ed34d3ee6","resolution":{"observed_at":"2026-08-07T15:25:31.010406Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:25:31.152527Z","title":"A foundation model for zero-shot logical query reasoning","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.15116","last_updated":"2025-05-21T05:08:00Z","snapshot_observed_at":"2026-08-19T22:16:45.375639Z","submitted_at":"2025-05-21T05:08:00Z","title":"Graph Foundation Models: A Comprehensive Survey","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-07T15:25:31.152527Z"},"links":{"citing_paper":"/paper/2505.15116"},"observation_digest":"sha256:69e6fb920bb64d1fcf4daac514ab4272c679cde2ef1e2480743e820260ec0e9c","observation_id":"be0cabb8-209a-4555-93f8-d13b2cd493a8","resolution":{"observed_at":"2026-08-07T15:25:31.152527Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:25:31.260910Z","title":"From molecules to materials: Pre-training large generalizable models for atomic property prediction","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.15116","last_updated":"2025-05-21T05:08:00Z","snapshot_observed_at":"2026-08-19T22:16:45.375639Z","submitted_at":"2025-05-21T05:08:00Z","title":"Graph Foundation Models: A Comprehensive Survey","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-07T15:25:31.260910Z"},"links":{"citing_paper":"/paper/2505.15116"},"observation_digest":"sha256:edf3b39b067fc2aed60d0f52f8f92a33400af08086ae6f688d966cb6eb2d37e2","observation_id":"6c893f9e-cb0f-439a-8c33-a243a43f7fea","resolution":{"observed_at":"2026-08-07T15:25:31.260910Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:25:31.395647Z","title":"Unimot: Unified molecule-text language model with discrete token representation","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.15116","last_updated":"2025-05-21T05:08:00Z","snapshot_observed_at":"2026-08-19T22:16:45.375639Z","submitted_at":"2025-05-21T05:08:00Z","title":"Graph Foundation Models: A Comprehensive Survey","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-07T15:25:31.395647Z"},"links":{"citing_paper":"/paper/2505.15116"},"observation_digest":"sha256:9f2618ecd57bbc7ce7cfecc6bbcc1eeb0d90c0b8e623b0e1fe166e1e1f2c7415","observation_id":"6411abd7-bfa3-44ce-80cb-0c2f1ef70afc","resolution":{"observed_at":"2026-08-07T15:25:31.395647Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:25:31.469813Z","title":"Graphwiz: An instruction-following language model for graph computational problems","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.15116","last_updated":"2025-05-21T05:08:00Z","snapshot_observed_at":"2026-08-19T22:16:45.375639Z","submitted_at":"2025-05-21T05:08:00Z","title":"Graph Foundation Models: A Comprehensive Survey","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-07T15:25:31.469813Z"},"links":{"citing_paper":"/paper/2505.15116"},"observation_digest":"sha256:384a2a3557ad6bef6e314c1958c0d0b676923f451ae6631d8aa85c6c96489e30","observation_id":"87e77601-980e-40a5-bfb9-aa6ceab38c46","resolution":{"observed_at":"2026-08-07T15:25:31.469813Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:25:31.572988Z","title":"Gpt4graph: Can large language models understand graph structured data? an empirical evaluation and benchmarking","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.15116","last_updated":"2025-05-21T05:08:00Z","snapshot_observed_at":"2026-08-19T22:16:45.375639Z","submitted_at":"2025-05-21T05:08:00Z","title":"Graph Foundation Models: A Comprehensive Survey","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-07T15:25:31.572988Z"},"links":{"citing_paper":"/paper/2505.15116"},"observation_digest":"sha256:e65836b0cd3c8d266f0d2a6ddd6572dd50ecdcd6947fb60cdd8a4f0c442545cc","observation_id":"635dd025-f87c-4f60-b31c-82974ec0f531","resolution":{"observed_at":"2026-08-07T15:25:31.572988Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:25:31.689983Z","title":"Graph foundation models: Concepts, opportunities and challenges","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.15116","last_updated":"2025-05-21T05:08:00Z","snapshot_observed_at":"2026-08-19T22:16:45.375639Z","submitted_at":"2025-05-21T05:08:00Z","title":"Graph Foundation Models: A Comprehensive Survey","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-07T15:25:31.689983Z"},"links":{"citing_paper":"/paper/2505.15116"},"observation_digest":"sha256:3632f147c57415736b585dcad91834ff4ecb584d90412dbae96d5c183b656053","observation_id":"0060cf74-1e87-4b28-902f-ea4c013eac5f","resolution":{"observed_at":"2026-08-07T15:25:31.689983Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:25:31.769015Z","title":"A survey on self-supervised graph foundation models: Knowledge-based perspective","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.15116","last_updated":"2025-05-21T05:08:00Z","snapshot_observed_at":"2026-08-19T22:16:45.375639Z","submitted_at":"2025-05-21T05:08:00Z","title":"Graph Foundation Models: A Comprehensive Survey","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-07T15:25:31.769015Z"},"links":{"citing_paper":"/paper/2505.15116"},"observation_digest":"sha256:020ea82e3f23036c8613ea966130a4a63977f80dacfd9a63c7e56adb956bd728","observation_id":"f93296b8-15f6-4be3-9b71-fde0ec9c2b2d","resolution":{"observed_at":"2026-08-07T15:25:31.769015Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:25:31.856635Z","title":"Graph foundation models are already here","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.15116","last_updated":"2025-05-21T05:08:00Z","snapshot_observed_at":"2026-08-19T22:16:45.375639Z","submitted_at":"2025-05-21T05:08:00Z","title":"Graph Foundation Models: A Comprehensive Survey","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-07T15:25:31.856635Z"},"links":{"citing_paper":"/paper/2505.15116"},"observation_digest":"sha256:2bd7591954b668f2267f0c4e3815569e129eb0a3644e58351a2e1c85dba819d5","observation_id":"16430e77-2a1e-4fe4-a039-4a881e0c553a","resolution":{"observed_at":"2026-08-07T15:25:31.856635Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:25:31.954238Z","title":"Towards graph foundation models: A transferability perspective","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.15116","last_updated":"2025-05-21T05:08:00Z","snapshot_observed_at":"2026-08-19T22:16:45.375639Z","submitted_at":"2025-05-21T05:08:00Z","title":"Graph Foundation Models: A Comprehensive Survey","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-07T15:25:31.954238Z"},"links":{"citing_paper":"/paper/2505.15116"},"observation_digest":"sha256:496fb7e42fe4cb144c78b29cede5f0809cee31799dbc002d180aa7618746104a","observation_id":"b14f48dd-c865-4eea-9ed9-13a6ac0c7ab6","resolution":{"observed_at":"2026-08-07T15:25:31.954238Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:25:32.060773Z","title":"A survey of cross-domain graph learning: Progress and future directions","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.15116","last_updated":"2025-05-21T05:08:00Z","snapshot_observed_at":"2026-08-19T22:16:45.375639Z","submitted_at":"2025-05-21T05:08:00Z","title":"Graph Foundation Models: A Comprehensive Survey","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-07T15:25:32.060773Z"},"links":{"citing_paper":"/paper/2505.15116"},"observation_digest":"sha256:4918532a195e282a871c453cf1355db517f255b06c876251fd069b95ac610934","observation_id":"c1292460-4da7-40a8-a9ae-f095464dca47","resolution":{"observed_at":"2026-08-07T15:25:32.060773Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:25:32.183097Z","title":"Graph foundation models for recommendation: A comprehensive survey","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.15116","last_updated":"2025-05-21T05:08:00Z","snapshot_observed_at":"2026-08-19T22:16:45.375639Z","submitted_at":"2025-05-21T05:08:00Z","title":"Graph Foundation Models: A Comprehensive Survey","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-07T15:25:32.183097Z"},"links":{"citing_paper":"/paper/2505.15116"},"observation_digest":"sha256:2ed5e16fe69de83f418d4cfefd91bc810131430a04ceb9cac2337856141fd923","observation_id":"98bfa48d-c653-417f-b7f5-eeda0e4a0679","resolution":{"observed_at":"2026-08-07T15:25:32.183097Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:25:32.325129Z","title":"Large language models on graphs: A comprehensive survey","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.15116","last_updated":"2025-05-21T05:08:00Z","snapshot_observed_at":"2026-08-19T22:16:45.375639Z","submitted_at":"2025-05-21T05:08:00Z","title":"Graph Foundation Models: A Comprehensive Survey","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-07T15:25:32.325129Z"},"links":{"citing_paper":"/paper/2505.15116"},"observation_digest":"sha256:44a9f60827563dd57bc3ad8b0abc8fc421456545a581a0cbed0003e87d4dc0b2","observation_id":"4974ce26-842f-4d59-b5d6-92a2f3c70e48","resolution":{"observed_at":"2026-08-07T15:25:32.325129Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:25:32.505053Z","title":"A survey of graph meets large language model: Progress and future directions","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.15116","last_updated":"2025-05-21T05:08:00Z","snapshot_observed_at":"2026-08-19T22:16:45.375639Z","submitted_at":"2025-05-21T05:08:00Z","title":"Graph Foundation Models: A Comprehensive Survey","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-07T15:25:32.505053Z"},"links":{"citing_paper":"/paper/2505.15116"},"observation_digest":"sha256:1a3c086c2acdc53b43c874842878b4161e80ae60655dbbe08b808b5e88f5e466","observation_id":"29ad4d5c-6853-4cff-a432-72ced52ca399","resolution":{"observed_at":"2026-08-07T15:25:32.505053Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:25:32.743540Z","title":"Graph machine learning in the era of large language models (llms)","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.15116","last_updated":"2025-05-21T05:08:00Z","snapshot_observed_at":"2026-08-19T22:16:45.375639Z","submitted_at":"2025-05-21T05:08:00Z","title":"Graph Foundation Models: A Comprehensive Survey","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-07T15:25:32.743540Z"},"links":{"citing_paper":"/paper/2505.15116"},"observation_digest":"sha256:beb8fb985232761b629bf06029817fab98efca04a1fefebb45438b09e4fc5e94","observation_id":"7b679f72-f3bc-4a48-a488-5832ed6b7f2c","resolution":{"observed_at":"2026-08-07T15:25:32.743540Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:25:32.975198Z","title":"A survey of large language models for graphs","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.15116","last_updated":"2025-05-21T05:08:00Z","snapshot_observed_at":"2026-08-19T22:16:45.375639Z","submitted_at":"2025-05-21T05:08:00Z","title":"Graph Foundation Models: A Comprehensive Survey","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-07T15:25:32.975198Z"},"links":{"citing_paper":"/paper/2505.15116"},"observation_digest":"sha256:401e699aa2294a885cb45ca3953996bd9c09af9594efd91380e38c6248a55089","observation_id":"bec4d63f-4375-468d-9403-628c6aabfd46","resolution":{"observed_at":"2026-08-07T15:25:32.975198Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:25:33.174495Z","title":"Graph theory","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2505.15116","last_updated":"2025-05-21T05:08:00Z","snapshot_observed_at":"2026-08-19T22:16:45.375639Z","submitted_at":"2025-05-21T05:08:00Z","title":"Graph Foundation Models: A Comprehensive Survey","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-07T15:25:33.174495Z"},"links":{"citing_paper":"/paper/2505.15116"},"observation_digest":"sha256:772052835f1ff8d9f0ebf66025265c30784a364aaa98cb769e53a558371d1c09","observation_id":"3f5e96fd-96c4-4ecc-879f-ff90bbf872f0","resolution":{"observed_at":"2026-08-07T15:25:33.174495Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:25:33.291952Z","title":"An appraisal of some shortest-path algorithms","venue":null,"work_id":null,"year":1969},"citing_paper":{"arxiv_id":"2505.15116","last_updated":"2025-05-21T05:08:00Z","snapshot_observed_at":"2026-08-19T22:16:45.375639Z","submitted_at":"2025-05-21T05:08:00Z","title":"Graph Foundation Models: A Comprehensive Survey","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-07T15:25:33.291952Z"},"links":{"citing_paper":"/paper/2505.15116"},"observation_digest":"sha256:dde5e6069fcfdbafca030c000eb3d6f80df0336b09fb75454406ab4d4a325041","observation_id":"3ead917d-c8cf-41af-b764-ff79f4c236b8","resolution":{"observed_at":"2026-08-07T15:25:33.291952Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:25:33.442094Z","title":"A tutorial on spectral clustering","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2505.15116","last_updated":"2025-05-21T05:08:00Z","snapshot_observed_at":"2026-08-19T22:16:45.375639Z","submitted_at":"2025-05-21T05:08:00Z","title":"Graph Foundation Models: A Comprehensive Survey","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-07T15:25:33.442094Z"},"links":{"citing_paper":"/paper/2505.15116"},"observation_digest":"sha256:aedfa688d3e84cd9c08e49f62bc6747b5c51478b5233dfa7ccf717ba4fdfc5ca","observation_id":"d9d825f4-7f0f-415b-8c00-fb5072997428","resolution":{"observed_at":"2026-08-07T15:25:33.442094Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:25:33.565577Z","title":"Graph kernels","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2505.15116","last_updated":"2025-05-21T05:08:00Z","snapshot_observed_at":"2026-08-19T22:16:45.375639Z","submitted_at":"2025-05-21T05:08:00Z","title":"Graph Foundation Models: A Comprehensive Survey","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-07T15:25:33.565577Z"},"links":{"citing_paper":"/paper/2505.15116"},"observation_digest":"sha256:e64a67a9b984692b13b44bb3c3ff94920700a52ff578253feecf0fa5fab176ea","observation_id":"5fd4068c-f91d-4448-ae12-073388c9317b","resolution":{"observed_at":"2026-08-07T15:25:33.565577Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:25:33.744216Z","title":"Deepwalk: Online learning of social representations","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2505.15116","last_updated":"2025-05-21T05:08:00Z","snapshot_observed_at":"2026-08-19T22:16:45.375639Z","submitted_at":"2025-05-21T05:08:00Z","title":"Graph Foundation Models: A Comprehensive Survey","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-07T15:25:33.744216Z"},"links":{"citing_paper":"/paper/2505.15116"},"observation_digest":"sha256:908285b47bb2842370a1cebad876486c4e8e006134dd997617be94678661c328","observation_id":"69d3e4f9-72bd-4e52-bfa0-2d0db2f6b83d","resolution":{"observed_at":"2026-08-07T15:25:33.744216Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:25:33.853523Z","title":"node2vec: Scalable feature learning for networks","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2505.15116","last_updated":"2025-05-21T05:08:00Z","snapshot_observed_at":"2026-08-19T22:16:45.375639Z","submitted_at":"2025-05-21T05:08:00Z","title":"Graph Foundation Models: A Comprehensive Survey","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-07T15:25:33.853523Z"},"links":{"citing_paper":"/paper/2505.15116"},"observation_digest":"sha256:a1e4f5850182d4e8cf9feadbfef10481fcb365fbb7bcb4f561f62c607593e7c1","observation_id":"2335d0f8-1810-40d0-a553-0c1e5065ea0b","resolution":{"observed_at":"2026-08-07T15:25:33.853523Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:25:33.991197Z","title":"Line: Large-scale information network embedding","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2505.15116","last_updated":"2025-05-21T05:08:00Z","snapshot_observed_at":"2026-08-19T22:16:45.375639Z","submitted_at":"2025-05-21T05:08:00Z","title":"Graph Foundation Models: A Comprehensive Survey","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-07T15:25:33.991197Z"},"links":{"citing_paper":"/paper/2505.15116"},"observation_digest":"sha256:5432ffb4151788831778468b94dd61bd736731dc34fe5a18d9600801539bccd9","observation_id":"6cdb5d32-9c59-4180-8c34-1085eb8f247d","resolution":{"observed_at":"2026-08-07T15:25:33.991197Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:25:34.120724Z","title":"A comprehensive survey on graph neural networks","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2505.15116","last_updated":"2025-05-21T05:08:00Z","snapshot_observed_at":"2026-08-19T22:16:45.375639Z","submitted_at":"2025-05-21T05:08:00Z","title":"Graph Foundation Models: A Comprehensive Survey","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-07T15:25:34.120724Z"},"links":{"citing_paper":"/paper/2505.15116"},"observation_digest":"sha256:c07c7a70c7b56f62b28903b63bb09d488eaeac18da51c0dde128276fc561bbe4","observation_id":"6b1d1896-7dba-4e85-934c-b93b270d3c88","resolution":{"observed_at":"2026-08-07T15:25:34.120724Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:25:34.249004Z","title":"Neural message passing for quantum chemistry","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2505.15116","last_updated":"2025-05-21T05:08:00Z","snapshot_observed_at":"2026-08-19T22:16:45.375639Z","submitted_at":"2025-05-21T05:08:00Z","title":"Graph Foundation Models: A Comprehensive Survey","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-07T15:25:34.249004Z"},"links":{"citing_paper":"/paper/2505.15116"},"observation_digest":"sha256:fe90fc9380166382d6b4ed2ba7414626947d6415ae23a42c9b88a93db3b11333","observation_id":"42e3768f-7fa2-48c7-a902-d6d2ee222bfb","resolution":{"observed_at":"2026-08-07T15:25:34.249004Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:25:34.378914Z","title":"GOFA: A generative one-for-all model for joint graph language modeling","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.15116","last_updated":"2025-05-21T05:08:00Z","snapshot_observed_at":"2026-08-19T22:16:45.375639Z","submitted_at":"2025-05-21T05:08:00Z","title":"Graph Foundation Models: A Comprehensive Survey","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-07T15:25:34.378914Z"},"links":{"citing_paper":"/paper/2505.15116"},"observation_digest":"sha256:224c6c47624cae32155f358675b79f2413a8330b6e1997926dec92d43212302a","observation_id":"dcc4e033-aa13-4b77-861d-c0bd1c2f1b0d","resolution":{"observed_at":"2026-08-07T15:25:34.378914Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:25:34.484487Z","title":"Graph self- supervised learning: A survey","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.15116","last_updated":"2025-05-21T05:08:00Z","snapshot_observed_at":"2026-08-19T22:16:45.375639Z","submitted_at":"2025-05-21T05:08:00Z","title":"Graph Foundation Models: A Comprehensive Survey","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-07T15:25:34.484487Z"},"links":{"citing_paper":"/paper/2505.15116"},"observation_digest":"sha256:38c57cebd34224b4dc005018c4b6774e39195b7b207c9557a41577d033efb219","observation_id":"c3822cd2-815a-45d9-beb7-d88c0be9ff4f","resolution":{"observed_at":"2026-08-07T15:25:34.484487Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:25:34.610414Z","title":"Attention is all you need","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2505.15116","last_updated":"2025-05-21T05:08:00Z","snapshot_observed_at":"2026-08-19T22:16:45.375639Z","submitted_at":"2025-05-21T05:08:00Z","title":"Graph Foundation Models: A Comprehensive Survey","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-07T15:25:34.610414Z"},"links":{"citing_paper":"/paper/2505.15116"},"observation_digest":"sha256:a83aa899d71b275bcb7c31fd7e88c072f656808d176b1afc9fff2ccc54b53e6a","observation_id":"633f1a6c-b217-402a-a749-0e5aef68e520","resolution":{"observed_at":"2026-08-07T15:25:34.610414Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:25:34.721077Z","title":"Language models are few-shot learners","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2505.15116","last_updated":"2025-05-21T05:08:00Z","snapshot_observed_at":"2026-08-19T22:16:45.375639Z","submitted_at":"2025-05-21T05:08:00Z","title":"Graph Foundation Models: A Comprehensive Survey","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-07T15:25:34.721077Z"},"links":{"citing_paper":"/paper/2505.15116"},"observation_digest":"sha256:7b92258757385e1bf3108ef982ab451f810b941cdef6233839c0ed298ac5b008","observation_id":"0a80e130-374b-40c8-a71e-2cadcd5ce8e7","resolution":{"observed_at":"2026-08-07T15:25:34.721077Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:25:34.846376Z","title":"Bert: Pre-training of deep bidirectional transformers for language understanding","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2505.15116","last_updated":"2025-05-21T05:08:00Z","snapshot_observed_at":"2026-08-19T22:16:45.375639Z","submitted_at":"2025-05-21T05:08:00Z","title":"Graph Foundation Models: A Comprehensive Survey","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-07T15:25:34.846376Z"},"links":{"citing_paper":"/paper/2505.15116"},"observation_digest":"sha256:237392b8d4db3ae9e1631a0b69f5c37cc92f4d1894fff6a592087fd070d041dd","observation_id":"7be4a342-f0dc-4fed-8d3c-3fa628ff276b","resolution":{"observed_at":"2026-08-07T15:25:34.846376Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2305.10403","last_updated":"2023-09-13T20:35:45Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-05-17T17:46:53Z","title":"PaLM 2 Technical Report","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.10403","snapshot_observed_at":"2026-08-07T15:25:34.982633Z","title":"Palm 2 technical report","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.15116","last_updated":"2025-05-21T05:08:00Z","snapshot_observed_at":"2026-08-19T22:16:45.375639Z","submitted_at":"2025-05-21T05:08:00Z","title":"Graph Foundation Models: A Comprehensive Survey","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-07T15:25:34.982633Z"},"links":{"cited_paper":"/paper/2305.10403","citing_paper":"/paper/2505.15116"},"observation_digest":"sha256:93def72d61609bae74c3125d85b98a3472edf532bf21404b6313c9297196f14b","observation_id":"ac5a462b-f6e9-4f86-9954-3b96acd633ca","resolution":{"observed_at":"2026-08-07T15:25:34.982633Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:25:35.079570Z","title":"Llama: Open and efficient foundation language models","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.15116","last_updated":"2025-05-21T05:08:00Z","snapshot_observed_at":"2026-08-19T22:16:45.375639Z","submitted_at":"2025-05-21T05:08:00Z","title":"Graph Foundation Models: A Comprehensive Survey","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-07T15:25:35.079570Z"},"links":{"citing_paper":"/paper/2505.15116"},"observation_digest":"sha256:031d1bc4ddd96caaf777d2bda7147948e3e9aee629ed5f03cd53ca2554f2f713","observation_id":"ca720174-1f5a-4a21-89b2-1f1c67bc377a","resolution":{"observed_at":"2026-08-07T15:25:35.079570Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:25:35.220909Z","title":"Learning transferable visual models from natural language supervision","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.15116","last_updated":"2025-05-21T05:08:00Z","snapshot_observed_at":"2026-08-19T22:16:45.375639Z","submitted_at":"2025-05-21T05:08:00Z","title":"Graph Foundation Models: A Comprehensive Survey","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-07T15:25:35.220909Z"},"links":{"citing_paper":"/paper/2505.15116"},"observation_digest":"sha256:87bfb448cb59cd96759350155c1bf29eb30e00ae9b7b8179ecbbbec5ed40fb51","observation_id":"02913c72-894c-4dd7-835c-4711c8108fac","resolution":{"observed_at":"2026-08-07T15:25:35.220909Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:25:35.344065Z","title":"Zero-shot text-to-image generation","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.15116","last_updated":"2025-05-21T05:08:00Z","snapshot_observed_at":"2026-08-19T22:16:45.375639Z","submitted_at":"2025-05-21T05:08:00Z","title":"Graph Foundation Models: A Comprehensive Survey","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-07T15:25:35.344065Z"},"links":{"citing_paper":"/paper/2505.15116"},"observation_digest":"sha256:02675e5f8505dc45272e64f2dba2a44d3cc6c3d2f773cf79bf1fa400c3a38135","observation_id":"a471f7b8-46c2-40b0-96d8-196d12cb690c","resolution":{"observed_at":"2026-08-07T15:25:35.344065Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:25:35.454030Z","title":"Emergent abilities of large language models","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.15116","last_updated":"2025-05-21T05:08:00Z","snapshot_observed_at":"2026-08-19T22:16:45.375639Z","submitted_at":"2025-05-21T05:08:00Z","title":"Graph Foundation Models: A Comprehensive Survey","version":1},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-07T15:25:35.454030Z"},"links":{"citing_paper":"/paper/2505.15116"},"observation_digest":"sha256:df35e225c619800133cb3a7a86c6d11def58353a9d7d757115160e4565522ad3","observation_id":"603576ef-d9ee-42fd-ba2e-2b36fc6ed408","resolution":{"observed_at":"2026-08-07T15:25:35.454030Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:25:35.565076Z","title":"Opengraph: Towards open graph foundation models","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.15116","last_updated":"2025-05-21T05:08:00Z","snapshot_observed_at":"2026-08-19T22:16:45.375639Z","submitted_at":"2025-05-21T05:08:00Z","title":"Graph Foundation Models: A Comprehensive Survey","version":1},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-07T15:25:35.565076Z"},"links":{"citing_paper":"/paper/2505.15116"},"observation_digest":"sha256:b7a65f3661b8cb21c10f1a39c7a6b8a521945426e7da296eb3312ca8d4aa9348","observation_id":"315393c3-ae94-4622-842f-5646cba76bf6","resolution":{"observed_at":"2026-08-07T15:25:35.565076Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:25:35.670881Z","title":"Anygraph: Graph foundation model in the wild","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.15116","last_updated":"2025-05-21T05:08:00Z","snapshot_observed_at":"2026-08-19T22:16:45.375639Z","submitted_at":"2025-05-21T05:08:00Z","title":"Graph Foundation Models: A Comprehensive Survey","version":1},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-07T15:25:35.670881Z"},"links":{"citing_paper":"/paper/2505.15116"},"observation_digest":"sha256:e23a1930345af3bedce0067c8315b21ac70377842514c16ee13bb41e7c4f1d99","observation_id":"0b04e82a-560f-45e8-8e1f-41b78ab28a9e","resolution":{"observed_at":"2026-08-07T15:25:35.670881Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:25:35.793088Z","title":"Samgpt: Text-free graph foundation model for multi-domain pre-training and cross-domain adaptation","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.15116","last_updated":"2025-05-21T05:08:00Z","snapshot_observed_at":"2026-08-19T22:16:45.375639Z","submitted_at":"2025-05-21T05:08:00Z","title":"Graph Foundation Models: A Comprehensive Survey","version":1},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-08-07T15:25:35.793088Z"},"links":{"citing_paper":"/paper/2505.15116"},"observation_digest":"sha256:aa1cabfe5ecb2b89cace19cefb0fea7ac6a567c2f67051413e6a7e0a1856d870","observation_id":"4fce54e0-d1c1-44db-a8f1-7006de6b2696","resolution":{"observed_at":"2026-08-07T15:25:35.793088Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:25:35.927253Z","title":"Fully-inductive node classification on arbitrary graphs","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.15116","last_updated":"2025-05-21T05:08:00Z","snapshot_observed_at":"2026-08-19T22:16:45.375639Z","submitted_at":"2025-05-21T05:08:00Z","title":"Graph Foundation Models: A Comprehensive Survey","version":1},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-08-07T15:25:35.927253Z"},"links":{"citing_paper":"/paper/2505.15116"},"observation_digest":"sha256:5e98db543c48242c8a73cecb6d34451612064fa286be2992f32b24b43fcebdc8","observation_id":"f035f232-55c5-4877-81f1-12ba3c1186ed","resolution":{"observed_at":"2026-08-07T15:25:35.927253Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:25:36.082228Z","title":"Not too little, not too much: a theoretical analysis of graph (over) smoothing","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.15116","last_updated":"2025-05-21T05:08:00Z","snapshot_observed_at":"2026-08-19T22:16:45.375639Z","submitted_at":"2025-05-21T05:08:00Z","title":"Graph Foundation Models: A Comprehensive Survey","version":1},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-08-07T15:25:36.082228Z"},"links":{"citing_paper":"/paper/2505.15116"},"observation_digest":"sha256:dbd9156778a4d051f21ef97f7465993cbf63af47b22a2bdf1e3f4ad4f951d8de","observation_id":"f0e47df8-3177-4240-a5ec-2abb197964ad","resolution":{"observed_at":"2026-08-07T15:25:36.082228Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:25:36.194155Z","title":"Understanding over-squashing and bottlenecks on graphs via curvature","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.15116","last_updated":"2025-05-21T05:08:00Z","snapshot_observed_at":"2026-08-19T22:16:45.375639Z","submitted_at":"2025-05-21T05:08:00Z","title":"Graph Foundation Models: A Comprehensive Survey","version":1},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-08-07T15:25:36.194155Z"},"links":{"citing_paper":"/paper/2505.15116"},"observation_digest":"sha256:d632878122c842bd5d0053cf84b16c62c9d96322fad16bd0c2bb633c216f79b0","observation_id":"1dff4147-bb27-48bc-b587-5f5c5dc610cc","resolution":{"observed_at":"2026-08-07T15:25:36.194155Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:25:36.312629Z","title":"Is homophily a necessity for graph neural networks? In ICLR, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.15116","last_updated":"2025-05-21T05:08:00Z","snapshot_observed_at":"2026-08-19T22:16:45.375639Z","submitted_at":"2025-05-21T05:08:00Z","title":"Graph Foundation Models: A Comprehensive Survey","version":1},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-08-07T15:25:36.312629Z"},"links":{"citing_paper":"/paper/2505.15116"},"observation_digest":"sha256:b9a869e2791a15c4c4d4b321a7426dbdbe02dc1ab968d2e55503e597f5d19874","observation_id":"9e53b2bb-2eee-411a-a2a9-f153fdd664fa","resolution":{"observed_at":"2026-08-07T15:25:36.312629Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:25:36.438875Z","title":"Cross-domain graph data scaling: A showcase with diffusion models","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.15116","last_updated":"2025-05-21T05:08:00Z","snapshot_observed_at":"2026-08-19T22:16:45.375639Z","submitted_at":"2025-05-21T05:08:00Z","title":"Graph Foundation Models: A Comprehensive Survey","version":1},"reference_index":70,"source":"pdf_text","source_observed_at":"2026-08-07T15:25:36.438875Z"},"links":{"citing_paper":"/paper/2505.15116"},"observation_digest":"sha256:aeeb5bd350dbad13af03c41d8613407fc4d013a1acecf0c7a436defd7ba5ba45","observation_id":"2821e478-76f3-436f-8f59-34859ce08898","resolution":{"observed_at":"2026-08-07T15:25:36.438875Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:25:36.520382Z","title":"Inductive graph alignment prompt: Bridging the gap between graph pre-training and inductive fine-tuning from spectral perspective","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.15116","last_updated":"2025-05-21T05:08:00Z","snapshot_observed_at":"2026-08-19T22:16:45.375639Z","submitted_at":"2025-05-21T05:08:00Z","title":"Graph Foundation Models: A Comprehensive Survey","version":1},"reference_index":71,"source":"pdf_text","source_observed_at":"2026-08-07T15:25:36.520382Z"},"links":{"citing_paper":"/paper/2505.15116"},"observation_digest":"sha256:e1ff8d43ebd50b56ef160c02545729b8688dc96cb23cb17df2f6d9181849083a","observation_id":"cd77d7e3-c1f3-4e25-874d-0a2d37d4e3f3","resolution":{"observed_at":"2026-08-07T15:25:36.520382Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:25:36.650424Z","title":"Edge prompt tuning for graph neural networks","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.15116","last_updated":"2025-05-21T05:08:00Z","snapshot_observed_at":"2026-08-19T22:16:45.375639Z","submitted_at":"2025-05-21T05:08:00Z","title":"Graph Foundation Models: A Comprehensive Survey","version":1},"reference_index":72,"source":"pdf_text","source_observed_at":"2026-08-07T15:25:36.650424Z"},"links":{"citing_paper":"/paper/2505.15116"},"observation_digest":"sha256:36c04e076318cd8c084e77472e7df0551c5cf5021669327f73f4f2c967162f3e","observation_id":"cf6c189b-e448-4c6a-bbf0-1bc52eeb1470","resolution":{"observed_at":"2026-08-07T15:25:36.650424Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:25:36.761338Z","title":"Mole-bert: Rethinking pre-training graph neural networks for molecules","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.15116","last_updated":"2025-05-21T05:08:00Z","snapshot_observed_at":"2026-08-19T22:16:45.375639Z","submitted_at":"2025-05-21T05:08:00Z","title":"Graph Foundation Models: A Comprehensive Survey","version":1},"reference_index":73,"source":"pdf_text","source_observed_at":"2026-08-07T15:25:36.761338Z"},"links":{"citing_paper":"/paper/2505.15116"},"observation_digest":"sha256:8ff955f58ece47ce95b78481d4f8304c34eb5bccad77293c76b11f2b9624415a","observation_id":"87eee09b-7b31-4c05-871a-faccd155e1c0","resolution":{"observed_at":"2026-08-07T15:25:36.761338Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:25:36.856204Z","title":"Gppt: Graph pre-training and prompt tuning to generalize graph neural networks","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.15116","last_updated":"2025-05-21T05:08:00Z","snapshot_observed_at":"2026-08-19T22:16:45.375639Z","submitted_at":"2025-05-21T05:08:00Z","title":"Graph Foundation Models: A Comprehensive Survey","version":1},"reference_index":74,"source":"pdf_text","source_observed_at":"2026-08-07T15:25:36.856204Z"},"links":{"citing_paper":"/paper/2505.15116"},"observation_digest":"sha256:db2baa7f5801f82060ce2136a49466f14f530867fa0ac25bf734be86cce01b20","observation_id":"25ff9e6b-50ee-48ba-b5fc-5a1b4e491ad2","resolution":{"observed_at":"2026-08-07T15:25:36.856204Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:25:36.962454Z","title":"Unigraph: Learning a cross-domain graph foundation model from natural language","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.15116","last_updated":"2025-05-21T05:08:00Z","snapshot_observed_at":"2026-08-19T22:16:45.375639Z","submitted_at":"2025-05-21T05:08:00Z","title":"Graph Foundation Models: A Comprehensive Survey","version":1},"reference_index":75,"source":"pdf_text","source_observed_at":"2026-08-07T15:25:36.962454Z"},"links":{"citing_paper":"/paper/2505.15116"},"observation_digest":"sha256:a259845445db3d3169de5b442b283931ad1ca371639c3f9005be51c09a90f639","observation_id":"05ce2bad-50be-4790-bc43-29aee4dd8882","resolution":{"observed_at":"2026-08-07T15:25:36.962454Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:25:37.056897Z","title":"Learning cross-task generalities across graphs via task-trees","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.15116","last_updated":"2025-05-21T05:08:00Z","snapshot_observed_at":"2026-08-19T22:16:45.375639Z","submitted_at":"2025-05-21T05:08:00Z","title":"Graph Foundation Models: A Comprehensive Survey","version":1},"reference_index":76,"source":"pdf_text","source_observed_at":"2026-08-07T15:25:37.056897Z"},"links":{"citing_paper":"/paper/2505.15116"},"observation_digest":"sha256:16c93a05b81f1545db8d191c53c6640c55b953bfb58677488ac3d9cd908381f8","observation_id":"97128147-b87b-4183-9b7b-5b181c37a8ba","resolution":{"observed_at":"2026-08-07T15:25:37.056897Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:25:37.136631Z","title":"Holographic node represen- tations: Pre-training task-agnostic node embeddings","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.15116","last_updated":"2025-05-21T05:08:00Z","snapshot_observed_at":"2026-08-19T22:16:45.375639Z","submitted_at":"2025-05-21T05:08:00Z","title":"Graph Foundation Models: A Comprehensive Survey","version":1},"reference_index":77,"source":"pdf_text","source_observed_at":"2026-08-07T15:25:37.136631Z"},"links":{"citing_paper":"/paper/2505.15116"},"observation_digest":"sha256:4065f1ffdd56ba7e66bb7ba7ca40fbe22e1d17e5724b56a810f52a3ed9c937a3","observation_id":"559ed81c-f98a-4ab5-86f7-921173668a99","resolution":{"observed_at":"2026-08-07T15:25:37.136631Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:25:37.255499Z","title":"Llaga: Large language and graph assistant","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.15116","last_updated":"2025-05-21T05:08:00Z","snapshot_observed_at":"2026-08-19T22:16:45.375639Z","submitted_at":"2025-05-21T05:08:00Z","title":"Graph Foundation Models: A Comprehensive Survey","version":1},"reference_index":78,"source":"pdf_text","source_observed_at":"2026-08-07T15:25:37.255499Z"},"links":{"citing_paper":"/paper/2505.15116"},"observation_digest":"sha256:0292a6b3812c3726dcaead215036fac34a42c59624fee94583181c93b7137b0f","observation_id":"8fe89e14-5a7d-4b69-92bc-7ffca9d9a255","resolution":{"observed_at":"2026-08-07T15:25:37.255499Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:25:37.389634Z","title":"Mopi-hfrs: A multi- objective personalized health-aware food recommendation system with llm-enhanced interpretation","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.15116","last_updated":"2025-05-21T05:08:00Z","snapshot_observed_at":"2026-08-19T22:16:45.375639Z","submitted_at":"2025-05-21T05:08:00Z","title":"Graph Foundation Models: A Comprehensive Survey","version":1},"reference_index":79,"source":"pdf_text","source_observed_at":"2026-08-07T15:25:37.389634Z"},"links":{"citing_paper":"/paper/2505.15116"},"observation_digest":"sha256:99403854f94394b42df98ff44f203ffda905b6231af90c050bb69fc52230eb70","observation_id":"47655b28-ab78-4979-bd87-7816f4397aa1","resolution":{"observed_at":"2026-08-07T15:25:37.389634Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:25:37.502054Z","title":"Graphbert: Bridging graph and text for malicious behavior detection on social media","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.15116","last_updated":"2025-05-21T05:08:00Z","snapshot_observed_at":"2026-08-19T22:16:45.375639Z","submitted_at":"2025-05-21T05:08:00Z","title":"Graph Foundation Models: A Comprehensive Survey","version":1},"reference_index":80,"source":"pdf_text","source_observed_at":"2026-08-07T15:25:37.502054Z"},"links":{"citing_paper":"/paper/2505.15116"},"observation_digest":"sha256:c1404e85cb1f05ef4fb4e3b821ef402fd24ba1390190635e27643d69f86a88fd","observation_id":"2de9bbbe-3aae-4770-9c19-b12ff78165bf","resolution":{"observed_at":"2026-08-07T15:25:37.502054Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:25:37.599361Z","title":"Subgraph pooling: Tackling negative transfer on graphs","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.15116","last_updated":"2025-05-21T05:08:00Z","snapshot_observed_at":"2026-08-19T22:16:45.375639Z","submitted_at":"2025-05-21T05:08:00Z","title":"Graph Foundation Models: A Comprehensive Survey","version":1},"reference_index":81,"source":"pdf_text","source_observed_at":"2026-08-07T15:25:37.599361Z"},"links":{"citing_paper":"/paper/2505.15116"},"observation_digest":"sha256:d621e8fcde8637636cddfe4010c7025cd8490ecc5ad88c5a2fae57f2c33c94a3","observation_id":"7a4bbb76-8397-48c3-857d-880f30eadad6","resolution":{"observed_at":"2026-08-07T15:25:37.599361Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:25:37.700423Z","title":"A review: Knowledge reasoning over knowledge graph","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2505.15116","last_updated":"2025-05-21T05:08:00Z","snapshot_observed_at":"2026-08-19T22:16:45.375639Z","submitted_at":"2025-05-21T05:08:00Z","title":"Graph Foundation Models: A Comprehensive Survey","version":1},"reference_index":82,"source":"pdf_text","source_observed_at":"2026-08-07T15:25:37.700423Z"},"links":{"citing_paper":"/paper/2505.15116"},"observation_digest":"sha256:5c7565c8d8c95f4415d156b360fd45653855251af9815b0874778a5ef1eeb933","observation_id":"03de61c8-5b10-4c56-ad74-c7b2e9586120","resolution":{"observed_at":"2026-08-07T15:25:37.700423Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:25:37.805062Z","title":"Ngqa: A nutritional graph question answering benchmark for personalized health-aware nutritional reasoning","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.15116","last_updated":"2025-05-21T05:08:00Z","snapshot_observed_at":"2026-08-19T22:16:45.375639Z","submitted_at":"2025-05-21T05:08:00Z","title":"Graph Foundation Models: A Comprehensive Survey","version":1},"reference_index":83,"source":"pdf_text","source_observed_at":"2026-08-07T15:25:37.805062Z"},"links":{"citing_paper":"/paper/2505.15116"},"observation_digest":"sha256:364356ab7548fe89f0b3fb95bf195bc124938bd63f268eb21d5d147adf873ec5","observation_id":"48af8c65-6d48-4e97-aa7e-55d7b451aa44","resolution":{"observed_at":"2026-08-07T15:25:37.805062Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:25:37.894471Z","title":"Diet-odin: A novel framework for opioid misuse detection with interpretable dietary patterns","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.15116","last_updated":"2025-05-21T05:08:00Z","snapshot_observed_at":"2026-08-19T22:16:45.375639Z","submitted_at":"2025-05-21T05:08:00Z","title":"Graph Foundation Models: A Comprehensive Survey","version":1},"reference_index":84,"source":"pdf_text","source_observed_at":"2026-08-07T15:25:37.894471Z"},"links":{"citing_paper":"/paper/2505.15116"},"observation_digest":"sha256:63cdedbea4b9869e3b3c8aa440c097da833ef3690cee4d85146bad0726bba11e","observation_id":"4c00679e-0732-4723-91a8-893270c26b5a","resolution":{"observed_at":"2026-08-07T15:25:37.894471Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:25:37.988148Z","title":"A generalization of transformer networks to graphs","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2505.15116","last_updated":"2025-05-21T05:08:00Z","snapshot_observed_at":"2026-08-19T22:16:45.375639Z","submitted_at":"2025-05-21T05:08:00Z","title":"Graph Foundation Models: A Comprehensive Survey","version":1},"reference_index":85,"source":"pdf_text","source_observed_at":"2026-08-07T15:25:37.988148Z"},"links":{"citing_paper":"/paper/2505.15116"},"observation_digest":"sha256:38e2c2b1cce55efb458c05a7ca6531563888dbbf392c7ff217b84dca5bfad125","observation_id":"796330d9-002c-4c2b-95db-fe3ed3def44d","resolution":{"observed_at":"2026-08-07T15:25:37.988148Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:25:38.072008Z","title":"Neural graph pattern machine","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.15116","last_updated":"2025-05-21T05:08:00Z","snapshot_observed_at":"2026-08-19T22:16:45.375639Z","submitted_at":"2025-05-21T05:08:00Z","title":"Graph Foundation Models: A Comprehensive Survey","version":1},"reference_index":86,"source":"pdf_text","source_observed_at":"2026-08-07T15:25:38.072008Z"},"links":{"citing_paper":"/paper/2505.15116"},"observation_digest":"sha256:d08ad22ac8bdeb804423e4b890bd76b0223822625a37f97943b5ad749827802d","observation_id":"beb6ddca-82b1-4500-a654-5ec6c90bf794","resolution":{"observed_at":"2026-08-07T15:25:38.072008Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:25:38.177475Z","title":"Recipe for a general, powerful, scalable graph transformer","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.15116","last_updated":"2025-05-21T05:08:00Z","snapshot_observed_at":"2026-08-19T22:16:45.375639Z","submitted_at":"2025-05-21T05:08:00Z","title":"Graph Foundation Models: A Comprehensive Survey","version":1},"reference_index":87,"source":"pdf_text","source_observed_at":"2026-08-07T15:25:38.177475Z"},"links":{"citing_paper":"/paper/2505.15116"},"observation_digest":"sha256:bb7b7dc077f0a3fcf945038cac1bc7a6bea63a528117865a7711d3a8d55d625b","observation_id":"a33af367-2c2a-4b6c-b4da-7839330c25a7","resolution":{"observed_at":"2026-08-07T15:25:38.177475Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:25:38.265469Z","title":"Minimol: A parameter-efficient foundation model for molecular learning","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.15116","last_updated":"2025-05-21T05:08:00Z","snapshot_observed_at":"2026-08-19T22:16:45.375639Z","submitted_at":"2025-05-21T05:08:00Z","title":"Graph Foundation Models: A Comprehensive Survey","version":1},"reference_index":88,"source":"pdf_text","source_observed_at":"2026-08-07T15:25:38.265469Z"},"links":{"citing_paper":"/paper/2505.15116"},"observation_digest":"sha256:5a85195e03dd97d1ae649a39985bd4061c983e5f785ba72567aec3784bc9bc13","observation_id":"41a4f45d-6511-4c98-a676-5282f11987ad","resolution":{"observed_at":"2026-08-07T15:25:38.265469Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:25:38.347557Z","title":"Harnessing explanations: Llm-to-lm interpreter for enhanced text-attributed graph representation learning","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.15116","last_updated":"2025-05-21T05:08:00Z","snapshot_observed_at":"2026-08-19T22:16:45.375639Z","submitted_at":"2025-05-21T05:08:00Z","title":"Graph Foundation Models: A Comprehensive Survey","version":1},"reference_index":89,"source":"pdf_text","source_observed_at":"2026-08-07T15:25:38.347557Z"},"links":{"citing_paper":"/paper/2505.15116"},"observation_digest":"sha256:91351382bfd61f1e64e9d68116f34e9ac09b2750486982b83822b74fd88c6a7a","observation_id":"a9038dc9-14a6-4103-a45b-822321919a48","resolution":{"observed_at":"2026-08-07T15:25:38.347557Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:25:38.447515Z","title":"A survey of large language models","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.15116","last_updated":"2025-05-21T05:08:00Z","snapshot_observed_at":"2026-08-19T22:16:45.375639Z","submitted_at":"2025-05-21T05:08:00Z","title":"Graph Foundation Models: A Comprehensive Survey","version":1},"reference_index":90,"source":"pdf_text","source_observed_at":"2026-08-07T15:25:38.447515Z"},"links":{"citing_paper":"/paper/2505.15116"},"observation_digest":"sha256:525f591afad8e98beddecffb34e459d6eae86d2541bdb575020790ade3704cf5","observation_id":"cfa0b9e8-3f94-4ce4-aa41-23c505f78eb7","resolution":{"observed_at":"2026-08-07T15:25:38.447515Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:25:38.540001Z","title":"Llama 2: Open foundation and fine-tuned chat models","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.15116","last_updated":"2025-05-21T05:08:00Z","snapshot_observed_at":"2026-08-19T22:16:45.375639Z","submitted_at":"2025-05-21T05:08:00Z","title":"Graph Foundation Models: A Comprehensive Survey","version":1},"reference_index":91,"source":"pdf_text","source_observed_at":"2026-08-07T15:25:38.540001Z"},"links":{"citing_paper":"/paper/2505.15116"},"observation_digest":"sha256:79bcd8d7f90391dd802e61bc197a115c231456b17e95e90f841221df9ece4885","observation_id":"f60e1fed-29f3-482d-b83b-45ee92aca06e","resolution":{"observed_at":"2026-08-07T15:25:38.540001Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:25:38.623462Z","title":"The llama 3 herd of models","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.15116","last_updated":"2025-05-21T05:08:00Z","snapshot_observed_at":"2026-08-19T22:16:45.375639Z","submitted_at":"2025-05-21T05:08:00Z","title":"Graph Foundation Models: A Comprehensive Survey","version":1},"reference_index":92,"source":"pdf_text","source_observed_at":"2026-08-07T15:25:38.623462Z"},"links":{"citing_paper":"/paper/2505.15116"},"observation_digest":"sha256:c3d81dc4c4cc38fd9196c85e56661b14efa86fd794d2a74ccc5d2bf187dcf12d","observation_id":"f1ea3fbb-6cc5-4d2d-b917-0e57939b4797","resolution":{"observed_at":"2026-08-07T15:25:38.623462Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:25:38.717414Z","title":"Qwen technical report","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.15116","last_updated":"2025-05-21T05:08:00Z","snapshot_observed_at":"2026-08-19T22:16:45.375639Z","submitted_at":"2025-05-21T05:08:00Z","title":"Graph Foundation Models: A Comprehensive Survey","version":1},"reference_index":93,"source":"pdf_text","source_observed_at":"2026-08-07T15:25:38.717414Z"},"links":{"citing_paper":"/paper/2505.15116"},"observation_digest":"sha256:9ec3fabf0412b9067564f1756a9b8b077df03c9b9677455288f0b9c4ed765b47","observation_id":"43ba5df4-4c19-49a6-8371-696b10bfd9f5","resolution":{"observed_at":"2026-08-07T15:25:38.717414Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:25:38.801679Z","title":"Deepseek-r1: Incentivizing reasoning capability in llms via reinforcement learning","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.15116","last_updated":"2025-05-21T05:08:00Z","snapshot_observed_at":"2026-08-19T22:16:45.375639Z","submitted_at":"2025-05-21T05:08:00Z","title":"Graph Foundation Models: A Comprehensive Survey","version":1},"reference_index":94,"source":"pdf_text","source_observed_at":"2026-08-07T15:25:38.801679Z"},"links":{"citing_paper":"/paper/2505.15116"},"observation_digest":"sha256:59362bd0352fc21fefd4761ce9447993a1f3728116ef6638d1c3a9d690fe2b54","observation_id":"643c0970-df8b-4d6d-9a2d-409b0cba8190","resolution":{"observed_at":"2026-08-07T15:25:38.801679Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:25:38.865839Z","title":"Understanding and modeling job marketplace with pretrained language models","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.15116","last_updated":"2025-05-21T05:08:00Z","snapshot_observed_at":"2026-08-19T22:16:45.375639Z","submitted_at":"2025-05-21T05:08:00Z","title":"Graph Foundation Models: A Comprehensive Survey","version":1},"reference_index":95,"source":"pdf_text","source_observed_at":"2026-08-07T15:25:38.865839Z"},"links":{"citing_paper":"/paper/2505.15116"},"observation_digest":"sha256:e6a4a8afe4046fd3284ed740e15301e79f69212119b41108dc7cfb99409a3588","observation_id":"4ac58037-06af-4275-b68f-7bac4a1c9ad3","resolution":{"observed_at":"2026-08-07T15:25:38.865839Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2301.00234","last_updated":"2024-10-05T11:47:02Z","snapshot_observed_at":"2026-07-06T14:36:25.690733Z","submitted_at":"2022-12-31T15:57:09Z","title":"A Survey on In-context Learning","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2301.00234","snapshot_observed_at":"2026-08-07T15:25:38.913487Z","title":"A survey on in-context learning","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.15116","last_updated":"2025-05-21T05:08:00Z","snapshot_observed_at":"2026-08-19T22:16:45.375639Z","submitted_at":"2025-05-21T05:08:00Z","title":"Graph Foundation Models: A Comprehensive Survey","version":1},"reference_index":96,"source":"pdf_text","source_observed_at":"2026-08-07T15:25:38.913487Z"},"links":{"cited_paper":"/paper/2301.00234","citing_paper":"/paper/2505.15116"},"observation_digest":"sha256:b702eda741d37060409adde5a5351a5991481abe2f2e19cfa29c65468fd22895","observation_id":"44fd4df6-2bb6-415a-806d-1f7d354e1121","resolution":{"observed_at":"2026-08-07T15:25:38.913487Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:25:39.015166Z","title":"Chain-of-thought prompting elicits reasoning in large language models","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.15116","last_updated":"2025-05-21T05:08:00Z","snapshot_observed_at":"2026-08-19T22:16:45.375639Z","submitted_at":"2025-05-21T05:08:00Z","title":"Graph Foundation Models: A Comprehensive Survey","version":1},"reference_index":97,"source":"pdf_text","source_observed_at":"2026-08-07T15:25:39.015166Z"},"links":{"citing_paper":"/paper/2505.15116"},"observation_digest":"sha256:d2adb308a0da99b7af2bc95dbd8c65debf60bad64ea70900475b365754250dfd","observation_id":"a4d4b9c7-0a10-47ce-8809-2f304016a202","resolution":{"observed_at":"2026-08-07T15:25:39.015166Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:25:39.102711Z","title":"Large language models are zero-shot reasoners","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.15116","last_updated":"2025-05-21T05:08:00Z","snapshot_observed_at":"2026-08-19T22:16:45.375639Z","submitted_at":"2025-05-21T05:08:00Z","title":"Graph Foundation Models: A Comprehensive Survey","version":1},"reference_index":98,"source":"pdf_text","source_observed_at":"2026-08-07T15:25:39.102711Z"},"links":{"citing_paper":"/paper/2505.15116"},"observation_digest":"sha256:b80698378376732c3243c7687bea9dad09abe2831495d7aefefbba62f38dce26","observation_id":"e05534a2-0a4f-4732-894a-a597fc13f1e4","resolution":{"observed_at":"2026-08-07T15:25:39.102711Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:25:39.187364Z","title":"Langgfm: A large language model alone can be a powerful graph foundation model","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.15116","last_updated":"2025-05-21T05:08:00Z","snapshot_observed_at":"2026-08-19T22:16:45.375639Z","submitted_at":"2025-05-21T05:08:00Z","title":"Graph Foundation Models: A Comprehensive Survey","version":1},"reference_index":99,"source":"pdf_text","source_observed_at":"2026-08-07T15:25:39.187364Z"},"links":{"citing_paper":"/paper/2505.15116"},"observation_digest":"sha256:4c133d2c3f74e7c181ee5121380d60299dbd1c49d2fd4a156def276eb99c9973","observation_id":"ca564f39-1d83-4200-93e5-7563fb97b43f","resolution":{"observed_at":"2026-08-07T15:25:39.187364Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:25:39.279631Z","title":"Beyond text: A deep dive into large language models’ ability on understanding graph data","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.15116","last_updated":"2025-05-21T05:08:00Z","snapshot_observed_at":"2026-08-19T22:16:45.375639Z","submitted_at":"2025-05-21T05:08:00Z","title":"Graph Foundation Models: A Comprehensive Survey","version":1},"reference_index":100,"source":"pdf_text","source_observed_at":"2026-08-07T15:25:39.279631Z"},"links":{"citing_paper":"/paper/2505.15116"},"observation_digest":"sha256:8cecaa87d5420bb9b18aa14fdde604d1ca8e2f06167cdcbd4e93abe98656d7f4","observation_id":"f7d9bdb7-b976-49aa-999c-cdce363bbe2f","resolution":{"observed_at":"2026-08-07T15:25:39.279631Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2505.15116","last_updated":"2025-05-21T05:08:00Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-19T22:16:45.375639Z","submitted_at":"2025-05-21T05:08:00Z","title":"Graph Foundation Models: A Comprehensive Survey"},"reference_resolution":{"displayed":100,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":100,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":299},"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-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"thesis":"As of 23 August 2026, this Paper Citation Record lists 100 of 299 outbound references and 22 inbound Pith citation observations for arXiv:2505.15116."}