{"as_of":"2026-08-08T09:14:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:ab60896bb271f388eeb98ac5ab91459c6a244f8ce4f8b67ff9f391c414f2ccb0","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":5,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":5,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":5,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":5,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T14:33:07.577411Z","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-28T23:02:46.154205Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2304.04934","last_updated":"2024-01-27T17:07:46Z","snapshot_observed_at":"2026-08-07T08:29:22.239111Z","submitted_at":"2023-04-11T02:12:02Z","title":"Model Sparsity Can Simplify Machine Unlearning","version":13},"cited_work":{"arxiv_id":"2304.04934","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2304.04934","snapshot_observed_at":"2026-06-28T23:02:46.154205Z","title":"arXiv preprint arXiv:2304.04934 , year=","venue":null,"work_id":"8f76b774-2267-40ab-a6c6-8118032bad7c","year":2023},"citing_paper":{"arxiv_id":"2310.12508","last_updated":"2024-04-04T07:45:38Z","snapshot_observed_at":"2026-08-03T17:30:25.153454Z","submitted_at":"2023-10-19T06:17:17Z","title":"SalUn: Empowering Machine Unlearning via Gradient-based Weight Saliency in Both Image Classification and Generation","version":5},"reference_index":227,"source":"arxiv_source","source_observed_at":"2026-05-16T17:56:23.281678Z"},"links":{"cited_paper":"/paper/2304.04934","citing_paper":"/paper/2310.12508"},"observation_digest":"sha256:be4920b4135b6e61d9d46926d63ab4fdf732d565913da07272df85fc119288be","observation_id":"6a5c36dd-8a70-4785-8772-2e7c91f00517","resolution":{"observed_at":"2026-05-16T17:56:23.601349Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2304.04934","last_updated":"2024-01-27T17:07:46Z","snapshot_observed_at":"2026-08-07T08:29:22.239111Z","submitted_at":"2023-04-11T02:12:02Z","title":"Model Sparsity Can Simplify Machine Unlearning","version":13},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2304.04934","snapshot_observed_at":"2026-08-07T14:33:07.577411Z","title":"Model sparsity can simplify machine unlearning,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.18563","last_updated":"2025-05-24T07:06:36Z","snapshot_observed_at":"2026-08-07T14:27:16.669960Z","submitted_at":"2025-05-24T07:06:36Z","title":"PacTrain: Pruning and Adaptive Sparse Gradient Compression for Efficient Collective Communication in Distributed Deep Learning","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-07T14:33:07.577411Z"},"links":{"cited_paper":"/paper/2304.04934","citing_paper":"/paper/2505.18563"},"observation_digest":"sha256:1f51d65876a058893265c45b86743a63e4d807289b7651450ea65037b43ca65c","observation_id":"e4be9c19-7374-4467-97ce-d73aa8f2c4bd","resolution":{"observed_at":"2026-08-07T14:33:07.577411Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2304.04934","last_updated":"2024-01-27T17:07:46Z","snapshot_observed_at":"2026-08-07T08:29:22.239111Z","submitted_at":"2023-04-11T02:12:02Z","title":"Model Sparsity Can Simplify Machine Unlearning","version":13},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2304.04934","snapshot_observed_at":"2026-08-06T17:54:17.700274Z","title":"Model sparsification can simplify machine unlearning.arXiv preprint arXiv:2304.04934, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.09786","last_updated":"2025-08-04T19:45:36Z","snapshot_observed_at":"2026-08-06T17:45:04.564807Z","submitted_at":"2025-07-13T20:57:31Z","title":"Leveraging Distribution Matching to Make Approximate Machine Unlearning Faster","version":3},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-06T17:54:17.700274Z"},"links":{"cited_paper":"/paper/2304.04934","citing_paper":"/paper/2507.09786"},"observation_digest":"sha256:270253e4c518657a967ad896ebe1c68c8556026a2f0bb1b53ee7eccde75092a1","observation_id":"51018121-bec9-434d-b9b8-70cb5a807afa","resolution":{"observed_at":"2026-08-06T17:54:17.700274Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2304.04934","last_updated":"2024-01-27T17:07:46Z","snapshot_observed_at":"2026-08-07T08:29:22.239111Z","submitted_at":"2023-04-11T02:12:02Z","title":"Model Sparsity Can Simplify Machine Unlearning","version":13},"cited_work":{"arxiv_id":"2304.04934","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2304.04934","snapshot_observed_at":"2026-06-28T23:02:46.154205Z","title":"arXiv preprint arXiv:2304.04934 , year=","venue":null,"work_id":"8f76b774-2267-40ab-a6c6-8118032bad7c","year":2023},"citing_paper":{"arxiv_id":"2604.04800","last_updated":"2026-04-06T16:06:07Z","snapshot_observed_at":"2026-07-30T23:23:10.579340Z","submitted_at":"2026-04-06T16:06:07Z","title":"Forgetting to Witness: Efficient Federated Unlearning and Its Visible Evaluation","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-05-10T20:26:25.834943Z"},"links":{"cited_paper":"/paper/2304.04934","citing_paper":"/paper/2604.04800"},"observation_digest":"sha256:8628cbdbffcebb34e03dda2fa759b27656d8e7cf2235cce1df35e82afcb3df6a","observation_id":"14e18162-322b-483d-83e2-2082ca4f29e0","resolution":{"observed_at":"2026-05-10T21:55:52.790583Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2304.04934","last_updated":"2024-01-27T17:07:46Z","snapshot_observed_at":"2026-08-07T08:29:22.239111Z","submitted_at":"2023-04-11T02:12:02Z","title":"Model Sparsity Can Simplify Machine Unlearning","version":13},"cited_work":{"arxiv_id":"2304.04934","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2304.04934","snapshot_observed_at":"2026-06-28T23:02:46.154205Z","title":"arXiv preprint arXiv:2304.04934 , year=","venue":null,"work_id":"8f76b774-2267-40ab-a6c6-8118032bad7c","year":2023},"citing_paper":{"arxiv_id":"2606.00399","last_updated":"2026-05-29T22:32:40Z","snapshot_observed_at":"2026-08-01T19:45:29.183659Z","submitted_at":"2026-05-29T22:32:40Z","title":"Multi-Objective Reference-Aligned Machine Unlearning","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-06-28T23:00:51.294463Z"},"links":{"cited_paper":"/paper/2304.04934","citing_paper":"/paper/2606.00399"},"observation_digest":"sha256:b44b97e1bfdf8f172b75f2e5a3b7b31a285d8cb20d8468961470a96776ebeb78","observation_id":"fc0c54eb-5a23-4790-9981-cf350d5a99cb","resolution":{"observed_at":"2026-06-28T23:02:46.155654Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2304.04934/citation-record","integrity":"/paper/2304.04934/integrity","json":"/paper/2304.04934/citation-record.json","paper":"/paper/2304.04934"},"outbound":[],"paper":{"arxiv_id":"2304.04934","last_updated":"2024-01-27T17:07:46Z","latest_version":13,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-07T08:29:22.239111Z","submitted_at":"2023-04-11T02:12:02Z","title":"Model Sparsity Can Simplify Machine Unlearning"},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 5 inbound Pith citation observations for arXiv:2304.04934."}