{"as_of":"2026-08-09T04:28:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:639c0632741a1c87eb978cf5046c9a2930fdf5995a64e7e641c8858168208e4f","coverage":[{"denominator":115,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":100,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T04:51:10.296093Z","state":"measured"},{"denominator":100,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":100,"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/2506.09594/citation-record","integrity":"/paper/2506.09594/integrity","json":"/paper/2506.09594/citation-record.json","paper":"/paper/2506.09594"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:51:08.894088Z","title":"Tensor networks for dimensionality reduction and large-scale optimization: Part 1 low-rank tensor decompositions,","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2506.09594","last_updated":"2025-07-08T09:43:58Z","snapshot_observed_at":"2026-08-07T04:42:13.488017Z","submitted_at":"2025-06-11T10:53:07Z","title":"Accelerating Large-Scale Regularized High-Order Tensor Recovery","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T04:51:08.894088Z"},"links":{"citing_paper":"/paper/2506.09594"},"observation_digest":"sha256:fc07d767534a97b3e1d5122b91da7050b2212d7113b1667f53604681d463d034","observation_id":"dbdc790f-b04b-4eab-862d-9d1dc819e694","resolution":{"observed_at":"2026-08-07T04:51:08.894088Z","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-08-07T04:51:09.081515Z","title":"Turning big data into tiny data: Constant-size coresets for k-means, pca, and projective clustering,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2506.09594","last_updated":"2025-07-08T09:43:58Z","snapshot_observed_at":"2026-08-07T04:42:13.488017Z","submitted_at":"2025-06-11T10:53:07Z","title":"Accelerating Large-Scale Regularized High-Order Tensor Recovery","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T04:51:09.081515Z"},"links":{"citing_paper":"/paper/2506.09594"},"observation_digest":"sha256:cbbc3e9a88c55b2f6189ddde9f2ac6f7904752a5ff357fed00a7f16472e521f2","observation_id":"7a422b32-689c-4e8b-baa4-01aeee49717e","resolution":{"observed_at":"2026-08-07T04:51:09.081515Z","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-08-07T04:51:09.220935Z","title":"Liu, Tensors for data processing: theory, methods, and applications","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.09594","last_updated":"2025-07-08T09:43:58Z","snapshot_observed_at":"2026-08-07T04:42:13.488017Z","submitted_at":"2025-06-11T10:53:07Z","title":"Accelerating Large-Scale Regularized High-Order Tensor Recovery","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T04:51:09.220935Z"},"links":{"citing_paper":"/paper/2506.09594"},"observation_digest":"sha256:3882fed068a63bbff8d98e535b3581ccc9f4fef8f0cd17b0c554aa6352c3a064","observation_id":"1e955ab7-3597-4e50-a2ae-6f4267134b68","resolution":{"observed_at":"2026-08-07T04:51:09.220935Z","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-08-07T04:51:09.425621Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.09594","last_updated":"2025-07-08T09:43:58Z","snapshot_observed_at":"2026-08-07T04:42:13.488017Z","submitted_at":"2025-06-11T10:53:07Z","title":"Accelerating Large-Scale Regularized High-Order Tensor Recovery","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T04:51:09.425621Z"},"links":{"citing_paper":"/paper/2506.09594"},"observation_digest":"sha256:c1b28ee0890d54a974b43271f1a11a2d7cb2e9bcbdb4898c2ab5ab41770c0500","observation_id":"aea1a721-d172-4a98-b5ba-b431707b0cae","resolution":{"observed_at":"2026-08-07T04:51:09.425621Z","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-08-07T04:51:09.616715Z","title":"An optimal statistical and computational framework for generalized tensor estimation,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.09594","last_updated":"2025-07-08T09:43:58Z","snapshot_observed_at":"2026-08-07T04:42:13.488017Z","submitted_at":"2025-06-11T10:53:07Z","title":"Accelerating Large-Scale Regularized High-Order Tensor Recovery","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T04:51:09.616715Z"},"links":{"citing_paper":"/paper/2506.09594"},"observation_digest":"sha256:f6e2f3f4fc47d75ac66b38ae2b3c26ae047140be9de16ebe42a8f9ee8c850ce9","observation_id":"8e017fd5-402e-44c4-9ece-72afd7149f8c","resolution":{"observed_at":"2026-08-07T04:51:09.616715Z","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-08-07T04:51:09.732599Z","title":"Generalized low-rank plus sparse tensor estimation by fast Riemannian optimization,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.09594","last_updated":"2025-07-08T09:43:58Z","snapshot_observed_at":"2026-08-07T04:42:13.488017Z","submitted_at":"2025-06-11T10:53:07Z","title":"Accelerating Large-Scale Regularized High-Order Tensor Recovery","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T04:51:09.732599Z"},"links":{"citing_paper":"/paper/2506.09594"},"observation_digest":"sha256:b62fcf82dc42bd772b7c6dc60ea5ecd927e030302c47ed6160da19359ae8d9fa","observation_id":"a4256096-7762-47c3-9f57-d6da2d07c70f","resolution":{"observed_at":"2026-08-07T04:51:09.732599Z","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-08-07T04:51:09.840642Z","title":"Provable tensor-train format tensor completion by riemannian optimization,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.09594","last_updated":"2025-07-08T09:43:58Z","snapshot_observed_at":"2026-08-07T04:42:13.488017Z","submitted_at":"2025-06-11T10:53:07Z","title":"Accelerating Large-Scale Regularized High-Order Tensor Recovery","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T04:51:09.840642Z"},"links":{"citing_paper":"/paper/2506.09594"},"observation_digest":"sha256:730da1e5704c14df04445ec005cf536e4e932117590f906b110ff654205746a6","observation_id":"79c63d69-067e-4d14-ba3f-c5e7ddf024d7","resolution":{"observed_at":"2026-08-07T04:51:09.840642Z","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-08-07T04:51:09.844005Z","title":"Scaling and scalability: Provable nonconvex low-rank tensor estimation from incomplete measurements,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.09594","last_updated":"2025-07-08T09:43:58Z","snapshot_observed_at":"2026-08-07T04:42:13.488017Z","submitted_at":"2025-06-11T10:53:07Z","title":"Accelerating Large-Scale Regularized High-Order Tensor Recovery","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T04:51:09.844005Z"},"links":{"citing_paper":"/paper/2506.09594"},"observation_digest":"sha256:ef1fbcb5afe53db07e52fd037052d78cdb15eab3c898f2840d90a8969b7d7dc6","observation_id":"628ad4c6-74ce-4c8a-8ca5-1bb3096a2a8e","resolution":{"observed_at":"2026-08-07T04:51:09.844005Z","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-08-07T04:51:09.847420Z","title":"Guaranteed nonconvex factorization approach for tensor train recovery,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.09594","last_updated":"2025-07-08T09:43:58Z","snapshot_observed_at":"2026-08-07T04:42:13.488017Z","submitted_at":"2025-06-11T10:53:07Z","title":"Accelerating Large-Scale Regularized High-Order Tensor Recovery","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T04:51:09.847420Z"},"links":{"citing_paper":"/paper/2506.09594"},"observation_digest":"sha256:1c8273bfac657d8fb7361279471c7909e45a6fcce2aa6c8f5cc83afe3ccf2f8a","observation_id":"556a19ba-ed52-4d94-95cb-1e556dcb3165","resolution":{"observed_at":"2026-08-07T04:51:09.847420Z","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-08-07T04:51:09.850638Z","title":"Tensor robust principal component analysis with a new tensor nuclear norm,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2506.09594","last_updated":"2025-07-08T09:43:58Z","snapshot_observed_at":"2026-08-07T04:42:13.488017Z","submitted_at":"2025-06-11T10:53:07Z","title":"Accelerating Large-Scale Regularized High-Order Tensor Recovery","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T04:51:09.850638Z"},"links":{"citing_paper":"/paper/2506.09594"},"observation_digest":"sha256:5f3239c510bc734b828575706c7651f2b361a301b0c82e984f39577c2904f200","observation_id":"6735fe50-6277-405f-b475-53b4e80a02e1","resolution":{"observed_at":"2026-08-07T04:51:09.850638Z","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-08-07T04:51:09.853530Z","title":"Low-tubal-rank plus sparse tensor recovery with prior subspace information,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2506.09594","last_updated":"2025-07-08T09:43:58Z","snapshot_observed_at":"2026-08-07T04:42:13.488017Z","submitted_at":"2025-06-11T10:53:07Z","title":"Accelerating Large-Scale Regularized High-Order Tensor Recovery","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T04:51:09.853530Z"},"links":{"citing_paper":"/paper/2506.09594"},"observation_digest":"sha256:a950a65209c866b8fc26574609c04e01c5b5994ed001bf8afc8224dc97c3885b","observation_id":"c4f230df-2307-4310-aa72-26d7d6b19143","resolution":{"observed_at":"2026-08-07T04:51:09.853530Z","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-08-07T04:51:09.968263Z","title":"Ro- bust low-tubal-rank tensor recovery from binary measurements,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.09594","last_updated":"2025-07-08T09:43:58Z","snapshot_observed_at":"2026-08-07T04:42:13.488017Z","submitted_at":"2025-06-11T10:53:07Z","title":"Accelerating Large-Scale Regularized High-Order Tensor Recovery","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T04:51:09.968263Z"},"links":{"citing_paper":"/paper/2506.09594"},"observation_digest":"sha256:106eed9d52281362072e6941e2510d72f7fa16543018d3ac5f68d8f94f3f14b8","observation_id":"a43489e0-5084-43ce-8006-a70d38966f30","resolution":{"observed_at":"2026-08-07T04:51:09.968263Z","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-08-07T04:51:09.971433Z","title":"Tensor robust principal component analysis from multilevel quantized observations,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.09594","last_updated":"2025-07-08T09:43:58Z","snapshot_observed_at":"2026-08-07T04:42:13.488017Z","submitted_at":"2025-06-11T10:53:07Z","title":"Accelerating Large-Scale Regularized High-Order Tensor Recovery","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T04:51:09.971433Z"},"links":{"citing_paper":"/paper/2506.09594"},"observation_digest":"sha256:3d94434fbf8afa484cce806e0f6b04335319f9f379ca70fc6df588bd8c317e84","observation_id":"ea17f0d4-0ec3-4aae-8342-0577d9a0fb9c","resolution":{"observed_at":"2026-08-07T04:51:09.971433Z","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-08-07T04:51:09.974277Z","title":"Guaranteed tensor recovery fused low-rankness and smoothness,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.09594","last_updated":"2025-07-08T09:43:58Z","snapshot_observed_at":"2026-08-07T04:42:13.488017Z","submitted_at":"2025-06-11T10:53:07Z","title":"Accelerating Large-Scale Regularized High-Order Tensor Recovery","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T04:51:09.974277Z"},"links":{"citing_paper":"/paper/2506.09594"},"observation_digest":"sha256:02df93ebccb02bca9f37d15cef8b3cb06bbdf6349973e29f0f55ff1a6cf78626","observation_id":"3371e8a3-f337-4aa6-8c06-a6d519ce5f63","resolution":{"observed_at":"2026-08-07T04:51:09.974277Z","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-08-07T04:51:09.977491Z","title":"Low-rank tensor function representation for multi-dimensional data recovery,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.09594","last_updated":"2025-07-08T09:43:58Z","snapshot_observed_at":"2026-08-07T04:42:13.488017Z","submitted_at":"2025-06-11T10:53:07Z","title":"Accelerating Large-Scale Regularized High-Order Tensor Recovery","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T04:51:09.977491Z"},"links":{"citing_paper":"/paper/2506.09594"},"observation_digest":"sha256:ac2d1d35fea44820654022a9d018882324d534f3102b2135f6842e0620fe1e5e","observation_id":"cd2011e3-c12c-4fe4-8edb-2efb70f71a4d","resolution":{"observed_at":"2026-08-07T04:51:09.977491Z","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-08-07T04:51:09.980899Z","title":"Noncon- vex robust high-order tensor completion using randomized low-rank approximation,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.09594","last_updated":"2025-07-08T09:43:58Z","snapshot_observed_at":"2026-08-07T04:42:13.488017Z","submitted_at":"2025-06-11T10:53:07Z","title":"Accelerating Large-Scale Regularized High-Order Tensor Recovery","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T04:51:09.980899Z"},"links":{"citing_paper":"/paper/2506.09594"},"observation_digest":"sha256:fd539497b5377a58e07415907ff7179325e6572d7ac82fdf21c96a52a4b88c23","observation_id":"219c5e6b-3c10-4908-959f-2575c80bf478","resolution":{"observed_at":"2026-08-07T04:51:09.980899Z","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-08-07T04:51:09.983605Z","title":"Learned tensor neural network texture prior for photon-counting CT reconstruction,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.09594","last_updated":"2025-07-08T09:43:58Z","snapshot_observed_at":"2026-08-07T04:42:13.488017Z","submitted_at":"2025-06-11T10:53:07Z","title":"Accelerating Large-Scale Regularized High-Order Tensor Recovery","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T04:51:09.983605Z"},"links":{"citing_paper":"/paper/2506.09594"},"observation_digest":"sha256:8d15ba1fac6ce45f173e2ec7e0c7e1e95658051d7a43d4f2d96234c578117ad7","observation_id":"0fda84d5-71fb-485e-9d56-99ccf8902ecc","resolution":{"observed_at":"2026-08-07T04:51:09.983605Z","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-08-07T04:51:09.986562Z","title":"Bayesian temporal factorization for multidimen- sional time series prediction,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.09594","last_updated":"2025-07-08T09:43:58Z","snapshot_observed_at":"2026-08-07T04:42:13.488017Z","submitted_at":"2025-06-11T10:53:07Z","title":"Accelerating Large-Scale Regularized High-Order Tensor Recovery","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T04:51:09.986562Z"},"links":{"citing_paper":"/paper/2506.09594"},"observation_digest":"sha256:ed6cc2e731040989b19bdc1f863b9eae429a1ffe6a29f76612d8677452af1ed7","observation_id":"66981066-4047-4653-9fdc-c48b34869277","resolution":{"observed_at":"2026-08-07T04:51:09.986562Z","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-08-07T04:51:09.989925Z","title":"Integrated sensing and communication with massive MIMO: A unified tensor approach for channel and target parameter estimation,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.09594","last_updated":"2025-07-08T09:43:58Z","snapshot_observed_at":"2026-08-07T04:42:13.488017Z","submitted_at":"2025-06-11T10:53:07Z","title":"Accelerating Large-Scale Regularized High-Order Tensor Recovery","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T04:51:09.989925Z"},"links":{"citing_paper":"/paper/2506.09594"},"observation_digest":"sha256:342e86e925e02ac4f5bb1342f07054a7c15de4b1c8b8353e80bd6bac9d5f09f9","observation_id":"68c8d2fa-4ff5-4634-b9cc-aba8405cbfcd","resolution":{"observed_at":"2026-08-07T04:51:09.989925Z","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-08-07T04:51:09.992813Z","title":"Non-local meets global: An iterative paradigm for hyperspectral image restoration,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2506.09594","last_updated":"2025-07-08T09:43:58Z","snapshot_observed_at":"2026-08-07T04:42:13.488017Z","submitted_at":"2025-06-11T10:53:07Z","title":"Accelerating Large-Scale Regularized High-Order Tensor Recovery","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T04:51:09.992813Z"},"links":{"citing_paper":"/paper/2506.09594"},"observation_digest":"sha256:144c5f3553ba0d221c67e7c99cf16965d5e3ea4e63d9dc50d2882fdf52245ae8","observation_id":"97992553-c01d-4d2d-8d53-0cc17f976042","resolution":{"observed_at":"2026-08-07T04:51:09.992813Z","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-08-07T04:51:09.995866Z","title":"Tensor decompositions for signal processing applications: From two-way to multiway component analysis,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2506.09594","last_updated":"2025-07-08T09:43:58Z","snapshot_observed_at":"2026-08-07T04:42:13.488017Z","submitted_at":"2025-06-11T10:53:07Z","title":"Accelerating Large-Scale Regularized High-Order Tensor Recovery","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-07T04:51:09.995866Z"},"links":{"citing_paper":"/paper/2506.09594"},"observation_digest":"sha256:64818bdc77ca742be6f936bb936df468f3c85e22cad41f63c9d44ce85b476544","observation_id":"0b93e9d7-b7d6-41f3-b41b-520199a8dcdd","resolution":{"observed_at":"2026-08-07T04:51:09.995866Z","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-08-07T04:51:09.998917Z","title":"Tensor methods in computer vision and deep learning,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.09594","last_updated":"2025-07-08T09:43:58Z","snapshot_observed_at":"2026-08-07T04:42:13.488017Z","submitted_at":"2025-06-11T10:53:07Z","title":"Accelerating Large-Scale Regularized High-Order Tensor Recovery","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-07T04:51:09.998917Z"},"links":{"citing_paper":"/paper/2506.09594"},"observation_digest":"sha256:e8cf400b0dfdf677b9f98cbb3aff3821d7a489d45148bee4af7aea1e81b39c6d","observation_id":"83ca1c08-de96-43bd-8a94-ff75d500e61e","resolution":{"observed_at":"2026-08-07T04:51:09.998917Z","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-08-07T04:51:10.002195Z","title":"Bayesian CP factorization of incomplete tensors with automatic rank determination,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2506.09594","last_updated":"2025-07-08T09:43:58Z","snapshot_observed_at":"2026-08-07T04:42:13.488017Z","submitted_at":"2025-06-11T10:53:07Z","title":"Accelerating Large-Scale Regularized High-Order Tensor Recovery","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-07T04:51:10.002195Z"},"links":{"citing_paper":"/paper/2506.09594"},"observation_digest":"sha256:6cb47a6c7b17ecb8637e617eac337e8a50e0d0008997b449876441bdbc2740ce","observation_id":"bd31d3a3-c057-49d2-8167-19d23266a39e","resolution":{"observed_at":"2026-08-07T04:51:10.002195Z","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-08-07T04:51:10.005178Z","title":"Bayesian low rank tensor ring for image recovery,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.09594","last_updated":"2025-07-08T09:43:58Z","snapshot_observed_at":"2026-08-07T04:42:13.488017Z","submitted_at":"2025-06-11T10:53:07Z","title":"Accelerating Large-Scale Regularized High-Order Tensor Recovery","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-07T04:51:10.005178Z"},"links":{"citing_paper":"/paper/2506.09594"},"observation_digest":"sha256:3250e35c788ff1a8981bf4ad66dcb328198a636bb8cc70f19d4ccd0554fc25da","observation_id":"c29316d0-94dc-4f51-99bf-c2c629198d0d","resolution":{"observed_at":"2026-08-07T04:51:10.005178Z","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-08-07T04:51:10.008363Z","title":"Low-tubal-rank tensor completion using alternating minimization,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2506.09594","last_updated":"2025-07-08T09:43:58Z","snapshot_observed_at":"2026-08-07T04:42:13.488017Z","submitted_at":"2025-06-11T10:53:07Z","title":"Accelerating Large-Scale Regularized High-Order Tensor Recovery","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-07T04:51:10.008363Z"},"links":{"citing_paper":"/paper/2506.09594"},"observation_digest":"sha256:840b20d6e48364566d9aa0b2e07be20a6a1567224fc2a58c85195c3b91eee92c","observation_id":"b5dc0c41-a3af-4ec7-b50f-6a0387e82d9d","resolution":{"observed_at":"2026-08-07T04:51:10.008363Z","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-08-07T04:51:10.012633Z","title":"Fully-connected tensor network decomposition and its application to higher-order tensor completion,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.09594","last_updated":"2025-07-08T09:43:58Z","snapshot_observed_at":"2026-08-07T04:42:13.488017Z","submitted_at":"2025-06-11T10:53:07Z","title":"Accelerating Large-Scale Regularized High-Order Tensor Recovery","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-07T04:51:10.012633Z"},"links":{"citing_paper":"/paper/2506.09594"},"observation_digest":"sha256:ca75ff44fbbd9639f0ea309ae7c929be0f2e422b528930667fd11ad72ca74965","observation_id":"b5868af7-e0c4-4b84-8ab7-9927176f51fc","resolution":{"observed_at":"2026-08-07T04:51:10.012633Z","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-08-07T04:51:10.016300Z","title":"Tensor wheel decomposition and its tensor completion application,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.09594","last_updated":"2025-07-08T09:43:58Z","snapshot_observed_at":"2026-08-07T04:42:13.488017Z","submitted_at":"2025-06-11T10:53:07Z","title":"Accelerating Large-Scale Regularized High-Order Tensor Recovery","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-07T04:51:10.016300Z"},"links":{"citing_paper":"/paper/2506.09594"},"observation_digest":"sha256:9a49df839bee769a79bd554516f6ea07100d958411559b27c42c6cfddbd5ca2c","observation_id":"7986f4d9-eb8a-44ea-bef3-0f184b1b20d8","resolution":{"observed_at":"2026-08-07T04:51:10.016300Z","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-08-07T04:51:10.020056Z","title":"Tensor-ring nuclear norm minimization and application for visual: Data completion,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2506.09594","last_updated":"2025-07-08T09:43:58Z","snapshot_observed_at":"2026-08-07T04:42:13.488017Z","submitted_at":"2025-06-11T10:53:07Z","title":"Accelerating Large-Scale Regularized High-Order Tensor Recovery","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-07T04:51:10.020056Z"},"links":{"citing_paper":"/paper/2506.09594"},"observation_digest":"sha256:52c6b71bfd1e918b287efce58c5c9453919c8325ff8d1ac219c09410c325bd23","observation_id":"2cf63364-0328-4925-a434-1db3f3699cf3","resolution":{"observed_at":"2026-08-07T04:51:10.020056Z","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-08-07T04:51:10.023608Z","title":"Low-rank high-order tensor completion with applications in visual data,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.09594","last_updated":"2025-07-08T09:43:58Z","snapshot_observed_at":"2026-08-07T04:42:13.488017Z","submitted_at":"2025-06-11T10:53:07Z","title":"Accelerating Large-Scale Regularized High-Order Tensor Recovery","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-07T04:51:10.023608Z"},"links":{"citing_paper":"/paper/2506.09594"},"observation_digest":"sha256:fc0dcea31e5ea67425eb8f20495ab4824ab678389d242ab5067ea5a1f162be4a","observation_id":"73832200-130a-4ee2-869b-bc082470d5f1","resolution":{"observed_at":"2026-08-07T04:51:10.023608Z","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-08-07T04:51:10.027444Z","title":"Tensor n-tubal rank and its convex relaxation for low-rank tensor recovery,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2506.09594","last_updated":"2025-07-08T09:43:58Z","snapshot_observed_at":"2026-08-07T04:42:13.488017Z","submitted_at":"2025-06-11T10:53:07Z","title":"Accelerating Large-Scale Regularized High-Order Tensor Recovery","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-07T04:51:10.027444Z"},"links":{"citing_paper":"/paper/2506.09594"},"observation_digest":"sha256:6572f9cf1b07502c153a2fe36057874b4e91c40d1fe33cbb0efc8431ae47be6f","observation_id":"a63ff098-69e5-495f-a969-c45c35f4ed72","resolution":{"observed_at":"2026-08-07T04:51:10.027444Z","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-08-07T04:51:10.030957Z","title":"Revisiting high-order tensor singular value decomposition from basic element perspective,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.09594","last_updated":"2025-07-08T09:43:58Z","snapshot_observed_at":"2026-08-07T04:42:13.488017Z","submitted_at":"2025-06-11T10:53:07Z","title":"Accelerating Large-Scale Regularized High-Order Tensor Recovery","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-07T04:51:10.030957Z"},"links":{"citing_paper":"/paper/2506.09594"},"observation_digest":"sha256:a8d99bb438b5aea3440c8efb70d2fbbbec367e63c388c7110ab1aff3929a4fe8","observation_id":"bde36f07-69ba-4369-8841-4016063a60d9","resolution":{"observed_at":"2026-08-07T04:51:10.030957Z","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-08-07T04:51:10.034302Z","title":"Multiplex transformed tensor decomposition for multidimensional image recovery,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.09594","last_updated":"2025-07-08T09:43:58Z","snapshot_observed_at":"2026-08-07T04:42:13.488017Z","submitted_at":"2025-06-11T10:53:07Z","title":"Accelerating Large-Scale Regularized High-Order Tensor Recovery","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-07T04:51:10.034302Z"},"links":{"citing_paper":"/paper/2506.09594"},"observation_digest":"sha256:e198ed58b68ff243c120a2fd9ab059ae6f5bc70b28e8338e07ea7dd9fede199a","observation_id":"94358239-6714-4f22-aa7f-8555c3418e50","resolution":{"observed_at":"2026-08-07T04:51:10.034302Z","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-08-07T04:51:10.038960Z","title":"Robust low-rank tensor recovery: Models and algorithms,","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2506.09594","last_updated":"2025-07-08T09:43:58Z","snapshot_observed_at":"2026-08-07T04:42:13.488017Z","submitted_at":"2025-06-11T10:53:07Z","title":"Accelerating Large-Scale Regularized High-Order Tensor Recovery","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-07T04:51:10.038960Z"},"links":{"citing_paper":"/paper/2506.09594"},"observation_digest":"sha256:fcd5d4feee829a9d8b0c0aefc47cafba5589ebc114099c281647db9afdf69258","observation_id":"45dd3527-b00a-42ab-9c21-6f9b59e5e095","resolution":{"observed_at":"2026-08-07T04:51:10.038960Z","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-08-07T04:51:10.043778Z","title":"Robust low-rank tensor ring completion,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2506.09594","last_updated":"2025-07-08T09:43:58Z","snapshot_observed_at":"2026-08-07T04:42:13.488017Z","submitted_at":"2025-06-11T10:53:07Z","title":"Accelerating Large-Scale Regularized High-Order Tensor Recovery","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-07T04:51:10.043778Z"},"links":{"citing_paper":"/paper/2506.09594"},"observation_digest":"sha256:0a0889494b4a8eef6d09f229f96a15ce6ef05b1f956d8109639e9e9203a5ea05","observation_id":"210f540d-d6f4-48f3-bd5d-48fd6510a522","resolution":{"observed_at":"2026-08-07T04:51:10.043778Z","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-08-07T04:51:10.047476Z","title":"Robust tensor completion via capped frobenius norm,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.09594","last_updated":"2025-07-08T09:43:58Z","snapshot_observed_at":"2026-08-07T04:42:13.488017Z","submitted_at":"2025-06-11T10:53:07Z","title":"Accelerating Large-Scale Regularized High-Order Tensor Recovery","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-07T04:51:10.047476Z"},"links":{"citing_paper":"/paper/2506.09594"},"observation_digest":"sha256:8910660f0ec6aac49c2da6f5ca4d32fdb692bb5a9759804ae9e938b7ff0954c1","observation_id":"90226b1b-c979-4ddc-aed6-f718051f4a56","resolution":{"observed_at":"2026-08-07T04:51:10.047476Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:51:11.216961Z","title":"Fully-connected tensor network decomposition for robust tensor completion problem,","venue":null,"work_id":"dae5c107-28af-4c52-b82c-30f2eac5e447","year":2024},"citing_paper":{"arxiv_id":"2506.09594","last_updated":"2025-07-08T09:43:58Z","snapshot_observed_at":"2026-08-07T04:42:13.488017Z","submitted_at":"2025-06-11T10:53:07Z","title":"Accelerating Large-Scale Regularized High-Order Tensor Recovery","version":2},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-07T04:51:10.051041Z"},"links":{"citing_paper":"/paper/2506.09594"},"observation_digest":"sha256:24b95bb595cf9ba230475be52bf80223f6b2c6486c4d04f10d3e4675fc700e52","observation_id":"e78897c2-37f7-4d7e-8a21-9628d21c3847","resolution":{"observed_at":"2026-08-07T04:51:11.220540Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"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"}],"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-08-07T04:51:11.206525Z","title":"Robust tensor completion from uniformly dithered one-bit observations,","venue":null,"work_id":"0ecec3f6-2f97-43b2-ab08-69291f1a9e13","year":2025},"citing_paper":{"arxiv_id":"2506.09594","last_updated":"2025-07-08T09:43:58Z","snapshot_observed_at":"2026-08-07T04:42:13.488017Z","submitted_at":"2025-06-11T10:53:07Z","title":"Accelerating Large-Scale Regularized High-Order Tensor Recovery","version":2},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-07T04:51:10.055142Z"},"links":{"citing_paper":"/paper/2506.09594"},"observation_digest":"sha256:eaae8a3efd017612d30394c7f0b66b68e42e0f80806264043524c0803e157378","observation_id":"c950ba25-a6e0-4567-b6ea-be3e2251673a","resolution":{"observed_at":"2026-08-07T04:51:11.210057Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"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"}],"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-08-07T04:51:11.196228Z","title":"Robust low-tubal-rank tensor completion via convex optimization","venue":null,"work_id":"2caa478f-b5af-4203-9306-2bc852c45387","year":2019},"citing_paper":{"arxiv_id":"2506.09594","last_updated":"2025-07-08T09:43:58Z","snapshot_observed_at":"2026-08-07T04:42:13.488017Z","submitted_at":"2025-06-11T10:53:07Z","title":"Accelerating Large-Scale Regularized High-Order Tensor Recovery","version":2},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-07T04:51:10.058918Z"},"links":{"citing_paper":"/paper/2506.09594"},"observation_digest":"sha256:950378b6a6e28f9309fb3b39fd59837134f95a1cc2ca4f970fcddfc5c66dd2d2","observation_id":"f7f90748-ad59-4048-ba39-24f7736770dd","resolution":{"observed_at":"2026-08-07T04:51:11.199815Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"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"}],"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-08-07T04:51:11.186409Z","title":"Robust low-rank tensor minimization via a new tensor spectral k-support norm,","venue":null,"work_id":"02ae2aad-62d9-4cb0-9c07-e3c4b5c7c7fe","year":2019},"citing_paper":{"arxiv_id":"2506.09594","last_updated":"2025-07-08T09:43:58Z","snapshot_observed_at":"2026-08-07T04:42:13.488017Z","submitted_at":"2025-06-11T10:53:07Z","title":"Accelerating Large-Scale Regularized High-Order Tensor Recovery","version":2},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-07T04:51:10.062407Z"},"links":{"citing_paper":"/paper/2506.09594"},"observation_digest":"sha256:d73e44f489e9cacc2564670ba92a5ba16c7df913eb011c8768a0aa847f4cc9fe","observation_id":"452365b3-6f97-435d-b711-ce88c0c4046a","resolution":{"observed_at":"2026-08-07T04:51:11.189856Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"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"}],"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-08-07T04:51:11.176144Z","title":"Robust tensor decomposition via t-SVD: Near-optimal statistical guarantee and scalable algorithms,","venue":null,"work_id":"3ad54b4d-ccea-43d4-a152-733c62173651","year":2020},"citing_paper":{"arxiv_id":"2506.09594","last_updated":"2025-07-08T09:43:58Z","snapshot_observed_at":"2026-08-07T04:42:13.488017Z","submitted_at":"2025-06-11T10:53:07Z","title":"Accelerating Large-Scale Regularized High-Order Tensor Recovery","version":2},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-07T04:51:10.065731Z"},"links":{"citing_paper":"/paper/2506.09594"},"observation_digest":"sha256:ed7bd7f3511ba41ef96bb9fffd9480b9edc8a430a1736a2f02bc41ea4c7be2d2","observation_id":"48462302-e309-4084-8c63-8c1a24edde02","resolution":{"observed_at":"2026-08-07T04:51:11.179708Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"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"}],"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-08-07T04:51:11.165664Z","title":"Robust tensor completion us- ing transformed tensor singular value decomposition,","venue":null,"work_id":"368b87d0-1af0-493c-8cd7-ba6501bf0b47","year":2020},"citing_paper":{"arxiv_id":"2506.09594","last_updated":"2025-07-08T09:43:58Z","snapshot_observed_at":"2026-08-07T04:42:13.488017Z","submitted_at":"2025-06-11T10:53:07Z","title":"Accelerating Large-Scale Regularized High-Order Tensor Recovery","version":2},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-07T04:51:10.070213Z"},"links":{"citing_paper":"/paper/2506.09594"},"observation_digest":"sha256:26625fe29f16f90f739ddd47f5921acb0b517d789bf4ba9a801423728baee79c","observation_id":"53cf0bd7-b7b9-4ce6-8618-79582bdfc462","resolution":{"observed_at":"2026-08-07T04:51:11.169821Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"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"}],"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-08-07T04:51:11.154835Z","title":"Ro- bust corrupted data recovery and clustering via generalized transformed tensor low-rank representation,","venue":null,"work_id":"8fb192ec-6b6b-491f-bd86-9df2851f7e8f","year":2024},"citing_paper":{"arxiv_id":"2506.09594","last_updated":"2025-07-08T09:43:58Z","snapshot_observed_at":"2026-08-07T04:42:13.488017Z","submitted_at":"2025-06-11T10:53:07Z","title":"Accelerating Large-Scale Regularized High-Order Tensor Recovery","version":2},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-07T04:51:10.074455Z"},"links":{"citing_paper":"/paper/2506.09594"},"observation_digest":"sha256:b7ba17338d9b2ffb1032fb1f490ab1f19e91705e9f4a30928698a4fa2ba5233b","observation_id":"ba602f15-b11a-4f41-8949-a3946cc2f8ed","resolution":{"observed_at":"2026-08-07T04:51:11.158685Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"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"}],"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-08-07T04:51:11.144887Z","title":"Bayesian low-tubal-rank robust tensor factorization with multi-rank determination,","venue":null,"work_id":"e2fee651-4378-49e9-b4a1-396d464d0ffb","year":2019},"citing_paper":{"arxiv_id":"2506.09594","last_updated":"2025-07-08T09:43:58Z","snapshot_observed_at":"2026-08-07T04:42:13.488017Z","submitted_at":"2025-06-11T10:53:07Z","title":"Accelerating Large-Scale Regularized High-Order Tensor Recovery","version":2},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-07T04:51:10.078542Z"},"links":{"citing_paper":"/paper/2506.09594"},"observation_digest":"sha256:d3362ad797a99ae23808d9198fd6242dea4e2534ad9fa016e21c19922fd1b1cb","observation_id":"b0328857-07c7-47b3-9324-ea70c6ed40b4","resolution":{"observed_at":"2026-08-07T04:51:11.148656Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"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"}],"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-08-07T04:51:11.133539Z","title":"Tensor robust principal component analysis via tensor fibered rank and ℓp minimization,","venue":null,"work_id":"393a4e37-1799-4929-a2d6-2de2600eb547","year":2023},"citing_paper":{"arxiv_id":"2506.09594","last_updated":"2025-07-08T09:43:58Z","snapshot_observed_at":"2026-08-07T04:42:13.488017Z","submitted_at":"2025-06-11T10:53:07Z","title":"Accelerating Large-Scale Regularized High-Order Tensor Recovery","version":2},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-07T04:51:10.082171Z"},"links":{"citing_paper":"/paper/2506.09594"},"observation_digest":"sha256:be5daa377d29cd540fa686f80582b047508b34fa0169c25702d8bc3d553fd77d","observation_id":"e9a1c499-80d4-4627-ba47-5e9900121cd9","resolution":{"observed_at":"2026-08-07T04:51:11.137496Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"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"}],"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-08-07T04:51:11.121758Z","title":"Generalized nonconvex hyperspectral anomaly detection via background representation learning with dictionary con- straint,","venue":null,"work_id":"5b4b234f-fed0-4628-a781-b55b74892ce8","year":2024},"citing_paper":{"arxiv_id":"2506.09594","last_updated":"2025-07-08T09:43:58Z","snapshot_observed_at":"2026-08-07T04:42:13.488017Z","submitted_at":"2025-06-11T10:53:07Z","title":"Accelerating Large-Scale Regularized High-Order Tensor Recovery","version":2},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-07T04:51:10.086294Z"},"links":{"citing_paper":"/paper/2506.09594"},"observation_digest":"sha256:98736624cd7efaf50866816512bd02b94dfb126e51adb83ff31b78ba30bb6f8e","observation_id":"fa4af093-345e-49f2-827d-d0c615c2d78d","resolution":{"observed_at":"2026-08-07T04:51:11.125830Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"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"}],"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-08-07T04:51:11.110123Z","title":"Tensor ring decomposition-based generalized and efficient nonconvex approach for hyperspectral anomaly detection,","venue":null,"work_id":"abeb1ddd-7b14-4181-a639-2a641df756d6","year":2024},"citing_paper":{"arxiv_id":"2506.09594","last_updated":"2025-07-08T09:43:58Z","snapshot_observed_at":"2026-08-07T04:42:13.488017Z","submitted_at":"2025-06-11T10:53:07Z","title":"Accelerating Large-Scale Regularized High-Order Tensor Recovery","version":2},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-07T04:51:10.090612Z"},"links":{"citing_paper":"/paper/2506.09594"},"observation_digest":"sha256:6c43a3a11f9be70fd55227e52a7f49e7821e18d039b0a98782fe5c7d05c6846f","observation_id":"235128a0-b12a-4aa1-87b0-9e9b37923b93","resolution":{"observed_at":"2026-08-07T04:51:11.114146Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"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"}],"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-08-07T04:51:11.098398Z","title":"Tensor compressive sensing fused low-rankness and local-smoothness,","venue":null,"work_id":"73dda821-689e-46df-8e12-fdfb9846c821","year":2023},"citing_paper":{"arxiv_id":"2506.09594","last_updated":"2025-07-08T09:43:58Z","snapshot_observed_at":"2026-08-07T04:42:13.488017Z","submitted_at":"2025-06-11T10:53:07Z","title":"Accelerating Large-Scale Regularized High-Order Tensor Recovery","version":2},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-07T04:51:10.094749Z"},"links":{"citing_paper":"/paper/2506.09594"},"observation_digest":"sha256:8a08d1019ccffa4f77c26dbc87ca00ada021e6c39c3f0529a752685e3a1007a7","observation_id":"d6904f83-1f91-4192-b9be-8f26db127b4a","resolution":{"observed_at":"2026-08-07T04:51:11.102595Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"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"}],"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-08-07T04:51:11.087245Z","title":"Tensor recovery from binary measurements fused low-rankness and smoothness,","venue":null,"work_id":"79a6efec-37d4-4915-92be-8e018ff0eabc","year":2024},"citing_paper":{"arxiv_id":"2506.09594","last_updated":"2025-07-08T09:43:58Z","snapshot_observed_at":"2026-08-07T04:42:13.488017Z","submitted_at":"2025-06-11T10:53:07Z","title":"Accelerating Large-Scale Regularized High-Order Tensor Recovery","version":2},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-07T04:51:10.099196Z"},"links":{"citing_paper":"/paper/2506.09594"},"observation_digest":"sha256:e12c4f6da0a1205cd49e2a651ba42f314d59eabbb8e90be68cb80324a8feef0c","observation_id":"d2271f24-e1e7-46e3-82b6-3c7b9088ff72","resolution":{"observed_at":"2026-08-07T04:51:11.091110Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"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"}],"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-08-07T04:51:11.076486Z","title":"Low-tubal-rank tensor recovery via factorized gradient descent,","venue":null,"work_id":"0d8e48e4-3130-4006-bc6d-8e8540f2f73b","year":2024},"citing_paper":{"arxiv_id":"2506.09594","last_updated":"2025-07-08T09:43:58Z","snapshot_observed_at":"2026-08-07T04:42:13.488017Z","submitted_at":"2025-06-11T10:53:07Z","title":"Accelerating Large-Scale Regularized High-Order Tensor Recovery","version":2},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-07T04:51:10.103094Z"},"links":{"citing_paper":"/paper/2506.09594"},"observation_digest":"sha256:6c90e84b2300d4e561175a2e2e19b4d60e17957d5fd3b6776641b5b2a7bcd50e","observation_id":"a8aeba5f-99fc-4831-989c-9382f249e864","resolution":{"observed_at":"2026-08-07T04:51:11.080275Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:51:10.107040Z","title":"Generalized nonconvex approach for low-tubal-rank tensor recovery,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.09594","last_updated":"2025-07-08T09:43:58Z","snapshot_observed_at":"2026-08-07T04:42:13.488017Z","submitted_at":"2025-06-11T10:53:07Z","title":"Accelerating Large-Scale Regularized High-Order Tensor Recovery","version":2},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-07T04:51:10.107040Z"},"links":{"citing_paper":"/paper/2506.09594"},"observation_digest":"sha256:6f76bd865c9038ee0e97d695023565222395727c94ad0297e0377204b02d88a8","observation_id":"28e1a098-309c-45fc-828f-4e6b2f927c74","resolution":{"observed_at":"2026-08-07T04:51:10.107040Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:51:11.058941Z","title":"3-D array image data completion by tensor decomposition and nonconvex regularization approach,","venue":null,"work_id":"4d47822d-6e1e-407d-81af-0d31e34465e6","year":2022},"citing_paper":{"arxiv_id":"2506.09594","last_updated":"2025-07-08T09:43:58Z","snapshot_observed_at":"2026-08-07T04:42:13.488017Z","submitted_at":"2025-06-11T10:53:07Z","title":"Accelerating Large-Scale Regularized High-Order Tensor Recovery","version":2},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-07T04:51:10.110617Z"},"links":{"citing_paper":"/paper/2506.09594"},"observation_digest":"sha256:0c326f2d2a9082f6e9a0a973d737395aadf916c278c556ca7afb5bb263075ac8","observation_id":"d48b64e1-bec0-4ed4-bc51-c8bc629781e1","resolution":{"observed_at":"2026-08-07T04:51:11.062758Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"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"}],"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-08-07T04:51:11.047846Z","title":"Low-rank tensor completion via novel sparsity-inducing regularizers,","venue":null,"work_id":"cc8c0f60-c70f-4742-8742-d64507554f38","year":2024},"citing_paper":{"arxiv_id":"2506.09594","last_updated":"2025-07-08T09:43:58Z","snapshot_observed_at":"2026-08-07T04:42:13.488017Z","submitted_at":"2025-06-11T10:53:07Z","title":"Accelerating Large-Scale Regularized High-Order Tensor Recovery","version":2},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-07T04:51:10.114418Z"},"links":{"citing_paper":"/paper/2506.09594"},"observation_digest":"sha256:4bbf1e44091b2f3328a32e13cb383a43a1960441851ff6537a2fe20267843fa4","observation_id":"c475f663-06eb-4956-b0cf-0b3e8fde29c8","resolution":{"observed_at":"2026-08-07T04:51:11.052291Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"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"}],"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-08-07T04:51:11.036966Z","title":"Tensor recovery based on a novel non-convex function minimax logarithmic concave penalty function,","venue":null,"work_id":"eb29cad7-5adf-4bc1-96fd-f301b044364f","year":2023},"citing_paper":{"arxiv_id":"2506.09594","last_updated":"2025-07-08T09:43:58Z","snapshot_observed_at":"2026-08-07T04:42:13.488017Z","submitted_at":"2025-06-11T10:53:07Z","title":"Accelerating Large-Scale Regularized High-Order Tensor Recovery","version":2},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-07T04:51:10.118835Z"},"links":{"citing_paper":"/paper/2506.09594"},"observation_digest":"sha256:04f5e344a87a5a809aaa0d243d76ce9d6b2eeaeae35ffd51e2c5d9e20999fe61","observation_id":"b7cd3177-1849-41e4-b7e4-d9deb5fc7897","resolution":{"observed_at":"2026-08-07T04:51:11.040979Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"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"}],"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-08-07T04:51:11.025907Z","title":"Robust low-rank tensor recovery via nonconvex singular value minimization,","venue":null,"work_id":"13476b2e-5b18-458a-bc60-a7ef6ecc2f54","year":2020},"citing_paper":{"arxiv_id":"2506.09594","last_updated":"2025-07-08T09:43:58Z","snapshot_observed_at":"2026-08-07T04:42:13.488017Z","submitted_at":"2025-06-11T10:53:07Z","title":"Accelerating Large-Scale Regularized High-Order Tensor Recovery","version":2},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-07T04:51:10.122885Z"},"links":{"citing_paper":"/paper/2506.09594"},"observation_digest":"sha256:b63f9cd5ef364d0fe0c5a82eab03e4457c91e5fd005d509e4c3a0aff4e045cd1","observation_id":"94da1110-ab7d-4f6b-a546-97f7f5166f96","resolution":{"observed_at":"2026-08-07T04:51:11.030062Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"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"}],"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-08-07T04:51:11.015736Z","title":"Nonlocal robust tensor recovery with nonconvex regularization,","venue":null,"work_id":"f8f2bb3a-8f25-4897-bd3e-81bf03edec95","year":2021},"citing_paper":{"arxiv_id":"2506.09594","last_updated":"2025-07-08T09:43:58Z","snapshot_observed_at":"2026-08-07T04:42:13.488017Z","submitted_at":"2025-06-11T10:53:07Z","title":"Accelerating Large-Scale Regularized High-Order Tensor Recovery","version":2},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-07T04:51:10.127635Z"},"links":{"citing_paper":"/paper/2506.09594"},"observation_digest":"sha256:8e50dfd0aa090ce0f02c7c37d6968391186667f9c00351e011640ee3be25c719","observation_id":"f43dce9d-7c57-44f1-9ffb-aa6ebac65646","resolution":{"observed_at":"2026-08-07T04:51:11.019658Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"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"}],"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-08-07T04:51:11.005738Z","title":"Robust tensor completion: Equivalent surrogates, error bounds, and algorithms,","venue":null,"work_id":"21741035-9b2a-49a7-9430-7594ac8aef01","year":2022},"citing_paper":{"arxiv_id":"2506.09594","last_updated":"2025-07-08T09:43:58Z","snapshot_observed_at":"2026-08-07T04:42:13.488017Z","submitted_at":"2025-06-11T10:53:07Z","title":"Accelerating Large-Scale Regularized High-Order Tensor Recovery","version":2},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-07T04:51:10.131260Z"},"links":{"citing_paper":"/paper/2506.09594"},"observation_digest":"sha256:8c3668a05f57a9788c1e31dec556ad9d194ea8f489932ee7d9fae65abbfc9173","observation_id":"7060944d-a8ce-43f7-857e-7a3892ab4105","resolution":{"observed_at":"2026-08-07T04:51:11.009317Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"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"}],"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-08-07T04:51:10.994879Z","title":"Robust tensor completion via dictionary learning and generalized nonconvex regularization for visual data recovery,","venue":null,"work_id":"0b0fffc3-7f7e-4590-8ca4-8446fc2b33ab","year":2024},"citing_paper":{"arxiv_id":"2506.09594","last_updated":"2025-07-08T09:43:58Z","snapshot_observed_at":"2026-08-07T04:42:13.488017Z","submitted_at":"2025-06-11T10:53:07Z","title":"Accelerating Large-Scale Regularized High-Order Tensor Recovery","version":2},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-07T04:51:10.134731Z"},"links":{"citing_paper":"/paper/2506.09594"},"observation_digest":"sha256:6f4d0edb3f2b2e81966c09b92d69d53bf31e0fe6a57cc2a94095f027750223d2","observation_id":"2c8200c6-b497-4686-a10e-b1d6c43e6eeb","resolution":{"observed_at":"2026-08-07T04:51:10.999173Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"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"}],"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-08-07T04:51:10.984380Z","title":"Robust low- rank tensor reconstruction using high-order t-SVD,","venue":null,"work_id":"5b764c46-665f-4f7a-bc52-51899a3d8d44","year":2021},"citing_paper":{"arxiv_id":"2506.09594","last_updated":"2025-07-08T09:43:58Z","snapshot_observed_at":"2026-08-07T04:42:13.488017Z","submitted_at":"2025-06-11T10:53:07Z","title":"Accelerating Large-Scale Regularized High-Order Tensor Recovery","version":2},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-07T04:51:10.138073Z"},"links":{"citing_paper":"/paper/2506.09594"},"observation_digest":"sha256:2bbb46be29d07f41929590ca2f03c54d6203d4ab66dc459a4a23213d5b802492","observation_id":"bb5a66f9-0386-4306-a88d-c9abecc08858","resolution":{"observed_at":"2026-08-07T04:51:10.988248Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"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"}],"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-08-07T04:51:10.974508Z","title":"Robust high-order tensor recovery via nonconvex low-rank approximation,","venue":null,"work_id":"c2b7f9ae-834c-422d-87d7-ea71e0c72c88","year":2022},"citing_paper":{"arxiv_id":"2506.09594","last_updated":"2025-07-08T09:43:58Z","snapshot_observed_at":"2026-08-07T04:42:13.488017Z","submitted_at":"2025-06-11T10:53:07Z","title":"Accelerating Large-Scale Regularized High-Order Tensor Recovery","version":2},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-07T04:51:10.142169Z"},"links":{"citing_paper":"/paper/2506.09594"},"observation_digest":"sha256:9962732312c82d43afbd3dd142f9a5135fd037d9416121397daf880636f56f85","observation_id":"d9724d12-6342-4c06-b79f-ab939c997038","resolution":{"observed_at":"2026-08-07T04:51:10.978168Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"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"}],"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-08-07T04:51:10.964098Z","title":"Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions,","venue":null,"work_id":"5d74f945-076c-461e-b1ad-a07b8e287eba","year":2011},"citing_paper":{"arxiv_id":"2506.09594","last_updated":"2025-07-08T09:43:58Z","snapshot_observed_at":"2026-08-07T04:42:13.488017Z","submitted_at":"2025-06-11T10:53:07Z","title":"Accelerating Large-Scale Regularized High-Order Tensor Recovery","version":2},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-07T04:51:10.146206Z"},"links":{"citing_paper":"/paper/2506.09594"},"observation_digest":"sha256:9c756a9c6b089be00b085a075dd47efe97c38031efd310b0455ed1d86059e3bf","observation_id":"006ac68a-3684-4b47-bd3b-8c4d9af35a0c","resolution":{"observed_at":"2026-08-07T04:51:10.967879Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"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"}],"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-08-07T04:51:10.952132Z","title":"Randomized numerical linear algebra: Foundations and algorithms,","venue":null,"work_id":"d35f4d2a-7da5-4b95-b28f-c54869db877b","year":2020},"citing_paper":{"arxiv_id":"2506.09594","last_updated":"2025-07-08T09:43:58Z","snapshot_observed_at":"2026-08-07T04:42:13.488017Z","submitted_at":"2025-06-11T10:53:07Z","title":"Accelerating Large-Scale Regularized High-Order Tensor Recovery","version":2},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-07T04:51:10.149775Z"},"links":{"citing_paper":"/paper/2506.09594"},"observation_digest":"sha256:3400d2d85c4d9bd7a157e6ad6fa9050596dec049857ca2d9983e9fd899189b43","observation_id":"edc7fa2c-824c-4bd2-bdad-064bcb241a1e","resolution":{"observed_at":"2026-08-07T04:51:10.957095Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"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"}],"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-08-07T04:51:10.941483Z","title":"A randomized blocked algorithm for efficiently computing rank-revealing factorizations of matrices,","venue":null,"work_id":"1835b0a5-9fbc-4c9b-ad6b-edfc1ffffa1e","year":2016},"citing_paper":{"arxiv_id":"2506.09594","last_updated":"2025-07-08T09:43:58Z","snapshot_observed_at":"2026-08-07T04:42:13.488017Z","submitted_at":"2025-06-11T10:53:07Z","title":"Accelerating Large-Scale Regularized High-Order Tensor Recovery","version":2},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-07T04:51:10.153164Z"},"links":{"citing_paper":"/paper/2506.09594"},"observation_digest":"sha256:663a00df81171b0a357e0012ef440ec1536cfa35c8b4b4263cfab4d4611582b4","observation_id":"dc9c69ce-4b33-4da7-8318-1655cebd6394","resolution":{"observed_at":"2026-08-07T04:51:10.945230Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"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"}],"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-08-07T04:51:10.930549Z","title":"Practical sketching algorithms for low-rank matrix approximation,","venue":null,"work_id":"7fd5b82c-c325-4497-8070-343740d4525d","year":2017},"citing_paper":{"arxiv_id":"2506.09594","last_updated":"2025-07-08T09:43:58Z","snapshot_observed_at":"2026-08-07T04:42:13.488017Z","submitted_at":"2025-06-11T10:53:07Z","title":"Accelerating Large-Scale Regularized High-Order Tensor Recovery","version":2},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-07T04:51:10.157334Z"},"links":{"citing_paper":"/paper/2506.09594"},"observation_digest":"sha256:4418f434b4b14460e928211efadf3fbfdcd59ef8da4437e2d0c972a2d5b0e5f9","observation_id":"eb30bc3e-d636-4b56-a350-4f70d91aa8a6","resolution":{"observed_at":"2026-08-07T04:51:10.935255Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"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"}],"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-08-07T04:51:10.920303Z","title":"Efficient randomized algorithms for the fixed-precision low-rank matrix approximation,","venue":null,"work_id":"d8bc5d50-ebef-43f9-b0dd-94ea4fed3aa7","year":2018},"citing_paper":{"arxiv_id":"2506.09594","last_updated":"2025-07-08T09:43:58Z","snapshot_observed_at":"2026-08-07T04:42:13.488017Z","submitted_at":"2025-06-11T10:53:07Z","title":"Accelerating Large-Scale Regularized High-Order Tensor Recovery","version":2},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-07T04:51:10.161315Z"},"links":{"citing_paper":"/paper/2506.09594"},"observation_digest":"sha256:a34f28063fc15826395fc89b7b32a4dd299b683e2edd8d5702e939c4c7d8932f","observation_id":"bf1726ee-862c-4634-bb87-7a6a333fcd31","resolution":{"observed_at":"2026-08-07T04:51:10.923956Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"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"}],"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-08-07T04:51:10.909293Z","title":"Randomized projection for rank-revealing matrix factorizations and low-rank approximations,","venue":null,"work_id":"80b2cd69-df30-4b34-91f3-32efe6172cc1","year":2020},"citing_paper":{"arxiv_id":"2506.09594","last_updated":"2025-07-08T09:43:58Z","snapshot_observed_at":"2026-08-07T04:42:13.488017Z","submitted_at":"2025-06-11T10:53:07Z","title":"Accelerating Large-Scale Regularized High-Order Tensor Recovery","version":2},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-08-07T04:51:10.165285Z"},"links":{"citing_paper":"/paper/2506.09594"},"observation_digest":"sha256:4e203cb27a8a544c6126473b18958966b44836fc83059bddb4d581b0dfde8cda","observation_id":"f8b8e6e8-5e8e-438e-b5d9-dfc1900a6bfd","resolution":{"observed_at":"2026-08-07T04:51:10.914118Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"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"}],"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-08-07T04:51:10.899243Z","title":"A block bidiagonalization method for fixed-accuracy low- rank matrix approximation,","venue":null,"work_id":"43ba2b31-fd0c-4edf-b4a8-e488832f7f82","year":2022},"citing_paper":{"arxiv_id":"2506.09594","last_updated":"2025-07-08T09:43:58Z","snapshot_observed_at":"2026-08-07T04:42:13.488017Z","submitted_at":"2025-06-11T10:53:07Z","title":"Accelerating Large-Scale Regularized High-Order Tensor Recovery","version":2},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-08-07T04:51:10.168707Z"},"links":{"citing_paper":"/paper/2506.09594"},"observation_digest":"sha256:32c478a1b1bcf7ae60193ffa780cb1b7f8ba26d519f6085aedbf07e4d1db6a3b","observation_id":"288f0909-713e-47cb-b7e9-53a8732de5f0","resolution":{"observed_at":"2026-08-07T04:51:10.903129Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"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"}],"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-08-07T04:51:10.889518Z","title":"An improved analysis and unified perspective on deterministic and randomized low-rank matrix approximation,","venue":null,"work_id":"0d6d4baf-979d-4f15-b9e3-a0491b792fbe","year":2023},"citing_paper":{"arxiv_id":"2506.09594","last_updated":"2025-07-08T09:43:58Z","snapshot_observed_at":"2026-08-07T04:42:13.488017Z","submitted_at":"2025-06-11T10:53:07Z","title":"Accelerating Large-Scale Regularized High-Order Tensor Recovery","version":2},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-08-07T04:51:10.172998Z"},"links":{"citing_paper":"/paper/2506.09594"},"observation_digest":"sha256:4d2300a3c7835d8b43aecfaa65dece7fb07d589b187dceeda95e6260ee05ceb8","observation_id":"aa813abc-f3fb-4259-9b7f-7846292b2558","resolution":{"observed_at":"2026-08-07T04:51:10.893124Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2306.12418","last_updated":"2023-09-22T02:57:04Z","snapshot_observed_at":"2026-07-06T15:45:13.905037Z","submitted_at":"2023-06-21T17:57:57Z","title":"Randomized algorithms for low-rank matrix approximation: Design, analysis, and applications","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2306.12418","snapshot_observed_at":"2026-08-07T04:51:10.176993Z","title":"Randomized algorithms for low- rank matrix approximation: Design, analysis, and applications,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.09594","last_updated":"2025-07-08T09:43:58Z","snapshot_observed_at":"2026-08-07T04:42:13.488017Z","submitted_at":"2025-06-11T10:53:07Z","title":"Accelerating Large-Scale Regularized High-Order Tensor Recovery","version":2},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-08-07T04:51:10.176993Z"},"links":{"cited_paper":"/paper/2306.12418","citing_paper":"/paper/2506.09594"},"observation_digest":"sha256:da4e55be616db9d585a4090cbe999b61f5098c1a0516010c42222dcaa18fa9ad","observation_id":"5485c390-40e7-4350-b1a0-df665649b8c4","resolution":{"observed_at":"2026-08-07T04:51:10.176993Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:51:10.879919Z","title":"Block- randomized stochastic proximal gradient for low-rank tensor factor- ization,","venue":null,"work_id":"7c05dbca-1811-4501-a027-b589a016b0b8","year":2020},"citing_paper":{"arxiv_id":"2506.09594","last_updated":"2025-07-08T09:43:58Z","snapshot_observed_at":"2026-08-07T04:42:13.488017Z","submitted_at":"2025-06-11T10:53:07Z","title":"Accelerating Large-Scale Regularized High-Order Tensor Recovery","version":2},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-08-07T04:51:10.180657Z"},"links":{"citing_paper":"/paper/2506.09594"},"observation_digest":"sha256:6bdf2da83e7f45c853603bf1b37831bc2dd5c8ee1e1057b000f039f3c171e9d4","observation_id":"e886ca86-8a8e-409f-82c8-f59141f51b39","resolution":{"observed_at":"2026-08-07T04:51:10.883349Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"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"}],"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-08-07T04:51:10.870064Z","title":"Practical leverage-based sampling for low-rank tensor decomposition,","venue":null,"work_id":"9659ff30-ae49-4744-b25a-299ca7dfe06e","year":2022},"citing_paper":{"arxiv_id":"2506.09594","last_updated":"2025-07-08T09:43:58Z","snapshot_observed_at":"2026-08-07T04:42:13.488017Z","submitted_at":"2025-06-11T10:53:07Z","title":"Accelerating Large-Scale Regularized High-Order Tensor Recovery","version":2},"reference_index":70,"source":"pdf_text","source_observed_at":"2026-08-07T04:51:10.184340Z"},"links":{"citing_paper":"/paper/2506.09594"},"observation_digest":"sha256:2a417f3998ecab1e7edd44e74196115f02cb28726d76b088dbb1e36fa61e2374","observation_id":"8ccb5aaa-9899-46db-b813-19eb21272615","resolution":{"observed_at":"2026-08-07T04:51:10.873616Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"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"}],"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-08-07T04:51:10.859344Z","title":"Randomized sampling techniques based low-tubal-rank plus sparse tensor recovery,","venue":null,"work_id":"4ba4bb90-d968-4b9b-a385-e1322393de41","year":2023},"citing_paper":{"arxiv_id":"2506.09594","last_updated":"2025-07-08T09:43:58Z","snapshot_observed_at":"2026-08-07T04:42:13.488017Z","submitted_at":"2025-06-11T10:53:07Z","title":"Accelerating Large-Scale Regularized High-Order Tensor Recovery","version":2},"reference_index":71,"source":"pdf_text","source_observed_at":"2026-08-07T04:51:10.188711Z"},"links":{"citing_paper":"/paper/2506.09594"},"observation_digest":"sha256:de913c43a3d4bd85810c67c50b4ff0208b101dbb38246677609dfb78413c4633","observation_id":"b275fa4f-d125-44ef-a770-5297b3856ca2","resolution":{"observed_at":"2026-08-07T04:51:10.863110Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"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"}],"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-08-07T04:51:10.849623Z","title":"Fast randomized algorithms for t-product based tensor operations and decompositions with applications to imaging data,","venue":null,"work_id":"fdd55cf8-1649-4391-a74b-dcb195fa5e08","year":2018},"citing_paper":{"arxiv_id":"2506.09594","last_updated":"2025-07-08T09:43:58Z","snapshot_observed_at":"2026-08-07T04:42:13.488017Z","submitted_at":"2025-06-11T10:53:07Z","title":"Accelerating Large-Scale Regularized High-Order Tensor Recovery","version":2},"reference_index":72,"source":"pdf_text","source_observed_at":"2026-08-07T04:51:10.192762Z"},"links":{"citing_paper":"/paper/2506.09594"},"observation_digest":"sha256:931eb159fed83f70c5a099318173a8dd274039a743f5de3ba0d1e732c46c8ef1","observation_id":"40429516-9776-4d3d-93db-cb61c66012ad","resolution":{"observed_at":"2026-08-07T04:51:10.853122Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"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"}],"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-08-07T04:51:10.839945Z","title":"A randomized tensor singular value decomposition based on the t-product,","venue":null,"work_id":"c853f143-9e05-4cce-989f-467cd2e394d2","year":2018},"citing_paper":{"arxiv_id":"2506.09594","last_updated":"2025-07-08T09:43:58Z","snapshot_observed_at":"2026-08-07T04:42:13.488017Z","submitted_at":"2025-06-11T10:53:07Z","title":"Accelerating Large-Scale Regularized High-Order Tensor Recovery","version":2},"reference_index":73,"source":"pdf_text","source_observed_at":"2026-08-07T04:51:10.196454Z"},"links":{"citing_paper":"/paper/2506.09594"},"observation_digest":"sha256:0b55539c2938ddcf07e22e25718627c6e048892677e9ea14b35c53206e8665c0","observation_id":"1832c034-168e-4b9b-8e2b-f0c8a6938d70","resolution":{"observed_at":"2026-08-07T04:51:10.843344Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"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"}],"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-08-07T04:51:10.829345Z","title":"Fast randomized tensor singular value thresholding for low-rank tensor optimization,","venue":null,"work_id":"99586c05-b67b-4466-ac0d-aa6b3ff9aed3","year":2022},"citing_paper":{"arxiv_id":"2506.09594","last_updated":"2025-07-08T09:43:58Z","snapshot_observed_at":"2026-08-07T04:42:13.488017Z","submitted_at":"2025-06-11T10:53:07Z","title":"Accelerating Large-Scale Regularized High-Order Tensor Recovery","version":2},"reference_index":74,"source":"pdf_text","source_observed_at":"2026-08-07T04:51:10.200413Z"},"links":{"citing_paper":"/paper/2506.09594"},"observation_digest":"sha256:243e1c9516db4ece14e99f39c6b26d4d705563596b4e2d72e80f276ef3c3797f","observation_id":"e931d6e5-01a5-4b73-a808-a61b88b26f34","resolution":{"observed_at":"2026-08-07T04:51:10.832753Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"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"}],"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-08-07T04:51:10.817856Z","title":"The computation of low multilinear rank approximations of tensors via power scheme and random projection,","venue":null,"work_id":"c387c304-c3f5-4d15-9580-e259031bb705","year":2020},"citing_paper":{"arxiv_id":"2506.09594","last_updated":"2025-07-08T09:43:58Z","snapshot_observed_at":"2026-08-07T04:42:13.488017Z","submitted_at":"2025-06-11T10:53:07Z","title":"Accelerating Large-Scale Regularized High-Order Tensor Recovery","version":2},"reference_index":75,"source":"pdf_text","source_observed_at":"2026-08-07T04:51:10.203860Z"},"links":{"citing_paper":"/paper/2506.09594"},"observation_digest":"sha256:d09c7b7d2b60480492460abed6e1fd247778a751218f4403593f5148b97ef8c3","observation_id":"029e13fa-f963-41dd-b214-0877133fcd47","resolution":{"observed_at":"2026-08-07T04:51:10.822386Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"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"}],"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-08-07T04:51:10.808224Z","title":"Randomized algorithms for the low multilinear rank approxi- mations of tensors,","venue":null,"work_id":"a15d374f-a802-4f19-89cf-7c271018ea33","year":2021},"citing_paper":{"arxiv_id":"2506.09594","last_updated":"2025-07-08T09:43:58Z","snapshot_observed_at":"2026-08-07T04:42:13.488017Z","submitted_at":"2025-06-11T10:53:07Z","title":"Accelerating Large-Scale Regularized High-Order Tensor Recovery","version":2},"reference_index":76,"source":"pdf_text","source_observed_at":"2026-08-07T04:51:10.207464Z"},"links":{"citing_paper":"/paper/2506.09594"},"observation_digest":"sha256:8225d317b8b8989d75a7753bed79df6e3294ba217ded487b5544ed84c22e1e80","observation_id":"69fcf6ab-b6d3-4bb4-ac22-8d37efa73c49","resolution":{"observed_at":"2026-08-07T04:51:10.811839Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"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"}],"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-08-07T04:51:10.797344Z","title":"An efficient randomized algorithm for computing the approx- imate tucker decomposition,","venue":null,"work_id":"ab49f5fd-a61a-44a3-a8e5-46be6973253d","year":2021},"citing_paper":{"arxiv_id":"2506.09594","last_updated":"2025-07-08T09:43:58Z","snapshot_observed_at":"2026-08-07T04:42:13.488017Z","submitted_at":"2025-06-11T10:53:07Z","title":"Accelerating Large-Scale Regularized High-Order Tensor Recovery","version":2},"reference_index":77,"source":"pdf_text","source_observed_at":"2026-08-07T04:51:10.210729Z"},"links":{"citing_paper":"/paper/2506.09594"},"observation_digest":"sha256:0d23fab61a5bc1b93c5fade656952ae746623777f11eca0169a0b26669360fc2","observation_id":"61044641-c496-435f-b4b5-a274b5d84ec8","resolution":{"observed_at":"2026-08-07T04:51:10.801536Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"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"}],"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-08-07T04:51:10.786193Z","title":"Randomized algorithms for the com- putation of multilinear rank- (µ1, µ2, µ3) approximations,","venue":null,"work_id":"7009a972-8e64-43f7-9b84-1daa8df6267c","year":2023},"citing_paper":{"arxiv_id":"2506.09594","last_updated":"2025-07-08T09:43:58Z","snapshot_observed_at":"2026-08-07T04:42:13.488017Z","submitted_at":"2025-06-11T10:53:07Z","title":"Accelerating Large-Scale Regularized High-Order Tensor Recovery","version":2},"reference_index":78,"source":"pdf_text","source_observed_at":"2026-08-07T04:51:10.214296Z"},"links":{"citing_paper":"/paper/2506.09594"},"observation_digest":"sha256:4671c09082dc8ef6a493b33d9c5610ead998bce4d1d5f4e535a5b075c4e0ac9d","observation_id":"ce3252ca-bb5b-4156-b382-d8553d007416","resolution":{"observed_at":"2026-08-07T04:51:10.790393Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"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"}],"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-08-07T04:51:10.774997Z","title":"Practical sketching algorithms for low-rank tucker approximation of large tensors,","venue":null,"work_id":"0742c783-6cdd-43d1-a205-cb9d10f03927","year":2023},"citing_paper":{"arxiv_id":"2506.09594","last_updated":"2025-07-08T09:43:58Z","snapshot_observed_at":"2026-08-07T04:42:13.488017Z","submitted_at":"2025-06-11T10:53:07Z","title":"Accelerating Large-Scale Regularized High-Order Tensor Recovery","version":2},"reference_index":79,"source":"pdf_text","source_observed_at":"2026-08-07T04:51:10.217600Z"},"links":{"citing_paper":"/paper/2506.09594"},"observation_digest":"sha256:d33e412a79341b881162182b13a326942ecaac041065dbcb54c80a2143577092","observation_id":"487dd68d-7fd3-44ff-b328-8534547bf1d6","resolution":{"observed_at":"2026-08-07T04:51:10.779789Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"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"}],"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-08-07T04:51:10.764500Z","title":"Streaming coresets for symmetric tensor factorization,","venue":null,"work_id":"781386df-351d-4dfa-bf09-843f242743c5","year":2020},"citing_paper":{"arxiv_id":"2506.09594","last_updated":"2025-07-08T09:43:58Z","snapshot_observed_at":"2026-08-07T04:42:13.488017Z","submitted_at":"2025-06-11T10:53:07Z","title":"Accelerating Large-Scale Regularized High-Order Tensor Recovery","version":2},"reference_index":80,"source":"pdf_text","source_observed_at":"2026-08-07T04:51:10.220697Z"},"links":{"citing_paper":"/paper/2506.09594"},"observation_digest":"sha256:19ce4ffe1ba3552a8c1ee93c205b0882c065b57ab7a815870f1505bff91b8359","observation_id":"bf7e9306-d426-4a36-a0a1-3fb47d8e64f3","resolution":{"observed_at":"2026-08-07T04:51:10.768054Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"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"}],"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-08-07T04:51:10.753326Z","title":"Tensor decompositions and applica- tions,","venue":null,"work_id":"7df14679-f6ac-42a9-b648-5b0a4ddadaef","year":2009},"citing_paper":{"arxiv_id":"2506.09594","last_updated":"2025-07-08T09:43:58Z","snapshot_observed_at":"2026-08-07T04:42:13.488017Z","submitted_at":"2025-06-11T10:53:07Z","title":"Accelerating Large-Scale Regularized High-Order Tensor Recovery","version":2},"reference_index":81,"source":"pdf_text","source_observed_at":"2026-08-07T04:51:10.224090Z"},"links":{"citing_paper":"/paper/2506.09594"},"observation_digest":"sha256:5b2545f961c2ae9599a70b0c8a355aedf4e0804f1c3ec9156cf0ad0edfb9a0b3","observation_id":"51a31128-0501-4893-9791-2048b0bbfe59","resolution":{"observed_at":"2026-08-07T04:51:10.756800Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"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"}],"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-08-07T04:51:10.743099Z","title":"An order- p tensor factorization with applications in imaging,","venue":null,"work_id":"1e0c0cbe-6a94-4c1e-adcd-be9dc91d121f","year":2013},"citing_paper":{"arxiv_id":"2506.09594","last_updated":"2025-07-08T09:43:58Z","snapshot_observed_at":"2026-08-07T04:42:13.488017Z","submitted_at":"2025-06-11T10:53:07Z","title":"Accelerating Large-Scale Regularized High-Order Tensor Recovery","version":2},"reference_index":82,"source":"pdf_text","source_observed_at":"2026-08-07T04:51:10.227641Z"},"links":{"citing_paper":"/paper/2506.09594"},"observation_digest":"sha256:2bc063c8a5110f0d035e53b043cfde802b398bbcb5b707e71c9a973fd012199c","observation_id":"8cf1581d-63f5-4b9a-8dd1-a10e5044b577","resolution":{"observed_at":"2026-08-07T04:51:10.746707Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"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"}],"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-08-07T04:51:10.732838Z","title":"High dimensional statistical estimation under uniformly dithered one-bit quantization,","venue":null,"work_id":"a9947cca-c2fe-4f95-85eb-1e63f7f05b53","year":2023},"citing_paper":{"arxiv_id":"2506.09594","last_updated":"2025-07-08T09:43:58Z","snapshot_observed_at":"2026-08-07T04:42:13.488017Z","submitted_at":"2025-06-11T10:53:07Z","title":"Accelerating Large-Scale Regularized High-Order Tensor Recovery","version":2},"reference_index":83,"source":"pdf_text","source_observed_at":"2026-08-07T04:51:10.231119Z"},"links":{"citing_paper":"/paper/2506.09594"},"observation_digest":"sha256:a6be2c0980ca3ffed4ffc297ae4c9f128f4dc9cfde5ffbb5ad591b6e17fee798","observation_id":"57e08796-8bcb-49e4-8741-de532291cf43","resolution":{"observed_at":"2026-08-07T04:51:10.736601Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"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"}],"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-08-07T04:51:10.721119Z","title":"A new truncation strategy for the higher-order singular value decomposition,","venue":null,"work_id":"aa560be6-386b-49a4-8d21-248857272688","year":2012},"citing_paper":{"arxiv_id":"2506.09594","last_updated":"2025-07-08T09:43:58Z","snapshot_observed_at":"2026-08-07T04:42:13.488017Z","submitted_at":"2025-06-11T10:53:07Z","title":"Accelerating Large-Scale Regularized High-Order Tensor Recovery","version":2},"reference_index":84,"source":"pdf_text","source_observed_at":"2026-08-07T04:51:10.235464Z"},"links":{"citing_paper":"/paper/2506.09594"},"observation_digest":"sha256:f8ef912153cb6670f48fdce76eda81aff56274f6892b07acb11990bb42ddc4f0","observation_id":"567362fa-6703-4af9-b6e9-0ddcee836713","resolution":{"observed_at":"2026-08-07T04:51:10.725019Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"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"}],"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-08-07T04:51:10.710010Z","title":"Randomized algorithms for low-rank tensor decompositions in the tucker format,","venue":null,"work_id":"7a0512dc-3ea0-488f-9522-ba94b01816a1","year":2020},"citing_paper":{"arxiv_id":"2506.09594","last_updated":"2025-07-08T09:43:58Z","snapshot_observed_at":"2026-08-07T04:42:13.488017Z","submitted_at":"2025-06-11T10:53:07Z","title":"Accelerating Large-Scale Regularized High-Order Tensor Recovery","version":2},"reference_index":85,"source":"pdf_text","source_observed_at":"2026-08-07T04:51:10.239076Z"},"links":{"citing_paper":"/paper/2506.09594"},"observation_digest":"sha256:7db82e9f8fed4cb8983191f91e2f4fcc3be3822a2ea14a113900baf652148fe3","observation_id":"d5524155-92f9-49db-b9a0-d36704215d2f","resolution":{"observed_at":"2026-08-07T04:51:10.714045Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"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"}],"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-08-07T04:51:10.699686Z","title":"Randomized block krylov methods for stronger and faster approximate singular value decomposition,","venue":null,"work_id":"27976e15-7a66-4545-9352-2203af74700c","year":2015},"citing_paper":{"arxiv_id":"2506.09594","last_updated":"2025-07-08T09:43:58Z","snapshot_observed_at":"2026-08-07T04:42:13.488017Z","submitted_at":"2025-06-11T10:53:07Z","title":"Accelerating Large-Scale Regularized High-Order Tensor Recovery","version":2},"reference_index":86,"source":"pdf_text","source_observed_at":"2026-08-07T04:51:10.242857Z"},"links":{"citing_paper":"/paper/2506.09594"},"observation_digest":"sha256:2942ae7a36081094411e86d411dce60123aac99811e5713ae5382818350a2fbf","observation_id":"0f6d79c8-e64e-4036-86ca-0edab599a944","resolution":{"observed_at":"2026-08-07T04:51:10.703232Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"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"}],"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-08-07T04:51:10.689319Z","title":"Superlinear convergence of randomized block Lanczos algorithm,","venue":null,"work_id":"480320bc-d4ce-47d8-a2b2-77e8b0cec8e2","year":2018},"citing_paper":{"arxiv_id":"2506.09594","last_updated":"2025-07-08T09:43:58Z","snapshot_observed_at":"2026-08-07T04:42:13.488017Z","submitted_at":"2025-06-11T10:53:07Z","title":"Accelerating Large-Scale Regularized High-Order Tensor Recovery","version":2},"reference_index":87,"source":"pdf_text","source_observed_at":"2026-08-07T04:51:10.246291Z"},"links":{"citing_paper":"/paper/2506.09594"},"observation_digest":"sha256:b52662e8de6c6a027f982d6051dcb9b7d9f0c2ec19b0b6e46febe64b7ee672a9","observation_id":"03261402-7526-4e86-acfb-a6851f82930a","resolution":{"observed_at":"2026-08-07T04:51:10.692988Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"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"}],"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-08-07T04:51:10.679486Z","title":"On the unreasonable effectiveness of single vector krylov methods for low-rank approximation,","venue":null,"work_id":"cecec4ac-bec6-4f12-aa4e-fd88f3c09918","year":2024},"citing_paper":{"arxiv_id":"2506.09594","last_updated":"2025-07-08T09:43:58Z","snapshot_observed_at":"2026-08-07T04:42:13.488017Z","submitted_at":"2025-06-11T10:53:07Z","title":"Accelerating Large-Scale Regularized High-Order Tensor Recovery","version":2},"reference_index":88,"source":"pdf_text","source_observed_at":"2026-08-07T04:51:10.250352Z"},"links":{"citing_paper":"/paper/2506.09594"},"observation_digest":"sha256:6e2ef49eb6e251f9d8d3ebff6064c865e4e458ec682ac66d04d2c5c6b052e71b","observation_id":"2d803f53-3554-47a0-a47f-bed3aaf965f3","resolution":{"observed_at":"2026-08-07T04:51:10.683013Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"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"}],"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-08-07T04:51:10.669094Z","title":"Tensor nuclear norm-based low-rank approximation with total variation regularization,","venue":null,"work_id":"e17f2073-ab2c-497d-8062-cbb63c2abd8e","year":2018},"citing_paper":{"arxiv_id":"2506.09594","last_updated":"2025-07-08T09:43:58Z","snapshot_observed_at":"2026-08-07T04:42:13.488017Z","submitted_at":"2025-06-11T10:53:07Z","title":"Accelerating Large-Scale Regularized High-Order Tensor Recovery","version":2},"reference_index":89,"source":"pdf_text","source_observed_at":"2026-08-07T04:51:10.253876Z"},"links":{"citing_paper":"/paper/2506.09594"},"observation_digest":"sha256:b0d47e9cf2926c69b6ae37aa06c267fa37c08bb6da7caee1700d32b12d922e68","observation_id":"44356f56-2d07-42eb-b628-9cff9bdc7d71","resolution":{"observed_at":"2026-08-07T04:51:10.672738Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:51:10.257391Z","title":"Robust low-rank tensor completion via transformed tensor nuclear norm with total variation regularization,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.09594","last_updated":"2025-07-08T09:43:58Z","snapshot_observed_at":"2026-08-07T04:42:13.488017Z","submitted_at":"2025-06-11T10:53:07Z","title":"Accelerating Large-Scale Regularized High-Order Tensor Recovery","version":2},"reference_index":90,"source":"pdf_text","source_observed_at":"2026-08-07T04:51:10.257391Z"},"links":{"citing_paper":"/paper/2506.09594"},"observation_digest":"sha256:8b7f43274775cf07d1b4f718927f387a91009f5760c256cccf846e216c51e863","observation_id":"290686e8-5f6e-427d-bb90-245233e5e208","resolution":{"observed_at":"2026-08-07T04:51:10.257391Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:51:10.652474Z","title":"Waveshrink with firm shrinkage,","venue":null,"work_id":"95cf5988-87d5-42bc-b523-02cd8a3bd244","year":1997},"citing_paper":{"arxiv_id":"2506.09594","last_updated":"2025-07-08T09:43:58Z","snapshot_observed_at":"2026-08-07T04:42:13.488017Z","submitted_at":"2025-06-11T10:53:07Z","title":"Accelerating Large-Scale Regularized High-Order Tensor Recovery","version":2},"reference_index":91,"source":"pdf_text","source_observed_at":"2026-08-07T04:51:10.260433Z"},"links":{"citing_paper":"/paper/2506.09594"},"observation_digest":"sha256:45b7fb76d54163b5acfb836b6f1bf52ec0f72fb3a5b567dbf845818618d24195","observation_id":"681ee55f-24ad-498a-9ba0-f3110cbaa3ed","resolution":{"observed_at":"2026-08-07T04:51:10.656830Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"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"}],"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-08-07T04:51:10.641932Z","title":"A general iterative shrinkage and thresholding algorithm for non-convex regularized opti- mization problems,","venue":null,"work_id":"1c5270aa-11f1-415e-810f-d56e2c12e1de","year":2013},"citing_paper":{"arxiv_id":"2506.09594","last_updated":"2025-07-08T09:43:58Z","snapshot_observed_at":"2026-08-07T04:42:13.488017Z","submitted_at":"2025-06-11T10:53:07Z","title":"Accelerating Large-Scale Regularized High-Order Tensor Recovery","version":2},"reference_index":92,"source":"pdf_text","source_observed_at":"2026-08-07T04:51:10.264459Z"},"links":{"citing_paper":"/paper/2506.09594"},"observation_digest":"sha256:a083b4aeabc3b325c72ba05be3819b67ae251a2ae4c673e02e821d5acf48971a","observation_id":"7ff4f662-ea31-4f3e-ac23-2887058e675a","resolution":{"observed_at":"2026-08-07T04:51:10.645784Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"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"}],"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-08-07T04:51:10.631103Z","title":"On ℓq optimization and matrix comple- tion,","venue":null,"work_id":"c1b3f234-7d3d-4e37-a285-2ec10b2441d0","year":2012},"citing_paper":{"arxiv_id":"2506.09594","last_updated":"2025-07-08T09:43:58Z","snapshot_observed_at":"2026-08-07T04:42:13.488017Z","submitted_at":"2025-06-11T10:53:07Z","title":"Accelerating Large-Scale Regularized High-Order Tensor Recovery","version":2},"reference_index":93,"source":"pdf_text","source_observed_at":"2026-08-07T04:51:10.269374Z"},"links":{"citing_paper":"/paper/2506.09594"},"observation_digest":"sha256:0aed87f6a597a05742c48d13b879afe3a3dbc6c3ebf71dab1bc156efbb7853a2","observation_id":"df640669-746e-4f8b-8349-a52cb7410f38","resolution":{"observed_at":"2026-08-07T04:51:10.634757Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"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"}],"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-08-07T04:51:10.618769Z","title":"Variable selection via nonconcave penalized like- lihood and its oracle properties,","venue":null,"work_id":"237cdc34-1a4b-4e6c-9daa-30580001035d","year":2001},"citing_paper":{"arxiv_id":"2506.09594","last_updated":"2025-07-08T09:43:58Z","snapshot_observed_at":"2026-08-07T04:42:13.488017Z","submitted_at":"2025-06-11T10:53:07Z","title":"Accelerating Large-Scale Regularized High-Order Tensor Recovery","version":2},"reference_index":94,"source":"pdf_text","source_observed_at":"2026-08-07T04:51:10.272682Z"},"links":{"citing_paper":"/paper/2506.09594"},"observation_digest":"sha256:13541684833c18c041a9976dac555d3593f4c9a18a054f45d2d3d0a64c2e35f1","observation_id":"5c06d85a-c529-44e5-86df-2bf777faeec7","resolution":{"observed_at":"2026-08-07T04:51:10.622672Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:51:10.276198Z","title":"Nearly unbiased variable selection under minimax concave penalty,","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2506.09594","last_updated":"2025-07-08T09:43:58Z","snapshot_observed_at":"2026-08-07T04:42:13.488017Z","submitted_at":"2025-06-11T10:53:07Z","title":"Accelerating Large-Scale Regularized High-Order Tensor Recovery","version":2},"reference_index":95,"source":"pdf_text","source_observed_at":"2026-08-07T04:51:10.276198Z"},"links":{"citing_paper":"/paper/2506.09594"},"observation_digest":"sha256:bf2ded3500d96fa2979b8c7f6eb9e77626b848b130715f7d79349662f761544e","observation_id":"1a0d1273-6c1c-455b-9b26-692db1e69c71","resolution":{"observed_at":"2026-08-07T04:51:10.276198Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:51:10.601869Z","title":"Matrix completion via schatten capped p norm,","venue":null,"work_id":"964ba8b4-31f4-48cf-b1fd-fd9dd8869ae2","year":2020},"citing_paper":{"arxiv_id":"2506.09594","last_updated":"2025-07-08T09:43:58Z","snapshot_observed_at":"2026-08-07T04:42:13.488017Z","submitted_at":"2025-06-11T10:53:07Z","title":"Accelerating Large-Scale Regularized High-Order Tensor Recovery","version":2},"reference_index":96,"source":"pdf_text","source_observed_at":"2026-08-07T04:51:10.280291Z"},"links":{"citing_paper":"/paper/2506.09594"},"observation_digest":"sha256:2f1df7ec3d6f0330236ad91a4a2e678bfd554985de0c1e8cf29e06596787be18","observation_id":"8be9b0a8-d107-496b-aed0-94c7a1f9d189","resolution":{"observed_at":"2026-08-07T04:51:10.605754Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"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"}],"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-08-07T04:51:10.591210Z","title":"Group sparse optimization for images recovery using capped folded concave functions,","venue":null,"work_id":"5229ab04-b0ad-4715-8716-67e424ffc37a","year":2021},"citing_paper":{"arxiv_id":"2506.09594","last_updated":"2025-07-08T09:43:58Z","snapshot_observed_at":"2026-08-07T04:42:13.488017Z","submitted_at":"2025-06-11T10:53:07Z","title":"Accelerating Large-Scale Regularized High-Order Tensor Recovery","version":2},"reference_index":97,"source":"pdf_text","source_observed_at":"2026-08-07T04:51:10.284224Z"},"links":{"citing_paper":"/paper/2506.09594"},"observation_digest":"sha256:63514a1a27d7c7d5c7a60679b010c5512283daf068b638bef7f4d2a0f0fbad77","observation_id":"d4738b8b-6072-47e3-ba54-3a08be1f7a24","resolution":{"observed_at":"2026-08-07T04:51:10.595148Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"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"}],"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-08-07T04:51:10.581037Z","title":"Patched-tube unitary transform for robust tensor completion,","venue":null,"work_id":"4d0d6c34-7fc9-42e0-ae7f-1019b16768d0","year":2020},"citing_paper":{"arxiv_id":"2506.09594","last_updated":"2025-07-08T09:43:58Z","snapshot_observed_at":"2026-08-07T04:42:13.488017Z","submitted_at":"2025-06-11T10:53:07Z","title":"Accelerating Large-Scale Regularized High-Order Tensor Recovery","version":2},"reference_index":98,"source":"pdf_text","source_observed_at":"2026-08-07T04:51:10.287634Z"},"links":{"citing_paper":"/paper/2506.09594"},"observation_digest":"sha256:ad0d7ec92d470b0df85c8cbc601b6d78af8baf4cd89b9332f85f65affced5269","observation_id":"86ad5f37-d1ad-44aa-81e5-6a2a1f236fbc","resolution":{"observed_at":"2026-08-07T04:51:10.584781Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"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"}],"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-08-07T04:51:10.570633Z","title":"Nonconvex optimization for robust tensor completion from grossly sparse observations,","venue":null,"work_id":"d8c02aa6-5477-40b3-8f18-1d8ead1e6f54","year":2020},"citing_paper":{"arxiv_id":"2506.09594","last_updated":"2025-07-08T09:43:58Z","snapshot_observed_at":"2026-08-07T04:42:13.488017Z","submitted_at":"2025-06-11T10:53:07Z","title":"Accelerating Large-Scale Regularized High-Order Tensor Recovery","version":2},"reference_index":99,"source":"pdf_text","source_observed_at":"2026-08-07T04:51:10.291672Z"},"links":{"citing_paper":"/paper/2506.09594"},"observation_digest":"sha256:b24d29fa3c4a0ca728d828f4467aaf71c43f8b03959d3ce160eb22f94a36f3ce","observation_id":"717585bf-36b0-443e-a89a-c4b41098f58d","resolution":{"observed_at":"2026-08-07T04:51:10.574552Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"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"}],"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-08-07T04:51:10.560465Z","title":"A generalized non-convex method for robust tensor completion,","venue":null,"work_id":"edc6c0e3-f9e5-40c4-83c9-730abdc199a7","year":2023},"citing_paper":{"arxiv_id":"2506.09594","last_updated":"2025-07-08T09:43:58Z","snapshot_observed_at":"2026-08-07T04:42:13.488017Z","submitted_at":"2025-06-11T10:53:07Z","title":"Accelerating Large-Scale Regularized High-Order Tensor Recovery","version":2},"reference_index":100,"source":"pdf_text","source_observed_at":"2026-08-07T04:51:10.296093Z"},"links":{"citing_paper":"/paper/2506.09594"},"observation_digest":"sha256:10278725135818e877b6163d3b842f3137f6e66562c188eaaa55c01ccdfb6bd3","observation_id":"b6d2c6ca-d768-4c37-82cc-de0346f0469e","resolution":{"observed_at":"2026-08-07T04:51:10.563932Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}}],"paper":{"arxiv_id":"2506.09594","last_updated":"2025-07-08T09:43:58Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-07T04:42:13.488017Z","submitted_at":"2025-06-11T10:53:07Z","title":"Accelerating Large-Scale Regularized High-Order Tensor Recovery"},"reference_resolution":{"displayed":100,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":39,"verified_exact":0,"verified_fuzzy":61},"total_outbound_references":115},"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 9 August 2026, this Paper Citation Record lists 100 of 115 outbound references and 0 inbound Pith citation observations for arXiv:2506.09594."}