{"as_of":"2026-08-19T09:32:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:14da1580157487612a51067ad80d934fbd371b422f776f3361fefc3cc6ae0954","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":3,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":3,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-19T06:32:44.657259+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T14:01:38.382837Z","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-06-30T08:24:26.838548Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2402.03720","last_updated":"2024-02-06T05:29:05Z","snapshot_observed_at":"2026-08-16T14:21:08.685255Z","submitted_at":"2024-02-06T05:29:05Z","title":"Similarity-based Neighbor Selection for Graph LLMs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.03720","snapshot_observed_at":"2026-08-10T14:01:38.382837Z","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-19T04:32:08.597966Z","submitted_at":"2025-01-27T03:50:30Z","title":"GraphICL: Unlocking Graph Learning Potential in LLMs through Structured Prompt Design","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-10T14:01:38.382837Z"},"links":{"cited_paper":"/paper/2402.03720","citing_paper":"/paper/2501.15755"},"observation_digest":"sha256:c0190571703beaa79512ab84d58358ced54f7fc752811f8a2abfed6ccf828c7c","observation_id":"1a07c312-cd7e-4fea-bf31-45bc21bc3b10","resolution":{"observed_at":"2026-08-10T14:01:38.382837Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.03720","last_updated":"2024-02-06T05:29:05Z","snapshot_observed_at":"2026-08-16T14:21:08.685255Z","submitted_at":"2024-02-06T05:29:05Z","title":"Similarity-based Neighbor Selection for Graph LLMs","version":1},"cited_work":{"arxiv_id":"2402.03720","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2402.03720","snapshot_observed_at":"2026-06-30T08:24:26.838548Z","title":"Similarity-based neighbor selection for graph llms.arXiv preprint arXiv:2402.03720, 2024","venue":null,"work_id":"3310017a-097e-4c51-b01d-d6064eb0250f","year":2024},"citing_paper":{"arxiv_id":"2606.30291","last_updated":"2026-06-29T13:35:05Z","snapshot_observed_at":"2026-08-13T04:13:29.127471Z","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":16,"source":"pdf_text","source_observed_at":"2026-06-30T06:06:46.108334Z"},"links":{"cited_paper":"/paper/2402.03720","citing_paper":"/paper/2606.30291"},"observation_digest":"sha256:4bf2a1d62beb0c8d36b8f42f40b1c4e2e9e6d8cbd92cf16068e1ff79c70b2c4d","observation_id":"bfb329a7-7816-4b44-be28-224e24ff583e","resolution":{"observed_at":"2026-06-30T08:24:26.840079Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.03720","last_updated":"2024-02-06T05:29:05Z","snapshot_observed_at":"2026-08-16T14:21:08.685255Z","submitted_at":"2024-02-06T05:29:05Z","title":"Similarity-based Neighbor Selection for Graph LLMs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.03720","snapshot_observed_at":"2026-08-05T00:44:14.168470Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.00542","last_updated":"2026-08-01T08:56:26Z","snapshot_observed_at":"2026-08-18T09:25:13.828837Z","submitted_at":"2026-08-01T08:56:26Z","title":"Agentic Graph Token Reasoning","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-05T00:44:14.168470Z"},"links":{"cited_paper":"/paper/2402.03720","citing_paper":"/paper/2608.00542"},"observation_digest":"sha256:fada8aa59ad6db4ff5baca0e2d5a28fbdaf63f259f0baf0da6395ac3162a9f8c","observation_id":"94658a7f-60c5-493e-8f72-e14b55196dae","resolution":{"observed_at":"2026-08-05T00:44:14.168470Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2402.03720/citation-record","integrity":"/paper/2402.03720/integrity","json":"/paper/2402.03720/citation-record.json","paper":"/paper/2402.03720"},"outbound":[],"paper":{"arxiv_id":"2402.03720","last_updated":"2024-02-06T05:29:05Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-16T14:21:08.685255Z","submitted_at":"2024-02-06T05:29:05Z","title":"Similarity-based Neighbor Selection for Graph LLMs"},"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-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"thesis":"As of 19 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2402.03720."}