{"as_of":"2026-08-09T10:26:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:005cc8a42c56b00ca9ccebdaefb9591c92014597dcfafed826e32c70384636ff","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":4,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":4,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":4,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":4,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T22:13:55.187325Z","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-05T14:36:36.513170Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2406.05346","last_updated":"2024-06-19T10:55:22Z","snapshot_observed_at":"2026-07-06T18:27:28.886692Z","submitted_at":"2024-06-08T04:17:48Z","title":"ProG: A Graph Prompt Learning Benchmark","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.05346","snapshot_observed_at":"2026-08-07T22:13:55.187325Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.09254","last_updated":"2025-06-01T13:38:06Z","snapshot_observed_at":"2026-08-09T07:01:28.084445Z","submitted_at":"2025-02-13T12:10:05Z","title":"AnomalyGFM: Graph Foundation Model for Zero/Few-shot Anomaly Detection","version":2},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-07T22:13:55.187325Z"},"links":{"cited_paper":"/paper/2406.05346","citing_paper":"/paper/2502.09254"},"observation_digest":"sha256:7a94f4425cf2e6c1032cb6816e278e691c1540554c9885f896a68d1832f5aaca","observation_id":"8dc678d8-09c4-4c53-a7c3-cbd41c31f0f9","resolution":{"observed_at":"2026-08-07T22:13:55.187325Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.05346","last_updated":"2024-06-19T10:55:22Z","snapshot_observed_at":"2026-07-06T18:27:28.886692Z","submitted_at":"2024-06-08T04:17:48Z","title":"ProG: A Graph Prompt Learning Benchmark","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.05346","snapshot_observed_at":"2026-08-07T05:17:17.458056Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.08326","last_updated":"2025-06-10T01:27:19Z","snapshot_observed_at":"2026-08-08T14:16:05.275281Z","submitted_at":"2025-06-10T01:27:19Z","title":"Graph Prompting for Graph Learning Models: Recent Advances and Future Directions","version":1},"reference_index":165,"source":"pdf_text","source_observed_at":"2026-08-07T05:17:17.458056Z"},"links":{"cited_paper":"/paper/2406.05346","citing_paper":"/paper/2506.08326"},"observation_digest":"sha256:f0beec3b4f01bb154f73738c38191263fa6b095a45398126f0adec31446fdeb0","observation_id":"587d6642-b533-486a-8f27-921a3503804a","resolution":{"observed_at":"2026-08-07T05:17:17.458056Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.05346","last_updated":"2024-06-19T10:55:22Z","snapshot_observed_at":"2026-07-06T18:27:28.886692Z","submitted_at":"2024-06-08T04:17:48Z","title":"ProG: A Graph Prompt Learning Benchmark","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.05346","snapshot_observed_at":"2026-08-06T18:49:14.516202Z","title":"Prog: A graph prompt learning benchmark","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.07405","last_updated":"2025-07-10T04:01:47Z","snapshot_observed_at":"2026-08-06T18:39:34.554864Z","submitted_at":"2025-07-10T04:01:47Z","title":"HGMP:Heterogeneous Graph Multi-Task Prompt Learning","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-06T18:49:14.516202Z"},"links":{"cited_paper":"/paper/2406.05346","citing_paper":"/paper/2507.07405"},"observation_digest":"sha256:65670e8f7032067cad59a9192bb265dd2d1957e9c0db0984730e4de17fdebce5","observation_id":"77c3171c-0226-46a4-a752-69288df6ab06","resolution":{"observed_at":"2026-08-06T18:49:14.516202Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.05346","last_updated":"2024-06-19T10:55:22Z","snapshot_observed_at":"2026-07-06T18:27:28.886692Z","submitted_at":"2024-06-08T04:17:48Z","title":"ProG: A Graph Prompt Learning Benchmark","version":2},"cited_work":{"arxiv_id":"2406.05346","doi":null,"metadata_source":"pith","pith_arxiv_id":"2406.05346","snapshot_observed_at":"2026-08-05T14:36:36.513170Z","title":"ProG: A Graph Prompt Learning Benchmark","venue":"cs.LG","work_id":"d5dadbc3-e820-4178-8fb1-8197ca50738c","year":2024},"citing_paper":{"arxiv_id":"2509.06975","last_updated":"2025-08-28T19:13:10Z","snapshot_observed_at":"2026-08-07T21:39:28.054869Z","submitted_at":"2025-08-28T19:13:10Z","title":"GSTBench: A Benchmark Study on the Transferability of Graph Self-Supervised Learning","version":1},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-05T14:36:36.483630Z"},"links":{"cited_paper":"/paper/2406.05346","citing_paper":"/paper/2509.06975"},"observation_digest":"sha256:32743e34803ee330c96f80b67b1aa4413e0fff0dfd5365431616312642f81284","observation_id":"75e79935-b82f-45f5-b14a-62d8a6232d13","resolution":{"observed_at":"2026-08-05T14:36:36.518918Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"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"}}],"links":{"evidence":"/evidence","html":"/paper/2406.05346/citation-record","integrity":"/paper/2406.05346/integrity","json":"/paper/2406.05346/citation-record.json","paper":"/paper/2406.05346"},"outbound":[],"paper":{"arxiv_id":"2406.05346","last_updated":"2024-06-19T10:55:22Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T18:27:28.886692Z","submitted_at":"2024-06-08T04:17:48Z","title":"ProG: A Graph Prompt Learning Benchmark"},"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 4 inbound Pith citation observations for arXiv:2406.05346."}