{"as_of":"2026-08-08T11:43:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:1f36d89b58aa50b61281e04fbf5a0f2d747720029c5a9a80f61bd1244c118713","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":12,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":12,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":12,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":12,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-08T10:55:16.688055Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-07-02T11:56:55.655532Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2405.13934","last_updated":"2024-09-22T03:47:19Z","snapshot_observed_at":"2026-08-01T15:39:52.519512Z","submitted_at":"2024-05-22T19:06:39Z","title":"Text-Free Multi-domain Graph Pre-training: Toward Graph Foundation Models","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.13934","snapshot_observed_at":"2026-08-08T10:55:16.688055Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.08092","last_updated":"2025-06-02T14:02:08Z","snapshot_observed_at":"2026-08-08T10:26:39.986137Z","submitted_at":"2025-02-12T03:33:06Z","title":"GCoT: Chain-of-Thought Prompt Learning for Graphs","version":2},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-08T10:55:16.688055Z"},"links":{"cited_paper":"/paper/2405.13934","citing_paper":"/paper/2502.08092"},"observation_digest":"sha256:7843dfd1ea0a35f71c15602edb51480ca256a31858b812d965ee7c3c15a16ad2","observation_id":"a787d89f-c41f-4e93-a526-f9850a79afca","resolution":{"observed_at":"2026-08-08T10:55:16.688055Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.13934","last_updated":"2024-09-22T03:47:19Z","snapshot_observed_at":"2026-08-01T15:39:52.519512Z","submitted_at":"2024-05-22T19:06:39Z","title":"Text-Free Multi-domain Graph Pre-training: Toward Graph Foundation Models","version":4},"cited_work":{"arxiv_id":"2405.13934","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2405.13934","snapshot_observed_at":"2026-07-02T11:56:55.655532Z","title":"Hgprompt: Bridg- ing homogeneous and heterogeneous graphs for few-shot prompt learning","venue":null,"work_id":"7ab27799-85a6-4150-8e45-48e80c29ae42","year":2024},"citing_paper":{"arxiv_id":"2602.11629","last_updated":"2026-05-22T02:58:25Z","snapshot_observed_at":"2026-08-02T17:31:07.804176Z","submitted_at":"2026-02-12T06:25:21Z","title":"GP2F: Cross-Domain Graph Prompting with Adaptive Fusion of Pre-trained Graph Neural Networks","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-25T07:34:42.234291Z"},"links":{"cited_paper":"/paper/2405.13934","citing_paper":"/paper/2602.11629"},"observation_digest":"sha256:0ec38cc506cac6654caab1a5e7ea5a87330e0aec14e39b24bdf40e2c11b72c69","observation_id":"552c20b7-ce33-4612-bf9f-f9a114ebdfdb","resolution":{"observed_at":"2026-05-25T07:35:28.046074Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2405.13934","last_updated":"2024-09-22T03:47:19Z","snapshot_observed_at":"2026-08-01T15:39:52.519512Z","submitted_at":"2024-05-22T19:06:39Z","title":"Text-Free Multi-domain Graph Pre-training: Toward Graph Foundation Models","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.13934","snapshot_observed_at":"2026-08-02T23:38:56.742968Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2602.13075","last_updated":"2026-05-27T04:21:31Z","snapshot_observed_at":"2026-08-02T23:38:48.433563Z","submitted_at":"2026-02-13T16:34:55Z","title":"Unified Multi-Domain Graph Pre-training for Homogeneous and Heterogeneous Graphs via Domain-Specific Expert Encoding","version":2},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-02T23:38:56.742968Z"},"links":{"cited_paper":"/paper/2405.13934","citing_paper":"/paper/2602.13075"},"observation_digest":"sha256:422a3c30eb1016986952c373ca9a0c4ce6595ea91f0feff33fc74aff1c508700","observation_id":"c8e94bb1-f054-405b-b149-f1174243db69","resolution":{"observed_at":"2026-08-02T23:38:56.742968Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.13934","last_updated":"2024-09-22T03:47:19Z","snapshot_observed_at":"2026-08-01T15:39:52.519512Z","submitted_at":"2024-05-22T19:06:39Z","title":"Text-Free Multi-domain Graph Pre-training: Toward Graph Foundation Models","version":4},"cited_work":{"arxiv_id":"2405.13934","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2405.13934","snapshot_observed_at":"2026-07-02T11:56:55.655532Z","title":"Hgprompt: Bridg- ing homogeneous and heterogeneous graphs for few-shot prompt learning","venue":null,"work_id":"7ab27799-85a6-4150-8e45-48e80c29ae42","year":2024},"citing_paper":{"arxiv_id":"2605.00731","last_updated":"2026-05-01T15:31:36Z","snapshot_observed_at":"2026-07-06T23:14:06.327027Z","submitted_at":"2026-05-01T15:31:36Z","title":"Empowering Heterogeneous Graph Foundation Models via Decoupled Relation Alignment","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-05-09T14:30:55.764387Z"},"links":{"cited_paper":"/paper/2405.13934","citing_paper":"/paper/2605.00731"},"observation_digest":"sha256:e1e5297fcdb0239670fb8d45f2626676918280b7024e1262718c405f2ba0c7af","observation_id":"49a5fdad-9308-4006-9665-0654aa313f2b","resolution":{"observed_at":"2026-05-11T16:56:06.605107Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2405.13934","last_updated":"2024-09-22T03:47:19Z","snapshot_observed_at":"2026-08-01T15:39:52.519512Z","submitted_at":"2024-05-22T19:06:39Z","title":"Text-Free Multi-domain Graph Pre-training: Toward Graph Foundation Models","version":4},"cited_work":{"arxiv_id":"2405.13934","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2405.13934","snapshot_observed_at":"2026-07-02T11:56:55.655532Z","title":"Hgprompt: Bridg- ing homogeneous and heterogeneous graphs for few-shot prompt learning","venue":null,"work_id":"7ab27799-85a6-4150-8e45-48e80c29ae42","year":2024},"citing_paper":{"arxiv_id":"2605.04834","last_updated":"2026-05-06T12:30:50Z","snapshot_observed_at":"2026-08-08T07:12:46.232151Z","submitted_at":"2026-05-06T12:30:50Z","title":"Bridging Input Feature Spaces Towards Graph Foundation Models","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-05-08T17:18:21.259797Z"},"links":{"cited_paper":"/paper/2405.13934","citing_paper":"/paper/2605.04834"},"observation_digest":"sha256:6c4d0c669c768c67e8d902a2f80defd2baff36c3d76b36b85b64471a18a6d388","observation_id":"b8c9e397-dedc-4f00-b1d4-33bf16758023","resolution":{"observed_at":"2026-05-11T17:41:08.780958Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2405.13934","last_updated":"2024-09-22T03:47:19Z","snapshot_observed_at":"2026-08-01T15:39:52.519512Z","submitted_at":"2024-05-22T19:06:39Z","title":"Text-Free Multi-domain Graph Pre-training: Toward Graph Foundation Models","version":4},"cited_work":{"arxiv_id":"2405.13934","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2405.13934","snapshot_observed_at":"2026-07-02T11:56:55.655532Z","title":"Hgprompt: Bridg- ing homogeneous and heterogeneous graphs for few-shot prompt learning","venue":null,"work_id":"7ab27799-85a6-4150-8e45-48e80c29ae42","year":2024},"citing_paper":{"arxiv_id":"2605.12061","last_updated":"2026-05-12T12:47:43Z","snapshot_observed_at":"2026-08-06T07:22:02.201477Z","submitted_at":"2026-05-12T12:47:43Z","title":"SAGE: A Self-Evolving Agentic Graph-Memory Engine for Structure-Aware Associative Memory","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-05-13T04:45:34.957298Z"},"links":{"cited_paper":"/paper/2405.13934","citing_paper":"/paper/2605.12061"},"observation_digest":"sha256:e341c4f1bf72063a73fa92dd23479c8b851a18ecd65ead75f17a781fd6e2d6e8","observation_id":"ed63c49f-aea0-4bd9-9dab-91d0acad6d5d","resolution":{"observed_at":"2026-05-13T04:52:17.388697Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2405.13934","last_updated":"2024-09-22T03:47:19Z","snapshot_observed_at":"2026-08-01T15:39:52.519512Z","submitted_at":"2024-05-22T19:06:39Z","title":"Text-Free Multi-domain Graph Pre-training: Toward Graph Foundation Models","version":4},"cited_work":{"arxiv_id":"2405.13934","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2405.13934","snapshot_observed_at":"2026-07-02T11:56:55.655532Z","title":"Hgprompt: Bridg- ing homogeneous and heterogeneous graphs for few-shot prompt learning","venue":null,"work_id":"7ab27799-85a6-4150-8e45-48e80c29ae42","year":2024},"citing_paper":{"arxiv_id":"2605.13540","last_updated":"2026-05-13T13:50:03Z","snapshot_observed_at":"2026-08-08T05:17:47.121303Z","submitted_at":"2026-05-13T13:50:03Z","title":"Decoupled and Divergence-Conditioned Prompt for Multi-domain Dynamic Graph Foundation Models","version":1},"reference_index":90,"source":"pdf_text","source_observed_at":"2026-05-14T20:22:43.876230Z"},"links":{"cited_paper":"/paper/2405.13934","citing_paper":"/paper/2605.13540"},"observation_digest":"sha256:8acdf83bad914f8833c97b40142760f98c75463c3f707751cb8639b7f79573f4","observation_id":"a78616ed-2d9d-4787-a150-7ee487f90bcb","resolution":{"observed_at":"2026-05-14T20:22:54.399341Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2405.13934","last_updated":"2024-09-22T03:47:19Z","snapshot_observed_at":"2026-08-01T15:39:52.519512Z","submitted_at":"2024-05-22T19:06:39Z","title":"Text-Free Multi-domain Graph Pre-training: Toward Graph Foundation Models","version":4},"cited_work":{"arxiv_id":"2405.13934","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2405.13934","snapshot_observed_at":"2026-07-02T11:56:55.655532Z","title":"Hgprompt: Bridg- ing homogeneous and heterogeneous graphs for few-shot prompt learning","venue":null,"work_id":"7ab27799-85a6-4150-8e45-48e80c29ae42","year":2024},"citing_paper":{"arxiv_id":"2606.06397","last_updated":"2026-06-05T07:21:56Z","snapshot_observed_at":"2026-08-03T10:37:17.448486Z","submitted_at":"2026-06-04T17:05:36Z","title":"The Post-GCN Decade Revisited: Curvature-Stratified Evaluation of Relational Learning","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-06-28T02:40:03.713695Z"},"links":{"cited_paper":"/paper/2405.13934","citing_paper":"/paper/2606.06397"},"observation_digest":"sha256:8e90294aa287e9156245cd2f6c9e51b94c7dca5b0e7f921573c817e3ac81bd0e","observation_id":"f4b00e03-4595-48a6-a807-c865b89d431a","resolution":{"observed_at":"2026-07-02T11:56:55.656953Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2405.13934","last_updated":"2024-09-22T03:47:19Z","snapshot_observed_at":"2026-08-01T15:39:52.519512Z","submitted_at":"2024-05-22T19:06:39Z","title":"Text-Free Multi-domain Graph Pre-training: Toward Graph Foundation Models","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.13934","snapshot_observed_at":"2026-08-01T00:53:53.557621Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.26023","last_updated":"2026-07-28T17:35:26Z","snapshot_observed_at":"2026-08-03T00:12:08.636145Z","submitted_at":"2026-07-28T17:35:26Z","title":"CHARM: A Multimodal Graph Foundation Model with Hierarchical Context Modeling for Zero-Shot Transfer","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-01T00:53:53.557621Z"},"links":{"cited_paper":"/paper/2405.13934","citing_paper":"/paper/2607.26023"},"observation_digest":"sha256:e17796c572c6353d88c5493dd7980bcaaee3db2eb525f1e2130eadae59d3c1e9","observation_id":"755930fc-b15d-47a3-8da6-db92e80532c3","resolution":{"observed_at":"2026-08-01T00:53:53.557621Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.13934","last_updated":"2024-09-22T03:47:19Z","snapshot_observed_at":"2026-08-01T15:39:52.519512Z","submitted_at":"2024-05-22T19:06:39Z","title":"Text-Free Multi-domain Graph Pre-training: Toward Graph Foundation Models","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.13934","snapshot_observed_at":"2026-07-31T21:59:23.119496Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.27966","last_updated":"2026-07-30T10:13:59Z","snapshot_observed_at":"2026-08-07T08:02:19.717928Z","submitted_at":"2026-07-30T10:13:59Z","title":"What Makes Graph Unified? Principles and Generative Sliding-Window Transformer for Graph Foundation Models","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-07-31T21:59:23.119496Z"},"links":{"cited_paper":"/paper/2405.13934","citing_paper":"/paper/2607.27966"},"observation_digest":"sha256:bfaaf1e84b16c31ebcd61d0bd08194b2f0c1d42930df79eb5f4e4e5533298998","observation_id":"a241f6f4-925e-4511-8edd-8be6339c5d37","resolution":{"observed_at":"2026-07-31T21:59:23.119496Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.13934","last_updated":"2024-09-22T03:47:19Z","snapshot_observed_at":"2026-08-01T15:39:52.519512Z","submitted_at":"2024-05-22T19:06:39Z","title":"Text-Free Multi-domain Graph Pre-training: Toward Graph Foundation Models","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.13934","snapshot_observed_at":"2026-08-03T16:12:21.853589Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.28980","last_updated":"2026-07-31T03:12:09Z","snapshot_observed_at":"2026-08-06T17:07:13.845056Z","submitted_at":"2026-07-31T03:12:09Z","title":"Beyond Feature and Structure Alignment: Learning Transferable Propagation Knowledge for Graph Foundation Models","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-03T16:12:21.853589Z"},"links":{"cited_paper":"/paper/2405.13934","citing_paper":"/paper/2607.28980"},"observation_digest":"sha256:bcc1633f4e3dbd1e77029270193856def80834a795b11508afefbae3e572cdab","observation_id":"6967f1c8-d7a1-45c2-b754-0427d6d8ea89","resolution":{"observed_at":"2026-08-03T16:12:21.853589Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.13934","last_updated":"2024-09-22T03:47:19Z","snapshot_observed_at":"2026-08-01T15:39:52.519512Z","submitted_at":"2024-05-22T19:06:39Z","title":"Text-Free Multi-domain Graph Pre-training: Toward Graph Foundation Models","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.13934","snapshot_observed_at":"2026-08-07T19:06:22.847595Z","title":"Yu, X.; Zhou, C.; Kuai, Z.; Zhang, X.; and Fang, Y","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.06031","last_updated":"2026-08-06T13:37:52Z","snapshot_observed_at":"2026-08-08T11:15:33.279604Z","submitted_at":"2026-08-06T13:37:52Z","title":"Dynamic Graph Prompting via Topology-Routed Mixed-Curvature Experts","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T19:06:22.847595Z"},"links":{"cited_paper":"/paper/2405.13934","citing_paper":"/paper/2608.06031"},"observation_digest":"sha256:3b492a76c3883013034a599d285429e7e897b819e0d2f5842539980e63b55d4d","observation_id":"f5bdcad5-025f-4b00-87ba-62d8d5801e62","resolution":{"observed_at":"2026-08-07T19:06:22.847595Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2405.13934/citation-record","integrity":"/paper/2405.13934/integrity","json":"/paper/2405.13934/citation-record.json","paper":"/paper/2405.13934"},"outbound":[],"paper":{"arxiv_id":"2405.13934","last_updated":"2024-09-22T03:47:19Z","latest_version":4,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-01T15:39:52.519512Z","submitted_at":"2024-05-22T19:06:39Z","title":"Text-Free Multi-domain Graph Pre-training: Toward Graph Foundation Models"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 12 inbound Pith citation observations for arXiv:2405.13934."}