{"as_of":"2026-08-13T14:53:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:839b1bc22f2ecc662a04177d51989fffd683519c2abacfe105d49acc86e25e18","coverage":[{"denominator":47,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":47,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T10:35:58.320218Z","state":"measured"},{"denominator":47,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":47,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-13T06:32:02.005865+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/2412.00126/citation-record","integrity":"/paper/2412.00126/integrity","json":"/paper/2412.00126/citation-record.json","paper":"/paper/2412.00126"},"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-12T10:35:58.732059Z","title":"Scu: An efficient machine unlearning scheme for deep learning enabled semantic communications,","venue":null,"work_id":"74d0a234-7481-48a0-a8d1-953f9431d598","year":2025},"citing_paper":{"arxiv_id":"2412.00126","last_updated":"2025-03-10T00:54:33Z","snapshot_observed_at":"2026-08-12T10:29:32.724323Z","submitted_at":"2024-11-28T12:52:48Z","title":"Streamlined Federated Unlearning: Unite as One to Be Highly Efficient","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-12T10:35:58.150177Z"},"links":{"citing_paper":"/paper/2412.00126"},"observation_digest":"sha256:cf28d0e87867cda6e14b93f77913892c288b8e75aed128b6ae02b0b49e934000","observation_id":"dd67d26b-4237-412b-ae6d-68b07c7ed2a7","resolution":{"observed_at":"2026-08-12T10:35:58.735781Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T10:35:58.721273Z","title":"Zero- shot machine unlearning,","venue":null,"work_id":"67f9880f-994e-472a-b897-20c5dbe13d99","year":2023},"citing_paper":{"arxiv_id":"2412.00126","last_updated":"2025-03-10T00:54:33Z","snapshot_observed_at":"2026-08-12T10:29:32.724323Z","submitted_at":"2024-11-28T12:52:48Z","title":"Streamlined Federated Unlearning: Unite as One to Be Highly Efficient","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-12T10:35:58.154064Z"},"links":{"citing_paper":"/paper/2412.00126"},"observation_digest":"sha256:f2c97ae81a4f91f68c7185586144cb8f6a250eeae94d12a3f4f8319af9a8d528","observation_id":"101cfa2b-7780-43e7-b9b7-b5cbb308bd29","resolution":{"observed_at":"2026-08-12T10:35:58.724685Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T10:35:58.157429Z","title":"Communication-efficient learning of deep networks from decentralized data,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2412.00126","last_updated":"2025-03-10T00:54:33Z","snapshot_observed_at":"2026-08-12T10:29:32.724323Z","submitted_at":"2024-11-28T12:52:48Z","title":"Streamlined Federated Unlearning: Unite as One to Be Highly Efficient","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-12T10:35:58.157429Z"},"links":{"citing_paper":"/paper/2412.00126"},"observation_digest":"sha256:cf3ef948ae69b3d39eeed8a628fae98400c5d014cc9b2ad97622fe91ca080990","observation_id":"fc415a67-048b-45e0-a282-88d220086f40","resolution":{"observed_at":"2026-08-12T10:35:58.157429Z","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-12T10:35:58.705510Z","title":"General data protection regulation (gdpr),","venue":null,"work_id":"241165ad-7873-44a0-85c5-33f42e8ad7cd","year":2016},"citing_paper":{"arxiv_id":"2412.00126","last_updated":"2025-03-10T00:54:33Z","snapshot_observed_at":"2026-08-12T10:29:32.724323Z","submitted_at":"2024-11-28T12:52:48Z","title":"Streamlined Federated Unlearning: Unite as One to Be Highly Efficient","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-12T10:35:58.161264Z"},"links":{"citing_paper":"/paper/2412.00126"},"observation_digest":"sha256:4e0b87cb8e1bedfee8325cfd6ce847f2afbb3ddb3737a574119d1f57f4794a7b","observation_id":"53da5d6d-494c-47b1-8842-f68a515359b2","resolution":{"observed_at":"2026-08-12T10:35:58.708922Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T10:35:58.694968Z","title":"Klein, Canadian Privacy: Data Protection and Policy for the Practi- tioner","venue":null,"work_id":"d4fa8e78-8f58-4dd8-968f-500b317e7879","year":2020},"citing_paper":{"arxiv_id":"2412.00126","last_updated":"2025-03-10T00:54:33Z","snapshot_observed_at":"2026-08-12T10:29:32.724323Z","submitted_at":"2024-11-28T12:52:48Z","title":"Streamlined Federated Unlearning: Unite as One to Be Highly Efficient","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-12T10:35:58.165103Z"},"links":{"citing_paper":"/paper/2412.00126"},"observation_digest":"sha256:48bf55a6a9bbc812b2bd7dbc336a9e5bebdf49a6bde40346b45e2f59164b773b","observation_id":"4ddda57a-7bb7-45db-b468-b687f05da43d","resolution":{"observed_at":"2026-08-12T10:35:58.698660Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T10:35:58.168378Z","title":"A survey on federated unlearning: Challenges, methods, and future directions,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.00126","last_updated":"2025-03-10T00:54:33Z","snapshot_observed_at":"2026-08-12T10:29:32.724323Z","submitted_at":"2024-11-28T12:52:48Z","title":"Streamlined Federated Unlearning: Unite as One to Be Highly Efficient","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-12T10:35:58.168378Z"},"links":{"citing_paper":"/paper/2412.00126"},"observation_digest":"sha256:f16be396750208883233130a2e4cffc261ef5db4fccf9276c541031c01d99780","observation_id":"bd8729e8-5bd8-400e-831b-a2f23708e4be","resolution":{"observed_at":"2026-08-12T10:35:58.168378Z","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-12T10:35:58.171847Z","title":"Machine unlearning,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2412.00126","last_updated":"2025-03-10T00:54:33Z","snapshot_observed_at":"2026-08-12T10:29:32.724323Z","submitted_at":"2024-11-28T12:52:48Z","title":"Streamlined Federated Unlearning: Unite as One to Be Highly Efficient","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-12T10:35:58.171847Z"},"links":{"citing_paper":"/paper/2412.00126"},"observation_digest":"sha256:eb4c92787ff745d3d43d95024de261646951fd37356b6d774ee4072004558e45","observation_id":"75db9206-80f6-4b73-bd28-78507f8b79f8","resolution":{"observed_at":"2026-08-12T10:35:58.171847Z","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-12T10:35:58.175642Z","title":"Can bad teaching induce forgetting? unlearning in deep networks using an incompetent teacher,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.00126","last_updated":"2025-03-10T00:54:33Z","snapshot_observed_at":"2026-08-12T10:29:32.724323Z","submitted_at":"2024-11-28T12:52:48Z","title":"Streamlined Federated Unlearning: Unite as One to Be Highly Efficient","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-12T10:35:58.175642Z"},"links":{"citing_paper":"/paper/2412.00126"},"observation_digest":"sha256:84aec339e0afb6b8d56780f9a03ed97e958fa11901bd805689eadaf0e44b4112","observation_id":"614f9c83-a82e-469f-8c4c-c80832eb851c","resolution":{"observed_at":"2026-08-12T10:35:58.175642Z","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-12T10:35:58.668004Z","title":"Machine unlearning via rep- resentation forgetting with parameter self-sharing,","venue":null,"work_id":"6d5d5ff9-fb56-4e67-9607-45ce1969781d","year":2023},"citing_paper":{"arxiv_id":"2412.00126","last_updated":"2025-03-10T00:54:33Z","snapshot_observed_at":"2026-08-12T10:29:32.724323Z","submitted_at":"2024-11-28T12:52:48Z","title":"Streamlined Federated Unlearning: Unite as One to Be Highly Efficient","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-12T10:35:58.179296Z"},"links":{"citing_paper":"/paper/2412.00126"},"observation_digest":"sha256:ee8feb111dc0fcbbb746d18a97ea4c80ec8dbeb3d3454b24428771b8b021199a","observation_id":"13b8ca1d-c8af-4a3e-95b8-85aa85de6d50","resolution":{"observed_at":"2026-08-12T10:35:58.672236Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T10:35:58.658338Z","title":"Forgetting and remembering are both you need: Balanced graph structure unlearning,","venue":null,"work_id":"78605f1a-bd45-4423-ac98-5d7a23d44ec8","year":2024},"citing_paper":{"arxiv_id":"2412.00126","last_updated":"2025-03-10T00:54:33Z","snapshot_observed_at":"2026-08-12T10:29:32.724323Z","submitted_at":"2024-11-28T12:52:48Z","title":"Streamlined Federated Unlearning: Unite as One to Be Highly Efficient","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-12T10:35:58.183249Z"},"links":{"citing_paper":"/paper/2412.00126"},"observation_digest":"sha256:d00ae5d56bca5b631e09abb776802bc663c3e5ffce262d0a5c8b40c4a51cd80a","observation_id":"1a5a5db1-876e-4b83-9619-e0b09933f246","resolution":{"observed_at":"2026-08-12T10:35:58.661995Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2403.02437","last_updated":"2025-04-07T19:55:57Z","snapshot_observed_at":"2026-08-13T04:03:39.287770Z","submitted_at":"2024-03-04T19:35:08Z","title":"A Survey on Federated Unlearning: Challenges and Opportunities","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.02437","snapshot_observed_at":"2026-08-12T10:35:58.187301Z","title":"Sok: Challenges and opportu- nities in federated unlearning,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.00126","last_updated":"2025-03-10T00:54:33Z","snapshot_observed_at":"2026-08-12T10:29:32.724323Z","submitted_at":"2024-11-28T12:52:48Z","title":"Streamlined Federated Unlearning: Unite as One to Be Highly Efficient","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-12T10:35:58.187301Z"},"links":{"cited_paper":"/paper/2403.02437","citing_paper":"/paper/2412.00126"},"observation_digest":"sha256:93b4b1c59fee39946771cfa7464829d8f1369b0462096739c6cdf7fcf3db0fc0","observation_id":"d17b2697-b94b-444d-8d89-cbf833a9ce74","resolution":{"observed_at":"2026-08-12T10:35:58.187301Z","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-12T10:35:58.191111Z","title":"Fedrecover: Recovering from poisoning attacks in federated learning using historical information,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.00126","last_updated":"2025-03-10T00:54:33Z","snapshot_observed_at":"2026-08-12T10:29:32.724323Z","submitted_at":"2024-11-28T12:52:48Z","title":"Streamlined Federated Unlearning: Unite as One to Be Highly Efficient","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-12T10:35:58.191111Z"},"links":{"citing_paper":"/paper/2412.00126"},"observation_digest":"sha256:ce3302b4e4f9bee2a63732b584e70769e5cdfc8a30b478809d970798400e866d","observation_id":"d8f77efe-116d-4ada-9799-216281ed2041","resolution":{"observed_at":"2026-08-12T10:35:58.191111Z","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-12T10:35:58.194833Z","title":"Revfrf: Enabling cross-domain random forest training with revocable federated learning,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2412.00126","last_updated":"2025-03-10T00:54:33Z","snapshot_observed_at":"2026-08-12T10:29:32.724323Z","submitted_at":"2024-11-28T12:52:48Z","title":"Streamlined Federated Unlearning: Unite as One to Be Highly Efficient","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-12T10:35:58.194833Z"},"links":{"citing_paper":"/paper/2412.00126"},"observation_digest":"sha256:e73efb76c38eb6bda6dfcf9879f3a5da7d7bc0a997b20dbab4a65d8ecfd0be5d","observation_id":"e3562e57-9057-46ea-825c-86ce60536f96","resolution":{"observed_at":"2026-08-12T10:35:58.194833Z","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-12T10:35:58.636828Z","title":"Mit- igating poor data quality impact with federated unlearning for human- centric metaverse,","venue":null,"work_id":"9b9faa23-d331-4772-a99b-3e9180857e11","year":2024},"citing_paper":{"arxiv_id":"2412.00126","last_updated":"2025-03-10T00:54:33Z","snapshot_observed_at":"2026-08-12T10:29:32.724323Z","submitted_at":"2024-11-28T12:52:48Z","title":"Streamlined Federated Unlearning: Unite as One to Be Highly Efficient","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-12T10:35:58.198835Z"},"links":{"citing_paper":"/paper/2412.00126"},"observation_digest":"sha256:16eae3b7836e5b84fbb1b188b535006966384b8bbbb3263dd3be39db40fdac8b","observation_id":"f738f22f-f503-4d97-b13c-9c6652d4fa40","resolution":{"observed_at":"2026-08-12T10:35:58.640350Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T10:35:58.627337Z","title":"Unlearning backdoor attacks in federated learning,","venue":null,"work_id":"0a0bd282-a759-479a-b81f-5ae0ac861b0c","year":2023},"citing_paper":{"arxiv_id":"2412.00126","last_updated":"2025-03-10T00:54:33Z","snapshot_observed_at":"2026-08-12T10:29:32.724323Z","submitted_at":"2024-11-28T12:52:48Z","title":"Streamlined Federated Unlearning: Unite as One to Be Highly Efficient","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-12T10:35:58.202741Z"},"links":{"citing_paper":"/paper/2412.00126"},"observation_digest":"sha256:9196a75cfec13dc1ad1b19f4bbba56e74db2ef38689c218452691f6f66a7887d","observation_id":"cb222768-8a88-4b11-9de7-e75606af41ec","resolution":{"observed_at":"2026-08-12T10:35:58.630576Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T10:35:58.617219Z","title":"Fedrecov- ery: Differentially private machine unlearning for federated learning frameworks,","venue":null,"work_id":"4fcebf19-2f82-4fd2-b950-5c5689433104","year":2023},"citing_paper":{"arxiv_id":"2412.00126","last_updated":"2025-03-10T00:54:33Z","snapshot_observed_at":"2026-08-12T10:29:32.724323Z","submitted_at":"2024-11-28T12:52:48Z","title":"Streamlined Federated Unlearning: Unite as One to Be Highly Efficient","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-12T10:35:58.206922Z"},"links":{"citing_paper":"/paper/2412.00126"},"observation_digest":"sha256:bb5ccabaa115e2e1cce81c6a6e23f47e65db38c90958fdb30d232fff84afcdbf","observation_id":"12528e36-f178-440f-8450-db659c13f7fa","resolution":{"observed_at":"2026-08-12T10:35:58.620942Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2306.02216","last_updated":"2026-05-24T17:58:44Z","snapshot_observed_at":"2026-08-13T11:25:03.095163Z","submitted_at":"2023-06-03T23:53:57Z","title":"Forgettable Federated Linear Learning with Certified Data Unlearning","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2306.02216","snapshot_observed_at":"2026-08-12T10:35:58.210932Z","title":"Forgettable federated linear learning with certified data removal,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.00126","last_updated":"2025-03-10T00:54:33Z","snapshot_observed_at":"2026-08-12T10:29:32.724323Z","submitted_at":"2024-11-28T12:52:48Z","title":"Streamlined Federated Unlearning: Unite as One to Be Highly Efficient","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-12T10:35:58.210932Z"},"links":{"cited_paper":"/paper/2306.02216","citing_paper":"/paper/2412.00126"},"observation_digest":"sha256:0eab905d1a6af131db78fc025c3560f23b2e542e7f689b61095c9e7eee72208a","observation_id":"28cd1e75-3b50-45dd-b50d-d8511018da16","resolution":{"observed_at":"2026-08-12T10:35:58.210932Z","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-12T10:35:58.214981Z","title":"The right to be forgotten in federated learning: An efficient realization with rapid retraining,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2412.00126","last_updated":"2025-03-10T00:54:33Z","snapshot_observed_at":"2026-08-12T10:29:32.724323Z","submitted_at":"2024-11-28T12:52:48Z","title":"Streamlined Federated Unlearning: Unite as One to Be Highly Efficient","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-12T10:35:58.214981Z"},"links":{"citing_paper":"/paper/2412.00126"},"observation_digest":"sha256:809eba268d3712e57c939afb2248d400611d9e7f57330fcff4b101ae597ab2ff","observation_id":"2dc230ab-b625-40e0-b780-c085f5aed6db","resolution":{"observed_at":"2026-08-12T10:35:58.214981Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2307.03363","last_updated":"2025-03-13T15:10:10Z","snapshot_observed_at":"2026-08-13T13:15:42.292176Z","submitted_at":"2023-07-07T03:07:26Z","title":"Class-wise Federated Unlearning: Harnessing Active Forgetting with Teacher-Student Memory Generation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2307.03363","snapshot_observed_at":"2026-08-12T10:35:58.218042Z","title":"Federated unlearning via active forgetting,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.00126","last_updated":"2025-03-10T00:54:33Z","snapshot_observed_at":"2026-08-12T10:29:32.724323Z","submitted_at":"2024-11-28T12:52:48Z","title":"Streamlined Federated Unlearning: Unite as One to Be Highly Efficient","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-12T10:35:58.218042Z"},"links":{"cited_paper":"/paper/2307.03363","citing_paper":"/paper/2412.00126"},"observation_digest":"sha256:ba9995a2cc594a73568638bb0dc2e78cef43af1bc695d13fb2c8b3d4f8c214ea","observation_id":"31f77ea2-652f-4d3c-8bfb-ade1a1e8ed84","resolution":{"observed_at":"2026-08-12T10:35:58.218042Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2311.15603","last_updated":"2024-12-06T13:11:19Z","snapshot_observed_at":"2026-08-13T05:17:18.555794Z","submitted_at":"2023-11-27T07:53:44Z","title":"QuickDrop: Efficient Federated Unlearning by Integrated Dataset Distillation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2311.15603","snapshot_observed_at":"2026-08-12T10:35:58.222356Z","title":"Quickdrop: Efficient federated unlearning by integrated dataset distillation,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.00126","last_updated":"2025-03-10T00:54:33Z","snapshot_observed_at":"2026-08-12T10:29:32.724323Z","submitted_at":"2024-11-28T12:52:48Z","title":"Streamlined Federated Unlearning: Unite as One to Be Highly Efficient","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-12T10:35:58.222356Z"},"links":{"cited_paper":"/paper/2311.15603","citing_paper":"/paper/2412.00126"},"observation_digest":"sha256:49e29d9b53bc8683862ced4502c0de47876e3eb29db47cbba50e1d7f1ff7c70e","observation_id":"3e575b04-96c2-4fe8-ba4d-6815cde3ae7c","resolution":{"observed_at":"2026-08-12T10:35:58.222356Z","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-12T10:35:58.225669Z","title":"Forget-svgd: Particle- based bayesian federated unlearning,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2412.00126","last_updated":"2025-03-10T00:54:33Z","snapshot_observed_at":"2026-08-12T10:29:32.724323Z","submitted_at":"2024-11-28T12:52:48Z","title":"Streamlined Federated Unlearning: Unite as One to Be Highly Efficient","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-12T10:35:58.225669Z"},"links":{"citing_paper":"/paper/2412.00126"},"observation_digest":"sha256:5e7ac4c670820cdd555cd30b88faaee1f80fbcaf9e6c6a015d7064bed7021320","observation_id":"f9338e3a-f8b7-49f8-83bb-a796a2f6fca5","resolution":{"observed_at":"2026-08-12T10:35:58.225669Z","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-12T10:35:58.596863Z","title":"Compressed particle-based feder- ated bayesian learning and unlearning,","venue":null,"work_id":"e8f87309-8392-40c3-89bb-cd785085201f","year":2022},"citing_paper":{"arxiv_id":"2412.00126","last_updated":"2025-03-10T00:54:33Z","snapshot_observed_at":"2026-08-12T10:29:32.724323Z","submitted_at":"2024-11-28T12:52:48Z","title":"Streamlined Federated Unlearning: Unite as One to Be Highly Efficient","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-12T10:35:58.228691Z"},"links":{"citing_paper":"/paper/2412.00126"},"observation_digest":"sha256:e1e3f52b7caf9e8b584c8987e71cfe0e977686e98ab1997a8461e66e65e3d4fd","observation_id":"c2402038-007e-4142-8091-0dd4842ebf15","resolution":{"observed_at":"2026-08-12T10:35:58.600317Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T10:35:58.587623Z","title":"Fedharmony: Unlearning scanner bias with distributed data,","venue":null,"work_id":"15c375b9-f5d3-4ef8-9349-9bc0df95a201","year":2022},"citing_paper":{"arxiv_id":"2412.00126","last_updated":"2025-03-10T00:54:33Z","snapshot_observed_at":"2026-08-12T10:29:32.724323Z","submitted_at":"2024-11-28T12:52:48Z","title":"Streamlined Federated Unlearning: Unite as One to Be Highly Efficient","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-12T10:35:58.231892Z"},"links":{"citing_paper":"/paper/2412.00126"},"observation_digest":"sha256:c6cad50d2744cc42bd25505bd8345b4dff5fc96d4343f5a6d99e7e4c4f0af972","observation_id":"1491873b-7292-49f3-b2cd-eb8b0c36e11f","resolution":{"observed_at":"2026-08-12T10:35:58.590554Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T10:35:58.576820Z","title":"Bfu: Bayesian federated unlearning with parameter self-sharing,","venue":null,"work_id":"a2251bf4-ca98-436e-9873-ee0feed45f43","year":2023},"citing_paper":{"arxiv_id":"2412.00126","last_updated":"2025-03-10T00:54:33Z","snapshot_observed_at":"2026-08-12T10:29:32.724323Z","submitted_at":"2024-11-28T12:52:48Z","title":"Streamlined Federated Unlearning: Unite as One to Be Highly Efficient","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-12T10:35:58.235283Z"},"links":{"citing_paper":"/paper/2412.00126"},"observation_digest":"sha256:529654f3e8cf94e5662688a3782ccba6bb129429cfeb9c298c9c92449e1afb1f","observation_id":"00cbd13a-e8c8-46b9-9796-1d326325071e","resolution":{"observed_at":"2026-08-12T10:35:58.580726Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T10:35:58.239179Z","title":"Heterogeneous federated knowledge graph embedding learning and unlearning,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.00126","last_updated":"2025-03-10T00:54:33Z","snapshot_observed_at":"2026-08-12T10:29:32.724323Z","submitted_at":"2024-11-28T12:52:48Z","title":"Streamlined Federated Unlearning: Unite as One to Be Highly Efficient","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-12T10:35:58.239179Z"},"links":{"citing_paper":"/paper/2412.00126"},"observation_digest":"sha256:731a711780f202899606cd210af1f4dd3b6541086ee2fd485c139ae614e1e647","observation_id":"62591b76-ac0e-4694-8b98-816a7ee44c48","resolution":{"observed_at":"2026-08-12T10:35:58.239179Z","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-12T10:35:58.242584Z","title":"Asynchronous federated unlearning,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.00126","last_updated":"2025-03-10T00:54:33Z","snapshot_observed_at":"2026-08-12T10:29:32.724323Z","submitted_at":"2024-11-28T12:52:48Z","title":"Streamlined Federated Unlearning: Unite as One to Be Highly Efficient","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-12T10:35:58.242584Z"},"links":{"citing_paper":"/paper/2412.00126"},"observation_digest":"sha256:a7bc8d6876b541b4725667010a84cfceae18d086439a3f2dca76c86bd1cb83bd","observation_id":"f884a821-a902-43a5-ae5b-5fe6dc7d8fe9","resolution":{"observed_at":"2026-08-12T10:35:58.242584Z","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-12T10:35:58.555518Z","title":"Federaser: Enabling efficient client-level data removal from federated learning models,","venue":null,"work_id":"56443a38-8dce-41c8-bb9c-ce0950983cdd","year":2021},"citing_paper":{"arxiv_id":"2412.00126","last_updated":"2025-03-10T00:54:33Z","snapshot_observed_at":"2026-08-12T10:29:32.724323Z","submitted_at":"2024-11-28T12:52:48Z","title":"Streamlined Federated Unlearning: Unite as One to Be Highly Efficient","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-12T10:35:58.246162Z"},"links":{"citing_paper":"/paper/2412.00126"},"observation_digest":"sha256:ba2df0ed4ec50dc8eae8e1b48574a021c00cfd600313fdd4dab406f8b5269c37","observation_id":"167ff849-b4ec-4cbc-bf8f-de07e12cdfaa","resolution":{"observed_at":"2026-08-12T10:35:58.559071Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2401.08216","last_updated":"2024-01-19T05:31:07Z","snapshot_observed_at":"2026-08-13T04:42:11.740527Z","submitted_at":"2024-01-16T09:02:34Z","title":"Towards Efficient and Certified Recovery from Poisoning Attacks in Federated Learning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.08216","snapshot_observed_at":"2026-08-12T10:35:58.249994Z","title":"Towards efficient and certified recovery from poisoning attacks in federated learning,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.00126","last_updated":"2025-03-10T00:54:33Z","snapshot_observed_at":"2026-08-12T10:29:32.724323Z","submitted_at":"2024-11-28T12:52:48Z","title":"Streamlined Federated Unlearning: Unite as One to Be Highly Efficient","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-12T10:35:58.249994Z"},"links":{"cited_paper":"/paper/2401.08216","citing_paper":"/paper/2412.00126"},"observation_digest":"sha256:fc362cbb8a151abc750dcb43455e691d9ddbd0b5ee43f061cab21377a8121e88","observation_id":"b130dee9-a3a9-4762-b84d-262d9f938404","resolution":{"observed_at":"2026-08-12T10:35:58.249994Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2401.11018","last_updated":"2024-01-19T20:35:02Z","snapshot_observed_at":"2026-08-13T04:38:53.564923Z","submitted_at":"2024-01-19T20:35:02Z","title":"Communication Efficient and Provable Federated Unlearning","version":1},"cited_work":{"arxiv_id":"2401.11018","doi":null,"metadata_source":"pith","pith_arxiv_id":"2401.11018","snapshot_observed_at":"2026-08-12T10:35:58.367386Z","title":"Communication Efficient and Provable Federated Unlearning","venue":"cs.LG","work_id":"98279a76-1d7d-4ff6-b9a7-b2196e9fe003","year":2024},"citing_paper":{"arxiv_id":"2412.00126","last_updated":"2025-03-10T00:54:33Z","snapshot_observed_at":"2026-08-12T10:29:32.724323Z","submitted_at":"2024-11-28T12:52:48Z","title":"Streamlined Federated Unlearning: Unite as One to Be Highly Efficient","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-12T10:35:58.254176Z"},"links":{"cited_paper":"/paper/2401.11018","citing_paper":"/paper/2412.00126"},"observation_digest":"sha256:96760d32f4137cdb99ebf3a2164a4006b07ca016af3f352a951d94dd4c88f07b","observation_id":"25c469d5-958e-49d1-be95-39573c52db38","resolution":{"observed_at":"2026-08-12T10:35:58.373159Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T10:35:58.545166Z","title":"Federated unlearning for on-device recommendation,","venue":null,"work_id":"02393955-6fca-4ef9-8fb3-18ea7f645d5c","year":2023},"citing_paper":{"arxiv_id":"2412.00126","last_updated":"2025-03-10T00:54:33Z","snapshot_observed_at":"2026-08-12T10:29:32.724323Z","submitted_at":"2024-11-28T12:52:48Z","title":"Streamlined Federated Unlearning: Unite as One to Be Highly Efficient","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-12T10:35:58.257966Z"},"links":{"citing_paper":"/paper/2412.00126"},"observation_digest":"sha256:f08300069210a95746b6ee74042bce341dafcbf28c2bc58793f72fcd7c91d146","observation_id":"7d3d6641-e801-40cb-a6a9-3b5d5d0c1b53","resolution":{"observed_at":"2026-08-12T10:35:58.548966Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T10:35:58.534685Z","title":"Fast federated machine unlearning with nonlinear functional theory,","venue":null,"work_id":"81f00668-5cdb-49bd-9de5-70387e77184e","year":2023},"citing_paper":{"arxiv_id":"2412.00126","last_updated":"2025-03-10T00:54:33Z","snapshot_observed_at":"2026-08-12T10:29:32.724323Z","submitted_at":"2024-11-28T12:52:48Z","title":"Streamlined Federated Unlearning: Unite as One to Be Highly Efficient","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-12T10:35:58.261794Z"},"links":{"citing_paper":"/paper/2412.00126"},"observation_digest":"sha256:e4d0f4f9ece424e7c648100ec5e3005baf65141058f8762bde6bac94389e082c","observation_id":"d94529a0-02bf-4dbc-aeaf-fd28d33bc414","resolution":{"observed_at":"2026-08-12T10:35:58.538555Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T10:35:58.525261Z","title":"A revocation key- based approach towards efficient federated unlearning,","venue":null,"work_id":"7fa84a58-50ad-4aca-9d47-fdd32011418a","year":2023},"citing_paper":{"arxiv_id":"2412.00126","last_updated":"2025-03-10T00:54:33Z","snapshot_observed_at":"2026-08-12T10:29:32.724323Z","submitted_at":"2024-11-28T12:52:48Z","title":"Streamlined Federated Unlearning: Unite as One to Be Highly Efficient","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-12T10:35:58.265582Z"},"links":{"citing_paper":"/paper/2412.00126"},"observation_digest":"sha256:9b0ea0233905b36ed14b4fcd75d93e40ea48de24050ef8412c8d6e05664aa5b9","observation_id":"f9e9d7a6-774f-4aff-8bef-64de6ed945ea","resolution":{"observed_at":"2026-08-12T10:35:58.528716Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T10:35:58.515746Z","title":"Edge caching with federated unlearning for low-latency v2x communications,","venue":null,"work_id":"12efcca1-35e0-421c-a884-a67821ea0ba0","year":2024},"citing_paper":{"arxiv_id":"2412.00126","last_updated":"2025-03-10T00:54:33Z","snapshot_observed_at":"2026-08-12T10:29:32.724323Z","submitted_at":"2024-11-28T12:52:48Z","title":"Streamlined Federated Unlearning: Unite as One to Be Highly Efficient","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-12T10:35:58.269206Z"},"links":{"citing_paper":"/paper/2412.00126"},"observation_digest":"sha256:3734d7af0048f5223d88cbb15fd5dfbc32dd779fd44f86eb4da36aa0f1f211a9","observation_id":"bf9112de-a7f6-4a72-85ab-42455acdf72c","resolution":{"observed_at":"2026-08-12T10:35:58.519360Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T10:35:58.505255Z","title":"Verifi: Towards verifiable federated unlearning,","venue":null,"work_id":"ab576692-9aa1-4830-be76-09d2956d28aa","year":2024},"citing_paper":{"arxiv_id":"2412.00126","last_updated":"2025-03-10T00:54:33Z","snapshot_observed_at":"2026-08-12T10:29:32.724323Z","submitted_at":"2024-11-28T12:52:48Z","title":"Streamlined Federated Unlearning: Unite as One to Be Highly Efficient","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-12T10:35:58.272679Z"},"links":{"citing_paper":"/paper/2412.00126"},"observation_digest":"sha256:aef4378187175faf0df2f5e5a02f00f9914c3587067a41effc2c33a284b61ffc","observation_id":"818ded84-5f57-4f8b-9799-94b9366093b2","resolution":{"observed_at":"2026-08-12T10:35:58.508874Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T10:35:58.494006Z","title":"Federated unlearning with momentum degradation,","venue":null,"work_id":"8559c301-4ff9-4fdb-81b2-239b9d4b5baa","year":2024},"citing_paper":{"arxiv_id":"2412.00126","last_updated":"2025-03-10T00:54:33Z","snapshot_observed_at":"2026-08-12T10:29:32.724323Z","submitted_at":"2024-11-28T12:52:48Z","title":"Streamlined Federated Unlearning: Unite as One to Be Highly Efficient","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-12T10:35:58.276343Z"},"links":{"citing_paper":"/paper/2412.00126"},"observation_digest":"sha256:90ca1acee1f90970efa554cc263d77e91df46b22de0dcd3fa007b245f9067bf6","observation_id":"1208b572-f71a-4bbb-b472-4c9a97545185","resolution":{"observed_at":"2026-08-12T10:35:58.498342Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T10:35:58.280003Z","title":"Federated unlearning via class- discriminative pruning,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2412.00126","last_updated":"2025-03-10T00:54:33Z","snapshot_observed_at":"2026-08-12T10:29:32.724323Z","submitted_at":"2024-11-28T12:52:48Z","title":"Streamlined Federated Unlearning: Unite as One to Be Highly Efficient","version":2},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-12T10:35:58.280003Z"},"links":{"citing_paper":"/paper/2412.00126"},"observation_digest":"sha256:e317d5f635592bf6e81e8ed99b7b0cc12d11e6998ba835394316cfd1518d772d","observation_id":"c12d7608-ade2-4c0d-a925-78b763371a98","resolution":{"observed_at":"2026-08-12T10:35:58.280003Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2207.05521","last_updated":"2023-10-20T19:57:54Z","snapshot_observed_at":"2026-08-02T18:22:39.662676Z","submitted_at":"2022-07-12T13:24:23Z","title":"Federated Unlearning: How to Efficiently Erase a Client in FL?","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2207.05521","snapshot_observed_at":"2026-08-12T10:35:58.283388Z","title":"Federated un- learning: How to efficiently erase a client in fl?","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2412.00126","last_updated":"2025-03-10T00:54:33Z","snapshot_observed_at":"2026-08-12T10:29:32.724323Z","submitted_at":"2024-11-28T12:52:48Z","title":"Streamlined Federated Unlearning: Unite as One to Be Highly Efficient","version":2},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-12T10:35:58.283388Z"},"links":{"cited_paper":"/paper/2207.05521","citing_paper":"/paper/2412.00126"},"observation_digest":"sha256:19b33bd75dfb47aa63b1f83e9414b64525e593c755c6acde7fbf5e0584bf2095","observation_id":"84fb2c50-f974-495b-8ef0-567a0ca57660","resolution":{"observed_at":"2026-08-12T10:35:58.283388Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2302.12448","last_updated":"2023-02-24T04:29:44Z","snapshot_observed_at":"2026-08-13T12:38:19.045273Z","submitted_at":"2023-02-24T04:29:44Z","title":"Subspace based Federated Unlearning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2302.12448","snapshot_observed_at":"2026-08-12T10:35:58.286521Z","title":"Subspace based federated unlearning,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.00126","last_updated":"2025-03-10T00:54:33Z","snapshot_observed_at":"2026-08-12T10:29:32.724323Z","submitted_at":"2024-11-28T12:52:48Z","title":"Streamlined Federated Unlearning: Unite as One to Be Highly Efficient","version":2},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-12T10:35:58.286521Z"},"links":{"cited_paper":"/paper/2302.12448","citing_paper":"/paper/2412.00126"},"observation_digest":"sha256:0628747c56999399fc59b81f4de2cb41429f53b97ef3ac998f57ffe95de33fcd","observation_id":"71738d2e-bcdb-4e7f-8714-6d7847c922f7","resolution":{"observed_at":"2026-08-12T10:35:58.286521Z","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-12T10:35:58.290343Z","title":"Federated unlearning: Guarantee the right of clients to forget,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2412.00126","last_updated":"2025-03-10T00:54:33Z","snapshot_observed_at":"2026-08-12T10:29:32.724323Z","submitted_at":"2024-11-28T12:52:48Z","title":"Streamlined Federated Unlearning: Unite as One to Be Highly Efficient","version":2},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-12T10:35:58.290343Z"},"links":{"citing_paper":"/paper/2412.00126"},"observation_digest":"sha256:34d2d029cf97805cc63719f356f659be801d65e1a770c7ee5dafb438a129f58d","observation_id":"753298a9-c131-4fda-9052-ea9ec228ad2c","resolution":{"observed_at":"2026-08-12T10:35:58.290343Z","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-12T10:35:58.472532Z","title":"Fedu: Federated unlearning via user-side influence approximation forgetting,","venue":null,"work_id":"007f0bac-1a39-4839-b44f-4f0a6f5b74ac","year":2024},"citing_paper":{"arxiv_id":"2412.00126","last_updated":"2025-03-10T00:54:33Z","snapshot_observed_at":"2026-08-12T10:29:32.724323Z","submitted_at":"2024-11-28T12:52:48Z","title":"Streamlined Federated Unlearning: Unite as One to Be Highly Efficient","version":2},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-12T10:35:58.293616Z"},"links":{"citing_paper":"/paper/2412.00126"},"observation_digest":"sha256:5b1666d5500ef29571a02ff89d79b89326bdf024cbe1210e56152f45ce328959","observation_id":"7ce77f3a-8433-42e7-b0ff-97f5c9032cb1","resolution":{"observed_at":"2026-08-12T10:35:58.476202Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T10:35:58.461573Z","title":"Spfl: A self-purified federated learning method against poisoning attacks,","venue":null,"work_id":"31eb7df2-821f-45c4-b3ce-b324f46ccc72","year":2024},"citing_paper":{"arxiv_id":"2412.00126","last_updated":"2025-03-10T00:54:33Z","snapshot_observed_at":"2026-08-12T10:29:32.724323Z","submitted_at":"2024-11-28T12:52:48Z","title":"Streamlined Federated Unlearning: Unite as One to Be Highly Efficient","version":2},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-12T10:35:58.297533Z"},"links":{"citing_paper":"/paper/2412.00126"},"observation_digest":"sha256:f9475dc00f8eac8d482adc848dd5469e3e5304f83bd9f8ccbc8bb8bff0257a20","observation_id":"f6aab2d3-b1ce-43b6-bb2e-db5d70090b4b","resolution":{"observed_at":"2026-08-12T10:35:58.466106Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T10:35:58.450802Z","title":"Personal- ized edge intelligence via federated self-knowledge distillation,","venue":null,"work_id":"7949182d-af9f-4351-9930-e6336bbb066d","year":2022},"citing_paper":{"arxiv_id":"2412.00126","last_updated":"2025-03-10T00:54:33Z","snapshot_observed_at":"2026-08-12T10:29:32.724323Z","submitted_at":"2024-11-28T12:52:48Z","title":"Streamlined Federated Unlearning: Unite as One to Be Highly Efficient","version":2},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-12T10:35:58.301017Z"},"links":{"citing_paper":"/paper/2412.00126"},"observation_digest":"sha256:6a4efc8282e51d6b89a82ce2eba832b2aa233490a39de78d3489125744a4c912","observation_id":"223662c9-b94d-4969-b422-8fcb93581dc2","resolution":{"observed_at":"2026-08-12T10:35:58.454480Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T10:35:58.304702Z","title":"Learning multiple layers of features from tiny images,","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2412.00126","last_updated":"2025-03-10T00:54:33Z","snapshot_observed_at":"2026-08-12T10:29:32.724323Z","submitted_at":"2024-11-28T12:52:48Z","title":"Streamlined Federated Unlearning: Unite as One to Be Highly Efficient","version":2},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-12T10:35:58.304702Z"},"links":{"citing_paper":"/paper/2412.00126"},"observation_digest":"sha256:10b009f9318c80fc0bd514adbd1ef5ee25df9ab39dd94373735b8b44a8d80225","observation_id":"639b44e1-0e2f-46a2-83b1-8f260cb7e057","resolution":{"observed_at":"2026-08-12T10:35:58.304702Z","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-12T10:35:58.308554Z","title":"Character-level convolutional net- works for text classification,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2412.00126","last_updated":"2025-03-10T00:54:33Z","snapshot_observed_at":"2026-08-12T10:29:32.724323Z","submitted_at":"2024-11-28T12:52:48Z","title":"Streamlined Federated Unlearning: Unite as One to Be Highly Efficient","version":2},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-12T10:35:58.308554Z"},"links":{"citing_paper":"/paper/2412.00126"},"observation_digest":"sha256:76dce16eb78bf83de5893d17b104d98d5c768aa785733ec3ad2efb6f74a50198","observation_id":"e57f2289-369b-4b14-a4b5-f30c4a673ab2","resolution":{"observed_at":"2026-08-12T10:35:58.308554Z","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-12T10:35:58.312378Z","title":"Deep residual learning for image recognition,","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2412.00126","last_updated":"2025-03-10T00:54:33Z","snapshot_observed_at":"2026-08-12T10:29:32.724323Z","submitted_at":"2024-11-28T12:52:48Z","title":"Streamlined Federated Unlearning: Unite as One to Be Highly Efficient","version":2},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-12T10:35:58.312378Z"},"links":{"citing_paper":"/paper/2412.00126"},"observation_digest":"sha256:9522c5bf0c0934b2a081f8776794d42320085fece946b3379a651f2cc5907546","observation_id":"1d353bbc-b821-4ebc-9f1f-d79442094869","resolution":{"observed_at":"2026-08-12T10:35:58.312378Z","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-12T10:35:58.316222Z","title":"Long short-term memory,","venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2412.00126","last_updated":"2025-03-10T00:54:33Z","snapshot_observed_at":"2026-08-12T10:29:32.724323Z","submitted_at":"2024-11-28T12:52:48Z","title":"Streamlined Federated Unlearning: Unite as One to Be Highly Efficient","version":2},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-12T10:35:58.316222Z"},"links":{"citing_paper":"/paper/2412.00126"},"observation_digest":"sha256:d388e9180de59720046bb9548814f310b8ea7204030ef87f4351631e5edaf8bd","observation_id":"069fe07a-dd9d-4565-bbb9-82659ad63081","resolution":{"observed_at":"2026-08-12T10:35:58.316222Z","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-12T10:35:58.320218Z","title":"Bayesian nonparametric federated learning of neural networks,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2412.00126","last_updated":"2025-03-10T00:54:33Z","snapshot_observed_at":"2026-08-12T10:29:32.724323Z","submitted_at":"2024-11-28T12:52:48Z","title":"Streamlined Federated Unlearning: Unite as One to Be Highly Efficient","version":2},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-12T10:35:58.320218Z"},"links":{"citing_paper":"/paper/2412.00126"},"observation_digest":"sha256:bc4aa85836b1024e972b18e07a3c504b091b37abe82c903e6df90da090157fba","observation_id":"17f16c77-6430-4a5d-871a-a350e8c3ff35","resolution":{"observed_at":"2026-08-12T10:35:58.320218Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2412.00126","last_updated":"2025-03-10T00:54:33Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-12T10:29:32.724323Z","submitted_at":"2024-11-28T12:52:48Z","title":"Streamlined Federated Unlearning: Unite as One to Be Highly Efficient"},"reference_resolution":{"displayed":47,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":24,"verified_exact":1,"verified_fuzzy":22},"total_outbound_references":47},"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-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"thesis":"As of 13 August 2026, this Paper Citation Record lists 47 of 47 outbound references and 0 inbound Pith citation observations for arXiv:2412.00126."}