{"as_of":"2026-08-09T17:58:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:f43d864cb760146d7c4702d06d408d00362a0713a2bd16a134024a2b71c0fca5","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-09T06:31:02.800959+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-06T18:49:20.350908Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-07T06:16:28.064256Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2307.01504","last_updated":"2023-12-17T08:36:44Z","snapshot_observed_at":"2026-08-06T05:58:59.127398Z","submitted_at":"2023-07-04T06:27:31Z","title":"All in One: Multi-task Prompting for Graph Neural Networks","version":2},"cited_work":{"arxiv_id":"2307.01504","doi":"10.48550/arxiv.2307.01504","metadata_source":"pith","pith_arxiv_id":"2307.01504","snapshot_observed_at":"2026-08-07T06:16:28.064256Z","title":"All in One: Multi-task Prompting for Graph Neural Networks","venue":"cs.SI","work_id":"17060bb0-0fa5-4d4b-a152-fb780ee7d720","year":2023},"citing_paper":{"arxiv_id":"2507.07296","last_updated":"2025-07-09T21:43:06Z","snapshot_observed_at":"2026-08-09T14:58:57.469937Z","submitted_at":"2025-07-09T21:43:06Z","title":"Time Series Foundation Models for Multivariate Financial Time Series Forecasting","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-06T18:49:20.350908Z"},"links":{"cited_paper":"/paper/2307.01504","citing_paper":"/paper/2507.07296"},"observation_digest":"sha256:ea08f826cae717fb8743dc91f91b594fa9004a4dda91f6c329d5fd8c8e2f4e31","observation_id":"039bb375-ec02-424c-a5fe-0d01b8c69183","resolution":{"observed_at":"2026-08-06T18:49:34.716751Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2307.01504","last_updated":"2023-12-17T08:36:44Z","snapshot_observed_at":"2026-08-06T05:58:59.127398Z","submitted_at":"2023-07-04T06:27:31Z","title":"All in One: Multi-task Prompting for Graph Neural Networks","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2307.01504","snapshot_observed_at":"2026-08-01T15:05:37.534302Z","title":"Proceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) , 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-08T16:17:43.321230Z","submitted_at":"2026-07-20T23:03:26Z","title":"Attacking Graph Foundation Models Through Their Shared Representation","version":1},"reference_index":68,"source":"arxiv_source","source_observed_at":"2026-08-01T15:05:37.534302Z"},"links":{"cited_paper":"/paper/2307.01504","citing_paper":"/paper/2607.18567"},"observation_digest":"sha256:5dca91e6336ab0982fca879f9757c5c83920f1056aa35fca39341155efb8a227","observation_id":"21ee37e3-1625-4f5e-8d4a-a7cea4fc45dc","resolution":{"observed_at":"2026-08-01T15:05:37.534302Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2307.01504/citation-record","integrity":"/paper/2307.01504/integrity","json":"/paper/2307.01504/citation-record.json","paper":"/paper/2307.01504"},"outbound":[],"paper":{"arxiv_id":"2307.01504","last_updated":"2023-12-17T08:36:44Z","latest_version":2,"primary_category":"cs.SI","snapshot_observed_at":"2026-08-06T05:58:59.127398Z","submitted_at":"2023-07-04T06:27:31Z","title":"All in One: Multi-task Prompting 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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2307.01504."}