{"as_of":"2026-08-21T14:18:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:eccd1ce1343b410b42f80e70c72b7cebdb612266bb8b9300eaca7de35b142609","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":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-21T06:32:19.484+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T23:40:51.588945Z","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-12T08:06:26.759029Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2209.15240","last_updated":"2024-04-10T09:04:26Z","snapshot_observed_at":"2026-08-16T16:27:56.933103Z","submitted_at":"2022-09-30T05:19:27Z","title":"Universal Prompt Tuning for Graph Neural Networks","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2209.15240","snapshot_observed_at":"2026-08-15T23:40:51.588945Z","title":"M., Yang, Y ., and Wang, C","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.04121","last_updated":"2025-05-24T07:21:54Z","snapshot_observed_at":"2026-08-21T13:23:25.249348Z","submitted_at":"2025-05-07T04:29:29Z","title":"Vision Graph Prompting via Semantic Low-Rank Decomposition","version":2},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-15T23:40:51.588945Z"},"links":{"cited_paper":"/paper/2209.15240","citing_paper":"/paper/2505.04121"},"observation_digest":"sha256:9f25ea22efaf874f1a3f6f85362f23eaedbda5fd6bb039217c4b61735687bc8c","observation_id":"26e49f25-fa80-46cb-9746-39154f3d3e1c","resolution":{"observed_at":"2026-08-15T23:40:51.588945Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2209.15240","last_updated":"2024-04-10T09:04:26Z","snapshot_observed_at":"2026-08-16T16:27:56.933103Z","submitted_at":"2022-09-30T05:19:27Z","title":"Universal Prompt Tuning for Graph Neural Networks","version":5},"cited_work":{"arxiv_id":"2209.15240","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2209.15240","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2209.15240 (2022)","venue":null,"work_id":"e6435ee2-5bd1-4632-b12b-34af5348b3b9","year":2022},"citing_paper":{"arxiv_id":"2605.08273","last_updated":"2026-05-08T03:45:51Z","snapshot_observed_at":"2026-08-05T12:51:37.154487Z","submitted_at":"2026-05-08T03:45:51Z","title":"Efficient Prompt Learning for Traffic Forecasting","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-05-12T01:20:37.192907Z"},"links":{"cited_paper":"/paper/2209.15240","citing_paper":"/paper/2605.08273"},"observation_digest":"sha256:4881a1f9be2867b057aa40c543aaff5dd4ca2c4b47ff4f7b8da65bf61911011e","observation_id":"34f38073-97b8-4e0e-8c4a-d5f399364221","resolution":{"observed_at":"2026-05-12T08:06:26.763653Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2209.15240/citation-record","integrity":"/paper/2209.15240/integrity","json":"/paper/2209.15240/citation-record.json","paper":"/paper/2209.15240"},"outbound":[],"paper":{"arxiv_id":"2209.15240","last_updated":"2024-04-10T09:04:26Z","latest_version":5,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-16T16:27:56.933103Z","submitted_at":"2022-09-30T05:19:27Z","title":"Universal Prompt Tuning for Graph Neural Networks"},"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-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"thesis":"As of 21 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2209.15240."}