{"as_of":"2026-08-17T08:40:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:3dda93dc538d3728bd6889db4c338be55e1eaaf5cd281faf82821528b0884011","coverage":[{"denominator":35,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":35,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T12:53:59.100343Z","state":"measured"},{"denominator":35,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":35,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-17T06:30:58.91139+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.13790/citation-record","integrity":"/paper/2412.13790/integrity","json":"/paper/2412.13790/citation-record.json","paper":"/paper/2412.13790"},"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-11T12:53:59.612346Z","title":"A.; Jia, H.; Travers, A.; Zhang, B.; Lie, D.; and Papernot, N","venue":null,"work_id":"7fa3841b-a4e6-4f9a-b1c6-e2458bf08218","year":2021},"citing_paper":{"arxiv_id":"2412.13790","last_updated":"2024-12-18T12:32:43Z","snapshot_observed_at":"2026-08-14T02:54:29.267107Z","submitted_at":"2024-12-18T12:32:43Z","title":"Toward Efficient Data-Free Unlearning","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-11T12:53:58.942108Z"},"links":{"citing_paper":"/paper/2412.13790"},"observation_digest":"sha256:040b4f016ffca0ef7792687826740e8ec54d07c19ab25fab775da2c0e19e57ee","observation_id":"d55d78ef-142b-43b6-9fa6-b3445f8e814d","resolution":{"observed_at":"2026-08-11T12:53:59.616662Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-11T12:53:59.598508Z","title":null,"venue":null,"work_id":"c3826cf2-d118-41d4-b5d0-e5d55ba76add","year":2019},"citing_paper":{"arxiv_id":"2412.13790","last_updated":"2024-12-18T12:32:43Z","snapshot_observed_at":"2026-08-14T02:54:29.267107Z","submitted_at":"2024-12-18T12:32:43Z","title":"Toward Efficient Data-Free Unlearning","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-11T12:53:58.946218Z"},"links":{"citing_paper":"/paper/2412.13790"},"observation_digest":"sha256:8805e5e640e3fcf0be5dff6e140a1e7b9016ae86ca5b2b6bc0cb94ab7df1abf5","observation_id":"6d0c863e-32e9-4b09-b16e-6d4c75f0c281","resolution":{"observed_at":"2026-08-11T12:53:59.603772Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-11T12:53:59.585252Z","title":null,"venue":null,"work_id":"75674a8f-3f27-456d-be6a-ffb977fe792a","year":2015},"citing_paper":{"arxiv_id":"2412.13790","last_updated":"2024-12-18T12:32:43Z","snapshot_observed_at":"2026-08-14T02:54:29.267107Z","submitted_at":"2024-12-18T12:32:43Z","title":"Toward Efficient Data-Free Unlearning","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-11T12:53:58.950359Z"},"links":{"citing_paper":"/paper/2412.13790"},"observation_digest":"sha256:6efc02ee4912e3370a9aedd623b68d519963a053895dca2a61fb8f75ef2f2f47","observation_id":"85c66b40-8f9b-4898-8ff5-950d105c5655","resolution":{"observed_at":"2026-08-11T12:53:59.589886Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-11T12:53:59.570398Z","title":null,"venue":null,"work_id":"6765e0d5-6ace-48f9-b161-c34674df6391","year":2019},"citing_paper":{"arxiv_id":"2412.13790","last_updated":"2024-12-18T12:32:43Z","snapshot_observed_at":"2026-08-14T02:54:29.267107Z","submitted_at":"2024-12-18T12:32:43Z","title":"Toward Efficient Data-Free Unlearning","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-11T12:53:58.954455Z"},"links":{"citing_paper":"/paper/2412.13790"},"observation_digest":"sha256:5e00245efa2ba02dcf51088d4a96dbcc7f9f28f451dab8092a684ee067276f08","observation_id":"01235e1b-b727-4ed4-87a7-3a8dca898ea7","resolution":{"observed_at":"2026-08-11T12:53:59.576219Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-11T12:53:59.556981Z","title":null,"venue":null,"work_id":"e9217cc0-046f-4b95-9a9a-2ca4c0273d2a","year":2024},"citing_paper":{"arxiv_id":"2412.13790","last_updated":"2024-12-18T12:32:43Z","snapshot_observed_at":"2026-08-14T02:54:29.267107Z","submitted_at":"2024-12-18T12:32:43Z","title":"Toward Efficient Data-Free Unlearning","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-11T12:53:58.959017Z"},"links":{"citing_paper":"/paper/2412.13790"},"observation_digest":"sha256:f36af5d960e013f2d00fd71db351dde27ccefb3ae95ff26ed405d8fafd2f661f","observation_id":"6979f847-3c70-4371-bd6f-23060deab4b4","resolution":{"observed_at":"2026-08-11T12:53:59.561630Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-11T12:53:59.543024Z","title":null,"venue":null,"work_id":"00bf4265-e6aa-456e-a453-f7fdd314c8ff","year":2023},"citing_paper":{"arxiv_id":"2412.13790","last_updated":"2024-12-18T12:32:43Z","snapshot_observed_at":"2026-08-14T02:54:29.267107Z","submitted_at":"2024-12-18T12:32:43Z","title":"Toward Efficient Data-Free Unlearning","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-11T12:53:58.963218Z"},"links":{"citing_paper":"/paper/2412.13790"},"observation_digest":"sha256:49472bcd4edf797cc0e948401679f14bda9c4f903ce5bbe5549b38ac97677d69","observation_id":"f4671d62-8d42-4787-9381-5724b3482aa5","resolution":{"observed_at":"2026-08-11T12:53:59.547783Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-11T12:53:59.530495Z","title":"P.; El - Khamy, M.; and Lee, J","venue":null,"work_id":"892db8e4-e2a2-40ba-b35b-af04572842f8","year":2020},"citing_paper":{"arxiv_id":"2412.13790","last_updated":"2024-12-18T12:32:43Z","snapshot_observed_at":"2026-08-14T02:54:29.267107Z","submitted_at":"2024-12-18T12:32:43Z","title":"Toward Efficient Data-Free Unlearning","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-11T12:53:58.967511Z"},"links":{"citing_paper":"/paper/2412.13790"},"observation_digest":"sha256:a4485c7bfdbd1839d8a989d447a01c58957c4fa900ca3ab5241e7d105187020a","observation_id":"1eaee092-aec2-4bac-a81e-864f6838687f","resolution":{"observed_at":"2026-08-11T12:53:59.534832Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-11T12:53:59.517097Z","title":"S.; Tarun, A","venue":null,"work_id":"46a94123-6733-46e5-9d65-277076eb5902","year":2023},"citing_paper":{"arxiv_id":"2412.13790","last_updated":"2024-12-18T12:32:43Z","snapshot_observed_at":"2026-08-14T02:54:29.267107Z","submitted_at":"2024-12-18T12:32:43Z","title":"Toward Efficient Data-Free Unlearning","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-11T12:53:58.972199Z"},"links":{"citing_paper":"/paper/2412.13790"},"observation_digest":"sha256:0b146a23b6ac52ebcd755591b0040f24211c2c11ecb46189f2d46b484f47dbc4","observation_id":"f5ce4bf7-5999-427e-a323-32b26972757b","resolution":{"observed_at":"2026-08-11T12:53:59.521646Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-11T12:53:59.503579Z","title":null,"venue":null,"work_id":"fcb7c73f-795a-40f0-992b-8b78d4b22608","year":2022},"citing_paper":{"arxiv_id":"2412.13790","last_updated":"2024-12-18T12:32:43Z","snapshot_observed_at":"2026-08-14T02:54:29.267107Z","submitted_at":"2024-12-18T12:32:43Z","title":"Toward Efficient Data-Free Unlearning","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-11T12:53:58.976933Z"},"links":{"citing_paper":"/paper/2412.13790"},"observation_digest":"sha256:5fb4d13de0c825b555531a6518310c193df93fca867f84b4bd088b705f734d7c","observation_id":"87a7d3db-c998-4ffa-9bf4-d8618306c84e","resolution":{"observed_at":"2026-08-11T12:53:59.507989Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-11T12:53:59.490459Z","title":null,"venue":null,"work_id":"e106ea23-265d-48aa-999a-ff11a85fe67a","year":2023},"citing_paper":{"arxiv_id":"2412.13790","last_updated":"2024-12-18T12:32:43Z","snapshot_observed_at":"2026-08-14T02:54:29.267107Z","submitted_at":"2024-12-18T12:32:43Z","title":"Toward Efficient Data-Free Unlearning","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-11T12:53:58.981485Z"},"links":{"citing_paper":"/paper/2412.13790"},"observation_digest":"sha256:8bf484646440039c05bfab09076e114a4ad8536d454e1b37aff8a18656795123","observation_id":"1353d7f5-8910-40d5-a2e7-cb1fc856cdd5","resolution":{"observed_at":"2026-08-11T12:53:59.494573Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-11T12:53:59.475842Z","title":null,"venue":null,"work_id":"2a1e1f8e-1e1d-40f4-b662-e2eff1252c68","year":2021},"citing_paper":{"arxiv_id":"2412.13790","last_updated":"2024-12-18T12:32:43Z","snapshot_observed_at":"2026-08-14T02:54:29.267107Z","submitted_at":"2024-12-18T12:32:43Z","title":"Toward Efficient Data-Free Unlearning","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-11T12:53:58.985715Z"},"links":{"citing_paper":"/paper/2412.13790"},"observation_digest":"sha256:4fd6aa54f9bd122a9e0110f315780860df94b8aeb78c181441c63b910cca0898","observation_id":"818c0a40-bf79-4442-8ae6-4caafd14212b","resolution":{"observed_at":"2026-08-11T12:53:59.481087Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-11T12:53:59.459857Z","title":null,"venue":null,"work_id":"37cf1e52-803e-4c99-8884-eded75aa6dda","year":2022},"citing_paper":{"arxiv_id":"2412.13790","last_updated":"2024-12-18T12:32:43Z","snapshot_observed_at":"2026-08-14T02:54:29.267107Z","submitted_at":"2024-12-18T12:32:43Z","title":"Toward Efficient Data-Free Unlearning","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-11T12:53:58.989956Z"},"links":{"citing_paper":"/paper/2412.13790"},"observation_digest":"sha256:0ef1ee7df78ffe9690b66ff79fcf9f992193d31aa7fec7837f8750038dbcbd6c","observation_id":"56816632-25d2-4742-a291-a20573449025","resolution":{"observed_at":"2026-08-11T12:53:59.465206Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1912.11006","last_updated":"2020-03-02T12:12:43Z","snapshot_observed_at":"2026-08-14T02:55:22.370407Z","submitted_at":"2019-12-23T18:08:33Z","title":"Data-Free Adversarial Distillation","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1912.11006","snapshot_observed_at":"2026-08-11T12:53:58.994427Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2412.13790","last_updated":"2024-12-18T12:32:43Z","snapshot_observed_at":"2026-08-14T02:54:29.267107Z","submitted_at":"2024-12-18T12:32:43Z","title":"Toward Efficient Data-Free Unlearning","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-11T12:53:58.994427Z"},"links":{"cited_paper":"/paper/1912.11006","citing_paper":"/paper/2412.13790"},"observation_digest":"sha256:188244745a9c256aa6b5da16b6fc779692b10eeffbc98e36e4581c8f2f69f1e9","observation_id":"0511210b-3a24-40a6-a3b6-2795d82c19c6","resolution":{"observed_at":"2026-08-11T12:53:58.994427Z","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-11T12:53:59.445848Z","title":null,"venue":null,"work_id":"668b7a5c-edde-4189-94c2-78e7b2dbd799","year":2024},"citing_paper":{"arxiv_id":"2412.13790","last_updated":"2024-12-18T12:32:43Z","snapshot_observed_at":"2026-08-14T02:54:29.267107Z","submitted_at":"2024-12-18T12:32:43Z","title":"Toward Efficient Data-Free Unlearning","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-11T12:53:58.999383Z"},"links":{"citing_paper":"/paper/2412.13790"},"observation_digest":"sha256:df363548e883ad61cc2718c37c6a0a150a7660538999e2d8bec39b335adae8b0","observation_id":"74db133d-f7e4-4872-a75a-283f882f66fd","resolution":{"observed_at":"2026-08-11T12:53:59.450485Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-11T12:53:59.432318Z","title":null,"venue":null,"work_id":"ef799879-890d-4f25-a552-0eef8ff1b33e","year":2020},"citing_paper":{"arxiv_id":"2412.13790","last_updated":"2024-12-18T12:32:43Z","snapshot_observed_at":"2026-08-14T02:54:29.267107Z","submitted_at":"2024-12-18T12:32:43Z","title":"Toward Efficient Data-Free Unlearning","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-11T12:53:59.004918Z"},"links":{"citing_paper":"/paper/2412.13790"},"observation_digest":"sha256:8e5fa34e0768295577683fce95796ed6ca041a6182ed19481349b89037449dba","observation_id":"2e6c096f-1d0e-42a0-bc40-bf6b6c81785a","resolution":{"observed_at":"2026-08-11T12:53:59.437035Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-11T12:53:59.418612Z","title":null,"venue":null,"work_id":"f34ae4a0-bd69-41c5-af0e-09bbc3064f51","year":2016},"citing_paper":{"arxiv_id":"2412.13790","last_updated":"2024-12-18T12:32:43Z","snapshot_observed_at":"2026-08-14T02:54:29.267107Z","submitted_at":"2024-12-18T12:32:43Z","title":"Toward Efficient Data-Free Unlearning","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-11T12:53:59.009088Z"},"links":{"citing_paper":"/paper/2412.13790"},"observation_digest":"sha256:4c5b7c369cd3f5802d8314848bbb9c73a9b580a81d25dbb27c5479bd2a1e678e","observation_id":"efb7a998-a1e0-4736-b152-ec59407d4507","resolution":{"observed_at":"2026-08-11T12:53:59.423134Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-11T12:53:59.403727Z","title":null,"venue":null,"work_id":"a2ec6948-8216-4fd2-a1b7-f138b0bd2280","year":2022},"citing_paper":{"arxiv_id":"2412.13790","last_updated":"2024-12-18T12:32:43Z","snapshot_observed_at":"2026-08-14T02:54:29.267107Z","submitted_at":"2024-12-18T12:32:43Z","title":"Toward Efficient Data-Free Unlearning","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-11T12:53:59.013191Z"},"links":{"citing_paper":"/paper/2412.13790"},"observation_digest":"sha256:4b011190ad6fb9ffada04442ab7d81f4e6e7e5f77606be0c08ed7ca3f6e13342","observation_id":"d9f1cf08-e489-41fd-8abf-cd3f739ddf36","resolution":{"observed_at":"2026-08-11T12:53:59.408739Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-11T12:53:59.017606Z","title":null,"venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2412.13790","last_updated":"2024-12-18T12:32:43Z","snapshot_observed_at":"2026-08-14T02:54:29.267107Z","submitted_at":"2024-12-18T12:32:43Z","title":"Toward Efficient Data-Free Unlearning","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-11T12:53:59.017606Z"},"links":{"citing_paper":"/paper/2412.13790"},"observation_digest":"sha256:ef732d0d470c4838f97a847890f51f16f238b2711f368a3c5f4b2fcac4ade681","observation_id":"2d04d779-b6f9-46ea-a866-2b7ca16a523f","resolution":{"observed_at":"2026-08-11T12:53:59.017606Z","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-11T12:53:59.378437Z","title":null,"venue":null,"work_id":"268d44e6-e05f-42fe-989f-e8bd43a893fa","year":1951},"citing_paper":{"arxiv_id":"2412.13790","last_updated":"2024-12-18T12:32:43Z","snapshot_observed_at":"2026-08-14T02:54:29.267107Z","submitted_at":"2024-12-18T12:32:43Z","title":"Toward Efficient Data-Free Unlearning","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-11T12:53:59.022175Z"},"links":{"citing_paper":"/paper/2412.13790"},"observation_digest":"sha256:d599600b20b1c54594b6b491060880557367912bf515adeaac5fdb2a837984cd","observation_id":"50dd2fa9-7e93-4bb1-a77f-75eb26ed358d","resolution":{"observed_at":"2026-08-11T12:53:59.382519Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-11T12:53:59.363671Z","title":null,"venue":null,"work_id":"c1696aca-7a83-4c40-8de6-3643a202a5e4","year":2023},"citing_paper":{"arxiv_id":"2412.13790","last_updated":"2024-12-18T12:32:43Z","snapshot_observed_at":"2026-08-14T02:54:29.267107Z","submitted_at":"2024-12-18T12:32:43Z","title":"Toward Efficient Data-Free Unlearning","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-11T12:53:59.026733Z"},"links":{"citing_paper":"/paper/2412.13790"},"observation_digest":"sha256:11712ff68c5d5b5eb29b226a9f9b71cbe239c30f6e98026fb756c90a204e1868","observation_id":"d6931bd7-4643-40fd-8379-c971430fe78e","resolution":{"observed_at":"2026-08-11T12:53:59.368876Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-11T12:53:59.350547Z","title":null,"venue":null,"work_id":"a78e02e0-6779-4543-86da-2d555fb24647","year":2024},"citing_paper":{"arxiv_id":"2412.13790","last_updated":"2024-12-18T12:32:43Z","snapshot_observed_at":"2026-08-14T02:54:29.267107Z","submitted_at":"2024-12-18T12:32:43Z","title":"Toward Efficient Data-Free Unlearning","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-11T12:53:59.031578Z"},"links":{"citing_paper":"/paper/2412.13790"},"observation_digest":"sha256:08543ace26876f54aa52f68f87550b7dfbeb8402a45c799596135dbf95a90071","observation_id":"b4c0114a-97d3-47d4-8c01-b815d2324dd9","resolution":{"observed_at":"2026-08-11T12:53:59.354966Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-11T12:53:59.338131Z","title":"G.; Rubinstein, B","venue":null,"work_id":"92e93c93-3465-4c6d-a565-cdd33d3e46f7","year":2022},"citing_paper":{"arxiv_id":"2412.13790","last_updated":"2024-12-18T12:32:43Z","snapshot_observed_at":"2026-08-14T02:54:29.267107Z","submitted_at":"2024-12-18T12:32:43Z","title":"Toward Efficient Data-Free Unlearning","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-11T12:53:59.035777Z"},"links":{"citing_paper":"/paper/2412.13790"},"observation_digest":"sha256:000f63e8d74d4843d063ea367c7688ed90b43583fa1804c4cb427b7e8875d7b9","observation_id":"ff8d3c78-a737-419c-8db0-9cf34f9b9196","resolution":{"observed_at":"2026-08-11T12:53:59.342506Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-11T12:53:59.324141Z","title":null,"venue":null,"work_id":"9f8a1961-0111-4d8c-a52b-83320d2d1682","year":2019},"citing_paper":{"arxiv_id":"2412.13790","last_updated":"2024-12-18T12:32:43Z","snapshot_observed_at":"2026-08-14T02:54:29.267107Z","submitted_at":"2024-12-18T12:32:43Z","title":"Toward Efficient Data-Free Unlearning","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-11T12:53:59.039847Z"},"links":{"citing_paper":"/paper/2412.13790"},"observation_digest":"sha256:f9ade851644170705aeae8ba6484d37da3d67b24be2595b90b305f6b986b6f05","observation_id":"8799a8a4-1f05-4506-9362-2f027e06da0c","resolution":{"observed_at":"2026-08-11T12:53:59.328460Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-11T12:53:59.307965Z","title":"K.; Mopuri, K","venue":null,"work_id":"72923d86-a82f-4eb4-85f9-5801309874b6","year":2019},"citing_paper":{"arxiv_id":"2412.13790","last_updated":"2024-12-18T12:32:43Z","snapshot_observed_at":"2026-08-14T02:54:29.267107Z","submitted_at":"2024-12-18T12:32:43Z","title":"Toward Efficient Data-Free Unlearning","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-11T12:53:59.044700Z"},"links":{"citing_paper":"/paper/2412.13790"},"observation_digest":"sha256:d557460754c18d3acc8fa42626fe48b4bdb80d830588571f8b0f6adecfb86853","observation_id":"86034f81-7af4-47ec-bb39-fbd4bd29f9b2","resolution":{"observed_at":"2026-08-11T12:53:59.312420Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-11T12:53:59.292039Z","title":"Y.; et al","venue":null,"work_id":"50683c7f-1901-4606-9751-fccddd5980c7","year":2011},"citing_paper":{"arxiv_id":"2412.13790","last_updated":"2024-12-18T12:32:43Z","snapshot_observed_at":"2026-08-14T02:54:29.267107Z","submitted_at":"2024-12-18T12:32:43Z","title":"Toward Efficient Data-Free Unlearning","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-11T12:53:59.049729Z"},"links":{"citing_paper":"/paper/2412.13790"},"observation_digest":"sha256:d9276ca187174088be4fa1f028ffb86bf3371ddabb552dab7fc8c943c1c948cc","observation_id":"c4104f5d-d7ea-42a5-8cd9-271dced47537","resolution":{"observed_at":"2026-08-11T12:53:59.297177Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2209.02299","last_updated":"2024-09-17T11:55:58Z","snapshot_observed_at":"2026-08-16T16:34:32.525658Z","submitted_at":"2022-09-06T08:51:53Z","title":"A Survey of Machine Unlearning","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2209.02299","snapshot_observed_at":"2026-08-11T12:53:59.053824Z","title":"T.; Huynh, T","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2412.13790","last_updated":"2024-12-18T12:32:43Z","snapshot_observed_at":"2026-08-14T02:54:29.267107Z","submitted_at":"2024-12-18T12:32:43Z","title":"Toward Efficient Data-Free Unlearning","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-11T12:53:59.053824Z"},"links":{"cited_paper":"/paper/2209.02299","citing_paper":"/paper/2412.13790"},"observation_digest":"sha256:77299e8f9fc9009b6690ff1a92d812b38cdf2588a86800aebd554389158fdcaa","observation_id":"2c02c80b-fdef-40cf-9155-9bf268c4c0f9","resolution":{"observed_at":"2026-08-11T12:53:59.053824Z","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-11T12:53:59.277082Z","title":null,"venue":null,"work_id":"2f3e8563-b0a3-4095-a1aa-38b739c7e4d2","year":2017},"citing_paper":{"arxiv_id":"2412.13790","last_updated":"2024-12-18T12:32:43Z","snapshot_observed_at":"2026-08-14T02:54:29.267107Z","submitted_at":"2024-12-18T12:32:43Z","title":"Toward Efficient Data-Free Unlearning","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-11T12:53:59.061268Z"},"links":{"citing_paper":"/paper/2412.13790"},"observation_digest":"sha256:2f49cea81f36dd45f910660dd21718c1362df80ec28056d56c53bdd1064a595f","observation_id":"1c672de3-ba77-4710-a88f-b8d1df7fb55d","resolution":{"observed_at":"2026-08-11T12:53:59.282088Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-11T12:53:59.261070Z","title":"T.; Dosovitskiy, A.; Brox, T.; and Riedmiller, M","venue":null,"work_id":"45cd58b0-73e2-4d1c-b52e-03216a098d47","year":2015},"citing_paper":{"arxiv_id":"2412.13790","last_updated":"2024-12-18T12:32:43Z","snapshot_observed_at":"2026-08-14T02:54:29.267107Z","submitted_at":"2024-12-18T12:32:43Z","title":"Toward Efficient Data-Free Unlearning","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-11T12:53:59.066042Z"},"links":{"citing_paper":"/paper/2412.13790"},"observation_digest":"sha256:d5def374a52b28c76db5bf3fc0d8448b9cde691a9bd64330c214d6221a2e96a3","observation_id":"7900fae4-33ea-49aa-b918-df4a79dcb9fc","resolution":{"observed_at":"2026-08-11T12:53:59.265947Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-11T12:53:59.247749Z","title":"K.; Chundawat, V","venue":null,"work_id":"6ae94f38-50b3-4c35-82f4-5533ae51dc59","year":2023},"citing_paper":{"arxiv_id":"2412.13790","last_updated":"2024-12-18T12:32:43Z","snapshot_observed_at":"2026-08-14T02:54:29.267107Z","submitted_at":"2024-12-18T12:32:43Z","title":"Toward Efficient Data-Free Unlearning","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-11T12:53:59.070341Z"},"links":{"citing_paper":"/paper/2412.13790"},"observation_digest":"sha256:dba2031f2546a70f5febfc8acb0062e31794d958646c62571d4153336ad0607b","observation_id":"bec5806e-9c34-484b-862d-428ee2939ed9","resolution":{"observed_at":"2026-08-11T12:53:59.252000Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-11T12:53:59.233224Z","title":null,"venue":null,"work_id":"433b27d9-e3f9-478c-b80e-20e0d07daba3","year":2022},"citing_paper":{"arxiv_id":"2412.13790","last_updated":"2024-12-18T12:32:43Z","snapshot_observed_at":"2026-08-14T02:54:29.267107Z","submitted_at":"2024-12-18T12:32:43Z","title":"Toward Efficient Data-Free Unlearning","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-11T12:53:59.076098Z"},"links":{"citing_paper":"/paper/2412.13790"},"observation_digest":"sha256:1be978419f9e3d457cf4872f26379a36a76f12d1554d68b47a4dba114618357a","observation_id":"ff391779-06fe-46f8-ac39-9f998a1c1333","resolution":{"observed_at":"2026-08-11T12:53:59.237997Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-11T12:53:59.220005Z","title":null,"venue":null,"work_id":"2d06056f-3df0-4b84-b7b4-7c8f2edb95c3","year":2024},"citing_paper":{"arxiv_id":"2412.13790","last_updated":"2024-12-18T12:32:43Z","snapshot_observed_at":"2026-08-14T02:54:29.267107Z","submitted_at":"2024-12-18T12:32:43Z","title":"Toward Efficient Data-Free Unlearning","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-11T12:53:59.080927Z"},"links":{"citing_paper":"/paper/2412.13790"},"observation_digest":"sha256:2a7072d3f8e1b3b3810b6e26da16274ec659b33fb509d1a4cfa6a5446e511a43","observation_id":"79636c86-b93a-4800-9922-968ed545a017","resolution":{"observed_at":"2026-08-11T12:53:59.224190Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-11T12:53:59.204801Z","title":null,"venue":null,"work_id":"caa0b8cd-1f3b-457b-a443-13fac3785239","year":2022},"citing_paper":{"arxiv_id":"2412.13790","last_updated":"2024-12-18T12:32:43Z","snapshot_observed_at":"2026-08-14T02:54:29.267107Z","submitted_at":"2024-12-18T12:32:43Z","title":"Toward Efficient Data-Free Unlearning","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-11T12:53:59.085192Z"},"links":{"citing_paper":"/paper/2412.13790"},"observation_digest":"sha256:b118bd35faa0c7144cb19822fd39c14c0de087f585b25394483347097fe86612","observation_id":"b2e4de5c-8b11-461c-ae0b-366423e1cccd","resolution":{"observed_at":"2026-08-11T12:53:59.210190Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-11T12:53:59.185478Z","title":"M.; Li, Z.; Mallya, A.; Hoiem, D.; Jha, N","venue":null,"work_id":"9e688a70-25d6-4675-a9cd-679f99ce3819","year":2020},"citing_paper":{"arxiv_id":"2412.13790","last_updated":"2024-12-18T12:32:43Z","snapshot_observed_at":"2026-08-14T02:54:29.267107Z","submitted_at":"2024-12-18T12:32:43Z","title":"Toward Efficient Data-Free Unlearning","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-11T12:53:59.090481Z"},"links":{"citing_paper":"/paper/2412.13790"},"observation_digest":"sha256:1fbfc275522ed1af8b1c80fa98293a443713a01f9d836efd9580f9b86400e563","observation_id":"103024b9-0084-467f-a771-2ee04deb119e","resolution":{"observed_at":"2026-08-11T12:53:59.191924Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-11T12:53:59.095054Z","title":", \" * write output.state after.block = add.period write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.13790","last_updated":"2024-12-18T12:32:43Z","snapshot_observed_at":"2026-08-14T02:54:29.267107Z","submitted_at":"2024-12-18T12:32:43Z","title":"Toward Efficient Data-Free Unlearning","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-11T12:53:59.095054Z"},"links":{"citing_paper":"/paper/2412.13790"},"observation_digest":"sha256:4470226b2c0f0030c361c430ac59bc674d34cf8b568b6270a55669b47dbb4012","observation_id":"aaa29819-b118-485c-8307-1e059ec06111","resolution":{"observed_at":"2026-08-11T12:53:59.095054Z","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-11T12:53:59.100343Z","title":"write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.13790","last_updated":"2024-12-18T12:32:43Z","snapshot_observed_at":"2026-08-14T02:54:29.267107Z","submitted_at":"2024-12-18T12:32:43Z","title":"Toward Efficient Data-Free Unlearning","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-11T12:53:59.100343Z"},"links":{"citing_paper":"/paper/2412.13790"},"observation_digest":"sha256:a84d3468219404045a1c9d92f291f65f63e8e11eccb814f84abcad71fe8b3507","observation_id":"7e3c6cfa-45b7-4c31-80c9-a857f87abbcc","resolution":{"observed_at":"2026-08-11T12:53:59.100343Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2412.13790","last_updated":"2024-12-18T12:32:43Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-14T02:54:29.267107Z","submitted_at":"2024-12-18T12:32:43Z","title":"Toward Efficient Data-Free Unlearning"},"reference_resolution":{"displayed":35,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":26,"verified_exact":0,"verified_fuzzy":9},"total_outbound_references":35},"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-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"thesis":"As of 17 August 2026, this Paper Citation Record lists 35 of 35 outbound references and 0 inbound Pith citation observations for arXiv:2412.13790."}