{"as_of":"2026-08-10T02:55:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:215089a2b078a14dbff7ad61ee36a81764a40bd6037b408880e21adeda387ffb","coverage":[{"denominator":92,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":92,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T23:53:12.156931Z","state":"measured"},{"denominator":96,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":96,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":4,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":4,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-08T11:38:26.121531Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-07-03T00:57:30.430769Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2506.16032","last_updated":"2025-06-19T05:07:07Z","snapshot_observed_at":"2026-08-07T22:43:08.027896Z","submitted_at":"2025-06-19T05:07:07Z","title":"A Scalable Factorization Approach for High-Order Structured Tensor Recovery","version":1},"cited_work":{"arxiv_id":"2506.16032","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2506.16032","snapshot_observed_at":"2026-07-03T00:57:30.430769Z","title":"A scalable factorization approach for high-order structured tensor recovery.arXiv preprint arXiv:2506.16032, 2025","venue":null,"work_id":"6a1fd9b2-0346-48e9-91db-076b985e3ab9","year":2025},"citing_paper":{"arxiv_id":"2605.27191","last_updated":"2026-05-26T15:44:42Z","snapshot_observed_at":"2026-08-01T17:55:46.651183Z","submitted_at":"2026-05-26T15:44:42Z","title":"Statistical and Algorithmic Foundations of Probing Quantum Systems with Compressive Measurements: A Review","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-06-29T16:39:09.873869Z"},"links":{"cited_paper":"/paper/2506.16032","citing_paper":"/paper/2605.27191"},"observation_digest":"sha256:220061c7ce14fdbe96016d2010ae7b7f5518a565556462015368a9bcb2edd772","observation_id":"93c86dc8-df28-4e42-9416-10c6308fe686","resolution":{"observed_at":"2026-06-29T16:43:40.078158Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.16032","last_updated":"2025-06-19T05:07:07Z","snapshot_observed_at":"2026-08-07T22:43:08.027896Z","submitted_at":"2025-06-19T05:07:07Z","title":"A Scalable Factorization Approach for High-Order Structured Tensor Recovery","version":1},"cited_work":{"arxiv_id":"2506.16032","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2506.16032","snapshot_observed_at":"2026-07-03T00:57:30.430769Z","title":"A scalable factorization approach for high-order structured tensor recovery.arXiv preprint arXiv:2506.16032, 2025","venue":null,"work_id":"6a1fd9b2-0346-48e9-91db-076b985e3ab9","year":2025},"citing_paper":{"arxiv_id":"2605.27795","last_updated":"2026-05-27T00:31:18Z","snapshot_observed_at":"2026-07-06T23:37:27.309837Z","submitted_at":"2026-05-27T00:31:18Z","title":"Geometric Analysis of Variational Quantum Eigensolver","version":1},"reference_index":76,"source":"pdf_text","source_observed_at":"2026-06-29T12:37:48.146737Z"},"links":{"cited_paper":"/paper/2506.16032","citing_paper":"/paper/2605.27795"},"observation_digest":"sha256:9fdeee25e960efdec475092afd86e36b4726cf7b8b1db48051474a82eb08cad4","observation_id":"176a9092-43e4-4f69-a576-56f1e2c709e7","resolution":{"observed_at":"2026-06-29T12:43:25.756081Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.16032","last_updated":"2025-06-19T05:07:07Z","snapshot_observed_at":"2026-08-07T22:43:08.027896Z","submitted_at":"2025-06-19T05:07:07Z","title":"A Scalable Factorization Approach for High-Order Structured Tensor Recovery","version":1},"cited_work":{"arxiv_id":"2506.16032","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2506.16032","snapshot_observed_at":"2026-07-03T00:57:30.430769Z","title":"A scalable factorization approach for high-order structured tensor recovery.arXiv preprint arXiv:2506.16032, 2025","venue":null,"work_id":"6a1fd9b2-0346-48e9-91db-076b985e3ab9","year":2025},"citing_paper":{"arxiv_id":"2606.10085","last_updated":"2026-06-08T19:09:58Z","snapshot_observed_at":"2026-08-03T13:40:06.443153Z","submitted_at":"2026-06-08T19:09:58Z","title":"Structured Adaptive Tensor Prediction for Streaming Data","version":1},"reference_index":81,"source":"pdf_text","source_observed_at":"2026-06-27T16:53:16.510210Z"},"links":{"cited_paper":"/paper/2506.16032","citing_paper":"/paper/2606.10085"},"observation_digest":"sha256:600e0cfed754593fd5d71cbb8aa4902f0e1f4352960a681ad2f4d701cb2c7cb9","observation_id":"589cd050-c975-4cc1-a465-f387555f4680","resolution":{"observed_at":"2026-07-03T00:57:30.432283Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.16032","last_updated":"2025-06-19T05:07:07Z","snapshot_observed_at":"2026-08-07T22:43:08.027896Z","submitted_at":"2025-06-19T05:07:07Z","title":"A Scalable Factorization Approach for High-Order Structured Tensor Recovery","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.16032","snapshot_observed_at":"2026-08-08T11:38:26.121531Z","title":"A scalable factorization approach for high-order structured tensor recovery.arXiv preprint arXiv:2506.16032, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.05526","last_updated":"2026-08-06T02:06:44Z","snapshot_observed_at":"2026-08-09T23:11:00.420008Z","submitted_at":"2026-08-06T02:06:44Z","title":"A Unified Framework for Sample Complexity of Structured Quantum State Tomography under Noisy Observations","version":1},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-08-08T11:38:26.121531Z"},"links":{"cited_paper":"/paper/2506.16032","citing_paper":"/paper/2608.05526"},"observation_digest":"sha256:645c09dea7125f2f17652fd080f1b76f24d7116b371479abb555927016a0cb0f","observation_id":"b2bacbe3-4877-43e9-9de7-59f3ba9625bc","resolution":{"observed_at":"2026-08-08T11:38:26.121531Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2506.16032/citation-record","integrity":"/paper/2506.16032/integrity","json":"/paper/2506.16032/citation-record.json","paper":"/paper/2506.16032"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T23:53:09.591289Z","title":"Interior-point method for nuclear norm approximation with application to system identification.SIAM Journal on Matrix Analysis and Applications, 31(3):1235–1256, 2010","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2506.16032","last_updated":"2025-06-19T05:07:07Z","snapshot_observed_at":"2026-08-07T22:43:08.027896Z","submitted_at":"2025-06-19T05:07:07Z","title":"A Scalable Factorization Approach for High-Order Structured Tensor Recovery","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-06T23:53:09.591289Z"},"links":{"citing_paper":"/paper/2506.16032"},"observation_digest":"sha256:55d15ad31fba08e9d7bafd4f70019669a792a457a752b877ab2b17f2da603d16","observation_id":"3eaea52f-eb6a-4706-b395-9d180cfc4e81","resolution":{"observed_at":"2026-08-06T23:53:09.591289Z","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-06T23:53:09.677952Z","title":"Designing tensor-train deep neural networks for time-varying mimo channel estimation.IEEE Journal of Selected Topics in Signal Processing, 15(3):759–773, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.16032","last_updated":"2025-06-19T05:07:07Z","snapshot_observed_at":"2026-08-07T22:43:08.027896Z","submitted_at":"2025-06-19T05:07:07Z","title":"A Scalable Factorization Approach for High-Order Structured Tensor Recovery","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-06T23:53:09.677952Z"},"links":{"citing_paper":"/paper/2506.16032"},"observation_digest":"sha256:a32aba26fb0ee3cb068e2c016657f8caa6497049f3131a8dee7cbbd32154bafa","observation_id":"b672003a-be26-4932-8bd7-dbeefcc55d3f","resolution":{"observed_at":"2026-08-06T23:53:09.677952Z","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-06T23:53:09.759414Z","title":"Fast and robust quantum state tomography from few basis measurements","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.16032","last_updated":"2025-06-19T05:07:07Z","snapshot_observed_at":"2026-08-07T22:43:08.027896Z","submitted_at":"2025-06-19T05:07:07Z","title":"A Scalable Factorization Approach for High-Order Structured Tensor Recovery","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-06T23:53:09.759414Z"},"links":{"citing_paper":"/paper/2506.16032"},"observation_digest":"sha256:8cad373b52561c60fda8e5c79cff4debe414456f5bc0a4d090095d9b036a0212","observation_id":"04ec4fb3-5c67-46d8-a70b-77cc65dc8ea7","resolution":{"observed_at":"2026-08-06T23:53:09.759414Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2207.06397","last_updated":"2022-07-13T17:56:28Z","snapshot_observed_at":"2026-08-07T13:45:27.957904Z","submitted_at":"2022-07-13T17:56:28Z","title":"Quantum state tomography with tensor train cross approximation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2207.06397","snapshot_observed_at":"2026-08-06T23:53:09.823747Z","title":"Quantum state tomography with tensor train cross approximation.arXiv preprint arXiv:2207.06397, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.16032","last_updated":"2025-06-19T05:07:07Z","snapshot_observed_at":"2026-08-07T22:43:08.027896Z","submitted_at":"2025-06-19T05:07:07Z","title":"A Scalable Factorization Approach for High-Order Structured Tensor Recovery","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-06T23:53:09.823747Z"},"links":{"cited_paper":"/paper/2207.06397","citing_paper":"/paper/2506.16032"},"observation_digest":"sha256:37528f721dc15399ea30812bdd19a7ca09dae450e9400faec0419447fc9955ed","observation_id":"b5021df2-9cfa-45b0-8041-3f793d6fe1eb","resolution":{"observed_at":"2026-08-06T23:53:09.823747Z","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-06T23:53:09.885205Z","title":"Quantum state tomography for matrix product density operators.IEEE Transactions on Information Theory, 70(7):5030–5056, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.16032","last_updated":"2025-06-19T05:07:07Z","snapshot_observed_at":"2026-08-07T22:43:08.027896Z","submitted_at":"2025-06-19T05:07:07Z","title":"A Scalable Factorization Approach for High-Order Structured Tensor Recovery","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-06T23:53:09.885205Z"},"links":{"citing_paper":"/paper/2506.16032"},"observation_digest":"sha256:4bf32bf41e16142bdd3f445102feafe7c402edc84d97494e86e2a082444c219e","observation_id":"9f967d32-0a32-4f31-901d-bf4e9be3bcd9","resolution":{"observed_at":"2026-08-06T23:53:09.885205Z","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-06T23:53:09.952525Z","title":"Mixture-rank matrix approximation for collaborative filtering.Advances in Neural Information Processing Systems, 30, 2017","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2506.16032","last_updated":"2025-06-19T05:07:07Z","snapshot_observed_at":"2026-08-07T22:43:08.027896Z","submitted_at":"2025-06-19T05:07:07Z","title":"A Scalable Factorization Approach for High-Order Structured Tensor Recovery","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-06T23:53:09.952525Z"},"links":{"citing_paper":"/paper/2506.16032"},"observation_digest":"sha256:b7e68dd82c9c01180268ca5b9e4dd0ada51a5b4d204cc156f0636ba56b8ae06b","observation_id":"1e414fbb-3eb7-42ec-a4bd-f774b3058e5d","resolution":{"observed_at":"2026-08-06T23:53:09.952525Z","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-06T23:53:10.017654Z","title":"Recovery of simultaneous low rank and two-way sparse coefficient matrices, a nonconvex approach.Electronic Journal of Statistics, 14(1):413–457, 2020","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2506.16032","last_updated":"2025-06-19T05:07:07Z","snapshot_observed_at":"2026-08-07T22:43:08.027896Z","submitted_at":"2025-06-19T05:07:07Z","title":"A Scalable Factorization Approach for High-Order Structured Tensor Recovery","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-06T23:53:10.017654Z"},"links":{"citing_paper":"/paper/2506.16032"},"observation_digest":"sha256:1019394f8a9e17625907ff1c4ff9457625237b19f2f5a55d8ac0d5c23d4580cb","observation_id":"56ae6002-3485-4b58-8e52-05c1e5230cd7","resolution":{"observed_at":"2026-08-06T23:53:10.017654Z","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-06T23:53:10.098307Z","title":"Analysis of a complex of statistical variables into principal components.Journal of educational psychology, 24(6):417, 1933","venue":null,"work_id":null,"year":1933},"citing_paper":{"arxiv_id":"2506.16032","last_updated":"2025-06-19T05:07:07Z","snapshot_observed_at":"2026-08-07T22:43:08.027896Z","submitted_at":"2025-06-19T05:07:07Z","title":"A Scalable Factorization Approach for High-Order Structured Tensor Recovery","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-06T23:53:10.098307Z"},"links":{"citing_paper":"/paper/2506.16032"},"observation_digest":"sha256:52ca5f17af3a5d69817d34953b49523dfbd7c80a83a846e95b44d11e9cc0ae85","observation_id":"02388854-4c95-49ff-867c-f578a7c5c0d4","resolution":{"observed_at":"2026-08-06T23:53:10.098307Z","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-06T23:53:10.160954Z","title":"Microbial co-occurrence relationships in the human microbiome.PLoS computational biology, 8(7):e1002606, 2012","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2506.16032","last_updated":"2025-06-19T05:07:07Z","snapshot_observed_at":"2026-08-07T22:43:08.027896Z","submitted_at":"2025-06-19T05:07:07Z","title":"A Scalable Factorization Approach for High-Order Structured Tensor Recovery","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-06T23:53:10.160954Z"},"links":{"citing_paper":"/paper/2506.16032"},"observation_digest":"sha256:eb8b3cc334bdac0f97cebf4933cc3a010b543a262abb17725df8c3d9ac251b0b","observation_id":"4e8b73e4-7328-4ce0-a089-51cb4c2570b9","resolution":{"observed_at":"2026-08-06T23:53:10.160954Z","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-06T23:53:10.241853Z","title":"Latent space models for dynamic networks.Journal of the American Statistical Association, 110(512):1646–1657, 2015","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2506.16032","last_updated":"2025-06-19T05:07:07Z","snapshot_observed_at":"2026-08-07T22:43:08.027896Z","submitted_at":"2025-06-19T05:07:07Z","title":"A Scalable Factorization Approach for High-Order Structured Tensor Recovery","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-06T23:53:10.241853Z"},"links":{"citing_paper":"/paper/2506.16032"},"observation_digest":"sha256:39db88d459b72a68ffb01c2e5f00d58f913059d9086e792d9440b0d274f10afb","observation_id":"0fe6bd4c-470d-467a-952b-dcac00dabbc2","resolution":{"observed_at":"2026-08-06T23:53:10.241853Z","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-06T23:53:10.317621Z","title":"Poisson noise reduction with non-local pca.Journal of mathematical imaging and vision, 48(2):279–294, 2014","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2506.16032","last_updated":"2025-06-19T05:07:07Z","snapshot_observed_at":"2026-08-07T22:43:08.027896Z","submitted_at":"2025-06-19T05:07:07Z","title":"A Scalable Factorization Approach for High-Order Structured Tensor Recovery","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-06T23:53:10.317621Z"},"links":{"citing_paper":"/paper/2506.16032"},"observation_digest":"sha256:369fdac152b030569bb8f03285b2e312f7dd556c7f66293b5814efa65c75b3c1","observation_id":"34f6dc97-e98f-46d3-99f4-64700fc8c6ca","resolution":{"observed_at":"2026-08-06T23:53:10.317621Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1711.00811","last_updated":"2018-02-07T21:43:25Z","snapshot_observed_at":"2026-08-09T02:20:50.224151Z","submitted_at":"2017-11-02T16:49:19Z","title":"Expressive power of recurrent neural networks","version":2},"cited_work":{"arxiv_id":"1711.00811","doi":null,"metadata_source":"pith","pith_arxiv_id":"1711.00811","snapshot_observed_at":"2026-08-06T23:53:12.254478Z","title":"Expressive power of recurrent neural networks","venue":"cs.LG","work_id":"ca1c5bd2-226a-469b-961e-674e74c1ce79","year":2017},"citing_paper":{"arxiv_id":"2506.16032","last_updated":"2025-06-19T05:07:07Z","snapshot_observed_at":"2026-08-07T22:43:08.027896Z","submitted_at":"2025-06-19T05:07:07Z","title":"A Scalable Factorization Approach for High-Order Structured Tensor Recovery","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-06T23:53:10.412443Z"},"links":{"cited_paper":"/paper/1711.00811","citing_paper":"/paper/2506.16032"},"observation_digest":"sha256:a2f052417b4c838ecd22e71a2e1f4c67d897373f2ed932d3660f93538099724a","observation_id":"ea5732e2-a6fc-4895-b46f-d0a6148a24bd","resolution":{"observed_at":"2026-08-06T23:53:12.258048Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"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-06T23:53:10.438799Z","title":"Supervised learning with tensor networks.Advances in neural infor- mation processing systems, 29, 2016","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2506.16032","last_updated":"2025-06-19T05:07:07Z","snapshot_observed_at":"2026-08-07T22:43:08.027896Z","submitted_at":"2025-06-19T05:07:07Z","title":"A Scalable Factorization Approach for High-Order Structured Tensor Recovery","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-06T23:53:10.438799Z"},"links":{"citing_paper":"/paper/2506.16032"},"observation_digest":"sha256:513ce5763234536bd4b291990387945046eb9a2cb6f303354b77235ea1a90083","observation_id":"c882aab8-8551-4b36-a3eb-a4299f0e6647","resolution":{"observed_at":"2026-08-06T23:53:10.438799Z","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-06T23:53:10.555896Z","title":"Tensor-train recurrent neural networks for video classifica- tion","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2506.16032","last_updated":"2025-06-19T05:07:07Z","snapshot_observed_at":"2026-08-07T22:43:08.027896Z","submitted_at":"2025-06-19T05:07:07Z","title":"A Scalable Factorization Approach for High-Order Structured Tensor Recovery","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-06T23:53:10.555896Z"},"links":{"citing_paper":"/paper/2506.16032"},"observation_digest":"sha256:6011b740f4bf95ba0194badb7b8ea3253b7fa00da3864352abf43b846aeab339","observation_id":"9a4b4d5f-8f24-430d-81e2-af61031f17f2","resolution":{"observed_at":"2026-08-06T23:53:10.555896Z","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-06T23:53:12.898289Z","title":"Tensorizing neural networks","venue":null,"work_id":"ab903609-c93d-492f-88cd-456ccd9d3cdb","year":2015},"citing_paper":{"arxiv_id":"2506.16032","last_updated":"2025-06-19T05:07:07Z","snapshot_observed_at":"2026-08-07T22:43:08.027896Z","submitted_at":"2025-06-19T05:07:07Z","title":"A Scalable Factorization Approach for High-Order Structured Tensor Recovery","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-06T23:53:10.701618Z"},"links":{"citing_paper":"/paper/2506.16032"},"observation_digest":"sha256:e8854b46796eaf10fc05591686c27ee37b3287cbc9c3dc033e5d01f9a5626f75","observation_id":"a6886033-13bd-42e3-a9bc-2f50c7e55e74","resolution":{"observed_at":"2026-08-06T23:53:12.901021Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"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-06T23:53:12.888845Z","title":"Compressing recurrent neural network with tensor train","venue":null,"work_id":"1f1a109e-9ce3-423f-832a-d63dbc05196e","year":2017},"citing_paper":{"arxiv_id":"2506.16032","last_updated":"2025-06-19T05:07:07Z","snapshot_observed_at":"2026-08-07T22:43:08.027896Z","submitted_at":"2025-06-19T05:07:07Z","title":"A Scalable Factorization Approach for High-Order Structured Tensor Recovery","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-06T23:53:10.802850Z"},"links":{"citing_paper":"/paper/2506.16032"},"observation_digest":"sha256:a69a02e0c619b19da4870546836b1434b53f2f0c4d6e56dbc4937c7c267a55df","observation_id":"9b47a724-32f2-4608-bc61-5a518ee7ce45","resolution":{"observed_at":"2026-08-06T23:53:12.892707Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"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-06T23:53:12.879222Z","title":"Long-term forecasting using tensor-train rnns","venue":null,"work_id":"269fa168-87ad-480f-ad34-6f03cb8c5b06","year":2017},"citing_paper":{"arxiv_id":"2506.16032","last_updated":"2025-06-19T05:07:07Z","snapshot_observed_at":"2026-08-07T22:43:08.027896Z","submitted_at":"2025-06-19T05:07:07Z","title":"A Scalable Factorization Approach for High-Order Structured Tensor Recovery","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-06T23:53:10.885358Z"},"links":{"citing_paper":"/paper/2506.16032"},"observation_digest":"sha256:aad8fb61a129f209e14cf26a4d27b5aadce9a900c0e39b39ead4d32b14067e4b","observation_id":"2e07f643-4177-487c-b9c2-99b2b1164ad9","resolution":{"observed_at":"2026-08-06T23:53:12.882989Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"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-06T23:53:11.013788Z","title":"A tensorized transformer for language modeling.Advances in neural information processing systems, 32, 2019","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2506.16032","last_updated":"2025-06-19T05:07:07Z","snapshot_observed_at":"2026-08-07T22:43:08.027896Z","submitted_at":"2025-06-19T05:07:07Z","title":"A Scalable Factorization Approach for High-Order Structured Tensor Recovery","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-06T23:53:11.013788Z"},"links":{"citing_paper":"/paper/2506.16032"},"observation_digest":"sha256:0b9554cf86b3b0e2baa02bdafb7154fc595679ed7fc760d590a4e60ef58b490e","observation_id":"74452945-232e-4728-b3a3-b44b3252b2ae","resolution":{"observed_at":"2026-08-06T23:53:11.013788Z","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-06T23:53:12.863702Z","title":"Tensor methods and recommender systems.Wiley Interdisciplinary Reviews: Data Mining and Knowledge Discovery, 7(3):e1201, 2017","venue":null,"work_id":"12f2145f-4e2c-46be-9f5b-4ca5a1d424db","year":2017},"citing_paper":{"arxiv_id":"2506.16032","last_updated":"2025-06-19T05:07:07Z","snapshot_observed_at":"2026-08-07T22:43:08.027896Z","submitted_at":"2025-06-19T05:07:07Z","title":"A Scalable Factorization Approach for High-Order Structured Tensor Recovery","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-06T23:53:11.158314Z"},"links":{"citing_paper":"/paper/2506.16032"},"observation_digest":"sha256:f698f4353afe4f29c6be718b1caee1e0ac619a8496bd5a0395a4498e5fa2261d","observation_id":"fecf8875-3c5c-48d0-bcb1-1c5150b6739a","resolution":{"observed_at":"2026-08-06T23:53:12.867748Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"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-06T23:53:12.854933Z","title":"Some mathematical notes on three-mode factor analysis.Psychometrika, 31(3):279–311, 1966","venue":null,"work_id":"cf88f845-8fcb-4832-8a86-372f76357dd8","year":1966},"citing_paper":{"arxiv_id":"2506.16032","last_updated":"2025-06-19T05:07:07Z","snapshot_observed_at":"2026-08-07T22:43:08.027896Z","submitted_at":"2025-06-19T05:07:07Z","title":"A Scalable Factorization Approach for High-Order Structured Tensor Recovery","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-06T23:53:11.231040Z"},"links":{"citing_paper":"/paper/2506.16032"},"observation_digest":"sha256:ca047adc1bb3b52000e127f0b9830a02e63dbce97545b334f172c6733200f3f3","observation_id":"b42ccbdf-f194-4b2c-8de9-4c236ec98a38","resolution":{"observed_at":"2026-08-06T23:53:12.858215Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"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-06T23:53:11.233608Z","title":"Oseledets","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2506.16032","last_updated":"2025-06-19T05:07:07Z","snapshot_observed_at":"2026-08-07T22:43:08.027896Z","submitted_at":"2025-06-19T05:07:07Z","title":"A Scalable Factorization Approach for High-Order Structured Tensor Recovery","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-06T23:53:11.233608Z"},"links":{"citing_paper":"/paper/2506.16032"},"observation_digest":"sha256:3048327be8289d9258647519bd4e565bf9840bab4d0b0a1eec903a6f3cd982ee","observation_id":"ff557c35-0b09-44f1-b475-63012263918d","resolution":{"observed_at":"2026-08-06T23:53:11.233608Z","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-06T23:53:12.841326Z","title":null,"venue":null,"work_id":"7a81a82c-acba-4e3f-aa39-bdfa350f46be","year":1997},"citing_paper":{"arxiv_id":"2506.16032","last_updated":"2025-06-19T05:07:07Z","snapshot_observed_at":"2026-08-07T22:43:08.027896Z","submitted_at":"2025-06-19T05:07:07Z","title":"A Scalable Factorization Approach for High-Order Structured Tensor Recovery","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-06T23:53:11.236071Z"},"links":{"citing_paper":"/paper/2506.16032"},"observation_digest":"sha256:0ce6a85158802f8131e11e4ee1580df4d26e37773935780c01b10a3662052787","observation_id":"20b3f79d-688e-42ee-8234-bdf3832b4785","resolution":{"observed_at":"2026-08-06T23:53:12.844511Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"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-06T23:53:12.832605Z","title":"On the uniqueness of multilinear decomposition of n-way arrays","venue":null,"work_id":"703b17d3-4d73-4067-9227-f24ebcf76f0e","year":2000},"citing_paper":{"arxiv_id":"2506.16032","last_updated":"2025-06-19T05:07:07Z","snapshot_observed_at":"2026-08-07T22:43:08.027896Z","submitted_at":"2025-06-19T05:07:07Z","title":"A Scalable Factorization Approach for High-Order Structured Tensor Recovery","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-06T23:53:11.238501Z"},"links":{"citing_paper":"/paper/2506.16032"},"observation_digest":"sha256:589d3ad0636a7ce4bec5676726dbb337fcb4d9deb6b618c9e8f47510ec608fc9","observation_id":"060a313e-a8f5-4f2c-8efa-6ebdd899af23","resolution":{"observed_at":"2026-08-06T23:53:12.835603Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"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-06T23:53:12.824338Z","title":"Parsimonious tensor response regression.Journal of the American Statistical Associa- tion, 112(519):1131–1146, 2017","venue":null,"work_id":"6674022e-ab7c-48bb-b751-aae11e06fca8","year":2017},"citing_paper":{"arxiv_id":"2506.16032","last_updated":"2025-06-19T05:07:07Z","snapshot_observed_at":"2026-08-07T22:43:08.027896Z","submitted_at":"2025-06-19T05:07:07Z","title":"A Scalable Factorization Approach for High-Order Structured Tensor Recovery","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-06T23:53:11.241205Z"},"links":{"citing_paper":"/paper/2506.16032"},"observation_digest":"sha256:aad39ad9f634c03574da6096c7a21bf4d80e5e96ac27bd5fdf5c22446381e754","observation_id":"5d51c019-ad6f-4bf3-9898-32032c9c1170","resolution":{"observed_at":"2026-08-06T23:53:12.827386Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"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-06T23:53:12.815617Z","title":"Tucker tensor regression and neuroimaging analysis.Statistics in Biosciences, 10:520–545, 2018","venue":null,"work_id":"13210cbd-fb61-4d36-90cc-ca021f198e82","year":2018},"citing_paper":{"arxiv_id":"2506.16032","last_updated":"2025-06-19T05:07:07Z","snapshot_observed_at":"2026-08-07T22:43:08.027896Z","submitted_at":"2025-06-19T05:07:07Z","title":"A Scalable Factorization Approach for High-Order Structured Tensor Recovery","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-06T23:53:11.243531Z"},"links":{"citing_paper":"/paper/2506.16032"},"observation_digest":"sha256:490a0f52bd8e0f95c46cf5c277da211498a918990626d00790d2090ec3597481","observation_id":"ed949090-cafb-434c-9349-4040669cfad4","resolution":{"observed_at":"2026-08-06T23:53:12.819104Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"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-06T23:53:12.806865Z","title":"Hyperspectral image, video compression using sparse tucker tensor decomposition.IET Image Processing, 15(4):964–973, 2021","venue":null,"work_id":"30eae79f-a53e-4f76-aba9-b3b0a0948e2f","year":2021},"citing_paper":{"arxiv_id":"2506.16032","last_updated":"2025-06-19T05:07:07Z","snapshot_observed_at":"2026-08-07T22:43:08.027896Z","submitted_at":"2025-06-19T05:07:07Z","title":"A Scalable Factorization Approach for High-Order Structured Tensor Recovery","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-06T23:53:11.245858Z"},"links":{"citing_paper":"/paper/2506.16032"},"observation_digest":"sha256:3f6232fc52949f7cc2f8ca184589a19ed289d1e4b7d3e367237f7dbe26f6943b","observation_id":"878897a7-dfb4-45bb-a5b7-0812ee73cd66","resolution":{"observed_at":"2026-08-06T23:53:12.810036Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"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-06T23:53:12.798291Z","title":"Multilinear tensor regression for longitudinal relational data.The annals of applied statistics, 9(3):1169, 2015","venue":null,"work_id":"a40ae561-1a4f-4a11-9cf0-6c35b6b6dcf3","year":2015},"citing_paper":{"arxiv_id":"2506.16032","last_updated":"2025-06-19T05:07:07Z","snapshot_observed_at":"2026-08-07T22:43:08.027896Z","submitted_at":"2025-06-19T05:07:07Z","title":"A Scalable Factorization Approach for High-Order Structured Tensor Recovery","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-06T23:53:11.248759Z"},"links":{"citing_paper":"/paper/2506.16032"},"observation_digest":"sha256:6edb00473cb262b2554ee0f81392afc79b24f0da397cf473ae72c103fddb0e97","observation_id":"0d9c543d-5e00-416d-8f8b-bed1666d6d38","resolution":{"observed_at":"2026-08-06T23:53:12.801481Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"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-06T23:53:11.251167Z","title":"Efficient quantum state tomography.Nature communications, 1(1):149, 2010","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2506.16032","last_updated":"2025-06-19T05:07:07Z","snapshot_observed_at":"2026-08-07T22:43:08.027896Z","submitted_at":"2025-06-19T05:07:07Z","title":"A Scalable Factorization Approach for High-Order Structured Tensor Recovery","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-06T23:53:11.251167Z"},"links":{"citing_paper":"/paper/2506.16032"},"observation_digest":"sha256:295e9397323e2b17661ab07121d2ed89db3b75bc0ce37d4a93f50591a02dbece","observation_id":"592f3ce5-376f-4b6c-a63d-970470030e7d","resolution":{"observed_at":"2026-08-06T23:53:11.251167Z","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-06T23:53:12.783497Z","title":"Efficient tomography of a quantum many-body system.Nature Physics, 13(12):1158–1162, 2017","venue":null,"work_id":"fc21c099-a3a6-472f-a8f5-af869ad9d6a3","year":2017},"citing_paper":{"arxiv_id":"2506.16032","last_updated":"2025-06-19T05:07:07Z","snapshot_observed_at":"2026-08-07T22:43:08.027896Z","submitted_at":"2025-06-19T05:07:07Z","title":"A Scalable Factorization Approach for High-Order Structured Tensor Recovery","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-06T23:53:11.253615Z"},"links":{"citing_paper":"/paper/2506.16032"},"observation_digest":"sha256:23b2f90188b85093c500d95bddffa82f36c37b9d4a74b5990732a82a2130e1fa","observation_id":"2026b290-00cc-4a3a-b2ec-be37eb232b41","resolution":{"observed_at":"2026-08-06T23:53:12.787201Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"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-06T23:53:12.772650Z","title":"Scalable quantum tomography with fidelity estimation.Physical Review A, 101(3):032321, 2020","venue":null,"work_id":"a659fe27-aa29-4219-9ec0-b2832b9711d9","year":2020},"citing_paper":{"arxiv_id":"2506.16032","last_updated":"2025-06-19T05:07:07Z","snapshot_observed_at":"2026-08-07T22:43:08.027896Z","submitted_at":"2025-06-19T05:07:07Z","title":"A Scalable Factorization Approach for High-Order Structured Tensor Recovery","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-06T23:53:11.256126Z"},"links":{"citing_paper":"/paper/2506.16032"},"observation_digest":"sha256:f9a0119a0bcfc3b913ee6ca48f0603f000c563d1e261e1bdbd861d9547d706eb","observation_id":"fbddecb7-116d-4fd9-86c9-695d546e7e5a","resolution":{"observed_at":"2026-08-06T23:53:12.776082Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"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-06T23:53:11.258510Z","title":"Matrix product density operators: Simulation of finite-temperature and dissipative systems.Physical review letters, 93(20):207204, 2004","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2506.16032","last_updated":"2025-06-19T05:07:07Z","snapshot_observed_at":"2026-08-07T22:43:08.027896Z","submitted_at":"2025-06-19T05:07:07Z","title":"A Scalable Factorization Approach for High-Order Structured Tensor Recovery","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-06T23:53:11.258510Z"},"links":{"citing_paper":"/paper/2506.16032"},"observation_digest":"sha256:9b03533f4a301e40bb6e670fabbd72eab5a274a60832d7a899f2a1d62fb2b378","observation_id":"bae33c25-1f41-48f6-96a7-d1f004114a91","resolution":{"observed_at":"2026-08-06T23:53:11.258510Z","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-06T23:53:11.261066Z","title":"Matrix product operator representations","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2506.16032","last_updated":"2025-06-19T05:07:07Z","snapshot_observed_at":"2026-08-07T22:43:08.027896Z","submitted_at":"2025-06-19T05:07:07Z","title":"A Scalable Factorization Approach for High-Order Structured Tensor Recovery","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-06T23:53:11.261066Z"},"links":{"citing_paper":"/paper/2506.16032"},"observation_digest":"sha256:cfbc8f916ad2751af24fa9c199a9cd6c94998f9198e843813ca3a1bad00849b7","observation_id":"08f40f50-1c2c-4703-a643-d15ea8fdd244","resolution":{"observed_at":"2026-08-06T23:53:11.261066Z","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-06T23:53:12.753608Z","title":"Positive tensor network approach for simulating open quantum many-body systems.Physical review letters, 116(23):237201, 2016","venue":null,"work_id":"3cf18333-ada9-47fe-8ee0-51f9ab551c8b","year":2016},"citing_paper":{"arxiv_id":"2506.16032","last_updated":"2025-06-19T05:07:07Z","snapshot_observed_at":"2026-08-07T22:43:08.027896Z","submitted_at":"2025-06-19T05:07:07Z","title":"A Scalable Factorization Approach for High-Order Structured Tensor Recovery","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-06T23:53:11.263429Z"},"links":{"citing_paper":"/paper/2506.16032"},"observation_digest":"sha256:c2206d150efcb8e8816eb1025050558ade4eb77310177426e744ff744c34c711","observation_id":"b3242e6c-3ef4-456c-b3c9-83e57f7ab090","resolution":{"observed_at":"2026-08-06T23:53:12.756901Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"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-06T23:53:12.744949Z","title":"Efficient description of many-body systems with matrix product density operators.PRX Quantum, 1(1):010304, 2020","venue":null,"work_id":"e7a32505-ad3a-4ea5-a950-c2907278e009","year":2020},"citing_paper":{"arxiv_id":"2506.16032","last_updated":"2025-06-19T05:07:07Z","snapshot_observed_at":"2026-08-07T22:43:08.027896Z","submitted_at":"2025-06-19T05:07:07Z","title":"A Scalable Factorization Approach for High-Order Structured Tensor Recovery","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-06T23:53:11.265790Z"},"links":{"citing_paper":"/paper/2506.16032"},"observation_digest":"sha256:23698606949d302c8ec77d95d769eb2765f9dce076399085ac27c3889c4957be","observation_id":"e56ec4b2-5050-43e7-9b81-fe4c823b463c","resolution":{"observed_at":"2026-08-06T23:53:12.748237Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"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-06T23:53:12.736633Z","title":"On manifolds of tensors of fixed tt-rank.Nu- merische Mathematik, 120(4):701–731, 2012","venue":null,"work_id":"f121e5ab-a2e1-4e15-82c3-1a2a569d1724","year":2012},"citing_paper":{"arxiv_id":"2506.16032","last_updated":"2025-06-19T05:07:07Z","snapshot_observed_at":"2026-08-07T22:43:08.027896Z","submitted_at":"2025-06-19T05:07:07Z","title":"A Scalable Factorization Approach for High-Order Structured Tensor Recovery","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-06T23:53:11.268376Z"},"links":{"citing_paper":"/paper/2506.16032"},"observation_digest":"sha256:a6ee7cd6dfe7868c270162c8f5459a10f9bde2787f1a1837aa2a213c8ff2c63a","observation_id":"4c04fa16-05e5-4e1f-80da-c82c15cb5c58","resolution":{"observed_at":"2026-08-06T23:53:12.739735Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"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-06T23:53:12.728298Z","title":"A singular value thresholding algorithm for matrix completion.SIAM Journal on optimization, 20(4):1956–1982, 2010","venue":null,"work_id":"730b75c6-a5db-4e11-b5a8-6c552b89029d","year":1956},"citing_paper":{"arxiv_id":"2506.16032","last_updated":"2025-06-19T05:07:07Z","snapshot_observed_at":"2026-08-07T22:43:08.027896Z","submitted_at":"2025-06-19T05:07:07Z","title":"A Scalable Factorization Approach for High-Order Structured Tensor Recovery","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-06T23:53:11.270923Z"},"links":{"citing_paper":"/paper/2506.16032"},"observation_digest":"sha256:98b8cf4a570ef42575e3730f58bd5e3c16b5470d010968c97b1d0e077f128a28","observation_id":"cc951cd1-59ca-46f0-8ae8-c48e7ad13af9","resolution":{"observed_at":"2026-08-06T23:53:12.731478Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"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-06T23:53:12.719622Z","title":"Tensor decompositions for signal processing applications: From two-way to multiway component analysis","venue":null,"work_id":"8786e64f-0061-47cc-bc04-01c7fe2ac678","year":2015},"citing_paper":{"arxiv_id":"2506.16032","last_updated":"2025-06-19T05:07:07Z","snapshot_observed_at":"2026-08-07T22:43:08.027896Z","submitted_at":"2025-06-19T05:07:07Z","title":"A Scalable Factorization Approach for High-Order Structured Tensor Recovery","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-06T23:53:11.273330Z"},"links":{"citing_paper":"/paper/2506.16032"},"observation_digest":"sha256:b554b608094f3ceac43feb918a51d73b0565ac4952e61e9d588f15ba0af2c101","observation_id":"d6be22e1-429d-46f3-862a-5e036bd8a487","resolution":{"observed_at":"2026-08-06T23:53:12.723010Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"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-06T23:53:12.710491Z","title":"Canonical polyadic de- composition with a columnwise orthonormal factor matrix.SIAM Journal on Matrix Analysis and Applications, 33(4):1190–1213, 2012","venue":null,"work_id":"3efcfb82-a86e-4ebd-8c0f-1fe775acf64e","year":2012},"citing_paper":{"arxiv_id":"2506.16032","last_updated":"2025-06-19T05:07:07Z","snapshot_observed_at":"2026-08-07T22:43:08.027896Z","submitted_at":"2025-06-19T05:07:07Z","title":"A Scalable Factorization Approach for High-Order Structured Tensor Recovery","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-06T23:53:11.275492Z"},"links":{"citing_paper":"/paper/2506.16032"},"observation_digest":"sha256:e41ffc1497fa50a6a970cb26cc39111c47d47b93507ba9c02cf65beaebe6f8b2","observation_id":"34dafc33-75d6-422f-b7b8-594d08bf26a9","resolution":{"observed_at":"2026-08-06T23:53:12.713895Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"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-06T23:53:12.701406Z","title":"Probabilistic tensor canonical polyadic decomposition with orthogonal factors.IEEE Transactions on Signal Processing, 65(3):663–676, 2016","venue":null,"work_id":"4b8e8f45-a930-4d85-8e17-cdac98023618","year":2016},"citing_paper":{"arxiv_id":"2506.16032","last_updated":"2025-06-19T05:07:07Z","snapshot_observed_at":"2026-08-07T22:43:08.027896Z","submitted_at":"2025-06-19T05:07:07Z","title":"A Scalable Factorization Approach for High-Order Structured Tensor Recovery","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-06T23:53:11.277845Z"},"links":{"citing_paper":"/paper/2506.16032"},"observation_digest":"sha256:bdd2a8355647a925e4eb38bab71c62a66410b444a1d9b322a8d0cf805bd3e4d2","observation_id":"46110e0b-6e4d-441f-ac68-3f94af8f3b3a","resolution":{"observed_at":"2026-08-06T23:53:12.704546Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.23046","last_updated":"2025-05-29T03:42:03Z","snapshot_observed_at":"2026-08-07T12:52:48.778342Z","submitted_at":"2025-05-29T03:42:03Z","title":"Revisit CP Tensor Decomposition: Statistical Optimality and Fast Convergence","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.23046","snapshot_observed_at":"2026-08-06T23:53:11.279977Z","title":"Revisit cp tensor decomposition: Statistical opti- mality and fast convergence.arXiv preprint arXiv:2505.23046, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.16032","last_updated":"2025-06-19T05:07:07Z","snapshot_observed_at":"2026-08-07T22:43:08.027896Z","submitted_at":"2025-06-19T05:07:07Z","title":"A Scalable Factorization Approach for High-Order Structured Tensor Recovery","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-06T23:53:11.279977Z"},"links":{"cited_paper":"/paper/2505.23046","citing_paper":"/paper/2506.16032"},"observation_digest":"sha256:22c392f4668a03aeea20054d025c77c7da2b57f10212a664b8ab42a92ba8af26","observation_id":"3760b808-239f-4f9c-a581-ab1ad4d0a31a","resolution":{"observed_at":"2026-08-06T23:53:11.279977Z","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-06T23:53:12.691665Z","title":"Nonconvex low-rank tensor completion from noisy data.Advances in neural information processing systems, 32, 2019","venue":null,"work_id":"b32a36df-10de-4af1-9a3f-4963555579d3","year":2019},"citing_paper":{"arxiv_id":"2506.16032","last_updated":"2025-06-19T05:07:07Z","snapshot_observed_at":"2026-08-07T22:43:08.027896Z","submitted_at":"2025-06-19T05:07:07Z","title":"A Scalable Factorization Approach for High-Order Structured Tensor Recovery","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-06T23:53:11.282704Z"},"links":{"citing_paper":"/paper/2506.16032"},"observation_digest":"sha256:b7ffa2a9a4556967464b088877e70f8026e822f1f47f161ce3b39f159c9662ff","observation_id":"cba053ce-2f04-4823-b1b8-8db2651cca21","resolution":{"observed_at":"2026-08-06T23:53:12.695042Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"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-06T23:53:12.681829Z","title":"Sparse tensor additive regression.Journal of machine learning research, 22(64):1–43, 2021","venue":null,"work_id":"a6db4232-a65d-43d2-8f92-29b15a91b5c1","year":2021},"citing_paper":{"arxiv_id":"2506.16032","last_updated":"2025-06-19T05:07:07Z","snapshot_observed_at":"2026-08-07T22:43:08.027896Z","submitted_at":"2025-06-19T05:07:07Z","title":"A Scalable Factorization Approach for High-Order Structured Tensor Recovery","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-06T23:53:11.284952Z"},"links":{"citing_paper":"/paper/2506.16032"},"observation_digest":"sha256:09026b2879932f4d9c4c21f4fd82d20881d094663a9538e302bd6ba5a1b25c9d","observation_id":"feec14c8-ccb1-4456-bedc-3ee7cc8640d7","resolution":{"observed_at":"2026-08-06T23:53:12.685297Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"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-06T23:53:12.670639Z","title":"An optimal statistical and computational framework for generalized tensor estimation.The Annals of Statistics, 50(1):1–29, 2022","venue":null,"work_id":"5d932bdb-16ec-4b0b-a8c3-26b6b27a21cb","year":2022},"citing_paper":{"arxiv_id":"2506.16032","last_updated":"2025-06-19T05:07:07Z","snapshot_observed_at":"2026-08-07T22:43:08.027896Z","submitted_at":"2025-06-19T05:07:07Z","title":"A Scalable Factorization Approach for High-Order Structured Tensor Recovery","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-06T23:53:11.287577Z"},"links":{"citing_paper":"/paper/2506.16032"},"observation_digest":"sha256:78b2919fbbfa85aaf15aa8df6428b2ec31cf43808fa40d8ab1001c20a94250f1","observation_id":"7a5ad92a-5354-46c9-988b-cb0c133d415a","resolution":{"observed_at":"2026-08-06T23:53:12.674080Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"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-06T23:53:12.660133Z","title":"On polynomial time methods for exact low-rank tensor completion.Foundations of Computational Mathematics, 19(6):1265–1313, 2019","venue":null,"work_id":"5e72f7c6-1102-495b-8e64-9ad3d34570bb","year":2019},"citing_paper":{"arxiv_id":"2506.16032","last_updated":"2025-06-19T05:07:07Z","snapshot_observed_at":"2026-08-07T22:43:08.027896Z","submitted_at":"2025-06-19T05:07:07Z","title":"A Scalable Factorization Approach for High-Order Structured Tensor Recovery","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-06T23:53:11.290307Z"},"links":{"citing_paper":"/paper/2506.16032"},"observation_digest":"sha256:10e8157bb1683dfb9f8cba34e8efe2e94dedc985333e591250a4b89e372be5c2","observation_id":"0e48fa6c-bdc3-4908-96a3-8e7e78d10aaa","resolution":{"observed_at":"2026-08-06T23:53:12.664514Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"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-06T23:53:12.649938Z","title":"Scaling and scalability: Provable nonconvex low-rank tensor estimation from incomplete measurements.Journal of Machine Learning Research, 23(163):1–77, 2022","venue":null,"work_id":"66873778-e94b-43d0-ae89-d2c296db3ae4","year":2022},"citing_paper":{"arxiv_id":"2506.16032","last_updated":"2025-06-19T05:07:07Z","snapshot_observed_at":"2026-08-07T22:43:08.027896Z","submitted_at":"2025-06-19T05:07:07Z","title":"A Scalable Factorization Approach for High-Order Structured Tensor Recovery","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-06T23:53:11.292546Z"},"links":{"citing_paper":"/paper/2506.16032"},"observation_digest":"sha256:29a155d9aa2718fa8e5231d91e03c5c34ee5f8a70d651de0be7c10e82d25868e","observation_id":"1baaa813-b990-4f49-9156-646002c78453","resolution":{"observed_at":"2026-08-06T23:53:12.653914Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"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-06T23:53:12.640701Z","title":"Guaranteed nonconvex factorization approach for tensor train recovery.Journal of Machine Learning Research, 25(383):1–48, 2024","venue":null,"work_id":"4c337679-9973-4c03-8770-5e3a5d8e089c","year":2024},"citing_paper":{"arxiv_id":"2506.16032","last_updated":"2025-06-19T05:07:07Z","snapshot_observed_at":"2026-08-07T22:43:08.027896Z","submitted_at":"2025-06-19T05:07:07Z","title":"A Scalable Factorization Approach for High-Order Structured Tensor Recovery","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-06T23:53:11.294873Z"},"links":{"citing_paper":"/paper/2506.16032"},"observation_digest":"sha256:a57c016918e7b87d644ab59d12e6f1e0a16dbd4e4808f23d70904e6c1e01b83a","observation_id":"d0700b47-fff1-4ba9-ab04-73005ab5e2c2","resolution":{"observed_at":"2026-08-06T23:53:12.643986Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"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-06T23:53:12.631111Z","title":"Provable tensor-train format tensor completion by riemannian opti- mization.Journal of Machine Learning Research, 23(123):1–77, 2022","venue":null,"work_id":"dafa6ebb-97a3-450d-a801-fff6729353ef","year":2022},"citing_paper":{"arxiv_id":"2506.16032","last_updated":"2025-06-19T05:07:07Z","snapshot_observed_at":"2026-08-07T22:43:08.027896Z","submitted_at":"2025-06-19T05:07:07Z","title":"A Scalable Factorization Approach for High-Order Structured Tensor Recovery","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-06T23:53:11.297149Z"},"links":{"citing_paper":"/paper/2506.16032"},"observation_digest":"sha256:40965a429b6ca93b6438367f8e5bacae7387b67e7a648c7de0711a2d7d95764d","observation_id":"f8f40ccb-0901-4bed-b39a-cef6e4a32c54","resolution":{"observed_at":"2026-08-06T23:53:12.634578Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"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-06T23:53:12.620560Z","title":"Deep transfer tensor decomposition with orthogonal constraint for recommender systems","venue":null,"work_id":"9f75640e-bcd7-401b-adff-a73546f7a424","year":2021},"citing_paper":{"arxiv_id":"2506.16032","last_updated":"2025-06-19T05:07:07Z","snapshot_observed_at":"2026-08-07T22:43:08.027896Z","submitted_at":"2025-06-19T05:07:07Z","title":"A Scalable Factorization Approach for High-Order Structured Tensor Recovery","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-06T23:53:11.299247Z"},"links":{"citing_paper":"/paper/2506.16032"},"observation_digest":"sha256:8294d5390d387a6e8e4c2032f5e2f955204edd06933bc65c97c7783db22f108a","observation_id":"4b634630-94fd-4420-ac75-df19419e4792","resolution":{"observed_at":"2026-08-06T23:53:12.624479Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"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-06T23:53:12.609991Z","title":"Tensor decompositions for learning latent variable models.Journal of machine learning research, 15:2773–2832, 2014","venue":null,"work_id":"d176b7b6-2c88-4441-b8d7-9dae14bff5c8","year":2014},"citing_paper":{"arxiv_id":"2506.16032","last_updated":"2025-06-19T05:07:07Z","snapshot_observed_at":"2026-08-07T22:43:08.027896Z","submitted_at":"2025-06-19T05:07:07Z","title":"A Scalable Factorization Approach for High-Order Structured Tensor Recovery","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-06T23:53:11.301621Z"},"links":{"citing_paper":"/paper/2506.16032"},"observation_digest":"sha256:564e8612afe1b73c876d58779b329f734812c9ffcda6d7f279e4c7966dba53d0","observation_id":"1769a45d-2c6f-4401-902c-71f1da717e22","resolution":{"observed_at":"2026-08-06T23:53:12.613394Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"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-06T23:53:12.600218Z","title":"Low-rank matrix completion using alternating mini- mization","venue":null,"work_id":"55c223e6-765b-4daf-a41b-f5217d5583ed","year":2013},"citing_paper":{"arxiv_id":"2506.16032","last_updated":"2025-06-19T05:07:07Z","snapshot_observed_at":"2026-08-07T22:43:08.027896Z","submitted_at":"2025-06-19T05:07:07Z","title":"A Scalable Factorization Approach for High-Order Structured Tensor Recovery","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-06T23:53:11.303879Z"},"links":{"citing_paper":"/paper/2506.16032"},"observation_digest":"sha256:3b3bb330f24b48f09374fc7f85633d6f158430e210b4ff3979cf9e89c127357c","observation_id":"0af261c5-c8cd-4e45-a41e-10e323c1ef83","resolution":{"observed_at":"2026-08-06T23:53:12.603451Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"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-06T23:53:12.588796Z","title":"Low-rank solutions of linear matrix equations via procrustes flow","venue":null,"work_id":"551de824-8a5c-42fe-a089-1b673a009812","year":2016},"citing_paper":{"arxiv_id":"2506.16032","last_updated":"2025-06-19T05:07:07Z","snapshot_observed_at":"2026-08-07T22:43:08.027896Z","submitted_at":"2025-06-19T05:07:07Z","title":"A Scalable Factorization Approach for High-Order Structured Tensor Recovery","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-06T23:53:11.306259Z"},"links":{"citing_paper":"/paper/2506.16032"},"observation_digest":"sha256:5100fe5ec63e99d35d3374b1f8e6a4ba3ed61521edaab1ae95c2f5f5ef470847","observation_id":"2f4bff27-2243-4fdc-81c4-6e7354d48c19","resolution":{"observed_at":"2026-08-06T23:53:12.592636Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"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-06T23:53:12.579070Z","title":"A unified computational and statistical framework for noncon- vex low-rank matrix estimation","venue":null,"work_id":"91b19a29-8f8a-49a6-9082-d7e84324124a","year":2017},"citing_paper":{"arxiv_id":"2506.16032","last_updated":"2025-06-19T05:07:07Z","snapshot_observed_at":"2026-08-07T22:43:08.027896Z","submitted_at":"2025-06-19T05:07:07Z","title":"A Scalable Factorization Approach for High-Order Structured Tensor Recovery","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-06T23:53:11.308740Z"},"links":{"citing_paper":"/paper/2506.16032"},"observation_digest":"sha256:2f390362c81d062d0dd8ed0bd51a9000745e899d9a0ef6615eeb84b1ed5d88a0","observation_id":"dcb4f174-05c0-4a9e-8aa4-54e5f27c0ba1","resolution":{"observed_at":"2026-08-06T23:53:12.582600Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"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-06T23:53:12.568318Z","title":"Global optimality in low-rank matrix optimiza- tion.IEEE Transactions on Signal Processing, 66(13):3614–3628, 2018","venue":null,"work_id":"c60255bf-e733-4d32-b646-989c09920fbb","year":2018},"citing_paper":{"arxiv_id":"2506.16032","last_updated":"2025-06-19T05:07:07Z","snapshot_observed_at":"2026-08-07T22:43:08.027896Z","submitted_at":"2025-06-19T05:07:07Z","title":"A Scalable Factorization Approach for High-Order Structured Tensor Recovery","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-06T23:53:11.312516Z"},"links":{"citing_paper":"/paper/2506.16032"},"observation_digest":"sha256:882261cd78c9f6b400fc55a1bc92c0ab9934f381ec22bad0cd9e232d39ce937b","observation_id":"c9b324d6-905a-44e5-8b63-c27b5f0abb4d","resolution":{"observed_at":"2026-08-06T23:53:12.572176Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"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-06T23:53:11.316585Z","title":"Nonconvex robust low-rank matrix recovery.SIAM Journal on Optimization, 30(1):660–686, 2020","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2506.16032","last_updated":"2025-06-19T05:07:07Z","snapshot_observed_at":"2026-08-07T22:43:08.027896Z","submitted_at":"2025-06-19T05:07:07Z","title":"A Scalable Factorization Approach for High-Order Structured Tensor Recovery","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-06T23:53:11.316585Z"},"links":{"citing_paper":"/paper/2506.16032"},"observation_digest":"sha256:ba4a4ec3c7b412a35afa734a3e375355ceb063edd37aea8de80f3f060a424599","observation_id":"e5a06c9c-49a5-400e-b9e1-be444afa0291","resolution":{"observed_at":"2026-08-06T23:53:11.316585Z","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-06T23:53:12.552994Z","title":"Accelerating ill-conditioned low-rank matrix estimation via scaled gradient descent.J","venue":null,"work_id":"cd5f4e7a-49ed-4325-a5b5-408365e8ac47","year":2021},"citing_paper":{"arxiv_id":"2506.16032","last_updated":"2025-06-19T05:07:07Z","snapshot_observed_at":"2026-08-07T22:43:08.027896Z","submitted_at":"2025-06-19T05:07:07Z","title":"A Scalable Factorization Approach for High-Order Structured Tensor Recovery","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-06T23:53:11.320479Z"},"links":{"citing_paper":"/paper/2506.16032"},"observation_digest":"sha256:7b4f38c2c810caf56691163aae4f9eef454b4516acae65f4e15b97e2386016e4","observation_id":"88e1b1d9-41b5-490d-825a-859cfe0e835e","resolution":{"observed_at":"2026-08-06T23:53:12.556824Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"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-06T23:53:12.543689Z","title":"Beyond procrustes: Balancing-free gradient descent for asymmetric low-rank matrix sensing.IEEE Transactions on Signal Processing, 69:867–877, 2021","venue":null,"work_id":"ae37d9ba-8700-408a-bdda-f71dfee74e96","year":2021},"citing_paper":{"arxiv_id":"2506.16032","last_updated":"2025-06-19T05:07:07Z","snapshot_observed_at":"2026-08-07T22:43:08.027896Z","submitted_at":"2025-06-19T05:07:07Z","title":"A Scalable Factorization Approach for High-Order Structured Tensor Recovery","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-06T23:53:11.322809Z"},"links":{"citing_paper":"/paper/2506.16032"},"observation_digest":"sha256:d22bc734fd8ab6de74a8977e314c01b06ad454b9d3d4d977292724733c3638f3","observation_id":"6fa730d1-7e0f-4fc6-bd0a-7a76c0ea8361","resolution":{"observed_at":"2026-08-06T23:53:12.546905Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"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-06T23:53:12.533449Z","title":"Fast and provable tensor robust principal component analysis via scaled gradient descent.Information and Inference: A Journal of the IMA, 12(3):iaad019, 2023","venue":null,"work_id":"96f66688-8b93-4dd6-b8ee-003a248fc946","year":2023},"citing_paper":{"arxiv_id":"2506.16032","last_updated":"2025-06-19T05:07:07Z","snapshot_observed_at":"2026-08-07T22:43:08.027896Z","submitted_at":"2025-06-19T05:07:07Z","title":"A Scalable Factorization Approach for High-Order Structured Tensor Recovery","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-06T23:53:11.325358Z"},"links":{"citing_paper":"/paper/2506.16032"},"observation_digest":"sha256:177861233b5dc29cd39ec08104f9ed9269c4401a3432840893a8dc4d1bf685c9","observation_id":"28ab9f1c-428d-43bc-a53b-75bc6d4b0232","resolution":{"observed_at":"2026-08-06T23:53:12.537082Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1609.05587","last_updated":"2016-09-19T03:25:33Z","snapshot_observed_at":"2026-07-06T05:11:17.429764Z","submitted_at":"2016-09-19T03:25:33Z","title":"Tensor Completion by Alternating Minimization under the Tensor Train (TT) Model","version":1},"cited_work":{"arxiv_id":"1609.05587","doi":null,"metadata_source":"pith","pith_arxiv_id":"1609.05587","snapshot_observed_at":"2026-08-06T23:53:12.233692Z","title":"Tensor Completion by Alternating Minimization under the Tensor Train (TT) Model","venue":"cs.NA","work_id":"e7658d34-af48-48eb-aaca-ab6d87929847","year":2016},"citing_paper":{"arxiv_id":"2506.16032","last_updated":"2025-06-19T05:07:07Z","snapshot_observed_at":"2026-08-07T22:43:08.027896Z","submitted_at":"2025-06-19T05:07:07Z","title":"A Scalable Factorization Approach for High-Order Structured Tensor Recovery","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-06T23:53:11.329188Z"},"links":{"cited_paper":"/paper/1609.05587","citing_paper":"/paper/2506.16032"},"observation_digest":"sha256:70a66a47f4bf2bcb990a593d6cc1164ff925891c4d4a729d3e2be960a807a61e","observation_id":"cf0ecd49-aad7-4bf6-879f-3ed54a1c978d","resolution":{"observed_at":"2026-08-06T23:53:12.237597Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"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-06T23:53:12.523410Z","title":"High-order tensor completion via gradient-based optimization under tensor train format.Signal Processing: Image Communication, 73:53–61, 2019","venue":null,"work_id":"b23e96a5-775c-46c7-9029-268a507d256c","year":2019},"citing_paper":{"arxiv_id":"2506.16032","last_updated":"2025-06-19T05:07:07Z","snapshot_observed_at":"2026-08-07T22:43:08.027896Z","submitted_at":"2025-06-19T05:07:07Z","title":"A Scalable Factorization Approach for High-Order Structured Tensor Recovery","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-06T23:53:11.341743Z"},"links":{"citing_paper":"/paper/2506.16032"},"observation_digest":"sha256:c2f422403221cd60bc3bc45b17057a5e80e7dd33d1cf403f3037d3fda7b9e40a","observation_id":"f223a97b-05fd-432a-a83e-2734d6cd6809","resolution":{"observed_at":"2026-08-06T23:53:12.527229Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"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-06T23:53:12.511498Z","title":"Low rank tensor recovery via iterative hard threshold- ing.Linear Algebra and its Applications, 523:220–262, 2017","venue":null,"work_id":"33383869-389a-4ae4-b7ef-cb3d263c538a","year":2017},"citing_paper":{"arxiv_id":"2506.16032","last_updated":"2025-06-19T05:07:07Z","snapshot_observed_at":"2026-08-07T22:43:08.027896Z","submitted_at":"2025-06-19T05:07:07Z","title":"A Scalable Factorization Approach for High-Order Structured Tensor Recovery","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-06T23:53:11.412275Z"},"links":{"citing_paper":"/paper/2506.16032"},"observation_digest":"sha256:45152fd833f50d70489eb22b30d3a89f448820a34d86c7ace9afcacc294e8ab3","observation_id":"d9ae107b-245c-4980-8d55-65d3d5a0d3ba","resolution":{"observed_at":"2026-08-06T23:53:12.516145Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"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-06T23:53:12.502453Z","title":"Tensor completion in hierarchical tensor representa- tions","venue":null,"work_id":"44a1662a-5f0d-4e18-8c39-e795e8e8689e","year":2015},"citing_paper":{"arxiv_id":"2506.16032","last_updated":"2025-06-19T05:07:07Z","snapshot_observed_at":"2026-08-07T22:43:08.027896Z","submitted_at":"2025-06-19T05:07:07Z","title":"A Scalable Factorization Approach for High-Order Structured Tensor Recovery","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-06T23:53:11.465197Z"},"links":{"citing_paper":"/paper/2506.16032"},"observation_digest":"sha256:5b9c69932da07851f31ffd499f3a18c41bc41ebcf111e8f8786e11fc460108d2","observation_id":"407996a1-17a4-4fb9-a284-ca50bd6cc45b","resolution":{"observed_at":"2026-08-06T23:53:12.505740Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"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-06T23:53:12.493525Z","title":"Non-convex projected gradient descent for generalized low-rank tensor regression.The Journal of Machine Learning Research, 20(1):172–208, 2019","venue":null,"work_id":"15ee70b0-0c9f-4baa-8ef9-122e1217aace","year":2019},"citing_paper":{"arxiv_id":"2506.16032","last_updated":"2025-06-19T05:07:07Z","snapshot_observed_at":"2026-08-07T22:43:08.027896Z","submitted_at":"2025-06-19T05:07:07Z","title":"A Scalable Factorization Approach for High-Order Structured Tensor Recovery","version":1},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-06T23:53:11.560258Z"},"links":{"citing_paper":"/paper/2506.16032"},"observation_digest":"sha256:3cce99a38aef1db74b47d7af5d2093ada38148da182c9a458edce77db9ac4cae","observation_id":"a9bbf89e-500c-4d1c-8344-cfa6158ced01","resolution":{"observed_at":"2026-08-06T23:53:12.497003Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"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-06T23:53:12.483688Z","title":"Low-rank tensor completion by riemannian optimization.BIT Numerical Mathematics, 54(2):447–468, 2014","venue":null,"work_id":"e2a4bfb9-31e0-43f6-a6f7-c3c209175d32","year":2014},"citing_paper":{"arxiv_id":"2506.16032","last_updated":"2025-06-19T05:07:07Z","snapshot_observed_at":"2026-08-07T22:43:08.027896Z","submitted_at":"2025-06-19T05:07:07Z","title":"A Scalable Factorization Approach for High-Order Structured Tensor Recovery","version":1},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-06T23:53:11.655462Z"},"links":{"citing_paper":"/paper/2506.16032"},"observation_digest":"sha256:27f0372caa7ae03f2e971292d9d49884c97951337c9e85ed77a4f5f5d2a42cd3","observation_id":"bd9a6641-6697-466c-ab38-1efe0e969319","resolution":{"observed_at":"2026-08-06T23:53:12.487360Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2110.03975","last_updated":"2023-08-30T15:32:59Z","snapshot_observed_at":"2026-07-06T11:55:46.120212Z","submitted_at":"2021-10-08T08:49:35Z","title":"Tensor train completion: local recovery guarantees via Riemannian optimization","version":3},"cited_work":{"arxiv_id":"2110.03975","doi":null,"metadata_source":"pith","pith_arxiv_id":"2110.03975","snapshot_observed_at":"2026-08-06T23:53:12.221821Z","title":"Tensor train completion: local recovery guarantees via Riemannian optimization","venue":"math.NA","work_id":"0f5429d3-fa4e-4ef6-b0c2-514e1b03fdd0","year":2021},"citing_paper":{"arxiv_id":"2506.16032","last_updated":"2025-06-19T05:07:07Z","snapshot_observed_at":"2026-08-07T22:43:08.027896Z","submitted_at":"2025-06-19T05:07:07Z","title":"A Scalable Factorization Approach for High-Order Structured Tensor Recovery","version":1},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-06T23:53:11.711626Z"},"links":{"cited_paper":"/paper/2110.03975","citing_paper":"/paper/2506.16032"},"observation_digest":"sha256:aa7c7b1aeab8038027f377dd26bb18a9b46cf34cf8767b0bf585165cf6089ff9","observation_id":"25868d3e-3469-4223-a57a-afaeaf976291","resolution":{"observed_at":"2026-08-06T23:53:12.225259Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"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-06T23:53:12.474758Z","title":"Tensor completion using low-rank tensor train decomposition by riemannian optimization","venue":null,"work_id":"10908e0e-a40b-4694-8200-afc7f2b6b3c2","year":2019},"citing_paper":{"arxiv_id":"2506.16032","last_updated":"2025-06-19T05:07:07Z","snapshot_observed_at":"2026-08-07T22:43:08.027896Z","submitted_at":"2025-06-19T05:07:07Z","title":"A Scalable Factorization Approach for High-Order Structured Tensor Recovery","version":1},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-08-06T23:53:11.791107Z"},"links":{"citing_paper":"/paper/2506.16032"},"observation_digest":"sha256:2a8bbd3b96ded6287baf17711214420ddacd71008dc668cfd678ce9f7b134a73","observation_id":"f3054bed-ec07-4615-96b8-8c09b75c2008","resolution":{"observed_at":"2026-08-06T23:53:12.478046Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2104.12031","last_updated":"2023-07-09T02:04:21Z","snapshot_observed_at":"2026-07-06T11:03:19.305080Z","submitted_at":"2021-04-24T22:24:14Z","title":"Low-rank Tensor Estimation via Riemannian Gauss-Newton: Statistical Optimality and Second-Order Convergence","version":4},"cited_work":{"arxiv_id":"2104.12031","doi":null,"metadata_source":"pith","pith_arxiv_id":"2104.12031","snapshot_observed_at":"2026-08-06T23:53:12.209351Z","title":"Low-rank Tensor Estimation via Riemannian Gauss-Newton: Statistical Optimality and Second-Order Convergence","venue":"stat.ML","work_id":"6156aa22-dc51-49ad-ac0a-916d56376b11","year":2021},"citing_paper":{"arxiv_id":"2506.16032","last_updated":"2025-06-19T05:07:07Z","snapshot_observed_at":"2026-08-07T22:43:08.027896Z","submitted_at":"2025-06-19T05:07:07Z","title":"A Scalable Factorization Approach for High-Order Structured Tensor Recovery","version":1},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-08-06T23:53:11.858879Z"},"links":{"cited_paper":"/paper/2104.12031","citing_paper":"/paper/2506.16032"},"observation_digest":"sha256:93f5cd3fdd9c6016c03e573f2334f65b501c110e9d6af4a6a425cd301126fcb4","observation_id":"33615cd8-0441-4ab3-83a8-fe6a757e6648","resolution":{"observed_at":"2026-08-06T23:53:12.213535Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2206.08756","last_updated":"2024-01-15T22:35:00Z","snapshot_observed_at":"2026-08-03T16:31:26.424208Z","submitted_at":"2022-06-17T13:15:27Z","title":"Tensor-on-Tensor Regression: Riemannian Optimization, Over-parameterization, Statistical-computational Gap, and Their Interplay","version":3},"cited_work":{"arxiv_id":"2206.08756","doi":null,"metadata_source":"pith","pith_arxiv_id":"2206.08756","snapshot_observed_at":"2026-08-06T23:53:12.196837Z","title":"Tensor-on-Tensor Regression: Riemannian Optimization, Over-parameterization, Statistical-computational Gap, and Their Interplay","venue":"math.ST","work_id":"242fbdef-b86d-4875-84cf-e6923e7d8d4c","year":2022},"citing_paper":{"arxiv_id":"2506.16032","last_updated":"2025-06-19T05:07:07Z","snapshot_observed_at":"2026-08-07T22:43:08.027896Z","submitted_at":"2025-06-19T05:07:07Z","title":"A Scalable Factorization Approach for High-Order Structured Tensor Recovery","version":1},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-08-06T23:53:11.916259Z"},"links":{"cited_paper":"/paper/2206.08756","citing_paper":"/paper/2506.16032"},"observation_digest":"sha256:af107bbfc405d75f10f486d324a65984c7bffa5966f1707cfc9230c977671a94","observation_id":"6628e924-082a-4ea3-bcb8-4f216c30d83d","resolution":{"observed_at":"2026-08-06T23:53:12.201153Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2406.06002","last_updated":"2025-05-01T07:40:24Z","snapshot_observed_at":"2026-07-06T18:27:54.379381Z","submitted_at":"2024-06-10T03:51:38Z","title":"Computational and Statistical Guarantees for Tensor-on-Tensor Regression with Tensor Train Decomposition","version":2},"cited_work":{"arxiv_id":"2406.06002","doi":null,"metadata_source":"pith","pith_arxiv_id":"2406.06002","snapshot_observed_at":"2026-08-06T23:53:12.182818Z","title":"Computational and Statistical Guarantees for Tensor-on-Tensor Regression with Tensor Train Decomposition","venue":"cs.LG","work_id":"7aaf62cc-8b29-46c6-b9d6-e00f3f6cd785","year":2024},"citing_paper":{"arxiv_id":"2506.16032","last_updated":"2025-06-19T05:07:07Z","snapshot_observed_at":"2026-08-07T22:43:08.027896Z","submitted_at":"2025-06-19T05:07:07Z","title":"A Scalable Factorization Approach for High-Order Structured Tensor Recovery","version":1},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-08-06T23:53:11.974626Z"},"links":{"cited_paper":"/paper/2406.06002","citing_paper":"/paper/2506.16032"},"observation_digest":"sha256:0eada3df1612e5d7a453ea2f3cd17dfc7a2be7539793bcd797bdf1a8d27dd3ce","observation_id":"cf15d043-1fa7-4518-a6ea-ac2d97d5e8ec","resolution":{"observed_at":"2026-08-06T23:53:12.188292Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"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-06T23:53:11.995793Z","title":"Princeton University Press, 2008","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2506.16032","last_updated":"2025-06-19T05:07:07Z","snapshot_observed_at":"2026-08-07T22:43:08.027896Z","submitted_at":"2025-06-19T05:07:07Z","title":"A Scalable Factorization Approach for High-Order Structured Tensor Recovery","version":1},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-08-06T23:53:11.995793Z"},"links":{"citing_paper":"/paper/2506.16032"},"observation_digest":"sha256:e287e1441249fc98814ebeb1c15797003f46ffaffb482e7477aec9abe7912d76","observation_id":"7a8be15a-4136-4164-9222-3e66d723c970","resolution":{"observed_at":"2026-08-06T23:53:11.995793Z","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-06T23:53:12.460593Z","title":"Cambridge University Press, 2017","venue":null,"work_id":"4b8e5b9e-5f77-49a9-b96b-9728ed3cbac3","year":2017},"citing_paper":{"arxiv_id":"2506.16032","last_updated":"2025-06-19T05:07:07Z","snapshot_observed_at":"2026-08-07T22:43:08.027896Z","submitted_at":"2025-06-19T05:07:07Z","title":"A Scalable Factorization Approach for High-Order Structured Tensor Recovery","version":1},"reference_index":70,"source":"pdf_text","source_observed_at":"2026-08-06T23:53:12.074916Z"},"links":{"citing_paper":"/paper/2506.16032"},"observation_digest":"sha256:fd76c8df1d00d3267715742a896e33cad8cc190e7fce319f75e307844fcfdbc8","observation_id":"b9602302-aa5b-42b3-b281-82bd7fc71e79","resolution":{"observed_at":"2026-08-06T23:53:12.463676Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"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-06T23:53:12.451636Z","title":"Solving random quadratic systems of equations is nearly as easy as solving linear systems.Advances in Neural Information Processing Systems, 28, 2015","venue":null,"work_id":"8df97913-d3b5-49a5-ba4c-67cdf5046020","year":2015},"citing_paper":{"arxiv_id":"2506.16032","last_updated":"2025-06-19T05:07:07Z","snapshot_observed_at":"2026-08-07T22:43:08.027896Z","submitted_at":"2025-06-19T05:07:07Z","title":"A Scalable Factorization Approach for High-Order Structured Tensor Recovery","version":1},"reference_index":71,"source":"pdf_text","source_observed_at":"2026-08-06T23:53:12.093495Z"},"links":{"citing_paper":"/paper/2506.16032"},"observation_digest":"sha256:710cb6a99de8f239336cce759c60104438598c25b4262b249c86587ef402da96","observation_id":"642319ee-9e53-4049-a144-6393e1097edc","resolution":{"observed_at":"2026-08-06T23:53:12.454950Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"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-06T23:53:12.442615Z","title":"Phase retrieval via wirtinger flow: Theory and algorithms.IEEE Transactions on Information Theory, 61(4):1985–2007, 2015","venue":null,"work_id":"ff25949c-f613-4ecd-ae35-5b29f9807036","year":1985},"citing_paper":{"arxiv_id":"2506.16032","last_updated":"2025-06-19T05:07:07Z","snapshot_observed_at":"2026-08-07T22:43:08.027896Z","submitted_at":"2025-06-19T05:07:07Z","title":"A Scalable Factorization Approach for High-Order Structured Tensor Recovery","version":1},"reference_index":72,"source":"pdf_text","source_observed_at":"2026-08-06T23:53:12.108805Z"},"links":{"citing_paper":"/paper/2506.16032"},"observation_digest":"sha256:a4440de4f110543ad84b1e3c0c4fa052328f7a962564e8512fd11e9260221c53","observation_id":"0e9b166e-bd36-411e-828c-2b8af6117fa0","resolution":{"observed_at":"2026-08-06T23:53:12.446010Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"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-06T23:53:12.433754Z","title":null,"venue":null,"work_id":"fcce956c-239f-40a6-a76f-de1754cee92f","year":2019},"citing_paper":{"arxiv_id":"2506.16032","last_updated":"2025-06-19T05:07:07Z","snapshot_observed_at":"2026-08-07T22:43:08.027896Z","submitted_at":"2025-06-19T05:07:07Z","title":"A Scalable Factorization Approach for High-Order Structured Tensor Recovery","version":1},"reference_index":73,"source":"pdf_text","source_observed_at":"2026-08-06T23:53:12.111404Z"},"links":{"citing_paper":"/paper/2506.16032"},"observation_digest":"sha256:add76d2984ed36ea6b197de27ff44fa31b36a94c54710c956f3ffd1d497e3509","observation_id":"a098fa14-cb35-4710-be9f-6d61896c4e0d","resolution":{"observed_at":"2026-08-06T23:53:12.436969Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"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-06T23:53:12.113695Z","title":"Nonconvex optimization meets low-rank matrix factorization: An overview.IEEE Transactions on Signal Processing, 67(20):5239–5269, 2019","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2506.16032","last_updated":"2025-06-19T05:07:07Z","snapshot_observed_at":"2026-08-07T22:43:08.027896Z","submitted_at":"2025-06-19T05:07:07Z","title":"A Scalable Factorization Approach for High-Order Structured Tensor Recovery","version":1},"reference_index":74,"source":"pdf_text","source_observed_at":"2026-08-06T23:53:12.113695Z"},"links":{"citing_paper":"/paper/2506.16032"},"observation_digest":"sha256:73bc0ee1e2028f662f96eb0735e0c9bdca4c69f0fe1bca155f60d5abad2f50f0","observation_id":"42a94f56-063a-4617-b582-103cf1b007e1","resolution":{"observed_at":"2026-08-06T23:53:12.113695Z","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-06T23:53:12.419464Z","title":"A deterministic theory for exact non-convex phase retrieval.IEEE Transac- tions on Signal Processing, 68:4612–4626, 2020","venue":null,"work_id":"c8e99ad3-bcb6-479c-8c86-6ddedd5bf6f3","year":2020},"citing_paper":{"arxiv_id":"2506.16032","last_updated":"2025-06-19T05:07:07Z","snapshot_observed_at":"2026-08-07T22:43:08.027896Z","submitted_at":"2025-06-19T05:07:07Z","title":"A Scalable Factorization Approach for High-Order Structured Tensor Recovery","version":1},"reference_index":75,"source":"pdf_text","source_observed_at":"2026-08-06T23:53:12.116347Z"},"links":{"citing_paper":"/paper/2506.16032"},"observation_digest":"sha256:4418b348b4daf7ab28d62f69c24735eee26754fc91cd4b232ebd991b4059e158","observation_id":"94029b38-4ce4-4644-abd5-84f8c833341f","resolution":{"observed_at":"2026-08-06T23:53:12.422842Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"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-06T23:53:12.409558Z","title":"Hierarchical singular value decomposition of tensors.SIAM journal on matrix analysis and applications, 31(4):2029–2054, 2010","venue":null,"work_id":"083f3a46-4f0e-43e6-b317-85e33ce6e96b","year":2010},"citing_paper":{"arxiv_id":"2506.16032","last_updated":"2025-06-19T05:07:07Z","snapshot_observed_at":"2026-08-07T22:43:08.027896Z","submitted_at":"2025-06-19T05:07:07Z","title":"A Scalable Factorization Approach for High-Order Structured Tensor Recovery","version":1},"reference_index":76,"source":"pdf_text","source_observed_at":"2026-08-06T23:53:12.118680Z"},"links":{"citing_paper":"/paper/2506.16032"},"observation_digest":"sha256:15f9880c1d9540d1afd6f63bfe39e7dcdd0f43661a29535064aa75cd07724041","observation_id":"a6ccdac2-8eda-4de7-bdb3-b7fa6cba142b","resolution":{"observed_at":"2026-08-06T23:53:12.413571Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"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-06T23:53:12.400273Z","title":"Optimization on the hierarchical tucker manifold–applications to tensor completion.Linear Algebra and its Applications, 481:131–173, 2015","venue":null,"work_id":"b8ed9da0-0d41-4629-bfd1-0408472f615d","year":2015},"citing_paper":{"arxiv_id":"2506.16032","last_updated":"2025-06-19T05:07:07Z","snapshot_observed_at":"2026-08-07T22:43:08.027896Z","submitted_at":"2025-06-19T05:07:07Z","title":"A Scalable Factorization Approach for High-Order Structured Tensor Recovery","version":1},"reference_index":77,"source":"pdf_text","source_observed_at":"2026-08-06T23:53:12.121014Z"},"links":{"citing_paper":"/paper/2506.16032"},"observation_digest":"sha256:f016905b0993dc33f0744cfe365c3222b8c640f307098b56b1f42b5a606f3740","observation_id":"ab09970d-1ecf-427e-8c37-1a3ca165f0fa","resolution":{"observed_at":"2026-08-06T23:53:12.403678Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"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-06T23:53:12.391243Z","title":"Tensor networks for dimensionality reduction and large-scale optimization: Part 1 low-rank tensor decompositions","venue":null,"work_id":"19346f33-71c0-4e11-b27c-eafed23fa07d","year":2016},"citing_paper":{"arxiv_id":"2506.16032","last_updated":"2025-06-19T05:07:07Z","snapshot_observed_at":"2026-08-07T22:43:08.027896Z","submitted_at":"2025-06-19T05:07:07Z","title":"A Scalable Factorization Approach for High-Order Structured Tensor Recovery","version":1},"reference_index":78,"source":"pdf_text","source_observed_at":"2026-08-06T23:53:12.123179Z"},"links":{"citing_paper":"/paper/2506.16032"},"observation_digest":"sha256:09125e116aacea7a9ac1ff9918095c37df13eee4dd3cea2dfd476b5424e2ccd7","observation_id":"18154b20-2522-4e2f-8a7f-08380bc6f89a","resolution":{"observed_at":"2026-08-06T23:53:12.394401Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"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-06T23:53:12.382527Z","title":"Tensor networks for complex quantum systems.Nature Reviews Physics, 1(9):538–550, 2019","venue":null,"work_id":"190633c4-17f1-4e10-ba20-fdf55c616771","year":2019},"citing_paper":{"arxiv_id":"2506.16032","last_updated":"2025-06-19T05:07:07Z","snapshot_observed_at":"2026-08-07T22:43:08.027896Z","submitted_at":"2025-06-19T05:07:07Z","title":"A Scalable Factorization Approach for High-Order Structured Tensor Recovery","version":1},"reference_index":79,"source":"pdf_text","source_observed_at":"2026-08-06T23:53:12.125860Z"},"links":{"citing_paper":"/paper/2506.16032"},"observation_digest":"sha256:4a241eb518f67f2fd3fb5e438bb1820089b1a4d4c6242ed4405f2a35dad3f62a","observation_id":"2e01ee3e-222a-4b20-9992-c58986bf76df","resolution":{"observed_at":"2026-08-06T23:53:12.385774Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"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-06T23:53:12.373465Z","title":"Tensor learning for regression.IEEE Transactions on Image Processing, 21(2):816–827, 2011","venue":null,"work_id":"c4964557-48ba-488e-8aa4-4fbf13111755","year":2011},"citing_paper":{"arxiv_id":"2506.16032","last_updated":"2025-06-19T05:07:07Z","snapshot_observed_at":"2026-08-07T22:43:08.027896Z","submitted_at":"2025-06-19T05:07:07Z","title":"A Scalable Factorization Approach for High-Order Structured Tensor Recovery","version":1},"reference_index":80,"source":"pdf_text","source_observed_at":"2026-08-06T23:53:12.128245Z"},"links":{"citing_paper":"/paper/2506.16032"},"observation_digest":"sha256:d98bd966f12420df31e6e69acb6e9e917ad64302b6c388d6f2d4e6882d8f27b1","observation_id":"71458a96-08cc-4763-a572-ab15a0da6b02","resolution":{"observed_at":"2026-08-06T23:53:12.376630Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"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-06T23:53:12.364755Z","title":"Sparse and low-rank tensor estimation via cubic sketchings","venue":null,"work_id":"babb4a99-1ed7-4c26-8863-a7a4361b2e93","year":2020},"citing_paper":{"arxiv_id":"2506.16032","last_updated":"2025-06-19T05:07:07Z","snapshot_observed_at":"2026-08-07T22:43:08.027896Z","submitted_at":"2025-06-19T05:07:07Z","title":"A Scalable Factorization Approach for High-Order Structured Tensor Recovery","version":1},"reference_index":81,"source":"pdf_text","source_observed_at":"2026-08-06T23:53:12.130451Z"},"links":{"citing_paper":"/paper/2506.16032"},"observation_digest":"sha256:b7ead2db3538d9cda863bb6eea3f4e561189cb30976c3c1d0e0f8794a7740e5a","observation_id":"0177318c-82f4-4799-8b10-41b9a73493cf","resolution":{"observed_at":"2026-08-06T23:53:12.368017Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"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-06T23:53:12.356043Z","title":"Tensor regression with applications in neuroimaging data analysis.Journal of the American Statistical Association, 108(502):540–552, 2013","venue":null,"work_id":"df466d93-d69c-4f30-a129-24116b7aeaa2","year":2013},"citing_paper":{"arxiv_id":"2506.16032","last_updated":"2025-06-19T05:07:07Z","snapshot_observed_at":"2026-08-07T22:43:08.027896Z","submitted_at":"2025-06-19T05:07:07Z","title":"A Scalable Factorization Approach for High-Order Structured Tensor Recovery","version":1},"reference_index":82,"source":"pdf_text","source_observed_at":"2026-08-06T23:53:12.132696Z"},"links":{"citing_paper":"/paper/2506.16032"},"observation_digest":"sha256:2191dd610e3d5515b14c6a26599c59591c1318ab2aec06ff18f22094434eb371","observation_id":"ea4d9396-ef8a-474a-a5c1-46a2dbeadde5","resolution":{"observed_at":"2026-08-06T23:53:12.359362Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"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-06T23:53:12.135176Z","title":"Compressed sensing.IEEE Transactions on information theory, 52(4):1289–1306, 2006","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2506.16032","last_updated":"2025-06-19T05:07:07Z","snapshot_observed_at":"2026-08-07T22:43:08.027896Z","submitted_at":"2025-06-19T05:07:07Z","title":"A Scalable Factorization Approach for High-Order Structured Tensor Recovery","version":1},"reference_index":83,"source":"pdf_text","source_observed_at":"2026-08-06T23:53:12.135176Z"},"links":{"citing_paper":"/paper/2506.16032"},"observation_digest":"sha256:3531c2ac279323dfdc2f37200903e0a484cef959d177e8aa9b2ad076eb6b6a93","observation_id":"04ba70d3-3e0b-4c3a-999e-b78917d12306","resolution":{"observed_at":"2026-08-06T23:53:12.135176Z","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-06T23:53:12.342296Z","title":"Robust uncertainty principles: Exact signal reconstruc- tion from highly incomplete frequency information.IEEE Transactions on information theory, 52(2):489–509, 2006","venue":null,"work_id":"ae75aed7-403a-458a-9cc2-dea86dd241e8","year":2006},"citing_paper":{"arxiv_id":"2506.16032","last_updated":"2025-06-19T05:07:07Z","snapshot_observed_at":"2026-08-07T22:43:08.027896Z","submitted_at":"2025-06-19T05:07:07Z","title":"A Scalable Factorization Approach for High-Order Structured Tensor Recovery","version":1},"reference_index":84,"source":"pdf_text","source_observed_at":"2026-08-06T23:53:12.137468Z"},"links":{"citing_paper":"/paper/2506.16032"},"observation_digest":"sha256:5941b11a2272071e18c37a9525d69de0825999e2ff13315e0bbcde69ab2565c9","observation_id":"fd76e9d3-c1ba-416d-a3e1-2d7e35a73aac","resolution":{"observed_at":"2026-08-06T23:53:12.345555Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"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-06T23:53:12.332883Z","title":"An introduction to compressive sampling.IEEE signal processing magazine, 25(2):21–30, 2008","venue":null,"work_id":"711dc954-01a3-4c19-ab90-0bbd04a1c345","year":2008},"citing_paper":{"arxiv_id":"2506.16032","last_updated":"2025-06-19T05:07:07Z","snapshot_observed_at":"2026-08-07T22:43:08.027896Z","submitted_at":"2025-06-19T05:07:07Z","title":"A Scalable Factorization Approach for High-Order Structured Tensor Recovery","version":1},"reference_index":85,"source":"pdf_text","source_observed_at":"2026-08-06T23:53:12.140159Z"},"links":{"citing_paper":"/paper/2506.16032"},"observation_digest":"sha256:4f3eca4644aa425fdd6f79edc9a550ac0d971fc2bbb18b305ed2e49ca63e8135","observation_id":"d61bb63f-87fc-457b-a66f-6b29522497cf","resolution":{"observed_at":"2026-08-06T23:53:12.336234Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"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-06T23:53:12.142602Z","title":"Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization.SIAM review, 52(3):471–501, 2010","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2506.16032","last_updated":"2025-06-19T05:07:07Z","snapshot_observed_at":"2026-08-07T22:43:08.027896Z","submitted_at":"2025-06-19T05:07:07Z","title":"A Scalable Factorization Approach for High-Order Structured Tensor Recovery","version":1},"reference_index":86,"source":"pdf_text","source_observed_at":"2026-08-06T23:53:12.142602Z"},"links":{"citing_paper":"/paper/2506.16032"},"observation_digest":"sha256:9d985e48404364db0ea472df20703126d6b9fef6cf5fe38928ca0cdf4e44828a","observation_id":"4115f523-bc96-4c5d-9b6c-8800f2c882fa","resolution":{"observed_at":"2026-08-06T23:53:12.142602Z","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-06T23:53:12.318723Z","title":"Iterative hard thresholding for low cp-rank tensor models.Linear and Multilinear Algebra, pages 1–17, 2021","venue":null,"work_id":"554ef0a2-8108-474d-a9db-7497ea79d644","year":2021},"citing_paper":{"arxiv_id":"2506.16032","last_updated":"2025-06-19T05:07:07Z","snapshot_observed_at":"2026-08-07T22:43:08.027896Z","submitted_at":"2025-06-19T05:07:07Z","title":"A Scalable Factorization Approach for High-Order Structured Tensor Recovery","version":1},"reference_index":87,"source":"pdf_text","source_observed_at":"2026-08-06T23:53:12.144858Z"},"links":{"citing_paper":"/paper/2506.16032"},"observation_digest":"sha256:7fefefcb9df8694dbfbee3183d436e3aef9a0803fd617e7f975dc66e4a5e5383","observation_id":"2e6bf028-d7e5-4645-9e19-f30789f81701","resolution":{"observed_at":"2026-08-06T23:53:12.322113Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"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-06T23:53:12.309559Z","title":"Modulus of continuity of some conditionally sub-gaussian fields, applica- tion to stable random fields","venue":null,"work_id":"172bd6e0-b471-473a-a286-59df612c5c78","year":2015},"citing_paper":{"arxiv_id":"2506.16032","last_updated":"2025-06-19T05:07:07Z","snapshot_observed_at":"2026-08-07T22:43:08.027896Z","submitted_at":"2025-06-19T05:07:07Z","title":"A Scalable Factorization Approach for High-Order Structured Tensor Recovery","version":1},"reference_index":88,"source":"pdf_text","source_observed_at":"2026-08-06T23:53:12.147169Z"},"links":{"citing_paper":"/paper/2506.16032"},"observation_digest":"sha256:3a1a91ed80465779ced57b3ad3297a833f159277b1f24b406169463d3f333fcb","observation_id":"c24b82d0-37bd-42ba-87f2-2ff57a13dade","resolution":{"observed_at":"2026-08-06T23:53:12.312771Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"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-06T23:53:12.299620Z","title":"Islet: Fast and optimal low-rank tensor regression via importance sketching.SIAM journal on mathematics of data science, 2(2):444–479, 2020","venue":null,"work_id":"f59dc83e-a17d-4c2d-9ed2-cdaefc1a12e4","year":2020},"citing_paper":{"arxiv_id":"2506.16032","last_updated":"2025-06-19T05:07:07Z","snapshot_observed_at":"2026-08-07T22:43:08.027896Z","submitted_at":"2025-06-19T05:07:07Z","title":"A Scalable Factorization Approach for High-Order Structured Tensor Recovery","version":1},"reference_index":89,"source":"pdf_text","source_observed_at":"2026-08-06T23:53:12.149455Z"},"links":{"citing_paper":"/paper/2506.16032"},"observation_digest":"sha256:efbc8ef3411116fd4db62233c619a74244e50c2675a3ef65f9d8364f0dbcb44b","observation_id":"d29f3eb3-ce2f-4368-82e5-538965e26636","resolution":{"observed_at":"2026-08-06T23:53:12.303502Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"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-06T23:53:12.290266Z","title":"A multilinear singular value decomposition.SIAM journal on Matrix Analysis and Applications, 21(4):1253–1278, 2000","venue":null,"work_id":"0c325064-98a4-446f-bd54-6c06ce2f18da","year":2000},"citing_paper":{"arxiv_id":"2506.16032","last_updated":"2025-06-19T05:07:07Z","snapshot_observed_at":"2026-08-07T22:43:08.027896Z","submitted_at":"2025-06-19T05:07:07Z","title":"A Scalable Factorization Approach for High-Order Structured Tensor Recovery","version":1},"reference_index":90,"source":"pdf_text","source_observed_at":"2026-08-06T23:53:12.151723Z"},"links":{"citing_paper":"/paper/2506.16032"},"observation_digest":"sha256:ea3cdd269ee94600e224dca79af42ab09266744412390909b2b00168c653d4d7","observation_id":"ccaa2e83-e412-442b-a7d0-ff7d3d05f1dc","resolution":{"observed_at":"2026-08-06T23:53:12.294136Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"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-06T23:53:12.281484Z","title":"Weakly convex optimization over Stiefel manifold using Riemannian subgradient-type methods.SIAM Journal on Optimization, 31(3):1605–1634, 2021","venue":null,"work_id":"a0147f04-f34c-4f77-bfaa-f339a12174e6","year":2021},"citing_paper":{"arxiv_id":"2506.16032","last_updated":"2025-06-19T05:07:07Z","snapshot_observed_at":"2026-08-07T22:43:08.027896Z","submitted_at":"2025-06-19T05:07:07Z","title":"A Scalable Factorization Approach for High-Order Structured Tensor Recovery","version":1},"reference_index":91,"source":"pdf_text","source_observed_at":"2026-08-06T23:53:12.154596Z"},"links":{"citing_paper":"/paper/2506.16032"},"observation_digest":"sha256:623d7d5dbf0c412e7f633777dc0b3860d637b8a5f858dcf1843954ae7e0a7899","observation_id":"7a6a8b24-aeb6-4432-b2a0-dfe77eddc449","resolution":{"observed_at":"2026-08-06T23:53:12.284682Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"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-06T23:53:12.272739Z","title":"Springer, 2012","venue":null,"work_id":"4358680c-9a57-44b9-ba29-2b6daa2b6a01","year":2012},"citing_paper":{"arxiv_id":"2506.16032","last_updated":"2025-06-19T05:07:07Z","snapshot_observed_at":"2026-08-07T22:43:08.027896Z","submitted_at":"2025-06-19T05:07:07Z","title":"A Scalable Factorization Approach for High-Order Structured Tensor Recovery","version":1},"reference_index":92,"source":"pdf_text","source_observed_at":"2026-08-06T23:53:12.156931Z"},"links":{"citing_paper":"/paper/2506.16032"},"observation_digest":"sha256:51755041118b00e8b95b341e70be015a61457418e4a55670f55892561787a6f9","observation_id":"42adb768-f63d-4b3c-ba3c-5ab984b5b894","resolution":{"observed_at":"2026-08-06T23:53:12.275633Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2506.16032","last_updated":"2025-06-19T05:07:07Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-07T22:43:08.027896Z","submitted_at":"2025-06-19T05:07:07Z","title":"A Scalable Factorization Approach for High-Order Structured Tensor Recovery"},"reference_resolution":{"displayed":92,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":26,"verified_exact":6,"verified_fuzzy":60},"total_outbound_references":92},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 92 of 92 outbound references and 4 inbound Pith citation observations for arXiv:2506.16032."}