{"as_of":"2026-08-07T18:03:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:ab33c9ee0f0a7c88ae7991a7996e4515cb784ea52e1fbe2bfbd4d0a19d6549a9","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":14,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":14,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+00:00","state":"measured"},{"denominator":14,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":14,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T10:57:31.219175Z","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-07-04T02:39:25.529310Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1908.08619","last_updated":"2020-03-29T06:05:56Z","snapshot_observed_at":"2026-08-07T09:22:05.626598Z","submitted_at":"2019-08-22T23:09:27Z","title":"Efficient Task-Specific Data Valuation for Nearest Neighbor Algorithms","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1908.08619","snapshot_observed_at":"2026-08-07T10:57:31.219175Z","title":"Efficient task-specific data valuation for nearest neighbor algorithms","venue":null,"work_id":null,"year":1908},"citing_paper":{"arxiv_id":"2506.04026","last_updated":"2025-06-04T14:53:51Z","snapshot_observed_at":"2026-08-07T10:46:43.232461Z","submitted_at":"2025-06-04T14:53:51Z","title":"On the Usage of Gaussian Process for Efficient Data Valuation","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-07T10:57:31.219175Z"},"links":{"cited_paper":"/paper/1908.08619","citing_paper":"/paper/2506.04026"},"observation_digest":"sha256:d6c03befd8554d347f320ce95941bf12d64d1fe27e88f593d314e3c8416ae972","observation_id":"8b8e5694-c9c0-4f7b-8844-1b234ac84787","resolution":{"observed_at":"2026-08-07T10:57:31.219175Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1908.08619","last_updated":"2020-03-29T06:05:56Z","snapshot_observed_at":"2026-08-07T09:22:05.626598Z","submitted_at":"2019-08-22T23:09:27Z","title":"Efficient Task-Specific Data Valuation for Nearest Neighbor Algorithms","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1908.08619","snapshot_observed_at":"2026-08-07T00:56:03.092066Z","title":null,"venue":null,"work_id":null,"year":1908},"citing_paper":{"arxiv_id":"2506.12619","last_updated":"2025-06-14T20:20:15Z","snapshot_observed_at":"2026-08-07T00:42:54.410799Z","submitted_at":"2025-06-14T20:20:15Z","title":"Semivalue-based data valuation is arbitrary and gameable","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-07T00:56:03.092066Z"},"links":{"cited_paper":"/paper/1908.08619","citing_paper":"/paper/2506.12619"},"observation_digest":"sha256:e4e35155e7ea3bc8bf75d487bdae774a5d7f0f246161f2a4789a8391598d7da8","observation_id":"865ec851-e196-4ed0-a1a3-63f334a847e3","resolution":{"observed_at":"2026-08-07T00:56:03.092066Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1908.08619","last_updated":"2020-03-29T06:05:56Z","snapshot_observed_at":"2026-08-07T09:22:05.626598Z","submitted_at":"2019-08-22T23:09:27Z","title":"Efficient Task-Specific Data Valuation for Nearest Neighbor Algorithms","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1908.08619","snapshot_observed_at":"2026-08-06T21:50:21.992327Z","title":"mice: Multivariate Imputation by Chained Equations in R","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2506.23349","last_updated":"2025-07-30T07:49:04Z","snapshot_observed_at":"2026-08-06T21:42:41.548171Z","submitted_at":"2025-06-29T17:53:00Z","title":"A case for data valuation transparency via DValCards","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-06T21:50:21.992327Z"},"links":{"cited_paper":"/paper/1908.08619","citing_paper":"/paper/2506.23349"},"observation_digest":"sha256:3e022cba6b1438123c121fe5a5b182878949f0a0d305b5e8af9de8f68b829d3f","observation_id":"14abe577-a5ba-4a77-840e-99cb91743fba","resolution":{"observed_at":"2026-08-06T21:50:21.992327Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1908.08619","last_updated":"2020-03-29T06:05:56Z","snapshot_observed_at":"2026-08-07T09:22:05.626598Z","submitted_at":"2019-08-22T23:09:27Z","title":"Efficient Task-Specific Data Valuation for Nearest Neighbor Algorithms","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1908.08619","snapshot_observed_at":"2026-08-06T21:41:10.298643Z","title":"Efficient task-specific data valuation for nearest neighbor algorithms","venue":null,"work_id":null,"year":1908},"citing_paper":{"arxiv_id":"2506.23799","last_updated":"2025-07-02T22:50:21Z","snapshot_observed_at":"2026-08-06T21:29:12.084957Z","submitted_at":"2025-06-30T12:44:28Z","title":"KAIROS: Scalable Model-Agnostic Data Valuation","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-06T21:41:10.298643Z"},"links":{"cited_paper":"/paper/1908.08619","citing_paper":"/paper/2506.23799"},"observation_digest":"sha256:2c4eb1004b37d97b8f1ffec38a5dbf22a9af71637ca96b4b03ca56bd2b879242","observation_id":"4bb98c77-decb-4d4b-be09-c00eb4a77e22","resolution":{"observed_at":"2026-08-06T21:41:10.298643Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1908.08619","last_updated":"2020-03-29T06:05:56Z","snapshot_observed_at":"2026-08-07T09:22:05.626598Z","submitted_at":"2019-08-22T23:09:27Z","title":"Efficient Task-Specific Data Valuation for Nearest Neighbor Algorithms","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1908.08619","snapshot_observed_at":"2026-08-06T15:18:30.141599Z","title":"Efficient task-specific data valuation for nearest neighbor algorithms,","venue":null,"work_id":null,"year":1908},"citing_paper":{"arxiv_id":"2507.16872","last_updated":"2025-07-22T08:02:46Z","snapshot_observed_at":"2026-08-06T15:10:12.081789Z","submitted_at":"2025-07-22T08:02:46Z","title":"CompLeak: Deep Learning Model Compression Exacerbates Privacy Leakage","version":1},"reference_index":72,"source":"pdf_text","source_observed_at":"2026-08-06T15:18:30.141599Z"},"links":{"cited_paper":"/paper/1908.08619","citing_paper":"/paper/2507.16872"},"observation_digest":"sha256:546385985624b0fa9adf4a282f0ecc27e95e867767b45989e15b4395426372e4","observation_id":"51bfaa8f-36ae-45ed-84b5-ad3f1edc2868","resolution":{"observed_at":"2026-08-06T15:18:30.141599Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1908.08619","last_updated":"2020-03-29T06:05:56Z","snapshot_observed_at":"2026-08-07T09:22:05.626598Z","submitted_at":"2019-08-22T23:09:27Z","title":"Efficient Task-Specific Data Valuation for Nearest Neighbor Algorithms","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1908.08619","snapshot_observed_at":"2026-08-05T18:28:53.778662Z","title":"Efficient task-specific data valuation for nearest neighbor algorithms,","venue":null,"work_id":null,"year":1908},"citing_paper":{"arxiv_id":"2508.14648","last_updated":"2025-08-20T11:59:32Z","snapshot_observed_at":"2026-08-05T18:28:45.727081Z","submitted_at":"2025-08-20T11:59:32Z","title":"Understanding Data Influence with Differential Approximation","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-05T18:28:53.778662Z"},"links":{"cited_paper":"/paper/1908.08619","citing_paper":"/paper/2508.14648"},"observation_digest":"sha256:1400f764eb380dc24cb4baeb644c75285f48930517d2dfc478730daf49e86997","observation_id":"d9af9b18-a9b0-4455-84f5-d9de96378dd2","resolution":{"observed_at":"2026-08-05T18:28:53.778662Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1908.08619","last_updated":"2020-03-29T06:05:56Z","snapshot_observed_at":"2026-08-07T09:22:05.626598Z","submitted_at":"2019-08-22T23:09:27Z","title":"Efficient Task-Specific Data Valuation for Nearest Neighbor Algorithms","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1908.08619","snapshot_observed_at":"2026-08-03T06:10:20.071199Z","title":"Towards efficient data valuation based on the shapley value","venue":null,"work_id":null,"year":1908},"citing_paper":{"arxiv_id":"2602.00329","last_updated":"2026-07-22T02:36:11Z","snapshot_observed_at":"2026-08-07T12:31:48.020973Z","submitted_at":"2026-01-30T21:31:40Z","title":"In-Run Data Shapley for Adam Optimizer","version":4},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-03T06:10:20.071199Z"},"links":{"cited_paper":"/paper/1908.08619","citing_paper":"/paper/2602.00329"},"observation_digest":"sha256:72bf162144325d04ce195ed84c521688463355b6afc105e183faf4b206053f53","observation_id":"7fa31a97-aa96-422b-a9a2-ec1a5aa544ae","resolution":{"observed_at":"2026-08-03T06:10:20.071199Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1908.08619","last_updated":"2020-03-29T06:05:56Z","snapshot_observed_at":"2026-08-07T09:22:05.626598Z","submitted_at":"2019-08-22T23:09:27Z","title":"Efficient Task-Specific Data Valuation for Nearest Neighbor Algorithms","version":4},"cited_work":{"arxiv_id":"1908.08619","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1908.08619","snapshot_observed_at":"2026-07-04T02:39:25.529310Z","title":"arXiv preprint arXiv:1908.08619 , year=","venue":null,"work_id":"b3c1c96e-b637-4da4-9bd6-92618608721f","year":1908},"citing_paper":{"arxiv_id":"2604.08821","last_updated":"2026-04-09T23:30:22Z","snapshot_observed_at":"2026-08-02T05:32:20.221232Z","submitted_at":"2026-04-09T23:30:22Z","title":"Buying Data of Unknown Quality: Fisher Information Procurement Auctions","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-10T16:40:16.981339Z"},"links":{"cited_paper":"/paper/1908.08619","citing_paper":"/paper/2604.08821"},"observation_digest":"sha256:c552b6180b4b5c0b84e2bed356e975de279c9eb7002b6e050e9fdc516e422728","observation_id":"a467a41a-1a25-4194-9d85-e222e891d700","resolution":{"observed_at":"2026-05-11T08:25:58.737286Z","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":"1908.08619","last_updated":"2020-03-29T06:05:56Z","snapshot_observed_at":"2026-08-07T09:22:05.626598Z","submitted_at":"2019-08-22T23:09:27Z","title":"Efficient Task-Specific Data Valuation for Nearest Neighbor Algorithms","version":4},"cited_work":{"arxiv_id":"1908.08619","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1908.08619","snapshot_observed_at":"2026-07-04T02:39:25.529310Z","title":"arXiv preprint arXiv:1908.08619 , year=","venue":null,"work_id":"b3c1c96e-b637-4da4-9bd6-92618608721f","year":1908},"citing_paper":{"arxiv_id":"2605.20620","last_updated":"2026-05-20T02:09:55Z","snapshot_observed_at":"2026-08-02T18:47:17.420346Z","submitted_at":"2026-05-20T02:09:55Z","title":"Dynamic Shapley Computation","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-05-21T06:37:58.707160Z"},"links":{"cited_paper":"/paper/1908.08619","citing_paper":"/paper/2605.20620"},"observation_digest":"sha256:904e8ce531204b3efc3ca529408aa6b8081017b9a7e6ba65735ab4c294064dad","observation_id":"6c4fba0a-9ea6-40ec-a4b0-a809584fbab6","resolution":{"observed_at":"2026-05-21T06:39:43.789546Z","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":"1908.08619","last_updated":"2020-03-29T06:05:56Z","snapshot_observed_at":"2026-08-07T09:22:05.626598Z","submitted_at":"2019-08-22T23:09:27Z","title":"Efficient Task-Specific Data Valuation for Nearest Neighbor Algorithms","version":4},"cited_work":{"arxiv_id":"1908.08619","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1908.08619","snapshot_observed_at":"2026-07-04T02:39:25.529310Z","title":"arXiv preprint arXiv:1908.08619 , year=","venue":null,"work_id":"b3c1c96e-b637-4da4-9bd6-92618608721f","year":1908},"citing_paper":{"arxiv_id":"2606.12615","last_updated":"2026-06-10T19:16:26Z","snapshot_observed_at":"2026-08-07T08:57:38.685069Z","submitted_at":"2026-06-10T19:16:26Z","title":"Towards Provably Fair Machine Learning: Bayesian Approaches For Consistent and Transparent Predictions","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-06-27T09:55:35.961288Z"},"links":{"cited_paper":"/paper/1908.08619","citing_paper":"/paper/2606.12615"},"observation_digest":"sha256:4e2f7f762d23f29c9f61551282596110a1d58d44c19cb73e3cebb9aa626641bb","observation_id":"ccfe9aa9-5ef5-43bf-a631-4f397bf9f5ff","resolution":{"observed_at":"2026-07-03T10:37:56.835444Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"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":"1908.08619","last_updated":"2020-03-29T06:05:56Z","snapshot_observed_at":"2026-08-07T09:22:05.626598Z","submitted_at":"2019-08-22T23:09:27Z","title":"Efficient Task-Specific Data Valuation for Nearest Neighbor Algorithms","version":4},"cited_work":{"arxiv_id":"1908.08619","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1908.08619","snapshot_observed_at":"2026-07-04T02:39:25.529310Z","title":"arXiv preprint arXiv:1908.08619 , year=","venue":null,"work_id":"b3c1c96e-b637-4da4-9bd6-92618608721f","year":1908},"citing_paper":{"arxiv_id":"2606.18729","last_updated":"2026-06-29T05:13:28Z","snapshot_observed_at":"2026-07-06T23:54:09.140085Z","submitted_at":"2026-06-17T06:16:16Z","title":"TimeLAVA: Learning-Agnostic Valuation for Time Series Data","version":2},"reference_index":77,"source":"arxiv_source","source_observed_at":"2026-06-26T19:24:11.409158Z"},"links":{"cited_paper":"/paper/1908.08619","citing_paper":"/paper/2606.18729"},"observation_digest":"sha256:b62f09a5bde3a0bef77c910f8391218d79e31650acef499e4854890fc841906f","observation_id":"f5b7da6f-91e0-4bca-b1c9-08b1452d35ac","resolution":{"observed_at":"2026-07-04T02:39:25.530831Z","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":"1908.08619","last_updated":"2020-03-29T06:05:56Z","snapshot_observed_at":"2026-08-07T09:22:05.626598Z","submitted_at":"2019-08-22T23:09:27Z","title":"Efficient Task-Specific Data Valuation for Nearest Neighbor Algorithms","version":4},"cited_work":{"arxiv_id":"1908.08619","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1908.08619","snapshot_observed_at":"2026-07-04T02:39:25.529310Z","title":"arXiv preprint arXiv:1908.08619 , year=","venue":null,"work_id":"b3c1c96e-b637-4da4-9bd6-92618608721f","year":1908},"citing_paper":{"arxiv_id":"2606.18729","last_updated":"2026-06-29T05:13:28Z","snapshot_observed_at":"2026-07-06T23:54:09.140085Z","submitted_at":"2026-06-17T06:16:16Z","title":"TimeLAVA: Learning-Agnostic Valuation for Time Series Data","version":3},"reference_index":77,"source":"arxiv_source","source_observed_at":"2026-06-30T11:26:55.141746Z"},"links":{"cited_paper":"/paper/1908.08619","citing_paper":"/paper/2606.18729"},"observation_digest":"sha256:26bcecc1dd65ca2a62c375effe60da0b2d3ecf252aa921b5b8cc4d63ec7a79de","observation_id":"dc5289cd-8ff5-4353-829e-6abe49b37ff5","resolution":{"observed_at":"2026-06-30T11:34:38.138785Z","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":"1908.08619","last_updated":"2020-03-29T06:05:56Z","snapshot_observed_at":"2026-08-07T09:22:05.626598Z","submitted_at":"2019-08-22T23:09:27Z","title":"Efficient Task-Specific Data Valuation for Nearest Neighbor Algorithms","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1908.08619","snapshot_observed_at":"2026-07-12T02:56:23.522332Z","title":"Efficient task-specific data valuation for nearest neighbor algorithms.arXiv preprint arXiv:1908.08619, 2019","venue":null,"work_id":null,"year":1908},"citing_paper":{"arxiv_id":"2607.03374","last_updated":"2026-07-03T14:28:25Z","snapshot_observed_at":"2026-08-07T09:35:55.886266Z","submitted_at":"2026-07-03T14:28:25Z","title":"An Asymptotic Analysis of the Shapley Value for Dataset Valuation","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-07-12T02:56:23.522332Z"},"links":{"cited_paper":"/paper/1908.08619","citing_paper":"/paper/2607.03374"},"observation_digest":"sha256:9546b3d41fe327c7c21b70a3c624d5d56bb9323b4396d21807bc2b6594e7f3ca","observation_id":"c61d7b94-42ad-4038-8f6c-797de1d0fd63","resolution":{"observed_at":"2026-07-12T02:56:23.522332Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1908.08619","last_updated":"2020-03-29T06:05:56Z","snapshot_observed_at":"2026-08-07T09:22:05.626598Z","submitted_at":"2019-08-22T23:09:27Z","title":"Efficient Task-Specific Data Valuation for Nearest Neighbor Algorithms","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1908.08619","snapshot_observed_at":"2026-07-12T00:46:20.409088Z","title":"Efficient task-specific data valuation for nearest neighbor algorithms.arXiv preprint arXiv:1908.08619, 2019","venue":null,"work_id":null,"year":1908},"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":6,"source":"pdf_text","source_observed_at":"2026-07-12T00:46:20.409088Z"},"links":{"cited_paper":"/paper/1908.08619","citing_paper":"/paper/2607.03675"},"observation_digest":"sha256:a4812282729ecbf5701de7630fc2a36fdaa11978af92a90b12c1e2b807f9d492","observation_id":"ec824155-12a2-43c6-918f-cd18cdbb4704","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/1908.08619/citation-record","integrity":"/paper/1908.08619/integrity","json":"/paper/1908.08619/citation-record.json","paper":"/paper/1908.08619"},"outbound":[],"paper":{"arxiv_id":"1908.08619","last_updated":"2020-03-29T06:05:56Z","latest_version":4,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-07T09:22:05.626598Z","submitted_at":"2019-08-22T23:09:27Z","title":"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 14 inbound Pith citation observations for arXiv:1908.08619."}