{"as_of":"2026-08-09T16:53:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:215b56cc25b6077d6ca82a96c3672a47a2b80966c6cef51c30bd36b26cec9b45","coverage":[{"denominator":37,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":37,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-05T14:35:42.740229Z","state":"measured"},{"denominator":37,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":37,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+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/2508.21181/citation-record","integrity":"/paper/2508.21181/integrity","json":"/paper/2508.21181/citation-record.json","paper":"/paper/2508.21181"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"1702.07360","last_updated":"2017-03-06T15:39:47Z","snapshot_observed_at":"2026-07-06T05:31:12.300989Z","submitted_at":"2017-02-23T19:02:32Z","title":"Neural Decision Trees","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1702.07360","snapshot_observed_at":"2026-08-05T14:35:42.644573Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2508.21181","last_updated":"2025-08-28T19:45:36Z","snapshot_observed_at":"2026-08-07T03:24:41.089851Z","submitted_at":"2025-08-28T19:45:36Z","title":"FUTURE: Flexible Unlearning for Tree Ensemble","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-05T14:35:42.644573Z"},"links":{"cited_paper":"/paper/1702.07360","citing_paper":"/paper/2508.21181"},"observation_digest":"sha256:aadcb0811341d226d5d3dd60b758b4ade251f9002d5031af07efacbf55e3b64e","observation_id":"cfc6e9c5-8cc0-42f1-b6ea-f77303b3d83d","resolution":{"observed_at":"2026-08-05T14:35:42.644573Z","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-05T14:35:43.149047Z","title":null,"venue":null,"work_id":"17e70c79-a0a2-4bb1-9012-eb9b9597b2d7","year":2021},"citing_paper":{"arxiv_id":"2508.21181","last_updated":"2025-08-28T19:45:36Z","snapshot_observed_at":"2026-08-07T03:24:41.089851Z","submitted_at":"2025-08-28T19:45:36Z","title":"FUTURE: Flexible Unlearning for Tree Ensemble","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-05T14:35:42.647864Z"},"links":{"citing_paper":"/paper/2508.21181"},"observation_digest":"sha256:b0f4427cc3cc6979a9dd726896d0b4ebbbe0afcc2cca615aa4d0d2a6b6300a97","observation_id":"c4b5db5d-0358-471b-b8c6-40c90527af28","resolution":{"observed_at":"2026-08-05T14:35:43.152194Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-05T14:35:43.140919Z","title":null,"venue":null,"work_id":"d9dda405-988d-4d29-8615-92e63e9df674","year":2021},"citing_paper":{"arxiv_id":"2508.21181","last_updated":"2025-08-28T19:45:36Z","snapshot_observed_at":"2026-08-07T03:24:41.089851Z","submitted_at":"2025-08-28T19:45:36Z","title":"FUTURE: Flexible Unlearning for Tree Ensemble","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-05T14:35:42.650528Z"},"links":{"citing_paper":"/paper/2508.21181"},"observation_digest":"sha256:e0cf71e6cd1722fa04bde78f7a2cf7f5242b5809bb6873d37cc81779a5bf8582","observation_id":"c8dc2b48-52be-4344-b393-f937d1dee8a8","resolution":{"observed_at":"2026-08-05T14:35:43.143536Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2503.18197","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T14:35:42.934697Z","title":null,"venue":null,"work_id":"c245515e-cb3e-4eb7-ab45-907b6ac3671a","year":2025},"citing_paper":{"arxiv_id":"2508.21181","last_updated":"2025-08-28T19:45:36Z","snapshot_observed_at":"2026-08-07T03:24:41.089851Z","submitted_at":"2025-08-28T19:45:36Z","title":"FUTURE: Flexible Unlearning for Tree Ensemble","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-05T14:35:42.653509Z"},"links":{"citing_paper":"/paper/2508.21181"},"observation_digest":"sha256:ad899caef93da2bc38f218d8b4a660555e2b3eff78d7be0af2b9f7128020edb1","observation_id":"7a6710b8-fa73-4413-aaff-269252496f96","resolution":{"observed_at":"2026-08-05T14:35:42.938955Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-05T14:35:43.132854Z","title":null,"venue":null,"work_id":"c8f525fc-a558-4fe6-a911-8aef68cf98f9","year":null},"citing_paper":{"arxiv_id":"2508.21181","last_updated":"2025-08-28T19:45:36Z","snapshot_observed_at":"2026-08-07T03:24:41.089851Z","submitted_at":"2025-08-28T19:45:36Z","title":"FUTURE: Flexible Unlearning for Tree Ensemble","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-05T14:35:42.656167Z"},"links":{"citing_paper":"/paper/2508.21181"},"observation_digest":"sha256:cf4b0049923a4a370d75013d9900a8c3b9e26f274a336c4a769f5de7005db533","observation_id":"a565bb1a-7130-4657-99cf-1e243ff05d79","resolution":{"observed_at":"2026-08-05T14:35:43.135460Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2406.14796","last_updated":"2024-12-22T23:47:58Z","snapshot_observed_at":"2026-08-06T14:42:25.772659Z","submitted_at":"2024-06-21T00:13:17Z","title":"MU-Bench: A Multitask Multimodal Benchmark for Machine Unlearning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.14796","snapshot_observed_at":"2026-08-05T14:35:42.661840Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.21181","last_updated":"2025-08-28T19:45:36Z","snapshot_observed_at":"2026-08-07T03:24:41.089851Z","submitted_at":"2025-08-28T19:45:36Z","title":"FUTURE: Flexible Unlearning for Tree Ensemble","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-05T14:35:42.661840Z"},"links":{"cited_paper":"/paper/2406.14796","citing_paper":"/paper/2508.21181"},"observation_digest":"sha256:068e1630b05b2170e8ef04de42122e850d3e645f8dba74fcd1bd4cc35743441e","observation_id":"ee538720-99f9-4e43-b0ed-a984ad153764","resolution":{"observed_at":"2026-08-05T14:35:42.661840Z","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-05T14:35:43.124499Z","title":null,"venue":null,"work_id":"ed4bb680-ef3e-4a0b-bc0b-6674832d1c01","year":2025},"citing_paper":{"arxiv_id":"2508.21181","last_updated":"2025-08-28T19:45:36Z","snapshot_observed_at":"2026-08-07T03:24:41.089851Z","submitted_at":"2025-08-28T19:45:36Z","title":"FUTURE: Flexible Unlearning for Tree Ensemble","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-05T14:35:42.664954Z"},"links":{"citing_paper":"/paper/2508.21181"},"observation_digest":"sha256:47ff513a425713176423581db4253eb2cb2664921dbee591534efa0b2fec50d0","observation_id":"98f605a3-3950-4eb2-9d28-138e123d2498","resolution":{"observed_at":"2026-08-05T14:35:43.127247Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-05T14:35:43.116631Z","title":null,"venue":null,"work_id":"1a78c7e3-1873-43d8-9576-a6fb67037714","year":2025},"citing_paper":{"arxiv_id":"2508.21181","last_updated":"2025-08-28T19:45:36Z","snapshot_observed_at":"2026-08-07T03:24:41.089851Z","submitted_at":"2025-08-28T19:45:36Z","title":"FUTURE: Flexible Unlearning for Tree Ensemble","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-05T14:35:42.667829Z"},"links":{"citing_paper":"/paper/2508.21181"},"observation_digest":"sha256:3b5d1696905f41c2cd39587b0a1e9dde80aaffb55cfd654bc03a4858ddbee285","observation_id":"245634f1-902d-461e-b85a-b104b81fb3be","resolution":{"observed_at":"2026-08-05T14:35:43.119336Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.06407","last_updated":"2026-08-03T17:36:01Z","snapshot_observed_at":"2026-08-07T16:07:23.841022Z","submitted_at":"2025-04-08T20:02:10Z","title":"Understanding Machine Unlearning Through the Lens of Mode Connectivity","version":2},"cited_work":{"arxiv_id":"2504.06407","doi":null,"metadata_source":"pith","pith_arxiv_id":"2504.06407","snapshot_observed_at":"2026-08-05T14:35:42.821246Z","title":"Understanding Machine Unlearning Through the Lens of Mode Connectivity","venue":"cs.LG","work_id":"0746c975-94a6-4dd1-8bad-079fd577b4ca","year":2025},"citing_paper":{"arxiv_id":"2508.21181","last_updated":"2025-08-28T19:45:36Z","snapshot_observed_at":"2026-08-07T03:24:41.089851Z","submitted_at":"2025-08-28T19:45:36Z","title":"FUTURE: Flexible Unlearning for Tree Ensemble","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-05T14:35:42.670529Z"},"links":{"cited_paper":"/paper/2504.06407","citing_paper":"/paper/2508.21181"},"observation_digest":"sha256:93002822086172ad7008f157f2e9e5a04693741afaa4a1dadad280f32ead82d0","observation_id":"d26957f3-bcce-4491-b869-24eec882dd31","resolution":{"observed_at":"2026-08-05T14:35:42.824402Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-05T14:35:42.673411Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2508.21181","last_updated":"2025-08-28T19:45:36Z","snapshot_observed_at":"2026-08-07T03:24:41.089851Z","submitted_at":"2025-08-28T19:45:36Z","title":"FUTURE: Flexible Unlearning for Tree Ensemble","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-05T14:35:42.673411Z"},"links":{"citing_paper":"/paper/2508.21181"},"observation_digest":"sha256:4d3ef645caa7d400e6340861bd7139596df68f486243e827166f1b40ae93e8e5","observation_id":"9cfaad14-8024-4158-b6e7-834060b6e70d","resolution":{"observed_at":"2026-08-05T14:35:42.673411Z","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-05T14:35:43.095995Z","title":null,"venue":null,"work_id":"7087183b-1cdb-4c7b-8da0-28c33f5292ce","year":2021},"citing_paper":{"arxiv_id":"2508.21181","last_updated":"2025-08-28T19:45:36Z","snapshot_observed_at":"2026-08-07T03:24:41.089851Z","submitted_at":"2025-08-28T19:45:36Z","title":"FUTURE: Flexible Unlearning for Tree Ensemble","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-05T14:35:42.678534Z"},"links":{"citing_paper":"/paper/2508.21181"},"observation_digest":"sha256:af9aecc2c455ae7208ca8b359f9484dc5020ee35843537d7f8599a5b320cd02d","observation_id":"84d28b41-07dc-4f68-a342-6c4f905b2f1a","resolution":{"observed_at":"2026-08-05T14:35:43.098594Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-05T14:35:43.088482Z","title":null,"venue":null,"work_id":"fbcc50e5-a11a-4603-b49e-b41af78429da","year":2025},"citing_paper":{"arxiv_id":"2508.21181","last_updated":"2025-08-28T19:45:36Z","snapshot_observed_at":"2026-08-07T03:24:41.089851Z","submitted_at":"2025-08-28T19:45:36Z","title":"FUTURE: Flexible Unlearning for Tree Ensemble","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-05T14:35:42.680833Z"},"links":{"citing_paper":"/paper/2508.21181"},"observation_digest":"sha256:243bcdd576aec84b4b76f27aa92c45eae0c61d363ae58a70eae870a7b4617cee","observation_id":"9a739fb8-fb9a-474c-933e-badb2142b23e","resolution":{"observed_at":"2026-08-05T14:35:43.091283Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-05T14:35:43.081201Z","title":null,"venue":null,"work_id":"2c8ed5f8-f2ec-4906-8f7e-5f4c87069c43","year":2024},"citing_paper":{"arxiv_id":"2508.21181","last_updated":"2025-08-28T19:45:36Z","snapshot_observed_at":"2026-08-07T03:24:41.089851Z","submitted_at":"2025-08-28T19:45:36Z","title":"FUTURE: Flexible Unlearning for Tree Ensemble","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-05T14:35:42.683388Z"},"links":{"citing_paper":"/paper/2508.21181"},"observation_digest":"sha256:b715c1d827ca7c2c4e6434defa912f6f138c381af708eae484ac40e53348e1dd","observation_id":"4f3f92be-b20e-4e61-bb16-c672275b7a26","resolution":{"observed_at":"2026-08-05T14:35:43.083693Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-05T14:35:43.073533Z","title":null,"venue":null,"work_id":"df0b73d9-844a-406f-a7f7-62ca03d87213","year":2020},"citing_paper":{"arxiv_id":"2508.21181","last_updated":"2025-08-28T19:45:36Z","snapshot_observed_at":"2026-08-07T03:24:41.089851Z","submitted_at":"2025-08-28T19:45:36Z","title":"FUTURE: Flexible Unlearning for Tree Ensemble","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-05T14:35:42.686230Z"},"links":{"citing_paper":"/paper/2508.21181"},"observation_digest":"sha256:13758cd03a74141bbec0f7d056be3a44ced1e215d4bb12b9cc8691a46fcae40b","observation_id":"13328c5b-2a84-447b-a265-28d2ecfed394","resolution":{"observed_at":"2026-08-05T14:35:43.076193Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-05T14:35:43.065397Z","title":null,"venue":null,"work_id":"2c302cad-1a17-4475-91dc-16449ea1db67","year":2025},"citing_paper":{"arxiv_id":"2508.21181","last_updated":"2025-08-28T19:45:36Z","snapshot_observed_at":"2026-08-07T03:24:41.089851Z","submitted_at":"2025-08-28T19:45:36Z","title":"FUTURE: Flexible Unlearning for Tree Ensemble","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-05T14:35:42.689087Z"},"links":{"citing_paper":"/paper/2508.21181"},"observation_digest":"sha256:89435edcaf06b09d59104c9a29897f231d31a26f071db752cea067948a3da7b1","observation_id":"7752c21b-2fc6-4e4f-b7c0-8f921637171e","resolution":{"observed_at":"2026-08-05T14:35:43.068318Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-05T14:35:43.057897Z","title":null,"venue":null,"work_id":"14b24c40-c191-43f9-93cf-01d874207d07","year":2012},"citing_paper":{"arxiv_id":"2508.21181","last_updated":"2025-08-28T19:45:36Z","snapshot_observed_at":"2026-08-07T03:24:41.089851Z","submitted_at":"2025-08-28T19:45:36Z","title":"FUTURE: Flexible Unlearning for Tree Ensemble","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-05T14:35:42.691391Z"},"links":{"citing_paper":"/paper/2508.21181"},"observation_digest":"sha256:70e6540a5d104f7f548f4eba78ea3e6d1486d9d9835d01afc03f6eb38dd1902d","observation_id":"a58b1503-f37f-4d3c-b925-b36b473d85b6","resolution":{"observed_at":"2026-08-05T14:35:43.060458Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.02672","last_updated":"2025-02-06T02:39:35Z","snapshot_observed_at":"2026-08-09T11:28:54.378852Z","submitted_at":"2025-02-04T19:30:41Z","title":"Transformers Boost the Performance of Decision Trees on Tabular Data across Sample Sizes","version":2},"cited_work":{"arxiv_id":"2502.02672","doi":null,"metadata_source":"pith","pith_arxiv_id":"2502.02672","snapshot_observed_at":"2026-08-05T14:35:42.809703Z","title":"Transformers Boost the Performance of Decision Trees on Tabular Data across Sample Sizes","venue":"cs.CL","work_id":"b6915bfb-b507-4733-a442-501096f23d9e","year":2025},"citing_paper":{"arxiv_id":"2508.21181","last_updated":"2025-08-28T19:45:36Z","snapshot_observed_at":"2026-08-07T03:24:41.089851Z","submitted_at":"2025-08-28T19:45:36Z","title":"FUTURE: Flexible Unlearning for Tree Ensemble","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-05T14:35:42.693764Z"},"links":{"cited_paper":"/paper/2502.02672","citing_paper":"/paper/2508.21181"},"observation_digest":"sha256:e826f78b6a91fd15fd7b579cb7687b26b66567bb49c65d7c07cb68e79d114deb","observation_id":"105151e9-5660-430c-a331-b7276de4a1b6","resolution":{"observed_at":"2026-08-05T14:35:42.813135Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-05T14:35:43.050370Z","title":null,"venue":null,"work_id":"166cfad6-99d7-4e8f-b843-e695df7df3a8","year":2025},"citing_paper":{"arxiv_id":"2508.21181","last_updated":"2025-08-28T19:45:36Z","snapshot_observed_at":"2026-08-07T03:24:41.089851Z","submitted_at":"2025-08-28T19:45:36Z","title":"FUTURE: Flexible Unlearning for Tree Ensemble","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-05T14:35:42.696947Z"},"links":{"citing_paper":"/paper/2508.21181"},"observation_digest":"sha256:09075a394f604c9b2ca2e5edfeb57a31fc0b15d94f3a3731160c9e6a6bd37dd4","observation_id":"526e641c-fa46-43e2-9007-31c25b3794f7","resolution":{"observed_at":"2026-08-05T14:35:43.053022Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-05T14:35:43.042359Z","title":null,"venue":null,"work_id":"58fc43c6-48d5-4148-b3d5-88f9ee837295","year":null},"citing_paper":{"arxiv_id":"2508.21181","last_updated":"2025-08-28T19:45:36Z","snapshot_observed_at":"2026-08-07T03:24:41.089851Z","submitted_at":"2025-08-28T19:45:36Z","title":"FUTURE: Flexible Unlearning for Tree Ensemble","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-05T14:35:42.702052Z"},"links":{"citing_paper":"/paper/2508.21181"},"observation_digest":"sha256:b3e4ab4f64dbfd23435da0f300ab2f7b2a913d100ac7815c5b3956f9e3ca290e","observation_id":"6211a9e7-c709-4c10-953f-d2d9e7ca4b22","resolution":{"observed_at":"2026-08-05T14:35:43.044990Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-05T14:35:43.027082Z","title":null,"venue":null,"work_id":"7ee1601d-56d6-4b11-9ce0-be2bb1b84dc8","year":2023},"citing_paper":{"arxiv_id":"2508.21181","last_updated":"2025-08-28T19:45:36Z","snapshot_observed_at":"2026-08-07T03:24:41.089851Z","submitted_at":"2025-08-28T19:45:36Z","title":"FUTURE: Flexible Unlearning for Tree Ensemble","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-05T14:35:42.707709Z"},"links":{"citing_paper":"/paper/2508.21181"},"observation_digest":"sha256:d469f2b774fd5b8426f56238a686a1361b911f4fb9d8455b7910a7a12356bd98","observation_id":"9e275619-d578-4e77-a09b-d6d7b5bd9542","resolution":{"observed_at":"2026-08-05T14:35:43.029645Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-05T14:35:43.019583Z","title":null,"venue":null,"work_id":"7e519a2d-3b0f-4551-998a-30328abc9f46","year":2024},"citing_paper":{"arxiv_id":"2508.21181","last_updated":"2025-08-28T19:45:36Z","snapshot_observed_at":"2026-08-07T03:24:41.089851Z","submitted_at":"2025-08-28T19:45:36Z","title":"FUTURE: Flexible Unlearning for Tree Ensemble","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-05T14:35:42.710023Z"},"links":{"citing_paper":"/paper/2508.21181"},"observation_digest":"sha256:f8cdc450ce195b26f88f262aea570077f3f6c7b9f6ddb8c813d8719f92b2b3bb","observation_id":"fc834232-981a-4e7e-843a-1aa63eec0d74","resolution":{"observed_at":"2026-08-05T14:35:43.022102Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-05T14:35:42.712456Z","title":"Varshney, Mohit Bansal, Sanmi Koyejo, and Yang Liu","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2508.21181","last_updated":"2025-08-28T19:45:36Z","snapshot_observed_at":"2026-08-07T03:24:41.089851Z","submitted_at":"2025-08-28T19:45:36Z","title":"FUTURE: Flexible Unlearning for Tree Ensemble","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-05T14:35:42.712456Z"},"links":{"citing_paper":"/paper/2508.21181"},"observation_digest":"sha256:6cb795954bdd7676838727b3bcafad1fdc77e10e3473bff38becd8d36b4af26d","observation_id":"a30b7dce-f859-4819-9a07-7f7027235fb4","resolution":{"observed_at":"2026-08-05T14:35:42.712456Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.08825","last_updated":"2025-02-12T22:30:18Z","snapshot_observed_at":"2026-08-09T12:13:19.761981Z","submitted_at":"2025-02-12T22:30:18Z","title":"Examining and Adapting Time for Multilingual Classification via Mixture of Temporal Experts","version":1},"cited_work":{"arxiv_id":"2502.08825","doi":null,"metadata_source":"pith","pith_arxiv_id":"2502.08825","snapshot_observed_at":"2026-08-05T14:35:42.798319Z","title":"Examining and Adapting Time for Multilingual Classification via Mixture of Temporal Experts","venue":"cs.CL","work_id":"b7a76783-b07a-41c8-ae29-a93f064192eb","year":2025},"citing_paper":{"arxiv_id":"2508.21181","last_updated":"2025-08-28T19:45:36Z","snapshot_observed_at":"2026-08-07T03:24:41.089851Z","submitted_at":"2025-08-28T19:45:36Z","title":"FUTURE: Flexible Unlearning for Tree Ensemble","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-05T14:35:42.714912Z"},"links":{"cited_paper":"/paper/2502.08825","citing_paper":"/paper/2508.21181"},"observation_digest":"sha256:41f2de33ec0fa692597ad87bf1e84ff4c169191e9b0aff0b22591d816a1b7ef0","observation_id":"fcd148c3-d16c-4cee-b25b-e62a9be8455d","resolution":{"observed_at":"2026-08-05T14:35:42.801378Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2302.04062","last_updated":"2025-04-04T09:34:37Z","snapshot_observed_at":"2026-07-06T14:49:41.442616Z","submitted_at":"2023-02-08T13:59:31Z","title":"Machine Learning for Synthetic Data Generation: A Review","version":10},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2302.04062","snapshot_observed_at":"2026-08-05T14:35:42.717782Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2508.21181","last_updated":"2025-08-28T19:45:36Z","snapshot_observed_at":"2026-08-07T03:24:41.089851Z","submitted_at":"2025-08-28T19:45:36Z","title":"FUTURE: Flexible Unlearning for Tree Ensemble","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-05T14:35:42.717782Z"},"links":{"cited_paper":"/paper/2302.04062","citing_paper":"/paper/2508.21181"},"observation_digest":"sha256:cbbe1975af07af9b6754edfccea37a01b2cd712c3c9b0a56694a12475bad50f7","observation_id":"b2d4e1bf-8f84-4f67-9072-44d4d2eaa492","resolution":{"observed_at":"2026-08-05T14:35:42.717782Z","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-05T14:35:43.011713Z","title":null,"venue":null,"work_id":"efdee5d1-e68f-4e4a-9c82-10e6a1c833e5","year":2022},"citing_paper":{"arxiv_id":"2508.21181","last_updated":"2025-08-28T19:45:36Z","snapshot_observed_at":"2026-08-07T03:24:41.089851Z","submitted_at":"2025-08-28T19:45:36Z","title":"FUTURE: Flexible Unlearning for Tree Ensemble","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-05T14:35:42.720451Z"},"links":{"citing_paper":"/paper/2508.21181"},"observation_digest":"sha256:33c91f1a6b19bdb3653243854523b896abdf2a46fb0491e7191a5727e63689d5","observation_id":"7f1dc7a4-ee19-4e60-8a5e-48ffcd9f51a4","resolution":{"observed_at":"2026-08-05T14:35:43.014446Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-05T14:35:43.003803Z","title":null,"venue":null,"work_id":"93a2e091-0739-4680-ae61-8363842e377f","year":2021},"citing_paper":{"arxiv_id":"2508.21181","last_updated":"2025-08-28T19:45:36Z","snapshot_observed_at":"2026-08-07T03:24:41.089851Z","submitted_at":"2025-08-28T19:45:36Z","title":"FUTURE: Flexible Unlearning for Tree Ensemble","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-05T14:35:42.722722Z"},"links":{"citing_paper":"/paper/2508.21181"},"observation_digest":"sha256:f956f49159c04f13e0acb5e5784eca6940f58184e337f07bd1e144c5a2b3eba8","observation_id":"194dd05a-be0e-4295-ab38-1b3d9c880dcb","resolution":{"observed_at":"2026-08-05T14:35:43.006303Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-05T14:35:42.995455Z","title":null,"venue":null,"work_id":"800e364b-9513-407f-89a1-0538d6f6112b","year":2021},"citing_paper":{"arxiv_id":"2508.21181","last_updated":"2025-08-28T19:45:36Z","snapshot_observed_at":"2026-08-07T03:24:41.089851Z","submitted_at":"2025-08-28T19:45:36Z","title":"FUTURE: Flexible Unlearning for Tree Ensemble","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-05T14:35:42.725017Z"},"links":{"citing_paper":"/paper/2508.21181"},"observation_digest":"sha256:9c0a5a87bbddce4461e614889a0de6e832ac6a259d1e3383699063daaeae6de4","observation_id":"47a53c9d-cd4e-47ff-b76a-606887abbd84","resolution":{"observed_at":"2026-08-05T14:35:42.998433Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-05T14:35:42.987186Z","title":null,"venue":null,"work_id":"02705c80-e509-4371-b316-901997e236ab","year":2023},"citing_paper":{"arxiv_id":"2508.21181","last_updated":"2025-08-28T19:45:36Z","snapshot_observed_at":"2026-08-07T03:24:41.089851Z","submitted_at":"2025-08-28T19:45:36Z","title":"FUTURE: Flexible Unlearning for Tree Ensemble","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-05T14:35:42.727369Z"},"links":{"citing_paper":"/paper/2508.21181"},"observation_digest":"sha256:9b72da87ffe949b67bd4e6908aedbbda1c5991c0a4bc6babf1b0635cd4b92e73","observation_id":"6c0a67ba-20da-464b-94f0-484670905864","resolution":{"observed_at":"2026-08-05T14:35:42.989644Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-05T14:35:42.979027Z","title":null,"venue":null,"work_id":"dcd50de0-69be-4a43-8557-cb886de919ae","year":null},"citing_paper":{"arxiv_id":"2508.21181","last_updated":"2025-08-28T19:45:36Z","snapshot_observed_at":"2026-08-07T03:24:41.089851Z","submitted_at":"2025-08-28T19:45:36Z","title":"FUTURE: Flexible Unlearning for Tree Ensemble","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-05T14:35:42.729757Z"},"links":{"citing_paper":"/paper/2508.21181"},"observation_digest":"sha256:61c354cd7e116cb16d0d30db85571f41e70a3866ff7e66d7b717ad25620c0831","observation_id":"16d5f51c-cf64-4a2c-b998-04eff0051667","resolution":{"observed_at":"2026-08-05T14:35:42.981615Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-05T14:35:42.962310Z","title":null,"venue":null,"work_id":"7505588d-86af-4ddf-a7e4-b72f820deca2","year":2025},"citing_paper":{"arxiv_id":"2508.21181","last_updated":"2025-08-28T19:45:36Z","snapshot_observed_at":"2026-08-07T03:24:41.089851Z","submitted_at":"2025-08-28T19:45:36Z","title":"FUTURE: Flexible Unlearning for Tree Ensemble","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-05T14:35:42.735072Z"},"links":{"citing_paper":"/paper/2508.21181"},"observation_digest":"sha256:8cca46f02dabfb7fd16d4b09f40cd37bbcf7dd4da93004d3f3425dfda1fecbb8","observation_id":"abcae134-1f3a-4459-aa9f-999023c61b38","resolution":{"observed_at":"2026-08-05T14:35:42.965615Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2109.09276","last_updated":"2021-10-03T19:38:29Z","snapshot_observed_at":"2026-08-06T01:11:38.822665Z","submitted_at":"2021-09-20T03:01:46Z","title":"From None to Severe: Predicting Severity in Movie Scripts","version":2},"cited_work":{"arxiv_id":"2109.09276","doi":null,"metadata_source":"pith","pith_arxiv_id":"2109.09276","snapshot_observed_at":"2026-08-05T14:35:42.775687Z","title":"From None to Severe: Predicting Severity in Movie Scripts","venue":"cs.CL","work_id":"9c5ad1e7-5083-4f4f-bfbd-1487b4f48097","year":2021},"citing_paper":{"arxiv_id":"2508.21181","last_updated":"2025-08-28T19:45:36Z","snapshot_observed_at":"2026-08-07T03:24:41.089851Z","submitted_at":"2025-08-28T19:45:36Z","title":"FUTURE: Flexible Unlearning for Tree Ensemble","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-05T14:35:42.737403Z"},"links":{"cited_paper":"/paper/2109.09276","citing_paper":"/paper/2508.21181"},"observation_digest":"sha256:ad2e15368d28cd2644b73b2450dc48f74e694690a250a303358aa3eaf6566988","observation_id":"650f95ac-c445-474a-94b6-78c2ae769800","resolution":{"observed_at":"2026-08-05T14:35:42.781388Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-05T14:35:42.953483Z","title":null,"venue":null,"work_id":"7c3247c8-bb4a-4b19-8707-3eecb0ad6a1f","year":2024},"citing_paper":{"arxiv_id":"2508.21181","last_updated":"2025-08-28T19:45:36Z","snapshot_observed_at":"2026-08-07T03:24:41.089851Z","submitted_at":"2025-08-28T19:45:36Z","title":"FUTURE: Flexible Unlearning for Tree Ensemble","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-05T14:35:42.740229Z"},"links":{"citing_paper":"/paper/2508.21181"},"observation_digest":"sha256:c0edd5bbc6a8b77afef4c130857853681749d5ed8167765e9a11d79bfee9e9d1","observation_id":"6b09478a-6899-45f0-9800-bc8190d7677d","resolution":{"observed_at":"2026-08-05T14:35:42.956028Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-05T14:35:43.034674Z","title":"In Proceedings of the IEEE international conference on computer vision","venue":null,"work_id":"37422226-312a-4615-b1c9-e94abf8f9765","year":null},"citing_paper":{"arxiv_id":"2508.21181","last_updated":"2025-08-28T19:45:36Z","snapshot_observed_at":"2026-08-07T03:24:41.089851Z","submitted_at":"2025-08-28T19:45:36Z","title":"FUTURE: Flexible Unlearning for Tree Ensemble","version":1},"reference_index":2015,"source":"pdf_text","source_observed_at":"2026-08-05T14:35:42.704825Z"},"links":{"citing_paper":"/paper/2508.21181"},"observation_digest":"sha256:9a83461abbbbd3bdfe84a51879b93735ccb893f90e19ee0e4ee88f245f4cafb9","observation_id":"bc25d101-59c2-4bf2-8bf3-5c3fae1cd347","resolution":{"observed_at":"2026-08-05T14:35:43.037510Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-05T14:35:42.971171Z","title":null,"venue":null,"work_id":"c3445e24-58da-465d-947d-d28c8c7c10ce","year":null},"citing_paper":{"arxiv_id":"2508.21181","last_updated":"2025-08-28T19:45:36Z","snapshot_observed_at":"2026-08-07T03:24:41.089851Z","submitted_at":"2025-08-28T19:45:36Z","title":"FUTURE: Flexible Unlearning for Tree Ensemble","version":1},"reference_index":2019,"source":"pdf_text","source_observed_at":"2026-08-05T14:35:42.732526Z"},"links":{"citing_paper":"/paper/2508.21181"},"observation_digest":"sha256:69856cd710e4eae917615a276361233ac4286edbbb2af7b07ba6c08d29e94978","observation_id":"4861ed8b-a881-450c-a955-bbeae6675bc9","resolution":{"observed_at":"2026-08-05T14:35:42.973738Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-05T14:35:43.103456Z","title":"In The Eleventh International Conference on Learning Representations","venue":null,"work_id":"69642c97-e1d5-43d6-8618-a55018036bed","year":null},"citing_paper":{"arxiv_id":"2508.21181","last_updated":"2025-08-28T19:45:36Z","snapshot_observed_at":"2026-08-07T03:24:41.089851Z","submitted_at":"2025-08-28T19:45:36Z","title":"FUTURE: Flexible Unlearning for Tree Ensemble","version":1},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-05T14:35:42.675877Z"},"links":{"citing_paper":"/paper/2508.21181"},"observation_digest":"sha256:8adf8121936f78ff6954d9a9a75b4d4230a0a45ea8261ca85bc13b1f286f7c45","observation_id":"ae300209-9e57-4224-a3ea-10ee3f3ec438","resolution":{"observed_at":"2026-08-05T14:35:43.106486Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2404.15760","last_updated":"2024-04-24T09:33:10Z","snapshot_observed_at":"2026-08-06T17:36:02.125140Z","submitted_at":"2024-04-24T09:33:10Z","title":"Debiasing Machine Unlearning with Counterfactual Examples","version":1},"cited_work":{"arxiv_id":"2404.15760","doi":null,"metadata_source":"pith","pith_arxiv_id":"2404.15760","snapshot_observed_at":"2026-08-05T14:35:42.844014Z","title":"Debiasing Machine Unlearning with Counterfactual Examples","venue":"cs.LG","work_id":"cbc0de8d-fb7b-4361-8c48-ec8cbf2852df","year":2024},"citing_paper":{"arxiv_id":"2508.21181","last_updated":"2025-08-28T19:45:36Z","snapshot_observed_at":"2026-08-07T03:24:41.089851Z","submitted_at":"2025-08-28T19:45:36Z","title":"FUTURE: Flexible Unlearning for Tree Ensemble","version":1},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-05T14:35:42.658770Z"},"links":{"cited_paper":"/paper/2404.15760","citing_paper":"/paper/2508.21181"},"observation_digest":"sha256:d008d3b356c3a1ffabe211b8c37c71113a19e55d15121f788b71e8c44e4563f2","observation_id":"eb71d3a2-439f-4a77-8d55-97190b677ef1","resolution":{"observed_at":"2026-08-05T14:35:42.847234Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-05T14:35:42.699585Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2508.21181","last_updated":"2025-08-28T19:45:36Z","snapshot_observed_at":"2026-08-07T03:24:41.089851Z","submitted_at":"2025-08-28T19:45:36Z","title":"FUTURE: Flexible Unlearning for Tree Ensemble","version":1},"reference_index":3213,"source":"pdf_text","source_observed_at":"2026-08-05T14:35:42.699585Z"},"links":{"citing_paper":"/paper/2508.21181"},"observation_digest":"sha256:92cc704d1c29e432a65aefdf23fb5e26b8652554e74abb30b9f9e8a042cfac6b","observation_id":"96ab4da2-e796-45c0-9fa4-f3d3890e831e","resolution":{"observed_at":"2026-08-05T14:35:42.699585Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2508.21181","last_updated":"2025-08-28T19:45:36Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-07T03:24:41.089851Z","submitted_at":"2025-08-28T19:45:36Z","title":"FUTURE: Flexible Unlearning for Tree Ensemble"},"reference_resolution":{"displayed":37,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":29,"verified_exact":6,"verified_fuzzy":2},"total_outbound_references":37},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 37 of 37 outbound references and 0 inbound Pith citation observations for arXiv:2508.21181."}