{"as_of":"2026-08-21T01:37:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:22ccda17e2c9d757d36172be4dcbda2580e2f0482067728ca2dac7f9b6c2d417","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-20T06:33:59.587034+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-10T14:05:43.959764Z","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-06-29T00:12:50.272308Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2402.05011","last_updated":"2024-06-18T12:38:51Z","snapshot_observed_at":"2026-08-18T07:54:50.778626Z","submitted_at":"2024-02-07T16:32:02Z","title":"Navigating Complexity: Toward Lossless Graph Condensation via Expanding Window Matching","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.05011","snapshot_observed_at":"2026-08-10T14:05:43.959764Z","title":"Navigating complexity: Toward loss- less graph condensation via expanding window matching","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.15696","last_updated":"2025-01-26T22:55:34Z","snapshot_observed_at":"2026-08-16T13:52:18.863266Z","submitted_at":"2025-01-26T22:55:34Z","title":"Random Walk Guided Hyperbolic Graph Distillation","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-10T14:05:43.959764Z"},"links":{"cited_paper":"/paper/2402.05011","citing_paper":"/paper/2501.15696"},"observation_digest":"sha256:66b00f4a7a992f6ecc4556413ef3f5725ed446c7aef63155fe60b4cb88c8f423","observation_id":"ce54e3ba-1a3b-462f-8782-c18bb1db7628","resolution":{"observed_at":"2026-08-10T14:05:43.959764Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.05011","last_updated":"2024-06-18T12:38:51Z","snapshot_observed_at":"2026-08-18T07:54:50.778626Z","submitted_at":"2024-02-07T16:32:02Z","title":"Navigating Complexity: Toward Lossless Graph Condensation via Expanding Window Matching","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.05011","snapshot_observed_at":"2026-08-09T10:55:55.149282Z","title":"Navigating complexity: Toward lossless graph condensation via expanding window matching","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.02854","last_updated":"2025-02-06T08:29:46Z","snapshot_observed_at":"2026-08-14T19:26:19.282455Z","submitted_at":"2025-02-05T03:13:25Z","title":"TD3: Tucker Decomposition Based Dataset Distillation Method for Sequential Recommendation","version":2},"reference_index":77,"source":"pdf_text","source_observed_at":"2026-08-09T10:55:55.149282Z"},"links":{"cited_paper":"/paper/2402.05011","citing_paper":"/paper/2502.02854"},"observation_digest":"sha256:aa9daf598d2083df562170571465641c60ec5cec0093fc79a5984be7f062f1d8","observation_id":"e07311b5-6ceb-4fa9-8dc1-cd8d3da298aa","resolution":{"observed_at":"2026-08-09T10:55:55.149282Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.05011","last_updated":"2024-06-18T12:38:51Z","snapshot_observed_at":"2026-08-18T07:54:50.778626Z","submitted_at":"2024-02-07T16:32:02Z","title":"Navigating Complexity: Toward Lossless Graph Condensation via Expanding Window Matching","version":3},"cited_work":{"arxiv_id":"2402.05011","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2402.05011","snapshot_observed_at":"2026-06-29T00:12:50.272308Z","title":"Navigating complexity: Toward lossless graph condensation via expanding window matching,","venue":null,"work_id":"3b39b2b9-0e63-4272-a684-eccd0768a519","year":2024},"citing_paper":{"arxiv_id":"2605.31016","last_updated":"2026-05-29T08:49:17Z","snapshot_observed_at":"2026-08-16T11:36:43.989019Z","submitted_at":"2026-05-29T08:49:17Z","title":"An Efficient and Scalable Graph Condensation with Structure-Preserving","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-06-29T00:03:13.278727Z"},"links":{"cited_paper":"/paper/2402.05011","citing_paper":"/paper/2605.31016"},"observation_digest":"sha256:bb9901310006b7c861a51e826df4e10490f7f3129f864527003243d31d1279c7","observation_id":"ef05df7a-b627-4744-955e-1fb92c5c1dbc","resolution":{"observed_at":"2026-06-29T00:12:50.273727Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2402.05011/citation-record","integrity":"/paper/2402.05011/integrity","json":"/paper/2402.05011/citation-record.json","paper":"/paper/2402.05011"},"outbound":[],"paper":{"arxiv_id":"2402.05011","last_updated":"2024-06-18T12:38:51Z","latest_version":3,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-18T07:54:50.778626Z","submitted_at":"2024-02-07T16:32:02Z","title":"Navigating Complexity: Toward Lossless Graph Condensation via Expanding Window Matching"},"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-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"thesis":"As of 21 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2402.05011."}