{"as_of":"2026-08-08T01:05:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:0100d8e47ef92ad30bdc4252caffbdbe9e970d956a0543910c2306c37bd4eaeb","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":11,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":11,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+00:00","state":"measured"},{"denominator":11,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":11,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T05:44:53.377716Z","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-03T11:08:03.190498Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2401.15569","last_updated":"2024-07-24T08:56:11Z","snapshot_observed_at":"2026-07-06T17:21:26.047673Z","submitted_at":"2024-01-28T05:12:09Z","title":"Efficient Tuning and Inference for Large Language Models on Textual Graphs","version":2},"cited_work":{"arxiv_id":"2401.15569","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2401.15569","snapshot_observed_at":"2026-07-03T11:08:03.190498Z","title":"10 Rethinking Graph Structure Learning in the Era of LLMs A","venue":null,"work_id":"37552798-61b4-40de-ba94-9564c73540a4","year":2024},"citing_paper":{"arxiv_id":"2504.02343","last_updated":"2026-05-11T09:16:48Z","snapshot_observed_at":"2026-08-02T20:27:51.058597Z","submitted_at":"2025-04-03T07:24:18Z","title":"Toward General and Robust LLM-enhanced Text-attributed Graph Learning","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-05-22T21:26:35.707533Z"},"links":{"cited_paper":"/paper/2401.15569","citing_paper":"/paper/2504.02343"},"observation_digest":"sha256:c018b0c7517a246fb45edfdc11000b878c1af34507fe4830bdd13d8ee28bc650","observation_id":"ce160746-7844-4264-940a-3084b93a8321","resolution":{"observed_at":"2026-05-22T21:27:08.313722Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2401.15569","last_updated":"2024-07-24T08:56:11Z","snapshot_observed_at":"2026-07-06T17:21:26.047673Z","submitted_at":"2024-01-28T05:12:09Z","title":"Efficient Tuning and Inference for Large Language Models on Textual Graphs","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.15569","snapshot_observed_at":"2026-08-07T05:44:53.377716Z","title":"Efficient tuning and inference for large language models on textual graphs","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.07168","last_updated":"2025-06-08T14:34:29Z","snapshot_observed_at":"2026-08-07T22:51:47.659500Z","submitted_at":"2025-06-08T14:34:29Z","title":"Efficient Text-Attributed Graph Learning through Selective Annotation and Graph Alignment","version":1},"reference_index":89,"source":"pdf_text","source_observed_at":"2026-08-07T05:44:53.377716Z"},"links":{"cited_paper":"/paper/2401.15569","citing_paper":"/paper/2506.07168"},"observation_digest":"sha256:f1942564776192d4ce132e4372be5eac7bd07871cea55530e82236e288a01638","observation_id":"7cc3575c-96c3-4198-8cdc-769b4bca6e7e","resolution":{"observed_at":"2026-08-07T05:44:53.377716Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2401.15569","last_updated":"2024-07-24T08:56:11Z","snapshot_observed_at":"2026-07-06T17:21:26.047673Z","submitted_at":"2024-01-28T05:12:09Z","title":"Efficient Tuning and Inference for Large Language Models on Textual Graphs","version":2},"cited_work":{"arxiv_id":"2401.15569","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2401.15569","snapshot_observed_at":"2026-07-03T11:08:03.190498Z","title":"10 Rethinking Graph Structure Learning in the Era of LLMs A","venue":null,"work_id":"37552798-61b4-40de-ba94-9564c73540a4","year":2024},"citing_paper":{"arxiv_id":"2510.08952","last_updated":"2026-05-05T05:35:19Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-10-10T02:59:19Z","title":"When LLM Agents Meet Graph Optimization: An Automated Data Quality Improvement Approach","version":4},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-05-18T08:45:51.992431Z"},"links":{"cited_paper":"/paper/2401.15569","citing_paper":"/paper/2510.08952"},"observation_digest":"sha256:d3751372e786b3ad7dc49ace2896fe6874f19898132ffc46920e2f9674743943","observation_id":"bda9e114-cf5e-421f-9183-a42ba690fe6d","resolution":{"observed_at":"2026-05-18T08:46:07.729270Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2401.15569","last_updated":"2024-07-24T08:56:11Z","snapshot_observed_at":"2026-07-06T17:21:26.047673Z","submitted_at":"2024-01-28T05:12:09Z","title":"Efficient Tuning and Inference for Large Language Models on Textual Graphs","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.15569","snapshot_observed_at":"2026-08-03T00:07:44.908080Z","title":"algorithm","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2602.11641","last_updated":"2026-05-31T02:32:04Z","snapshot_observed_at":"2026-08-04T07:46:12.428271Z","submitted_at":"2026-02-12T06:53:35Z","title":"Both Topology and Text Matter: Revisiting LLM-guided Out-of-Distribution Detection on Text-attributed Graphs","version":2},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-03T00:07:44.908080Z"},"links":{"cited_paper":"/paper/2401.15569","citing_paper":"/paper/2602.11641"},"observation_digest":"sha256:03689bce9a00498aa7418e8e74bc1722e3844741bc2d21f35cbb06c4402681aa","observation_id":"6baeb5a8-45cb-401d-a15d-4b2b46ac7ee2","resolution":{"observed_at":"2026-08-03T00:07:44.908080Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2401.15569","last_updated":"2024-07-24T08:56:11Z","snapshot_observed_at":"2026-07-06T17:21:26.047673Z","submitted_at":"2024-01-28T05:12:09Z","title":"Efficient Tuning and Inference for Large Language Models on Textual Graphs","version":2},"cited_work":{"arxiv_id":"2401.15569","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2401.15569","snapshot_observed_at":"2026-07-03T11:08:03.190498Z","title":"10 Rethinking Graph Structure Learning in the Era of LLMs A","venue":null,"work_id":"37552798-61b4-40de-ba94-9564c73540a4","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":65,"source":"arxiv_source","source_observed_at":"2026-05-13T04:45:34.957298Z"},"links":{"cited_paper":"/paper/2401.15569","citing_paper":"/paper/2605.12061"},"observation_digest":"sha256:e6279a2a4ffb874585d6c45d59937ed9624292bb7c8b76cd8d5ea121c5899540","observation_id":"e4c41c77-a037-4e57-97ad-61b742c28116","resolution":{"observed_at":"2026-05-13T04:57:17.734168Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2401.15569","last_updated":"2024-07-24T08:56:11Z","snapshot_observed_at":"2026-07-06T17:21:26.047673Z","submitted_at":"2024-01-28T05:12:09Z","title":"Efficient Tuning and Inference for Large Language Models on Textual Graphs","version":2},"cited_work":{"arxiv_id":"2401.15569","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2401.15569","snapshot_observed_at":"2026-07-03T11:08:03.190498Z","title":"10 Rethinking Graph Structure Learning in the Era of LLMs A","venue":null,"work_id":"37552798-61b4-40de-ba94-9564c73540a4","year":2024},"citing_paper":{"arxiv_id":"2606.11898","last_updated":"2026-06-11T03:22:55Z","snapshot_observed_at":"2026-08-07T05:39:04.404942Z","submitted_at":"2026-06-10T10:25:59Z","title":"GraspLLM: Towards Zero-Shot Generalization on Text-Attributed Graphs with LLMs","version":2},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-06-27T09:41:14.904868Z"},"links":{"cited_paper":"/paper/2401.15569","citing_paper":"/paper/2606.11898"},"observation_digest":"sha256:b7e35f0ab23a5cae61be3684fb9fc064761f8c818d91d5ea41d852d2b93d4474","observation_id":"577a9452-7bc4-40c0-9f6a-416635b1a9fe","resolution":{"observed_at":"2026-07-03T11:08:03.192006Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2401.15569","last_updated":"2024-07-24T08:56:11Z","snapshot_observed_at":"2026-07-06T17:21:26.047673Z","submitted_at":"2024-01-28T05:12:09Z","title":"Efficient Tuning and Inference for Large Language Models on Textual Graphs","version":2},"cited_work":{"arxiv_id":"2401.15569","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2401.15569","snapshot_observed_at":"2026-07-03T11:08:03.190498Z","title":"10 Rethinking Graph Structure Learning in the Era of LLMs A","venue":null,"work_id":"37552798-61b4-40de-ba94-9564c73540a4","year":2024},"citing_paper":{"arxiv_id":"2606.30291","last_updated":"2026-06-29T13:35:05Z","snapshot_observed_at":"2026-08-03T01:16:02.602622Z","submitted_at":"2026-06-29T13:35:05Z","title":"PromptGNN-sim: Deep Fusion and Alignment of GNN and LLMs for Text-Attributed Graph Learning","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-06-30T06:06:46.108334Z"},"links":{"cited_paper":"/paper/2401.15569","citing_paper":"/paper/2606.30291"},"observation_digest":"sha256:c0299ac5e52d469b3308e235dff652858ba85b285139c5ea00583b7410c7bf6a","observation_id":"9d41844d-f4bb-479c-a24a-b4d3ac0b535b","resolution":{"observed_at":"2026-06-30T08:24:26.841057Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2401.15569","last_updated":"2024-07-24T08:56:11Z","snapshot_observed_at":"2026-07-06T17:21:26.047673Z","submitted_at":"2024-01-28T05:12:09Z","title":"Efficient Tuning and Inference for Large Language Models on Textual Graphs","version":2},"cited_work":{"arxiv_id":"2401.15569","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2401.15569","snapshot_observed_at":"2026-07-03T11:08:03.190498Z","title":"10 Rethinking Graph Structure Learning in the Era of LLMs A","venue":null,"work_id":"37552798-61b4-40de-ba94-9564c73540a4","year":2024},"citing_paper":{"arxiv_id":"2606.32016","last_updated":"2026-06-30T17:47:39Z","snapshot_observed_at":"2026-07-07T00:05:37.068846Z","submitted_at":"2026-06-30T17:47:39Z","title":"FedLAB: Traceable Semantic Codebooks for Federated Multimodal Graph Foundation Learning","version":1},"reference_index":177,"source":"arxiv_source","source_observed_at":"2026-07-01T06:10:26.634933Z"},"links":{"cited_paper":"/paper/2401.15569","citing_paper":"/paper/2606.32016"},"observation_digest":"sha256:6c7d89d0c5051ab23d370996bee9f1deb4aa5b522d1515c0ebc2b9177ed1c8f6","observation_id":"4d4ac506-f08d-4e7d-8bca-03394f083095","resolution":{"observed_at":"2026-07-01T09:45:40.646819Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2401.15569","last_updated":"2024-07-24T08:56:11Z","snapshot_observed_at":"2026-07-06T17:21:26.047673Z","submitted_at":"2024-01-28T05:12:09Z","title":"Efficient Tuning and Inference for Large Language Models on Textual Graphs","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.15569","snapshot_observed_at":"2026-07-14T13:51:14.141383Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.10159","last_updated":"2026-07-11T06:47:26Z","snapshot_observed_at":"2026-08-01T19:51:36.190580Z","submitted_at":"2026-07-11T06:47:26Z","title":"UNIT: Unleash Large Language Models Potential for Graph Continual Learning","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-07-14T13:51:14.141383Z"},"links":{"cited_paper":"/paper/2401.15569","citing_paper":"/paper/2607.10159"},"observation_digest":"sha256:733656145a15228b38746def2375d4c4d1097a2ae10c54d8b8f7278d1fa44d98","observation_id":"1e2fa54c-aad2-4ac6-8f34-0103af77b031","resolution":{"observed_at":"2026-07-14T13:51:14.141383Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2401.15569","last_updated":"2024-07-24T08:56:11Z","snapshot_observed_at":"2026-07-06T17:21:26.047673Z","submitted_at":"2024-01-28T05:12:09Z","title":"Efficient Tuning and Inference for Large Language Models on Textual Graphs","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.15569","snapshot_observed_at":"2026-08-01T15:05:33.357979Z","title":"Proceedings of the 33rd International Joint Conference on Artificial Intelligence (IJCAI) , 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-07T05:12:36.648279Z","submitted_at":"2026-07-20T23:03:26Z","title":"Attacking Graph Foundation Models Through Their Shared Representation","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-01T15:05:33.357979Z"},"links":{"cited_paper":"/paper/2401.15569","citing_paper":"/paper/2607.18567"},"observation_digest":"sha256:5f21c722f0ad5bb70437e0ac4f4c3674c3487c7cae6d38db26c00b8835033503","observation_id":"b2035a67-d696-432d-9478-61420cd65b72","resolution":{"observed_at":"2026-08-01T15:05:33.357979Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2401.15569","last_updated":"2024-07-24T08:56:11Z","snapshot_observed_at":"2026-07-06T17:21:26.047673Z","submitted_at":"2024-01-28T05:12:09Z","title":"Efficient Tuning and Inference for Large Language Models on Textual Graphs","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.15569","snapshot_observed_at":"2026-08-01T13:29:54.376422Z","title":"Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.19108","last_updated":"2026-07-21T13:50:24Z","snapshot_observed_at":"2026-08-08T00:54:55.183688Z","submitted_at":"2026-07-21T13:50:24Z","title":"OpenRTAG: A Comprehensive Benchmark for Robust Text-Attributed Graph Learning under Data Quality Degradation","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-01T13:29:54.376422Z"},"links":{"cited_paper":"/paper/2401.15569","citing_paper":"/paper/2607.19108"},"observation_digest":"sha256:9fba2ae01c8ac06143abe366e91dc368dc1f8f2ddc0fbabe408ab4cd6a927702","observation_id":"1a89a488-396c-4adf-b019-6444d0844813","resolution":{"observed_at":"2026-08-01T13:29:54.376422Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2401.15569/citation-record","integrity":"/paper/2401.15569/integrity","json":"/paper/2401.15569/citation-record.json","paper":"/paper/2401.15569"},"outbound":[],"paper":{"arxiv_id":"2401.15569","last_updated":"2024-07-24T08:56:11Z","latest_version":2,"primary_category":"cs.CL","snapshot_observed_at":"2026-07-06T17:21:26.047673Z","submitted_at":"2024-01-28T05:12:09Z","title":"Efficient Tuning and Inference for Large Language Models on Textual 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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 11 inbound Pith citation observations for arXiv:2401.15569."}