{"as_of":"2026-08-10T11:16:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:1f85f7690f8d58de4ffbd2c37a0788aacbbd124f2951e6becd5d111ff68a339f","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-10T06:31:04.303077+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-06T16:45:03.092115Z","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-06-30T21:55:05.988169Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2312.10602","last_updated":"2023-12-17T04:41:07Z","snapshot_observed_at":"2026-08-10T01:02:16.983663Z","submitted_at":"2023-12-17T04:41:07Z","title":"A Weighted K-Center Algorithm for Data Subset Selection","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2312.10602","snapshot_observed_at":"2026-08-06T16:45:03.092115Z","title":"A weighted k- center algorithm for data subset selection","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2507.12750","last_updated":"2025-07-17T03:08:26Z","snapshot_observed_at":"2026-08-10T02:31:31.081709Z","submitted_at":"2025-07-17T03:08:26Z","title":"Multimodal-Guided Dynamic Dataset Pruning for Robust and Efficient Data-Centric Learning","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-06T16:45:03.092115Z"},"links":{"cited_paper":"/paper/2312.10602","citing_paper":"/paper/2507.12750"},"observation_digest":"sha256:c91c4fd96b5a785f059435e84398de02eca2d21ddaae3e17e52417b38fa22533","observation_id":"232bb2ab-8948-4894-b30e-f64679b049cb","resolution":{"observed_at":"2026-08-06T16:45:03.092115Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2312.10602","last_updated":"2023-12-17T04:41:07Z","snapshot_observed_at":"2026-08-10T01:02:16.983663Z","submitted_at":"2023-12-17T04:41:07Z","title":"A Weighted K-Center Algorithm for Data Subset Selection","version":1},"cited_work":{"arxiv_id":"2312.10602","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2312.10602","snapshot_observed_at":"2026-06-30T21:55:05.988169Z","title":"Schulman, J., Moritz, P., Levine, S., Jordan, M., and Abbeel, P","venue":null,"work_id":"96e9fad1-596b-41f9-9349-8268e1722ab6","year":2023},"citing_paper":{"arxiv_id":"2603.07433","last_updated":"2026-05-13T01:27:10Z","snapshot_observed_at":"2026-08-09T13:21:23.189786Z","submitted_at":"2026-03-08T03:10:39Z","title":"Data Agent: Learning to Select Data via End-to-End Dynamic Optimization","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-05-15T15:23:23.950152Z"},"links":{"cited_paper":"/paper/2312.10602","citing_paper":"/paper/2603.07433"},"observation_digest":"sha256:4ab36ea7f1390108c3daa412796aa6e3798e94774977446be3c06e9c624c2273","observation_id":"1b74ec71-4cd2-4ef5-8254-34c8d150f58d","resolution":{"observed_at":"2026-05-15T15:26:10.879867Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2312.10602","last_updated":"2023-12-17T04:41:07Z","snapshot_observed_at":"2026-08-10T01:02:16.983663Z","submitted_at":"2023-12-17T04:41:07Z","title":"A Weighted K-Center Algorithm for Data Subset Selection","version":1},"cited_work":{"arxiv_id":"2312.10602","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2312.10602","snapshot_observed_at":"2026-06-30T21:55:05.988169Z","title":"Schulman, J., Moritz, P., Levine, S., Jordan, M., and Abbeel, P","venue":null,"work_id":"96e9fad1-596b-41f9-9349-8268e1722ab6","year":2023},"citing_paper":{"arxiv_id":"2605.14773","last_updated":"2026-05-14T12:37:11Z","snapshot_observed_at":"2026-08-02T17:17:14.233601Z","submitted_at":"2026-05-14T12:37:11Z","title":"Beyond What to Select: A Plug-and-play Oscillatory Data-Volume Scheduling for Efficient Model Training","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-06-30T21:49:36.142405Z"},"links":{"cited_paper":"/paper/2312.10602","citing_paper":"/paper/2605.14773"},"observation_digest":"sha256:7a8083b61fae02bcd25c9bc0908994a0ee2a846ab7f1f57ad48e9118a245adb5","observation_id":"0cff7c11-f498-40a9-87ae-dacad56b7f85","resolution":{"observed_at":"2026-06-30T21:55:05.990077Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2312.10602/citation-record","integrity":"/paper/2312.10602/integrity","json":"/paper/2312.10602/citation-record.json","paper":"/paper/2312.10602"},"outbound":[],"paper":{"arxiv_id":"2312.10602","last_updated":"2023-12-17T04:41:07Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-10T01:02:16.983663Z","submitted_at":"2023-12-17T04:41:07Z","title":"A Weighted K-Center Algorithm for Data Subset Selection"},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2312.10602."}