{"as_of":"2026-08-07T23:09:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:b62193acbfb88cbeb70552674f1eeb25416b2423c0aae80604c73a7db5113875","coverage":[{"denominator":32,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":32,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T17:54:17.784536Z","state":"measured"},{"denominator":32,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":32,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2507.09786/citation-record","integrity":"/paper/2507.09786/integrity","json":"/paper/2507.09786/citation-record.json","paper":"/paper/2507.09786"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:54:18.287528Z","title":"Machine unlearning","venue":null,"work_id":"535cf3b6-122a-467a-a626-e1291cdb954e","year":2021},"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":1,"source":"pdf_text","source_observed_at":"2026-08-06T17:54:17.644164Z"},"links":{"citing_paper":"/paper/2507.09786"},"observation_digest":"sha256:703b8b4be0c107fbafc33d02711f74c685517ce6ac19e62f1727edf4e360bc5d","observation_id":"bfd230d8-79c2-4c18-98e8-8adcda7e0511","resolution":{"observed_at":"2026-08-06T17:54:18.292170Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:54:18.273954Z","title":"Towards making systems for- get with machine unlearning","venue":null,"work_id":"763659b3-a4ac-4a58-a6cd-1cb6f2f374a5","year":2015},"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":2,"source":"pdf_text","source_observed_at":"2026-08-06T17:54:17.649052Z"},"links":{"citing_paper":"/paper/2507.09786"},"observation_digest":"sha256:e66a413e38d000002f5cdb3ca033ed1e398b7ad6821eaad014939c1b281de30a","observation_id":"7d1de46a-e130-4435-8a48-eb64ae1e432d","resolution":{"observed_at":"2026-08-06T17:54:18.279232Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:54:18.261075Z","title":"Membership inference attacks from first principles","venue":null,"work_id":"3d62604a-0d47-4293-af77-af88aecd4122","year":2022},"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":3,"source":"pdf_text","source_observed_at":"2026-08-06T17:54:17.653189Z"},"links":{"citing_paper":"/paper/2507.09786"},"observation_digest":"sha256:e695e3271843667cc7d00ee03e9b5521ca8e76b122fd238349f10a28eb534aad","observation_id":"a38dfa9c-32cf-4e8e-970d-99e83befec09","resolution":{"observed_at":"2026-08-06T17:54:18.265937Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:54:18.247773Z","title":"Dataset distillation by matching training trajectories","venue":null,"work_id":"1416f37b-f951-43e2-a086-6dd5ac6a24bd","year":2022},"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":4,"source":"pdf_text","source_observed_at":"2026-08-06T17:54:17.657476Z"},"links":{"citing_paper":"/paper/2507.09786"},"observation_digest":"sha256:49c3f5d767c8878655e1a1d88e0c2c9cb6d570fe3142df556f3b531d74f7f54e","observation_id":"f2f5ca84-e387-44cd-9cae-19f06f7fc976","resolution":{"observed_at":"2026-08-06T17:54:18.252199Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:54:18.234136Z","title":"Boundary unlearning: Rapid forgetting of deep net- works via shifting the decision boundary","venue":null,"work_id":"39f21552-c9bb-4372-8aca-e7b9f681a216","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":5,"source":"pdf_text","source_observed_at":"2026-08-06T17:54:17.661761Z"},"links":{"citing_paper":"/paper/2507.09786"},"observation_digest":"sha256:89898813cbaaa8aba24bab4a498cf7a5e158df6ce1fa4624c5b425dbb07f70f9","observation_id":"4499a1f1-a257-420b-a4e1-092c24b917b8","resolution":{"observed_at":"2026-08-06T17:54:18.238141Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:54:18.220981Z","title":"Can bad teaching induce forgetting? unlearning in deep networks using an incompetent teacher","venue":null,"work_id":"25ecf1d9-7e24-4eaa-8ab3-2c829af842b2","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":6,"source":"pdf_text","source_observed_at":"2026-08-06T17:54:17.667122Z"},"links":{"citing_paper":"/paper/2507.09786"},"observation_digest":"sha256:4879dc742bcd6729644314300238ae2f1197d06cc738498c67c455aca58322a5","observation_id":"0db3e855-1450-4c69-b57b-ecf95c761239","resolution":{"observed_at":"2026-08-06T17:54:18.225299Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:54:18.208947Z","title":"Quickdrop: Ef- ficient federated unlearning via synthetic data generation","venue":null,"work_id":"1dd55ed7-1c6e-4ce1-8032-ba23305518d5","year":2024},"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":7,"source":"pdf_text","source_observed_at":"2026-08-06T17:54:17.672776Z"},"links":{"citing_paper":"/paper/2507.09786"},"observation_digest":"sha256:572e3e0135cfd635089a047e4140bb2edc2dff9329086c1c1ee938c9fe3e5fc6","observation_id":"8411774b-af62-41c1-89e6-de4b283711ef","resolution":{"observed_at":"2026-08-06T17:54:18.213326Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:54:18.195450Z","title":"Making ai forget you: Data deletion in ma- chine learning","venue":null,"work_id":"c4910136-7543-4c20-a6da-5f3d6892c6b6","year":2019},"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":8,"source":"pdf_text","source_observed_at":"2026-08-06T17:54:17.678070Z"},"links":{"citing_paper":"/paper/2507.09786"},"observation_digest":"sha256:24aa3efca18e8172d0135910505c2450565e2d10dbc3789f9343f49366e2ac1b","observation_id":"17c992ec-d6cc-41e9-8149-8f5986a01afa","resolution":{"observed_at":"2026-08-06T17:54:18.199436Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:54:18.181778Z","title":"Eternal sunshine of the spotless net: Selective forgetting in deep networks","venue":null,"work_id":"4f505583-4af8-4f35-98ff-0503b39ba62a","year":2020},"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":9,"source":"pdf_text","source_observed_at":"2026-08-06T17:54:17.681851Z"},"links":{"citing_paper":"/paper/2507.09786"},"observation_digest":"sha256:45438e58a5dbb71771dccec718a10ece1e39b2d35cb17cb4ef1025a27a2856a4","observation_id":"09748e89-2aa2-41f9-9515-fca662c9a1a2","resolution":{"observed_at":"2026-08-06T17:54:18.186501Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:54:18.166205Z","title":"Amne- siac machine learning","venue":null,"work_id":"aef11791-4b53-4f44-8938-6c29ef5b6cd8","year":2021},"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":10,"source":"pdf_text","source_observed_at":"2026-08-06T17:54:17.686489Z"},"links":{"citing_paper":"/paper/2507.09786"},"observation_digest":"sha256:847f057bd6a8903f7da2651613e783cc5a10fa5568193442d359e919158d5522","observation_id":"8c29439d-8b25-47e5-8339-3ecfb402fb10","resolution":{"observed_at":"2026-08-06T17:54:18.172239Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1911.03030","last_updated":"2023-11-08T03:57:25Z","snapshot_observed_at":"2026-08-06T07:29:50.928142Z","submitted_at":"2019-11-08T03:57:41Z","title":"Certified Data Removal from Machine Learning Models","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1911.03030","snapshot_observed_at":"2026-08-06T17:54:17.690487Z","title":"Certified data removal from machine learning models","venue":null,"work_id":null,"year":1911},"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":11,"source":"pdf_text","source_observed_at":"2026-08-06T17:54:17.690487Z"},"links":{"cited_paper":"/paper/1911.03030","citing_paper":"/paper/2507.09786"},"observation_digest":"sha256:142862c9a5881bfb81d8df720252d9ca8fbfb0079fb0682a0e9158f1596eecfd","observation_id":"a5f48d7f-e39d-40b8-b9c2-d0adaecc95c0","resolution":{"observed_at":"2026-08-06T17:54:17.690487Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:54:18.152207Z","title":"Batch normalization: Accelerating deep network training by reducing internal co- variate shift","venue":null,"work_id":"cab4513b-9339-4366-b920-562bb9a73a1e","year":2015},"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":12,"source":"pdf_text","source_observed_at":"2026-08-06T17:54:17.695735Z"},"links":{"citing_paper":"/paper/2507.09786"},"observation_digest":"sha256:79332f0f3609878ef6fc576dcc7ea9b8b0180058153bee790b9c161a50b49eb6","observation_id":"821c83b9-dc60-4340-9c11-126bf449e551","resolution":{"observed_at":"2026-08-06T17:54:18.156623Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:54:18.138040Z","title":"Dataset condensation via efficient synthetic- data parameterization","venue":null,"work_id":"4238534b-57eb-4fae-ac8a-3514266db9d1","year":2022},"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":14,"source":"pdf_text","source_observed_at":"2026-08-06T17:54:17.704787Z"},"links":{"citing_paper":"/paper/2507.09786"},"observation_digest":"sha256:19b5011b503866fffe39f6910f70072698340c3b2005f30deb9ce2c741cc4287","observation_id":"c073debf-3edb-4356-9262-fc38b79cd16a","resolution":{"observed_at":"2026-08-06T17:54:18.143360Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:54:18.122858Z","title":"Towards unbounded machine unlearn- ing","venue":null,"work_id":"636b35ad-9314-48d3-85a5-8a16348391ef","year":1957},"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":15,"source":"pdf_text","source_observed_at":"2026-08-06T17:54:17.709437Z"},"links":{"citing_paper":"/paper/2507.09786"},"observation_digest":"sha256:6948cab60fc1fa497a4206e2640b669747b6e477ebd85bda202b34212663490f","observation_id":"2b564ceb-a819-47cf-abce-bc7ff896fdf6","resolution":{"observed_at":"2026-08-06T17:54:18.128428Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:54:17.713329Z","title":"Distillation robustifies unlearning","venue":null,"work_id":null,"year":2025},"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":16,"source":"pdf_text","source_observed_at":"2026-08-06T17:54:17.713329Z"},"links":{"citing_paper":"/paper/2507.09786"},"observation_digest":"sha256:0c1949b7e75e92554f928ad26ba0d76e4fba45aca3d5d6d3ae530c19867d02d7","observation_id":"bddeec3a-12ea-4109-bc0e-6fdaa6dd683e","resolution":{"observed_at":"2026-08-06T17:54:17.713329Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.06480","last_updated":"2024-10-09T02:14:40Z","snapshot_observed_at":"2026-07-06T19:30:09.298718Z","submitted_at":"2024-10-09T02:14:40Z","title":"TCGU: Data-centric Graph Unlearning based on Transferable Condensation","version":1},"cited_work":{"arxiv_id":"2410.06480","doi":null,"metadata_source":"pith","pith_arxiv_id":"2410.06480","snapshot_observed_at":"2026-08-06T17:54:17.859311Z","title":"TCGU: Data-centric Graph Unlearning based on Transferable Condensation","venue":"cs.LG","work_id":"c5218a2b-ce2b-4b3a-94f4-31943257236d","year":2024},"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":17,"source":"pdf_text","source_observed_at":"2026-08-06T17:54:17.718165Z"},"links":{"cited_paper":"/paper/2410.06480","citing_paper":"/paper/2507.09786"},"observation_digest":"sha256:d93b52b1d91714d660f6acb7ae0ccb8bf7837fc443eb2dde15f7d69c06fe2205","observation_id":"42a685a7-616f-4815-b041-83a0ef65b06f","resolution":{"observed_at":"2026-08-06T17:54:17.866147Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:54:18.108322Z","title":"Mubox: A critical evaluation framework of deep machine unlearning [systematization of knowledge paper]","venue":null,"work_id":"976f1ef9-b5cb-471a-8256-20d51678cb6e","year":2025},"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":18,"source":"pdf_text","source_observed_at":"2026-08-06T17:54:17.723146Z"},"links":{"citing_paper":"/paper/2507.09786"},"observation_digest":"sha256:460f0a44c51a99c5a1c43c4b67da62fc22db7e6a7c57dbbd54e8af872bdfc273","observation_id":"73cf9e6b-2423-452b-ad9f-18f31737c8ad","resolution":{"observed_at":"2026-08-06T17:54:18.112976Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2106.15093","last_updated":"2021-08-16T13:44:38Z","snapshot_observed_at":"2026-08-06T15:13:21.745876Z","submitted_at":"2021-06-29T05:05:58Z","title":"Certifiable Machine Unlearning for Linear Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2106.15093","snapshot_observed_at":"2026-08-06T17:54:17.728024Z","title":"Certifi- able machine unlearning for linear models","venue":null,"work_id":null,"year":2021},"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":19,"source":"pdf_text","source_observed_at":"2026-08-06T17:54:17.728024Z"},"links":{"cited_paper":"/paper/2106.15093","citing_paper":"/paper/2507.09786"},"observation_digest":"sha256:e1112c1696a4988ee58278a6eaed4cd162d3c2d995ea2901029f47d152406247","observation_id":"c28edc61-be2e-4b39-956b-8f0a45cb14b2","resolution":{"observed_at":"2026-08-06T17:54:17.728024Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:54:18.095414Z","title":"Dataset distillation with infinitely wide convolutional networks","venue":null,"work_id":"26fb09a9-b804-4c91-8052-a6d15179c119","year":2021},"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":20,"source":"pdf_text","source_observed_at":"2026-08-06T17:54:17.732926Z"},"links":{"citing_paper":"/paper/2507.09786"},"observation_digest":"sha256:c916b173fec0afdc5bbebcec575efda018044c84152d49ac19e8e43af1442938","observation_id":"525bc1d4-68b3-450b-bfaa-923abd09f1d7","resolution":{"observed_at":"2026-08-06T17:54:18.099676Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:54:18.081764Z","title":"Pruning neural networks without any data by iter- atively conserving synaptic flow","venue":null,"work_id":"71caf05c-d426-4777-a359-53390bfe7cb0","year":2020},"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":21,"source":"pdf_text","source_observed_at":"2026-08-06T17:54:17.737291Z"},"links":{"citing_paper":"/paper/2507.09786"},"observation_digest":"sha256:1fd8f662d592bcc1badda1efc83a8193f0a1c773a585231ec96771034b7ca443","observation_id":"41b4c3c3-46d3-4d96-9873-d3f43038b049","resolution":{"observed_at":"2026-08-06T17:54:18.086990Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:54:18.068126Z","title":"Transfor- mation of arbitrary distributions to the normal distribution with application to eeg test–retest reliability","venue":null,"work_id":"36419d5b-3afc-4c5e-a5ac-b7d3af1ab22f","year":2007},"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":22,"source":"pdf_text","source_observed_at":"2026-08-06T17:54:17.741321Z"},"links":{"citing_paper":"/paper/2507.09786"},"observation_digest":"sha256:bc79d38f77d212c4f2513184dfef9f400543872f0e59e38f2ba3242eac29714b","observation_id":"67d9e63e-9e4f-4ecc-a3d7-a1f989466e5d","resolution":{"observed_at":"2026-08-06T17:54:18.073172Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:54:18.054856Z","title":"Emphasizing dis- criminative features for dataset distillation in complex sce- narios","venue":null,"work_id":"b39737bf-11b9-4193-9638-011721452df8","year":2025},"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":23,"source":"pdf_text","source_observed_at":"2026-08-06T17:54:17.745493Z"},"links":{"citing_paper":"/paper/2507.09786"},"observation_digest":"sha256:4e47f7208f62f3c358a2c9a8591d894a7c89955442fde43493f7016799f0d92e","observation_id":"3bde29b3-10fe-4a09-993f-273700620911","resolution":{"observed_at":"2026-08-06T17:54:18.059421Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1811.10959","last_updated":"2020-02-24T23:25:50Z","snapshot_observed_at":"2026-07-06T07:17:20.813296Z","submitted_at":"2018-11-27T13:17:45Z","title":"Dataset Distillation","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1811.10959","snapshot_observed_at":"2026-08-06T17:54:17.749924Z","title":"Dataset distillation","venue":null,"work_id":null,"year":2018},"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":24,"source":"pdf_text","source_observed_at":"2026-08-06T17:54:17.749924Z"},"links":{"cited_paper":"/paper/1811.10959","citing_paper":"/paper/2507.09786"},"observation_digest":"sha256:8a3731f9849bf06949b168f7c638e53a03f5766e5654ef5d6a3418cb47c26587","observation_id":"fc863b3a-9a01-4d65-9b1f-c776007b5cc8","resolution":{"observed_at":"2026-08-06T17:54:17.749924Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2108.11577","last_updated":"2023-08-07T12:33:20Z","snapshot_observed_at":"2026-08-05T17:29:21.256575Z","submitted_at":"2021-08-26T04:42:24Z","title":"Machine Unlearning of Features and Labels","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2108.11577","snapshot_observed_at":"2026-08-06T17:54:17.754214Z","title":"Machine unlearning of features and la- bels","venue":null,"work_id":null,"year":2021},"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":25,"source":"pdf_text","source_observed_at":"2026-08-06T17:54:17.754214Z"},"links":{"cited_paper":"/paper/2108.11577","citing_paper":"/paper/2507.09786"},"observation_digest":"sha256:1bce6bfdbeeb7ef68c8086b44d4cb9c5463c5af49a93c3aa169cd856ae31d2d2","observation_id":"02ce1109-a11b-4a6c-9107-c7e33bd4f378","resolution":{"observed_at":"2026-08-06T17:54:17.754214Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:54:17.758511Z","title":"Delta- grad: Rapid retraining of machine learning models","venue":null,"work_id":null,"year":2020},"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":26,"source":"pdf_text","source_observed_at":"2026-08-06T17:54:17.758511Z"},"links":{"citing_paper":"/paper/2507.09786"},"observation_digest":"sha256:6119cc983739d84c5228134617178838a153a3963426c4456d94406ec1db3234","observation_id":"c7bc566b-6f0a-4329-a2c8-93daa22924b6","resolution":{"observed_at":"2026-08-06T17:54:17.758511Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:54:18.031399Z","title":"Arcane: An efficient architecture for ex- act machine unlearning","venue":null,"work_id":"2ba09a5d-c6db-426a-80e4-3f863cb2f7f0","year":2022},"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":27,"source":"pdf_text","source_observed_at":"2026-08-06T17:54:17.763244Z"},"links":{"citing_paper":"/paper/2507.09786"},"observation_digest":"sha256:50acf52631b4e81468e56bc1007987fbbb404a64b358cb26fafec5084b00896e","observation_id":"81afb98a-0dcb-4bc6-84cb-6972dc2f225a","resolution":{"observed_at":"2026-08-06T17:54:18.036441Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:54:18.016698Z","title":"Dataset condensation with differ- entiable siamese augmentation","venue":null,"work_id":"b9c3b498-f4d3-423f-9e20-e2680963a862","year":2021},"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":28,"source":"pdf_text","source_observed_at":"2026-08-06T17:54:17.767439Z"},"links":{"citing_paper":"/paper/2507.09786"},"observation_digest":"sha256:aa52c5db106b915df9c8812b7bd74f6255bd6152a2e77ad7402a1f1743ee18dd","observation_id":"56bd069f-73e4-4801-9082-0fb07292227f","resolution":{"observed_at":"2026-08-06T17:54:18.021708Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:54:18.001196Z","title":"Dataset condensation with dis- tribution matching","venue":null,"work_id":"7391c4e7-f85a-4e5e-91cc-3548b0a25d00","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":29,"source":"pdf_text","source_observed_at":"2026-08-06T17:54:17.771722Z"},"links":{"citing_paper":"/paper/2507.09786"},"observation_digest":"sha256:e896b8d7086617a6f15052f33db12b64683e400a52bd776927aca3fc893fecb0","observation_id":"62326631-a588-48df-8dbc-c5e5a9164586","resolution":{"observed_at":"2026-08-06T17:54:18.007005Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2006.05929","last_updated":"2021-03-08T13:31:22Z","snapshot_observed_at":"2026-08-06T01:24:57.284854Z","submitted_at":"2020-06-10T16:30:52Z","title":"Dataset Condensation with Gradient Matching","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2006.05929","snapshot_observed_at":"2026-08-06T17:54:17.775886Z","title":"Dataset condensation with gradient matching","venue":null,"work_id":null,"year":2006},"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":30,"source":"pdf_text","source_observed_at":"2026-08-06T17:54:17.775886Z"},"links":{"cited_paper":"/paper/2006.05929","citing_paper":"/paper/2507.09786"},"observation_digest":"sha256:20870b57c453426b4f8fc35a154f4f7e1bdcaab52ab2cf4cf45c23aa3bd0174d","observation_id":"0bcd7685-6ab4-4d37-9c56-2b9dfad46ea0","resolution":{"observed_at":"2026-08-06T17:54:17.775886Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:54:17.987477Z","title":"Im- proved distribution matching for dataset condensation","venue":null,"work_id":"e2a9094f-d2eb-4eb1-b994-2c10c457614e","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":31,"source":"pdf_text","source_observed_at":"2026-08-06T17:54:17.780022Z"},"links":{"citing_paper":"/paper/2507.09786"},"observation_digest":"sha256:981d4b067473503af14126facff2cf1d7eee6f418400f3ebafa7cab137117fd2","observation_id":"2e17e044-efa0-42d7-a688-54d0b12f5a0c","resolution":{"observed_at":"2026-08-06T17:54:17.991919Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:54:17.973857Z","title":"Decoupled distillation to erase: A general unlearning method for any class-centric tasks","venue":null,"work_id":"1ca7517f-fff3-4f25-9eba-4ee8e2f8f7fb","year":2025},"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":32,"source":"pdf_text","source_observed_at":"2026-08-06T17:54:17.784536Z"},"links":{"citing_paper":"/paper/2507.09786"},"observation_digest":"sha256:54e497926ddbbcd96d7290a7a9705df0a4bfeb29a45c05e6da2b723040a1740c","observation_id":"2b0da8e1-e599-47f6-ae18-7882a278f956","resolution":{"observed_at":"2026-08-06T17:54:17.978360Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2507.09786","last_updated":"2025-08-04T19:45:36Z","latest_version":3,"primary_category":"cs.LG","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"},"reference_resolution":{"displayed":32,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":8,"verified_exact":1,"verified_fuzzy":23},"total_outbound_references":32},"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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 7 August 2026, this Paper Citation Record lists 32 of 32 outbound references and 0 inbound Pith citation observations for arXiv:2507.09786."}