Paper Citation Record · LEDGER

On the Complexity of Low-Rank Matrix Signing and Entrywise Power Matrix Factorization

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

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

pith.paper-citation-record.v1
2607.04875 v2

Coverage vector

measured 46 of 46 reference resolution

Typed states for the displayed outbound observations.

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

measured 46 of 46 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 0 of 0 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links

measured 0 of 1 external citation measurements

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

Source: cited_works

Reference resolution

46 of 46 outbound references displayed

verified exact0
verified fuzzy0
unresolved46
parse uncertain0
malformed identifier0
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 13404436-d042-4842-810f-a77ccd543bc0 · outbound

This paper cites In: ACM Symposium on Theory of computing, pp.

On the Complexity of Low-Rank Matrix Signing and Entrywise Power Matrix Factorization In: ACM Symposium on Theory of computing, pp

Reference 1

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 291ba856-c5da-4ac4-a381-65c17034a759 · outbound

This paper cites Alternating Direction Method of Multipliers for Nonlinear Matrix Decompositions.

On the Complexity of Low-Rank Matrix Signing and Entrywise Power Matrix Factorization Alternating Direction Method of Multipliers for Nonlinear Matrix Decompositions

Reference 2

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 7bd86211-2b93-4ec5-8d64-121702592fff · outbound

This paper cites In: European Signal Processing Conference (EUSIPCO), pp.

On the Complexity of Low-Rank Matrix Signing and Entrywise Power Matrix Factorization In: European Signal Processing Conference (EUSIPCO), pp

Reference 3

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5111e7f1-a07d-44cb-b250-c36e2035fb89 · outbound

This paper cites The complexity of computing the minimum rank of a sign pattern matrix.

On the Complexity of Low-Rank Matrix Signing and Entrywise Power Matrix Factorization The complexity of computing the minimum rank of a sign pattern matrix

Reference 4

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ab0e968e-1788-4fb9-ad49-cc409c8ecf35 · outbound

This paper cites Springer, New York, NY (1997).

On the Complexity of Low-Rank Matrix Signing and Entrywise Power Matrix Factorization Springer, New York, NY (1997)

Reference 5

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 35f5f0c1-959f-418b-ad31-001cbf2c4308 · outbound

This paper cites In: Annual Symposium on Foundations of Computer Science, pp.

On the Complexity of Low-Rank Matrix Signing and Entrywise Power Matrix Factorization In: Annual Symposium on Foundations of Computer Science, pp

Reference 6

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9ae40d30-a629-43e7-81b7-3d45f8242d04 · outbound

This paper cites an unresolved cited work.

On the Complexity of Low-Rank Matrix Signing and Entrywise Power Matrix Factorization Unresolved cited work

Reference 7

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e23bc992-44e0-4ba2-9ccd-b9221ef08d50 · outbound

This paper cites In: 2010 IEEE sensor array and multichannel signal processing workshop, pp.

On the Complexity of Low-Rank Matrix Signing and Entrywise Power Matrix Factorization In: 2010 IEEE sensor array and multichannel signal processing workshop, pp

Reference 8

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 470edbac-2782-4356-a0b8-b2c958746fbc · outbound

This paper cites IEEE Trans- actions on Information Theory56(5), 2053–2080 (2010).

On the Complexity of Low-Rank Matrix Signing and Entrywise Power Matrix Factorization IEEE Trans- actions on Information Theory56(5), 2053–2080 (2010)

Reference 9

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 0d618282-cb60-4351-970e-53340cfd976a · outbound

This paper cites SIAM Journal on Optimization21(2), 572–596 (2011).

On the Complexity of Low-Rank Matrix Signing and Entrywise Power Matrix Factorization SIAM Journal on Optimization21(2), 572–596 (2011)

Reference 10

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation fc827a1a-3f84-41da-9645-f839bcd9c4ca · outbound

This paper cites IEEE Transactions on Signal Processing67(20), 5239–5269 (2019).

On the Complexity of Low-Rank Matrix Signing and Entrywise Power Matrix Factorization IEEE Transactions on Signal Processing67(20), 5239–5269 (2019)

Reference 11

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f35e9194-f59c-4cd6-8e4e-92b9240b29b4 · outbound

This paper cites Theoretical Computer Science 815, 147–152 (2020).

On the Complexity of Low-Rank Matrix Signing and Entrywise Power Matrix Factorization Theoretical Computer Science 815, 147–152 (2020)

Reference 12

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e05e46f4-4ebe-4a16-84c1-3639855af802 · outbound

This paper cites Psychometrika1(3), 211–218 (1936).

On the Complexity of Low-Rank Matrix Signing and Entrywise Power Matrix Factorization Psychometrika1(3), 211–218 (1936)

Reference 13

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 390ffe1d-2e68-4307-bc28-6a1f4dafc4d0 · outbound

This paper cites Math- ematical Programming153(1), 133–177 (2015).

On the Complexity of Low-Rank Matrix Signing and Entrywise Power Matrix Factorization Math- ematical Programming153(1), 133–177 (2015)

Reference 14

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 075e4cf6-f548-432d-b466-138673992912 · outbound

This paper cites Springer Berlin Heidelberg (1996).

On the Complexity of Low-Rank Matrix Signing and Entrywise Power Matrix Factorization Springer Berlin Heidelberg (1996)

Reference 15

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 35f14c52-b1cb-4beb-969b-4118442ce6ba · outbound

This paper cites Pure and Applied Mathematics: A Wiley Series of Texts, Monographs and Tracts.

On the Complexity of Low-Rank Matrix Signing and Entrywise Power Matrix Factorization Pure and Applied Mathematics: A Wiley Series of Texts, Monographs and Tracts

Reference 16

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 64cb3893-482d-4e47-9a84-3a39e89ef86e · outbound

This paper cites an unresolved cited work.

On the Complexity of Low-Rank Matrix Signing and Entrywise Power Matrix Factorization Unresolved cited work

Reference 17

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 1b762333-2425-402e-a2fe-8e30a8f08138 · outbound

This paper cites In: International Conference on Machine Learning, pp.

On the Complexity of Low-Rank Matrix Signing and Entrywise Power Matrix Factorization In: International Conference on Machine Learning, pp

Reference 18

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 49465e34-ff17-4fb2-8fb6-38131394cfc7 · outbound

This paper cites Advances in neural information processing systems29(2016).

On the Complexity of Low-Rank Matrix Signing and Entrywise Power Matrix Factorization Advances in neural information processing systems29(2016)

Reference 19

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d405954f-3968-4d34-8110-663be50e1239 · outbound

This paper cites SIAM Journal on Matrix Analysis and Applications32(4), 1149–1165 (2011).

On the Complexity of Low-Rank Matrix Signing and Entrywise Power Matrix Factorization SIAM Journal on Matrix Analysis and Applications32(4), 1149–1165 (2011)

Reference 20

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9be14f65-7045-467c-8b59-fbc34694c64d · outbound

This paper cites an unresolved cited work.

On the Complexity of Low-Rank Matrix Signing and Entrywise Power Matrix Factorization Unresolved cited work

Reference 21

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 09fc92a3-1c20-4ed1-897f-0cbd50672a54 · outbound

This paper cites Manifold-based Algorithms for the Hadamard Decomposition.

On the Complexity of Low-Rank Matrix Signing and Entrywise Power Matrix Factorization Manifold-based Algorithms for the Hadamard Decomposition

Reference 22

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation bc443d4a-d857-4875-9920-0250e6f3a85b · outbound

This paper cites Linear Algebra and its Applications581, 367–382 (2019).

On the Complexity of Low-Rank Matrix Signing and Entrywise Power Matrix Factorization Linear Algebra and its Applications581, 367–382 (2019)

Reference 23

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f885e6bb-657b-4d10-8ec8-c3c53477e3ea · outbound

This paper cites Mathematics of Operations Research43(4), 1072–1084 (2018).

On the Complexity of Low-Rank Matrix Signing and Entrywise Power Matrix Factorization Mathematics of Operations Research43(4), 1072–1084 (2018)

Reference 24

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 0871009b-1cee-4b64-9943-87c14a207048 · outbound

This paper cites Johns Hopkins University Press, Baltimore (2013).

On the Complexity of Low-Rank Matrix Signing and Entrywise Power Matrix Factorization Johns Hopkins University Press, Baltimore (2013)

Reference 25

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 0f86b362-dc01-4c2c-a60f-f00c43c815ae · outbound

This paper cites Linear algebra and its applications261(1-3), 1–21 (1997).

On the Complexity of Low-Rank Matrix Signing and Entrywise Power Matrix Factorization Linear algebra and its applications261(1-3), 1–21 (1997)

Reference 26

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5c91aabd-92e3-436c-8aee-d2f2e2b3bfbe · outbound

This paper cites SIAM Journal on Applied Algebra and Geometry5(3), 526–551 (2021).

On the Complexity of Low-Rank Matrix Signing and Entrywise Power Matrix Factorization SIAM Journal on Applied Algebra and Geometry5(3), 526–551 (2021)

Reference 27

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 4acd0e23-bfdf-4900-879d-8c8286be538a · outbound

This paper cites Mathe- matical Programming153, 201–221 (2013).

On the Complexity of Low-Rank Matrix Signing and Entrywise Power Matrix Factorization Mathe- matical Programming153, 201–221 (2013)

Reference 28

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 36016256-4ccd-4fbc-b86a-7fe3ca70d3ea · outbound

This paper cites In: International Conference on Learning Representations (2025) 26.

On the Complexity of Low-Rank Matrix Signing and Entrywise Power Matrix Factorization In: International Conference on Learning Representations (2025) 26

Reference 29

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation adcb3c4f-e5af-446a-aa44-2f25f23a0673 · outbound

This paper cites ICLR (2022).

On the Complexity of Low-Rank Matrix Signing and Entrywise Power Matrix Factorization ICLR (2022)

Reference 30

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f225861e-4f46-4962-831f-3a5f901466f2 · outbound

This paper cites Linear and Multilinear Algebra65(11), 2212–2244 (2017).

On the Complexity of Low-Rank Matrix Signing and Entrywise Power Matrix Factorization Linear and Multilinear Algebra65(11), 2212–2244 (2017)

Reference 31

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

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

This paper cites Binary component decomposition Part II: The asymmetric case.

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.

Observation 791ea39d-a0db-469c-b684-8e0e8de8b96b · outbound

This paper cites SIAM Journal on Mathematics of Data Science3(2), 544–572 (2021).

On the Complexity of Low-Rank Matrix Signing and Entrywise Power Matrix Factorization SIAM Journal on Mathematics of Data Science3(2), 544–572 (2021)

Reference 33

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation bd352269-cd4e-4a49-860a-ea9276af512e · outbound

This paper cites SIAM Journal on Matrix Analysis and Applications44(2), 503–529 (2023).

On the Complexity of Low-Rank Matrix Signing and Entrywise Power Matrix Factorization SIAM Journal on Matrix Analysis and Applications44(2), 503–529 (2023)

Reference 34

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b8ac517d-6b0d-4e79-8ece-758d272f2f22 · outbound

This paper cites The square root rank of the correlation polytope is exponential.

On the Complexity of Low-Rank Matrix Signing and Entrywise Power Matrix Factorization The square root rank of the correlation polytope is exponential

Reference 35

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 46ae48be-7811-4402-950b-9815c31473ac · outbound

This paper cites In: International Work- shop on Machine Learning for Signal Processing (MLSP) (2024).

On the Complexity of Low-Rank Matrix Signing and Entrywise Power Matrix Factorization In: International Work- shop on Machine Learning for Signal Processing (MLSP) (2024)

Reference 36

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9e9ce964-94aa-4885-86dc-c435b063c82c · outbound

This paper cites In: International Conference on Learning Represen- tations, pp.

On the Complexity of Low-Rank Matrix Signing and Entrywise Power Matrix Factorization In: International Conference on Learning Represen- tations, pp

Reference 37

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 388289bb-7871-4c8c-82cc-ac6e7ae89d3c · outbound

This paper cites In: International Workshop on Machine Learning for Signal Processing (MLSP) (2025).

On the Complexity of Low-Rank Matrix Signing and Entrywise Power Matrix Factorization In: International Workshop on Machine Learning for Signal Processing (MLSP) (2025)

Reference 38

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b52bfcf8-7333-4c56-bc43-1cf73009d331 · outbound

This paper cites SIAM review52(3), 471–501 (2010).

On the Complexity of Low-Rank Matrix Signing and Entrywise Power Matrix Factorization SIAM review52(3), 471–501 (2010)

Reference 39

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 6bb6cf53-1f8a-4d30-b9c7-0ff1a76a3b8a · outbound

This paper cites SIAM Journal on Mathematics of Data Science4(2), 431–463 (2022).

On the Complexity of Low-Rank Matrix Signing and Entrywise Power Matrix Factorization SIAM Journal on Mathematics of Data Science4(2), 431–463 (2022)

Reference 40

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a323e294-92e6-46ae-9262-e169097155be · outbound

This paper cites In: Conference Record of the Tenth Annual ACM Symposium on Theory of Computing (San Diego, Calif., 1978), pp.

On the Complexity of Low-Rank Matrix Signing and Entrywise Power Matrix Factorization In: Conference Record of the Tenth Annual ACM Symposium on Theory of Computing (San Diego, Calif., 1978), pp

Reference 41

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation fe187ffe-5005-4cb2-a4db-00a6b31005db · outbound

This paper cites SIAM Journal on Optimization28(3), 2067–2072 (2018).

On the Complexity of Low-Rank Matrix Signing and Entrywise Power Matrix Factorization SIAM Journal on Optimization28(3), 2067–2072 (2018)

Reference 42

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e2221b04-6925-4a95-b614-5ed12b840dfa · outbound

This paper cites SIAM, Philadelphia (2022).

On the Complexity of Low-Rank Matrix Signing and Entrywise Power Matrix Factorization SIAM, Philadelphia (2022)

Reference 43

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5d5fe702-0c78-45b1-a94e-efe842acc7f7 · outbound

This paper cites Foundations and Trends®in Machine Learning9(1), 1–118 (2016).

On the Complexity of Low-Rank Matrix Signing and Entrywise Power Matrix Factorization Foundations and Trends®in Machine Learning9(1), 1–118 (2016)

Reference 44

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 7c08d0eb-5098-4efa-951d-d5b37bea32bf · outbound

This paper cites SIAM Journal on Optimization 20(3), 1364–1377 (2010).

On the Complexity of Low-Rank Matrix Signing and Entrywise Power Matrix Factorization SIAM Journal on Optimization 20(3), 1364–1377 (2010)

Reference 45

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation fed23710-2833-426b-930c-3e541f6ffc14 · outbound

This paper cites an unresolved cited work.

On the Complexity of Low-Rank Matrix Signing and Entrywise Power Matrix Factorization Unresolved cited work

Reference 46

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Pith citing papers

No inbound Pith citation observations are available.