{"as_of":"2026-08-08T22:38:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:3a4154ad8297a0b38a448bcb740a586406890d47d8ae1a724fa822aa8c935537","coverage":[{"denominator":70,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":70,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-31T12:43:18.931758Z","state":"measured"},{"denominator":70,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":70,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+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.24518/citation-record","integrity":"/paper/2607.24518/integrity","json":"/paper/2607.24518/citation-record.json","paper":"/paper/2607.24518"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T12:43:18.588762Z","title":"Decompositions of dependence for high-dimensional ex- tremes.Biometrika, 106(3):587–604, 06 2019","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.24518","last_updated":"2026-07-27T14:56:00Z","snapshot_observed_at":"2026-07-31T12:43:16.648011Z","submitted_at":"2026-07-27T14:56:00Z","title":"Low-Rank Dependence Decomposition via Accelerated Symmetric Non-negative Matrix Factorization","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-07-31T12:43:18.588762Z"},"links":{"citing_paper":"/paper/2607.24518"},"observation_digest":"sha256:7be837bc085532b020e0b46eb2ba3877e5a196695e827f5e22e739412b3f6bb9","observation_id":"a86ed556-b3a3-43bf-aed1-4b79e9756b67","resolution":{"observed_at":"2026-07-31T12:43:18.588762Z","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-31T12:43:18.594646Z","title":"Springer-Verlag, 2001","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2607.24518","last_updated":"2026-07-27T14:56:00Z","snapshot_observed_at":"2026-07-31T12:43:16.648011Z","submitted_at":"2026-07-27T14:56:00Z","title":"Low-Rank Dependence Decomposition via Accelerated Symmetric Non-negative Matrix Factorization","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-07-31T12:43:18.594646Z"},"links":{"citing_paper":"/paper/2607.24518"},"observation_digest":"sha256:813bd5b187835427a0d180879dcbf03aedfe18333d05e9b585fe57fba15587a2","observation_id":"16f01202-3fa9-4430-82bb-025a3f5c766c","resolution":{"observed_at":"2026-07-31T12:43:18.594646Z","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-31T12:43:18.600047Z","title":"Resnick.Heavy-Tail Phenomena: Probabilistic and Statistical Modeling","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2607.24518","last_updated":"2026-07-27T14:56:00Z","snapshot_observed_at":"2026-07-31T12:43:16.648011Z","submitted_at":"2026-07-27T14:56:00Z","title":"Low-Rank Dependence Decomposition via Accelerated Symmetric Non-negative Matrix Factorization","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-07-31T12:43:18.600047Z"},"links":{"citing_paper":"/paper/2607.24518"},"observation_digest":"sha256:25347e325ff0ce50ba6ccf5dddec9551a43a094d85fa6c1d85aaf4a47f93a30a","observation_id":"ebc2bc8d-8629-4d82-af73-af91710f1e3f","resolution":{"observed_at":"2026-07-31T12:43:18.600047Z","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-31T12:43:18.605040Z","title":"Symmetric nonnegative matrix factorization for graph clustering","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2607.24518","last_updated":"2026-07-27T14:56:00Z","snapshot_observed_at":"2026-07-31T12:43:16.648011Z","submitted_at":"2026-07-27T14:56:00Z","title":"Low-Rank Dependence Decomposition via Accelerated Symmetric Non-negative Matrix Factorization","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-07-31T12:43:18.605040Z"},"links":{"citing_paper":"/paper/2607.24518"},"observation_digest":"sha256:5d854dd6f522e902f669cc5de0bd62cc8e36895457311c991caa42b0fd4320da","observation_id":"9849c581-751f-412b-bf95-30fb14b7d35d","resolution":{"observed_at":"2026-07-31T12:43:18.605040Z","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-31T12:43:18.609757Z","title":"Symnmf: Nonnegative low-rank approximation of a similarity matrix for graph clustering.Journal of Global Optimization, 62(3):545–574, 2015","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2607.24518","last_updated":"2026-07-27T14:56:00Z","snapshot_observed_at":"2026-07-31T12:43:16.648011Z","submitted_at":"2026-07-27T14:56:00Z","title":"Low-Rank Dependence Decomposition via Accelerated Symmetric Non-negative Matrix Factorization","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-07-31T12:43:18.609757Z"},"links":{"citing_paper":"/paper/2607.24518"},"observation_digest":"sha256:a4b222ef36dbae2d7bca6166a52697a67f3cd231d1124e0046b7cb8f1ce49098","observation_id":"a2269a56-0203-45c2-b1ef-7b808ce2f166","resolution":{"observed_at":"2026-07-31T12:43:18.609757Z","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-31T12:43:18.614212Z","title":"Adaptive subgradient methods for online learning and stochastic optimization.Journal of Machine Learning Research, 12:2121–2159, 2011","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2607.24518","last_updated":"2026-07-27T14:56:00Z","snapshot_observed_at":"2026-07-31T12:43:16.648011Z","submitted_at":"2026-07-27T14:56:00Z","title":"Low-Rank Dependence Decomposition via Accelerated Symmetric Non-negative Matrix Factorization","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-07-31T12:43:18.614212Z"},"links":{"citing_paper":"/paper/2607.24518"},"observation_digest":"sha256:893bb6eed5c77f5f70306abd4b03489455b962fada5939b8e6fdcf53267c8fb3","observation_id":"f3867f96-cc82-4731-ac21-c6180b28f077","resolution":{"observed_at":"2026-07-31T12:43:18.614212Z","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-31T12:43:18.619287Z","title":null,"venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2607.24518","last_updated":"2026-07-27T14:56:00Z","snapshot_observed_at":"2026-07-31T12:43:16.648011Z","submitted_at":"2026-07-27T14:56:00Z","title":"Low-Rank Dependence Decomposition via Accelerated Symmetric Non-negative Matrix Factorization","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-07-31T12:43:18.619287Z"},"links":{"citing_paper":"/paper/2607.24518"},"observation_digest":"sha256:a0482fc2a017514ba86d42c647ee8f38cc0ad416415b46cf4a51c1c795420378","observation_id":"e333f584-d713-4630-92b2-4b5a85c5ce94","resolution":{"observed_at":"2026-07-31T12:43:18.619287Z","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-31T12:43:18.623775Z","title":"Lee and H","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2607.24518","last_updated":"2026-07-27T14:56:00Z","snapshot_observed_at":"2026-07-31T12:43:16.648011Z","submitted_at":"2026-07-27T14:56:00Z","title":"Low-Rank Dependence Decomposition via Accelerated Symmetric Non-negative Matrix Factorization","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-07-31T12:43:18.623775Z"},"links":{"citing_paper":"/paper/2607.24518"},"observation_digest":"sha256:487622aba3aeafe5387a40395c443afdc8655cce320f510883ba8cfa6dd5bce5","observation_id":"d4d8e3d1-336e-40c8-ad60-382497ff94eb","resolution":{"observed_at":"2026-07-31T12:43:18.623775Z","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-31T12:43:18.628180Z","title":"Lee and H","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2607.24518","last_updated":"2026-07-27T14:56:00Z","snapshot_observed_at":"2026-07-31T12:43:16.648011Z","submitted_at":"2026-07-27T14:56:00Z","title":"Low-Rank Dependence Decomposition via Accelerated Symmetric Non-negative Matrix Factorization","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-07-31T12:43:18.628180Z"},"links":{"citing_paper":"/paper/2607.24518"},"observation_digest":"sha256:f3374d7a89fd0eb42867859def6ae0da29cdbbc478eac05a649bb2909602bdfc","observation_id":"e1210bbf-b728-4316-9dda-4d641e1fc7af","resolution":{"observed_at":"2026-07-31T12:43:18.628180Z","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-31T12:43:18.633383Z","title":"Fundamentals of Algorithms","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.24518","last_updated":"2026-07-27T14:56:00Z","snapshot_observed_at":"2026-07-31T12:43:16.648011Z","submitted_at":"2026-07-27T14:56:00Z","title":"Low-Rank Dependence Decomposition via Accelerated Symmetric Non-negative Matrix Factorization","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-07-31T12:43:18.633383Z"},"links":{"citing_paper":"/paper/2607.24518"},"observation_digest":"sha256:482a0951f6c37769e9d0e84f8153e2fbb5a90fbed9640d6d87b7cea5c5c463cb","observation_id":"770f9cd7-1451-4b0c-ac9e-eb7b2710c533","resolution":{"observed_at":"2026-07-31T12:43:18.633383Z","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-31T12:43:18.637979Z","title":"Distributed optimization and statistical learning via the alternating direction method of multipliers.Foun- dations and Trends in Machine Learning, 3(1):1–122, 2011","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2607.24518","last_updated":"2026-07-27T14:56:00Z","snapshot_observed_at":"2026-07-31T12:43:16.648011Z","submitted_at":"2026-07-27T14:56:00Z","title":"Low-Rank Dependence Decomposition via Accelerated Symmetric Non-negative Matrix Factorization","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-07-31T12:43:18.637979Z"},"links":{"citing_paper":"/paper/2607.24518"},"observation_digest":"sha256:ee7c0bd116d82d61f5378286d7c98a14d006aedc91b4ebb0575f51e7a9cd1145","observation_id":"a13e5624-0364-406d-889f-052fcf28db6d","resolution":{"observed_at":"2026-07-31T12:43:18.637979Z","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-31T12:43:18.642795Z","title":"Symmetric non- negative matrix factorization: Algorithms and applications to probabilistic clustering.IEEE Transactions on Neural Networks, 22(12):2117–2131, 2011","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2607.24518","last_updated":"2026-07-27T14:56:00Z","snapshot_observed_at":"2026-07-31T12:43:16.648011Z","submitted_at":"2026-07-27T14:56:00Z","title":"Low-Rank Dependence Decomposition via Accelerated Symmetric Non-negative Matrix Factorization","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-07-31T12:43:18.642795Z"},"links":{"citing_paper":"/paper/2607.24518"},"observation_digest":"sha256:d15574f3ac79ca6e281530107187a647fead299276de1df230667151b90bba2f","observation_id":"241bf1e4-a519-4aa9-ba17-39daf5f6a7f6","resolution":{"observed_at":"2026-07-31T12:43:18.642795Z","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-31T12:43:18.648598Z","title":"Nemirovsky and David B","venue":null,"work_id":null,"year":1983},"citing_paper":{"arxiv_id":"2607.24518","last_updated":"2026-07-27T14:56:00Z","snapshot_observed_at":"2026-07-31T12:43:16.648011Z","submitted_at":"2026-07-27T14:56:00Z","title":"Low-Rank Dependence Decomposition via Accelerated Symmetric Non-negative Matrix Factorization","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-07-31T12:43:18.648598Z"},"links":{"citing_paper":"/paper/2607.24518"},"observation_digest":"sha256:9e092079e9cf4fabd2b6f0ad8c5c80906ea212fb7b3019f52dbf9e09ee390476","observation_id":"ececc406-30d8-4cec-87e6-71806a42b17d","resolution":{"observed_at":"2026-07-31T12:43:18.648598Z","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-31T12:43:18.653693Z","title":"Minimization of functions having Lipschitz continuous first partial derivatives","venue":null,"work_id":null,"year":1966},"citing_paper":{"arxiv_id":"2607.24518","last_updated":"2026-07-27T14:56:00Z","snapshot_observed_at":"2026-07-31T12:43:16.648011Z","submitted_at":"2026-07-27T14:56:00Z","title":"Low-Rank Dependence Decomposition via Accelerated Symmetric Non-negative Matrix Factorization","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-07-31T12:43:18.653693Z"},"links":{"citing_paper":"/paper/2607.24518"},"observation_digest":"sha256:1cc596e03f5238a6362605a5f542dd6faaf081c09aac9051f8f65ea32cebfa4d","observation_id":"9c31c456-1dfd-4795-bf9e-7d75574974b4","resolution":{"observed_at":"2026-07-31T12:43:18.653693Z","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-31T12:43:18.658535Z","title":"Some methods of speeding up the convergence of iteration methods.USSR Computational Mathematics and Mathematical Physics, 4(5):1–17, 1964","venue":null,"work_id":null,"year":1964},"citing_paper":{"arxiv_id":"2607.24518","last_updated":"2026-07-27T14:56:00Z","snapshot_observed_at":"2026-07-31T12:43:16.648011Z","submitted_at":"2026-07-27T14:56:00Z","title":"Low-Rank Dependence Decomposition via Accelerated Symmetric Non-negative Matrix Factorization","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-07-31T12:43:18.658535Z"},"links":{"citing_paper":"/paper/2607.24518"},"observation_digest":"sha256:0791d7dab4c7b951a70c9e64f6d42be6fcbdd0924a9dcb2cb7419da6c9b123f6","observation_id":"8b009d1a-a52b-4d2d-890d-ca6bd2d93836","resolution":{"observed_at":"2026-07-31T12:43:18.658535Z","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-31T12:43:18.665218Z","title":"A fast iterative shrinkage-thresholding algorithm for linear inverse problems.SIAM Journal on Imaging Sciences, 2(1):183–202, 2009","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2607.24518","last_updated":"2026-07-27T14:56:00Z","snapshot_observed_at":"2026-07-31T12:43:16.648011Z","submitted_at":"2026-07-27T14:56:00Z","title":"Low-Rank Dependence Decomposition via Accelerated Symmetric Non-negative Matrix Factorization","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-07-31T12:43:18.665218Z"},"links":{"citing_paper":"/paper/2607.24518"},"observation_digest":"sha256:cbbd0c408e610f3e709ed3c07a2d3f6ee4e38f6bd641c2d2fceb11b6d3453ade","observation_id":"09ecab0b-5809-4fec-8569-3e1b13f97c79","resolution":{"observed_at":"2026-07-31T12:43:18.665218Z","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-31T12:43:18.670113Z","title":"Adaptive restart for accelerated gradient schemes.Foundations of Computational Mathematics, 15(3):715–732, 2015","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2607.24518","last_updated":"2026-07-27T14:56:00Z","snapshot_observed_at":"2026-07-31T12:43:16.648011Z","submitted_at":"2026-07-27T14:56:00Z","title":"Low-Rank Dependence Decomposition via Accelerated Symmetric Non-negative Matrix Factorization","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-07-31T12:43:18.670113Z"},"links":{"citing_paper":"/paper/2607.24518"},"observation_digest":"sha256:8da53c19b2a3e666a58e75e10f7863f01ee6d251b00dc01aa4ceee9a64e90abc","observation_id":"bd537741-f235-4a00-88dc-065250f4951a","resolution":{"observed_at":"2026-07-31T12:43:18.670113Z","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-31T12:43:18.674581Z","title":"Lecture 6.5—RMSProp: Divide the gradient by a running average of its recent magnitude","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2607.24518","last_updated":"2026-07-27T14:56:00Z","snapshot_observed_at":"2026-07-31T12:43:16.648011Z","submitted_at":"2026-07-27T14:56:00Z","title":"Low-Rank Dependence Decomposition via Accelerated Symmetric Non-negative Matrix Factorization","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-07-31T12:43:18.674581Z"},"links":{"citing_paper":"/paper/2607.24518"},"observation_digest":"sha256:b49fbe5048408d7f04c24f5adea5241fde178c33478bcb4288b3e06452a341a4","observation_id":"5da48d11-6de1-4e99-b485-7c991d445e8b","resolution":{"observed_at":"2026-07-31T12:43:18.674581Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1412.6980","last_updated":"2017-01-30T01:27:54Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2014-12-22T13:54:29Z","title":"Adam: A Method for Stochastic Optimization","version":9},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1412.6980","snapshot_observed_at":"2026-07-31T12:43:18.679657Z","title":"Adam: A method for stochastic optimization.arXiv preprint arXiv:1412.6980, 2014","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2607.24518","last_updated":"2026-07-27T14:56:00Z","snapshot_observed_at":"2026-07-31T12:43:16.648011Z","submitted_at":"2026-07-27T14:56:00Z","title":"Low-Rank Dependence Decomposition via Accelerated Symmetric Non-negative Matrix Factorization","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-07-31T12:43:18.679657Z"},"links":{"cited_paper":"/paper/1412.6980","citing_paper":"/paper/2607.24518"},"observation_digest":"sha256:abb22502ff57454b9bec5d948e884748968ffa6b2e000f895fd33e1d8deadd44","observation_id":"88c7c3ad-2ec2-4330-886a-f160afcef534","resolution":{"observed_at":"2026-07-31T12:43:18.679657Z","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-31T12:43:18.684846Z","title":"Incorporating Nesterov momentum into Adam.ICLR Workshop, 2016","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.24518","last_updated":"2026-07-27T14:56:00Z","snapshot_observed_at":"2026-07-31T12:43:16.648011Z","submitted_at":"2026-07-27T14:56:00Z","title":"Low-Rank Dependence Decomposition via Accelerated Symmetric Non-negative Matrix Factorization","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-07-31T12:43:18.684846Z"},"links":{"citing_paper":"/paper/2607.24518"},"observation_digest":"sha256:f83468a44dbe122b8332cc1942ef944701673f18bcac6d943e8863e7df3f675c","observation_id":"db74ac5f-ad9f-4bb0-865b-00df78bbca9e","resolution":{"observed_at":"2026-07-31T12:43:18.684846Z","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-31T12:43:18.689786Z","title":"Adan: Adaptive nes- terov momentum algorithm for faster optimizing deep models.IEEE Transactions on Pattern Analysis and Machine Intelligence, 46(4):1791–1804, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.24518","last_updated":"2026-07-27T14:56:00Z","snapshot_observed_at":"2026-07-31T12:43:16.648011Z","submitted_at":"2026-07-27T14:56:00Z","title":"Low-Rank Dependence Decomposition via Accelerated Symmetric Non-negative Matrix Factorization","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-07-31T12:43:18.689786Z"},"links":{"citing_paper":"/paper/2607.24518"},"observation_digest":"sha256:68d61ef3721cbcc81fca62a988f6ca1fb056558d278a39586c6c6d5086b396ed","observation_id":"95a62759-6089-4eb6-953d-6bcb0d3e76c5","resolution":{"observed_at":"2026-07-31T12:43:18.689786Z","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-31T12:43:18.694244Z","title":"Accelerating stochastic gradient descent using predictive vari- ance reduction.Advances in Neural Information Processing Systems, 26, 2013","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2607.24518","last_updated":"2026-07-27T14:56:00Z","snapshot_observed_at":"2026-07-31T12:43:16.648011Z","submitted_at":"2026-07-27T14:56:00Z","title":"Low-Rank Dependence Decomposition via Accelerated Symmetric Non-negative Matrix Factorization","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-07-31T12:43:18.694244Z"},"links":{"citing_paper":"/paper/2607.24518"},"observation_digest":"sha256:19ee4e20e420b6d21b127b08937d410555318c866f0125a824806a8ca615f891","observation_id":"2a268575-eb17-431e-89a5-45ee882230d2","resolution":{"observed_at":"2026-07-31T12:43:18.694244Z","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-31T12:43:18.698668Z","title":"Friedlander and Mark Schmidt","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2607.24518","last_updated":"2026-07-27T14:56:00Z","snapshot_observed_at":"2026-07-31T12:43:16.648011Z","submitted_at":"2026-07-27T14:56:00Z","title":"Low-Rank Dependence Decomposition via Accelerated Symmetric Non-negative Matrix Factorization","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-07-31T12:43:18.698668Z"},"links":{"citing_paper":"/paper/2607.24518"},"observation_digest":"sha256:a8d9ac607325334f0e3d37d2dec9b19a8b5002f6af8a0435f8bf7097c876c33b","observation_id":"0ef24110-0d31-4c60-a4ab-a0f763ada5c9","resolution":{"observed_at":"2026-07-31T12:43:18.698668Z","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-31T12:43:18.703320Z","title":"Byrd, Gillian M","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2607.24518","last_updated":"2026-07-27T14:56:00Z","snapshot_observed_at":"2026-07-31T12:43:16.648011Z","submitted_at":"2026-07-27T14:56:00Z","title":"Low-Rank Dependence Decomposition via Accelerated Symmetric Non-negative Matrix Factorization","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-07-31T12:43:18.703320Z"},"links":{"citing_paper":"/paper/2607.24518"},"observation_digest":"sha256:657684148f0a652015d6bceed15855d5f498f60315b393e7b7a3bc2a2ec50b29","observation_id":"c1217713-9269-4381-b04a-6e30c01a5087","resolution":{"observed_at":"2026-07-31T12:43:18.703320Z","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-31T12:43:18.707753Z","title":null,"venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2607.24518","last_updated":"2026-07-27T14:56:00Z","snapshot_observed_at":"2026-07-31T12:43:16.648011Z","submitted_at":"2026-07-27T14:56:00Z","title":"Low-Rank Dependence Decomposition via Accelerated Symmetric Non-negative Matrix Factorization","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-07-31T12:43:18.707753Z"},"links":{"citing_paper":"/paper/2607.24518"},"observation_digest":"sha256:63f9d4cb66745dedfa3ae126e54c98f07841fdb607cc19aa68dae9e36db9cc6b","observation_id":"0a673275-2611-42f9-8e73-f89d8767564d","resolution":{"observed_at":"2026-07-31T12:43:18.707753Z","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-31T12:43:18.713225Z","title":"Algorithms for nonnegative matrix and tensor factorizations: A unified view based on block coordinate descent framework.Journal of Global Optimization, 58(2):285–319, 2014","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2607.24518","last_updated":"2026-07-27T14:56:00Z","snapshot_observed_at":"2026-07-31T12:43:16.648011Z","submitted_at":"2026-07-27T14:56:00Z","title":"Low-Rank Dependence Decomposition via Accelerated Symmetric Non-negative Matrix Factorization","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-07-31T12:43:18.713225Z"},"links":{"citing_paper":"/paper/2607.24518"},"observation_digest":"sha256:04b4fc6c2bb60c3eca6396b29a13960172c9a9a207f1248142d9b34482bd0c65","observation_id":"9d68aa64-214c-4422-92c7-e20b73add98d","resolution":{"observed_at":"2026-07-31T12:43:18.713225Z","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-31T12:43:18.718413Z","title":"A method for the solution of certain non-linear problems in least squares","venue":null,"work_id":null,"year":1944},"citing_paper":{"arxiv_id":"2607.24518","last_updated":"2026-07-27T14:56:00Z","snapshot_observed_at":"2026-07-31T12:43:16.648011Z","submitted_at":"2026-07-27T14:56:00Z","title":"Low-Rank Dependence Decomposition via Accelerated Symmetric Non-negative Matrix Factorization","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-07-31T12:43:18.718413Z"},"links":{"citing_paper":"/paper/2607.24518"},"observation_digest":"sha256:794f75d387adc608a88b86e4f3b5e761727ceafebe8559e8398cdc637f7a560c","observation_id":"17cb0d6d-c356-4532-92ab-1aa77fc6de63","resolution":{"observed_at":"2026-07-31T12:43:18.718413Z","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-31T12:43:18.723098Z","title":"Marquardt","venue":null,"work_id":null,"year":1963},"citing_paper":{"arxiv_id":"2607.24518","last_updated":"2026-07-27T14:56:00Z","snapshot_observed_at":"2026-07-31T12:43:16.648011Z","submitted_at":"2026-07-27T14:56:00Z","title":"Low-Rank Dependence Decomposition via Accelerated Symmetric Non-negative Matrix Factorization","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-07-31T12:43:18.723098Z"},"links":{"citing_paper":"/paper/2607.24518"},"observation_digest":"sha256:69bbb6961b7e70b9f1059353b87eaab28b630349ba2370dce63eab6a74c5bb8e","observation_id":"f694995c-b0e1-4254-aac3-570ef606be6e","resolution":{"observed_at":"2026-07-31T12:43:18.723098Z","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-31T12:43:18.727715Z","title":"Wright.Numerical Optimization","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2607.24518","last_updated":"2026-07-27T14:56:00Z","snapshot_observed_at":"2026-07-31T12:43:16.648011Z","submitted_at":"2026-07-27T14:56:00Z","title":"Low-Rank Dependence Decomposition via Accelerated Symmetric Non-negative Matrix Factorization","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-07-31T12:43:18.727715Z"},"links":{"citing_paper":"/paper/2607.24518"},"observation_digest":"sha256:ebc10a144ccf06eb12977d4551fa3bb46cbe5e4b7fd4382a2f29f4bb158bfac1","observation_id":"76d32adb-ab1e-44c9-ab87-6c8a9479d9b9","resolution":{"observed_at":"2026-07-31T12:43:18.727715Z","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-31T12:43:18.732504Z","title":"Distributed-memory parallel symmetric nonnegative matrix factorization","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.24518","last_updated":"2026-07-27T14:56:00Z","snapshot_observed_at":"2026-07-31T12:43:16.648011Z","submitted_at":"2026-07-27T14:56:00Z","title":"Low-Rank Dependence Decomposition via Accelerated Symmetric Non-negative Matrix Factorization","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-07-31T12:43:18.732504Z"},"links":{"citing_paper":"/paper/2607.24518"},"observation_digest":"sha256:8794d2b87ac7910ff9636c8beac1bdaa76c50b835de0030654fe7b9085a8b4eb","observation_id":"3b589a72-fe26-4939-8a0a-f6c7dc9787e7","resolution":{"observed_at":"2026-07-31T12:43:18.732504Z","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-31T12:43:18.737140Z","title":"Matheson, and Haesun Park","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.24518","last_updated":"2026-07-27T14:56:00Z","snapshot_observed_at":"2026-07-31T12:43:16.648011Z","submitted_at":"2026-07-27T14:56:00Z","title":"Low-Rank Dependence Decomposition via Accelerated Symmetric Non-negative Matrix Factorization","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-07-31T12:43:18.737140Z"},"links":{"citing_paper":"/paper/2607.24518"},"observation_digest":"sha256:73c7d93806f3d123e4780c418951573c0ad237c4496bc91492b90d3ded5a43ea","observation_id":"4268aa5c-15ae-43e7-83ef-f48224e12a7b","resolution":{"observed_at":"2026-07-31T12:43:18.737140Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.08134","last_updated":"2024-11-28T20:13:48Z","snapshot_observed_at":"2026-08-05T11:03:45.643323Z","submitted_at":"2024-02-13T00:02:05Z","title":"Randomized Algorithms for Symmetric Nonnegative Matrix Factorization","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.08134","snapshot_observed_at":"2026-07-31T12:43:18.742219Z","title":"Aksoy, Grey Ballard, and Haesun Park","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.24518","last_updated":"2026-07-27T14:56:00Z","snapshot_observed_at":"2026-07-31T12:43:16.648011Z","submitted_at":"2026-07-27T14:56:00Z","title":"Low-Rank Dependence Decomposition via Accelerated Symmetric Non-negative Matrix Factorization","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-07-31T12:43:18.742219Z"},"links":{"cited_paper":"/paper/2402.08134","citing_paper":"/paper/2607.24518"},"observation_digest":"sha256:3eab64138262b65b43e970fedb44cd969f78bec3abef3c20dfc854b3cc8f1efb","observation_id":"ac768d1f-b932-48a7-aa3b-9851db7527cc","resolution":{"observed_at":"2026-07-31T12:43:18.742219Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2205.13214","last_updated":"2022-05-26T08:17:39Z","snapshot_observed_at":"2026-08-07T06:14:32.413937Z","submitted_at":"2022-05-26T08:17:39Z","title":"SymNMF-Net for The Symmetric NMF Problem","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2205.13214","snapshot_observed_at":"2026-07-31T12:43:18.747499Z","title":"Symnmf-net for the symmetric nmf problem","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.24518","last_updated":"2026-07-27T14:56:00Z","snapshot_observed_at":"2026-07-31T12:43:16.648011Z","submitted_at":"2026-07-27T14:56:00Z","title":"Low-Rank Dependence Decomposition via Accelerated Symmetric Non-negative Matrix Factorization","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-07-31T12:43:18.747499Z"},"links":{"cited_paper":"/paper/2205.13214","citing_paper":"/paper/2607.24518"},"observation_digest":"sha256:7b6fac729c72f01955a3322030455aac3cb9baa2b699c9b68fe441abbc2aef1c","observation_id":"518ad2ce-3cf7-41d2-8b1a-4a34c54f466e","resolution":{"observed_at":"2026-07-31T12:43:18.747499Z","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-31T12:43:18.754300Z","title":"Re- thinking non-negative matrix factorization with implicit neural representations","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.24518","last_updated":"2026-07-27T14:56:00Z","snapshot_observed_at":"2026-07-31T12:43:16.648011Z","submitted_at":"2026-07-27T14:56:00Z","title":"Low-Rank Dependence Decomposition via Accelerated Symmetric Non-negative Matrix Factorization","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-07-31T12:43:18.754300Z"},"links":{"citing_paper":"/paper/2607.24518"},"observation_digest":"sha256:8cf96c6bb6d162cdc80f99f4d2bb5650506a3943f0baf467ebde0bec3540f379","observation_id":"3661db83-7462-43e7-8111-4e46c0534f1d","resolution":{"observed_at":"2026-07-31T12:43:18.754300Z","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-31T12:43:18.758622Z","title":"Springer Science & Business Media, 2013","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2607.24518","last_updated":"2026-07-27T14:56:00Z","snapshot_observed_at":"2026-07-31T12:43:16.648011Z","submitted_at":"2026-07-27T14:56:00Z","title":"Low-Rank Dependence Decomposition via Accelerated Symmetric Non-negative Matrix Factorization","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-07-31T12:43:18.758622Z"},"links":{"citing_paper":"/paper/2607.24518"},"observation_digest":"sha256:dc5c538aac735497bab4d7c0e1f47d30af721dec65fa274c86747c41e13e3386","observation_id":"d873f57d-c312-40f9-9bf2-ec86cd423f73","resolution":{"observed_at":"2026-07-31T12:43:18.758622Z","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-31T12:43:18.763069Z","title":"Springer Series in Operations Research and Financial Engineering","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2607.24518","last_updated":"2026-07-27T14:56:00Z","snapshot_observed_at":"2026-07-31T12:43:16.648011Z","submitted_at":"2026-07-27T14:56:00Z","title":"Low-Rank Dependence Decomposition via Accelerated Symmetric Non-negative Matrix Factorization","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-07-31T12:43:18.763069Z"},"links":{"citing_paper":"/paper/2607.24518"},"observation_digest":"sha256:386405124d014c5c03a5221091ade4ab6b9525dbafdf2eae21112bd8f56203ed","observation_id":"2e48c377-d87a-482f-9797-7180496f49b6","resolution":{"observed_at":"2026-07-31T12:43:18.763069Z","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-31T12:43:18.768275Z","title":"Resnick.Extreme Values, Regular Variation and Point Processes","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2607.24518","last_updated":"2026-07-27T14:56:00Z","snapshot_observed_at":"2026-07-31T12:43:16.648011Z","submitted_at":"2026-07-27T14:56:00Z","title":"Low-Rank Dependence Decomposition via Accelerated Symmetric Non-negative Matrix Factorization","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-07-31T12:43:18.768275Z"},"links":{"citing_paper":"/paper/2607.24518"},"observation_digest":"sha256:c184a8e27fd2e70e058fc91d5d4392b259b595cc27b6e3af5dffcf01588168e8","observation_id":"a6e37270-4cfb-493f-83a2-99d2a0683a70","resolution":{"observed_at":"2026-07-31T12:43:18.768275Z","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-31T12:43:18.772821Z","title":"Basel iii: A global regulatory framework for more resilient banks and banking systems, 2011","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2607.24518","last_updated":"2026-07-27T14:56:00Z","snapshot_observed_at":"2026-07-31T12:43:16.648011Z","submitted_at":"2026-07-27T14:56:00Z","title":"Low-Rank Dependence Decomposition via Accelerated Symmetric Non-negative Matrix Factorization","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-07-31T12:43:18.772821Z"},"links":{"citing_paper":"/paper/2607.24518"},"observation_digest":"sha256:9a56580b7f0b5cca76c003a245db79818edc5356f5fe0d4daca76e29d1f17742","observation_id":"03965d59-5a84-4f47-be45-a201f183a2c2","resolution":{"observed_at":"2026-07-31T12:43:18.772821Z","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-31T12:43:18.778172Z","title":"A tail dependence-based dissimilarity measure for financial time series clustering.Adv Data Anal Classif, 5:323–340, 2011","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2607.24518","last_updated":"2026-07-27T14:56:00Z","snapshot_observed_at":"2026-07-31T12:43:16.648011Z","submitted_at":"2026-07-27T14:56:00Z","title":"Low-Rank Dependence Decomposition via Accelerated Symmetric Non-negative Matrix Factorization","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-07-31T12:43:18.778172Z"},"links":{"citing_paper":"/paper/2607.24518"},"observation_digest":"sha256:2bfcce83228d632c09e59758276369b4929f37255be622b597c963113ed98c21","observation_id":"5c7b51d3-0943-4d9c-b810-d42a67ee3f2b","resolution":{"observed_at":"2026-07-31T12:43:18.778172Z","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-31T12:43:18.782968Z","title":"Hierarchical risk parity: Accounting for tail dependencies in multi-asset multi-factor allocations","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.24518","last_updated":"2026-07-27T14:56:00Z","snapshot_observed_at":"2026-07-31T12:43:16.648011Z","submitted_at":"2026-07-27T14:56:00Z","title":"Low-Rank Dependence Decomposition via Accelerated Symmetric Non-negative Matrix Factorization","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-07-31T12:43:18.782968Z"},"links":{"citing_paper":"/paper/2607.24518"},"observation_digest":"sha256:ab0b44ed8055671c55816bd8db7b1730f41c19d4ebee676c91939e7a395b80d8","observation_id":"a2542287-e601-4991-9cf2-54230dec8a9b","resolution":{"observed_at":"2026-07-31T12:43:18.782968Z","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-31T12:43:18.788195Z","title":"Bivariate extreme statistics.Annals of the Institute of Statistical Mathematics, 11(2):195–210, 1960","venue":null,"work_id":null,"year":1960},"citing_paper":{"arxiv_id":"2607.24518","last_updated":"2026-07-27T14:56:00Z","snapshot_observed_at":"2026-07-31T12:43:16.648011Z","submitted_at":"2026-07-27T14:56:00Z","title":"Low-Rank Dependence Decomposition via Accelerated Symmetric Non-negative Matrix Factorization","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-07-31T12:43:18.788195Z"},"links":{"citing_paper":"/paper/2607.24518"},"observation_digest":"sha256:14797ba8fe51647cdc7a92760b87d5e43f9df6b533a7b1171882e3b9e11018b3","observation_id":"25e6b382-17f4-48e1-a99f-f1be10b5e640","resolution":{"observed_at":"2026-07-31T12:43:18.788195Z","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-31T12:43:18.794473Z","title":null,"venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2607.24518","last_updated":"2026-07-27T14:56:00Z","snapshot_observed_at":"2026-07-31T12:43:16.648011Z","submitted_at":"2026-07-27T14:56:00Z","title":"Low-Rank Dependence Decomposition via Accelerated Symmetric Non-negative Matrix Factorization","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-07-31T12:43:18.794473Z"},"links":{"citing_paper":"/paper/2607.24518"},"observation_digest":"sha256:0b068ec05ce4c6f934af6112325d3f0a0762efe853ab4e9ee50061d7f0c4d39f","observation_id":"684116f4-90ce-45c2-88d3-5ea93680f0d0","resolution":{"observed_at":"2026-07-31T12:43:18.794473Z","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-31T12:43:18.799469Z","title":"Extremal behavior of stochastic integrals driven by regularly varying l´ evy processes.The Annals of Probability, 35(1):225–264, jan 2007","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2607.24518","last_updated":"2026-07-27T14:56:00Z","snapshot_observed_at":"2026-07-31T12:43:16.648011Z","submitted_at":"2026-07-27T14:56:00Z","title":"Low-Rank Dependence Decomposition via Accelerated Symmetric Non-negative Matrix Factorization","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-07-31T12:43:18.799469Z"},"links":{"citing_paper":"/paper/2607.24518"},"observation_digest":"sha256:e6771ebfa7de8339f881840b4606502e6cd00b11160adea4d7b0ea68ff89b100","observation_id":"534f01b2-8558-43ac-af36-bfd96594d33f","resolution":{"observed_at":"2026-07-31T12:43:18.799469Z","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-31T12:43:18.804678Z","title":"Konstantinides, and Dingding Wang","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.24518","last_updated":"2026-07-27T14:56:00Z","snapshot_observed_at":"2026-07-31T12:43:16.648011Z","submitted_at":"2026-07-27T14:56:00Z","title":"Low-Rank Dependence Decomposition via Accelerated Symmetric Non-negative Matrix Factorization","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-07-31T12:43:18.804678Z"},"links":{"citing_paper":"/paper/2607.24518"},"observation_digest":"sha256:cae98be0216d6c2524b4c0979d1ff6b9d1ef432de15cb78477310c99742761f8","observation_id":"4a1edfae-d484-4c5c-9a45-db42ce1f9e38","resolution":{"observed_at":"2026-07-31T12:43:18.804678Z","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-31T12:43:18.809584Z","title":"Bertsekas.Nonlinear Programming","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2607.24518","last_updated":"2026-07-27T14:56:00Z","snapshot_observed_at":"2026-07-31T12:43:16.648011Z","submitted_at":"2026-07-27T14:56:00Z","title":"Low-Rank Dependence Decomposition via Accelerated Symmetric Non-negative Matrix Factorization","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-07-31T12:43:18.809584Z"},"links":{"citing_paper":"/paper/2607.24518"},"observation_digest":"sha256:a4905d2063f11f67f5c05aaf7fb7cac9bd2643e0ee342a5fe7ca497992e3373a","observation_id":"c12a8276-3b36-464f-847c-11027512ee71","resolution":{"observed_at":"2026-07-31T12:43:18.809584Z","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-31T12:43:18.814572Z","title":"Projected gradient methods for nonnegative matrix factorization.Neural Com- putation, 19(10):2756–2779, 2007","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2607.24518","last_updated":"2026-07-27T14:56:00Z","snapshot_observed_at":"2026-07-31T12:43:16.648011Z","submitted_at":"2026-07-27T14:56:00Z","title":"Low-Rank Dependence Decomposition via Accelerated Symmetric Non-negative Matrix Factorization","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-07-31T12:43:18.814572Z"},"links":{"citing_paper":"/paper/2607.24518"},"observation_digest":"sha256:1dfd0a5b76bfe8ac57c123f0471c5ca58b898a22f9b0531ebaed4315dae0b21c","observation_id":"a9080371-0c02-4034-ae93-20291b871ee3","resolution":{"observed_at":"2026-07-31T12:43:18.814572Z","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-31T12:43:18.819591Z","title":"A well-conditioned estimator for large-dimensional covariance matrices.Journal of Multivariate Analysis, 88(2):365–411, 2004","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2607.24518","last_updated":"2026-07-27T14:56:00Z","snapshot_observed_at":"2026-07-31T12:43:16.648011Z","submitted_at":"2026-07-27T14:56:00Z","title":"Low-Rank Dependence Decomposition via Accelerated Symmetric Non-negative Matrix Factorization","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-07-31T12:43:18.819591Z"},"links":{"citing_paper":"/paper/2607.24518"},"observation_digest":"sha256:c30b0614c82fee2420cee0282301940d0e2d44c066794d65f3bb59ba7a313b59","observation_id":"2a0e2ea6-0d28-4d06-b673-ccd6dd350088","resolution":{"observed_at":"2026-07-31T12:43:18.819591Z","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-31T12:43:18.824039Z","title":"Marchenko and Leonid A","venue":null,"work_id":null,"year":1967},"citing_paper":{"arxiv_id":"2607.24518","last_updated":"2026-07-27T14:56:00Z","snapshot_observed_at":"2026-07-31T12:43:16.648011Z","submitted_at":"2026-07-27T14:56:00Z","title":"Low-Rank Dependence Decomposition via Accelerated Symmetric Non-negative Matrix Factorization","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-07-31T12:43:18.824039Z"},"links":{"citing_paper":"/paper/2607.24518"},"observation_digest":"sha256:dace49a2710d5e134e27e699e629bec6f5b9d45af20a57b6a33dc8b58d6b958e","observation_id":"1f68580e-b151-41d1-918b-2dc90d932b1e","resolution":{"observed_at":"2026-07-31T12:43:18.824039Z","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-31T12:43:18.828754Z","title":"Consistency of spectral clustering in stochastic block models","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2607.24518","last_updated":"2026-07-27T14:56:00Z","snapshot_observed_at":"2026-07-31T12:43:16.648011Z","submitted_at":"2026-07-27T14:56:00Z","title":"Low-Rank Dependence Decomposition via Accelerated Symmetric Non-negative Matrix Factorization","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-07-31T12:43:18.828754Z"},"links":{"citing_paper":"/paper/2607.24518"},"observation_digest":"sha256:af7cfc050b0caeb2e13bebaab4d3e7002ea29438b479aa8c81a7d7169bd9555d","observation_id":"e9768242-4651-4088-bc76-c9c814a2a270","resolution":{"observed_at":"2026-07-31T12:43:18.828754Z","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-31T12:43:18.832898Z","title":null,"venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2607.24518","last_updated":"2026-07-27T14:56:00Z","snapshot_observed_at":"2026-07-31T12:43:16.648011Z","submitted_at":"2026-07-27T14:56:00Z","title":"Low-Rank Dependence Decomposition via Accelerated Symmetric Non-negative Matrix Factorization","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-07-31T12:43:18.832898Z"},"links":{"citing_paper":"/paper/2607.24518"},"observation_digest":"sha256:af82f5e7acb387270f425502567c2eae7311c94ee6aea5b323187da5cb49f629","observation_id":"21ad0e32-3945-4657-ac25-8421aba732a8","resolution":{"observed_at":"2026-07-31T12:43:18.832898Z","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-31T12:43:18.836942Z","title":"Svd based initialization: A head start for nonnegative matrix factorization.Pattern Recognition, 41(4):1350–1362, 2008","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2607.24518","last_updated":"2026-07-27T14:56:00Z","snapshot_observed_at":"2026-07-31T12:43:16.648011Z","submitted_at":"2026-07-27T14:56:00Z","title":"Low-Rank Dependence Decomposition via Accelerated Symmetric Non-negative Matrix Factorization","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-07-31T12:43:18.836942Z"},"links":{"citing_paper":"/paper/2607.24518"},"observation_digest":"sha256:fccaeb4595e05ce3cfdd4160495b0a839b651068f46765f6cc224f3758af83ba","observation_id":"8bc83e07-6056-4762-b8d7-2f54cdd3297d","resolution":{"observed_at":"2026-07-31T12:43:18.836942Z","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-31T12:43:18.841510Z","title":"Polyak and Anatoli B","venue":null,"work_id":null,"year":1992},"citing_paper":{"arxiv_id":"2607.24518","last_updated":"2026-07-27T14:56:00Z","snapshot_observed_at":"2026-07-31T12:43:16.648011Z","submitted_at":"2026-07-27T14:56:00Z","title":"Low-Rank Dependence Decomposition via Accelerated Symmetric Non-negative Matrix Factorization","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-07-31T12:43:18.841510Z"},"links":{"citing_paper":"/paper/2607.24518"},"observation_digest":"sha256:4003c279ce893a42e92fef976ed4175dea7265fff0ab54242017b885da38a945","observation_id":"33c5f6d2-6f96-4ccf-85c8-1daf21a528c2","resolution":{"observed_at":"2026-07-31T12:43:18.841510Z","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-31T12:43:18.845941Z","title":"Efficient estimations from a slowly convergent Robbins–Monro process.Tech- nical Report, Cornell University, 1988","venue":null,"work_id":null,"year":1988},"citing_paper":{"arxiv_id":"2607.24518","last_updated":"2026-07-27T14:56:00Z","snapshot_observed_at":"2026-07-31T12:43:16.648011Z","submitted_at":"2026-07-27T14:56:00Z","title":"Low-Rank Dependence Decomposition via Accelerated Symmetric Non-negative Matrix Factorization","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-07-31T12:43:18.845941Z"},"links":{"citing_paper":"/paper/2607.24518"},"observation_digest":"sha256:cdf4992882e756c8e26d5cf205ad470ee9c9ae6fb681a4e4b0248a2d5245e713","observation_id":"2102d690-f2d1-432d-8f23-6163ac90c227","resolution":{"observed_at":"2026-07-31T12:43:18.845941Z","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-31T12:43:18.850550Z","title":"Dual averaging methods for regularized stochastic learning and online optimization","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2607.24518","last_updated":"2026-07-27T14:56:00Z","snapshot_observed_at":"2026-07-31T12:43:16.648011Z","submitted_at":"2026-07-27T14:56:00Z","title":"Low-Rank Dependence Decomposition via Accelerated Symmetric Non-negative Matrix Factorization","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-07-31T12:43:18.850550Z"},"links":{"citing_paper":"/paper/2607.24518"},"observation_digest":"sha256:966d33120c8673b0802a9c4a605c081200eb1ad02d1128cdb07001f6f7f30fec","observation_id":"47a2a200-9b91-4793-a3ea-82e9324e8b1c","resolution":{"observed_at":"2026-07-31T12:43:18.850550Z","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-31T12:43:18.854948Z","title":null,"venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2607.24518","last_updated":"2026-07-27T14:56:00Z","snapshot_observed_at":"2026-07-31T12:43:16.648011Z","submitted_at":"2026-07-27T14:56:00Z","title":"Low-Rank Dependence Decomposition via Accelerated Symmetric Non-negative Matrix Factorization","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-07-31T12:43:18.854948Z"},"links":{"citing_paper":"/paper/2607.24518"},"observation_digest":"sha256:40d1b07f2fcb8f04ce92bba58fd35b78a77e29c13d8303c77850b74a42e174f4","observation_id":"1752e185-0428-443f-bd37-5741c2dbca11","resolution":{"observed_at":"2026-07-31T12:43:18.854948Z","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-31T12:43:18.859569Z","title":"Woodruff","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2607.24518","last_updated":"2026-07-27T14:56:00Z","snapshot_observed_at":"2026-07-31T12:43:16.648011Z","submitted_at":"2026-07-27T14:56:00Z","title":"Low-Rank Dependence Decomposition via Accelerated Symmetric Non-negative Matrix Factorization","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-07-31T12:43:18.859569Z"},"links":{"citing_paper":"/paper/2607.24518"},"observation_digest":"sha256:0b664ad6b29616d7bce043244b686c47e2dae4d110f8d458b7647970ec0c64ed","observation_id":"0fcb1583-6ac6-4d83-971f-8c88a5c5efeb","resolution":{"observed_at":"2026-07-31T12:43:18.859569Z","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-31T12:43:18.865568Z","title":"Some methods for classification and analysis of multivariate observations","venue":null,"work_id":null,"year":1967},"citing_paper":{"arxiv_id":"2607.24518","last_updated":"2026-07-27T14:56:00Z","snapshot_observed_at":"2026-07-31T12:43:16.648011Z","submitted_at":"2026-07-27T14:56:00Z","title":"Low-Rank Dependence Decomposition via Accelerated Symmetric Non-negative Matrix Factorization","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-07-31T12:43:18.865568Z"},"links":{"citing_paper":"/paper/2607.24518"},"observation_digest":"sha256:2a4f5a1620685fe23622b5d5af0dd0654003a4998762bfbce47ad2210f9d9910","observation_id":"c12c72a9-ec20-48e1-8c4b-b52e097d393c","resolution":{"observed_at":"2026-07-31T12:43:18.865568Z","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-31T12:43:18.870864Z","title":"Dhillon and Dharmendra S","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2607.24518","last_updated":"2026-07-27T14:56:00Z","snapshot_observed_at":"2026-07-31T12:43:16.648011Z","submitted_at":"2026-07-27T14:56:00Z","title":"Low-Rank Dependence Decomposition via Accelerated Symmetric Non-negative Matrix Factorization","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-07-31T12:43:18.870864Z"},"links":{"citing_paper":"/paper/2607.24518"},"observation_digest":"sha256:abcd67cde37fe6b225179baa623cb365690fcf757e133f1fea8da284f7cdabc4","observation_id":"5acb6997-ac1a-49da-98d1-b6f7797a9d52","resolution":{"observed_at":"2026-07-31T12:43:18.870864Z","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-31T12:43:18.875661Z","title":"Spherical k-means clustering","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2607.24518","last_updated":"2026-07-27T14:56:00Z","snapshot_observed_at":"2026-07-31T12:43:16.648011Z","submitted_at":"2026-07-27T14:56:00Z","title":"Low-Rank Dependence Decomposition via Accelerated Symmetric Non-negative Matrix Factorization","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-07-31T12:43:18.875661Z"},"links":{"citing_paper":"/paper/2607.24518"},"observation_digest":"sha256:ee79c3102ffe056e4526105a58210c2618c8bea052d3da63652aca40b368c99c","observation_id":"a517d9fa-aad2-4597-8f4b-8b7b518c7505","resolution":{"observed_at":"2026-07-31T12:43:18.875661Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1212.0437","last_updated":"2012-12-03T16:25:53Z","snapshot_observed_at":"2026-07-06T03:01:10.229407Z","submitted_at":"2012-12-03T16:25:53Z","title":"Modelling cytoskeletal traffic: an interplay between passive diffusion and active transport","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1212.0437","snapshot_observed_at":"2026-07-31T12:43:18.880829Z","title":"Nonconvex admm for sparse+sparse matrix decom- position.arXiv preprint arXiv:1212.0437, 2012","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2607.24518","last_updated":"2026-07-27T14:56:00Z","snapshot_observed_at":"2026-07-31T12:43:16.648011Z","submitted_at":"2026-07-27T14:56:00Z","title":"Low-Rank Dependence Decomposition via Accelerated Symmetric Non-negative Matrix Factorization","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-07-31T12:43:18.880829Z"},"links":{"cited_paper":"/paper/1212.0437","citing_paper":"/paper/2607.24518"},"observation_digest":"sha256:a22b814e1b4647e4ae65e1094cd180ca75cc265d2481894627cf013022710517","observation_id":"55559680-dc8c-49a4-9f61-c888968f2cd2","resolution":{"observed_at":"2026-07-31T12:43:18.880829Z","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-31T12:43:18.885900Z","title":"A stochastic nonconvex splitting method for symmetric nonnegative matrix factorization","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.24518","last_updated":"2026-07-27T14:56:00Z","snapshot_observed_at":"2026-07-31T12:43:16.648011Z","submitted_at":"2026-07-27T14:56:00Z","title":"Low-Rank Dependence Decomposition via Accelerated Symmetric Non-negative Matrix Factorization","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-07-31T12:43:18.885900Z"},"links":{"citing_paper":"/paper/2607.24518"},"observation_digest":"sha256:f97ee60051b2332a96795fab943b26194c1c7ec7415a73fc8cd719ad57a54f1b","observation_id":"987923da-6669-4c6b-9e12-f69f87a7ac89","resolution":{"observed_at":"2026-07-31T12:43:18.885900Z","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-31T12:43:18.891218Z","title":"Convergence analysis of alternating direction method of multipliers for nonconvex problems.Journal of Optimization Theory and Applications, 172(3):33–64, 2016","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.24518","last_updated":"2026-07-27T14:56:00Z","snapshot_observed_at":"2026-07-31T12:43:16.648011Z","submitted_at":"2026-07-27T14:56:00Z","title":"Low-Rank Dependence Decomposition via Accelerated Symmetric Non-negative Matrix Factorization","version":1},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-07-31T12:43:18.891218Z"},"links":{"citing_paper":"/paper/2607.24518"},"observation_digest":"sha256:402813dab631963748463c41d5eede79054218752ef522aa2d933d06135f8086","observation_id":"9c485e98-84ff-46a8-8d91-82f792c79fa6","resolution":{"observed_at":"2026-07-31T12:43:18.891218Z","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-31T12:43:18.895869Z","title":"MPI-F AUN: An MPI-based frame- work for alternating-updating nonnegative matrix factorization.IEEE Transactions on Knowl- edge and Data Engineering, 30(3):544–558, 2018","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.24518","last_updated":"2026-07-27T14:56:00Z","snapshot_observed_at":"2026-07-31T12:43:16.648011Z","submitted_at":"2026-07-27T14:56:00Z","title":"Low-Rank Dependence Decomposition via Accelerated Symmetric Non-negative Matrix Factorization","version":1},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-07-31T12:43:18.895869Z"},"links":{"citing_paper":"/paper/2607.24518"},"observation_digest":"sha256:578720785b3428c7a8b02ce16881cb39afd576842e19fd4addd3883ce0a92d33","observation_id":"b4fe9564-205c-4c02-b092-0d2636093f54","resolution":{"observed_at":"2026-07-31T12:43:18.895869Z","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-31T12:43:18.901154Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.24518","last_updated":"2026-07-27T14:56:00Z","snapshot_observed_at":"2026-07-31T12:43:16.648011Z","submitted_at":"2026-07-27T14:56:00Z","title":"Low-Rank Dependence Decomposition via Accelerated Symmetric Non-negative Matrix Factorization","version":1},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-07-31T12:43:18.901154Z"},"links":{"citing_paper":"/paper/2607.24518"},"observation_digest":"sha256:e2f04f4c9e2da8bfb45647cc1f47f4e292cadb52b330cf280a558ae0bc597d86","observation_id":"eaa01770-ec63-48bb-ac5d-9e226832c7b9","resolution":{"observed_at":"2026-07-31T12:43:18.901154Z","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-31T12:43:18.906537Z","title":"Variants of RMSProp and Adagrad with logarithmic regret bounds","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.24518","last_updated":"2026-07-27T14:56:00Z","snapshot_observed_at":"2026-07-31T12:43:16.648011Z","submitted_at":"2026-07-27T14:56:00Z","title":"Low-Rank Dependence Decomposition via Accelerated Symmetric Non-negative Matrix Factorization","version":1},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-07-31T12:43:18.906537Z"},"links":{"citing_paper":"/paper/2607.24518"},"observation_digest":"sha256:2eab47168b0885cd9c1e3132ca72c05e2d895cc39a5e675f5a8c349be8018371","observation_id":"50dcb98c-879c-4c7a-a0cb-459550ff3855","resolution":{"observed_at":"2026-07-31T12:43:18.906537Z","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-31T12:43:18.911133Z","title":"Disentangling adaptive gradient methods from learning rates","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.24518","last_updated":"2026-07-27T14:56:00Z","snapshot_observed_at":"2026-07-31T12:43:16.648011Z","submitted_at":"2026-07-27T14:56:00Z","title":"Low-Rank Dependence Decomposition via Accelerated Symmetric Non-negative Matrix Factorization","version":1},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-07-31T12:43:18.911133Z"},"links":{"citing_paper":"/paper/2607.24518"},"observation_digest":"sha256:58043a564e86ec3a95d23b719a6acde425d26c60af580d561e75e54d46b9d63c","observation_id":"ecd50201-3b19-41a7-932d-9291d401632a","resolution":{"observed_at":"2026-07-31T12:43:18.911133Z","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-31T12:43:18.916114Z","title":"AdagradDecay optimizer.https://deeprec.readthedocs.io/en/latest/ AdagradDecay-Optimizer.html, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.24518","last_updated":"2026-07-27T14:56:00Z","snapshot_observed_at":"2026-07-31T12:43:16.648011Z","submitted_at":"2026-07-27T14:56:00Z","title":"Low-Rank Dependence Decomposition via Accelerated Symmetric Non-negative Matrix Factorization","version":1},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-07-31T12:43:18.916114Z"},"links":{"citing_paper":"/paper/2607.24518"},"observation_digest":"sha256:8524bbfdb26de83b0bf73dcf7995b08c33a59698b42e46d862c57e3f137e06ff","observation_id":"eca0fd87-7809-4d70-bb45-dd34023f59b6","resolution":{"observed_at":"2026-07-31T12:43:18.916114Z","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-31T12:43:18.921378Z","title":"SGDR: Stochastic gradient descent with warm restarts","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.24518","last_updated":"2026-07-27T14:56:00Z","snapshot_observed_at":"2026-07-31T12:43:16.648011Z","submitted_at":"2026-07-27T14:56:00Z","title":"Low-Rank Dependence Decomposition via Accelerated Symmetric Non-negative Matrix Factorization","version":1},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-07-31T12:43:18.921378Z"},"links":{"citing_paper":"/paper/2607.24518"},"observation_digest":"sha256:bc9ac27cda62efff551b6214e935d10eebf59873590e6d6012fcd971bfdc1d07","observation_id":"3d44397e-b67f-4f89-9980-66f81dcd1d3d","resolution":{"observed_at":"2026-07-31T12:43:18.921378Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2206.06900","last_updated":"2022-06-14T14:55:27Z","snapshot_observed_at":"2026-07-06T13:20:44.327329Z","submitted_at":"2022-06-14T14:55:27Z","title":"Grad-GradaGrad? A Non-Monotone Adaptive Stochastic Gradient Method","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2206.06900","snapshot_observed_at":"2026-07-31T12:43:18.926063Z","title":"Grad-gradagrad? a non-monotone adaptive stochastic gradient method.arXiv preprint arXiv:2206.06900, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.24518","last_updated":"2026-07-27T14:56:00Z","snapshot_observed_at":"2026-07-31T12:43:16.648011Z","submitted_at":"2026-07-27T14:56:00Z","title":"Low-Rank Dependence Decomposition via Accelerated Symmetric Non-negative Matrix Factorization","version":1},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-07-31T12:43:18.926063Z"},"links":{"cited_paper":"/paper/2206.06900","citing_paper":"/paper/2607.24518"},"observation_digest":"sha256:4ac461ad935f039009e227d03b4fe37e634f18e6fb4ef73d4c8840c7bc7f500d","observation_id":"7dedc14d-c674-4b13-80ad-5cfc5eb052a7","resolution":{"observed_at":"2026-07-31T12:43:18.926063Z","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-31T12:43:18.931758Z","title":"Shampoo: Preconditioned stochastic tensor optimization","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.24518","last_updated":"2026-07-27T14:56:00Z","snapshot_observed_at":"2026-07-31T12:43:16.648011Z","submitted_at":"2026-07-27T14:56:00Z","title":"Low-Rank Dependence Decomposition via Accelerated Symmetric Non-negative Matrix Factorization","version":1},"reference_index":70,"source":"pdf_text","source_observed_at":"2026-07-31T12:43:18.931758Z"},"links":{"citing_paper":"/paper/2607.24518"},"observation_digest":"sha256:3776c111dbadafebdc8c3da33779864e2fa89c987c78ddb9c350875269ec1299","observation_id":"ff441907-3097-4bc2-ad4b-d1e841e33c41","resolution":{"observed_at":"2026-07-31T12:43:18.931758Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.24518","last_updated":"2026-07-27T14:56:00Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-31T12:43:16.648011Z","submitted_at":"2026-07-27T14:56:00Z","title":"Low-Rank Dependence Decomposition via Accelerated Symmetric Non-negative Matrix Factorization"},"reference_resolution":{"displayed":70,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":70,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":70},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 70 of 70 outbound references and 0 inbound Pith citation observations for arXiv:2607.24518."}