{"as_of":"2026-08-18T23:45:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:93215be70540a9f74f68a7ee0a56adad0053390857313b64981e56b40386e34e","coverage":[{"denominator":58,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":58,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-24T09:22:50.626565Z","state":"measured"},{"denominator":59,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":59,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-18T06:34:40.430872+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T20:48:39.671885Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-15T20:48:39.810179Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2304.03641","last_updated":"2026-05-14T16:19:47Z","snapshot_observed_at":"2026-08-03T06:28:58.768766Z","submitted_at":"2023-04-07T13:44:59Z","title":"A Block Coordinate Descent Method for Nonsmooth Composite Optimization under Orthogonality Constraints","version":4},"cited_work":{"arxiv_id":"2304.03641","doi":null,"metadata_source":"pith","pith_arxiv_id":"2304.03641","snapshot_observed_at":"2026-08-15T20:48:39.810179Z","title":"A Block Coordinate Descent Method for Nonsmooth Composite Optimization under Orthogonality Constraints","venue":"math.OC","work_id":"2739f9de-0dac-4b4f-b2a9-ef7d477e9f0e","year":2023},"citing_paper":{"arxiv_id":"2505.12378","last_updated":"2025-05-18T11:46:44Z","snapshot_observed_at":"2026-08-17T12:23:08.499273Z","submitted_at":"2025-05-18T11:46:44Z","title":"Efficient Optimization with Orthogonality Constraint: a Randomized Riemannian Submanifold Method","version":1},"reference_index":75,"source":"arxiv_source","source_observed_at":"2026-08-15T20:48:39.671885Z"},"links":{"cited_paper":"/paper/2304.03641","citing_paper":"/paper/2505.12378"},"observation_digest":"sha256:99ee43a661693c56059110910dc200c57517ad5db47863a5a0c4366164572509","observation_id":"197159c0-56bf-490f-9236-3eb63e790f21","resolution":{"observed_at":"2026-08-15T20:48:39.813717Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2304.03641/citation-record","integrity":"/paper/2304.03641/integrity","json":"/paper/2304.03641/citation-record.json","paper":"/paper/2304.03641"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Advances in Neural Information Processing Systems (NeurIPS), 26","venue":null,"work_id":"3bd160c2-222f-4313-9ab8-01c5f683e7c0","year":2013},"citing_paper":{"arxiv_id":"2304.03641","last_updated":"2026-05-14T16:19:47Z","snapshot_observed_at":"2026-08-03T06:28:58.768766Z","submitted_at":"2023-04-07T13:44:59Z","title":"A Block Coordinate Descent Method for Nonsmooth Composite Optimization under Orthogonality Constraints","version":4},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-05-24T09:22:50.626565Z"},"links":{"citing_paper":"/paper/2304.03641"},"observation_digest":"sha256:bf6c2ba9c6f19e96eb1ddb8fe2fdda31f5eeda446d1ea3fd503ea4cbbd9202b6","observation_id":"9a5ec8ef-83dc-4966-a4f1-97fae535fef6","resolution":{"observed_at":"2026-05-24T09:24:17.977730Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"E., Eriksson, J., and Koivunen, V","venue":null,"work_id":"3d8f18f6-39e1-4181-b407-b815eafa5dba","year":2008},"citing_paper":{"arxiv_id":"2304.03641","last_updated":"2026-05-14T16:19:47Z","snapshot_observed_at":"2026-08-03T06:28:58.768766Z","submitted_at":"2023-04-07T13:44:59Z","title":"A Block Coordinate Descent Method for Nonsmooth Composite Optimization under Orthogonality Constraints","version":4},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-05-24T09:22:50.626565Z"},"links":{"citing_paper":"/paper/2304.03641"},"observation_digest":"sha256:95e44801c7e1f4b3e5316a06a6444b69c0200cb4ebcd26c35f688f215001e297","observation_id":"9da464a0-1ee9-4045-a9bf-333069c5b0a2","resolution":{"observed_at":"2026-05-24T09:24:18.080901Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"E., and Sepulchre, R","venue":null,"work_id":"05da43b7-b6c4-4cd1-91eb-73999263c97e","year":2008},"citing_paper":{"arxiv_id":"2304.03641","last_updated":"2026-05-14T16:19:47Z","snapshot_observed_at":"2026-08-03T06:28:58.768766Z","submitted_at":"2023-04-07T13:44:59Z","title":"A Block Coordinate Descent Method for Nonsmooth Composite Optimization under Orthogonality Constraints","version":4},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-05-24T09:22:50.626565Z"},"links":{"citing_paper":"/paper/2304.03641"},"observation_digest":"sha256:5655683e7c1dccb1b253cb6f667ae079259f5c7479358540d5667451af114f3c","observation_id":"e4f0d068-9540-49de-8360-19fcee451b7d","resolution":{"observed_at":"2026-05-24T09:24:18.087446Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Proximal alternating minimization and projection methods for nonconvex problems: An approach based on the kurdyka-lojasiewicz inequality","venue":null,"work_id":"c260359d-af83-49d3-a85e-c06be59c88e2","year":2010},"citing_paper":{"arxiv_id":"2304.03641","last_updated":"2026-05-14T16:19:47Z","snapshot_observed_at":"2026-08-03T06:28:58.768766Z","submitted_at":"2023-04-07T13:44:59Z","title":"A Block Coordinate Descent Method for Nonsmooth Composite Optimization under Orthogonality Constraints","version":4},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-05-24T09:22:50.626565Z"},"links":{"citing_paper":"/paper/2304.03641"},"observation_digest":"sha256:b8a8375082b00108001c5c78cb2263b1a33a34c7fa3eb2a340b1ee2d95257f76","observation_id":"8d4c4b7c-f3db-484e-a607-1b9795576054","resolution":{"observed_at":"2026-05-24T09:24:18.091031Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Deep layers as stochastic solvers","venue":null,"work_id":"655ef2c7-d7d6-4ecc-b5ef-01bf0b5eece4","year":2019},"citing_paper":{"arxiv_id":"2304.03641","last_updated":"2026-05-14T16:19:47Z","snapshot_observed_at":"2026-08-03T06:28:58.768766Z","submitted_at":"2023-04-07T13:44:59Z","title":"A Block Coordinate Descent Method for Nonsmooth Composite Optimization under Orthogonality Constraints","version":4},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-05-24T09:22:50.626565Z"},"links":{"citing_paper":"/paper/2304.03641"},"observation_digest":"sha256:cda21053cb10b0b004818f1aa158fd1a3ea3634677b78383a86d390c32edb8da","observation_id":"e2cb8248-43b5-4767-bdee-59a4003239c4","resolution":{"observed_at":"2026-05-24T09:24:18.073048Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Proximal alternating linearized minimization for nonconvex and nonsmooth problems","venue":null,"work_id":"fa320ab4-5b62-4e24-962d-599eb3e4cbf8","year":2014},"citing_paper":{"arxiv_id":"2304.03641","last_updated":"2026-05-14T16:19:47Z","snapshot_observed_at":"2026-08-03T06:28:58.768766Z","submitted_at":"2023-04-07T13:44:59Z","title":"A Block Coordinate Descent Method for Nonsmooth Composite Optimization under Orthogonality Constraints","version":4},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-05-24T09:22:50.626565Z"},"links":{"citing_paper":"/paper/2304.03641"},"observation_digest":"sha256:70abed3ff1c6a2677f0f23678c148886c33413772ee75ad8cbc3fa5f789e0252","observation_id":"ba628516-930d-4572-a314-6f26702d2f8b","resolution":{"observed_at":"2026-05-24T09:24:17.974056Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"and Absil, P.-a","venue":null,"work_id":"33c5fc73-bf8e-4099-b6a9-74173bf10a42","year":2011},"citing_paper":{"arxiv_id":"2304.03641","last_updated":"2026-05-14T16:19:47Z","snapshot_observed_at":"2026-08-03T06:28:58.768766Z","submitted_at":"2023-04-07T13:44:59Z","title":"A Block Coordinate Descent Method for Nonsmooth Composite Optimization under Orthogonality Constraints","version":4},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-05-24T09:22:50.626565Z"},"links":{"citing_paper":"/paper/2304.03641"},"observation_digest":"sha256:bba797f268d7372f0786651a22ed3066a6e9d6137c464ad2051f915ad766505c","observation_id":"28c76e1e-1897-4a52-a8d7-c8a616222bc8","resolution":{"observed_at":"2026-05-24T09:24:18.066287Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Proximal gradient method for nonsmooth optimization over the stiefel manifold","venue":null,"work_id":"36a8f445-b5b0-4c61-b2e3-2b35ceca466c","year":2020},"citing_paper":{"arxiv_id":"2304.03641","last_updated":"2026-05-14T16:19:47Z","snapshot_observed_at":"2026-08-03T06:28:58.768766Z","submitted_at":"2023-04-07T13:44:59Z","title":"A Block Coordinate Descent Method for Nonsmooth Composite Optimization under Orthogonality Constraints","version":4},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-05-24T09:22:50.626565Z"},"links":{"citing_paper":"/paper/2304.03641"},"observation_digest":"sha256:5fd746bff016ec4cc9ddb297183989428daf0b00380c3d670001f16d77648ce8","observation_id":"c1efabde-9156-4dda-a270-d2773b68bfb6","resolution":{"observed_at":"2026-05-24T09:24:17.963030Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"An augmented lagrangian method for _1 -regularized optimization problems with orthogonality constraints","venue":null,"work_id":"f727adcf-9fed-470a-899e-aeefccacf2b1","year":2016},"citing_paper":{"arxiv_id":"2304.03641","last_updated":"2026-05-14T16:19:47Z","snapshot_observed_at":"2026-08-03T06:28:58.768766Z","submitted_at":"2023-04-07T13:44:59Z","title":"A Block Coordinate Descent Method for Nonsmooth Composite Optimization under Orthogonality Constraints","version":4},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-05-24T09:22:50.626565Z"},"links":{"citing_paper":"/paper/2304.03641"},"observation_digest":"sha256:63c04a52f771cf4c3f50a7c4174594c2c7a933e264e80c17f1204d2f9756e7e9","observation_id":"91f12b23-03f4-4016-a653-09242f2a95e4","resolution":{"observed_at":"2026-05-24T09:24:18.058974Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Optimal solutions for sparse principal component analysis","venue":null,"work_id":"005b3f3e-c5a8-4eb3-90d7-e287ed77430a","year":2008},"citing_paper":{"arxiv_id":"2304.03641","last_updated":"2026-05-14T16:19:47Z","snapshot_observed_at":"2026-08-03T06:28:58.768766Z","submitted_at":"2023-04-07T13:44:59Z","title":"A Block Coordinate Descent Method for Nonsmooth Composite Optimization under Orthogonality Constraints","version":4},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-05-24T09:22:50.626565Z"},"links":{"citing_paper":"/paper/2304.03641"},"observation_digest":"sha256:a93e7ab2557a1215b7e40496fc98b1ef2a5924047f31d01348408b68a6de9f3b","observation_id":"d2ec7ca8-6849-41ef-8f4d-430c72ba926e","resolution":{"observed_at":"2026-05-24T09:24:17.957083Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"A., and Smith, S","venue":null,"work_id":"fc79b922-f5be-4f43-b443-6b4f3fbc5149","year":1998},"citing_paper":{"arxiv_id":"2304.03641","last_updated":"2026-05-14T16:19:47Z","snapshot_observed_at":"2026-08-03T06:28:58.768766Z","submitted_at":"2023-04-07T13:44:59Z","title":"A Block Coordinate Descent Method for Nonsmooth Composite Optimization under Orthogonality Constraints","version":4},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-05-24T09:22:50.626565Z"},"links":{"citing_paper":"/paper/2304.03641"},"observation_digest":"sha256:9aef5dd8ddf2842e848f1739630d1b95f7fbe49bfb12e337e15df665d72aa933","observation_id":"579c7786-5dee-4983-8732-7dfb15791196","resolution":{"observed_at":"2026-05-24T09:24:17.959921Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"and Bruna, J","venue":null,"work_id":"24800855-f086-411f-9818-3cc7bc64b484","year":1993},"citing_paper":{"arxiv_id":"2304.03641","last_updated":"2026-05-14T16:19:47Z","snapshot_observed_at":"2026-08-03T06:28:58.768766Z","submitted_at":"2023-04-07T13:44:59Z","title":"A Block Coordinate Descent Method for Nonsmooth Composite Optimization under Orthogonality Constraints","version":4},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-05-24T09:22:50.626565Z"},"links":{"citing_paper":"/paper/2304.03641"},"observation_digest":"sha256:794a8bfb984113476326da77f2fb9264592c8156b321b587db8c6c4d98a94485","observation_id":"0fe3a15a-b4ac-47e3-b0c1-291d154b3cac","resolution":{"observed_at":"2026-05-24T09:24:18.055615Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"A new first-order algorithmic framework for optimization problems with orthogonality constraints","venue":null,"work_id":"e6570820-8801-47a4-9af1-a8792b375699","year":2018},"citing_paper":{"arxiv_id":"2304.03641","last_updated":"2026-05-14T16:19:47Z","snapshot_observed_at":"2026-08-03T06:28:58.768766Z","submitted_at":"2023-04-07T13:44:59Z","title":"A Block Coordinate Descent Method for Nonsmooth Composite Optimization under Orthogonality Constraints","version":4},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-05-24T09:22:50.626565Z"},"links":{"citing_paper":"/paper/2304.03641"},"observation_digest":"sha256:2cc1586ffbb52330f4e5875c42e807716b79edb0a825f1dcca884ca658e52ad3","observation_id":"56ebd5a3-3b1c-4ec1-af95-bdd47492aba6","resolution":{"observed_at":"2026-05-24T09:24:18.062800Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Parallelizable algorithms for optimization problems with orthogonality constraints","venue":null,"work_id":"d4a70d30-be23-4ec1-8f45-051a7b770098","year":2019},"citing_paper":{"arxiv_id":"2304.03641","last_updated":"2026-05-14T16:19:47Z","snapshot_observed_at":"2026-08-03T06:28:58.768766Z","submitted_at":"2023-04-07T13:44:59Z","title":"A Block Coordinate Descent Method for Nonsmooth Composite Optimization under Orthogonality Constraints","version":4},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-05-24T09:22:50.626565Z"},"links":{"citing_paper":"/paper/2304.03641"},"observation_digest":"sha256:00979f1f6e9cd8eacd3e0d9154215fa3bd01cd8f64da48c4aafc112981a17d1c","observation_id":"2bf70705-6aa1-4616-ad8f-c03f0e37bfdc","resolution":{"observed_at":"2026-05-24T09:24:18.069831Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"f515887d-a6c7-47fb-8574-f90b63383bb0","year":2013},"citing_paper":{"arxiv_id":"2304.03641","last_updated":"2026-05-14T16:19:47Z","snapshot_observed_at":"2026-08-03T06:28:58.768766Z","submitted_at":"2023-04-07T13:44:59Z","title":"A Block Coordinate Descent Method for Nonsmooth Composite Optimization under Orthogonality Constraints","version":4},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-05-24T09:22:50.626565Z"},"links":{"citing_paper":"/paper/2304.03641"},"observation_digest":"sha256:a4eb373374b7d3a766e9b33669466c1ecdfeb08d06019434b64eed7366ae5f51","observation_id":"157e9c91-51b9-4f1d-9c81-44a07fd4fc76","resolution":{"observed_at":"2026-05-24T09:24:18.093828Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"and Yuan, X","venue":null,"work_id":"5b8b3a46-456a-4339-b155-7d0d4e8898e5","year":2012},"citing_paper":{"arxiv_id":"2304.03641","last_updated":"2026-05-14T16:19:47Z","snapshot_observed_at":"2026-08-03T06:28:58.768766Z","submitted_at":"2023-04-07T13:44:59Z","title":"A Block Coordinate Descent Method for Nonsmooth Composite Optimization under Orthogonality Constraints","version":4},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-05-24T09:22:50.626565Z"},"links":{"citing_paper":"/paper/2304.03641"},"observation_digest":"sha256:902b9beeee49e83d81a846f2cfc65c4522ef5b063866870a86ac92f762e9f458","observation_id":"0a73f5ce-48bf-471c-970a-295ee9b4c211","resolution":{"observed_at":"2026-05-24T09:24:17.970246Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Adaptive quadratically regularized newton method for riemannian optimization","venue":null,"work_id":"efbc16b2-1658-4599-967e-0905e0fa3ac1","year":2018},"citing_paper":{"arxiv_id":"2304.03641","last_updated":"2026-05-14T16:19:47Z","snapshot_observed_at":"2026-08-03T06:28:58.768766Z","submitted_at":"2023-04-07T13:44:59Z","title":"A Block Coordinate Descent Method for Nonsmooth Composite Optimization under Orthogonality Constraints","version":4},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-05-24T09:22:50.626565Z"},"links":{"citing_paper":"/paper/2304.03641"},"observation_digest":"sha256:803271ca4d87e037298ec9bf46e672aa812ad34340dfa239ea45298559b15d37","observation_id":"55a6cfcc-fea5-4fde-b82a-da0edc579c3a","resolution":{"observed_at":"2026-05-24T09:24:17.966541Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Structured quasi-newton methods for optimization with orthogonality constraints","venue":null,"work_id":"f4fdbabe-e659-4e6c-926e-98c1db263817","year":2019},"citing_paper":{"arxiv_id":"2304.03641","last_updated":"2026-05-14T16:19:47Z","snapshot_observed_at":"2026-08-03T06:28:58.768766Z","submitted_at":"2023-04-07T13:44:59Z","title":"A Block Coordinate Descent Method for Nonsmooth Composite Optimization under Orthogonality Constraints","version":4},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-05-24T09:22:50.626565Z"},"links":{"citing_paper":"/paper/2304.03641"},"observation_digest":"sha256:10b1c0dda4fba95905c3ca6cc0208cf959f20457b9ebfa6c667fe6611ad36202","observation_id":"452373aa-e692-459b-bc58-270b2076a229","resolution":{"observed_at":"2026-05-24T09:24:18.046595Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"A brief introduction to manifold optimization","venue":null,"work_id":"fe08acad-31e9-4f42-bd5f-825388654224","year":2020},"citing_paper":{"arxiv_id":"2304.03641","last_updated":"2026-05-14T16:19:47Z","snapshot_observed_at":"2026-08-03T06:28:58.768766Z","submitted_at":"2023-04-07T13:44:59Z","title":"A Block Coordinate Descent Method for Nonsmooth Composite Optimization under Orthogonality Constraints","version":4},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-05-24T09:22:50.626565Z"},"links":{"citing_paper":"/paper/2304.03641"},"observation_digest":"sha256:1fbb051262421e6391421b23987dc34f88e680b49edbfe9d4d7ff63c14201196","observation_id":"a3724bbe-6149-48fa-8883-2e047006a259","resolution":{"observed_at":"2026-05-24T09:24:17.930052Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"J., Collins, M","venue":null,"work_id":"d61e647f-7dfa-43a5-b8e6-701c0508e74b","year":2015},"citing_paper":{"arxiv_id":"2304.03641","last_updated":"2026-05-14T16:19:47Z","snapshot_observed_at":"2026-08-03T06:28:58.768766Z","submitted_at":"2023-04-07T13:44:59Z","title":"A Block Coordinate Descent Method for Nonsmooth Composite Optimization under Orthogonality Constraints","version":4},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-05-24T09:22:50.626565Z"},"links":{"citing_paper":"/paper/2304.03641"},"observation_digest":"sha256:db67b1af4c59ac6008ef33ee7eb464d969e489832010089f580f223b21690ae6","observation_id":"b7b48807-cc22-4f15-9189-f1b0d07cdeb5","resolution":{"observed_at":"2026-05-24T09:24:18.033275Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"and Dai, Y.-H","venue":null,"work_id":"68ac6761-e913-4247-b44b-4089f58e85ab","year":2015},"citing_paper":{"arxiv_id":"2304.03641","last_updated":"2026-05-14T16:19:47Z","snapshot_observed_at":"2026-08-03T06:28:58.768766Z","submitted_at":"2023-04-07T13:44:59Z","title":"A Block Coordinate Descent Method for Nonsmooth Composite Optimization under Orthogonality Constraints","version":4},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-05-24T09:22:50.626565Z"},"links":{"citing_paper":"/paper/2304.03641"},"observation_digest":"sha256:21a73514d7034784b0472552985de61a3299b77f713127e23e6d7abb838461ab","observation_id":"ca430a49-5218-4286-86b8-301f8ff95bab","resolution":{"observed_at":"2026-05-24T09:24:18.096960Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"_p -norm regularization algorithms for optimization over permutation matrices","venue":null,"work_id":"5ea8ab58-a2a6-4a09-a348-faa3bf1ec791","year":2016},"citing_paper":{"arxiv_id":"2304.03641","last_updated":"2026-05-14T16:19:47Z","snapshot_observed_at":"2026-08-03T06:28:58.768766Z","submitted_at":"2023-04-07T13:44:59Z","title":"A Block Coordinate Descent Method for Nonsmooth Composite Optimization under Orthogonality Constraints","version":4},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-05-24T09:22:50.626565Z"},"links":{"citing_paper":"/paper/2304.03641"},"observation_digest":"sha256:be928d32c8f52589737f205bde6a11210fdb1d4201a9bddad382c71f31b61c03","observation_id":"4ba23d5b-eaa4-411a-b9cf-4197338ac478","resolution":{"observed_at":"2026-05-24T09:24:17.905222Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"An exact penalty approach for optimization with nonnegative orthogonality constraints","venue":null,"work_id":"cbf8fb9d-aac8-491f-a0a3-5f8247dce7c6","year":2022},"citing_paper":{"arxiv_id":"2304.03641","last_updated":"2026-05-14T16:19:47Z","snapshot_observed_at":"2026-08-03T06:28:58.768766Z","submitted_at":"2023-04-07T13:44:59Z","title":"A Block Coordinate Descent Method for Nonsmooth Composite Optimization under Orthogonality Constraints","version":4},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-05-24T09:22:50.626565Z"},"links":{"citing_paper":"/paper/2304.03641"},"observation_digest":"sha256:0e9f52be4922b7a0f96289bb2331b50ce26ac44f373128fccb82a74aa934388c","observation_id":"59b45972-fc6c-4819-8834-b3740eff9af8","resolution":{"observed_at":"2026-05-24T09:24:18.029905Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Generalized power method for sparse principal component analysis","venue":null,"work_id":"23adce26-43e2-491a-aae9-17718259ef0d","year":2010},"citing_paper":{"arxiv_id":"2304.03641","last_updated":"2026-05-14T16:19:47Z","snapshot_observed_at":"2026-08-03T06:28:58.768766Z","submitted_at":"2023-04-07T13:44:59Z","title":"A Block Coordinate Descent Method for Nonsmooth Composite Optimization under Orthogonality Constraints","version":4},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-05-24T09:22:50.626565Z"},"links":{"citing_paper":"/paper/2304.03641"},"observation_digest":"sha256:b669adf0bcff4b70f494f2213bce005f2df12ae0828ebf08365158eb22836e6f","observation_id":"8ed1d188-bb4a-44c9-9b08-6932a1d4cf61","resolution":{"observed_at":"2026-05-24T09:24:18.036699Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"and Osher, S","venue":null,"work_id":"6a9d947c-127c-4380-b9b8-56f8cb0dc889","year":2014},"citing_paper":{"arxiv_id":"2304.03641","last_updated":"2026-05-14T16:19:47Z","snapshot_observed_at":"2026-08-03T06:28:58.768766Z","submitted_at":"2023-04-07T13:44:59Z","title":"A Block Coordinate Descent Method for Nonsmooth Composite Optimization under Orthogonality Constraints","version":4},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-05-24T09:22:50.626565Z"},"links":{"citing_paper":"/paper/2304.03641"},"observation_digest":"sha256:4799404cd5945005ef4e474df3f7fa544a3932da29529e690ca0c469950a1b90","observation_id":"ffa172f0-6f6b-4615-a888-e8ba84848c67","resolution":{"observed_at":"2026-05-24T09:24:18.043151Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Weakly convex optimization over stiefel manifold using riemannian subgradient-type methods","venue":null,"work_id":"80d3b85a-4c72-4ba9-af12-7aed01b5b26d","year":2021},"citing_paper":{"arxiv_id":"2304.03641","last_updated":"2026-05-14T16:19:47Z","snapshot_observed_at":"2026-08-03T06:28:58.768766Z","submitted_at":"2023-04-07T13:44:59Z","title":"A Block Coordinate Descent Method for Nonsmooth Composite Optimization under Orthogonality Constraints","version":4},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-05-24T09:22:50.626565Z"},"links":{"citing_paper":"/paper/2304.03641"},"observation_digest":"sha256:1bd0d339c225523953ab0b3538896aaf6074ec88bb6a390a9026f3365e147e15","observation_id":"27273f7a-e8ba-4642-b233-5cbf1a07b35c","resolution":{"observed_at":"2026-05-24T09:24:18.026162Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"b1df331c-1e21-4102-a604-4716eb9f1df2","year":2016},"citing_paper":{"arxiv_id":"2304.03641","last_updated":"2026-05-14T16:19:47Z","snapshot_observed_at":"2026-08-03T06:28:58.768766Z","submitted_at":"2023-04-07T13:44:59Z","title":"A Block Coordinate Descent Method for Nonsmooth Composite Optimization under Orthogonality Constraints","version":4},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-05-24T09:22:50.626565Z"},"links":{"citing_paper":"/paper/2304.03641"},"observation_digest":"sha256:f4ad564b3da3b96db4ba1e5799a77fe1417b453583ff61f27dfa079ee7745925","observation_id":"9e8239ce-4288-4e01-94fa-56cc4aa06586","resolution":{"observed_at":"2026-05-24T09:24:17.926786Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"On the estimation performance and convergence rate of the generalized power method for phase synchronization","venue":null,"work_id":"c7bea241-a648-47b1-8c4b-9e5958070479","year":2017},"citing_paper":{"arxiv_id":"2304.03641","last_updated":"2026-05-14T16:19:47Z","snapshot_observed_at":"2026-08-03T06:28:58.768766Z","submitted_at":"2023-04-07T13:44:59Z","title":"A Block Coordinate Descent Method for Nonsmooth Composite Optimization under Orthogonality Constraints","version":4},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-05-24T09:22:50.626565Z"},"links":{"citing_paper":"/paper/2304.03641"},"observation_digest":"sha256:53b4605f781f3fac28ffbb0676ff036f018f3eeaf9cc5bf1ef1d58a46fa9d43c","observation_id":"0ae277aa-e81b-4548-bb8a-405ebac7ff25","resolution":{"observed_at":"2026-05-24T09:24:18.015741Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"A class of smooth exact penalty function methods for optimization problems with orthogonality constraints","venue":null,"work_id":"568813f5-1d8f-4a60-985b-1bb37a2d7582","year":2020},"citing_paper":{"arxiv_id":"2304.03641","last_updated":"2026-05-14T16:19:47Z","snapshot_observed_at":"2026-08-03T06:28:58.768766Z","submitted_at":"2023-04-07T13:44:59Z","title":"A Block Coordinate Descent Method for Nonsmooth Composite Optimization under Orthogonality Constraints","version":4},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-05-24T09:22:50.626565Z"},"links":{"citing_paper":"/paper/2304.03641"},"observation_digest":"sha256:3e1462cc311663b2f99d964c8b66d9ee7fb5329be72059396035ad39605efbbc","observation_id":"76952775-82fb-493b-a4c2-0c6b48fda9e5","resolution":{"observed_at":"2026-05-24T09:24:17.940645Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"On the convergence of the self-consistent field iteration in kohn--sham density functional theory","venue":null,"work_id":"7f852d09-b6c0-4471-9d13-99dc53aa1c03","year":2014},"citing_paper":{"arxiv_id":"2304.03641","last_updated":"2026-05-14T16:19:47Z","snapshot_observed_at":"2026-08-03T06:28:58.768766Z","submitted_at":"2023-04-07T13:44:59Z","title":"A Block Coordinate Descent Method for Nonsmooth Composite Optimization under Orthogonality Constraints","version":4},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-05-24T09:22:50.626565Z"},"links":{"citing_paper":"/paper/2304.03641"},"observation_digest":"sha256:229b25966867e5ec20b4a877438369e73147efa38eb69e7d3e8d41a6d5fbbbca","observation_id":"cdf5d5af-aef1-4a01-a9e3-e59684eb326b","resolution":{"observed_at":"2026-05-24T09:24:17.933717Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"An efficient gauss--newton algorithm for symmetric low-rank product matrix approximations","venue":null,"work_id":"e8aa3fb4-169c-49f9-a4aa-a501af140e15","year":2015},"citing_paper":{"arxiv_id":"2304.03641","last_updated":"2026-05-14T16:19:47Z","snapshot_observed_at":"2026-08-03T06:28:58.768766Z","submitted_at":"2023-04-07T13:44:59Z","title":"A Block Coordinate Descent Method for Nonsmooth Composite Optimization under Orthogonality Constraints","version":4},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-05-24T09:22:50.626565Z"},"links":{"citing_paper":"/paper/2304.03641"},"observation_digest":"sha256:0780556822cbe8771f48808385a149919064f7e8dd83f95c25750f29dbc6c372","observation_id":"c13a3c18-8933-45f9-a14c-079755e5170a","resolution":{"observed_at":"2026-05-24T09:24:18.012161Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"and Zhang, Y","venue":null,"work_id":"88d0ab7b-8e68-48cb-b02c-e7a1a12cc68f","year":2012},"citing_paper":{"arxiv_id":"2304.03641","last_updated":"2026-05-14T16:19:47Z","snapshot_observed_at":"2026-08-03T06:28:58.768766Z","submitted_at":"2023-04-07T13:44:59Z","title":"A Block Coordinate Descent Method for Nonsmooth Composite Optimization under Orthogonality Constraints","version":4},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-05-24T09:22:50.626565Z"},"links":{"citing_paper":"/paper/2304.03641"},"observation_digest":"sha256:06991e3dcd2c04cee5d55121487748b0777c0df1c209859504aa5d82604a80a9","observation_id":"379bcce5-a6ef-4abc-9f8b-a6d1086a4281","resolution":{"observed_at":"2026-05-24T09:24:18.018790Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Optimization with first-order surrogate functions","venue":null,"work_id":"5973ddc5-7cba-41db-bf99-58d5d01f0429","year":2013},"citing_paper":{"arxiv_id":"2304.03641","last_updated":"2026-05-14T16:19:47Z","snapshot_observed_at":"2026-08-03T06:28:58.768766Z","submitted_at":"2023-04-07T13:44:59Z","title":"A Block Coordinate Descent Method for Nonsmooth Composite Optimization under Orthogonality Constraints","version":4},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-05-24T09:22:50.626565Z"},"links":{"citing_paper":"/paper/2304.03641"},"observation_digest":"sha256:10010c85049bbcb52397c597156657b17eaf2ab1f714c55b87a561f0339204cd","observation_id":"9f69962b-bb50-4e92-8953-f0c44d7f85f2","resolution":{"observed_at":"2026-05-24T09:24:18.022420Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"and Abrol, V","venue":null,"work_id":"a7d3ad5d-dfb3-442f-9c27-ea710eb90c3f","year":2022},"citing_paper":{"arxiv_id":"2304.03641","last_updated":"2026-05-14T16:19:47Z","snapshot_observed_at":"2026-08-03T06:28:58.768766Z","submitted_at":"2023-04-07T13:44:59Z","title":"A Block Coordinate Descent Method for Nonsmooth Composite Optimization under Orthogonality Constraints","version":4},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-05-24T09:22:50.626565Z"},"links":{"citing_paper":"/paper/2304.03641"},"observation_digest":"sha256:62f8eff43859adc4e60da006aebcc4cd027cba38de21b429fce77aabdca66381","observation_id":"3ea02b89-7690-4ca0-9e45-77411e76d346","resolution":{"observed_at":"2026-05-24T09:24:18.049527Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"f8cd7a8a-01cc-41eb-a11c-396b9cab1a9e","year":2006},"citing_paper":{"arxiv_id":"2304.03641","last_updated":"2026-05-14T16:19:47Z","snapshot_observed_at":"2026-08-03T06:28:58.768766Z","submitted_at":"2023-04-07T13:44:59Z","title":"A Block Coordinate Descent Method for Nonsmooth Composite Optimization under Orthogonality Constraints","version":4},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-05-24T09:22:50.626565Z"},"links":{"citing_paper":"/paper/2304.03641"},"observation_digest":"sha256:4fa4c298e23c98066c38aee77a4a7fde8e6e42274f5bb5e6ce02126a816cb983","observation_id":"2cb11013-3e4e-4e6f-bf78-d60297258bf6","resolution":{"observed_at":"2026-05-24T09:24:18.077170Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Coordinate descent method for k-means","venue":null,"work_id":"75577146-aa8a-4cd2-968b-b7ba9380087e","year":2022},"citing_paper":{"arxiv_id":"2304.03641","last_updated":"2026-05-14T16:19:47Z","snapshot_observed_at":"2026-08-03T06:28:58.768766Z","submitted_at":"2023-04-07T13:44:59Z","title":"A Block Coordinate Descent Method for Nonsmooth Composite Optimization under Orthogonality Constraints","version":4},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-05-24T09:22:50.626565Z"},"links":{"citing_paper":"/paper/2304.03641"},"observation_digest":"sha256:ecc2ca2945c1f430d6d4dd4aa65424cb77e5d25d2eff87ed3e95438f5afab3dc","observation_id":"22c4626b-b6ea-4623-ae4c-cc5c09174b2c","resolution":{"observed_at":"2026-05-24T09:24:18.039922Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Exact penalty methods for minimizing a smooth function over the nonnegative orthogonal set","venue":null,"work_id":"e5b9d493-48dd-437e-9f6d-eb11b5ef929d","year":2021},"citing_paper":{"arxiv_id":"2304.03641","last_updated":"2026-05-14T16:19:47Z","snapshot_observed_at":"2026-08-03T06:28:58.768766Z","submitted_at":"2023-04-07T13:44:59Z","title":"A Block Coordinate Descent Method for Nonsmooth Composite Optimization under Orthogonality Constraints","version":4},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-05-24T09:22:50.626565Z"},"links":{"citing_paper":"/paper/2304.03641"},"observation_digest":"sha256:f59473066d7534d18860839a63e075416ecd4746528ede0b5ca2bfa97b640e56","observation_id":"48e3393e-902c-449b-8831-9d7b7d434391","resolution":{"observed_at":"2026-05-24T09:24:17.953931Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"A unified convergence analysis of block successive minimization methods for nonsmooth optimization","venue":null,"work_id":"1064cd1f-8a0e-4bd4-8af1-8e1940331733","year":2013},"citing_paper":{"arxiv_id":"2304.03641","last_updated":"2026-05-14T16:19:47Z","snapshot_observed_at":"2026-08-03T06:28:58.768766Z","submitted_at":"2023-04-07T13:44:59Z","title":"A Block Coordinate Descent Method for Nonsmooth Composite Optimization under Orthogonality Constraints","version":4},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-05-24T09:22:50.626565Z"},"links":{"citing_paper":"/paper/2304.03641"},"observation_digest":"sha256:6b3a868a2d5a4ba025904b7d09811df208a55bab5bc1027ca0d5bd41d696c233","observation_id":"58d95204-1d4b-45c6-925c-f96cc2a57328","resolution":{"observed_at":"2026-05-24T09:24:17.901656Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"808fdac6-c86f-489f-b09d-e164d982c162","year":2009},"citing_paper":{"arxiv_id":"2304.03641","last_updated":"2026-05-14T16:19:47Z","snapshot_observed_at":"2026-08-03T06:28:58.768766Z","submitted_at":"2023-04-07T13:44:59Z","title":"A Block Coordinate Descent Method for Nonsmooth Composite Optimization under Orthogonality Constraints","version":4},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-05-24T09:22:50.626565Z"},"links":{"citing_paper":"/paper/2304.03641"},"observation_digest":"sha256:540cdde5c21209d0f4c5aae32bfccd36994285e4e829c834901b6044a9d5146a","observation_id":"14df955d-79c5-4e76-b2f0-b5a9db9978b1","resolution":{"observed_at":"2026-05-24T09:24:17.937012Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"and Chechik, G","venue":null,"work_id":"519856da-ce9c-4d29-8966-cce44c714e84","year":2014},"citing_paper":{"arxiv_id":"2304.03641","last_updated":"2026-05-14T16:19:47Z","snapshot_observed_at":"2026-08-03T06:28:58.768766Z","submitted_at":"2023-04-07T13:44:59Z","title":"A Block Coordinate Descent Method for Nonsmooth Composite Optimization under Orthogonality Constraints","version":4},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-05-24T09:22:50.626565Z"},"links":{"citing_paper":"/paper/2304.03641"},"observation_digest":"sha256:7548e5dbc61c087b6282e6247cc6aa522ed1c65937fc9b999f7eebebc77ab2ae","observation_id":"7e169c1a-3587-424b-a8c8-971a9d8ba779","resolution":{"observed_at":"2026-05-24T09:24:17.912623Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"and Bischof, C","venue":null,"work_id":"2486def4-d973-4844-8f7d-80b823f99a0a","year":1995},"citing_paper":{"arxiv_id":"2304.03641","last_updated":"2026-05-14T16:19:47Z","snapshot_observed_at":"2026-08-03T06:28:58.768766Z","submitted_at":"2023-04-07T13:44:59Z","title":"A Block Coordinate Descent Method for Nonsmooth Composite Optimization under Orthogonality Constraints","version":4},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-05-24T09:22:50.626565Z"},"links":{"citing_paper":"/paper/2304.03641"},"observation_digest":"sha256:4c654feca6aef064c95ad24fb4977c4b90278d98befabbbc297c2015bb8687ea","observation_id":"7ce4233e-d647-406c-82a6-1a91e578f84b","resolution":{"observed_at":"2026-05-24T09:24:17.909197Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"and Yun, S","venue":null,"work_id":"f25f8593-63ce-4a8e-b721-78030f75a804","year":2009},"citing_paper":{"arxiv_id":"2304.03641","last_updated":"2026-05-14T16:19:47Z","snapshot_observed_at":"2026-08-03T06:28:58.768766Z","submitted_at":"2023-04-07T13:44:59Z","title":"A Block Coordinate Descent Method for Nonsmooth Composite Optimization under Orthogonality Constraints","version":4},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-05-24T09:22:50.626565Z"},"links":{"citing_paper":"/paper/2304.03641"},"observation_digest":"sha256:58e13bb2323f7c2c5d6a1fec352bc274ca98140dcc485ec8dfbc34c63648f243","observation_id":"d7ee1a1d-e0ec-45f5-9282-96b6ca212b84","resolution":{"observed_at":"2026-05-24T09:24:17.923430Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Q., Cho, J., Lei, J., and Rohe, K","venue":null,"work_id":"4a721dd3-1948-47ce-a674-f0badff6c183","year":2013},"citing_paper":{"arxiv_id":"2304.03641","last_updated":"2026-05-14T16:19:47Z","snapshot_observed_at":"2026-08-03T06:28:58.768766Z","submitted_at":"2023-04-07T13:44:59Z","title":"A Block Coordinate Descent Method for Nonsmooth Composite Optimization under Orthogonality Constraints","version":4},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-05-24T09:22:50.626565Z"},"links":{"citing_paper":"/paper/2304.03641"},"observation_digest":"sha256:742b4ca8c04c54bb27475a1b5d390b8ca38c0b4dbdccd8898ad90014a7c39c33","observation_id":"168d8e75-3cc1-440f-93a6-87f6b2744ea7","resolution":{"observed_at":"2026-05-24T09:24:17.916225Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"and Yin, W","venue":null,"work_id":"92e664ec-932e-4df6-af3f-1de60789fc33","year":2013},"citing_paper":{"arxiv_id":"2304.03641","last_updated":"2026-05-14T16:19:47Z","snapshot_observed_at":"2026-08-03T06:28:58.768766Z","submitted_at":"2023-04-07T13:44:59Z","title":"A Block Coordinate Descent Method for Nonsmooth Composite Optimization under Orthogonality Constraints","version":4},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-05-24T09:22:50.626565Z"},"links":{"citing_paper":"/paper/2304.03641"},"observation_digest":"sha256:1cbabbd72c4871beb1983307faef80efe8de907ba07f6d673375caa9456cfbe5","observation_id":"d8ac67ea-bbb4-46b5-b887-87bad978e277","resolution":{"observed_at":"2026-05-24T09:24:17.919876Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Trace-penalty minimization for large-scale eigenspace computation","venue":null,"work_id":"b8b98734-6ffa-462c-94a8-afce5e981bf9","year":2016},"citing_paper":{"arxiv_id":"2304.03641","last_updated":"2026-05-14T16:19:47Z","snapshot_observed_at":"2026-08-03T06:28:58.768766Z","submitted_at":"2023-04-07T13:44:59Z","title":"A Block Coordinate Descent Method for Nonsmooth Composite Optimization under Orthogonality Constraints","version":4},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-05-24T09:22:50.626565Z"},"links":{"citing_paper":"/paper/2304.03641"},"observation_digest":"sha256:07770331693f96f1174b003c6af9380acbfbb88a2e0e382097c6b4edc698e4dd","observation_id":"02a1020c-d5cc-486f-84a3-68d08b8b7142","resolution":{"observed_at":"2026-05-24T09:24:17.980862Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Quartic equation: https://en.wikipedia.org/wiki/Quartic_equation","venue":null,"work_id":"2377dafb-f9b1-4517-afae-8f90ef63bc31","year":2023},"citing_paper":{"arxiv_id":"2304.03641","last_updated":"2026-05-14T16:19:47Z","snapshot_observed_at":"2026-08-03T06:28:58.768766Z","submitted_at":"2023-04-07T13:44:59Z","title":"A Block Coordinate Descent Method for Nonsmooth Composite Optimization under Orthogonality Constraints","version":4},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-05-24T09:22:50.626565Z"},"links":{"citing_paper":"/paper/2304.03641"},"observation_digest":"sha256:4e3706e9eb91c014b7e7f107408725da2f5ce5f93bdc2865a603d81e292ffc4a","observation_id":"01f03e97-df91-4193-8c75-0bd7882873cf","resolution":{"observed_at":"2026-05-24T09:24:18.008979Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"and Yin, W","venue":null,"work_id":"19e95981-d6a1-47fb-8f9e-0eea4a27e433","year":2013},"citing_paper":{"arxiv_id":"2304.03641","last_updated":"2026-05-14T16:19:47Z","snapshot_observed_at":"2026-08-03T06:28:58.768766Z","submitted_at":"2023-04-07T13:44:59Z","title":"A Block Coordinate Descent Method for Nonsmooth Composite Optimization under Orthogonality Constraints","version":4},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-05-24T09:22:50.626565Z"},"links":{"citing_paper":"/paper/2304.03641"},"observation_digest":"sha256:d2f6e158d675d8f396251de5810d534156d53dfa5067e2a4993a89ebdf64de90","observation_id":"0fec8ae6-92a8-4a31-b451-5fa41cb20431","resolution":{"observed_at":"2026-05-24T09:24:18.001727Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Coordinate descent methods for fractional minimization","venue":null,"work_id":"efece926-a4b9-497d-aee6-ff85b5978ca9","year":2022},"citing_paper":{"arxiv_id":"2304.03641","last_updated":"2026-05-14T16:19:47Z","snapshot_observed_at":"2026-08-03T06:28:58.768766Z","submitted_at":"2023-04-07T13:44:59Z","title":"A Block Coordinate Descent Method for Nonsmooth Composite Optimization under Orthogonality Constraints","version":4},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-05-24T09:22:50.626565Z"},"links":{"citing_paper":"/paper/2304.03641"},"observation_digest":"sha256:55eae57302e58bd3415d9662207e4d7d3193c5a705c976436faea230a65d3896","observation_id":"c71e810b-654f-44f5-900c-c7271ee05523","resolution":{"observed_at":"2026-05-24T09:24:17.950684Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Coordinate descent methods for dc minimization: Optimality conditions and global convergence","venue":null,"work_id":"8ec0bfc7-9b4c-409c-9065-e4cce99bb4a1","year":2023},"citing_paper":{"arxiv_id":"2304.03641","last_updated":"2026-05-14T16:19:47Z","snapshot_observed_at":"2026-08-03T06:28:58.768766Z","submitted_at":"2023-04-07T13:44:59Z","title":"A Block Coordinate Descent Method for Nonsmooth Composite Optimization under Orthogonality Constraints","version":4},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-05-24T09:22:50.626565Z"},"links":{"citing_paper":"/paper/2304.03641"},"observation_digest":"sha256:8fd1fd2c2095bf1655fe101e6934c622d3dbde8c134e1dccd609948db3de3662","observation_id":"2d28bef2-7820-4e56-8f97-68b5a60acee7","resolution":{"observed_at":"2026-05-24T09:24:18.084407Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"A block decomposition algorithm for sparse optimization","venue":null,"work_id":"f4a7e89a-2edb-48b4-b42e-7d7ae1ad4033","year":2020},"citing_paper":{"arxiv_id":"2304.03641","last_updated":"2026-05-14T16:19:47Z","snapshot_observed_at":"2026-08-03T06:28:58.768766Z","submitted_at":"2023-04-07T13:44:59Z","title":"A Block Coordinate Descent Method for Nonsmooth Composite Optimization under Orthogonality Constraints","version":4},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-05-24T09:22:50.626565Z"},"links":{"citing_paper":"/paper/2304.03641"},"observation_digest":"sha256:1956a919e3911c08963988911c0aaed91eb46ddcc3aa2cd057c86abd3f6b8174","observation_id":"161a052d-6e33-4754-98a9-9c5c708016a3","resolution":{"observed_at":"2026-05-24T09:24:18.052691Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"and Shashua, A","venue":null,"work_id":"0460bc25-d312-4ff4-b562-f73845251fb1","year":2006},"citing_paper":{"arxiv_id":"2304.03641","last_updated":"2026-05-14T16:19:47Z","snapshot_observed_at":"2026-08-03T06:28:58.768766Z","submitted_at":"2023-04-07T13:44:59Z","title":"A Block Coordinate Descent Method for Nonsmooth Composite Optimization under Orthogonality Constraints","version":4},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-05-24T09:22:50.626565Z"},"links":{"citing_paper":"/paper/2304.03641"},"observation_digest":"sha256:beb5d99d66f8e735a7525276bd6a252917f2a976fa75c2ed36f5947fba232db7","observation_id":"890c1f83-09dd-4c8b-a38e-090b0e32a0a1","resolution":{"observed_at":"2026-05-24T09:24:17.947672Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"and Shashua, A","venue":null,"work_id":"72d2f66a-fa69-407c-8ca9-a210ee6f1cf0","year":2006},"citing_paper":{"arxiv_id":"2304.03641","last_updated":"2026-05-14T16:19:47Z","snapshot_observed_at":"2026-08-03T06:28:58.768766Z","submitted_at":"2023-04-07T13:44:59Z","title":"A Block Coordinate Descent Method for Nonsmooth Composite Optimization under Orthogonality Constraints","version":4},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-05-24T09:22:50.626565Z"},"links":{"citing_paper":"/paper/2304.03641"},"observation_digest":"sha256:e7cdf38b891ef7ededfcb6837943142a3b95fbf7278438c21b4e5f0b74e5cf59","observation_id":"233f6128-f5f7-4b42-81c0-98d625a8350a","resolution":{"observed_at":"2026-05-24T09:24:17.943989Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"T.-K., Lin, S., and Yao, Y","venue":null,"work_id":"c392a3db-b9e1-47a4-a6cd-e1073ac25e7b","year":2019},"citing_paper":{"arxiv_id":"2304.03641","last_updated":"2026-05-14T16:19:47Z","snapshot_observed_at":"2026-08-03T06:28:58.768766Z","submitted_at":"2023-04-07T13:44:59Z","title":"A Block Coordinate Descent Method for Nonsmooth Composite Optimization under Orthogonality Constraints","version":4},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-05-24T09:22:50.626565Z"},"links":{"citing_paper":"/paper/2304.03641"},"observation_digest":"sha256:f974195822b2cb5239ad73c46ecc96839adab5ec9cbfc5ab33bcd483d5223e01","observation_id":"2ed04d51-6012-4d89-9824-5f4378c6ed1a","resolution":{"observed_at":"2026-05-24T09:24:17.991344Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Complete dictionary learning via l4-norm maximization over the orthogonal group","venue":null,"work_id":"e0cd4d50-fadc-44ba-8d98-607480739521","year":2020},"citing_paper":{"arxiv_id":"2304.03641","last_updated":"2026-05-14T16:19:47Z","snapshot_observed_at":"2026-08-03T06:28:58.768766Z","submitted_at":"2023-04-07T13:44:59Z","title":"A Block Coordinate Descent Method for Nonsmooth Composite Optimization under Orthogonality Constraints","version":4},"reference_index":54,"source":"arxiv_source","source_observed_at":"2026-05-24T09:22:50.626565Z"},"links":{"citing_paper":"/paper/2304.03641"},"observation_digest":"sha256:806b104ea412f33bd4abe608a1c1d1711c02a7ea402d5f28454c897cdf66889f","observation_id":"cfee7c96-6464-4c65-a469-f4606ce8b1f6","resolution":{"observed_at":"2026-05-24T09:24:17.994500Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Primal-dual optimization algorithms over riemannian manifolds: an iteration complexity analysis","venue":null,"work_id":"e9595fe2-e062-4198-ba81-b046a99fee04","year":2019},"citing_paper":{"arxiv_id":"2304.03641","last_updated":"2026-05-14T16:19:47Z","snapshot_observed_at":"2026-08-03T06:28:58.768766Z","submitted_at":"2023-04-07T13:44:59Z","title":"A Block Coordinate Descent Method for Nonsmooth Composite Optimization under Orthogonality Constraints","version":4},"reference_index":55,"source":"arxiv_source","source_observed_at":"2026-05-24T09:22:50.626565Z"},"links":{"citing_paper":"/paper/2304.03641"},"observation_digest":"sha256:e8b863eb4c8b5b880a1b279cff5f521f23d5249f9da3d1357fbac77bda64fe06","observation_id":"8dbffc3e-c730-4214-b60a-fc6e47162bd8","resolution":{"observed_at":"2026-05-24T09:24:18.005537Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Gradient type optimization methods for electronic structure calculations","venue":null,"work_id":"7df8e77b-ab55-4b8e-aa71-e3d6a521a478","year":2014},"citing_paper":{"arxiv_id":"2304.03641","last_updated":"2026-05-14T16:19:47Z","snapshot_observed_at":"2026-08-03T06:28:58.768766Z","submitted_at":"2023-04-07T13:44:59Z","title":"A Block Coordinate Descent Method for Nonsmooth Composite Optimization under Orthogonality Constraints","version":4},"reference_index":56,"source":"arxiv_source","source_observed_at":"2026-05-24T09:22:50.626565Z"},"links":{"citing_paper":"/paper/2304.03641"},"observation_digest":"sha256:54d8003c9b75b70689a3002751b90adc30831d7a84c0c4eddabe423c2f829c5b","observation_id":"a7f3cd90-de8b-4d27-b971-5a83c486d5d8","resolution":{"observed_at":"2026-05-24T09:24:17.988050Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"A riemannian newton algorithm for nonlinear eigenvalue problems","venue":null,"work_id":"734fa3b4-ac25-4667-92ea-6a0abb5749d6","year":2015},"citing_paper":{"arxiv_id":"2304.03641","last_updated":"2026-05-14T16:19:47Z","snapshot_observed_at":"2026-08-03T06:28:58.768766Z","submitted_at":"2023-04-07T13:44:59Z","title":"A Block Coordinate Descent Method for Nonsmooth Composite Optimization under Orthogonality Constraints","version":4},"reference_index":57,"source":"arxiv_source","source_observed_at":"2026-05-24T09:22:50.626565Z"},"links":{"citing_paper":"/paper/2304.03641"},"observation_digest":"sha256:547aa53aeef708a02532acd95662c26a9c0a6303a23c1fd5d23bab223f7c4fcd","observation_id":"bdace2a8-d9a9-464f-9123-f08b0921afae","resolution":{"observed_at":"2026-05-24T09:24:17.984498Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-09T08:36:07.226215Z","title":"write newline","venue":null,"work_id":"8481976a-f196-4822-833d-e487ae5a1e81","year":null},"citing_paper":{"arxiv_id":"2304.03641","last_updated":"2026-05-14T16:19:47Z","snapshot_observed_at":"2026-08-03T06:28:58.768766Z","submitted_at":"2023-04-07T13:44:59Z","title":"A Block Coordinate Descent Method for Nonsmooth Composite Optimization under Orthogonality Constraints","version":4},"reference_index":58,"source":"arxiv_source","source_observed_at":"2026-05-24T09:22:50.626565Z"},"links":{"citing_paper":"/paper/2304.03641"},"observation_digest":"sha256:575b056fe99c66ff253e7614a85c13e37ecd49e74a626631c1758ed745e1085b","observation_id":"bbb045de-aef6-4286-a0bd-bc43f2f66586","resolution":{"observed_at":"2026-05-24T09:24:17.998232Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2304.03641","last_updated":"2026-05-14T16:19:47Z","latest_version":4,"primary_category":"math.OC","snapshot_observed_at":"2026-08-03T06:28:58.768766Z","submitted_at":"2023-04-07T13:44:59Z","title":"A Block Coordinate Descent Method for Nonsmooth Composite Optimization under Orthogonality Constraints"},"reference_resolution":{"displayed":58,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":4,"verified_exact":0,"verified_fuzzy":54},"total_outbound_references":58},"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-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 58 of 58 outbound references and 1 inbound Pith citation observation for arXiv:2304.03641."}