{"as_of":"2026-08-11T19:11:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:db3632b8e7c6f4e78518271c8e76a9fbf97ac56c6abec62e586bb99664fe0d37","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-11T06:34:44.6726+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:01:38.465186Z","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-11T19:21:07.036671Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2406.08310","last_updated":"2024-06-14T15:36:00Z","snapshot_observed_at":"2026-08-11T11:28:03.750455Z","submitted_at":"2024-06-12T15:10:44Z","title":"GraphFM: A Comprehensive Benchmark for Graph Foundation Model","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.08310","snapshot_observed_at":"2026-08-10T14:01:38.465186Z","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-10T13:55:53.163531Z","submitted_at":"2025-01-27T03:50:30Z","title":"GraphICL: Unlocking Graph Learning Potential in LLMs through Structured Prompt Design","version":1},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-08-10T14:01:38.465186Z"},"links":{"cited_paper":"/paper/2406.08310","citing_paper":"/paper/2501.15755"},"observation_digest":"sha256:de1e48f8e549cc3abad3f9d5cc268bd0089022c3eef8637c182a031c1f259fc1","observation_id":"61fb6d5c-73bd-4ee4-8304-83391569d77e","resolution":{"observed_at":"2026-08-10T14:01:38.465186Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.08310","last_updated":"2024-06-14T15:36:00Z","snapshot_observed_at":"2026-08-11T11:28:03.750455Z","submitted_at":"2024-06-12T15:10:44Z","title":"GraphFM: A Comprehensive Benchmark for Graph Foundation Model","version":2},"cited_work":{"arxiv_id":"2406.08310","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2406.08310","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"GraphFM: A comprehensive benchmark for graph foundation model","venue":null,"work_id":"99b43fa1-e43a-4c3a-a4cf-40c2d5e71000","year":2024},"citing_paper":{"arxiv_id":"2605.06576","last_updated":"2026-05-07T17:06:19Z","snapshot_observed_at":"2026-08-11T16:26:23.282859Z","submitted_at":"2026-05-07T17:06:19Z","title":"On the Safety of Graph Representation Learning","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-05-08T12:17:28.087347Z"},"links":{"cited_paper":"/paper/2406.08310","citing_paper":"/paper/2605.06576"},"observation_digest":"sha256:9d7c1aa0f73d7d56babeea8dab741922c1f5343019ddc6aaef042b7fab369745","observation_id":"c860fb8a-062f-47d5-bd49-ebe0da4d35db","resolution":{"observed_at":"2026-05-11T19:21:07.041860Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2406.08310/citation-record","integrity":"/paper/2406.08310/integrity","json":"/paper/2406.08310/citation-record.json","paper":"/paper/2406.08310"},"outbound":[],"paper":{"arxiv_id":"2406.08310","last_updated":"2024-06-14T15:36:00Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-11T11:28:03.750455Z","submitted_at":"2024-06-12T15:10:44Z","title":"GraphFM: A Comprehensive Benchmark for Graph Foundation Model"},"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-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2406.08310."}