{"as_of":"2026-08-06T15:44:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:2cd8377596118d5210d532caa9a5ff2264c5123e327ffa78237ea59e8365a659","coverage":[{"denominator":12,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":12,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-25T11:06:23.716668Z","state":"measured"},{"denominator":12,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":12,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-06T06:34:29.942622+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/1907.01433/citation-record","integrity":"/paper/1907.01433/integrity","json":"/paper/1907.01433/citation-record.json","paper":"/paper/1907.01433"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Regression analysis in small- n-large-p using interactive prior elicitation of pairwise similarities","venue":null,"work_id":"e53cf083-f0a3-461c-b315-52db8053c034","year":2016},"citing_paper":{"arxiv_id":"1907.01433","last_updated":"2019-07-02T15:19:37Z","snapshot_observed_at":"2026-08-02T19:23:47.575850Z","submitted_at":"2019-07-02T15:19:37Z","title":"Tight Sensitivity Bounds For Smaller Coresets","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-05-25T11:06:23.716668Z"},"links":{"citing_paper":"/paper/1907.01433"},"observation_digest":"sha256:047af0df1a27261105f12947bb5bbf3d7350a1055366741a31e73fd532a356f7","observation_id":"39294b7a-e7bf-4f11-8507-0bb2a1ffa288","resolution":{"observed_at":"2026-05-25T11:06:57.543223Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1511.08990","last_updated":"2016-02-07T17:01:46Z","snapshot_observed_at":"2026-07-06T04:38:03.919885Z","submitted_at":"2015-11-29T10:06:11Z","title":"k-Means for Streaming and Distributed Big Sparse Data","version":2},"cited_work":{"arxiv_id":"1511.08990","doi":null,"metadata_source":"pith","pith_arxiv_id":"1511.08990","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"k-Means for Streaming and Distributed Big Sparse Data","venue":"cs.DS","work_id":"88241266-8a98-4dc9-8fda-359bd69e5344","year":2015},"citing_paper":{"arxiv_id":"1907.01433","last_updated":"2019-07-02T15:19:37Z","snapshot_observed_at":"2026-08-02T19:23:47.575850Z","submitted_at":"2019-07-02T15:19:37Z","title":"Tight Sensitivity Bounds For Smaller Coresets","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-25T11:06:23.716668Z"},"links":{"cited_paper":"/paper/1511.08990","citing_paper":"/paper/1907.01433"},"observation_digest":"sha256:06a66f63f851277033a0b1065ba0ce8ce8c2d4537a644e47de7d34393f797fa6","observation_id":"9c93df72-9001-4450-aaa2-5b5b1eefcd1e","resolution":{"observed_at":"2026-05-25T11:06:57.206917Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1612.00889","last_updated":"2022-09-18T13:42:11Z","snapshot_observed_at":"2026-08-04T15:16:32.774531Z","submitted_at":"2016-12-02T23:04:16Z","title":"New Frameworks for Offline and Streaming Coreset Constructions","version":3},"cited_work":{"arxiv_id":"1612.00889","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1612.00889","snapshot_observed_at":"2026-06-29T09:03:15.945446Z","title":"New frameworks for offline and streaming coreset constructions","venue":null,"work_id":"4cc17a78-eeed-4080-8dbb-566c870c3e67","year":2016},"citing_paper":{"arxiv_id":"1907.01433","last_updated":"2019-07-02T15:19:37Z","snapshot_observed_at":"2026-08-02T19:23:47.575850Z","submitted_at":"2019-07-02T15:19:37Z","title":"Tight Sensitivity Bounds For Smaller Coresets","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-25T11:06:23.716668Z"},"links":{"cited_paper":"/paper/1612.00889","citing_paper":"/paper/1907.01433"},"observation_digest":"sha256:56cec6e50a4bd3849a86c9d68e627602f9fd0e44902e5ea635244ed19264df72","observation_id":"f20abb1a-7cc9-400e-9995-5e1b82b330d1","resolution":{"observed_at":"2026-05-25T11:06:57.185250Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1410.6801","last_updated":"2015-04-03T02:33:24Z","snapshot_observed_at":"2026-07-06T03:58:26.443457Z","submitted_at":"2014-10-24T19:43:16Z","title":"Dimensionality Reduction for k-Means Clustering and Low Rank Approximation","version":3},"cited_work":{"arxiv_id":"1410.6801","doi":null,"metadata_source":"pith","pith_arxiv_id":"1410.6801","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Dimensionality Reduction for k-Means Clustering and Low Rank Approximation","venue":"cs.DS","work_id":"7087492f-e7f8-4fcf-a87e-45dfae7c5f8c","year":2014},"citing_paper":{"arxiv_id":"1907.01433","last_updated":"2019-07-02T15:19:37Z","snapshot_observed_at":"2026-08-02T19:23:47.575850Z","submitted_at":"2019-07-02T15:19:37Z","title":"Tight Sensitivity Bounds For Smaller Coresets","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-25T11:06:23.716668Z"},"links":{"cited_paper":"/paper/1410.6801","citing_paper":"/paper/1907.01433"},"observation_digest":"sha256:3d074af6f0a8387e03fe4e3089a57f3cc79b4034b3b0ff3ab2da31fe3e168366","observation_id":"b9805a73-ab1b-4db4-ac7d-2ab619b0107a","resolution":{"observed_at":"2026-05-25T11:06:57.194332Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"xx/1976236","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"3b59ea12-fc53-42a3-9bb2-6c68cb606afb","year":null},"citing_paper":{"arxiv_id":"1907.01433","last_updated":"2019-07-02T15:19:37Z","snapshot_observed_at":"2026-08-02T19:23:47.575850Z","submitted_at":"2019-07-02T15:19:37Z","title":"Tight Sensitivity Bounds For Smaller Coresets","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-25T11:06:23.716668Z"},"links":{"citing_paper":"/paper/1907.01433"},"observation_digest":"sha256:07f220754149f4e87a00b3c781b9a0a182fc715a5b594bb8d04dd9c8eb296256","observation_id":"1ce61ddd-c16a-42b5-9757-fb4c268a3cf3","resolution":{"observed_at":"2026-05-25T11:06:57.217590Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1807.04518","last_updated":"2018-07-12T10:25:12Z","snapshot_observed_at":"2026-08-03T16:25:15.704112Z","submitted_at":"2018-07-12T10:25:12Z","title":"Turning Big data into tiny data: Constant-size coresets for k-means, PCA and projective clustering","version":1},"cited_work":{"arxiv_id":"1807.04518","doi":null,"metadata_source":"pith","pith_arxiv_id":"1807.04518","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Turning Big data into tiny data: Constant-size coresets for k-means, PCA and projective clustering","venue":"cs.DS","work_id":"42f346c2-4673-44de-8f2f-43eb9e21c36a","year":2018},"citing_paper":{"arxiv_id":"1907.01433","last_updated":"2019-07-02T15:19:37Z","snapshot_observed_at":"2026-08-02T19:23:47.575850Z","submitted_at":"2019-07-02T15:19:37Z","title":"Tight Sensitivity Bounds For Smaller Coresets","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-25T11:06:23.716668Z"},"links":{"cited_paper":"/paper/1807.04518","citing_paper":"/paper/1907.01433"},"observation_digest":"sha256:b3ee514e861ee5cf17e951a074ba034cfa4d705326ffd0cfeea00441695e7cc9","observation_id":"a3e58afd-9313-4dae-88a5-677b8fccd16c","resolution":{"observed_at":"2026-05-25T11:06:57.210649Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"SciPy: Open source scientific tools for Python, 2001–","venue":null,"work_id":"1e6d4b2b-58b8-4a9f-b4bd-c0f5b0d7cc61","year":2001},"citing_paper":{"arxiv_id":"1907.01433","last_updated":"2019-07-02T15:19:37Z","snapshot_observed_at":"2026-08-02T19:23:47.575850Z","submitted_at":"2019-07-02T15:19:37Z","title":"Tight Sensitivity Bounds For Smaller Coresets","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-25T11:06:23.716668Z"},"links":{"citing_paper":"/paper/1907.01433"},"observation_digest":"sha256:11474fe488600023d33f119faae4bc5674e35e091e9202655552a13777364218","observation_id":"cbb673eb-6cc8-4e77-b1e0-2c8fca62094f","resolution":{"observed_at":"2026-05-25T11:06:57.545934Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1301.3781","last_updated":"2013-09-07T00:30:40Z","snapshot_observed_at":"2026-07-06T03:04:11.148340Z","submitted_at":"2013-01-16T18:24:43Z","title":"Efficient Estimation of Word Representations in Vector Space","version":3},"cited_work":{"arxiv_id":"1301.3781","doi":"10.48550/arxiv.1301.3781","metadata_source":"pith","pith_arxiv_id":"1301.3781","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Efficient Estimation of Word Representations in Vector Space","venue":"cs.CL","work_id":"59edaa01-a696-45b3-9a08-5eae777a799e","year":2013},"citing_paper":{"arxiv_id":"1907.01433","last_updated":"2019-07-02T15:19:37Z","snapshot_observed_at":"2026-08-02T19:23:47.575850Z","submitted_at":"2019-07-02T15:19:37Z","title":"Tight Sensitivity Bounds For Smaller Coresets","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-25T11:06:23.716668Z"},"links":{"cited_paper":"/paper/1301.3781","citing_paper":"/paper/1907.01433"},"observation_digest":"sha256:3caedacd70ec1448646200086c59184f77d9967ee5f9476d2ad6ddfacf570664","observation_id":"572c6e32-d7a1-458c-9332-5f3dee44bdc5","resolution":{"observed_at":"2026-05-25T11:06:57.203308Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-07-14T06:20:53.853167+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-14T06:20:53.853167+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1906.04705","last_updated":"2020-09-06T14:50:39Z","snapshot_observed_at":"2026-07-06T07:59:37.215548Z","submitted_at":"2019-06-11T17:12:02Z","title":"Fast and Accurate Least-Mean-Squares Solvers","version":2},"cited_work":{"arxiv_id":"1906.04705","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1906.04705","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Fast and accurate least-mean- squares solvers","venue":null,"work_id":"a7018e9d-997a-411c-a468-c30d932d08dd","year":1906},"citing_paper":{"arxiv_id":"1907.01433","last_updated":"2019-07-02T15:19:37Z","snapshot_observed_at":"2026-08-02T19:23:47.575850Z","submitted_at":"2019-07-02T15:19:37Z","title":"Tight Sensitivity Bounds For Smaller Coresets","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-25T11:06:23.716668Z"},"links":{"cited_paper":"/paper/1906.04705","citing_paper":"/paper/1907.01433"},"observation_digest":"sha256:1e8c9d98e00ac1965215e5ce2a8e9fb5eaa2031abb0ca03d68dc44d0f5a706f3","observation_id":"2b7693e4-57b7-4925-b2a1-a8f9eb8fd369","resolution":{"observed_at":"2026-05-25T11:06:57.199146Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Improved approximation algorithms for large matrices via random pro- jections","venue":null,"work_id":"12395bb6-5573-4e47-bf53-1922d4b0f12f","year":2006},"citing_paper":{"arxiv_id":"1907.01433","last_updated":"2019-07-02T15:19:37Z","snapshot_observed_at":"2026-08-02T19:23:47.575850Z","submitted_at":"2019-07-02T15:19:37Z","title":"Tight Sensitivity Bounds For Smaller Coresets","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-05-25T11:06:23.716668Z"},"links":{"citing_paper":"/paper/1907.01433"},"observation_digest":"sha256:21d1ded7e3bf0981dac0b91d70d7b209f334f6f1140c65ad570e4f82265fa347","observation_id":"3e7ef984-e350-4fa1-af31-0fba75fc8875","resolution":{"observed_at":"2026-05-25T11:06:57.540689Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1803.08700","last_updated":"2020-01-06T08:18:36Z","snapshot_observed_at":"2026-07-06T06:29:50.447216Z","submitted_at":"2018-03-23T09:17:48Z","title":"Determinantal Point Processes for Coresets","version":3},"cited_work":{"arxiv_id":"1803.08700","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1803.08700","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Determinantal point processes for coresets","venue":null,"work_id":"b2cf809f-4112-44cd-88e2-ef77969aacf1","year":null},"citing_paper":{"arxiv_id":"1907.01433","last_updated":"2019-07-02T15:19:37Z","snapshot_observed_at":"2026-08-02T19:23:47.575850Z","submitted_at":"2019-07-02T15:19:37Z","title":"Tight Sensitivity Bounds For Smaller Coresets","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-05-25T11:06:23.716668Z"},"links":{"cited_paper":"/paper/1803.08700","citing_paper":"/paper/1907.01433"},"observation_digest":"sha256:fbacbb17446df9567e3ec55911e40955ec9a0f159cb02bcf2bc704a881ee7bee","observation_id":"d552138d-a66a-47c3-bef6-1bd0e426f879","resolution":{"observed_at":"2026-05-25T11:06:57.189589Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1209.4893","last_updated":"2012-10-10T22:22:46Z","snapshot_observed_at":"2026-07-06T02:56:05.416759Z","submitted_at":"2012-09-21T19:55:53Z","title":"On the Sensitivity of Shape Fitting Problems","version":2},"cited_work":{"arxiv_id":"1209.4893","doi":null,"metadata_source":"pith","pith_arxiv_id":"1209.4893","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"On the Sensitivity of Shape Fitting Problems","venue":"cs.CG","work_id":"d42fa056-ac78-44ec-bf2d-988339f5e121","year":2012},"citing_paper":{"arxiv_id":"1907.01433","last_updated":"2019-07-02T15:19:37Z","snapshot_observed_at":"2026-08-02T19:23:47.575850Z","submitted_at":"2019-07-02T15:19:37Z","title":"Tight Sensitivity Bounds For Smaller Coresets","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-05-25T11:06:23.716668Z"},"links":{"cited_paper":"/paper/1209.4893","citing_paper":"/paper/1907.01433"},"observation_digest":"sha256:da8ae964d08057487c1ac4d5d25b0d26e81e2abcad4c448027eec29d30f4887f","observation_id":"9081823b-6cfc-446d-9a50-95e84de8e371","resolution":{"observed_at":"2026-05-25T11:06:57.213888Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"1907.01433","last_updated":"2019-07-02T15:19:37Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-02T19:23:47.575850Z","submitted_at":"2019-07-02T15:19:37Z","title":"Tight Sensitivity Bounds For Smaller Coresets"},"reference_resolution":{"displayed":12,"state_counts":{"malformed_identifier":0,"metadata_mismatch":3,"parse_uncertain":0,"unresolved":0,"verified_exact":6,"verified_fuzzy":3},"total_outbound_references":12},"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-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"thesis":"As of 6 August 2026, this Paper Citation Record lists 12 of 12 outbound references and 0 inbound Pith citation observations for arXiv:1907.01433."}