Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links
Paper Citation Record · LEDGER
Threshold KNN-Shapley: A Linear-Time and Privacy-Friendly Approach to Data Valuation
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.
A citation records a reference. It does not transfer a finding from one paper to another.
Coverage vector
One-hop event checks from named stored sources.
Source: scholarly_work_events, retraction_status_cache, observed 2026-08-05T06:32:48.257954+00:00
Pith citing papers itemized under the disclosed page cap.
Source: paper_references, paper_reference_links, observed 2026-08-04T05:59:57.712034Z
A source-named dated measurement, never combined with another source.
Source: arxiv_reference, observed 2026-05-13T06:02:23.226786Z
Reference resolution
0 of 0 outbound references displayed
- verified exact0
- verified fuzzy0
- unresolved0
- parse uncertain0
- malformed identifier0
- metadata mismatch0
External citation measurements
No source-named external measurement is stored.
Outbound references
No outbound reference observations are available for this paper version.
Pith citing papers
Observation 31b6ea89-a0b3-442b-9513-324f90d6a84b · inbound
Local Shapley: Model-Induced Locality and Optimal Reuse in Data Valuation cites this paper.
Local Shapley: Model-Induced Locality and Optimal Reuse in Data Valuation Threshold KNN-Shapley: A Linear-Time and Privacy-Friendly Approach to Data Valuation
Reference 2023
- Resolution
- unresolved
- no resolver link, observed 2026-08-04T05:59:57.712034Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 9906045f-9976-42b6-89be-7edda8f2ee7f · inbound
Is Data Shapley Not Better than Random in Data Selection? Ask NASH cites this paper.
Is Data Shapley Not Better than Random in Data Selection? Ask NASH Threshold KNN-Shapley: A Linear-Time and Privacy-Friendly Approach to Data Valuation
Reference 45
- Resolution
- verified exact
- arxiv_id, observed 2026-05-12T03:21:18.883369Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.
Observation 19eff0bb-04be-4327-8d2c-f5d083616f2e · inbound
Is Data Shapley Not Better than Random in Data Selection? Ask NASH cites this paper.
Is Data Shapley Not Better than Random in Data Selection? Ask NASH Threshold KNN-Shapley: A Linear-Time and Privacy-Friendly Approach to Data Valuation
Reference 45
- Resolution
- verified exact
- arxiv_id, observed 2026-05-13T06:02:23.228973Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.