{"as_of":"2026-08-09T13:40:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e37e58127ae139287a7a2be54baf63006af4eb0d5afc506575170b2bb3bdfd0e","coverage":[{"denominator":46,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":46,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-13T06:57:23.207779Z","state":"measured"},{"denominator":46,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":46,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2607.04875/citation-record","integrity":"/paper/2607.04875/integrity","json":"/paper/2607.04875/citation-record.json","paper":"/paper/2607.04875"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T06:57:23.207779Z","title":"In: ACM Symposium on Theory of computing, pp","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2607.04875","last_updated":"2026-07-09T20:42:41Z","snapshot_observed_at":"2026-08-08T09:20:08.317218Z","submitted_at":"2026-07-06T09:50:20Z","title":"On the Complexity of Low-Rank Matrix Signing and Entrywise Power Matrix Factorization","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-07-13T06:57:23.207779Z"},"links":{"citing_paper":"/paper/2607.04875"},"observation_digest":"sha256:2790cd3e965c62316b3a906d2c68f5b45a0c1460e6bf4d0ab4b07233373fdbe8","observation_id":"13404436-d042-4842-810f-a77ccd543bc0","resolution":{"observed_at":"2026-07-13T06:57:23.207779Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2512.17473","last_updated":"2026-06-18T12:53:14Z","snapshot_observed_at":"2026-08-03T15:21:45.952830Z","submitted_at":"2025-12-19T11:40:06Z","title":"Alternating Direction Method of Multipliers for Nonlinear Matrix Decompositions","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2512.17473","snapshot_observed_at":"2026-07-13T06:57:23.207779Z","title":"arXiv preprint arXiv:2512.17473 (2025)","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.04875","last_updated":"2026-07-09T20:42:41Z","snapshot_observed_at":"2026-08-08T09:20:08.317218Z","submitted_at":"2026-07-06T09:50:20Z","title":"On the Complexity of Low-Rank Matrix Signing and Entrywise Power Matrix Factorization","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-07-13T06:57:23.207779Z"},"links":{"cited_paper":"/paper/2512.17473","citing_paper":"/paper/2607.04875"},"observation_digest":"sha256:3bd5ea8b309e8bba2b44bdda671a16793fc316269cb700615d2f75f86a0f24c8","observation_id":"291ba856-c5da-4ac4-a381-65c17034a759","resolution":{"observed_at":"2026-07-13T06:57:23.207779Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T06:57:23.207779Z","title":"In: European Signal Processing Conference (EUSIPCO), pp","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.04875","last_updated":"2026-07-09T20:42:41Z","snapshot_observed_at":"2026-08-08T09:20:08.317218Z","submitted_at":"2026-07-06T09:50:20Z","title":"On the Complexity of Low-Rank Matrix Signing and Entrywise Power Matrix Factorization","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-07-13T06:57:23.207779Z"},"links":{"citing_paper":"/paper/2607.04875"},"observation_digest":"sha256:07298e79e1e9c35fe203a1956417083c6c4587c60ed55991a52e5d803037f300","observation_id":"7bd86211-2b93-4ec5-8d64-121702592fff","resolution":{"observed_at":"2026-07-13T06:57:23.207779Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1503.04486","last_updated":"2015-05-14T23:52:14Z","snapshot_observed_at":"2026-07-06T04:12:05.553292Z","submitted_at":"2015-03-15T22:53:13Z","title":"The complexity of computing the minimum rank of a sign pattern matrix","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1503.04486","snapshot_observed_at":"2026-07-13T06:57:23.207779Z","title":"arXiv preprint arXiv:1503.04486 (2015)","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2607.04875","last_updated":"2026-07-09T20:42:41Z","snapshot_observed_at":"2026-08-08T09:20:08.317218Z","submitted_at":"2026-07-06T09:50:20Z","title":"On the Complexity of Low-Rank Matrix Signing and Entrywise Power Matrix Factorization","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-07-13T06:57:23.207779Z"},"links":{"cited_paper":"/paper/1503.04486","citing_paper":"/paper/2607.04875"},"observation_digest":"sha256:7ff498eb2745d57e7ce6827943102eb6037bae22dc70688b3ce0edcb16bc2ce0","observation_id":"5111e7f1-a07d-44cb-b250-c36e2035fb89","resolution":{"observed_at":"2026-07-13T06:57:23.207779Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T06:57:23.207779Z","title":"Springer, New York, NY (1997)","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2607.04875","last_updated":"2026-07-09T20:42:41Z","snapshot_observed_at":"2026-08-08T09:20:08.317218Z","submitted_at":"2026-07-06T09:50:20Z","title":"On the Complexity of Low-Rank Matrix Signing and Entrywise Power Matrix Factorization","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-07-13T06:57:23.207779Z"},"links":{"citing_paper":"/paper/2607.04875"},"observation_digest":"sha256:d82bf208310224abe9f6c798678be1c600879de18c2d596fa11b85c00dea77ae","observation_id":"ab0e968e-1788-4fb9-ad49-cc409c8ecf35","resolution":{"observed_at":"2026-07-13T06:57:23.207779Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T06:57:23.207779Z","title":"In: Annual Symposium on Foundations of Computer Science, pp","venue":null,"work_id":null,"year":1988},"citing_paper":{"arxiv_id":"2607.04875","last_updated":"2026-07-09T20:42:41Z","snapshot_observed_at":"2026-08-08T09:20:08.317218Z","submitted_at":"2026-07-06T09:50:20Z","title":"On the Complexity of Low-Rank Matrix Signing and Entrywise Power Matrix Factorization","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-07-13T06:57:23.207779Z"},"links":{"citing_paper":"/paper/2607.04875"},"observation_digest":"sha256:09bdd20e2c18a0f37b4a75238df6a41910ab9fcd8f73746413ad18b4294d1b13","observation_id":"35f5f0c1-959f-418b-ad31-001cbf2c4308","resolution":{"observed_at":"2026-07-13T06:57:23.207779Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T06:57:23.207779Z","title":null,"venue":null,"work_id":null,"year":1966},"citing_paper":{"arxiv_id":"2607.04875","last_updated":"2026-07-09T20:42:41Z","snapshot_observed_at":"2026-08-08T09:20:08.317218Z","submitted_at":"2026-07-06T09:50:20Z","title":"On the Complexity of Low-Rank Matrix Signing and Entrywise Power Matrix Factorization","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-07-13T06:57:23.207779Z"},"links":{"citing_paper":"/paper/2607.04875"},"observation_digest":"sha256:b50b3b72e41a40d5bf8df2a0df7a79f8bf14422fc80de09549fc7c984a910187","observation_id":"9ae40d30-a629-43e7-81b7-3d45f8242d04","resolution":{"observed_at":"2026-07-13T06:57:23.207779Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T06:57:23.207779Z","title":"In: 2010 IEEE sensor array and multichannel signal processing workshop, pp","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2607.04875","last_updated":"2026-07-09T20:42:41Z","snapshot_observed_at":"2026-08-08T09:20:08.317218Z","submitted_at":"2026-07-06T09:50:20Z","title":"On the Complexity of Low-Rank Matrix Signing and Entrywise Power Matrix Factorization","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-07-13T06:57:23.207779Z"},"links":{"citing_paper":"/paper/2607.04875"},"observation_digest":"sha256:10c3de96f7378bd802aabe75a306117206e96fd9120bf42200fe4ccf3ad29678","observation_id":"e23bc992-44e0-4ba2-9ccd-b9221ef08d50","resolution":{"observed_at":"2026-07-13T06:57:23.207779Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T06:57:23.207779Z","title":"IEEE Trans- actions on Information Theory56(5), 2053–2080 (2010)","venue":null,"work_id":null,"year":2053},"citing_paper":{"arxiv_id":"2607.04875","last_updated":"2026-07-09T20:42:41Z","snapshot_observed_at":"2026-08-08T09:20:08.317218Z","submitted_at":"2026-07-06T09:50:20Z","title":"On the Complexity of Low-Rank Matrix Signing and Entrywise Power Matrix Factorization","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-07-13T06:57:23.207779Z"},"links":{"citing_paper":"/paper/2607.04875"},"observation_digest":"sha256:c9e1a5ac8d84a7cba90cc837ea2b24691f76a41aac9acf28242fe5626db16c20","observation_id":"470edbac-2782-4356-a0b8-b2c958746fbc","resolution":{"observed_at":"2026-07-13T06:57:23.207779Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T06:57:23.207779Z","title":"SIAM Journal on Optimization21(2), 572–596 (2011)","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2607.04875","last_updated":"2026-07-09T20:42:41Z","snapshot_observed_at":"2026-08-08T09:20:08.317218Z","submitted_at":"2026-07-06T09:50:20Z","title":"On the Complexity of Low-Rank Matrix Signing and Entrywise Power Matrix Factorization","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-07-13T06:57:23.207779Z"},"links":{"citing_paper":"/paper/2607.04875"},"observation_digest":"sha256:8b8591b5a5783109d37043e2acf4eafffee6a03107b1de4fd4067fd8eb636a69","observation_id":"0d618282-cb60-4351-970e-53340cfd976a","resolution":{"observed_at":"2026-07-13T06:57:23.207779Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T06:57:23.207779Z","title":"IEEE Transactions on Signal Processing67(20), 5239–5269 (2019)","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.04875","last_updated":"2026-07-09T20:42:41Z","snapshot_observed_at":"2026-08-08T09:20:08.317218Z","submitted_at":"2026-07-06T09:50:20Z","title":"On the Complexity of Low-Rank Matrix Signing and Entrywise Power Matrix Factorization","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-07-13T06:57:23.207779Z"},"links":{"citing_paper":"/paper/2607.04875"},"observation_digest":"sha256:0e29c4620677116223aac0b8611ed5831e4e3ca46017b8f28107534b517bf8fd","observation_id":"fc827a1a-3f84-41da-9645-f839bcd9c4ca","resolution":{"observed_at":"2026-07-13T06:57:23.207779Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T06:57:23.207779Z","title":"Theoretical Computer Science 815, 147–152 (2020)","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.04875","last_updated":"2026-07-09T20:42:41Z","snapshot_observed_at":"2026-08-08T09:20:08.317218Z","submitted_at":"2026-07-06T09:50:20Z","title":"On the Complexity of Low-Rank Matrix Signing and Entrywise Power Matrix Factorization","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-07-13T06:57:23.207779Z"},"links":{"citing_paper":"/paper/2607.04875"},"observation_digest":"sha256:596bd3a9325b897fa4885eecbc964cc69b796a2aa49dd3525ca516db3ee4ba82","observation_id":"f35e9194-f59c-4cd6-8e4e-92b9240b29b4","resolution":{"observed_at":"2026-07-13T06:57:23.207779Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T06:57:23.207779Z","title":"Psychometrika1(3), 211–218 (1936)","venue":null,"work_id":null,"year":1936},"citing_paper":{"arxiv_id":"2607.04875","last_updated":"2026-07-09T20:42:41Z","snapshot_observed_at":"2026-08-08T09:20:08.317218Z","submitted_at":"2026-07-06T09:50:20Z","title":"On the Complexity of Low-Rank Matrix Signing and Entrywise Power Matrix Factorization","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-07-13T06:57:23.207779Z"},"links":{"citing_paper":"/paper/2607.04875"},"observation_digest":"sha256:0efb3aefd63ed7f5a91130c775d401801aa5e028f92c95d62feca1df258c1494","observation_id":"e05e46f4-4ebe-4a16-84c1-3639855af802","resolution":{"observed_at":"2026-07-13T06:57:23.207779Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T06:57:23.207779Z","title":"Math- ematical Programming153(1), 133–177 (2015)","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2607.04875","last_updated":"2026-07-09T20:42:41Z","snapshot_observed_at":"2026-08-08T09:20:08.317218Z","submitted_at":"2026-07-06T09:50:20Z","title":"On the Complexity of Low-Rank Matrix Signing and Entrywise Power Matrix Factorization","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-07-13T06:57:23.207779Z"},"links":{"citing_paper":"/paper/2607.04875"},"observation_digest":"sha256:e2de17f22fde04b5ee26e0cf6dc83cc0200ee9e8f1876194a11f3a7862051d19","observation_id":"390ffe1d-2e68-4307-bc28-6a1f4dafc4d0","resolution":{"observed_at":"2026-07-13T06:57:23.207779Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T06:57:23.207779Z","title":"Springer Berlin Heidelberg (1996)","venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2607.04875","last_updated":"2026-07-09T20:42:41Z","snapshot_observed_at":"2026-08-08T09:20:08.317218Z","submitted_at":"2026-07-06T09:50:20Z","title":"On the Complexity of Low-Rank Matrix Signing and Entrywise Power Matrix Factorization","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-07-13T06:57:23.207779Z"},"links":{"citing_paper":"/paper/2607.04875"},"observation_digest":"sha256:c5c9c72369539b1a8f168ee464e1d31edc5844f3baf597b08b0cde2a9d335c24","observation_id":"075e4cf6-f548-432d-b466-138673992912","resolution":{"observed_at":"2026-07-13T06:57:23.207779Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T06:57:23.207779Z","title":"Pure and Applied Mathematics: A Wiley Series of Texts, Monographs and Tracts","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2607.04875","last_updated":"2026-07-09T20:42:41Z","snapshot_observed_at":"2026-08-08T09:20:08.317218Z","submitted_at":"2026-07-06T09:50:20Z","title":"On the Complexity of Low-Rank Matrix Signing and Entrywise Power Matrix Factorization","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-07-13T06:57:23.207779Z"},"links":{"citing_paper":"/paper/2607.04875"},"observation_digest":"sha256:d6a0ec4e9d95dd592e432474a159c5423e45ef28aac8c2df45229afb067faa0b","observation_id":"35f14c52-b1cb-4beb-969b-4118442ce6ba","resolution":{"observed_at":"2026-07-13T06:57:23.207779Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T06:57:23.207779Z","title":null,"venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2607.04875","last_updated":"2026-07-09T20:42:41Z","snapshot_observed_at":"2026-08-08T09:20:08.317218Z","submitted_at":"2026-07-06T09:50:20Z","title":"On the Complexity of Low-Rank Matrix Signing and Entrywise Power Matrix Factorization","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-07-13T06:57:23.207779Z"},"links":{"citing_paper":"/paper/2607.04875"},"observation_digest":"sha256:4bd523977a6881b647827907aa82c09683b14b76181cea4f5bfb86c415f04a68","observation_id":"64cb3893-482d-4e47-9a84-3a39e89ef86e","resolution":{"observed_at":"2026-07-13T06:57:23.207779Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T06:57:23.207779Z","title":"In: International Conference on Machine Learning, pp","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.04875","last_updated":"2026-07-09T20:42:41Z","snapshot_observed_at":"2026-08-08T09:20:08.317218Z","submitted_at":"2026-07-06T09:50:20Z","title":"On the Complexity of Low-Rank Matrix Signing and Entrywise Power Matrix Factorization","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-07-13T06:57:23.207779Z"},"links":{"citing_paper":"/paper/2607.04875"},"observation_digest":"sha256:2c741beb1a8ca981abfbc474956e394cbf34545b6e8d3ea2cde1a43d4a20a063","observation_id":"1b762333-2425-402e-a2fe-8e30a8f08138","resolution":{"observed_at":"2026-07-13T06:57:23.207779Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T06:57:23.207779Z","title":"Advances in neural information processing systems29(2016)","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.04875","last_updated":"2026-07-09T20:42:41Z","snapshot_observed_at":"2026-08-08T09:20:08.317218Z","submitted_at":"2026-07-06T09:50:20Z","title":"On the Complexity of Low-Rank Matrix Signing and Entrywise Power Matrix Factorization","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-07-13T06:57:23.207779Z"},"links":{"citing_paper":"/paper/2607.04875"},"observation_digest":"sha256:9e079e40391ce9f70413fe4c5770e36aaa677e44b3b621e06fbee1f896a3699e","observation_id":"49465e34-ff17-4fb2-8fb6-38131394cfc7","resolution":{"observed_at":"2026-07-13T06:57:23.207779Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T06:57:23.207779Z","title":"SIAM Journal on Matrix Analysis and Applications32(4), 1149–1165 (2011)","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2607.04875","last_updated":"2026-07-09T20:42:41Z","snapshot_observed_at":"2026-08-08T09:20:08.317218Z","submitted_at":"2026-07-06T09:50:20Z","title":"On the Complexity of Low-Rank Matrix Signing and Entrywise Power Matrix Factorization","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-07-13T06:57:23.207779Z"},"links":{"citing_paper":"/paper/2607.04875"},"observation_digest":"sha256:ad83e4d0bc3ed152d5fde51942e8eff93541611ee876c52a1e2dce20899a5485","observation_id":"d405954f-3968-4d34-8110-663be50e1239","resolution":{"observed_at":"2026-07-13T06:57:23.207779Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T06:57:23.207779Z","title":null,"venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.04875","last_updated":"2026-07-09T20:42:41Z","snapshot_observed_at":"2026-08-08T09:20:08.317218Z","submitted_at":"2026-07-06T09:50:20Z","title":"On the Complexity of Low-Rank Matrix Signing and Entrywise Power Matrix Factorization","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-07-13T06:57:23.207779Z"},"links":{"citing_paper":"/paper/2607.04875"},"observation_digest":"sha256:b59b490c05ad4adf787cde2a94b1383c2966657377c05ab18d0d9bbf9ccebcb8","observation_id":"9be14f65-7045-467c-8b59-fbc34694c64d","resolution":{"observed_at":"2026-07-13T06:57:23.207779Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2605.28980","last_updated":"2026-05-27T18:35:40Z","snapshot_observed_at":"2026-08-08T06:20:23.318951Z","submitted_at":"2026-05-27T18:35:40Z","title":"Manifold-based Algorithms for the Hadamard Decomposition","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2605.28980","snapshot_observed_at":"2026-07-13T06:57:23.207779Z","title":"arXiv preprint arXiv:2605.28980 (2026)","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.04875","last_updated":"2026-07-09T20:42:41Z","snapshot_observed_at":"2026-08-08T09:20:08.317218Z","submitted_at":"2026-07-06T09:50:20Z","title":"On the Complexity of Low-Rank Matrix Signing and Entrywise Power Matrix Factorization","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-07-13T06:57:23.207779Z"},"links":{"cited_paper":"/paper/2605.28980","citing_paper":"/paper/2607.04875"},"observation_digest":"sha256:7bc298e970aab0b7a91049a8f391a3b6ccb37ea74669047fc5e326068886795c","observation_id":"09fc92a3-1c20-4ed1-897f-0cbd50672a54","resolution":{"observed_at":"2026-07-13T06:57:23.207779Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T06:57:23.207779Z","title":"Linear Algebra and its Applications581, 367–382 (2019)","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.04875","last_updated":"2026-07-09T20:42:41Z","snapshot_observed_at":"2026-08-08T09:20:08.317218Z","submitted_at":"2026-07-06T09:50:20Z","title":"On the Complexity of Low-Rank Matrix Signing and Entrywise Power Matrix Factorization","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-07-13T06:57:23.207779Z"},"links":{"citing_paper":"/paper/2607.04875"},"observation_digest":"sha256:84bd2b08521c6d0753694d4bba4ed0316075e8ef81124c59576ce25f886b3133","observation_id":"bc443d4a-d857-4875-9920-0250e6f3a85b","resolution":{"observed_at":"2026-07-13T06:57:23.207779Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T06:57:23.207779Z","title":"Mathematics of Operations Research43(4), 1072–1084 (2018)","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.04875","last_updated":"2026-07-09T20:42:41Z","snapshot_observed_at":"2026-08-08T09:20:08.317218Z","submitted_at":"2026-07-06T09:50:20Z","title":"On the Complexity of Low-Rank Matrix Signing and Entrywise Power Matrix Factorization","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-07-13T06:57:23.207779Z"},"links":{"citing_paper":"/paper/2607.04875"},"observation_digest":"sha256:a5592c17609b6c43ee927419376bac7f370f7964d647d3d96ee77a8cf3ecbaeb","observation_id":"f885e6bb-657b-4d10-8ec8-c3c53477e3ea","resolution":{"observed_at":"2026-07-13T06:57:23.207779Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T06:57:23.207779Z","title":"Johns Hopkins University Press, Baltimore (2013)","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2607.04875","last_updated":"2026-07-09T20:42:41Z","snapshot_observed_at":"2026-08-08T09:20:08.317218Z","submitted_at":"2026-07-06T09:50:20Z","title":"On the Complexity of Low-Rank Matrix Signing and Entrywise Power Matrix Factorization","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-07-13T06:57:23.207779Z"},"links":{"citing_paper":"/paper/2607.04875"},"observation_digest":"sha256:61b7f7ce553b3ecf0103910ff42327dfc42e17acd884dbc8c5061a31af9ebae9","observation_id":"0871009b-1cee-4b64-9943-87c14a207048","resolution":{"observed_at":"2026-07-13T06:57:23.207779Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T06:57:23.207779Z","title":"Linear algebra and its applications261(1-3), 1–21 (1997)","venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2607.04875","last_updated":"2026-07-09T20:42:41Z","snapshot_observed_at":"2026-08-08T09:20:08.317218Z","submitted_at":"2026-07-06T09:50:20Z","title":"On the Complexity of Low-Rank Matrix Signing and Entrywise Power Matrix Factorization","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-07-13T06:57:23.207779Z"},"links":{"citing_paper":"/paper/2607.04875"},"observation_digest":"sha256:24536b41b4e33b7785f8674fb479b1960854e8cec9880d37896324bb090726f1","observation_id":"0f86b362-dc01-4c2c-a60f-f00c43c815ae","resolution":{"observed_at":"2026-07-13T06:57:23.207779Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T06:57:23.207779Z","title":"SIAM Journal on Applied Algebra and Geometry5(3), 526–551 (2021)","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.04875","last_updated":"2026-07-09T20:42:41Z","snapshot_observed_at":"2026-08-08T09:20:08.317218Z","submitted_at":"2026-07-06T09:50:20Z","title":"On the Complexity of Low-Rank Matrix Signing and Entrywise Power Matrix Factorization","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-07-13T06:57:23.207779Z"},"links":{"citing_paper":"/paper/2607.04875"},"observation_digest":"sha256:cd6e5fe1ecd7b45bc934aa77909ec51688e377af577f3a087528ad0ce67e3067","observation_id":"5c91aabd-92e3-436c-8aee-d2f2e2b3bfbe","resolution":{"observed_at":"2026-07-13T06:57:23.207779Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T06:57:23.207779Z","title":"Mathe- matical Programming153, 201–221 (2013)","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2607.04875","last_updated":"2026-07-09T20:42:41Z","snapshot_observed_at":"2026-08-08T09:20:08.317218Z","submitted_at":"2026-07-06T09:50:20Z","title":"On the Complexity of Low-Rank Matrix Signing and Entrywise Power Matrix Factorization","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-07-13T06:57:23.207779Z"},"links":{"citing_paper":"/paper/2607.04875"},"observation_digest":"sha256:aec5b64a0d8ad8ea3689f8cfccb569bc3f75c7b8d0207e2e6c6f1a8733178998","observation_id":"4acd0e23-bfdf-4900-879d-8c8286be538a","resolution":{"observed_at":"2026-07-13T06:57:23.207779Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T06:57:23.207779Z","title":"In: International Conference on Learning Representations (2025) 26","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.04875","last_updated":"2026-07-09T20:42:41Z","snapshot_observed_at":"2026-08-08T09:20:08.317218Z","submitted_at":"2026-07-06T09:50:20Z","title":"On the Complexity of Low-Rank Matrix Signing and Entrywise Power Matrix Factorization","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-07-13T06:57:23.207779Z"},"links":{"citing_paper":"/paper/2607.04875"},"observation_digest":"sha256:47d1b04ca9b29738f287d21d7076e71cf459c333cea74a40998ebd42d7059834","observation_id":"36016256-4ccd-4fbc-b86a-7fe3ca70d3ea","resolution":{"observed_at":"2026-07-13T06:57:23.207779Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T06:57:23.207779Z","title":"ICLR (2022)","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.04875","last_updated":"2026-07-09T20:42:41Z","snapshot_observed_at":"2026-08-08T09:20:08.317218Z","submitted_at":"2026-07-06T09:50:20Z","title":"On the Complexity of Low-Rank Matrix Signing and Entrywise Power Matrix Factorization","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-07-13T06:57:23.207779Z"},"links":{"citing_paper":"/paper/2607.04875"},"observation_digest":"sha256:2932a6d3b6904b30d16e03d7cc8f2f7870922175afcd94b375938ab87bd56e66","observation_id":"adcb3c4f-e5af-446a-aa44-2f25f23a0673","resolution":{"observed_at":"2026-07-13T06:57:23.207779Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T06:57:23.207779Z","title":"Linear and Multilinear Algebra65(11), 2212–2244 (2017)","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.04875","last_updated":"2026-07-09T20:42:41Z","snapshot_observed_at":"2026-08-08T09:20:08.317218Z","submitted_at":"2026-07-06T09:50:20Z","title":"On the Complexity of Low-Rank Matrix Signing and Entrywise Power Matrix Factorization","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-07-13T06:57:23.207779Z"},"links":{"citing_paper":"/paper/2607.04875"},"observation_digest":"sha256:fc10733f3a74694afbf4edd367a2640f55fa5b65b1e5c9c5c345469ca393755c","observation_id":"f225861e-4f46-4962-831f-3a5f901466f2","resolution":{"observed_at":"2026-07-13T06:57:23.207779Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1907.13602","last_updated":"2019-07-31T17:07:08Z","snapshot_observed_at":"2026-07-31T17:25:20.803516Z","submitted_at":"2019-07-31T17:07:08Z","title":"Binary component decomposition Part II: The asymmetric case","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1907.13602","snapshot_observed_at":"2026-07-13T06:57:23.207779Z","title":"arXiv preprint arXiv:1907.13602 (2019)","venue":null,"work_id":null,"year":1907},"citing_paper":{"arxiv_id":"2607.04875","last_updated":"2026-07-09T20:42:41Z","snapshot_observed_at":"2026-08-08T09:20:08.317218Z","submitted_at":"2026-07-06T09:50:20Z","title":"On the Complexity of Low-Rank Matrix Signing and Entrywise Power Matrix Factorization","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-07-13T06:57:23.207779Z"},"links":{"cited_paper":"/paper/1907.13602","citing_paper":"/paper/2607.04875"},"observation_digest":"sha256:c29e2fc17d83dc2c58d457a30518f1e8fc605ee1f57fc9148d10c8ce4f5dcc42","observation_id":"3a51a476-3a72-47d2-81f1-c8282f507377","resolution":{"observed_at":"2026-07-13T06:57:23.207779Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T06:57:23.207779Z","title":"SIAM Journal on Mathematics of Data Science3(2), 544–572 (2021)","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.04875","last_updated":"2026-07-09T20:42:41Z","snapshot_observed_at":"2026-08-08T09:20:08.317218Z","submitted_at":"2026-07-06T09:50:20Z","title":"On the Complexity of Low-Rank Matrix Signing and Entrywise Power Matrix Factorization","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-07-13T06:57:23.207779Z"},"links":{"citing_paper":"/paper/2607.04875"},"observation_digest":"sha256:db77fee899a335e417ce5c8475b7bbe17378c81dfd5973f3a4bed80e0362c2d3","observation_id":"791ea39d-a0db-469c-b684-8e0e8de8b96b","resolution":{"observed_at":"2026-07-13T06:57:23.207779Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T06:57:23.207779Z","title":"SIAM Journal on Matrix Analysis and Applications44(2), 503–529 (2023)","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.04875","last_updated":"2026-07-09T20:42:41Z","snapshot_observed_at":"2026-08-08T09:20:08.317218Z","submitted_at":"2026-07-06T09:50:20Z","title":"On the Complexity of Low-Rank Matrix Signing and Entrywise Power Matrix Factorization","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-07-13T06:57:23.207779Z"},"links":{"citing_paper":"/paper/2607.04875"},"observation_digest":"sha256:9361d0de6688f66dacc3c7b5594b9b56196bb8eafda82f8023d3050468f169a0","observation_id":"bd352269-cd4e-4a49-860a-ea9276af512e","resolution":{"observed_at":"2026-07-13T06:57:23.207779Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1411.6712","last_updated":"2014-11-25T03:08:40Z","snapshot_observed_at":"2026-08-05T11:35:17.136038Z","submitted_at":"2014-11-25T03:08:40Z","title":"The square root rank of the correlation polytope is exponential","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1411.6712","snapshot_observed_at":"2026-07-13T06:57:23.207779Z","title":"arXiv preprint arXiv:1411.6712 (2014)","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2607.04875","last_updated":"2026-07-09T20:42:41Z","snapshot_observed_at":"2026-08-08T09:20:08.317218Z","submitted_at":"2026-07-06T09:50:20Z","title":"On the Complexity of Low-Rank Matrix Signing and Entrywise Power Matrix Factorization","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-07-13T06:57:23.207779Z"},"links":{"cited_paper":"/paper/1411.6712","citing_paper":"/paper/2607.04875"},"observation_digest":"sha256:900669dc262cc7e758daad4b2877e1bf39d4990fa9147d4b40d2deec408d5cdb","observation_id":"b8ac517d-6b0d-4e79-8ece-758d272f2f22","resolution":{"observed_at":"2026-07-13T06:57:23.207779Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T06:57:23.207779Z","title":"In: International Work- shop on Machine Learning for Signal Processing (MLSP) (2024)","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.04875","last_updated":"2026-07-09T20:42:41Z","snapshot_observed_at":"2026-08-08T09:20:08.317218Z","submitted_at":"2026-07-06T09:50:20Z","title":"On the Complexity of Low-Rank Matrix Signing and Entrywise Power Matrix Factorization","version":2},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-07-13T06:57:23.207779Z"},"links":{"citing_paper":"/paper/2607.04875"},"observation_digest":"sha256:5345b6346f5317e67953bd8d26bd216a0796a9de13e2ab486cd7cb49f869ef48","observation_id":"46ae48be-7811-4402-950b-9815c31473ac","resolution":{"observed_at":"2026-07-13T06:57:23.207779Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T06:57:23.207779Z","title":"In: International Conference on Learning Represen- tations, pp","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.04875","last_updated":"2026-07-09T20:42:41Z","snapshot_observed_at":"2026-08-08T09:20:08.317218Z","submitted_at":"2026-07-06T09:50:20Z","title":"On the Complexity of Low-Rank Matrix Signing and Entrywise Power Matrix Factorization","version":2},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-07-13T06:57:23.207779Z"},"links":{"citing_paper":"/paper/2607.04875"},"observation_digest":"sha256:6ff895363fbb53c8fabfd4a6e355abc4d93b57972277d76babd1f5730b77c62d","observation_id":"9e9ce964-94aa-4885-86dc-c435b063c82c","resolution":{"observed_at":"2026-07-13T06:57:23.207779Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T06:57:23.207779Z","title":"In: International Workshop on Machine Learning for Signal Processing (MLSP) (2025)","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.04875","last_updated":"2026-07-09T20:42:41Z","snapshot_observed_at":"2026-08-08T09:20:08.317218Z","submitted_at":"2026-07-06T09:50:20Z","title":"On the Complexity of Low-Rank Matrix Signing and Entrywise Power Matrix Factorization","version":2},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-07-13T06:57:23.207779Z"},"links":{"citing_paper":"/paper/2607.04875"},"observation_digest":"sha256:7489be591b6c621260d59883020a0ba8576b4705b3d2adc4f06f750686da8c6d","observation_id":"388289bb-7871-4c8c-82cc-ac6e7ae89d3c","resolution":{"observed_at":"2026-07-13T06:57:23.207779Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T06:57:23.207779Z","title":"SIAM review52(3), 471–501 (2010)","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2607.04875","last_updated":"2026-07-09T20:42:41Z","snapshot_observed_at":"2026-08-08T09:20:08.317218Z","submitted_at":"2026-07-06T09:50:20Z","title":"On the Complexity of Low-Rank Matrix Signing and Entrywise Power Matrix Factorization","version":2},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-07-13T06:57:23.207779Z"},"links":{"citing_paper":"/paper/2607.04875"},"observation_digest":"sha256:7d845e5083f5b534b7f23fc3c7e806f11af89bda1a52d6e8a5c3cc404608037f","observation_id":"b52bfcf8-7333-4c56-bc43-1cf73009d331","resolution":{"observed_at":"2026-07-13T06:57:23.207779Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T06:57:23.207779Z","title":"SIAM Journal on Mathematics of Data Science4(2), 431–463 (2022)","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.04875","last_updated":"2026-07-09T20:42:41Z","snapshot_observed_at":"2026-08-08T09:20:08.317218Z","submitted_at":"2026-07-06T09:50:20Z","title":"On the Complexity of Low-Rank Matrix Signing and Entrywise Power Matrix Factorization","version":2},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-07-13T06:57:23.207779Z"},"links":{"citing_paper":"/paper/2607.04875"},"observation_digest":"sha256:9dcc2596cf2071014d414caf754b73d497657d7694b21ef49bd22172b71b3b22","observation_id":"6bb6cf53-1f8a-4d30-b9c7-0ff1a76a3b8a","resolution":{"observed_at":"2026-07-13T06:57:23.207779Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T06:57:23.207779Z","title":"In: Conference Record of the Tenth Annual ACM Symposium on Theory of Computing (San Diego, Calif., 1978), pp","venue":null,"work_id":null,"year":1978},"citing_paper":{"arxiv_id":"2607.04875","last_updated":"2026-07-09T20:42:41Z","snapshot_observed_at":"2026-08-08T09:20:08.317218Z","submitted_at":"2026-07-06T09:50:20Z","title":"On the Complexity of Low-Rank Matrix Signing and Entrywise Power Matrix Factorization","version":2},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-07-13T06:57:23.207779Z"},"links":{"citing_paper":"/paper/2607.04875"},"observation_digest":"sha256:9769762e41fc53669c1d35459e507a909d4c0733fc66ffbed5c2ed6d9f8b3897","observation_id":"a323e294-92e6-46ae-9262-e169097155be","resolution":{"observed_at":"2026-07-13T06:57:23.207779Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T06:57:23.207779Z","title":"SIAM Journal on Optimization28(3), 2067–2072 (2018)","venue":null,"work_id":null,"year":2067},"citing_paper":{"arxiv_id":"2607.04875","last_updated":"2026-07-09T20:42:41Z","snapshot_observed_at":"2026-08-08T09:20:08.317218Z","submitted_at":"2026-07-06T09:50:20Z","title":"On the Complexity of Low-Rank Matrix Signing and Entrywise Power Matrix Factorization","version":2},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-07-13T06:57:23.207779Z"},"links":{"citing_paper":"/paper/2607.04875"},"observation_digest":"sha256:2a892f1c840a94a01aac13fde74478fadd46531a59bc0997a81d5e452341b965","observation_id":"fe187ffe-5005-4cb2-a4db-00a6b31005db","resolution":{"observed_at":"2026-07-13T06:57:23.207779Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T06:57:23.207779Z","title":"SIAM, Philadelphia (2022)","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.04875","last_updated":"2026-07-09T20:42:41Z","snapshot_observed_at":"2026-08-08T09:20:08.317218Z","submitted_at":"2026-07-06T09:50:20Z","title":"On the Complexity of Low-Rank Matrix Signing and Entrywise Power Matrix Factorization","version":2},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-07-13T06:57:23.207779Z"},"links":{"citing_paper":"/paper/2607.04875"},"observation_digest":"sha256:591c245a6ef917665aa1fddbc4f35751e499630a011695b802dc548ff299f42e","observation_id":"e2221b04-6925-4a95-b614-5ed12b840dfa","resolution":{"observed_at":"2026-07-13T06:57:23.207779Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T06:57:23.207779Z","title":"Foundations and Trends®in Machine Learning9(1), 1–118 (2016)","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.04875","last_updated":"2026-07-09T20:42:41Z","snapshot_observed_at":"2026-08-08T09:20:08.317218Z","submitted_at":"2026-07-06T09:50:20Z","title":"On the Complexity of Low-Rank Matrix Signing and Entrywise Power Matrix Factorization","version":2},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-07-13T06:57:23.207779Z"},"links":{"citing_paper":"/paper/2607.04875"},"observation_digest":"sha256:ae3810bd104799e37f69bd9a22034bdc8e0f7ea311be22e3104dd7f1c4ba1a9c","observation_id":"5d5fe702-0c78-45b1-a94e-efe842acc7f7","resolution":{"observed_at":"2026-07-13T06:57:23.207779Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T06:57:23.207779Z","title":"SIAM Journal on Optimization 20(3), 1364–1377 (2010)","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2607.04875","last_updated":"2026-07-09T20:42:41Z","snapshot_observed_at":"2026-08-08T09:20:08.317218Z","submitted_at":"2026-07-06T09:50:20Z","title":"On the Complexity of Low-Rank Matrix Signing and Entrywise Power Matrix Factorization","version":2},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-07-13T06:57:23.207779Z"},"links":{"citing_paper":"/paper/2607.04875"},"observation_digest":"sha256:24aa66071e0147225e972ae48efd817617c67ac76ee9f472cc37dccec5fad676","observation_id":"7c08d0eb-5098-4efa-951d-d5b37bea32bf","resolution":{"observed_at":"2026-07-13T06:57:23.207779Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T06:57:23.207779Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.04875","last_updated":"2026-07-09T20:42:41Z","snapshot_observed_at":"2026-08-08T09:20:08.317218Z","submitted_at":"2026-07-06T09:50:20Z","title":"On the Complexity of Low-Rank Matrix Signing and Entrywise Power Matrix Factorization","version":2},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-07-13T06:57:23.207779Z"},"links":{"citing_paper":"/paper/2607.04875"},"observation_digest":"sha256:5ff57ecec89a06a45defb8fc60ed4c17d954cdf8535a95902e80d0f1d23b6356","observation_id":"fed23710-2833-426b-930c-3e541f6ffc14","resolution":{"observed_at":"2026-07-13T06:57:23.207779Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.04875","last_updated":"2026-07-09T20:42:41Z","latest_version":2,"primary_category":"cs.CC","snapshot_observed_at":"2026-08-08T09:20:08.317218Z","submitted_at":"2026-07-06T09:50:20Z","title":"On the Complexity of Low-Rank Matrix Signing and Entrywise Power Matrix Factorization"},"reference_resolution":{"displayed":46,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":46,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":46},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"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."}