{"as_of":"2026-08-11T04:53:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:ad765e1f3cc9009cee833a401b243cf8ff518f27240158f9036644210ea96c46","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-10T06:31:04.303077+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-10T18:17:15.438702Z","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:b9b058d1c6f425498b401d979f05ac4503a435844a0c13773d985a3f319d3c93","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-10T18:17:15.438702Z","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:7aaf0fff8c98f9f87093b77b7517fec52dd261c3733f18a8ef0ab0f8edd94b3e","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-10T18:17:15.438702Z","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:a675f43402dad98489a704624d42d0ca25a7f18b40317ffc7348c1a24c78e9a1","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-10T18:17:15.438702Z","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:e89a44487306d548afcc1091875798136b8c489ed09cbd231188013bc200e256","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-10T18:17:15.438702Z","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:c3dad31b7eaef450985d1ae216a733846c4e641d522e12d307a9a89d08b16ab7","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-10T18:17:15.438702Z","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:c1a45efd4167a417a12d1bc3ce2e653018b0830de55d73c60d9770acb442d7fa","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-10T18:17:15.438702Z","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:a090011f7a889d91d2df245ec26913872af631f6e03f0144ff99268eb35b400b","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-10T18:17:15.438702Z","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:41031b63d28f3f1a7bebecc49dfee78e9a4c27f127204c051c5b2cf01833bfb4","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-10T18:17:15.438702Z","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:68a139190da136d59ea9655bfd536b2760bab17eb3a6afd975d6d2d078c2c1aa","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-10T18:17:15.438702Z","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:af0a8466f4c270df189582acd7159e517e4557fb8d5d5204705105fd4bf67cbd","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-10T18:17:15.438702Z","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:47350d76743e2c2a95cacdb1139b056bc332aba1f11d653ad792603fdfbc7899","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-10T18:17:15.438702Z","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:082ce9d4e27a3bf3fde230e00fdff8193e0fdfdcb3c2e34a54b2870b1895c60a","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-10T18:17:15.438702Z","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:247824e42678152a1a977befd88cd647bdacaaa36d3578670a69fbc567e23656","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-10T18:17:15.438702Z","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:4d95f10caa75a9fb4ab1464ce6ee596fae96857d3f68d7afcc2d461dcc7fd763","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-10T18:17:15.438702Z","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:a659c867c553bf86d1e8396376adf1390d3d42e95505d42efa0634360f374766","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-10T18:17:15.438702Z","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:11bfb540da94930330a6d48cd2b7458f26a73b9a76d80a7e1409a7f7e696a1a5","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-10T18:17:15.438702Z","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:a82c395e2ab46c0ad79107bbe6f03ea2fa92d78d76b595ae585bb18db9c2917e","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-10T18:17:15.438702Z","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:4b7e1419cf868f6baa2fc3a01dd017636b8f09f0cf9409383533b3e276507f9a","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-10T18:17:15.438702Z","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:06b1714fdf57c9531361eca7f5930a1dab318448c934adc0442a0b9b8d7d778a","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-10T18:17:15.438702Z","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:c1d67b36e51acfc121b74327d9b7fe50cec011d891cb2df6ba4432e63f4ca601","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-10T18:17:15.438702Z","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:e99b8cebeb34b6e1ca7999059fd1d74d23d8669b13c97ed9679f88d595a3aa60","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-10T18:17:15.438702Z","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:aa51e9bd56263338f51e8ac197409c02b2f22b68b202c9671642a3e4238305d8","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-10T18:17:15.438702Z","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:500bef8736ffe16a603e9de6025706675cdadeb6966be81dd0e40b1cf14a557f","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-10T18:17:15.438702Z","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:bb05ad2513684faca62038ce941d2016f5ddef97cac6f8fe54cca13347d511c7","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-10T18:17:15.438702Z","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:2cdbffe2abee6251701fb35d8bb5ed6ace0b7d4936fa6adb6a57ef3d1018a8e8","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-10T18:17:15.438702Z","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:f94c4e641fdd71e0411bf9b35bd92f51836b9e8d4bab6fb779997f8dab3ec77c","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-10T18:17:15.438702Z","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:e2fb34a5e8f08f5ee7d7d64944f8b89133f075ad8142d18dcca7bb51b77d40a9","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-10T18:17:15.438702Z","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:e76e20c73caa828e5858b9d5da98a4afdb71aa8c4e6d2efcdec28e3408aa1ce2","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-10T18:17:15.438702Z","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:34532967ed04ffbf44344cd9a6d55cc4a6c2b55c5f571db55f64a7333cfb6b5a","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-10T18:17:15.438702Z","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:12748a991cde39fadb3831e142bebd23e27c33e3a388c32e3865b867412dc367","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-10T18:17:15.438702Z","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:b3fd10ddbef8a6087b999242baa0d6f62c35938041d0d0bfcd70f9fcf7e7c592","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-10T18:17:15.438702Z","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:a2336c1f69861b396cda282d5bf035b32a31ba1b1217c7a05545c115aa41e578","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-10T18:17:15.438702Z","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:ab95e125067ec758fb9e3889b24fb27978d57e5eada66e5808613b383f6cb5fd","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-10T18:17:15.438702Z","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:eb38575ed717129ade6b4ad7d547fadf23c7cf406d2fee871739cb7615ab50c8","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-10T18:17:15.438702Z","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:18e4a8f5e56a8c80064c3dd8dba0764b7aa1904c14fafb5481819131102f5143","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-10T18:17:15.438702Z","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:33aa46531c8f26e3382001066f916eba63b1510b9414fc22beddfa4aa74f9712","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T18:17:15.438702Z","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:dfafefed4bc66f217f12e4bd1249b66074d139cd8b90107064a18a63adbebe99","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T18:17:15.438702Z","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:f14bbf78ff21542150c138566b26a65ce16ed0d8cce5d9b1358c33d452919c85","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T18:17:15.438702Z","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:0dfa83e5ebb50d9a44f958cb305242554c0fc753b5c80d10bcbd4c9c33c39ca0","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T18:17:15.438702Z","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:ff8a5527cf925506266d3c1e8274d67a9927997b65dc30d55f32790ec4712fc9","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T18:17:15.438702Z","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:e13d6d13f85f288c2bb8f8e3561c698b499fe862c6645c082b0a594f68b8d36f","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T18:17:15.438702Z","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:24f668503c8475a146f8e5a2d178990665e6066386c8a7b9cd48c5381c27d416","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T18:17:15.438702Z","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:698453bb6aba488efc83b87c6835456edb71715383f7e334079dcd772e3c21ea","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T18:17:15.438702Z","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:3943d940c6490f11529891ae8ef4a96e8deef7e3e47e54b3ef9ec2369316a761","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T18:17:15.438702Z","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:42ea48796b607ad87a6723b2e91cd8207bc5c6fedf4fb84d4df8473c6546ea23","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T18:17:15.438702Z","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:7004d0f569e8e90c2c98a1d11771b7aafa2f54cf18036fb893751c8b4fb262d4","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T18:17:15.438702Z","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:4eb80624c00ca28bebdc48b2cf15eaa3042872eb6fe509f3438d6d384c52b471","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T18:17:15.438702Z","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:fdcd72e36c68d7e9a01fa0a4b9da32b457dd23b09f9aefab861dbc8360698fdd","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T18:17:15.438702Z","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:f196d49195a468e8c82c5a44a4011787254c54059f104eaa1d0f66dac8196141","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T18:17:15.438702Z","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:d964b43fdcdeb47a1e86fc2e4ae12b1abacaceb48793d3f9dfbfbfeebdcf5176","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-10T18:17:15.438702Z","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:74e5bdc4853f9c39761431a170e8e70c2d30dcf23a0f629809e330d766218284","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T18:17:15.438702Z","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:1999d9b064ec150174bac445100281c546d7139f2c1aaad703ebe1f2979acddd","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T18:17:15.438702Z","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:50661a23a5d0479a8ac9158d217c379476efd4d389388fe94dfd50ecc4174f10","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T18:17:15.438702Z","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:569d0818abcefff2930e91d7fd56db5814bd9bd0c5fb1dfe7d3fe492a19d567f","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T18:17:15.438702Z","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:cf800b6d627258b9031b8cdb9192269a840d29c1d91fba03a69ac687a0dd8caa","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T18:17:15.438702Z","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:c0ec530b2ce3d342e76d3f446419da46a8cf3f4b6beafa84858956934b8b6733","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T18:17:15.438702Z","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:4187d0df274e875f526e8c665eea1f02af94ed6c0a3122f50fea285bb5c1f468","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T18:17:15.438702Z","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:948d3520dc4baef69d8d0e969753db304842b74b232528e5f377ed2e618d8f1e","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T18:17:15.438702Z","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:42a63d87748c718fa9cd632e8b1466334354346f11a573db803b1b86a93727a1","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T18:17:15.438702Z","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:c3f19bd8e6b3e3d9999dacc75400a3aa95f93198ddec2c9b5cd38f84a6dfa0af","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T18:17:15.438702Z","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:397e3f0050d4a955d730e85a605b1ea117e39629151af31fb90b00ebc9b027f6","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T18:17:15.438702Z","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:8bd9270f490f11dc5fa81ac7167372cf7cd7842b9561466729d0cd49719ebea0","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T18:17:15.438702Z","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:33e3e009bff28d4398abe4db9685211619206d293652b11efd5b20e66197d30a","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T18:17:15.438702Z","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:3c88111e9dd923a9be0d253243f1b6023f22dcc3fb294c7de125d3bca1335e3f","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T18:17:15.438702Z","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:04ddcd8c4e10ce93586417df104497e1703c2119e775732df3442789887b356a","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T18:17:15.438702Z","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:991cd26450b46929f4f5b19556979b2541f80f0c260a3df3a8c7cb13590a7827","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T18:17:15.438702Z","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:895c8ff054a7b71a0f3fda5932ab81e00940f8fc25762047502fe7fdd5d284cc","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08-10T18:16:27.076973Z","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-10T18:17:15.438702Z","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:3da153ad22e5afc555457ad013ceaaab308148cbda446b47ef7a20b0e7fc6bc5","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-10T18:17:15.438702Z","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:a4fde773e4e6ac753b0bb2e10b1b642a5f0ce654d5438d391a42c9cec83b2170","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T18:17:15.438702Z","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:e329b4ae797227fc5997ac9a821648aa3bac0cf3b484c332c7759cd5171d7d33","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T18:17:15.438702Z","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:b170cc824f42c3b76ee3bbccf9bfb9b7ff578a903f14f7ac6cd1c72ca48a52d9","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T18:17:15.438702Z","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:ddb0fdf0b6c930efed8ccdfc49b246b7856c8765ac82e8de5083e47cc0e50ada","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T18:17:15.438702Z","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:1631f7021335f22407d78ce05ac3b0ea28e651001fbe17c674d24e68aed1f3d7","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T18:17:15.438702Z","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:62ccaabcb2728086b78fab6815926e7f157a03354f2e699137d068ce82106a82","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T18:17:15.438702Z","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:388f748ed0fee4aacb07494a3bd48fc348d0a731a082f0a7d4dcae39831b6f6b","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T18:17:15.438702Z","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:25b4b99db9983eef657fbd0df1f640cb8d15f23106985dbd737367e6af71456c","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T18:17:15.438702Z","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:cba69d2fc5c944d1aef9aa7e70ab039fab47bad275786d3c72783a6745f3fd92","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T18:17:15.438702Z","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:82f6952456b9d18943d7825e06b687b2ab0e5a8232b8b08bd0583142ee2f2dc8","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T18:17:15.438702Z","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:10859091106a3643361083833856d7ffcbf44824fb0b6673f6ed3def027c7a03","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T18:17:15.438702Z","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:ee8dab47bd504345d13977ed2d1c5a394208a6d0e3ceb7a96c993bd5b460dac7","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T18:17:15.438702Z","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:40dfaec189a8ab39f8277064af7853488e537e6e456a2b644a82c5a2c782c1a4","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T18:17:15.438702Z","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:142539120e771ed7593e41623e868055a796f3678d3b349033e4426ccbd6943e","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T18:17:15.438702Z","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:d7e83e0e59c80329590118c4645d561a7f540cc648656dde8468236d79b0be4e","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T18:17:15.438702Z","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:575bd7b64f6c8a4f94b69d4a33aae8d6495dba6acb1126b8a9d4b8f03a9e41a3","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T18:17:15.438702Z","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:d35c40c29c639392caf03867c62043c662244221a71cb33ea255a9696e814a4b","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T18:17:15.438702Z","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:331084f549fe64f29649d025b9d3b5f8e23548232cc6043ff22f61ee57196064","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T18:17:15.438702Z","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:902e6d307e7b4aba6c12e21683cb85ff5aa0de5e42127c492d025a154fb21817","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T18:17:15.438702Z","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:d09caaf11be9f1d80da57ae83db9f3c447ebccc518c41cf4d1c306b7249130eb","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T18:17:15.438702Z","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:0ad880a0e8d2de47b60824d574df3476e983f5ccc14921f986a7e6f57fd97fca","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T18:17:15.438702Z","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:f3fe1d62beae851d9ed229bcd98fb59652f872b5c039aa28c0996f0417c45d15","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-10T18:17:15.438702Z","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:2647a122d44d0f29f5d8027a6231b9e75a82e6008b5477adecfd203d452f85c8","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T18:17:15.438702Z","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:a4e761046802142e92f1961b892c8030631b64634a1892069d6dc481b6307e84","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T18:17:15.438702Z","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:82642da63165b420476334083429c13c155a5208d2c3f70b00e0c49e8bc33741","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T18:17:15.438702Z","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:65c8ec3d99391fa95b7ab8d4341e4a2ff064f2de9034dd0927c6e6cc071f0579","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T18:17:15.438702Z","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:4d2450ced964bfb743a775f269a6b2120e65cc8ca554ccd1a8f1232594d2b906","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-10T18:17:15.438702Z","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:e90bfb40605acfbf58cb4a2c1f13633cc49052c93470bbad22dc8e1df079fa34","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T18:17:15.438702Z","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:4fdeb8814e9ad5115658d59efdf070b3a374b29f6caa5578ef9404ad2981c7bf","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T18:17:15.438702Z","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:e0b279de1471343f001a045a5f15b255d70f0bb664dd40964111d7e09739e65e","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T18:17:15.438702Z","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:0c60dfe6f0d56df44cec48380a89d091528f36162675e93be269a8249f37fca3","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T18:17:15.438702Z","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:04a5079614d53f7c51ce96c2ca8994444d9b59e8ce83ccf45a8da69a1b9d27f2","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T18:17:15.438702Z","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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 100 of 115 outbound references and 0 inbound Pith citation observations for arXiv:2506.09594."}