{"as_of":"2026-08-08T08:21:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d5841ffbbfb573657040765dcf94bea53c5408dbc86599f8568a6f19af6596a5","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":7,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":7,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":7,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":7,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-14T13:51:14.141383Z","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.216419Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2502.00829","last_updated":"2025-05-20T12:56:13Z","snapshot_observed_at":"2026-08-07T11:00:01.674236Z","submitted_at":"2025-02-02T15:56:05Z","title":"When Do LLMs Help With Node Classification? A Comprehensive Analysis","version":2},"cited_work":{"arxiv_id":"2502.00829","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.00829","snapshot_observed_at":"2026-07-03T11:08:03.216419Z","title":"URL https://openreview.net/forum?id=L2jRavXRxs","venue":null,"work_id":"618916a2-2275-43bb-b83d-ef704bfb8101","year":2025},"citing_paper":{"arxiv_id":"2511.16767","last_updated":"2026-04-30T21:16:34Z","snapshot_observed_at":"2026-07-06T22:36:30.947164Z","submitted_at":"2025-11-20T19:34:58Z","title":"When Structure Doesn't Help: LLMs Do Not Read Text-Attributed Graphs as Effectively as We Expected","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-17T20:18:14.565936Z"},"links":{"cited_paper":"/paper/2502.00829","citing_paper":"/paper/2511.16767"},"observation_digest":"sha256:6af5c27165a130b8f2b9e5aebd7d306bb3333c8495045542d0ecd55a296ba4e2","observation_id":"c9862f82-4f52-4b79-8e17-fb6c82347f76","resolution":{"observed_at":"2026-05-17T20:20:11.834826Z","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":"2502.00829","last_updated":"2025-05-20T12:56:13Z","snapshot_observed_at":"2026-08-07T11:00:01.674236Z","submitted_at":"2025-02-02T15:56:05Z","title":"When Do LLMs Help With Node Classification? A Comprehensive Analysis","version":2},"cited_work":{"arxiv_id":"2502.00829","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.00829","snapshot_observed_at":"2026-07-03T11:08:03.216419Z","title":"URL https://openreview.net/forum?id=L2jRavXRxs","venue":null,"work_id":"618916a2-2275-43bb-b83d-ef704bfb8101","year":2025},"citing_paper":{"arxiv_id":"2604.17271","last_updated":"2026-04-19T05:58:38Z","snapshot_observed_at":"2026-08-02T15:38:11.259090Z","submitted_at":"2026-04-19T05:58:38Z","title":"HopRank: Self-Supervised LLM Preference-Tuning on Graphs for Few-Shot Node Classification","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-05-10T06:04:24.381169Z"},"links":{"cited_paper":"/paper/2502.00829","citing_paper":"/paper/2604.17271"},"observation_digest":"sha256:fb685f7b110faf5f17ad2a60406d05a938809ec411c86a395c24e454ab51805a","observation_id":"654da98b-3272-41be-8762-2da4c3ffeb20","resolution":{"observed_at":"2026-05-10T06:06:18.705426Z","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":"2502.00829","last_updated":"2025-05-20T12:56:13Z","snapshot_observed_at":"2026-08-07T11:00:01.674236Z","submitted_at":"2025-02-02T15:56:05Z","title":"When Do LLMs Help With Node Classification? A Comprehensive Analysis","version":2},"cited_work":{"arxiv_id":"2502.00829","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.00829","snapshot_observed_at":"2026-07-03T11:08:03.216419Z","title":"URL https://openreview.net/forum?id=L2jRavXRxs","venue":null,"work_id":"618916a2-2275-43bb-b83d-ef704bfb8101","year":2025},"citing_paper":{"arxiv_id":"2606.01873","last_updated":"2026-06-01T08:19:47Z","snapshot_observed_at":"2026-08-01T22:20:59.708763Z","submitted_at":"2026-06-01T08:19:47Z","title":"G2LoRA: Gradient Orthogonal Low-Rank Adaptation Framework for Graph Continual Learning on Text-Attributed Graphs","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-06-28T15:25:05.566939Z"},"links":{"cited_paper":"/paper/2502.00829","citing_paper":"/paper/2606.01873"},"observation_digest":"sha256:fcf0fc45f7522ef084b343e6944209f08af91657a2ec8649ed16a3572589d944","observation_id":"56c0e332-d129-4717-b67d-2eb3d643e89e","resolution":{"observed_at":"2026-07-01T22:26:17.561987Z","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":"2502.00829","last_updated":"2025-05-20T12:56:13Z","snapshot_observed_at":"2026-08-07T11:00:01.674236Z","submitted_at":"2025-02-02T15:56:05Z","title":"When Do LLMs Help With Node Classification? A Comprehensive Analysis","version":2},"cited_work":{"arxiv_id":"2502.00829","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.00829","snapshot_observed_at":"2026-07-03T11:08:03.216419Z","title":"URL https://openreview.net/forum?id=L2jRavXRxs","venue":null,"work_id":"618916a2-2275-43bb-b83d-ef704bfb8101","year":2025},"citing_paper":{"arxiv_id":"2606.11583","last_updated":"2026-06-10T02:15:56Z","snapshot_observed_at":"2026-07-06T23:50:39.386691Z","submitted_at":"2026-06-10T02:15:56Z","title":"Beyond the Golden Teacher: Enhancing Graph Learning through LLM-GNN Co-teaching","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-06-27T10:33:02.954683Z"},"links":{"cited_paper":"/paper/2502.00829","citing_paper":"/paper/2606.11583"},"observation_digest":"sha256:cc4f775447e36f8ae94495d1a741bbbfb0d82377285d24994efa3093fd7aa4a7","observation_id":"bfc5b639-4eb2-4541-a540-7ef8872bd789","resolution":{"observed_at":"2026-07-03T09:07:47.656553Z","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":"2502.00829","last_updated":"2025-05-20T12:56:13Z","snapshot_observed_at":"2026-08-07T11:00:01.674236Z","submitted_at":"2025-02-02T15:56:05Z","title":"When Do LLMs Help With Node Classification? A Comprehensive Analysis","version":2},"cited_work":{"arxiv_id":"2502.00829","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.00829","snapshot_observed_at":"2026-07-03T11:08:03.216419Z","title":"URL https://openreview.net/forum?id=L2jRavXRxs","venue":null,"work_id":"618916a2-2275-43bb-b83d-ef704bfb8101","year":2025},"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":8,"source":"pdf_text","source_observed_at":"2026-06-27T09:41:14.904868Z"},"links":{"cited_paper":"/paper/2502.00829","citing_paper":"/paper/2606.11898"},"observation_digest":"sha256:7f2a6e673160912844eca2729f1c0b7730686adbeed418afe11b776236440b02","observation_id":"465015af-eab2-4007-9e10-b5b61d8c7408","resolution":{"observed_at":"2026-07-03T11:08:03.217877Z","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":"2502.00829","last_updated":"2025-05-20T12:56:13Z","snapshot_observed_at":"2026-08-07T11:00:01.674236Z","submitted_at":"2025-02-02T15:56:05Z","title":"When Do LLMs Help With Node Classification? A Comprehensive Analysis","version":2},"cited_work":{"arxiv_id":"2502.00829","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.00829","snapshot_observed_at":"2026-07-03T11:08:03.216419Z","title":"URL https://openreview.net/forum?id=L2jRavXRxs","venue":null,"work_id":"618916a2-2275-43bb-b83d-ef704bfb8101","year":2025},"citing_paper":{"arxiv_id":"2606.29773","last_updated":"2026-06-29T04:30:45Z","snapshot_observed_at":"2026-07-31T06:33:27.649714Z","submitted_at":"2026-06-29T04:30:45Z","title":"GLIP: Graph and LLM Joint Pretraining for Graph-Level Tasks","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-06-30T07:33:27.135616Z"},"links":{"cited_paper":"/paper/2502.00829","citing_paper":"/paper/2606.29773"},"observation_digest":"sha256:820ac25610858cac957de899066c18f133dcee7d23729ae56c1f4f21a3ae4252","observation_id":"df68b919-dcc1-4c5f-958f-70144d1b881f","resolution":{"observed_at":"2026-06-30T07:34:21.264420Z","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":"2502.00829","last_updated":"2025-05-20T12:56:13Z","snapshot_observed_at":"2026-08-07T11:00:01.674236Z","submitted_at":"2025-02-02T15:56:05Z","title":"When Do LLMs Help With Node Classification? A Comprehensive Analysis","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.00829","snapshot_observed_at":"2026-07-14T13:51:14.141383Z","title":null,"venue":null,"work_id":null,"year":2025},"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":32,"source":"pdf_text","source_observed_at":"2026-07-14T13:51:14.141383Z"},"links":{"cited_paper":"/paper/2502.00829","citing_paper":"/paper/2607.10159"},"observation_digest":"sha256:c7e15a0bcd45145d5e57375e2bdc9de62a7bf511ba0a35488452bc421a16d3f9","observation_id":"438d75a9-db51-4e6d-89d6-35bfc02323e2","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"}}],"links":{"evidence":"/evidence","html":"/paper/2502.00829/citation-record","integrity":"/paper/2502.00829/integrity","json":"/paper/2502.00829/citation-record.json","paper":"/paper/2502.00829"},"outbound":[],"paper":{"arxiv_id":"2502.00829","last_updated":"2025-05-20T12:56:13Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-07T11:00:01.674236Z","submitted_at":"2025-02-02T15:56:05Z","title":"When Do LLMs Help With Node Classification? A Comprehensive Analysis"},"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 7 inbound Pith citation observations for arXiv:2502.00829."}