{"as_of":"2026-08-20T00:56:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:643460fa1e80d7a69e6505ecbb14778893562f7b0c6f2c9dcebd80b7ce0d677d","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-19T06:32:44.657259+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-08T12:08:16.023109Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-07-04T05:09:36.190223Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1106.1379","last_updated":"2016-05-28T21:58:42Z","snapshot_observed_at":"2026-08-15T04:44:31.739682Z","submitted_at":"2011-06-07T15:52:39Z","title":"A Unified Framework for Approximating and Clustering Data","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1106.1379","snapshot_observed_at":"2026-08-08T12:08:16.023109Z","title":"A unified framework for approximating and clustering data","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2502.07669","last_updated":"2025-02-11T16:14:53Z","snapshot_observed_at":"2026-08-17T14:04:24.771759Z","submitted_at":"2025-02-11T16:14:53Z","title":"Coresets for Robust Clustering via Black-box Reductions to Vanilla Case","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-08T12:08:16.023109Z"},"links":{"cited_paper":"/paper/1106.1379","citing_paper":"/paper/2502.07669"},"observation_digest":"sha256:6b997f1f1d356c06a27fe6dbca33d94f66426b11910f1c947c07e2a512eb3acd","observation_id":"232b3627-5160-496b-8932-250cdb12d544","resolution":{"observed_at":"2026-08-08T12:08:16.023109Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1106.1379","last_updated":"2016-05-28T21:58:42Z","snapshot_observed_at":"2026-08-15T04:44:31.739682Z","submitted_at":"2011-06-07T15:52:39Z","title":"A Unified Framework for Approximating and Clustering Data","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1106.1379","snapshot_observed_at":"2026-08-06T17:33:11.262417Z","title":"A unified framework for approximating and clustering data","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2507.11260","last_updated":"2026-06-11T07:08:52Z","snapshot_observed_at":"2026-08-13T13:08:22.615277Z","submitted_at":"2025-07-15T12:33:19Z","title":"Towards Tight Robust Coresets for $k$-Medians Clustering","version":2},"reference_index":2007,"source":"pdf_text","source_observed_at":"2026-08-06T17:33:11.262417Z"},"links":{"cited_paper":"/paper/1106.1379","citing_paper":"/paper/2507.11260"},"observation_digest":"sha256:d99d7bf864ef6fccec333ce49a0c0039d0de1d5678c9a185eec0882b8a6df143","observation_id":"e95735a5-2513-42f3-9da0-f146e92ecf80","resolution":{"observed_at":"2026-08-06T17:33:11.262417Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1106.1379","last_updated":"2016-05-28T21:58:42Z","snapshot_observed_at":"2026-08-15T04:44:31.739682Z","submitted_at":"2011-06-07T15:52:39Z","title":"A Unified Framework for Approximating and Clustering Data","version":4},"cited_work":{"arxiv_id":"1106.1379","doi":null,"metadata_source":"pith","pith_arxiv_id":"1106.1379","snapshot_observed_at":"2026-07-04T05:09:36.190223Z","title":"A Unified Framework for Approximating and Clustering Data","venue":"cs.LG","work_id":"61ca4c34-991a-4e95-9ab4-35c49523b111","year":2011},"citing_paper":{"arxiv_id":"2606.20082","last_updated":"2026-06-18T11:00:03Z","snapshot_observed_at":"2026-08-16T19:32:37.216366Z","submitted_at":"2026-06-18T11:00:03Z","title":"Beyond Averaging in John Ellipsoid Approximation: High-Accuracy Algorithms in the Leverage-Score Model","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-06-26T16:21:09.095664Z"},"links":{"cited_paper":"/paper/1106.1379","citing_paper":"/paper/2606.20082"},"observation_digest":"sha256:3c3cf39877c2d5299b3d4241f68619f666f9230bb993e54e0ec4a3932d10b375","observation_id":"b8ec1059-79de-4f93-a895-55d4918a7f86","resolution":{"observed_at":"2026-07-04T05:09:36.192134Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1106.1379/citation-record","integrity":"/paper/1106.1379/integrity","json":"/paper/1106.1379/citation-record.json","paper":"/paper/1106.1379"},"outbound":[],"paper":{"arxiv_id":"1106.1379","last_updated":"2016-05-28T21:58:42Z","latest_version":4,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-15T04:44:31.739682Z","submitted_at":"2011-06-07T15:52:39Z","title":"A Unified Framework for Approximating and Clustering Data"},"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-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"thesis":"As of 20 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:1106.1379."}