Pith. sign in

Paper Citation Record · LEDGER

Binary component decomposition Part II: The asymmetric case

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

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

pith.paper-citation-record.v1
1907.13602 v1

Coverage vector

measured 0 of 0 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links

measured 2 of 2 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-09T06:31:02.800959+00:00

measured 2 of 2 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-07-13T06:57:23.207779Z

measured 0 of 1 external citation measurements

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

Source: cited_works

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 a180792a-23cc-4c53-9d45-4b868cf11b78 · inbound

On the Complexity of Low-Rank Matrix Signing and Entrywise Power Matrix Factorization cites this paper.

On the Complexity of Low-Rank Matrix Signing and Entrywise Power Matrix Factorization Binary component decomposition Part II: The asymmetric case

Reference 32

Resolution
unresolved
no resolver link, observed 2026-07-11T12:06:20.451363Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-11T12:06:20.451363Z digest=sha256:4965926f7d49a1405587615f6f12c94fc48434eb0fce96f384e90246c9b742d9

Observation 3a51a476-3a72-47d2-81f1-c8282f507377 · inbound

On the Complexity of Low-Rank Matrix Signing and Entrywise Power Matrix Factorization cites this paper.

On the Complexity of Low-Rank Matrix Signing and Entrywise Power Matrix Factorization Binary component decomposition Part II: The asymmetric case

Reference 32

Resolution
unresolved
no resolver link, observed 2026-07-13T06:57:23.207779Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-13T06:57:23.207779Z digest=sha256:c29e2fc17d83dc2c58d457a30518f1e8fc605ee1f57fc9148d10c8ce4f5dcc42