{"as_of":"2026-08-15T06:38:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:cddd9cbaf7fc4630688d02ab31b8cb281df44d1f7c5bfeaa049033875d121bca","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-15T06:32:42.880941+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-10T14:40:13.245479Z","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-03T20:08:56.281916Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2402.09834","last_updated":"2024-06-22T13:29:36Z","snapshot_observed_at":"2026-08-14T23:58:27.347525Z","submitted_at":"2024-02-15T09:55:39Z","title":"All in One and One for All: A Simple yet Effective Method towards Cross-domain Graph Pretraining","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.09834","snapshot_observed_at":"2026-08-10T14:40:13.245479Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.15142","last_updated":"2025-01-25T08:53:42Z","snapshot_observed_at":"2026-08-13T21:05:57.605772Z","submitted_at":"2025-01-25T08:53:42Z","title":"DAGPrompT: Pushing the Limits of Graph Prompting with a Distribution-aware Graph Prompt Tuning Approach","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-10T14:40:13.245479Z"},"links":{"cited_paper":"/paper/2402.09834","citing_paper":"/paper/2501.15142"},"observation_digest":"sha256:2ed5d819fec2b03ffd06118bbfefb594e5a0284981b4f5340bfefbd5f87ca0fd","observation_id":"ca75ef56-e59e-4266-80f6-86e06b35cd75","resolution":{"observed_at":"2026-08-10T14:40:13.245479Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.09834","last_updated":"2024-06-22T13:29:36Z","snapshot_observed_at":"2026-08-14T23:58:27.347525Z","submitted_at":"2024-02-15T09:55:39Z","title":"All in One and One for All: A Simple yet Effective Method towards Cross-domain Graph Pretraining","version":2},"cited_work":{"arxiv_id":"2402.09834","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2402.09834","snapshot_observed_at":"2026-07-03T20:08:56.281916Z","title":null,"venue":null,"work_id":"60825c96-0ced-4292-8bd1-14d3c60a1255","year":2024},"citing_paper":{"arxiv_id":"2606.17667","last_updated":"2026-06-16T08:29:34Z","snapshot_observed_at":"2026-08-11T15:30:28.701558Z","submitted_at":"2026-06-16T08:29:34Z","title":"Handling Feature Heterogeneity with Learnable Graph Patches","version":1},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-06-27T01:36:45.977332Z"},"links":{"cited_paper":"/paper/2402.09834","citing_paper":"/paper/2606.17667"},"observation_digest":"sha256:e89834493d3a1b51b8180660d2a8f35c68fc8331ebd9e2b6dcada81d9747f36b","observation_id":"cb3097c0-30c2-4d0f-9912-28f3c6a195eb","resolution":{"observed_at":"2026-07-03T20:08:56.284154Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2402.09834/citation-record","integrity":"/paper/2402.09834/integrity","json":"/paper/2402.09834/citation-record.json","paper":"/paper/2402.09834"},"outbound":[],"paper":{"arxiv_id":"2402.09834","last_updated":"2024-06-22T13:29:36Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-14T23:58:27.347525Z","submitted_at":"2024-02-15T09:55:39Z","title":"All in One and One for All: A Simple yet Effective Method towards Cross-domain Graph Pretraining"},"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-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"thesis":"As of 15 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2402.09834."}