Paper Citation Record · LEDGER

Optimal Oblivious Subspace Embeddings with Near-optimal Sparsity

As of 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 5 inbound Pith citation observations for arXiv:2411.08773.

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

pith.paper-citation-record.v1
2411.08773 v2

Coverage vector

measured 0 of 0 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links

measured 5 of 5 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-08T06:32:00.761636+00:00

measured 5 of 5 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-05T14:36:50.224357Z

measured 0 of 1 external citation measurements

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

Source: pith, observed 2026-07-07T13:23:47.461891Z

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 00c0ce53-d1d8-4979-a92f-d3288132c8a0 · inbound

Faster Linear Algebra Algorithms with Structured Random Matrices cites this paper.

Faster Linear Algebra Algorithms with Structured Random Matrices Optimal Oblivious Subspace Embeddings with Near-optimal Sparsity

Reference 32

Resolution: unresolved; no resolver link, observed 2026-08-05T14:36:50.224357Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 1f3aceeb-ffbc-40ad-9531-a34aa11bba8f · inbound

Linear-Scaling Tensor Train Sketching cites this paper.

Linear-Scaling Tensor Train Sketching Optimal Oblivious Subspace Embeddings with Near-optimal Sparsity

Reference 10

Resolution: unresolved; no resolver link, observed 2026-07-14T23:11:18.736508Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 63e62678-b50d-49a1-afae-0a208567b94a · inbound

Fast, Parallel, Query-Efficient Binary Classification cites this paper.

Fast, Parallel, Query-Efficient Binary Classification Optimal Oblivious Subspace Embeddings with Near-optimal Sparsity

Reference 17

Resolution: unresolved; no resolver link, observed 2026-07-11T21:57:05.771091Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation fb3e3e4c-2b65-44c6-bd30-9aee2a1c47bb · inbound

Well-invertible column subsets of sparse matrices are rare cites this paper.

Well-invertible column subsets of sparse matrices are rare Optimal Oblivious Subspace Embeddings with Near-optimal Sparsity

Reference 7

Resolution: verified exact; local_arxiv, observed 2026-07-07T13:23:47.463173Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.

Observation 5354a3a4-0218-48ed-8ca7-e10a655764f4 · inbound

Well-invertible column subsets of sparse matrices are rare cites this paper.

Well-invertible column subsets of sparse matrices are rare Optimal Oblivious Subspace Embeddings with Near-optimal Sparsity

Reference 7

Resolution: unresolved; no resolver link, observed 2026-07-11T07:08:16.892784Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.