{"as_of":"2026-08-11T18:34:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:bdb27b94facdd8bcff0b5b8b9f31d4ce2323f19158892c647a326540acd77fd8","coverage":[{"denominator":89,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":89,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T10:41:12.565965Z","state":"measured"},{"denominator":89,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":89,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-11T06:34:44.6726+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2412.16441/citation-record","integrity":"/paper/2412.16441/integrity","json":"/paper/2412.16441/citation-record.json","paper":"/paper/2412.16441"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T10:41:12.102691Z","title":"write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.16441","last_updated":"2025-05-25T14:58:07Z","snapshot_observed_at":"2026-08-11T10:32:54.401157Z","submitted_at":"2024-12-21T02:07:43Z","title":"Towards Graph Foundation Models: Learning Generalities Across Graphs via Task-Trees","version":3},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-11T10:41:12.102691Z"},"links":{"citing_paper":"/paper/2412.16441"},"observation_digest":"sha256:0f964a8cad657aa96eeb4cda666fcdda671e656129634b071d173b3adb47da8d","observation_id":"84545f00-1d7f-48bb-a9a4-b9b024a8bc82","resolution":{"observed_at":"2026-08-11T10:41:12.102691Z","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-11T10:41:12.109705Z","title":"L., Almeida, D., Altenschmidt, J., Altman, S., Anadkat, S., et al","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.16441","last_updated":"2025-05-25T14:58:07Z","snapshot_observed_at":"2026-08-11T10:32:54.401157Z","submitted_at":"2024-12-21T02:07:43Z","title":"Towards Graph Foundation Models: Learning Generalities Across Graphs via Task-Trees","version":3},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-11T10:41:12.109705Z"},"links":{"citing_paper":"/paper/2412.16441"},"observation_digest":"sha256:65880abe0122ca6a33979e14efab6494575a6ad6956fab66bb0bab79acb41f65","observation_id":"53af88fc-f0b0-48e7-9e25-5babe28b966d","resolution":{"observed_at":"2026-08-11T10:41:12.109705Z","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-11T10:41:12.115914Z","title":"When to pre-train graph neural networks? from data generation perspective! In KDD, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.16441","last_updated":"2025-05-25T14:58:07Z","snapshot_observed_at":"2026-08-11T10:32:54.401157Z","submitted_at":"2024-12-21T02:07:43Z","title":"Towards Graph Foundation Models: Learning Generalities Across Graphs via Task-Trees","version":3},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-11T10:41:12.115914Z"},"links":{"citing_paper":"/paper/2412.16441"},"observation_digest":"sha256:98ac48cbfe456063c33394098de3d45c8ad56d488dec7f5cff0706c07870bb41","observation_id":"b9f2fa38-6730-4ed3-bf82-652a7c5a1161","resolution":{"observed_at":"2026-08-11T10:41:12.115914Z","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-11T10:41:12.122055Z","title":"K., Shah, N., and Wang, Z","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.16441","last_updated":"2025-05-25T14:58:07Z","snapshot_observed_at":"2026-08-11T10:32:54.401157Z","submitted_at":"2024-12-21T02:07:43Z","title":"Towards Graph Foundation Models: Learning Generalities Across Graphs via Task-Trees","version":3},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-11T10:41:12.122055Z"},"links":{"citing_paper":"/paper/2412.16441"},"observation_digest":"sha256:b7248190ceeec3729e36f559ed91457f81eefcd8e4f75d0777fa6cda216b56c9","observation_id":"eed3fd09-c34f-484d-9859-6b2ce8e1187d","resolution":{"observed_at":"2026-08-11T10:41:12.122055Z","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-11T10:41:12.128527Z","title":"Can graph neural networks count substructures? In NeurIPS, 2020","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2412.16441","last_updated":"2025-05-25T14:58:07Z","snapshot_observed_at":"2026-08-11T10:32:54.401157Z","submitted_at":"2024-12-21T02:07:43Z","title":"Towards Graph Foundation Models: Learning Generalities Across Graphs via Task-Trees","version":3},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-11T10:41:12.128527Z"},"links":{"citing_paper":"/paper/2412.16441"},"observation_digest":"sha256:ca2069b8163a26c41d06c86c579c8c3f183dff584a1f65919b93723d5eba1755","observation_id":"02e546ff-ff78-44a1-8bf7-3c6a5485b41c","resolution":{"observed_at":"2026-08-11T10:41:12.128527Z","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-11T10:41:12.133258Z","title":"Text-space graph foundation models: Comprehensive benchmarks and new insights","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.16441","last_updated":"2025-05-25T14:58:07Z","snapshot_observed_at":"2026-08-11T10:32:54.401157Z","submitted_at":"2024-12-21T02:07:43Z","title":"Towards Graph Foundation Models: Learning Generalities Across Graphs via Task-Trees","version":3},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-11T10:41:12.133258Z"},"links":{"citing_paper":"/paper/2412.16441"},"observation_digest":"sha256:35269efddba9d3fc952b6b43fb58420100dd269c1b7aa1a20bc83fbce7ce6dc2","observation_id":"ff8925df-fd00-4170-bebd-e9d5d11b7cab","resolution":{"observed_at":"2026-08-11T10:41:12.133258Z","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-11T10:41:12.138219Z","title":"Fastgas: Fast graph-based annotation selection for in-context learning","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.16441","last_updated":"2025-05-25T14:58:07Z","snapshot_observed_at":"2026-08-11T10:32:54.401157Z","submitted_at":"2024-12-21T02:07:43Z","title":"Towards Graph Foundation Models: Learning Generalities Across Graphs via Task-Trees","version":3},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-11T10:41:12.138219Z"},"links":{"citing_paper":"/paper/2412.16441"},"observation_digest":"sha256:cd1319841411c2bdb82e2e1c7f0e46634c736ad5ecf8106576b5e12887cecbf6","observation_id":"c89422b7-4b09-45ba-9f3f-fd85c732e057","resolution":{"observed_at":"2026-08-11T10:41:12.138219Z","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-11T10:41:12.143422Z","title":"and Jegelka, S","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2412.16441","last_updated":"2025-05-25T14:58:07Z","snapshot_observed_at":"2026-08-11T10:32:54.401157Z","submitted_at":"2024-12-21T02:07:43Z","title":"Towards Graph Foundation Models: Learning Generalities Across Graphs via Task-Trees","version":3},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-11T10:41:12.143422Z"},"links":{"citing_paper":"/paper/2412.16441"},"observation_digest":"sha256:91926f1ef35ff5ec77cd5aa93fd405b71997894edef415fc51d3f4a45b968dfd","observation_id":"19072354-817f-4116-b8be-e30dae6e6b73","resolution":{"observed_at":"2026-08-11T10:41:12.143422Z","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-11T10:41:12.148693Z","title":"On the generalization ability of unsupervised pretraining","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.16441","last_updated":"2025-05-25T14:58:07Z","snapshot_observed_at":"2026-08-11T10:32:54.401157Z","submitted_at":"2024-12-21T02:07:43Z","title":"Towards Graph Foundation Models: Learning Generalities Across Graphs via Task-Trees","version":3},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-11T10:41:12.148693Z"},"links":{"citing_paper":"/paper/2412.16441"},"observation_digest":"sha256:79105b74d6cbf07a1bd4da6509b91918d90997474d6d68ba43ee60e8b2732bbc","observation_id":"44e36963-0f79-4632-b0c5-dbdf290be861","resolution":{"observed_at":"2026-08-11T10:41:12.148693Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T10:41:14.260226Z","title":"Graph prototypical networks for few-shot learning on attributed networks","venue":null,"work_id":"5b6835d1-2d4d-4933-a49c-26f16f4d7935","year":2020},"citing_paper":{"arxiv_id":"2412.16441","last_updated":"2025-05-25T14:58:07Z","snapshot_observed_at":"2026-08-11T10:32:54.401157Z","submitted_at":"2024-12-21T02:07:43Z","title":"Towards Graph Foundation Models: Learning Generalities Across Graphs via Task-Trees","version":3},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-11T10:41:12.154040Z"},"links":{"citing_paper":"/paper/2412.16441"},"observation_digest":"sha256:a58a47026e6769cb42e5819db34d54fa1fd4509058e2fae60e23d414cdf0c8fb","observation_id":"b1ccc9b8-889d-4eb3-84d2-aedcbf7ca661","resolution":{"observed_at":"2026-08-11T10:41:14.266498Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T10:41:14.242239Z","title":"Learning theory can (sometimes) explain generalisation in graph neural networks","venue":null,"work_id":"350c1c97-dbdf-49de-bd4e-60d10a1850be","year":2021},"citing_paper":{"arxiv_id":"2412.16441","last_updated":"2025-05-25T14:58:07Z","snapshot_observed_at":"2026-08-11T10:32:54.401157Z","submitted_at":"2024-12-21T02:07:43Z","title":"Towards Graph Foundation Models: Learning Generalities Across Graphs via Task-Trees","version":3},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-11T10:41:12.159295Z"},"links":{"citing_paper":"/paper/2412.16441"},"observation_digest":"sha256:87d3f55ac55f9cf348408153da17ff956787285a00702c0534f9282bdb862ee6","observation_id":"41b8e225-0adb-496e-91a7-26b73e495039","resolution":{"observed_at":"2026-08-11T10:41:14.247787Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T10:41:14.222248Z","title":"Heterogeneous temporal graph neural network","venue":null,"work_id":"121dda3f-5156-49d1-a4f5-e5c27f1e779d","year":2022},"citing_paper":{"arxiv_id":"2412.16441","last_updated":"2025-05-25T14:58:07Z","snapshot_observed_at":"2026-08-11T10:32:54.401157Z","submitted_at":"2024-12-21T02:07:43Z","title":"Towards Graph Foundation Models: Learning Generalities Across Graphs via Task-Trees","version":3},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-11T10:41:12.164500Z"},"links":{"citing_paper":"/paper/2412.16441"},"observation_digest":"sha256:049dcdb7b53aff255c62e9780805f69e8f338ab7d87103dbbaada15ad1960f3a","observation_id":"dba1de7b-2406-4700-b012-a8a2a3c4a317","resolution":{"observed_at":"2026-08-11T10:41:14.229089Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T10:41:14.199205Z","title":"Taglas: An atlas of text-attributed graph datasets in the era of large graph and language models","venue":null,"work_id":"dc847611-dd9a-400c-84bc-01018d3d8b70","year":2024},"citing_paper":{"arxiv_id":"2412.16441","last_updated":"2025-05-25T14:58:07Z","snapshot_observed_at":"2026-08-11T10:32:54.401157Z","submitted_at":"2024-12-21T02:07:43Z","title":"Towards Graph Foundation Models: Learning Generalities Across Graphs via Task-Trees","version":3},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-11T10:41:12.169379Z"},"links":{"citing_paper":"/paper/2412.16441"},"observation_digest":"sha256:23beb55c8e6f2e4dce318916b8c6eb64c0e9b97a7798df8c98570d355a1f4ed3","observation_id":"d07f3ac5-2ca3-44a0-9b74-30b1a852d8ac","resolution":{"observed_at":"2026-08-11T10:41:14.205244Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T10:41:14.180336Z","title":"The development of social network analysis","venue":null,"work_id":"09dc5628-95cf-46a2-8666-57c3cffecff6","year":2004},"citing_paper":{"arxiv_id":"2412.16441","last_updated":"2025-05-25T14:58:07Z","snapshot_observed_at":"2026-08-11T10:32:54.401157Z","submitted_at":"2024-12-21T02:07:43Z","title":"Towards Graph Foundation Models: Learning Generalities Across Graphs via Task-Trees","version":3},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-11T10:41:12.174452Z"},"links":{"citing_paper":"/paper/2412.16441"},"observation_digest":"sha256:f39c793cbf4e69c741ef086492985792a941bd928acf28c0803389a1adc86b70","observation_id":"d7e12fa6-e9f3-4d51-ae33-4a8a140254ab","resolution":{"observed_at":"2026-08-11T10:41:14.185662Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T10:41:14.162828Z","title":"Towards foundation models for knowledge graph reasoning","venue":null,"work_id":"91b598b6-b575-4da0-a681-4bb0b95ea24c","year":2024},"citing_paper":{"arxiv_id":"2412.16441","last_updated":"2025-05-25T14:58:07Z","snapshot_observed_at":"2026-08-11T10:32:54.401157Z","submitted_at":"2024-12-21T02:07:43Z","title":"Towards Graph Foundation Models: Learning Generalities Across Graphs via Task-Trees","version":3},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-11T10:41:12.179430Z"},"links":{"citing_paper":"/paper/2412.16441"},"observation_digest":"sha256:e1d3a9fc7ab68525efcb27a2f0862adfd6f81e0e28d7334d23d01efc194e8895","observation_id":"4df30656-e1a1-475f-a3d5-2ea990b54a9c","resolution":{"observed_at":"2026-08-11T10:41:14.168729Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T10:41:14.145559Z","title":"Generalization and representational limits of graph neural networks","venue":null,"work_id":"611656fd-8b75-4750-ab16-8e7c20c243c1","year":2020},"citing_paper":{"arxiv_id":"2412.16441","last_updated":"2025-05-25T14:58:07Z","snapshot_observed_at":"2026-08-11T10:32:54.401157Z","submitted_at":"2024-12-21T02:07:43Z","title":"Towards Graph Foundation Models: Learning Generalities Across Graphs via Task-Trees","version":3},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-11T10:41:12.185429Z"},"links":{"citing_paper":"/paper/2412.16441"},"observation_digest":"sha256:42bbe76527084e118421ed91a728b1cb023961c27c2a7e356404b47b48fe885f","observation_id":"1a8614cc-f5ea-4354-b402-35e2206dc27a","resolution":{"observed_at":"2026-08-11T10:41:14.151128Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T10:41:14.128385Z","title":"Gpt4graph: Can large language models understand graph structured data? an empirical evaluation and benchmarking","venue":null,"work_id":"16f52af5-051a-436f-8652-16ca2ce33cef","year":2023},"citing_paper":{"arxiv_id":"2412.16441","last_updated":"2025-05-25T14:58:07Z","snapshot_observed_at":"2026-08-11T10:32:54.401157Z","submitted_at":"2024-12-21T02:07:43Z","title":"Towards Graph Foundation Models: Learning Generalities Across Graphs via Task-Trees","version":3},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-11T10:41:12.190225Z"},"links":{"citing_paper":"/paper/2412.16441"},"observation_digest":"sha256:52b35843b8eac7fcd23e060e056a3bb568b4cc87002e1555100790b68e38680f","observation_id":"658952bd-b58a-472a-b62f-931285c82af7","resolution":{"observed_at":"2026-08-11T10:41:14.133606Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T10:41:14.108747Z","title":"Mirage: Model-agnostic graph distillation for graph classification","venue":null,"work_id":"1968c0e7-3518-4894-8d67-dbd951fe5de9","year":2024},"citing_paper":{"arxiv_id":"2412.16441","last_updated":"2025-05-25T14:58:07Z","snapshot_observed_at":"2026-08-11T10:32:54.401157Z","submitted_at":"2024-12-21T02:07:43Z","title":"Towards Graph Foundation Models: Learning Generalities Across Graphs via Task-Trees","version":3},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-11T10:41:12.195572Z"},"links":{"citing_paper":"/paper/2412.16441"},"observation_digest":"sha256:00e0d4220cd31057d913c7da63ea45783314e7a15cc3effca905a9a59a3e9496","observation_id":"b85578f2-cc70-4b31-a358-91155852ffae","resolution":{"observed_at":"2026-08-11T10:41:14.114083Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T10:41:12.200549Z","title":"Inductive representation learning on large graphs","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2412.16441","last_updated":"2025-05-25T14:58:07Z","snapshot_observed_at":"2026-08-11T10:32:54.401157Z","submitted_at":"2024-12-21T02:07:43Z","title":"Towards Graph Foundation Models: Learning Generalities Across Graphs via Task-Trees","version":3},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-11T10:41:12.200549Z"},"links":{"citing_paper":"/paper/2412.16441"},"observation_digest":"sha256:dba5e950a7a021cc71742be20d6137d507e60e3900bab3e5296a790bd8d7b234","observation_id":"0652256e-41d7-4f47-ba42-e1e4104da3fe","resolution":{"observed_at":"2026-08-11T10:41:12.200549Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T10:41:14.078681Z","title":"A., and Jin, W","venue":null,"work_id":"837e2501-e0f2-4064-9eb6-2c8c7595b65a","year":2024},"citing_paper":{"arxiv_id":"2412.16441","last_updated":"2025-05-25T14:58:07Z","snapshot_observed_at":"2026-08-11T10:32:54.401157Z","submitted_at":"2024-12-21T02:07:43Z","title":"Towards Graph Foundation Models: Learning Generalities Across Graphs via Task-Trees","version":3},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-11T10:41:12.205947Z"},"links":{"citing_paper":"/paper/2412.16441"},"observation_digest":"sha256:f3a1ab767b1edf7bae9adc44eef0ab41db82aa12a6d6bfee44c50be26277336b","observation_id":"69264fcd-26e1-4cfc-8c2f-65c6d30e9cb5","resolution":{"observed_at":"2026-08-11T10:41:14.083872Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T10:41:12.211750Z","title":"Masked autoencoders are scalable vision learners","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2412.16441","last_updated":"2025-05-25T14:58:07Z","snapshot_observed_at":"2026-08-11T10:32:54.401157Z","submitted_at":"2024-12-21T02:07:43Z","title":"Towards Graph Foundation Models: Learning Generalities Across Graphs via Task-Trees","version":3},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-11T10:41:12.211750Z"},"links":{"citing_paper":"/paper/2412.16441"},"observation_digest":"sha256:5575eea796449bac97534d299d4bac5ffd1b03fdbeeb69628b19b2fa46fd35d3","observation_id":"ed69704c-8728-4e82-add4-8515c83bb71d","resolution":{"observed_at":"2026-08-11T10:41:12.211750Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.13630","last_updated":"2025-01-20T15:12:02Z","snapshot_observed_at":"2026-08-10T22:17:51.072949Z","submitted_at":"2024-02-21T09:06:31Z","title":"UniGraph: Learning a Unified Cross-Domain Foundation Model for Text-Attributed Graphs","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.13630","snapshot_observed_at":"2026-08-11T10:41:12.216555Z","title":"and Hooi, B","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.16441","last_updated":"2025-05-25T14:58:07Z","snapshot_observed_at":"2026-08-11T10:32:54.401157Z","submitted_at":"2024-12-21T02:07:43Z","title":"Towards Graph Foundation Models: Learning Generalities Across Graphs via Task-Trees","version":3},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-11T10:41:12.216555Z"},"links":{"cited_paper":"/paper/2402.13630","citing_paper":"/paper/2412.16441"},"observation_digest":"sha256:e144701eafb4c35197e979975f5d25e088c52a17a2dc4bdcf50f3918602cd18c","observation_id":"2585c4f0-3945-4e38-820a-e456af8697b4","resolution":{"observed_at":"2026-08-11T10:41:12.216555Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T10:41:14.043167Z","title":"Graphmae: Self-supervised masked graph autoencoders","venue":null,"work_id":"98cf3d98-ab58-42c4-83d9-dc5546c9b3f6","year":2022},"citing_paper":{"arxiv_id":"2412.16441","last_updated":"2025-05-25T14:58:07Z","snapshot_observed_at":"2026-08-11T10:32:54.401157Z","submitted_at":"2024-12-21T02:07:43Z","title":"Towards Graph Foundation Models: Learning Generalities Across Graphs via Task-Trees","version":3},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-11T10:41:12.222484Z"},"links":{"citing_paper":"/paper/2412.16441"},"observation_digest":"sha256:75ce5794f9b5df2848e539bd30807a1f839759f4f4be1987ea1bf276aa5a8b4b","observation_id":"aac798f1-bb39-4bb0-aa9e-a38f017814ae","resolution":{"observed_at":"2026-08-11T10:41:14.052051Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T10:41:14.018090Z","title":"Strategies for pre-training graph neural networks","venue":null,"work_id":"5f7801a0-3aa6-45f9-bfe8-bea73547aa82","year":2020},"citing_paper":{"arxiv_id":"2412.16441","last_updated":"2025-05-25T14:58:07Z","snapshot_observed_at":"2026-08-11T10:32:54.401157Z","submitted_at":"2024-12-21T02:07:43Z","title":"Towards Graph Foundation Models: Learning Generalities Across Graphs via Task-Trees","version":3},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-11T10:41:12.228086Z"},"links":{"citing_paper":"/paper/2412.16441"},"observation_digest":"sha256:7f7227134041c5ded7374a38fa274213ae58c92421f414a5e30966346a210675","observation_id":"2b801f47-6de0-47da-bf9a-343e1ff8a893","resolution":{"observed_at":"2026-08-11T10:41:14.026440Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T10:41:13.995320Z","title":"Pre-training graph neural networks for generic structural feature extraction","venue":null,"work_id":"9e75a77a-0d1a-49ae-9a29-056f232c821f","year":2019},"citing_paper":{"arxiv_id":"2412.16441","last_updated":"2025-05-25T14:58:07Z","snapshot_observed_at":"2026-08-11T10:32:54.401157Z","submitted_at":"2024-12-21T02:07:43Z","title":"Towards Graph Foundation Models: Learning Generalities Across Graphs via Task-Trees","version":3},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-11T10:41:12.233351Z"},"links":{"citing_paper":"/paper/2412.16441"},"observation_digest":"sha256:c035a279e078bdc1a6001117c6a2e2a277158b3c703aa0df0a887e6bfaf91bc2","observation_id":"7e107451-df98-4688-a126-727224908943","resolution":{"observed_at":"2026-08-11T10:41:14.002393Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T10:41:13.973939Z","title":"S., and Leskovec, J","venue":null,"work_id":"20a1dcbd-56d0-4b49-83b7-5d47ca1f6a41","year":2023},"citing_paper":{"arxiv_id":"2412.16441","last_updated":"2025-05-25T14:58:07Z","snapshot_observed_at":"2026-08-11T10:32:54.401157Z","submitted_at":"2024-12-21T02:07:43Z","title":"Towards Graph Foundation Models: Learning Generalities Across Graphs via Task-Trees","version":3},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-11T10:41:12.238728Z"},"links":{"citing_paper":"/paper/2412.16441"},"observation_digest":"sha256:6d9bcd12a6590014b1b8d2c9bd7c6f2b8420791574797f8beba729d554683a9c","observation_id":"3da204ca-d068-4724-b4bd-084f9385a094","resolution":{"observed_at":"2026-08-11T10:41:13.979290Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T10:41:13.957400Z","title":"Self-supervised learning on graphs: Deep insights and new direction","venue":null,"work_id":"2aea5d8f-b16d-4fc9-bea1-c631c030c52d","year":2020},"citing_paper":{"arxiv_id":"2412.16441","last_updated":"2025-05-25T14:58:07Z","snapshot_observed_at":"2026-08-11T10:32:54.401157Z","submitted_at":"2024-12-21T02:07:43Z","title":"Towards Graph Foundation Models: Learning Generalities Across Graphs via Task-Trees","version":3},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-11T10:41:12.243813Z"},"links":{"citing_paper":"/paper/2412.16441"},"observation_digest":"sha256:0edaf88c069d62d6b80a36cd831e5336428d42be11105cddcda447066f803564","observation_id":"9ab8d4bd-ce8f-44d3-8cdf-83223e7fb045","resolution":{"observed_at":"2026-08-11T10:41:13.962263Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T10:41:13.941260Z","title":null,"venue":null,"work_id":"346584f8-5308-43bf-a092-440ded516c8b","year":2023},"citing_paper":{"arxiv_id":"2412.16441","last_updated":"2025-05-25T14:58:07Z","snapshot_observed_at":"2026-08-11T10:32:54.401157Z","submitted_at":"2024-12-21T02:07:43Z","title":"Towards Graph Foundation Models: Learning Generalities Across Graphs via Task-Trees","version":3},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-11T10:41:12.249610Z"},"links":{"citing_paper":"/paper/2412.16441"},"observation_digest":"sha256:a2ff57f62a10d7c981881859fdb6197e4aeb1a766c9d166311318b0f8a9a850d","observation_id":"322b3c57-ef31-4576-9448-f803b9a4ae45","resolution":{"observed_at":"2026-08-11T10:41:13.946437Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T10:41:13.923938Z","title":"Multi-task self-supervised graph neural networks enable stronger task generalization","venue":null,"work_id":"2a2a0ecc-a4b1-4708-8914-d5cb2c6f0a78","year":2023},"citing_paper":{"arxiv_id":"2412.16441","last_updated":"2025-05-25T14:58:07Z","snapshot_observed_at":"2026-08-11T10:32:54.401157Z","submitted_at":"2024-12-21T02:07:43Z","title":"Towards Graph Foundation Models: Learning Generalities Across Graphs via Task-Trees","version":3},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-11T10:41:12.255091Z"},"links":{"citing_paper":"/paper/2412.16441"},"observation_digest":"sha256:48828315ff03c1f008d19af19d2f6a56f313cd2a0e53c83b1e2b4bf0817d10a5","observation_id":"c56f4196-a62b-466b-bc0a-8e061851ee6f","resolution":{"observed_at":"2026-08-11T10:41:13.929494Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T10:41:12.259544Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2412.16441","last_updated":"2025-05-25T14:58:07Z","snapshot_observed_at":"2026-08-11T10:32:54.401157Z","submitted_at":"2024-12-21T02:07:43Z","title":"Towards Graph Foundation Models: Learning Generalities Across Graphs via Task-Trees","version":3},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-11T10:41:12.259544Z"},"links":{"citing_paper":"/paper/2412.16441"},"observation_digest":"sha256:8365268d182e555afb048f1712181b79de3462ab368c7affe5dff4206b5be924","observation_id":"b7ff22ec-a8be-47ee-a156-cf30c975e115","resolution":{"observed_at":"2026-08-11T10:41:12.259544Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T10:41:13.891273Z","title":"On the transferability of spectral graph filters","venue":null,"work_id":"ede76f20-0f8b-4bd1-af87-cecf2bf8b775","year":2019},"citing_paper":{"arxiv_id":"2412.16441","last_updated":"2025-05-25T14:58:07Z","snapshot_observed_at":"2026-08-11T10:32:54.401157Z","submitted_at":"2024-12-21T02:07:43Z","title":"Towards Graph Foundation Models: Learning Generalities Across Graphs via Task-Trees","version":3},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-11T10:41:12.264222Z"},"links":{"citing_paper":"/paper/2412.16441"},"observation_digest":"sha256:8e6d423e597b0f6779b180685021f51735cefc7bca3517b5a24b652b360c985e","observation_id":"69ee22dd-a4af-4d6d-84a5-5dee8c2bfc6b","resolution":{"observed_at":"2026-08-11T10:41:13.897429Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T10:41:13.873933Z","title":"Transferability of spectral graph convolutional neural networks","venue":null,"work_id":"4db37d86-70c7-4936-ae91-8d110eb93774","year":2021},"citing_paper":{"arxiv_id":"2412.16441","last_updated":"2025-05-25T14:58:07Z","snapshot_observed_at":"2026-08-11T10:32:54.401157Z","submitted_at":"2024-12-21T02:07:43Z","title":"Towards Graph Foundation Models: Learning Generalities Across Graphs via Task-Trees","version":3},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-11T10:41:12.269147Z"},"links":{"citing_paper":"/paper/2412.16441"},"observation_digest":"sha256:f6399c576ea24c283fde2e5a858fa41683e2eef4f3808ce7c389d0db3a8f9741","observation_id":"a1f872a2-a46e-48a5-97c5-4d0d049c959c","resolution":{"observed_at":"2026-08-11T10:41:13.879815Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T10:41:13.857712Z","title":"X., and Li, J","venue":null,"work_id":"480bbd2f-0863-4c3d-a7a9-7019b57d559a","year":2024},"citing_paper":{"arxiv_id":"2412.16441","last_updated":"2025-05-25T14:58:07Z","snapshot_observed_at":"2026-08-11T10:32:54.401157Z","submitted_at":"2024-12-21T02:07:43Z","title":"Towards Graph Foundation Models: Learning Generalities Across Graphs via Task-Trees","version":3},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-11T10:41:12.273751Z"},"links":{"citing_paper":"/paper/2412.16441"},"observation_digest":"sha256:cab2196222ce8532392961758edca56f743abd0c4b69d1fdb8acb1b5776dc8ea","observation_id":"7e7e66f6-780a-480b-a8e0-07be78c360a0","resolution":{"observed_at":"2026-08-11T10:41:13.862604Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T10:41:13.839567Z","title":"One for all: Towards training one graph model for all classification tasks","venue":null,"work_id":"b6214a5b-aaa2-4eaa-826f-03e86283a474","year":2024},"citing_paper":{"arxiv_id":"2412.16441","last_updated":"2025-05-25T14:58:07Z","snapshot_observed_at":"2026-08-11T10:32:54.401157Z","submitted_at":"2024-12-21T02:07:43Z","title":"Towards Graph Foundation Models: Learning Generalities Across Graphs via Task-Trees","version":3},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-11T10:41:12.278862Z"},"links":{"citing_paper":"/paper/2412.16441"},"observation_digest":"sha256:ba9101f3ccb438dc55f78a8c5ecf8e069fee954ccc0bba66c211ff807b064629","observation_id":"e7c9463e-aaf8-4c6a-ac6a-0090c7dc0cff","resolution":{"observed_at":"2026-08-11T10:41:13.845366Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T10:41:13.819336Z","title":"Graphprompt: Unifying pre-training and downstream tasks for graph neural networks","venue":null,"work_id":"9094486d-c3a1-4860-a3af-c3769c661f4d","year":2023},"citing_paper":{"arxiv_id":"2412.16441","last_updated":"2025-05-25T14:58:07Z","snapshot_observed_at":"2026-08-11T10:32:54.401157Z","submitted_at":"2024-12-21T02:07:43Z","title":"Towards Graph Foundation Models: Learning Generalities Across Graphs via Task-Trees","version":3},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-11T10:41:12.283778Z"},"links":{"citing_paper":"/paper/2412.16441"},"observation_digest":"sha256:affd51f69fb791e85b1208b2c87d6a45ca22d61e03e0861fb1a4202cf11c7323","observation_id":"1e573ee0-0714-4057-8b87-a618bf4966f1","resolution":{"observed_at":"2026-08-11T10:41:13.826709Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T10:41:13.797559Z","title":null,"venue":null,"work_id":"366c7491-6c61-435b-a148-3372d96aeb1d","year":2024},"citing_paper":{"arxiv_id":"2412.16441","last_updated":"2025-05-25T14:58:07Z","snapshot_observed_at":"2026-08-11T10:32:54.401157Z","submitted_at":"2024-12-21T02:07:43Z","title":"Towards Graph Foundation Models: Learning Generalities Across Graphs via Task-Trees","version":3},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-11T10:41:12.288906Z"},"links":{"citing_paper":"/paper/2412.16441"},"observation_digest":"sha256:a57eec5576b1a6cc04f7e884b8775aa17ceb32b5b1428bfc1206d62bbce8f097","observation_id":"3212d489-5337-48f9-9ca4-47c7b2449b5e","resolution":{"observed_at":"2026-08-11T10:41:13.803582Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T10:41:13.775060Z","title":"Revisiting heterophily for graph neural networks","venue":null,"work_id":"6f35e215-780a-4105-a3e6-51e741261dfc","year":2022},"citing_paper":{"arxiv_id":"2412.16441","last_updated":"2025-05-25T14:58:07Z","snapshot_observed_at":"2026-08-11T10:32:54.401157Z","submitted_at":"2024-12-21T02:07:43Z","title":"Towards Graph Foundation Models: Learning Generalities Across Graphs via Task-Trees","version":3},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-11T10:41:12.294004Z"},"links":{"citing_paper":"/paper/2412.16441"},"observation_digest":"sha256:6243ca488bfd05222cc137f10a05f601df965ff15cf7a64be8350fae4cbefb81","observation_id":"6279150e-cc1c-4b05-9dfe-47c7d1b4962b","resolution":{"observed_at":"2026-08-11T10:41:13.780730Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T10:41:13.755315Z","title":"Hypergraph contrastive learning for drug trafficking community detection","venue":null,"work_id":"b49636de-8dae-4c8c-af18-18a5fca278f4","year":2023},"citing_paper":{"arxiv_id":"2412.16441","last_updated":"2025-05-25T14:58:07Z","snapshot_observed_at":"2026-08-11T10:32:54.401157Z","submitted_at":"2024-12-21T02:07:43Z","title":"Towards Graph Foundation Models: Learning Generalities Across Graphs via Task-Trees","version":3},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-11T10:41:12.299588Z"},"links":{"citing_paper":"/paper/2412.16441"},"observation_digest":"sha256:c20fa357b5495d7694583c9584ca47844ae6d64edc6107f09fd48de032bfc482","observation_id":"407d560b-1a16-4fa7-bec5-063fdec3a54b","resolution":{"observed_at":"2026-08-11T10:41:13.761665Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T10:41:13.733010Z","title":"Is homophily a necessity for graph neural networks? In ICLR, 2022","venue":null,"work_id":"3e84f997-e6fc-491b-9066-0e7b18441931","year":2022},"citing_paper":{"arxiv_id":"2412.16441","last_updated":"2025-05-25T14:58:07Z","snapshot_observed_at":"2026-08-11T10:32:54.401157Z","submitted_at":"2024-12-21T02:07:43Z","title":"Towards Graph Foundation Models: Learning Generalities Across Graphs via Task-Trees","version":3},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-11T10:41:12.304527Z"},"links":{"citing_paper":"/paper/2412.16441"},"observation_digest":"sha256:9f155af32bf9f1545c6d52710b1e0276c1a643852f7f4a3a58730dba11a9e5df","observation_id":"9efa5c41-0206-40f2-bf2b-67f5be548b56","resolution":{"observed_at":"2026-08-11T10:41:13.739557Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T10:41:13.712225Z","title":"Graph foundation models are already here","venue":null,"work_id":"a085e5a9-8673-4a34-9ee2-82b5732d3b15","year":2024},"citing_paper":{"arxiv_id":"2412.16441","last_updated":"2025-05-25T14:58:07Z","snapshot_observed_at":"2026-08-11T10:32:54.401157Z","submitted_at":"2024-12-21T02:07:43Z","title":"Towards Graph Foundation Models: Learning Generalities Across Graphs via Task-Trees","version":3},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-11T10:41:12.309461Z"},"links":{"citing_paper":"/paper/2412.16441"},"observation_digest":"sha256:17eab306326cb0252af6599ef28b5daf883b7a96fc2265ff7af829c2b9c351f1","observation_id":"37befae0-4d89-47ed-96ef-7e35e0903fba","resolution":{"observed_at":"2026-08-11T10:41:13.718923Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T10:41:12.314300Z","title":"L., Lenssen, J","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2412.16441","last_updated":"2025-05-25T14:58:07Z","snapshot_observed_at":"2026-08-11T10:32:54.401157Z","submitted_at":"2024-12-21T02:07:43Z","title":"Towards Graph Foundation Models: Learning Generalities Across Graphs via Task-Trees","version":3},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-11T10:41:12.314300Z"},"links":{"citing_paper":"/paper/2412.16441"},"observation_digest":"sha256:4da689e959081848e8a99417aff17b50c05b7e7e3025a93b97033c104c4e5ca5","observation_id":"e8d26391-c6a6-417d-8d06-be697ddc63b6","resolution":{"observed_at":"2026-08-11T10:41:12.314300Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T10:41:13.655734Z","title":"Wl meet vc","venue":null,"work_id":"6bb1b2d5-b6c7-4c5b-b3eb-a05e07d7f60a","year":2023},"citing_paper":{"arxiv_id":"2412.16441","last_updated":"2025-05-25T14:58:07Z","snapshot_observed_at":"2026-08-11T10:32:54.401157Z","submitted_at":"2024-12-21T02:07:43Z","title":"Towards Graph Foundation Models: Learning Generalities Across Graphs via Task-Trees","version":3},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-11T10:41:12.319537Z"},"links":{"citing_paper":"/paper/2412.16441"},"observation_digest":"sha256:9580388e64b81eb375126ad708b6c4421a77a5cadff8dac333aec87cde7082d1","observation_id":"228b65ea-73ca-40f1-835f-8d16d3a6b950","resolution":{"observed_at":"2026-08-11T10:41:13.662191Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T10:41:13.636436Z","title":"Towards trustworthy retrieval augmented generation for large language models: A survey","venue":null,"work_id":"8e60aab5-8975-4449-b6cd-08c27385fe16","year":2025},"citing_paper":{"arxiv_id":"2412.16441","last_updated":"2025-05-25T14:58:07Z","snapshot_observed_at":"2026-08-11T10:32:54.401157Z","submitted_at":"2024-12-21T02:07:43Z","title":"Towards Graph Foundation Models: Learning Generalities Across Graphs via Task-Trees","version":3},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-11T10:41:12.324949Z"},"links":{"citing_paper":"/paper/2412.16441"},"observation_digest":"sha256:0c9d8b6f7ef65832638a6c417c01390f9f97887cb6e2c1849bdfa9ccf24ec716","observation_id":"8d64bb31-190c-4d46-82e6-ce5cad2bde91","resolution":{"observed_at":"2026-08-11T10:41:13.641484Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T10:41:13.614158Z","title":"Dual-level hypergraph contrastive learning with adaptive temperature enhancement","venue":null,"work_id":"23ad0319-8ab0-443a-bff1-fd1442e8563a","year":2024},"citing_paper":{"arxiv_id":"2412.16441","last_updated":"2025-05-25T14:58:07Z","snapshot_observed_at":"2026-08-11T10:32:54.401157Z","submitted_at":"2024-12-21T02:07:43Z","title":"Towards Graph Foundation Models: Learning Generalities Across Graphs via Task-Trees","version":3},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-11T10:41:12.330361Z"},"links":{"citing_paper":"/paper/2412.16441"},"observation_digest":"sha256:22c7c5add59f7886b938844f9c9f81445bf9def6c4c235bbb374ebe6bb05af6f","observation_id":"a5b94271-27e9-43f5-91be-bd07de921d57","resolution":{"observed_at":"2026-08-11T10:41:13.621682Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T10:41:13.593221Z","title":"Adaptive graph enhancement for imbalanced multi-relation graph learning","venue":null,"work_id":"c924fc56-5116-4744-b784-0448e96146db","year":2025},"citing_paper":{"arxiv_id":"2412.16441","last_updated":"2025-05-25T14:58:07Z","snapshot_observed_at":"2026-08-11T10:32:54.401157Z","submitted_at":"2024-12-21T02:07:43Z","title":"Towards Graph Foundation Models: Learning Generalities Across Graphs via Task-Trees","version":3},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-11T10:41:12.336561Z"},"links":{"citing_paper":"/paper/2412.16441"},"observation_digest":"sha256:5766382efc6a4de68777bfc04ba00ff02fce12fd731314579523f7f1ee1a2397","observation_id":"0935e41c-2dbe-49cb-9702-8daf0b8e9e59","resolution":{"observed_at":"2026-08-11T10:41:13.599761Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T10:41:13.573918Z","title":"Gcc: Graph contrastive coding for graph neural network pre-training","venue":null,"work_id":"77871d87-02e8-44d9-ae4a-44d28ac0006a","year":2020},"citing_paper":{"arxiv_id":"2412.16441","last_updated":"2025-05-25T14:58:07Z","snapshot_observed_at":"2026-08-11T10:32:54.401157Z","submitted_at":"2024-12-21T02:07:43Z","title":"Towards Graph Foundation Models: Learning Generalities Across Graphs via Task-Trees","version":3},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-11T10:41:12.341472Z"},"links":{"citing_paper":"/paper/2412.16441"},"observation_digest":"sha256:8c0f8c5b35cc38ebee3abee5d5248f267cf308033556c6911ae788ba7d13dc97","observation_id":"a1a7b916-2332-4578-88da-b30ba9513852","resolution":{"observed_at":"2026-08-11T10:41:13.580270Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T10:41:13.554424Z","title":"and Gurevych, I","venue":null,"work_id":"90db471f-5147-43ba-856f-3ea547188dbf","year":2019},"citing_paper":{"arxiv_id":"2412.16441","last_updated":"2025-05-25T14:58:07Z","snapshot_observed_at":"2026-08-11T10:32:54.401157Z","submitted_at":"2024-12-21T02:07:43Z","title":"Towards Graph Foundation Models: Learning Generalities Across Graphs via Task-Trees","version":3},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-11T10:41:12.346652Z"},"links":{"citing_paper":"/paper/2412.16441"},"observation_digest":"sha256:e742f7e8acff4829c8e7423981493e03b38af1015b132b68a7c5d54c10023ff2","observation_id":"9785ae99-17f7-4645-b7b3-6d5be81cc851","resolution":{"observed_at":"2026-08-11T10:41:13.559980Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T10:41:13.537868Z","title":"Perturbation bounds for means of eigenvalues and invariant subspaces","venue":null,"work_id":"e1fa88f2-c658-4106-94a3-874aa55d15fc","year":1970},"citing_paper":{"arxiv_id":"2412.16441","last_updated":"2025-05-25T14:58:07Z","snapshot_observed_at":"2026-08-11T10:32:54.401157Z","submitted_at":"2024-12-21T02:07:43Z","title":"Towards Graph Foundation Models: Learning Generalities Across Graphs via Task-Trees","version":3},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-11T10:41:12.352957Z"},"links":{"citing_paper":"/paper/2412.16441"},"observation_digest":"sha256:17141a0e410e6ec38c7faf2860750b32c9a8bdd92b949af3ac30c62f6ffbd2d8","observation_id":"bc57d5aa-281e-421b-9d44-660e4b317f58","resolution":{"observed_at":"2026-08-11T10:41:13.543445Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T10:41:13.519886Z","title":"Graphon neural networks and the transferability of graph neural networks","venue":null,"work_id":"3a82d268-5881-4ac0-b499-d710d7114c6d","year":2020},"citing_paper":{"arxiv_id":"2412.16441","last_updated":"2025-05-25T14:58:07Z","snapshot_observed_at":"2026-08-11T10:32:54.401157Z","submitted_at":"2024-12-21T02:07:43Z","title":"Towards Graph Foundation Models: Learning Generalities Across Graphs via Task-Trees","version":3},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-11T10:41:12.358300Z"},"links":{"citing_paper":"/paper/2412.16441"},"observation_digest":"sha256:157f2c0b5d614a3890ffbd89341cd255896bd3f811bb5107136c4678f69589a8","observation_id":"10f254f9-01b4-4e2f-aaa4-92c3678ebfaa","resolution":{"observed_at":"2026-08-11T10:41:13.525706Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T10:41:13.500397Z","title":"A., Cubuk, E","venue":null,"work_id":"9d9405d9-461d-4662-895c-3e1fc42ed2a2","year":2020},"citing_paper":{"arxiv_id":"2412.16441","last_updated":"2025-05-25T14:58:07Z","snapshot_observed_at":"2026-08-11T10:32:54.401157Z","submitted_at":"2024-12-21T02:07:43Z","title":"Towards Graph Foundation Models: Learning Generalities Across Graphs via Task-Trees","version":3},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-08-11T10:41:12.363515Z"},"links":{"citing_paper":"/paper/2412.16441"},"observation_digest":"sha256:399d822e59107abfd0607c9b880c9020b577a9429bcf1a73d67bbdb57251652c","observation_id":"25e7d77e-c4f2-442b-9963-c457cd11af1a","resolution":{"observed_at":"2026-08-11T10:41:13.507125Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T10:41:13.478989Z","title":"Preference ranking optimization for human alignment","venue":null,"work_id":"07e35b52-e76d-41e8-b696-36738eb1320b","year":2024},"citing_paper":{"arxiv_id":"2412.16441","last_updated":"2025-05-25T14:58:07Z","snapshot_observed_at":"2026-08-11T10:32:54.401157Z","submitted_at":"2024-12-21T02:07:43Z","title":"Towards Graph Foundation Models: Learning Generalities Across Graphs via Task-Trees","version":3},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-08-11T10:41:12.368457Z"},"links":{"citing_paper":"/paper/2412.16441"},"observation_digest":"sha256:1c264113d7f55695b36f3e99cfc0791cbb3d95cb584d160350d3027da7adf0b8","observation_id":"4057a49c-4fdb-42e6-8fab-e096fc128fb5","resolution":{"observed_at":"2026-08-11T10:41:13.484773Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T10:41:13.462784Z","title":"and Ribeiro, B","venue":null,"work_id":"721cd5c3-0015-474f-8932-9edf75f34aaa","year":2020},"citing_paper":{"arxiv_id":"2412.16441","last_updated":"2025-05-25T14:58:07Z","snapshot_observed_at":"2026-08-11T10:32:54.401157Z","submitted_at":"2024-12-21T02:07:43Z","title":"Towards Graph Foundation Models: Learning Generalities Across Graphs via Task-Trees","version":3},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-08-11T10:41:12.374545Z"},"links":{"citing_paper":"/paper/2412.16441"},"observation_digest":"sha256:abb97f35a28e46505907eecd146fcfbde6673a510eba9f0e7b612677c05cb9df","observation_id":"1b19830d-0cb5-4405-8fe5-84edb20b0933","resolution":{"observed_at":"2026-08-11T10:41:13.467481Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T10:41:13.445366Z","title":"A molecular multimodal foundation model associating molecule graphs with natural language","venue":null,"work_id":"d088bdf5-3d5a-4284-bd65-96997e93841d","year":2022},"citing_paper":{"arxiv_id":"2412.16441","last_updated":"2025-05-25T14:58:07Z","snapshot_observed_at":"2026-08-11T10:32:54.401157Z","submitted_at":"2024-12-21T02:07:43Z","title":"Towards Graph Foundation Models: Learning Generalities Across Graphs via Task-Trees","version":3},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-08-11T10:41:12.380493Z"},"links":{"citing_paper":"/paper/2412.16441"},"observation_digest":"sha256:c658bd877cf0475b0d51ef474fb023c896b2677f7cfe067231640765c64154a1","observation_id":"d02ca9c2-9866-4561-ad8e-f8960a5b7180","resolution":{"observed_at":"2026-08-11T10:41:13.450241Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T10:41:13.427817Z","title":"Gppt: Graph pre-training and prompt tuning to generalize graph neural networks","venue":null,"work_id":"367e3988-ef1d-426b-9883-74894af4f153","year":2022},"citing_paper":{"arxiv_id":"2412.16441","last_updated":"2025-05-25T14:58:07Z","snapshot_observed_at":"2026-08-11T10:32:54.401157Z","submitted_at":"2024-12-21T02:07:43Z","title":"Towards Graph Foundation Models: Learning Generalities Across Graphs via Task-Trees","version":3},"reference_index":54,"source":"arxiv_source","source_observed_at":"2026-08-11T10:41:12.385725Z"},"links":{"citing_paper":"/paper/2412.16441"},"observation_digest":"sha256:f2c6f6281e40bfeeb00d8010914a33d074db0ec9db092012c263e1beaa6aefc0","observation_id":"8069558d-6d54-4d92-9f39-49a51f6cab27","resolution":{"observed_at":"2026-08-11T10:41:13.433067Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T10:41:13.409349Z","title":"All in one: Multi-task prompting for graph neural networks","venue":null,"work_id":"1d6f13e1-530b-4b2c-b30b-bc1bbda7ceac","year":2023},"citing_paper":{"arxiv_id":"2412.16441","last_updated":"2025-05-25T14:58:07Z","snapshot_observed_at":"2026-08-11T10:32:54.401157Z","submitted_at":"2024-12-21T02:07:43Z","title":"Towards Graph Foundation Models: Learning Generalities Across Graphs via Task-Trees","version":3},"reference_index":55,"source":"arxiv_source","source_observed_at":"2026-08-11T10:41:12.390388Z"},"links":{"citing_paper":"/paper/2412.16441"},"observation_digest":"sha256:3c00d7312f9114f5dc5da1da18c27110b8bd8d3ce26f8e7214a532cc84706eaa","observation_id":"6e32d439-4422-4bdf-a13c-e6d6ff8269d6","resolution":{"observed_at":"2026-08-11T10:41:13.415382Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T10:41:13.393330Z","title":"Fine-tuning graph neural networks by preserving graph generative patterns","venue":null,"work_id":"4098fd86-8a8a-49d8-9942-c2fdd973dab7","year":2024},"citing_paper":{"arxiv_id":"2412.16441","last_updated":"2025-05-25T14:58:07Z","snapshot_observed_at":"2026-08-11T10:32:54.401157Z","submitted_at":"2024-12-21T02:07:43Z","title":"Towards Graph Foundation Models: Learning Generalities Across Graphs via Task-Trees","version":3},"reference_index":56,"source":"arxiv_source","source_observed_at":"2026-08-11T10:41:12.395002Z"},"links":{"citing_paper":"/paper/2412.16441"},"observation_digest":"sha256:acde9786c2ccbe07e4d26d1a7fa0eacdfb5b88f513895479174ac2d8cd52ffc1","observation_id":"95969635-6d45-426a-a207-f3d9be42aa6a","resolution":{"observed_at":"2026-08-11T10:41:13.397983Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T10:41:13.377153Z","title":"Transductive linear probing: a novel framework for few-shot node classification","venue":null,"work_id":"1118ddd0-f358-4ddc-a3f3-9d188a97179a","year":2022},"citing_paper":{"arxiv_id":"2412.16441","last_updated":"2025-05-25T14:58:07Z","snapshot_observed_at":"2026-08-11T10:32:54.401157Z","submitted_at":"2024-12-21T02:07:43Z","title":"Towards Graph Foundation Models: Learning Generalities Across Graphs via Task-Trees","version":3},"reference_index":57,"source":"arxiv_source","source_observed_at":"2026-08-11T10:41:12.399584Z"},"links":{"citing_paper":"/paper/2412.16441"},"observation_digest":"sha256:dfac96be5719be8ddcd36cedb0582904c864cdd43ea0404a7cf64612bab718d0","observation_id":"a4678be6-281c-4a5f-b749-803cc0bb1d2a","resolution":{"observed_at":"2026-08-11T10:41:13.381992Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T10:41:13.360536Z","title":"Graphgpt: Graph instruction tuning for large language models","venue":null,"work_id":"b10a4821-bca6-46e6-88b7-f05f44db4aa0","year":2024},"citing_paper":{"arxiv_id":"2412.16441","last_updated":"2025-05-25T14:58:07Z","snapshot_observed_at":"2026-08-11T10:32:54.401157Z","submitted_at":"2024-12-21T02:07:43Z","title":"Towards Graph Foundation Models: Learning Generalities Across Graphs via Task-Trees","version":3},"reference_index":58,"source":"arxiv_source","source_observed_at":"2026-08-11T10:41:12.403962Z"},"links":{"citing_paper":"/paper/2412.16441"},"observation_digest":"sha256:de6f64bb72c523f728a20433b8a5616868f43a9d650b0c37ab61642527ade100","observation_id":"c6e402fd-8ee9-4b05-a865-8d5f37590d5a","resolution":{"observed_at":"2026-08-11T10:41:13.366148Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T10:41:13.342017Z","title":"Galactica: A large language model for science","venue":null,"work_id":"6855230c-7274-479a-8c41-edbd7a155839","year":2022},"citing_paper":{"arxiv_id":"2412.16441","last_updated":"2025-05-25T14:58:07Z","snapshot_observed_at":"2026-08-11T10:32:54.401157Z","submitted_at":"2024-12-21T02:07:43Z","title":"Towards Graph Foundation Models: Learning Generalities Across Graphs via Task-Trees","version":3},"reference_index":59,"source":"arxiv_source","source_observed_at":"2026-08-11T10:41:12.408767Z"},"links":{"citing_paper":"/paper/2412.16441"},"observation_digest":"sha256:087ba48cca866b3eb65e729177d0ffa9f727c296f1591460f2b5379124057a94","observation_id":"91e8674d-d1ac-4324-a487-b3ebfbdeef76","resolution":{"observed_at":"2026-08-11T10:41:13.347888Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T10:41:13.323478Z","title":"G., Azabou, M., Dyer, E","venue":null,"work_id":"e0ffb87b-9a37-4964-ae55-20f7336f2c89","year":2022},"citing_paper":{"arxiv_id":"2412.16441","last_updated":"2025-05-25T14:58:07Z","snapshot_observed_at":"2026-08-11T10:32:54.401157Z","submitted_at":"2024-12-21T02:07:43Z","title":"Towards Graph Foundation Models: Learning Generalities Across Graphs via Task-Trees","version":3},"reference_index":60,"source":"arxiv_source","source_observed_at":"2026-08-11T10:41:12.415936Z"},"links":{"citing_paper":"/paper/2412.16441"},"observation_digest":"sha256:897d445a226715c0e28c6516a5b2a416c722a9a003c6cd0c42bb357ee9befa8b","observation_id":"8c82ba25-2c45-4e74-8dec-ed3af6c9839f","resolution":{"observed_at":"2026-08-11T10:41:13.329572Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T10:41:12.420506Z","title":"Llama: Open and efficient foundation language models","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.16441","last_updated":"2025-05-25T14:58:07Z","snapshot_observed_at":"2026-08-11T10:32:54.401157Z","submitted_at":"2024-12-21T02:07:43Z","title":"Towards Graph Foundation Models: Learning Generalities Across Graphs via Task-Trees","version":3},"reference_index":61,"source":"arxiv_source","source_observed_at":"2026-08-11T10:41:12.420506Z"},"links":{"citing_paper":"/paper/2412.16441"},"observation_digest":"sha256:a5bc4865819681f5dbafd1b64714694bb69977864c5192f9ebb91ce83f213cd8","observation_id":"a8118e91-4f1b-430e-8362-dcbbd7763b83","resolution":{"observed_at":"2026-08-11T10:41:12.420506Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T10:41:13.285277Z","title":"Graph attention networks","venue":null,"work_id":"bf8a72ea-ac11-45a1-9615-35e5dc2a6776","year":2018},"citing_paper":{"arxiv_id":"2412.16441","last_updated":"2025-05-25T14:58:07Z","snapshot_observed_at":"2026-08-11T10:32:54.401157Z","submitted_at":"2024-12-21T02:07:43Z","title":"Towards Graph Foundation Models: Learning Generalities Across Graphs via Task-Trees","version":3},"reference_index":62,"source":"arxiv_source","source_observed_at":"2026-08-11T10:41:12.424953Z"},"links":{"citing_paper":"/paper/2412.16441"},"observation_digest":"sha256:8c3f73a865617a42a08357f6c774856173f66d7af17076ce0df654e8e62b66c7","observation_id":"7110fcec-313f-453e-8082-ec01f54a23a0","resolution":{"observed_at":"2026-08-11T10:41:13.291618Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T10:41:13.265888Z","title":"Can language models solve graph problems in natural language? In NeurIPS, 2024 a","venue":null,"work_id":"9b144434-d396-450b-8907-2f0fd82e904a","year":2024},"citing_paper":{"arxiv_id":"2412.16441","last_updated":"2025-05-25T14:58:07Z","snapshot_observed_at":"2026-08-11T10:32:54.401157Z","submitted_at":"2024-12-21T02:07:43Z","title":"Towards Graph Foundation Models: Learning Generalities Across Graphs via Task-Trees","version":3},"reference_index":63,"source":"arxiv_source","source_observed_at":"2026-08-11T10:41:12.429351Z"},"links":{"citing_paper":"/paper/2412.16441"},"observation_digest":"sha256:41fd8cbba99e4e566fbc5df40e9f8f70c15195387c3a03679e8e27431e07a5fb","observation_id":"988c368c-b0ce-405f-91da-a194c2ed9523","resolution":{"observed_at":"2026-08-11T10:41:13.272060Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T10:41:13.249710Z","title":"Graph few-shot learning with task-specific structures","venue":null,"work_id":"0ba92d2c-9d7f-48d9-89bf-17159bafef4f","year":2022},"citing_paper":{"arxiv_id":"2412.16441","last_updated":"2025-05-25T14:58:07Z","snapshot_observed_at":"2026-08-11T10:32:54.401157Z","submitted_at":"2024-12-21T02:07:43Z","title":"Towards Graph Foundation Models: Learning Generalities Across Graphs via Task-Trees","version":3},"reference_index":64,"source":"arxiv_source","source_observed_at":"2026-08-11T10:41:12.433761Z"},"links":{"citing_paper":"/paper/2412.16441"},"observation_digest":"sha256:96a08f9f1e5061c4dc322f6209ec69d48099a1e0a163b6eeb9941e854f6f3b37","observation_id":"e5724db6-92ac-449a-8e84-cd1e3a712365","resolution":{"observed_at":"2026-08-11T10:41:13.254896Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T10:41:13.231667Z","title":"Task-adaptive few-shot node classification","venue":null,"work_id":"86140304-947b-4ff7-be1a-b614f98e62bc","year":2022},"citing_paper":{"arxiv_id":"2412.16441","last_updated":"2025-05-25T14:58:07Z","snapshot_observed_at":"2026-08-11T10:32:54.401157Z","submitted_at":"2024-12-21T02:07:43Z","title":"Towards Graph Foundation Models: Learning Generalities Across Graphs via Task-Trees","version":3},"reference_index":65,"source":"arxiv_source","source_observed_at":"2026-08-11T10:41:12.438176Z"},"links":{"citing_paper":"/paper/2412.16441"},"observation_digest":"sha256:494736c9e8bad46adf1c0403719d5768df15a98b8fd7d7d42f5cf82b824fde09","observation_id":"1419eeb8-30b8-4cd9-b50d-3ede451f0bdd","resolution":{"observed_at":"2026-08-11T10:41:13.237836Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T10:41:13.203158Z","title":"V., Zhang, C., and Ye, Y","venue":null,"work_id":"5509a2e1-201d-490b-b026-59527581714d","year":2024},"citing_paper":{"arxiv_id":"2412.16441","last_updated":"2025-05-25T14:58:07Z","snapshot_observed_at":"2026-08-11T10:32:54.401157Z","submitted_at":"2024-12-21T02:07:43Z","title":"Towards Graph Foundation Models: Learning Generalities Across Graphs via Task-Trees","version":3},"reference_index":66,"source":"arxiv_source","source_observed_at":"2026-08-11T10:41:12.442366Z"},"links":{"citing_paper":"/paper/2412.16441"},"observation_digest":"sha256:2dae38851373e898b477a087b8b2384d742ae5266ad24cf22b7e177e5dd874ed","observation_id":"668f0ef7-d7d1-4b30-8ec8-5da57549f9ab","resolution":{"observed_at":"2026-08-11T10:41:13.211593Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T10:41:13.183040Z","title":"Subgraph pooling: Tackling negative transfer on graphs","venue":null,"work_id":"bafa40af-ff96-4570-998d-c05b9c0c23d4","year":2024},"citing_paper":{"arxiv_id":"2412.16441","last_updated":"2025-05-25T14:58:07Z","snapshot_observed_at":"2026-08-11T10:32:54.401157Z","submitted_at":"2024-12-21T02:07:43Z","title":"Towards Graph Foundation Models: Learning Generalities Across Graphs via Task-Trees","version":3},"reference_index":67,"source":"arxiv_source","source_observed_at":"2026-08-11T10:41:12.446734Z"},"links":{"citing_paper":"/paper/2412.16441"},"observation_digest":"sha256:9390be11976b40bca9d1045919df63f925263c2bd471dfbea521c85fdb3bb0bc","observation_id":"423f9ea8-0a09-45a1-b2fd-100c99d2be0a","resolution":{"observed_at":"2026-08-11T10:41:13.190510Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T10:41:13.166655Z","title":"Can llms convert graphs to text-attributed graphs? In NAACL, 2025 a","venue":null,"work_id":"49039bd8-6d17-46cb-be04-b2bccb923223","year":2025},"citing_paper":{"arxiv_id":"2412.16441","last_updated":"2025-05-25T14:58:07Z","snapshot_observed_at":"2026-08-11T10:32:54.401157Z","submitted_at":"2024-12-21T02:07:43Z","title":"Towards Graph Foundation Models: Learning Generalities Across Graphs via Task-Trees","version":3},"reference_index":68,"source":"arxiv_source","source_observed_at":"2026-08-11T10:41:12.451245Z"},"links":{"citing_paper":"/paper/2412.16441"},"observation_digest":"sha256:20de9c293eb48f6acb7cf90df7401e9c58c8f3dfb6ca2dc3d45a0b585799cb0d","observation_id":"5027ae82-858b-4b57-814c-f180ebf630e4","resolution":{"observed_at":"2026-08-11T10:41:13.171826Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T10:41:13.147962Z","title":"V., Zhang, C., and Ye, Y","venue":null,"work_id":"b61f9884-e3c4-4ba3-adae-472f06d41a47","year":2025},"citing_paper":{"arxiv_id":"2412.16441","last_updated":"2025-05-25T14:58:07Z","snapshot_observed_at":"2026-08-11T10:32:54.401157Z","submitted_at":"2024-12-21T02:07:43Z","title":"Towards Graph Foundation Models: Learning Generalities Across Graphs via Task-Trees","version":3},"reference_index":69,"source":"arxiv_source","source_observed_at":"2026-08-11T10:41:12.455598Z"},"links":{"citing_paper":"/paper/2412.16441"},"observation_digest":"sha256:018648c8b09b379ca4dd51cb679e5deddaa3118abd5a6fc6f75eb9461068df3b","observation_id":"9e2a23b4-3622-4b68-bebd-ceaa1b201a5f","resolution":{"observed_at":"2026-08-11T10:41:13.153470Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T10:41:13.128411Z","title":"Training mlps on graphs without supervision","venue":null,"work_id":"0d49cdc4-3bf3-411d-8cab-b59287974e3d","year":2025},"citing_paper":{"arxiv_id":"2412.16441","last_updated":"2025-05-25T14:58:07Z","snapshot_observed_at":"2026-08-11T10:32:54.401157Z","submitted_at":"2024-12-21T02:07:43Z","title":"Towards Graph Foundation Models: Learning Generalities Across Graphs via Task-Trees","version":3},"reference_index":70,"source":"arxiv_source","source_observed_at":"2026-08-11T10:41:12.459774Z"},"links":{"citing_paper":"/paper/2412.16441"},"observation_digest":"sha256:3dbe9a85457fd917f3e1f862b8774f3e88cc7859d90d4db5533c62ea4cf24abe","observation_id":"dc79cb94-3e01-4210-bb9b-006f843e9785","resolution":{"observed_at":"2026-08-11T10:41:13.135108Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T10:41:12.963277Z","title":"Y., Guu, K., Yu, A","venue":null,"work_id":"d36a18c7-fef0-42da-9d50-149ec2ebcd53","year":2021},"citing_paper":{"arxiv_id":"2412.16441","last_updated":"2025-05-25T14:58:07Z","snapshot_observed_at":"2026-08-11T10:32:54.401157Z","submitted_at":"2024-12-21T02:07:43Z","title":"Towards Graph Foundation Models: Learning Generalities Across Graphs via Task-Trees","version":3},"reference_index":71,"source":"arxiv_source","source_observed_at":"2026-08-11T10:41:12.464021Z"},"links":{"citing_paper":"/paper/2412.16441"},"observation_digest":"sha256:ce5b6b7d9b0b4d789393f49b3551f736e7e7f806948a749ed876694e13b00efe","observation_id":"6bfecc74-8f2a-40ad-93c1-4ea56abf533b","resolution":{"observed_at":"2026-08-11T10:41:12.968540Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T10:41:12.946789Z","title":"From coarse to fine: enable comprehensive graph self-supervised learning with multi-granular semantic ensemble","venue":null,"work_id":"1a59b9af-2cc7-4a4a-b1f2-d944a446b553","year":2024},"citing_paper":{"arxiv_id":"2412.16441","last_updated":"2025-05-25T14:58:07Z","snapshot_observed_at":"2026-08-11T10:32:54.401157Z","submitted_at":"2024-12-21T02:07:43Z","title":"Towards Graph Foundation Models: Learning Generalities Across Graphs via Task-Trees","version":3},"reference_index":72,"source":"arxiv_source","source_observed_at":"2026-08-11T10:41:12.468517Z"},"links":{"citing_paper":"/paper/2412.16441"},"observation_digest":"sha256:0e18212e390315e3ee18e688973a3582532b90559b5e93371c6192af14bcf04d","observation_id":"b2236820-6159-4407-8bb2-21729612da64","resolution":{"observed_at":"2026-08-11T10:41:12.951963Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T10:41:12.929075Z","title":"and Huang, C","venue":null,"work_id":"d1ba3e65-985b-41a5-a6a1-cc4f52c28b08","year":2024},"citing_paper":{"arxiv_id":"2412.16441","last_updated":"2025-05-25T14:58:07Z","snapshot_observed_at":"2026-08-11T10:32:54.401157Z","submitted_at":"2024-12-21T02:07:43Z","title":"Towards Graph Foundation Models: Learning Generalities Across Graphs via Task-Trees","version":3},"reference_index":73,"source":"arxiv_source","source_observed_at":"2026-08-11T10:41:12.473314Z"},"links":{"citing_paper":"/paper/2412.16441"},"observation_digest":"sha256:00d309218d327cd8ab5a0197d0b852cfcb74cd6ebd7c29bd1e4366b1f7b6987c","observation_id":"4155c7b4-8e42-4629-bc33-b8e7e168248e","resolution":{"observed_at":"2026-08-11T10:41:12.935350Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T10:41:12.911155Z","title":"Opengraph: Towards open graph foundation models","venue":null,"work_id":"30e9a3ac-d0de-470e-832e-2c01f5241d9c","year":2024},"citing_paper":{"arxiv_id":"2412.16441","last_updated":"2025-05-25T14:58:07Z","snapshot_observed_at":"2026-08-11T10:32:54.401157Z","submitted_at":"2024-12-21T02:07:43Z","title":"Towards Graph Foundation Models: Learning Generalities Across Graphs via Task-Trees","version":3},"reference_index":74,"source":"arxiv_source","source_observed_at":"2026-08-11T10:41:12.478428Z"},"links":{"citing_paper":"/paper/2412.16441"},"observation_digest":"sha256:d38fadbd0679129968a5dc9a57cff9e49f53b17f4a70c516e825b80fdf747c5f","observation_id":"dfcd3c4c-0d50-4acf-8ea8-1e6600ca3b53","resolution":{"observed_at":"2026-08-11T10:41:12.917261Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T10:41:12.894701Z","title":"M., Raghunathan, A., Liang, P., and Ma, T","venue":null,"work_id":"f35b79d1-ddcf-4c7b-b488-64e6e2c4d558","year":2022},"citing_paper":{"arxiv_id":"2412.16441","last_updated":"2025-05-25T14:58:07Z","snapshot_observed_at":"2026-08-11T10:32:54.401157Z","submitted_at":"2024-12-21T02:07:43Z","title":"Towards Graph Foundation Models: Learning Generalities Across Graphs via Task-Trees","version":3},"reference_index":75,"source":"arxiv_source","source_observed_at":"2026-08-11T10:41:12.484487Z"},"links":{"citing_paper":"/paper/2412.16441"},"observation_digest":"sha256:17c8fc6e21cb04039e6236c9ef54fbda68f959f43d9b227591a3da3f06443593","observation_id":"8840aa6c-5824-4043-a8b8-c7b9c6c2a053","resolution":{"observed_at":"2026-08-11T10:41:12.899327Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T10:41:12.489922Z","title":"How powerful are graph neural networks? In ICLR, 2019","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2412.16441","last_updated":"2025-05-25T14:58:07Z","snapshot_observed_at":"2026-08-11T10:32:54.401157Z","submitted_at":"2024-12-21T02:07:43Z","title":"Towards Graph Foundation Models: Learning Generalities Across Graphs via Task-Trees","version":3},"reference_index":76,"source":"arxiv_source","source_observed_at":"2026-08-11T10:41:12.489922Z"},"links":{"citing_paper":"/paper/2412.16441"},"observation_digest":"sha256:a603aa084ce8093775ddbd799f6a327986e31b06b4d949c9905fd0b3be1b3631","observation_id":"7deaf86f-b95d-4cf9-8803-ef47f53cca9a","resolution":{"observed_at":"2026-08-11T10:41:12.489922Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T10:41:12.866019Z","title":"Text-free multi-domain graph pre-training: Toward graph foundation models","venue":null,"work_id":"356a992a-f438-4945-ab3f-bbef242226b7","year":2024},"citing_paper":{"arxiv_id":"2412.16441","last_updated":"2025-05-25T14:58:07Z","snapshot_observed_at":"2026-08-11T10:32:54.401157Z","submitted_at":"2024-12-21T02:07:43Z","title":"Towards Graph Foundation Models: Learning Generalities Across Graphs via Task-Trees","version":3},"reference_index":77,"source":"arxiv_source","source_observed_at":"2026-08-11T10:41:12.498532Z"},"links":{"citing_paper":"/paper/2412.16441"},"observation_digest":"sha256:22fb9c79c807d29fe45081b57e3bb0ca1eaa37ad60e973353251408959991792","observation_id":"d53f5bff-ec3b-4a70-91ed-a80b1e098b83","resolution":{"observed_at":"2026-08-11T10:41:12.870988Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T10:41:12.851664Z","title":"Florence: A new foundation model for computer vision","venue":null,"work_id":"e8d47671-d52e-4f98-a99c-32f6e79caadb","year":2021},"citing_paper":{"arxiv_id":"2412.16441","last_updated":"2025-05-25T14:58:07Z","snapshot_observed_at":"2026-08-11T10:32:54.401157Z","submitted_at":"2024-12-21T02:07:43Z","title":"Towards Graph Foundation Models: Learning Generalities Across Graphs via Task-Trees","version":3},"reference_index":78,"source":"arxiv_source","source_observed_at":"2026-08-11T10:41:12.503611Z"},"links":{"citing_paper":"/paper/2412.16441"},"observation_digest":"sha256:82bd1f7c2c078bd121b47dd13ddf1e8ef9493557a32073a33cd33550097d35ef","observation_id":"73bac78b-93d2-4b0e-ab38-8c218f9d587f","resolution":{"observed_at":"2026-08-11T10:41:12.856257Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T10:41:12.836040Z","title":"A deep-learning system bridging molecule structure and biomedical text with comprehension comparable to human professionals","venue":null,"work_id":"da882aba-639b-4ee0-880c-c6deb1f9adb4","year":2022},"citing_paper":{"arxiv_id":"2412.16441","last_updated":"2025-05-25T14:58:07Z","snapshot_observed_at":"2026-08-11T10:32:54.401157Z","submitted_at":"2024-12-21T02:07:43Z","title":"Towards Graph Foundation Models: Learning Generalities Across Graphs via Task-Trees","version":3},"reference_index":79,"source":"arxiv_source","source_observed_at":"2026-08-11T10:41:12.508797Z"},"links":{"citing_paper":"/paper/2412.16441"},"observation_digest":"sha256:8dc871127c6657aa8ddd66a6058e6e99b3ca08351c89a1fd3585069e3f39e737","observation_id":"81e43eb0-1166-4d3f-bbcc-45edfc28d6e1","resolution":{"observed_at":"2026-08-11T10:41:12.841188Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T10:41:12.819701Z","title":"Beyond weisfeiler-lehman: A quantitative framework for gnn expressiveness","venue":null,"work_id":"500afaeb-b41d-43ec-a20a-1eb3ede17b21","year":2024},"citing_paper":{"arxiv_id":"2412.16441","last_updated":"2025-05-25T14:58:07Z","snapshot_observed_at":"2026-08-11T10:32:54.401157Z","submitted_at":"2024-12-21T02:07:43Z","title":"Towards Graph Foundation Models: Learning Generalities Across Graphs via Task-Trees","version":3},"reference_index":80,"source":"arxiv_source","source_observed_at":"2026-08-11T10:41:12.518892Z"},"links":{"citing_paper":"/paper/2412.16441"},"observation_digest":"sha256:9e0ce26747b00645f850dd8f79aa57fad20da25660d32fbe476c3f57a415bbb9","observation_id":"09a0b6af-2c9c-4d1d-8969-eaf1e6cbd5ca","resolution":{"observed_at":"2026-08-11T10:41:12.824922Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T10:41:12.802830Z","title":null,"venue":null,"work_id":"8c825d08-d3fb-4a16-95f6-fc0a41a194f3","year":2019},"citing_paper":{"arxiv_id":"2412.16441","last_updated":"2025-05-25T14:58:07Z","snapshot_observed_at":"2026-08-11T10:32:54.401157Z","submitted_at":"2024-12-21T02:07:43Z","title":"Towards Graph Foundation Models: Learning Generalities Across Graphs via Task-Trees","version":3},"reference_index":81,"source":"arxiv_source","source_observed_at":"2026-08-11T10:41:12.524364Z"},"links":{"citing_paper":"/paper/2412.16441"},"observation_digest":"sha256:cc647265eaf9ef4100373bb513279576dfb67cee07d88097ea6e47e107b7da57","observation_id":"1f5764cf-6340-4b09-9a80-ffc631045015","resolution":{"observed_at":"2026-08-11T10:41:12.808174Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T10:41:12.786161Z","title":"Dtgb: A comprehensive benchmark for dynamic text-attributed graphs","venue":null,"work_id":"c2f15ca5-7505-433f-bd51-b773ed67b9dd","year":2024},"citing_paper":{"arxiv_id":"2412.16441","last_updated":"2025-05-25T14:58:07Z","snapshot_observed_at":"2026-08-11T10:32:54.401157Z","submitted_at":"2024-12-21T02:07:43Z","title":"Towards Graph Foundation Models: Learning Generalities Across Graphs via Task-Trees","version":3},"reference_index":82,"source":"arxiv_source","source_observed_at":"2026-08-11T10:41:12.530539Z"},"links":{"citing_paper":"/paper/2412.16441"},"observation_digest":"sha256:c455c59a5d8d58951322e9fa6c6ba02808f55b682b296d0a025e3aa8dd9284b9","observation_id":"a9bc3320-04cf-42b0-be5a-06f8253e72e2","resolution":{"observed_at":"2026-08-11T10:41:12.791722Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T10:41:12.769009Z","title":"Labeling trick: A theory of using graph neural networks for multi-node representation learning","venue":null,"work_id":"34510603-d13c-4274-8c4a-cdbc356d823d","year":2021},"citing_paper":{"arxiv_id":"2412.16441","last_updated":"2025-05-25T14:58:07Z","snapshot_observed_at":"2026-08-11T10:32:54.401157Z","submitted_at":"2024-12-21T02:07:43Z","title":"Towards Graph Foundation Models: Learning Generalities Across Graphs via Task-Trees","version":3},"reference_index":83,"source":"arxiv_source","source_observed_at":"2026-08-11T10:41:12.536083Z"},"links":{"citing_paper":"/paper/2412.16441"},"observation_digest":"sha256:583d61be74ccd4b174d6a9d9ba92b95acda43d92d8a50dcfc9e158fc91efe79b","observation_id":"cdd83184-8977-4e9a-bc50-cfaed915b50e","resolution":{"observed_at":"2026-08-11T10:41:12.774136Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T10:41:12.750983Z","title":"V., Zhang, C., and Ye, Y","venue":null,"work_id":"01a62e09-5b01-478d-869b-de6a49d0a981","year":2024},"citing_paper":{"arxiv_id":"2412.16441","last_updated":"2025-05-25T14:58:07Z","snapshot_observed_at":"2026-08-11T10:32:54.401157Z","submitted_at":"2024-12-21T02:07:43Z","title":"Towards Graph Foundation Models: Learning Generalities Across Graphs via Task-Trees","version":3},"reference_index":84,"source":"arxiv_source","source_observed_at":"2026-08-11T10:41:12.541395Z"},"links":{"citing_paper":"/paper/2412.16441"},"observation_digest":"sha256:7b684401b89b9a8bd1497b95457febc60b758b7254b5b08d22203f4481a2aae2","observation_id":"f63a1393-d3d5-4163-b245-2468db203917","resolution":{"observed_at":"2026-08-11T10:41:12.756802Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T10:41:12.732774Z","title":"Gimlet: A unified graph-text model for instruction-based molecule zero-shot learning","venue":null,"work_id":"5256bd42-9780-4ca5-9622-a3a02a7f1547","year":2023},"citing_paper":{"arxiv_id":"2412.16441","last_updated":"2025-05-25T14:58:07Z","snapshot_observed_at":"2026-08-11T10:32:54.401157Z","submitted_at":"2024-12-21T02:07:43Z","title":"Towards Graph Foundation Models: Learning Generalities Across Graphs via Task-Trees","version":3},"reference_index":85,"source":"arxiv_source","source_observed_at":"2026-08-11T10:41:12.546370Z"},"links":{"citing_paper":"/paper/2412.16441"},"observation_digest":"sha256:f63d6e4cd84c472e35667021b468680382add498a87072ab37818a51d578e877","observation_id":"e93d0700-0e93-46ef-8ec9-d653fa9d0564","resolution":{"observed_at":"2026-08-11T10:41:12.737747Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T10:41:12.716589Z","title":"All in one and one for all: A simple yet effective method towards cross-domain graph pretraining","venue":null,"work_id":"57dfbf6c-ca9c-4bd0-8057-5c4ff32bc437","year":2024},"citing_paper":{"arxiv_id":"2412.16441","last_updated":"2025-05-25T14:58:07Z","snapshot_observed_at":"2026-08-11T10:32:54.401157Z","submitted_at":"2024-12-21T02:07:43Z","title":"Towards Graph Foundation Models: Learning Generalities Across Graphs via Task-Trees","version":3},"reference_index":86,"source":"arxiv_source","source_observed_at":"2026-08-11T10:41:12.551581Z"},"links":{"citing_paper":"/paper/2412.16441"},"observation_digest":"sha256:9c1ab65e8e942593947ae650ff095d91f915f3db23191dc8a5a5f213c4743cf7","observation_id":"ea27b729-2784-4c0f-9625-6b025f73c246","resolution":{"observed_at":"2026-08-11T10:41:12.722047Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T10:41:12.698814Z","title":"Graphany: A foundation model for node classification on any graph","venue":null,"work_id":"31a082db-9605-4ed1-8d3d-99ad9374bce9","year":2024},"citing_paper":{"arxiv_id":"2412.16441","last_updated":"2025-05-25T14:58:07Z","snapshot_observed_at":"2026-08-11T10:32:54.401157Z","submitted_at":"2024-12-21T02:07:43Z","title":"Towards Graph Foundation Models: Learning Generalities Across Graphs via Task-Trees","version":3},"reference_index":87,"source":"arxiv_source","source_observed_at":"2026-08-11T10:41:12.556605Z"},"links":{"citing_paper":"/paper/2412.16441"},"observation_digest":"sha256:dd77b10189013361ea605ebe4a54cbba0b6da733261eb4f884bcc850f52c96d8","observation_id":"52746894-49cd-4585-9522-940318e98a81","resolution":{"observed_at":"2026-08-11T10:41:12.704371Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T10:41:12.680147Z","title":"Transfer learning of graph neural networks with ego-graph information maximization","venue":null,"work_id":"064da0bf-724c-41b1-837f-3b726cf69abf","year":2021},"citing_paper":{"arxiv_id":"2412.16441","last_updated":"2025-05-25T14:58:07Z","snapshot_observed_at":"2026-08-11T10:32:54.401157Z","submitted_at":"2024-12-21T02:07:43Z","title":"Towards Graph Foundation Models: Learning Generalities Across Graphs via Task-Trees","version":3},"reference_index":88,"source":"arxiv_source","source_observed_at":"2026-08-11T10:41:12.561242Z"},"links":{"citing_paper":"/paper/2412.16441"},"observation_digest":"sha256:a55b5d98f8c602567daa2e258040db6df4230c1d03561366b9daa530ad4fa848","observation_id":"3d5a7346-bcbc-49e0-8424-e6b65c403848","resolution":{"observed_at":"2026-08-11T10:41:12.687617Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T10:41:12.658494Z","title":"Deep graph contrastive representation learning","venue":null,"work_id":"bcc11b18-a49e-4f01-8440-296627d4e3e2","year":2020},"citing_paper":{"arxiv_id":"2412.16441","last_updated":"2025-05-25T14:58:07Z","snapshot_observed_at":"2026-08-11T10:32:54.401157Z","submitted_at":"2024-12-21T02:07:43Z","title":"Towards Graph Foundation Models: Learning Generalities Across Graphs via Task-Trees","version":3},"reference_index":89,"source":"arxiv_source","source_observed_at":"2026-08-11T10:41:12.565965Z"},"links":{"citing_paper":"/paper/2412.16441"},"observation_digest":"sha256:cfb9da15080aa606501b082556dbb9dda2578ecc648b80ccae5cc73f2a85a712","observation_id":"b199823a-4a78-416e-b421-0c69abaddc45","resolution":{"observed_at":"2026-08-11T10:41:12.667039Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2412.16441","last_updated":"2025-05-25T14:58:07Z","latest_version":3,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-11T10:32:54.401157Z","submitted_at":"2024-12-21T02:07:43Z","title":"Towards Graph Foundation Models: Learning Generalities Across Graphs via Task-Trees"},"reference_resolution":{"displayed":89,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":19,"verified_exact":0,"verified_fuzzy":70},"total_outbound_references":89},"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-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 89 of 89 outbound references and 0 inbound Pith citation observations for arXiv:2412.16441."}