{"as_of":"2026-08-10T23:11:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a8c849f41169692996384c9821b2746688291d3d0ddba63f9d472a8c24d427f8","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":9,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":9,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":9,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":9,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T22:38:27.933265Z","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-05-22T19:11:58.034874Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"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-10T22:38:27.933265Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.01124","last_updated":"2025-01-02T07:45:34Z","snapshot_observed_at":"2026-08-10T22:32:31.421625Z","submitted_at":"2025-01-02T07:45:34Z","title":"Graph2text or Graph2token: A Perspective of Large Language Models for Graph Learning","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-10T22:38:27.933265Z"},"links":{"cited_paper":"/paper/2402.13630","citing_paper":"/paper/2501.01124"},"observation_digest":"sha256:fbf7530e5304d0c61861c5aa496d579c30b26751c56f4956168a42bb74bc2d5b","observation_id":"832c3a0a-43ca-4a90-81dd-1818a70a208a","resolution":{"observed_at":"2026-08-10T22:38:27.933265Z","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-10T14:01:38.348716Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.15755","last_updated":"2025-01-27T03:50:30Z","snapshot_observed_at":"2026-08-10T13:55:53.163531Z","submitted_at":"2025-01-27T03:50:30Z","title":"GraphICL: Unlocking Graph Learning Potential in LLMs through Structured Prompt Design","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-10T14:01:38.348716Z"},"links":{"cited_paper":"/paper/2402.13630","citing_paper":"/paper/2501.15755"},"observation_digest":"sha256:b44db2d8129cc92a0ab20b441542509ed354b1d72e50fb15238a640e04e08f7a","observation_id":"6ad8b10b-2b0e-4cc8-8d79-fe64f1e1c03c","resolution":{"observed_at":"2026-08-10T14:01:38.348716Z","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-09T17:44:03.830499Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.00806","last_updated":"2025-04-25T05:12:51Z","snapshot_observed_at":"2026-08-10T16:23:39.562715Z","submitted_at":"2025-02-02T14:04:53Z","title":"UniGraph2: Learning a Unified Embedding Space to Bind Multimodal Graphs","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-09T17:44:03.830499Z"},"links":{"cited_paper":"/paper/2402.13630","citing_paper":"/paper/2502.00806"},"observation_digest":"sha256:dfecebd9184f69ec04a5f41bb5828709129e1261b6b56d1cac10cde15e87f4c1","observation_id":"3570c841-75ee-4ff6-a98b-b1f350c7f4ab","resolution":{"observed_at":"2026-08-09T17:44:03.830499Z","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":"2402.13630","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2402.13630","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Unigraph: Learning a unified cross-domain foundation model for text-attributed graphs","venue":null,"work_id":"0570d43c-0ffd-409d-b39b-ae6b69606b1b","year":2024},"citing_paper":{"arxiv_id":"2504.20472","last_updated":"2026-04-09T06:57:42Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-04-29T07:13:53Z","title":"Robustness via Referencing: Defending against Prompt Injection Attacks by Referencing the Executed Instruction","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-05-22T19:10:55.009810Z"},"links":{"cited_paper":"/paper/2402.13630","citing_paper":"/paper/2504.20472"},"observation_digest":"sha256:656bdfd4c7868eb64ed1a80f9a5f16ecd24117f575e3d99753c26ff2d2097226","observation_id":"a2f74db5-f075-46f4-94f2-c7dc9ba91cc5","resolution":{"observed_at":"2026-05-22T19:11:58.036641Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"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-07T11:26:41.140015Z","title":"and Hooi, B","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.02568","last_updated":"2026-06-10T06:51:15Z","snapshot_observed_at":"2026-08-09T23:14:06.665519Z","submitted_at":"2025-06-03T07:52:00Z","title":"MLaGA: Multimodal Large Language and Graph Assistant","version":2},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-07T11:26:41.140015Z"},"links":{"cited_paper":"/paper/2402.13630","citing_paper":"/paper/2506.02568"},"observation_digest":"sha256:191f60514144a6621cb7c2755570bee20abe6a7639ab5c7ae83f075f67a669af","observation_id":"9280f8bb-4721-4da4-9834-70991746759a","resolution":{"observed_at":"2026-08-07T11:26:41.140015Z","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-07T05:21:34.696192Z","title":"Unigraph: Learning a unified cross-domain foundation model for text-attributed graphs.arXiv preprint arXiv:2402.13630, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.08298","last_updated":"2025-06-15T02:48:38Z","snapshot_observed_at":"2026-08-10T04:47:29.938584Z","submitted_at":"2025-06-10T00:03:56Z","title":"H$^2$GFM: Towards unifying Homogeneity and Heterogeneity on Text-Attributed Graphs","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T05:21:34.696192Z"},"links":{"cited_paper":"/paper/2402.13630","citing_paper":"/paper/2506.08298"},"observation_digest":"sha256:76ed382816bd0fec379c7e156eded66cc99af28889ec6ca769ac070688eb9135","observation_id":"7d041a5d-a660-4683-9108-e9ecf7d4d6eb","resolution":{"observed_at":"2026-08-07T05:21:34.696192Z","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-03T23:37:55.544673Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2511.07457","last_updated":"2026-07-20T02:41:15Z","snapshot_observed_at":"2026-08-06T01:49:16.929228Z","submitted_at":"2025-11-06T21:56:58Z","title":"GRIP: In-Parameter Graph Reasoning through Fine-Tuning Large Language Models","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-03T23:37:55.544673Z"},"links":{"cited_paper":"/paper/2402.13630","citing_paper":"/paper/2511.07457"},"observation_digest":"sha256:39a2d0cbeeea212bb16c7934752d513726226c604c4ad90068b466560658a748","observation_id":"da00aa21-262f-426c-9057-6b950f8e21c8","resolution":{"observed_at":"2026-08-03T23:37:55.544673Z","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":"2402.13630","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2402.13630","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Unigraph: Learning a unified cross-domain foundation model for text-attributed graphs","venue":null,"work_id":"0570d43c-0ffd-409d-b39b-ae6b69606b1b","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":7,"source":"pdf_text","source_observed_at":"2026-05-08T17:18:21.259797Z"},"links":{"cited_paper":"/paper/2402.13630","citing_paper":"/paper/2605.04834"},"observation_digest":"sha256:47a9b11568319ff879c410c811a2bc2c1e7656721c558a3ac346071e403b7663","observation_id":"6fcc305a-6a45-4eea-b4a1-dbcdb38d8e7f","resolution":{"observed_at":"2026-05-11T17:41:08.771515Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"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-01T15:05:32.307802Z","title":"Proceedings of the 31st ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.18567","last_updated":"2026-07-20T23:03:26Z","snapshot_observed_at":"2026-08-08T16:17:43.321230Z","submitted_at":"2026-07-20T23:03:26Z","title":"Attacking Graph Foundation Models Through Their Shared Representation","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-01T15:05:32.307802Z"},"links":{"cited_paper":"/paper/2402.13630","citing_paper":"/paper/2607.18567"},"observation_digest":"sha256:f0b823e44f59506be07e7dfd921b0fc4b5b4b5bcddf7a72056f3c30d97cfd109","observation_id":"f490be06-2b68-408c-8d61-ddfed1d756f0","resolution":{"observed_at":"2026-08-01T15:05:32.307802Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2402.13630/citation-record","integrity":"/paper/2402.13630/integrity","json":"/paper/2402.13630/citation-record.json","paper":"/paper/2402.13630"},"outbound":[],"paper":{"arxiv_id":"2402.13630","last_updated":"2025-01-20T15:12:02Z","latest_version":3,"primary_category":"cs.LG","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"},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 9 inbound Pith citation observations for arXiv:2402.13630."}