{"as_of":"2026-08-16T04:51:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a5452f28a07a9a07359181ddf4950cf708e6f9a23ca7f9377f78773e7e732ad9","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":3,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":3,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-15T06:32:42.880941+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T16:47:43.674969Z","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-12T23:44:27.508090Z","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-15T23:34:03.997304Z","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:eb01813e82329ea26bf20d48c79695999ca2e10378b4d0ff86c8a33979f1d5b3","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-12T23:44:27.508090Z","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-15T16:47:43.674969Z","title":"Graphfm: A comprehensive benchmark for graph foundation model, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.20583","last_updated":"2025-08-28T09:20:47Z","snapshot_observed_at":"2026-08-15T23:34:05.187067Z","submitted_at":"2025-08-28T09:20:47Z","title":"A Graph Talks, But Who's Listening? Rethinking Evaluations for Graph-Language Models","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-15T16:47:43.674969Z"},"links":{"cited_paper":"/paper/2406.08310","citing_paper":"/paper/2508.20583"},"observation_digest":"sha256:147aa012cac99c56d4896b01d91d6e59ffa85806de943e13e4a9961cf462297c","observation_id":"fbec7b48-3622-43c4-a2a9-dcd256631e64","resolution":{"observed_at":"2026-08-15T16:47:43.674969Z","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-12T23:44:27.508090Z","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:9cb032ee3e87546aa9bf2802fe09cc609a0a8e418d74f7ad4c83ae8e0eb1b5a4","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-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/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-12T23:44:27.508090Z","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-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2406.08310."}