{"as_of":"2026-08-07T21:21:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:0e7e553bd5780dc7ed830bef31c6598231ffe35aaff66d127e365029e0e23d90","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":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-12T00:46:20.409088Z","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-21T05:49:40.950981Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2304.04258","last_updated":"2023-11-26T04:35:41Z","snapshot_observed_at":"2026-07-06T15:13:48.035348Z","submitted_at":"2023-04-09T15:31:53Z","title":"A Note on \"Efficient Task-Specific Data Valuation for Nearest Neighbor Algorithms\"","version":2},"cited_work":{"arxiv_id":"2304.04258","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2304.04258","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Efficient Task-Specific Data Valuation for Nearest Neighbor Algorithms","venue":null,"work_id":"1ab24bf2-9cf0-4923-9ac0-dc7e49864e9f","year":2023},"citing_paper":{"arxiv_id":"2605.21033","last_updated":"2026-05-20T11:10:15Z","snapshot_observed_at":"2026-07-06T23:31:32.577242Z","submitted_at":"2026-05-20T11:10:15Z","title":"Efficient Banzhaf-Based Data Valuation for $k$-Nearest Neighbors Classification","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-05-21T05:47:01.582345Z"},"links":{"cited_paper":"/paper/2304.04258","citing_paper":"/paper/2605.21033"},"observation_digest":"sha256:fe9336a7470b1570b102ce75340178d44a0a03937230dd0a31b62fa4be82c897","observation_id":"8d3b0612-7a50-4ebe-80a0-5a05001063ce","resolution":{"observed_at":"2026-05-21T05:49:40.952695Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2304.04258","last_updated":"2023-11-26T04:35:41Z","snapshot_observed_at":"2026-07-06T15:13:48.035348Z","submitted_at":"2023-04-09T15:31:53Z","title":"A Note on \"Efficient Task-Specific Data Valuation for Nearest Neighbor Algorithms\"","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2304.04258","snapshot_observed_at":"2026-07-12T00:46:20.409088Z","title":"efficient task-specific data valuation for nearest neighbor algorithms","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.03675","last_updated":"2026-07-04T03:07:36Z","snapshot_observed_at":"2026-07-12T00:46:20.186943Z","submitted_at":"2026-07-04T03:07:36Z","title":"Validation-Induced Shapley Shifts: How Validation Structure Distorts Data Valuation","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-07-12T00:46:20.409088Z"},"links":{"cited_paper":"/paper/2304.04258","citing_paper":"/paper/2607.03675"},"observation_digest":"sha256:343aaab6e26db21a6d77c1394500fc89e4b76ce4c2d72f4006d8bf36d2636f21","observation_id":"01e85189-273c-4153-8897-f59187e9daa6","resolution":{"observed_at":"2026-07-12T00:46:20.409088Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2304.04258/citation-record","integrity":"/paper/2304.04258/integrity","json":"/paper/2304.04258/citation-record.json","paper":"/paper/2304.04258"},"outbound":[],"paper":{"arxiv_id":"2304.04258","last_updated":"2023-11-26T04:35:41Z","latest_version":2,"primary_category":"stat.ML","snapshot_observed_at":"2026-07-06T15:13:48.035348Z","submitted_at":"2023-04-09T15:31:53Z","title":"A Note on \"Efficient Task-Specific Data Valuation for Nearest Neighbor Algorithms\""},"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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 7 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2304.04258."}