{"as_of":"2026-08-18T13:16:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:1cb7927bae6639040011fe828a2e9204c155fc972ca6e36d739de229594df690","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-18T06:34:40.430872+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-16T11:19:41.106274Z","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-08-11T14:35:39.027987Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1008.0587","last_updated":"2010-08-03T16:28:10Z","snapshot_observed_at":"2026-08-18T08:15:30.082444Z","submitted_at":"2010-08-03T16:28:10Z","title":"Row Sampling for Matrix Algorithms via a Non-Commutative Bernstein Bound","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1008.0587","snapshot_observed_at":"2026-08-11T20:15:03.140200Z","title":"Row sampling for matrix algorithms via a non-commutative bernstein bound","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2412.06063","last_updated":"2024-12-08T20:34:16Z","snapshot_observed_at":"2026-08-17T06:11:40.618083Z","submitted_at":"2024-12-08T20:34:16Z","title":"On Socially Fair Low-Rank Approximation and Column Subset Selection","version":1},"reference_index":60,"source":"arxiv_source","source_observed_at":"2026-08-11T20:15:03.140200Z"},"links":{"cited_paper":"/paper/1008.0587","citing_paper":"/paper/2412.06063"},"observation_digest":"sha256:1c047a2315f76255bf7a6627752a92f9b14ab066a9a3442052cc9f416e13e588","observation_id":"a996f1b8-273c-421c-8374-8e84d1e79faa","resolution":{"observed_at":"2026-08-11T20:15:03.140200Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1008.0587","last_updated":"2010-08-03T16:28:10Z","snapshot_observed_at":"2026-08-18T08:15:30.082444Z","submitted_at":"2010-08-03T16:28:10Z","title":"Row Sampling for Matrix Algorithms via a Non-Commutative Bernstein Bound","version":1},"cited_work":{"arxiv_id":"1008.0587","doi":null,"metadata_source":"pith","pith_arxiv_id":"1008.0587","snapshot_observed_at":"2026-08-11T14:35:39.027987Z","title":"Row Sampling for Matrix Algorithms via a Non-Commutative Bernstein Bound","venue":"cs.DS","work_id":"029b7fc2-bcd7-46fd-8b25-2419ac007747","year":2010},"citing_paper":{"arxiv_id":"2412.11963","last_updated":"2024-12-16T16:45:16Z","snapshot_observed_at":"2026-08-11T14:22:58.676796Z","submitted_at":"2024-12-16T16:45:16Z","title":"Approximating the Top Eigenvector in Random Order Streams","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-11T14:35:38.920338Z"},"links":{"cited_paper":"/paper/1008.0587","citing_paper":"/paper/2412.11963"},"observation_digest":"sha256:0d711361981ce902dd3696b8d32a3570267fb6778f752793f9d2811fe3750fa3","observation_id":"f3417fad-e4d9-4836-9893-d81a8854eb5a","resolution":{"observed_at":"2026-08-11T14:35:39.034181Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1008.0587","last_updated":"2010-08-03T16:28:10Z","snapshot_observed_at":"2026-08-18T08:15:30.082444Z","submitted_at":"2010-08-03T16:28:10Z","title":"Row Sampling for Matrix Algorithms via a Non-Commutative Bernstein Bound","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1008.0587","snapshot_observed_at":"2026-08-16T11:19:41.106274Z","title":"Row sampling for matrix algorithms via a non-commutative bernstein bound","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2504.16229","last_updated":"2025-04-22T19:49:52Z","snapshot_observed_at":"2026-08-16T19:22:29.617450Z","submitted_at":"2025-04-22T19:49:52Z","title":"Fast, Space-Optimal Streaming Algorithms for Clustering and Subspace Embeddings","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-16T11:19:41.106274Z"},"links":{"cited_paper":"/paper/1008.0587","citing_paper":"/paper/2504.16229"},"observation_digest":"sha256:cebdd10f66627f36c089dd1365f486ee6dfa8fdc08ee4033750ef582f7854d74","observation_id":"69f99dc9-76f7-4e83-9c94-23764b994fb0","resolution":{"observed_at":"2026-08-16T11:19:41.106274Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/1008.0587/citation-record","integrity":"/paper/1008.0587/integrity","json":"/paper/1008.0587/citation-record.json","paper":"/paper/1008.0587"},"outbound":[],"paper":{"arxiv_id":"1008.0587","last_updated":"2010-08-03T16:28:10Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-18T08:15:30.082444Z","submitted_at":"2010-08-03T16:28:10Z","title":"Row Sampling for Matrix Algorithms via a Non-Commutative Bernstein Bound"},"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-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:1008.0587."}