{"as_of":"2026-08-20T19:06:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:19bcfaec76780dd47b1c97f4d07e9f6ce858f58e35a633e6c7046bdcb777bfc2","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":6,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":6,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-20T06:33:59.587034+00:00","state":"measured"},{"denominator":6,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":6,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T15:49:41.287650Z","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-16T15:41:26.076971Z","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:da2538665cae8e906714cf950dbc5f1d2e866798ba2ce5f8629cd1d541d4953f","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-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"}},{"citation":{"cited_paper":{"arxiv_id":"2304.04934","last_updated":"2024-01-27T17:07:46Z","snapshot_observed_at":"2026-08-16T15:41:26.076971Z","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-14T04:49:16.397922Z","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:9376252239bb553564f6d5cc1ce9ab0dddb4bca08e94fdd2a316c832256a3a92","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-16T15:41:26.076971Z","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-18T17:58:42.071864Z","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:7ddf8d9cabc6f8504691f05e14f48fec41808a802e6d347eeab92316ac72bfd2","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-16T15:41:26.076971Z","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-15T15:49:41.287650Z","title":"2304.04934","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.22483","last_updated":"2026-06-21T22:45:05Z","snapshot_observed_at":"2026-08-15T15:41:43.011812Z","submitted_at":"2025-09-26T15:31:32Z","title":"OFMU: Optimization-Driven Framework for Machine Unlearning","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-15T15:49:41.287650Z"},"links":{"cited_paper":"/paper/2304.04934","citing_paper":"/paper/2509.22483"},"observation_digest":"sha256:4d2aba053ce55d80441d57fc3d65a804b808e2822b2cb4388390f4aaf6c1e4d7","observation_id":"9f9c98a1-1137-41ce-b69a-ff249739f47d","resolution":{"observed_at":"2026-08-15T15:49:41.287650Z","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-16T15:41:26.076971Z","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-08-14T12:30:16.595510Z","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:e671b5433cc24718899374a517caa74b26d6eaa0970b1828b18dc2c911342849","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-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"}},{"citation":{"cited_paper":{"arxiv_id":"2304.04934","last_updated":"2024-01-27T17:07:46Z","snapshot_observed_at":"2026-08-16T15:41:26.076971Z","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:0f704b86b0b0dafd226a41bbc3444078ce82aec02d8b6cc188fa01eb366c0a31","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-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/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-16T15:41:26.076971Z","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-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"thesis":"As of 20 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 6 inbound Pith citation observations for arXiv:2304.04934."}