{"as_of":"2026-08-09T19:19:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:0df5fb8f852b6d8992d6572a931c619cd198f4fffced6ff8ff31fcacdcdc35a0","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":7,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":7,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":7,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":7,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T19:05:45.847625Z","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-03T13:58:21.798238Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2402.03358","last_updated":"2024-06-29T13:07:00Z","snapshot_observed_at":"2026-08-08T17:35:26.123498Z","submitted_at":"2024-01-29T01:19:09Z","title":"A Comprehensive Survey on Graph Reduction: Sparsification, Coarsening, and Condensation","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.03358","snapshot_observed_at":"2026-08-07T19:05:45.847625Z","title":"A., and Jin, W","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.10208","last_updated":"2025-02-14T15:03:43Z","snapshot_observed_at":"2026-08-07T18:55:09.770952Z","submitted_at":"2025-02-14T15:03:43Z","title":"SGS-GNN: A Supervised Graph Sparsification method for Graph Neural Networks","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-07T19:05:45.847625Z"},"links":{"cited_paper":"/paper/2402.03358","citing_paper":"/paper/2502.10208"},"observation_digest":"sha256:73dff0e68efa6835a2aafa6a824592870e30e57857ba608bfb2112b5f57cca93","observation_id":"fbf66715-bfff-4d35-9518-dde45af738c7","resolution":{"observed_at":"2026-08-07T19:05:45.847625Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.03358","last_updated":"2024-06-29T13:07:00Z","snapshot_observed_at":"2026-08-08T17:35:26.123498Z","submitted_at":"2024-01-29T01:19:09Z","title":"A Comprehensive Survey on Graph Reduction: Sparsification, Coarsening, and Condensation","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.03358","snapshot_observed_at":"2026-08-07T15:00:23.747834Z","title":"A., and Jin, W","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.16860","last_updated":"2025-05-22T16:19:19Z","snapshot_observed_at":"2026-08-08T05:06:33.577021Z","submitted_at":"2025-05-22T16:19:19Z","title":"GCAL: Adapting Graph Models to Evolving Domain Shifts","version":1},"reference_index":2017,"source":"pdf_text","source_observed_at":"2026-08-07T15:00:23.747834Z"},"links":{"cited_paper":"/paper/2402.03358","citing_paper":"/paper/2505.16860"},"observation_digest":"sha256:31b0491c0b3c3bd9d7fa714be01962aaf0a9e3c97362f36c0d8bfa9c9decacec","observation_id":"b1f2a8aa-e7a4-4214-a609-546641e276a3","resolution":{"observed_at":"2026-08-07T15:00:23.747834Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.03358","last_updated":"2024-06-29T13:07:00Z","snapshot_observed_at":"2026-08-08T17:35:26.123498Z","submitted_at":"2024-01-29T01:19:09Z","title":"A Comprehensive Survey on Graph Reduction: Sparsification, Coarsening, and Condensation","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.03358","snapshot_observed_at":"2026-08-07T13:55:20.479864Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.20807","last_updated":"2025-05-27T07:13:10Z","snapshot_observed_at":"2026-08-07T13:44:35.467894Z","submitted_at":"2025-05-27T07:13:10Z","title":"Simple yet Effective Graph Distillation via Clustering","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T13:55:20.479864Z"},"links":{"cited_paper":"/paper/2402.03358","citing_paper":"/paper/2505.20807"},"observation_digest":"sha256:90f7acd04d30ed0506088ae3495f55c9d88f2bed2a61440ac3fd043633601e8a","observation_id":"0f0ed794-0ddd-4009-a289-ef9985e87a77","resolution":{"observed_at":"2026-08-07T13:55:20.479864Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.03358","last_updated":"2024-06-29T13:07:00Z","snapshot_observed_at":"2026-08-08T17:35:26.123498Z","submitted_at":"2024-01-29T01:19:09Z","title":"A Comprehensive Survey on Graph Reduction: Sparsification, Coarsening, and Condensation","version":4},"cited_work":{"arxiv_id":"2402.03358","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2402.03358","snapshot_observed_at":"2026-07-03T13:58:21.798238Z","title":"A Comprehensive Survey on Graph Reduction: Sparsification, Coarsening, and Condensation","venue":null,"work_id":"da71277c-e0ad-4e5b-8e31-db2d1dcf3dc9","year":2024},"citing_paper":{"arxiv_id":"2506.06558","last_updated":"2026-03-02T10:41:47Z","snapshot_observed_at":"2026-07-06T21:38:15.583967Z","submitted_at":"2025-06-06T22:10:05Z","title":"Rapid training of Hamiltonian graph networks using random features","version":3},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-05-19T10:17:00.343410Z"},"links":{"cited_paper":"/paper/2402.03358","citing_paper":"/paper/2506.06558"},"observation_digest":"sha256:6d5983f79e73aaed5fc3caa30bfdaf3f93a4b1560285eb70bad6397b3d8aeaa5","observation_id":"c1824f84-170d-47cc-aa74-457d064a2223","resolution":{"observed_at":"2026-05-19T10:17:15.641114Z","resolver_source":"arxiv_id","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":"2402.03358","last_updated":"2024-06-29T13:07:00Z","snapshot_observed_at":"2026-08-08T17:35:26.123498Z","submitted_at":"2024-01-29T01:19:09Z","title":"A Comprehensive Survey on Graph Reduction: Sparsification, Coarsening, and Condensation","version":4},"cited_work":{"arxiv_id":"2402.03358","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2402.03358","snapshot_observed_at":"2026-07-03T13:58:21.798238Z","title":"A Comprehensive Survey on Graph Reduction: Sparsification, Coarsening, and Condensation","venue":null,"work_id":"da71277c-e0ad-4e5b-8e31-db2d1dcf3dc9","year":2024},"citing_paper":{"arxiv_id":"2605.06814","last_updated":"2026-05-07T18:16:21Z","snapshot_observed_at":"2026-07-06T23:19:15.382283Z","submitted_at":"2026-05-07T18:16:21Z","title":"From Model to Data (M2D): Shifting Complexity from GNNs to Graphs for Transparent Graph Learning","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-05-11T01:08:24.251390Z"},"links":{"cited_paper":"/paper/2402.03358","citing_paper":"/paper/2605.06814"},"observation_digest":"sha256:2008554194832baf80d91053893ec4070695e4e2e4024a379e85fe8d39899723","observation_id":"b4807eaf-0dba-46a7-ad65-f080ff463d4c","resolution":{"observed_at":"2026-05-11T04:41:01.720143Z","resolver_source":"arxiv_id","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":"2402.03358","last_updated":"2024-06-29T13:07:00Z","snapshot_observed_at":"2026-08-08T17:35:26.123498Z","submitted_at":"2024-01-29T01:19:09Z","title":"A Comprehensive Survey on Graph Reduction: Sparsification, Coarsening, and Condensation","version":4},"cited_work":{"arxiv_id":"2402.03358","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2402.03358","snapshot_observed_at":"2026-07-03T13:58:21.798238Z","title":"A Comprehensive Survey on Graph Reduction: Sparsification, Coarsening, and Condensation","venue":null,"work_id":"da71277c-e0ad-4e5b-8e31-db2d1dcf3dc9","year":2024},"citing_paper":{"arxiv_id":"2606.12581","last_updated":"2026-06-10T18:29:54Z","snapshot_observed_at":"2026-08-06T22:35:19.633874Z","submitted_at":"2026-06-10T18:29:54Z","title":"Graph Reduction in Multirelational Networks: A Spreading-Oriented Reduction Benchmark","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-06-27T07:22:49.577516Z"},"links":{"cited_paper":"/paper/2402.03358","citing_paper":"/paper/2606.12581"},"observation_digest":"sha256:8f07569a287a699d2f20412717de3deeee02c50ba9fe75490e235228a66cfcb1","observation_id":"829375c5-62f7-44ca-9afb-a86691905ca1","resolution":{"observed_at":"2026-07-03T13:58:21.800063Z","resolver_source":"arxiv_id","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":"2402.03358","last_updated":"2024-06-29T13:07:00Z","snapshot_observed_at":"2026-08-08T17:35:26.123498Z","submitted_at":"2024-01-29T01:19:09Z","title":"A Comprehensive Survey on Graph Reduction: Sparsification, Coarsening, and Condensation","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.03358","snapshot_observed_at":"2026-07-12T04:56:04.713121Z","title":"A comprehensive survey on graph reduction: Sparsification, coarsening, and condensation,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.03097","last_updated":"2026-07-03T08:34:11Z","snapshot_observed_at":"2026-08-06T23:41:06.295439Z","submitted_at":"2026-07-03T08:34:11Z","title":"Heterogeneous Graph Condensation via Role-Aware Clustering","version":1},"reference_index":76,"source":"pdf_text","source_observed_at":"2026-07-12T04:56:04.713121Z"},"links":{"cited_paper":"/paper/2402.03358","citing_paper":"/paper/2607.03097"},"observation_digest":"sha256:699986c05a9c0f213a6efb76bf40de20c7d206c765ffe0fd502230faa8d16911","observation_id":"843ea0bc-6ca6-479f-9e29-4cab102e7774","resolution":{"observed_at":"2026-07-12T04:56:04.713121Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2402.03358/citation-record","integrity":"/paper/2402.03358/integrity","json":"/paper/2402.03358/citation-record.json","paper":"/paper/2402.03358"},"outbound":[],"paper":{"arxiv_id":"2402.03358","last_updated":"2024-06-29T13:07:00Z","latest_version":4,"primary_category":"cs.SI","snapshot_observed_at":"2026-08-08T17:35:26.123498Z","submitted_at":"2024-01-29T01:19:09Z","title":"A Comprehensive Survey on Graph Reduction: Sparsification, Coarsening, and Condensation"},"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 7 inbound Pith citation observations for arXiv:2402.03358."}