{"as_of":"2026-08-05T13:12:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:1c6565b2b6c2449309d99451b683c773ed79504b2fa5aa2930e6bc38cd43b4fe","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":3,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":3,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-05T06:32:48.257954+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-04T05:59:57.712034Z","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-13T06:02:23.226786Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2308.15709","last_updated":"2023-11-26T04:32:25Z","snapshot_observed_at":"2026-07-06T16:12:02.944409Z","submitted_at":"2023-08-30T02:12:00Z","title":"Threshold KNN-Shapley: A Linear-Time and Privacy-Friendly Approach to Data Valuation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2308.15709","snapshot_observed_at":"2026-08-04T05:59:57.712034Z","title":"arXiv:2308.15709 [cs.LG] https://arxiv.org/abs/2308.15709","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2603.03672","last_updated":"2026-08-01T01:16:29Z","snapshot_observed_at":"2026-08-05T12:21:43.677326Z","submitted_at":"2026-03-04T02:59:23Z","title":"Local Shapley: Model-Induced Locality and Optimal Reuse in Data Valuation","version":2},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-04T05:59:57.712034Z"},"links":{"cited_paper":"/paper/2308.15709","citing_paper":"/paper/2603.03672"},"observation_digest":"sha256:2b50a5fdf0a0e0872630e10b0d3fb8e6453da726ceb0538c03b1fa44e72cef94","observation_id":"31b6ea89-a0b3-442b-9513-324f90d6a84b","resolution":{"observed_at":"2026-08-04T05:59:57.712034Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2308.15709","last_updated":"2023-11-26T04:32:25Z","snapshot_observed_at":"2026-07-06T16:12:02.944409Z","submitted_at":"2023-08-30T02:12:00Z","title":"Threshold KNN-Shapley: A Linear-Time and Privacy-Friendly Approach to Data Valuation","version":2},"cited_work":{"arxiv_id":"2308.15709","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2308.15709","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Wang and Yuqing Zhu and Yu-Xiang Wang and Ruoxi Jia and Prateek Mittal , year=","venue":null,"work_id":"125362da-fd9f-4511-9850-54bd20ccf424","year":null},"citing_paper":{"arxiv_id":"2605.10684","last_updated":"2026-05-12T09:53:39Z","snapshot_observed_at":"2026-07-06T23:22:37.355450Z","submitted_at":"2026-05-11T15:00:10Z","title":"Is Data Shapley Not Better than Random in Data Selection? Ask NASH","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-05-12T03:19:15.901522Z"},"links":{"cited_paper":"/paper/2308.15709","citing_paper":"/paper/2605.10684"},"observation_digest":"sha256:db19f0e3acf0dba141ea71284e9a4f91a94024d142c9f79440d1b117c9ecc5a1","observation_id":"9906045f-9976-42b6-89be-7edda8f2ee7f","resolution":{"observed_at":"2026-05-12T03:21:18.883369Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2308.15709","last_updated":"2023-11-26T04:32:25Z","snapshot_observed_at":"2026-07-06T16:12:02.944409Z","submitted_at":"2023-08-30T02:12:00Z","title":"Threshold KNN-Shapley: A Linear-Time and Privacy-Friendly Approach to Data Valuation","version":2},"cited_work":{"arxiv_id":"2308.15709","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2308.15709","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Wang and Yuqing Zhu and Yu-Xiang Wang and Ruoxi Jia and Prateek Mittal , year=","venue":null,"work_id":"125362da-fd9f-4511-9850-54bd20ccf424","year":null},"citing_paper":{"arxiv_id":"2605.10684","last_updated":"2026-05-12T09:53:39Z","snapshot_observed_at":"2026-07-06T23:22:37.355450Z","submitted_at":"2026-05-11T15:00:10Z","title":"Is Data Shapley Not Better than Random in Data Selection? Ask NASH","version":2},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-05-13T06:00:28.613740Z"},"links":{"cited_paper":"/paper/2308.15709","citing_paper":"/paper/2605.10684"},"observation_digest":"sha256:3673370babdf31ca1f201b776e6e31ba984e56fdbe813270bf745bbd24dd000f","observation_id":"19eff0bb-04be-4327-8d2c-f5d083616f2e","resolution":{"observed_at":"2026-05-13T06:02:23.228973Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2308.15709/citation-record","integrity":"/paper/2308.15709/integrity","json":"/paper/2308.15709/citation-record.json","paper":"/paper/2308.15709"},"outbound":[],"paper":{"arxiv_id":"2308.15709","last_updated":"2023-11-26T04:32:25Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T16:12:02.944409Z","submitted_at":"2023-08-30T02:12:00Z","title":"Threshold KNN-Shapley: A Linear-Time and Privacy-Friendly Approach to Data Valuation"},"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-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"thesis":"As of 5 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2308.15709."}