{"as_of":"2026-08-09T17:21:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:f44f9e0da44d604fe820c230c0439bde53db18de154b7fd842043b22b17ce7a1","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-09T06:31:02.800959+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-07T13:55:20.054403Z","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-04T22:15:33.719962Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2405.13707","last_updated":"2025-01-23T08:49:04Z","snapshot_observed_at":"2026-07-06T18:17:59.081203Z","submitted_at":"2024-05-22T14:57:09Z","title":"Rethinking and Accelerating Graph Condensation: A Training-Free Approach with Class Partition","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.13707","snapshot_observed_at":"2026-08-07T13:55:20.054403Z","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":14,"source":"pdf_text","source_observed_at":"2026-08-07T13:55:20.054403Z"},"links":{"cited_paper":"/paper/2405.13707","citing_paper":"/paper/2505.20807"},"observation_digest":"sha256:8764a65dcb32c584125fc4e32823383b2e8055ccf81d9757e3f64af76aa70d41","observation_id":"f2eefc89-24a4-439b-88ef-e2319c9110a1","resolution":{"observed_at":"2026-08-07T13:55:20.054403Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.13707","last_updated":"2025-01-23T08:49:04Z","snapshot_observed_at":"2026-07-06T18:17:59.081203Z","submitted_at":"2024-05-22T14:57:09Z","title":"Rethinking and Accelerating Graph Condensation: A Training-Free Approach with Class Partition","version":2},"cited_work":{"arxiv_id":"2405.13707","doi":null,"metadata_source":"pith","pith_arxiv_id":"2405.13707","snapshot_observed_at":"2026-08-04T22:15:33.719962Z","title":"Rethinking and Accelerating Graph Condensation: A Training-Free Approach with Class Partition","venue":"cs.LG","work_id":"36005faa-6dd5-4474-b532-a0bdc49f6281","year":2024},"citing_paper":{"arxiv_id":"2509.07499","last_updated":"2025-09-09T08:25:11Z","snapshot_observed_at":"2026-08-08T23:22:16.224552Z","submitted_at":"2025-09-09T08:25:11Z","title":"Conv4Rec: A 1-by-1 Convolutional AutoEncoder for User Profiling through Joint Analysis of Implicit and Explicit Feedbacks","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-04T22:15:26.394885Z"},"links":{"cited_paper":"/paper/2405.13707","citing_paper":"/paper/2509.07499"},"observation_digest":"sha256:ae97e991f2188e29d3a9b0278c884b8fde477f4f5b40d99ea40a8a81dd7a0207","observation_id":"afe38b0b-75de-46f7-90ea-07ca42d983ec","resolution":{"observed_at":"2026-08-04T22:15:33.779268Z","resolver_source":"local_arxiv","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":"2405.13707","last_updated":"2025-01-23T08:49:04Z","snapshot_observed_at":"2026-07-06T18:17:59.081203Z","submitted_at":"2024-05-22T14:57:09Z","title":"Rethinking and Accelerating Graph Condensation: A Training-Free Approach with Class Partition","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.13707","snapshot_observed_at":"2026-07-12T04:56:04.713121Z","title":"Rethinking and accelerating graph condensation: A training-free approach with class partition,","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":95,"source":"pdf_text","source_observed_at":"2026-07-12T04:56:04.713121Z"},"links":{"cited_paper":"/paper/2405.13707","citing_paper":"/paper/2607.03097"},"observation_digest":"sha256:04723245253eae1a9bbc7ee6eebe3dc91dffcea9ce3af78fc0bebb5a8dea93d3","observation_id":"c804ef49-4d72-413f-ba00-6a7c6bca900e","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/2405.13707/citation-record","integrity":"/paper/2405.13707/integrity","json":"/paper/2405.13707/citation-record.json","paper":"/paper/2405.13707"},"outbound":[],"paper":{"arxiv_id":"2405.13707","last_updated":"2025-01-23T08:49:04Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T18:17:59.081203Z","submitted_at":"2024-05-22T14:57:09Z","title":"Rethinking and Accelerating Graph Condensation: A Training-Free Approach with Class Partition"},"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 3 inbound Pith citation observations for arXiv:2405.13707."}