Pith. sign in

Paper Citation Record · LEDGER

Row Sampling for Matrix Algorithms via a Non-Commutative Bernstein Bound

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.

A citation records a reference. It does not transfer a finding from one paper to another.

pith.paper-citation-record.v1
1008.0587 v1

Coverage vector

measured 0 of 0 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links

measured 3 of 3 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-17T06:30:58.91139+00:00

measured 3 of 3 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-16T11:19:41.106274Z

measured 0 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: pith, observed 2026-08-11T14:35:39.027987Z

Reference resolution

0 of 0 outbound references displayed

  • verified exact0
  • verified fuzzy0
  • unresolved0
  • parse uncertain0
  • malformed identifier0
  • metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

No outbound reference observations are available for this paper version.

Pith citing papers

Observation a996f1b8-273c-421c-8374-8e84d1e79faa · inbound

On Socially Fair Low-Rank Approximation and Column Subset Selection cites this paper.

On Socially Fair Low-Rank Approximation and Column Subset Selection Row Sampling for Matrix Algorithms via a Non-Commutative Bernstein Bound

Reference 60

Resolution
unresolved
no resolver link, observed 2026-08-11T20:15:03.140200Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-11T20:15:03.140200Z digest=sha256:6334f16f0cd76f16b14f5f0722663c389f6acc7f9ed29bc52d58d5b513e61455

Observation f3417fad-e4d9-4836-9893-d81a8854eb5a · inbound

Approximating the Top Eigenvector in Random Order Streams cites this paper.

Approximating the Top Eigenvector in Random Order Streams Row Sampling for Matrix Algorithms via a Non-Commutative Bernstein Bound

Reference 16

Resolution
verified exact
local_arxiv, observed 2026-08-11T14:35:39.034181Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

source=arxiv_source observed=2026-08-11T14:35:38.920338Z digest=sha256:c34172a9ceaa2810d32fe2d81a8c56d962f2d6acb266d7d6ef98a3f2bd35072e

Observation 69f99dc9-76f7-4e83-9c94-23764b994fb0 · inbound

Fast, Space-Optimal Streaming Algorithms for Clustering and Subspace Embeddings cites this paper.

Fast, Space-Optimal Streaming Algorithms for Clustering and Subspace Embeddings Row Sampling for Matrix Algorithms via a Non-Commutative Bernstein Bound

Reference 42

Resolution
unresolved
no resolver link, observed 2026-08-16T11:19:41.106274Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-16T11:19:41.106274Z digest=sha256:1db5a5326ec7fa87187b56f7b4094cf4a0672809243b9f7cc553d4eda3f5b72a