{"as_of":"2026-08-07T06:10:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:019691fafc52ed913211116657df33723a9988810b5afb74d4ad9690288bac8c","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":5,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":5,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-06T06:34:29.942622+00:00","state":"measured"},{"denominator":5,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":5,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-17T23:21:13.695893Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-17T23:22:12.625565Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2109.09847","last_updated":"2022-07-26T22:04:33Z","snapshot_observed_at":"2026-08-07T03:50:32.732299Z","submitted_at":"2021-09-20T21:13:23Z","title":"Fast TreeSHAP: Accelerating SHAP Value Computation for Trees","version":3},"cited_work":{"arxiv_id":"2109.09847","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2109.09847","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"In 2009 IEEE Symposium on Computational Intelligence for Security and Defense Applications, 1–6","venue":null,"work_id":"eeb4c239-f000-479a-953b-4ebcbf64aaf9","year":2009},"citing_paper":{"arxiv_id":"2511.09376","last_updated":"2026-04-12T12:13:00Z","snapshot_observed_at":"2026-07-06T22:35:37.039024Z","submitted_at":"2025-11-12T14:43:27Z","title":"From Decision Trees to Boolean Logic: A Fast and Unified SHAP Algorithm","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-17T23:21:13.695893Z"},"links":{"cited_paper":"/paper/2109.09847","citing_paper":"/paper/2511.09376"},"observation_digest":"sha256:d48721f771f07ab686ad72659dc385e0672dc5c69eb5ee6ad406e8832aac90b4","observation_id":"2057be60-a1cc-49b8-9148-b49664de4e67","resolution":{"observed_at":"2026-05-17T23:22:12.628637Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2109.09847","last_updated":"2022-07-26T22:04:33Z","snapshot_observed_at":"2026-08-07T03:50:32.732299Z","submitted_at":"2021-09-20T21:13:23Z","title":"Fast TreeSHAP: Accelerating SHAP Value Computation for Trees","version":3},"cited_work":{"arxiv_id":"2109.09847","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2109.09847","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"In 2009 IEEE Symposium on Computational Intelligence for Security and Defense Applications, 1–6","venue":null,"work_id":"eeb4c239-f000-479a-953b-4ebcbf64aaf9","year":2009},"citing_paper":{"arxiv_id":"2604.10569","last_updated":"2026-04-12T10:32:48Z","snapshot_observed_at":"2026-08-02T21:56:05.130419Z","submitted_at":"2026-04-12T10:32:48Z","title":"WOODELF-HD: Efficient Background SHAP for High-Depth Decision Trees","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-05-10T16:33:23.592578Z"},"links":{"cited_paper":"/paper/2109.09847","citing_paper":"/paper/2604.10569"},"observation_digest":"sha256:7e4bda7ca43310bf7c507a1bfd2458779ce947cb5b552225c98964c71a47ca35","observation_id":"870ededd-1e17-41f9-980b-caa939a71032","resolution":{"observed_at":"2026-05-11T08:40:59.942136Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2109.09847","last_updated":"2022-07-26T22:04:33Z","snapshot_observed_at":"2026-08-07T03:50:32.732299Z","submitted_at":"2021-09-20T21:13:23Z","title":"Fast TreeSHAP: Accelerating SHAP Value Computation for Trees","version":3},"cited_work":{"arxiv_id":"2109.09847","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2109.09847","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"In 2009 IEEE Symposium on Computational Intelligence for Security and Defense Applications, 1–6","venue":null,"work_id":"eeb4c239-f000-479a-953b-4ebcbf64aaf9","year":2009},"citing_paper":{"arxiv_id":"2604.22662","last_updated":"2026-04-24T15:38:44Z","snapshot_observed_at":"2026-07-06T23:09:01.221922Z","submitted_at":"2026-04-24T15:38:44Z","title":"Rethinking XAI Evaluation: A Human-Centered Audit of Shapley Benchmarks in High-Stakes Settings","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-05-08T12:19:36.944821Z"},"links":{"cited_paper":"/paper/2109.09847","citing_paper":"/paper/2604.22662"},"observation_digest":"sha256:744e3105e5a934279cc7cdb4587909ddf21553abd7e63ce75fa14fcad05a34c5","observation_id":"b1dfacb2-26a6-4d4b-9255-419b03d3d686","resolution":{"observed_at":"2026-05-11T19:16:10.554151Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2109.09847","last_updated":"2022-07-26T22:04:33Z","snapshot_observed_at":"2026-08-07T03:50:32.732299Z","submitted_at":"2021-09-20T21:13:23Z","title":"Fast TreeSHAP: Accelerating SHAP Value Computation for Trees","version":3},"cited_work":{"arxiv_id":"2109.09847","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2109.09847","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"In 2009 IEEE Symposium on Computational Intelligence for Security and Defense Applications, 1–6","venue":null,"work_id":"eeb4c239-f000-479a-953b-4ebcbf64aaf9","year":2009},"citing_paper":{"arxiv_id":"2605.05870","last_updated":"2026-05-17T06:30:08Z","snapshot_observed_at":"2026-08-02T11:07:22.095716Z","submitted_at":"2026-05-07T08:36:50Z","title":"QuadraSHAP: Stable and Scalable Shapley Values for Product Games via Gauss-Legendre Quadrature","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-05-08T14:49:49.613344Z"},"links":{"cited_paper":"/paper/2109.09847","citing_paper":"/paper/2605.05870"},"observation_digest":"sha256:d366e947af69a2bd668d38ca84dc5b9bb139885de3d7e999e00a45c3c3c97678","observation_id":"b4e66d1b-2e9b-4f32-b677-720cb1d7b10f","resolution":{"observed_at":"2026-05-11T18:41:09.778699Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2109.09847","last_updated":"2022-07-26T22:04:33Z","snapshot_observed_at":"2026-08-07T03:50:32.732299Z","submitted_at":"2021-09-20T21:13:23Z","title":"Fast TreeSHAP: Accelerating SHAP Value Computation for Trees","version":3},"cited_work":{"arxiv_id":"2109.09847","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2109.09847","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"In 2009 IEEE Symposium on Computational Intelligence for Security and Defense Applications, 1–6","venue":null,"work_id":"eeb4c239-f000-479a-953b-4ebcbf64aaf9","year":2009},"citing_paper":{"arxiv_id":"2605.10598","last_updated":"2026-05-11T14:01:52Z","snapshot_observed_at":"2026-08-02T11:54:02.966349Z","submitted_at":"2026-05-11T14:01:52Z","title":"Budget-Efficient Automatic Algorithm Design via Code Graph","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-05-12T03:46:09.715264Z"},"links":{"cited_paper":"/paper/2109.09847","citing_paper":"/paper/2605.10598"},"observation_digest":"sha256:1e748dbc32eee1483a36d7471e620e26a8ae5891a26179e508edaef132b8194a","observation_id":"c2a0e6fe-dddc-45e6-96b7-93fa96781f80","resolution":{"observed_at":"2026-05-12T06:56:32.213865Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2109.09847/citation-record","integrity":"/paper/2109.09847/integrity","json":"/paper/2109.09847/citation-record.json","paper":"/paper/2109.09847"},"outbound":[],"paper":{"arxiv_id":"2109.09847","last_updated":"2022-07-26T22:04:33Z","latest_version":3,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-07T03:50:32.732299Z","submitted_at":"2021-09-20T21:13:23Z","title":"Fast TreeSHAP: Accelerating SHAP Value Computation for Trees"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"thesis":"As of 7 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 5 inbound Pith citation observations for arXiv:2109.09847."}