{"as_of":"2026-08-08T22:02:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e247bc00e4fec49a58e5113b47f261cb695649db7cfe1c7a88d6d0d8e09e38f6","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":6,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":6,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":6,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":6,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T06:04:14.191133Z","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-22T10:31:25.449903Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2410.14961","last_updated":"2024-10-19T03:27:19Z","snapshot_observed_at":"2026-07-06T19:36:19.567469Z","submitted_at":"2024-10-19T03:27:19Z","title":"LangGFM: A Large Language Model Alone Can be a Powerful Graph Foundation Model","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.14961","snapshot_observed_at":"2026-08-07T06:04:14.191133Z","title":"Langgfm: A large language model alone can be a powerful graph foundation model","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.06157","last_updated":"2025-07-30T03:58:06Z","snapshot_observed_at":"2026-08-07T05:57:11.148750Z","submitted_at":"2025-06-06T15:21:24Z","title":"Masked Language Models are Good Heterogeneous Graph Generalizers","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T06:04:14.191133Z"},"links":{"cited_paper":"/paper/2410.14961","citing_paper":"/paper/2506.06157"},"observation_digest":"sha256:dad1d18fed0fa91896db61ce67677be05eba3e8bbe9c46c844ca2f3f415ae2f9","observation_id":"b3428b61-e21d-4168-a2a4-ebcf997720f1","resolution":{"observed_at":"2026-08-07T06:04:14.191133Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.14961","last_updated":"2024-10-19T03:27:19Z","snapshot_observed_at":"2026-07-06T19:36:19.567469Z","submitted_at":"2024-10-19T03:27:19Z","title":"LangGFM: A Large Language Model Alone Can be a Powerful Graph Foundation Model","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.14961","snapshot_observed_at":"2026-08-03T23:37:56.282671Z","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":24,"source":"pdf_text","source_observed_at":"2026-08-03T23:37:56.282671Z"},"links":{"cited_paper":"/paper/2410.14961","citing_paper":"/paper/2511.07457"},"observation_digest":"sha256:895efb9d89d4dc702e965fe5bd250d73ba691a31a9452d4bcca233a696d80302","observation_id":"63b34b31-3263-46ca-b621-ea1a5bae1a01","resolution":{"observed_at":"2026-08-03T23:37:56.282671Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.14961","last_updated":"2024-10-19T03:27:19Z","snapshot_observed_at":"2026-07-06T19:36:19.567469Z","submitted_at":"2024-10-19T03:27:19Z","title":"LangGFM: A Large Language Model Alone Can be a Powerful Graph Foundation Model","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.14961","snapshot_observed_at":"2026-08-04T06:16:57.656361Z","title":"Liu, H., Feng, J., Kong, L., Liang, N., Tao, D., Chen, Y ., and Zhang, M","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.21369","last_updated":"2026-08-01T12:38:31Z","snapshot_observed_at":"2026-08-06T23:10:55.699930Z","submitted_at":"2026-01-29T07:50:00Z","title":"Rethinking Federated Graph Foundation Models: A Graph-Language Alignment-based Approach","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-04T06:16:57.656361Z"},"links":{"cited_paper":"/paper/2410.14961","citing_paper":"/paper/2601.21369"},"observation_digest":"sha256:57315ab315325ff836286cc7c5bb5980ea544782b358d73d02b2affe1ea1764e","observation_id":"e819b708-56d3-4aa6-a0dc-a7d50480f7a7","resolution":{"observed_at":"2026-08-04T06:16:57.656361Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.14961","last_updated":"2024-10-19T03:27:19Z","snapshot_observed_at":"2026-07-06T19:36:19.567469Z","submitted_at":"2024-10-19T03:27:19Z","title":"LangGFM: A Large Language Model Alone Can be a Powerful Graph Foundation Model","version":1},"cited_work":{"arxiv_id":"2410.14961","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2410.14961","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Langgfm: A large language model alone can be a powerful graph foundation model","venue":null,"work_id":"4ac30756-ae65-4d2f-aa85-342aa02924b5","year":2024},"citing_paper":{"arxiv_id":"2603.01410","last_updated":"2026-04-15T12:49:26Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-03-02T03:25:40Z","title":"GraphScout: Empowering Large Language Models with Intrinsic Exploration Ability for Agentic Graph Reasoning","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-05-15T18:47:06.207176Z"},"links":{"cited_paper":"/paper/2410.14961","citing_paper":"/paper/2603.01410"},"observation_digest":"sha256:e7ab24e5a435038dff26833d3758664253ede5200aeb09a3cc004fdf8a31ffe5","observation_id":"0be46ab9-8dc3-4de4-9734-18a695b68b7c","resolution":{"observed_at":"2026-05-15T18:50:17.001122Z","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":"2410.14961","last_updated":"2024-10-19T03:27:19Z","snapshot_observed_at":"2026-07-06T19:36:19.567469Z","submitted_at":"2024-10-19T03:27:19Z","title":"LangGFM: A Large Language Model Alone Can be a Powerful Graph Foundation Model","version":1},"cited_work":{"arxiv_id":"2410.14961","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2410.14961","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Langgfm: A large language model alone can be a powerful graph foundation model","venue":null,"work_id":"4ac30756-ae65-4d2f-aa85-342aa02924b5","year":2024},"citing_paper":{"arxiv_id":"2603.02938","last_updated":"2026-05-21T07:56:15Z","snapshot_observed_at":"2026-07-06T22:47:41.997192Z","submitted_at":"2026-03-03T12:47:44Z","title":"Beyond One-Size-Fits-All: Adaptive Subgraph Denoising for Zero-Shot Graph Learning with Large Language Models","version":2},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-05-22T10:30:01.910920Z"},"links":{"cited_paper":"/paper/2410.14961","citing_paper":"/paper/2603.02938"},"observation_digest":"sha256:28954bbd9b5f6c6bdd00edc53cefddca9a07a90a1c2efc044834e2aa1aa2555b","observation_id":"442f8bfc-e028-4153-925a-f40172c295f5","resolution":{"observed_at":"2026-05-22T10:31:25.452829Z","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":"2410.14961","last_updated":"2024-10-19T03:27:19Z","snapshot_observed_at":"2026-07-06T19:36:19.567469Z","submitted_at":"2024-10-19T03:27:19Z","title":"LangGFM: A Large Language Model Alone Can be a Powerful Graph Foundation Model","version":1},"cited_work":{"arxiv_id":"2410.14961","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2410.14961","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Langgfm: A large language model alone can be a powerful graph foundation model","venue":null,"work_id":"4ac30756-ae65-4d2f-aa85-342aa02924b5","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":100,"source":"pdf_text","source_observed_at":"2026-05-14T20:22:43.876230Z"},"links":{"cited_paper":"/paper/2410.14961","citing_paper":"/paper/2605.13540"},"observation_digest":"sha256:a998cad21fb2971f27c178ca62154cacb3fe74565dc980d78ed23b05f113f009","observation_id":"fac6e4ab-4c32-4502-98bf-e80e90b2b286","resolution":{"observed_at":"2026-05-14T20:22:54.406637Z","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"}}],"links":{"evidence":"/evidence","html":"/paper/2410.14961/citation-record","integrity":"/paper/2410.14961/integrity","json":"/paper/2410.14961/citation-record.json","paper":"/paper/2410.14961"},"outbound":[],"paper":{"arxiv_id":"2410.14961","last_updated":"2024-10-19T03:27:19Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T19:36:19.567469Z","submitted_at":"2024-10-19T03:27:19Z","title":"LangGFM: A Large Language Model Alone Can be a Powerful Graph Foundation Model"},"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 6 inbound Pith citation observations for arXiv:2410.14961."}