{"as_of":"2026-08-12T08:59:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:b9810c2b11e5fe50dc2606ceca96f57ddede1828cbcf1431ac8d2431d1229cfb","coverage":[{"denominator":49,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":49,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-03T19:30:23.452102Z","state":"measured"},{"denominator":49,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":49,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-12T06:34:41.77262+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2512.01016/citation-record","integrity":"/paper/2512.01016/integrity","json":"/paper/2512.01016/citation-record.json","paper":"/paper/2512.01016"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T19:30:18.454457Z","title":"Unsupervised multiway data analysis: A literature survey.IEEE transactions on knowledge and data engineering, 21(1):6–20, 2008","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2512.01016","last_updated":"2026-07-06T15:38:39Z","snapshot_observed_at":"2026-08-10T20:45:16.934171Z","submitted_at":"2025-11-30T18:20:59Z","title":"A Provably Efficient Method for Tensor Ring Decomposition and Its Applications","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-03T19:30:18.454457Z"},"links":{"citing_paper":"/paper/2512.01016"},"observation_digest":"sha256:423814ac587ae0349190df0708b445ade11b0e8b512e032111a57e53d58cd914","observation_id":"6442dd75-de49-4570-93b1-d34d062ca4b9","resolution":{"observed_at":"2026-08-03T19:30:18.454457Z","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-03T19:30:18.568637Z","title":"A survey on the complexity of learning quantum states","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2512.01016","last_updated":"2026-07-06T15:38:39Z","snapshot_observed_at":"2026-08-10T20:45:16.934171Z","submitted_at":"2025-11-30T18:20:59Z","title":"A Provably Efficient Method for Tensor Ring Decomposition and Its Applications","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-03T19:30:18.568637Z"},"links":{"citing_paper":"/paper/2512.01016"},"observation_digest":"sha256:c4fd78a5c9aeeecdacebc18c1f6a9893641fa94e237426d499b8bde02999f2ec","observation_id":"9c4e612d-be94-40e2-9a31-afc7bc0d836e","resolution":{"observed_at":"2026-08-03T19:30:18.568637Z","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-03T19:30:18.680446Z","title":"Rigorous rg algorithms and area laws for low energy eigenstates in 1d.Communications in Mathematical Physics, 356(1):65–105, 2017","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2512.01016","last_updated":"2026-07-06T15:38:39Z","snapshot_observed_at":"2026-08-10T20:45:16.934171Z","submitted_at":"2025-11-30T18:20:59Z","title":"A Provably Efficient Method for Tensor Ring Decomposition and Its Applications","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-03T19:30:18.680446Z"},"links":{"citing_paper":"/paper/2512.01016"},"observation_digest":"sha256:1258af555a17946b56400afe293a53c1695cfdc8866ca3a9041ac39e74882d98","observation_id":"66be2634-feef-4434-abab-f5d501e9261b","resolution":{"observed_at":"2026-08-03T19:30:18.680446Z","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-03T19:30:18.767574Z","title":"Springer, 2003","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2512.01016","last_updated":"2026-07-06T15:38:39Z","snapshot_observed_at":"2026-08-10T20:45:16.934171Z","submitted_at":"2025-11-30T18:20:59Z","title":"A Provably Efficient Method for Tensor Ring Decomposition and Its Applications","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-03T19:30:18.767574Z"},"links":{"citing_paper":"/paper/2512.01016"},"observation_digest":"sha256:f5cdfb018936d755f54d0864eba822d4efe05ece14f326a0375d7987d5954b5d","observation_id":"dda7fd87-84e5-489c-b4fd-30bc78a69d61","resolution":{"observed_at":"2026-08-03T19:30:18.767574Z","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-03T19:30:18.845964Z","title":"Constrained k-means clustering.Microsoft Research, Redmond, 20(0):0, 2000","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2512.01016","last_updated":"2026-07-06T15:38:39Z","snapshot_observed_at":"2026-08-10T20:45:16.934171Z","submitted_at":"2025-11-30T18:20:59Z","title":"A Provably Efficient Method for Tensor Ring Decomposition and Its Applications","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-03T19:30:18.845964Z"},"links":{"citing_paper":"/paper/2512.01016"},"observation_digest":"sha256:1260e441f3c6730e449cbae86f202238fd12dbd1ada5fcc5dec3c0ada172afec","observation_id":"c9400a7b-01fb-4000-86d4-d3b4a668e6ca","resolution":{"observed_at":"2026-08-03T19:30:18.845964Z","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-03T19:30:18.984082Z","title":"Hand-waving and interpretive dance: an introductory course on tensor networks.Journal of physics A: Mathematical and theoretical, 50(22):223001, 2017","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2512.01016","last_updated":"2026-07-06T15:38:39Z","snapshot_observed_at":"2026-08-10T20:45:16.934171Z","submitted_at":"2025-11-30T18:20:59Z","title":"A Provably Efficient Method for Tensor Ring Decomposition and Its Applications","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-03T19:30:18.984082Z"},"links":{"citing_paper":"/paper/2512.01016"},"observation_digest":"sha256:8a116baa78bb70bf5402ac278646d537efa0c9b4beaa4994c4e25631779a89ae","observation_id":"a1249514-e5ee-44fc-9475-25e507221e94","resolution":{"observed_at":"2026-08-03T19:30:18.984082Z","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-03T19:30:19.124761Z","title":"eckart-young","venue":null,"work_id":null,"year":1970},"citing_paper":{"arxiv_id":"2512.01016","last_updated":"2026-07-06T15:38:39Z","snapshot_observed_at":"2026-08-10T20:45:16.934171Z","submitted_at":"2025-11-30T18:20:59Z","title":"A Provably Efficient Method for Tensor Ring Decomposition and Its Applications","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-03T19:30:19.124761Z"},"links":{"citing_paper":"/paper/2512.01016"},"observation_digest":"sha256:7f0e008d5e63052191673a70bfb9da618140fdaa5a9614a9e1d5cd2eb656b15b","observation_id":"d094c15e-0edb-4260-a7ad-ca37864a3f49","resolution":{"observed_at":"2026-08-03T19:30:19.124761Z","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-03T19:30:19.224818Z","title":"Learning polynomial transformations via gen- eralized tensor decompositions","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2512.01016","last_updated":"2026-07-06T15:38:39Z","snapshot_observed_at":"2026-08-10T20:45:16.934171Z","submitted_at":"2025-11-30T18:20:59Z","title":"A Provably Efficient Method for Tensor Ring Decomposition and Its Applications","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-03T19:30:19.224818Z"},"links":{"citing_paper":"/paper/2512.01016"},"observation_digest":"sha256:6ce03fe05f5e83f856122a756f37fc238e31d0a82a183e6c97c712e763331ba8","observation_id":"5ee96f2c-5a52-4465-ada7-8c56149e10b0","resolution":{"observed_at":"2026-08-03T19:30:19.224818Z","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-03T19:30:19.250612Z","title":"Tensor decompositions for signal processing applications: From two-way to multiway component analysis.IEEE Signal Processing Magazine, 32(2):145–163, 2015","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2512.01016","last_updated":"2026-07-06T15:38:39Z","snapshot_observed_at":"2026-08-10T20:45:16.934171Z","submitted_at":"2025-11-30T18:20:59Z","title":"A Provably Efficient Method for Tensor Ring Decomposition and Its Applications","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-03T19:30:19.250612Z"},"links":{"citing_paper":"/paper/2512.01016"},"observation_digest":"sha256:1305e57b04a97b66a82b7cf70fa82d5d7c6295e2fd3162722a5d181e72c99505","observation_id":"0c18429c-2d00-449c-a5f6-96abd749a369","resolution":{"observed_at":"2026-08-03T19:30:19.250612Z","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-03T19:30:19.326948Z","title":"Decomposition of quantics in sums of powers of linear forms","venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2512.01016","last_updated":"2026-07-06T15:38:39Z","snapshot_observed_at":"2026-08-10T20:45:16.934171Z","submitted_at":"2025-11-30T18:20:59Z","title":"A Provably Efficient Method for Tensor Ring Decomposition and Its Applications","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-03T19:30:19.326948Z"},"links":{"citing_paper":"/paper/2512.01016"},"observation_digest":"sha256:04176edea774df38877f486d60f2eb72bd9456845607955cbb911610b7398b64","observation_id":"63da542f-6f26-4c34-b0d6-483b9cfff398","resolution":{"observed_at":"2026-08-03T19:30:19.326948Z","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-03T19:30:19.432158Z","title":"Tensor decomposition of eeg signals: a brief review.Journal of neuroscience methods, 248:59–69, 2015","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2512.01016","last_updated":"2026-07-06T15:38:39Z","snapshot_observed_at":"2026-08-10T20:45:16.934171Z","submitted_at":"2025-11-30T18:20:59Z","title":"A Provably Efficient Method for Tensor Ring Decomposition and Its Applications","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-03T19:30:19.432158Z"},"links":{"citing_paper":"/paper/2512.01016"},"observation_digest":"sha256:b67e6dce7ecefef4d5469bede5f30d65b5f6d068dcf7db69deffde1876f4f55b","observation_id":"605dc6c7-e374-407d-8c36-9c539e34de9f","resolution":{"observed_at":"2026-08-03T19:30:19.432158Z","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-03T19:30:19.531504Z","title":"Springer, 4th edition, 2015","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2512.01016","last_updated":"2026-07-06T15:38:39Z","snapshot_observed_at":"2026-08-10T20:45:16.934171Z","submitted_at":"2025-11-30T18:20:59Z","title":"A Provably Efficient Method for Tensor Ring Decomposition and Its Applications","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-03T19:30:19.531504Z"},"links":{"citing_paper":"/paper/2512.01016"},"observation_digest":"sha256:88a0ac32d9d81f5796962faec8f4b8b76695b5107271bd7c63e158dafcb88e6c","observation_id":"0b5e69df-a5cd-493f-8546-c9e0ddd797c3","resolution":{"observed_at":"2026-08-03T19:30:19.531504Z","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-03T19:30:19.633884Z","title":"Efficient quantum state tomogra- phy.Nature communications, 1(1):149, 2010","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2512.01016","last_updated":"2026-07-06T15:38:39Z","snapshot_observed_at":"2026-08-10T20:45:16.934171Z","submitted_at":"2025-11-30T18:20:59Z","title":"A Provably Efficient Method for Tensor Ring Decomposition and Its Applications","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-03T19:30:19.633884Z"},"links":{"citing_paper":"/paper/2512.01016"},"observation_digest":"sha256:79a21253a0a1c513e807aa74e3819e3ae4382a04be89d8bca6f69df8e3bee639","observation_id":"b021819c-93e5-4c22-b053-709d0e97b076","resolution":{"observed_at":"2026-08-03T19:30:19.633884Z","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-03T19:30:19.741742Z","title":"A survey of tensor methods","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2512.01016","last_updated":"2026-07-06T15:38:39Z","snapshot_observed_at":"2026-08-10T20:45:16.934171Z","submitted_at":"2025-11-30T18:20:59Z","title":"A Provably Efficient Method for Tensor Ring Decomposition and Its Applications","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-03T19:30:19.741742Z"},"links":{"citing_paper":"/paper/2512.01016"},"observation_digest":"sha256:cc7b671872e9e36498eb96f39d3f11baab0e3bef6ae7138484c94d2161e14b12","observation_id":"68dfab2e-b928-4175-b51e-f7fbf4668397","resolution":{"observed_at":"2026-08-03T19:30:19.741742Z","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-03T19:30:19.862020Z","title":"On the best rank-1 and rank-(r 1, r 2,..., rn) approximation of higher-order tensors.SIAM journal on Matrix Analysis and Applications, 21(4): 1324–1342, 2000","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2512.01016","last_updated":"2026-07-06T15:38:39Z","snapshot_observed_at":"2026-08-10T20:45:16.934171Z","submitted_at":"2025-11-30T18:20:59Z","title":"A Provably Efficient Method for Tensor Ring Decomposition and Its Applications","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-03T19:30:19.862020Z"},"links":{"citing_paper":"/paper/2512.01016"},"observation_digest":"sha256:afa3a322d24bad479d96e6f475edff917c918becba9a41587205f5aca8fd5921","observation_id":"ddf79db7-8383-4d31-9110-113e8b98d4ad","resolution":{"observed_at":"2026-08-03T19:30:19.862020Z","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-03T19:30:19.966860Z","title":"A multilinear singular value decomposition","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2512.01016","last_updated":"2026-07-06T15:38:39Z","snapshot_observed_at":"2026-08-10T20:45:16.934171Z","submitted_at":"2025-11-30T18:20:59Z","title":"A Provably Efficient Method for Tensor Ring Decomposition and Its Applications","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-03T19:30:19.966860Z"},"links":{"citing_paper":"/paper/2512.01016"},"observation_digest":"sha256:2aaa71f56865bd0c0eb30099f220ed3a0d498d11de3f63ae669f5192ea5b32ee","observation_id":"a706a72e-f9a6-4284-a235-af5b3136456d","resolution":{"observed_at":"2026-08-03T19:30:19.966860Z","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-03T19:30:20.058323Z","title":"Computing large-scale matrix and tensor decomposition with structured factors: A unified nonconvex optimization perspective","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2512.01016","last_updated":"2026-07-06T15:38:39Z","snapshot_observed_at":"2026-08-10T20:45:16.934171Z","submitted_at":"2025-11-30T18:20:59Z","title":"A Provably Efficient Method for Tensor Ring Decomposition and Its Applications","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-03T19:30:20.058323Z"},"links":{"citing_paper":"/paper/2512.01016"},"observation_digest":"sha256:ebcb58da67beb1429faf31836fd2621d21d6b9e7046d1cd80383996f3fcd3619","observation_id":"b36941e3-618b-4591-8a59-5429bc37a1b5","resolution":{"observed_at":"2026-08-03T19:30:20.058323Z","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-03T19:30:20.283564Z","title":"Harshman","venue":null,"work_id":null,"year":1970},"citing_paper":{"arxiv_id":"2512.01016","last_updated":"2026-07-06T15:38:39Z","snapshot_observed_at":"2026-08-10T20:45:16.934171Z","submitted_at":"2025-11-30T18:20:59Z","title":"A Provably Efficient Method for Tensor Ring Decomposition and Its Applications","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-03T19:30:20.283564Z"},"links":{"citing_paper":"/paper/2512.01016"},"observation_digest":"sha256:479541eb5dbb3be44aa24cc4ebb8ea4955434170d19b6c651e1fd0bb6a056bd0","observation_id":"5fe905d6-891a-4fc9-85e1-5f4449ad98d8","resolution":{"observed_at":"2026-08-03T19:30:20.283564Z","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-03T19:30:20.420182Z","title":"A survey on tensor techniques and applications in machine learning.IEEE Access, 7:162950–162990, 2019","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2512.01016","last_updated":"2026-07-06T15:38:39Z","snapshot_observed_at":"2026-08-10T20:45:16.934171Z","submitted_at":"2025-11-30T18:20:59Z","title":"A Provably Efficient Method for Tensor Ring Decomposition and Its Applications","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-03T19:30:20.420182Z"},"links":{"citing_paper":"/paper/2512.01016"},"observation_digest":"sha256:97b91a5bfbca4fa0b3d5d35aa6cb9a470506a58fa1e8f10e2ab8ed4192db5069","observation_id":"ed33b5cb-d939-438c-b567-12e0e9e809ac","resolution":{"observed_at":"2026-08-03T19:30:20.420182Z","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-03T19:30:20.552282Z","title":"Efficient construction of tensor ring representations from sampling.Multiscale Modeling & Simulation, 19(3):1261–1284, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2512.01016","last_updated":"2026-07-06T15:38:39Z","snapshot_observed_at":"2026-08-10T20:45:16.934171Z","submitted_at":"2025-11-30T18:20:59Z","title":"A Provably Efficient Method for Tensor Ring Decomposition and Its Applications","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-03T19:30:20.552282Z"},"links":{"citing_paper":"/paper/2512.01016"},"observation_digest":"sha256:faa75e69d64027e53d8c73ad71dc7293adeffb2a0abf7eb41e5beb76154d4cbd","observation_id":"47bf9993-abe9-459d-a075-180b0bb9d5e4","resolution":{"observed_at":"2026-08-03T19:30:20.552282Z","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-03T19:30:20.588159Z","title":"Orthogonal tensor decompositions.SIAM Journal on Matrix Analysis and Applica- tions, 23(1):243–255, 2001","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2512.01016","last_updated":"2026-07-06T15:38:39Z","snapshot_observed_at":"2026-08-10T20:45:16.934171Z","submitted_at":"2025-11-30T18:20:59Z","title":"A Provably Efficient Method for Tensor Ring Decomposition and Its Applications","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-03T19:30:20.588159Z"},"links":{"citing_paper":"/paper/2512.01016"},"observation_digest":"sha256:a98741268f5ea1a0d98602e5df10ae73ccc207a79612d344f8613bd6ce9e7151","observation_id":"a913a511-6ae9-4edf-aede-a954f6603170","resolution":{"observed_at":"2026-08-03T19:30:20.588159Z","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-03T19:30:20.723851Z","title":"Tensor decompositions and applications.SIAM review, 51(3): 455–500, 2009","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2512.01016","last_updated":"2026-07-06T15:38:39Z","snapshot_observed_at":"2026-08-10T20:45:16.934171Z","submitted_at":"2025-11-30T18:20:59Z","title":"A Provably Efficient Method for Tensor Ring Decomposition and Its Applications","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-03T19:30:20.723851Z"},"links":{"citing_paper":"/paper/2512.01016"},"observation_digest":"sha256:fccd07d16cf1c8a3dd54eda3545bf2bd486fe70714cea2bfa1f121fbb05bae82","observation_id":"08d5e9a4-7cd4-4ac7-9767-979894824dc0","resolution":{"observed_at":"2026-08-03T19:30:20.723851Z","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-03T19:30:20.854322Z","title":"Tensor regression networks.Journal of Machine Learning Research, 21(123):1–21, 2020","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2512.01016","last_updated":"2026-07-06T15:38:39Z","snapshot_observed_at":"2026-08-10T20:45:16.934171Z","submitted_at":"2025-11-30T18:20:59Z","title":"A Provably Efficient Method for Tensor Ring Decomposition and Its Applications","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-03T19:30:20.854322Z"},"links":{"citing_paper":"/paper/2512.01016"},"observation_digest":"sha256:6ebf29026ca4d99ac735674ad52763416c2a71e07b71ea34da5a4ee617d0a442","observation_id":"946c46bd-1029-4d60-ba1e-927d336709ac","resolution":{"observed_at":"2026-08-03T19:30:20.854322Z","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-03T19:30:21.033462Z","title":"A polynomial time algorithm for the ground state of one-dimensional gapped local hamiltonians.Nature Physics, 11(7):566–569, 2015","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2512.01016","last_updated":"2026-07-06T15:38:39Z","snapshot_observed_at":"2026-08-10T20:45:16.934171Z","submitted_at":"2025-11-30T18:20:59Z","title":"A Provably Efficient Method for Tensor Ring Decomposition and Its Applications","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-03T19:30:21.033462Z"},"links":{"citing_paper":"/paper/2512.01016"},"observation_digest":"sha256:09345b03d9f98334ba4e45f488c771277aa40a8e547f37debc41a7b45c41b753","observation_id":"efc54c26-f76d-4a3f-aaf0-d6020f8272c5","resolution":{"observed_at":"2026-08-03T19:30:21.033462Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1002.4632","last_updated":"2010-02-24T21:17:32Z","snapshot_observed_at":"2026-07-06T02:08:27.149347Z","submitted_at":"2010-02-24T21:17:32Z","title":"Efficient Direct Tomography for Matrix Product States","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1002.4632","snapshot_observed_at":"2026-08-03T19:30:21.152268Z","title":"Efficient direct tomography for matrix product states.arXiv preprint arXiv:1002.4632, 2010","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2512.01016","last_updated":"2026-07-06T15:38:39Z","snapshot_observed_at":"2026-08-10T20:45:16.934171Z","submitted_at":"2025-11-30T18:20:59Z","title":"A Provably Efficient Method for Tensor Ring Decomposition and Its Applications","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-03T19:30:21.152268Z"},"links":{"cited_paper":"/paper/1002.4632","citing_paper":"/paper/2512.01016"},"observation_digest":"sha256:2ebbd38b0645b9040a216f268d891755ad9e56719968807f4495f0ac0a1ec0c3","observation_id":"f10ac64e-7e53-46ed-ae3d-b57c8793ecc3","resolution":{"observed_at":"2026-08-03T19:30:21.152268Z","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-03T19:30:21.228284Z","title":"A decomposition for three-way arrays.SIAM Journal on Matrix Analysis and Applications, 14(4):1064–1083, 1993","venue":null,"work_id":null,"year":1993},"citing_paper":{"arxiv_id":"2512.01016","last_updated":"2026-07-06T15:38:39Z","snapshot_observed_at":"2026-08-10T20:45:16.934171Z","submitted_at":"2025-11-30T18:20:59Z","title":"A Provably Efficient Method for Tensor Ring Decomposition and Its Applications","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-03T19:30:21.228284Z"},"links":{"citing_paper":"/paper/2512.01016"},"observation_digest":"sha256:0722f3dc6a29bc6e0673ba45d3cb8f2b3c1c0324f3f7b2fc890ba0b6b256fc81","observation_id":"9920659b-bbf5-4699-8bb4-b1220565cd39","resolution":{"observed_at":"2026-08-03T19:30:21.228284Z","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-03T19:30:21.368729Z","title":"k-means-constrained, April 2018","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2512.01016","last_updated":"2026-07-06T15:38:39Z","snapshot_observed_at":"2026-08-10T20:45:16.934171Z","submitted_at":"2025-11-30T18:20:59Z","title":"A Provably Efficient Method for Tensor Ring Decomposition and Its Applications","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-03T19:30:21.368729Z"},"links":{"citing_paper":"/paper/2512.01016"},"observation_digest":"sha256:2efbe092bb77cd667d5a46b2abee06e6986e2dbefdbad6fd548f1bc0f3ca45ec","observation_id":"d83a9420-3c60-4a99-a228-1b666d165ff3","resolution":{"observed_at":"2026-08-03T19:30:21.368729Z","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-03T19:30:21.471094Z","title":"Characterizing spatiotemporal transcriptome of the human brain via low-rank tensor decomposition.Statistics in Biosciences, 14(3):485–513, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2512.01016","last_updated":"2026-07-06T15:38:39Z","snapshot_observed_at":"2026-08-10T20:45:16.934171Z","submitted_at":"2025-11-30T18:20:59Z","title":"A Provably Efficient Method for Tensor Ring Decomposition and Its Applications","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-03T19:30:21.471094Z"},"links":{"citing_paper":"/paper/2512.01016"},"observation_digest":"sha256:61d0570837d28d5fbbd0fc1e55c126691b24cf7abc29306664506d75408c812c","observation_id":"6dedb6a4-0bd1-4c80-9a8a-cb4605c92ff1","resolution":{"observed_at":"2026-08-03T19:30:21.471094Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2506.10185","last_updated":"2025-07-14T14:34:46Z","snapshot_observed_at":"2026-08-07T04:30:03.552913Z","submitted_at":"2025-06-11T21:23:07Z","title":"Symmetric quantum states: a review of recent progress","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.10185","snapshot_observed_at":"2026-08-03T19:30:21.603565Z","title":"Symmetric quantum states: a review of recent progress.arXiv preprint arXiv:2506.10185, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2512.01016","last_updated":"2026-07-06T15:38:39Z","snapshot_observed_at":"2026-08-10T20:45:16.934171Z","submitted_at":"2025-11-30T18:20:59Z","title":"A Provably Efficient Method for Tensor Ring Decomposition and Its Applications","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-03T19:30:21.603565Z"},"links":{"cited_paper":"/paper/2506.10185","citing_paper":"/paper/2512.01016"},"observation_digest":"sha256:85e2dd60d8a292fee8295b017316a6a1897f1a1a295f1ec737d2ed2f37da2bfd","observation_id":"8d7b9918-5084-4957-9a7a-8cddd4ded1a4","resolution":{"observed_at":"2026-08-03T19:30:21.603565Z","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-03T19:30:21.673072Z","title":"The complexity of the word problems for commutative semigroups and polynomial ideals.Advances in mathematics, 46(3):305–329, 1982","venue":null,"work_id":null,"year":1982},"citing_paper":{"arxiv_id":"2512.01016","last_updated":"2026-07-06T15:38:39Z","snapshot_observed_at":"2026-08-10T20:45:16.934171Z","submitted_at":"2025-11-30T18:20:59Z","title":"A Provably Efficient Method for Tensor Ring Decomposition and Its Applications","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-03T19:30:21.673072Z"},"links":{"citing_paper":"/paper/2512.01016"},"observation_digest":"sha256:6266bc232d06eeb27133667bc439a2b791462c2ba5e51a9e2a77279d9d0175ef","observation_id":"f99a3367-a2b9-4a85-8755-7d9cb3666f3d","resolution":{"observed_at":"2026-08-03T19:30:21.673072Z","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-03T19:30:21.714602Z","title":"Parallel factor analysis as an exploratory tool for wavelet transformed event-related eeg.NeuroImage, 29(3): 938–947, 2006","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2512.01016","last_updated":"2026-07-06T15:38:39Z","snapshot_observed_at":"2026-08-10T20:45:16.934171Z","submitted_at":"2025-11-30T18:20:59Z","title":"A Provably Efficient Method for Tensor Ring Decomposition and Its Applications","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-03T19:30:21.714602Z"},"links":{"citing_paper":"/paper/2512.01016"},"observation_digest":"sha256:e42f8ee782a6de812da2374cca8a65dc570abb6212030ab7aaa31112f6621502","observation_id":"a71e8598-b8ea-426f-983d-3477eaa95703","resolution":{"observed_at":"2026-08-03T19:30:21.714602Z","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-03T19:30:21.819064Z","title":"Cambridge university press, 2010","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2512.01016","last_updated":"2026-07-06T15:38:39Z","snapshot_observed_at":"2026-08-10T20:45:16.934171Z","submitted_at":"2025-11-30T18:20:59Z","title":"A Provably Efficient Method for Tensor Ring Decomposition and Its Applications","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-03T19:30:21.819064Z"},"links":{"citing_paper":"/paper/2512.01016"},"observation_digest":"sha256:e5af0477b01201e237096ea27cda77f79eaf5f25990099a1d9501894a912724c","observation_id":"a05b59f5-3fd9-40ff-a88b-e8aed592cdbc","resolution":{"observed_at":"2026-08-03T19:30:21.819064Z","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-03T19:30:21.969692Z","title":"A practical introduction to tensor networks: Matrix product states and projected entan- gled pair states.Annals of physics, 349:117–158, 2014","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2512.01016","last_updated":"2026-07-06T15:38:39Z","snapshot_observed_at":"2026-08-10T20:45:16.934171Z","submitted_at":"2025-11-30T18:20:59Z","title":"A Provably Efficient Method for Tensor Ring Decomposition and Its Applications","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-03T19:30:21.969692Z"},"links":{"citing_paper":"/paper/2512.01016"},"observation_digest":"sha256:bab2c67652f8dd2f3618b5bc9bd44739f426ef02954dbf69f4fb3cbe0096e3fc","observation_id":"079d3052-e02d-4309-a884-e77490050911","resolution":{"observed_at":"2026-08-03T19:30:21.969692Z","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-03T19:30:22.108145Z","title":"Tensor-traindecomposition.SIAM Journal on Scientific Computing, 33(5):2295–2317, 2011","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2512.01016","last_updated":"2026-07-06T15:38:39Z","snapshot_observed_at":"2026-08-10T20:45:16.934171Z","submitted_at":"2025-11-30T18:20:59Z","title":"A Provably Efficient Method for Tensor Ring Decomposition and Its Applications","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-03T19:30:22.108145Z"},"links":{"citing_paper":"/paper/2512.01016"},"observation_digest":"sha256:3fadd89c98c76219c0c2f269c616523a107835ed646d037a00646dea6e24a9af","observation_id":"065ac5ed-f68b-43b6-8563-a8d76136c0c6","resolution":{"observed_at":"2026-08-03T19:30:22.108145Z","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-03T19:30:22.279386Z","title":"Tensor methods in computer vision and deep learning.Proceedings of the IEEE, 109(5):863–890, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2512.01016","last_updated":"2026-07-06T15:38:39Z","snapshot_observed_at":"2026-08-10T20:45:16.934171Z","submitted_at":"2025-11-30T18:20:59Z","title":"A Provably Efficient Method for Tensor Ring Decomposition and Its Applications","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-03T19:30:22.279386Z"},"links":{"citing_paper":"/paper/2512.01016"},"observation_digest":"sha256:8433051fbf4939ad40887c9a99ac739821c870d3b307fee37440646a7eefc6d0","observation_id":"d5e6ab1b-6773-4e7c-8543-2094c98b3aea","resolution":{"observed_at":"2026-08-03T19:30:22.279386Z","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-03T19:30:22.441623Z","title":"Tensors for data mining and data fusion: Models, applications, and scalable algorithms.ACM Transactions on Intelligent Systems and Technology (TIST), 8(2):1–44, 2016","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2512.01016","last_updated":"2026-07-06T15:38:39Z","snapshot_observed_at":"2026-08-10T20:45:16.934171Z","submitted_at":"2025-11-30T18:20:59Z","title":"A Provably Efficient Method for Tensor Ring Decomposition and Its Applications","version":2},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-03T19:30:22.441623Z"},"links":{"citing_paper":"/paper/2512.01016"},"observation_digest":"sha256:a71695868c843497bd9e6f74409884c9adc8ad7c910765e90cdb4699aa548218","observation_id":"903f9435-a605-420d-b148-153b83274e8d","resolution":{"observed_at":"2026-08-03T19:30:22.441623Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1711.10781","last_updated":"2017-11-29T11:29:09Z","snapshot_observed_at":"2026-08-11T11:23:38.525234Z","submitted_at":"2017-11-29T11:29:09Z","title":"Introduction to Tensor Decompositions and their Applications in Machine Learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1711.10781","snapshot_observed_at":"2026-08-03T19:30:22.564529Z","title":"Introduction to tensor decompositions and their applications in machine learning.arXiv preprint arXiv:1711.10781, 2017","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2512.01016","last_updated":"2026-07-06T15:38:39Z","snapshot_observed_at":"2026-08-10T20:45:16.934171Z","submitted_at":"2025-11-30T18:20:59Z","title":"A Provably Efficient Method for Tensor Ring Decomposition and Its Applications","version":2},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-03T19:30:22.564529Z"},"links":{"cited_paper":"/paper/1711.10781","citing_paper":"/paper/2512.01016"},"observation_digest":"sha256:1c55b01a1c43caa654e692c6b498fa9ba36eb7d3319c063d4160c092d29c8881","observation_id":"7678345f-f175-4af7-ad8f-965086b79109","resolution":{"observed_at":"2026-08-03T19:30:22.564529Z","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-03T19:30:22.647958Z","title":"Thedensity-matrixrenormalization group intheageofmatrix product states.Annals of physics, 326(1):96–192, 2011","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2512.01016","last_updated":"2026-07-06T15:38:39Z","snapshot_observed_at":"2026-08-10T20:45:16.934171Z","submitted_at":"2025-11-30T18:20:59Z","title":"A Provably Efficient Method for Tensor Ring Decomposition and Its Applications","version":2},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-03T19:30:22.647958Z"},"links":{"citing_paper":"/paper/2512.01016"},"observation_digest":"sha256:c497d1ca8976a3d02239978cbb2e8f0b6727b23766ba2611c3a0b42bd86420d8","observation_id":"56ecf295-7bed-4039-93f2-2b3fa2cbbf8f","resolution":{"observed_at":"2026-08-03T19:30:22.647958Z","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-03T19:30:22.734134Z","title":"Tensor methods in biomedical image analysis.Journal of Medical Signals & Sensors, 14(6):16, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2512.01016","last_updated":"2026-07-06T15:38:39Z","snapshot_observed_at":"2026-08-10T20:45:16.934171Z","submitted_at":"2025-11-30T18:20:59Z","title":"A Provably Efficient Method for Tensor Ring Decomposition and Its Applications","version":2},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-03T19:30:22.734134Z"},"links":{"citing_paper":"/paper/2512.01016"},"observation_digest":"sha256:7a52b8dfec5182f70b4440a1fae044a977a67aa37c1df59d90b0354c9161b943","observation_id":"5dc5aeb8-fdd4-4584-88fb-d7a174d689a0","resolution":{"observed_at":"2026-08-03T19:30:22.734134Z","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-03T19:30:22.793288Z","title":"Tensordecompositionforsignalprocessingandmachinelearning.IEEE Transactions on Signal Processing, 65(13):3551–3582, 2017","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2512.01016","last_updated":"2026-07-06T15:38:39Z","snapshot_observed_at":"2026-08-10T20:45:16.934171Z","submitted_at":"2025-11-30T18:20:59Z","title":"A Provably Efficient Method for Tensor Ring Decomposition and Its Applications","version":2},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-03T19:30:22.793288Z"},"links":{"citing_paper":"/paper/2512.01016"},"observation_digest":"sha256:3f67437386bd77036ee842cca6076279e45cefd8e656bfb1b97217a1331ac68c","observation_id":"c8a2eddc-9320-477c-b57b-7ac93ed1140e","resolution":{"observed_at":"2026-08-03T19:30:22.793288Z","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-03T19:30:22.827502Z","title":"Some mathematical notes on three-mode factor analysis.Psychometrika, 31(3): 279–311, 1966","venue":null,"work_id":null,"year":1966},"citing_paper":{"arxiv_id":"2512.01016","last_updated":"2026-07-06T15:38:39Z","snapshot_observed_at":"2026-08-10T20:45:16.934171Z","submitted_at":"2025-11-30T18:20:59Z","title":"A Provably Efficient Method for Tensor Ring Decomposition and Its Applications","version":2},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-03T19:30:22.827502Z"},"links":{"citing_paper":"/paper/2512.01016"},"observation_digest":"sha256:5ab5918176a9b93045c044208b5dce9d87acc6e079a64e3e7cba54d2d8b10522","observation_id":"0b2b8e4f-947a-4eb5-9e78-a9abace3dd9d","resolution":{"observed_at":"2026-08-03T19:30:22.827502Z","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-03T19:30:22.894492Z","title":"Matrix product states, projected entangled pair states, and variational renormalization group methods for quantum spin systems.Advances in physics, 57(2):143–224, 2008","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2512.01016","last_updated":"2026-07-06T15:38:39Z","snapshot_observed_at":"2026-08-10T20:45:16.934171Z","submitted_at":"2025-11-30T18:20:59Z","title":"A Provably Efficient Method for Tensor Ring Decomposition and Its Applications","version":2},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-03T19:30:22.894492Z"},"links":{"citing_paper":"/paper/2512.01016"},"observation_digest":"sha256:445e3e2387d5cf44368f19956fa46d596c29f70a3a79447cb6e7a003889e514a","observation_id":"40d8cd22-0d22-4630-9600-a20254505a65","resolution":{"observed_at":"2026-08-03T19:30:22.894492Z","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-03T19:30:22.988561Z","title":"Efficient low rank tensor ring completion","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2512.01016","last_updated":"2026-07-06T15:38:39Z","snapshot_observed_at":"2026-08-10T20:45:16.934171Z","submitted_at":"2025-11-30T18:20:59Z","title":"A Provably Efficient Method for Tensor Ring Decomposition and Its Applications","version":2},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-03T19:30:22.988561Z"},"links":{"citing_paper":"/paper/2512.01016"},"observation_digest":"sha256:3ee05dd153ef82f8bf9c8eda8fc3b7c4345bdc54419547704e3f887918a79bce","observation_id":"87fe5c11-0a84-4bb6-9c70-e0b552d5eb75","resolution":{"observed_at":"2026-08-03T19:30:22.988561Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1801.02662","last_updated":"2019-02-09T23:31:47Z","snapshot_observed_at":"2026-08-03T09:57:52.998308Z","submitted_at":"2018-01-08T19:55:19Z","title":"Tensor network ranks","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1801.02662","snapshot_observed_at":"2026-08-03T19:30:23.031935Z","title":"Tensor network ranks.arXiv preprint arXiv:1801.02662, 2018","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2512.01016","last_updated":"2026-07-06T15:38:39Z","snapshot_observed_at":"2026-08-10T20:45:16.934171Z","submitted_at":"2025-11-30T18:20:59Z","title":"A Provably Efficient Method for Tensor Ring Decomposition and Its Applications","version":2},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-03T19:30:23.031935Z"},"links":{"cited_paper":"/paper/1801.02662","citing_paper":"/paper/2512.01016"},"observation_digest":"sha256:c46dc7ef0364aab6a8a2d7f02ec11b4f533c3234f934ece09f2c362dfd1331a2","observation_id":"4c218b17-682b-4494-b429-987d947fca78","resolution":{"observed_at":"2026-08-03T19:30:23.031935Z","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-03T19:30:23.113688Z","title":"Tensor ring decomposition with rank minimization on latent space: An efficient approach for tensor completion","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2512.01016","last_updated":"2026-07-06T15:38:39Z","snapshot_observed_at":"2026-08-10T20:45:16.934171Z","submitted_at":"2025-11-30T18:20:59Z","title":"A Provably Efficient Method for Tensor Ring Decomposition and Its Applications","version":2},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-03T19:30:23.113688Z"},"links":{"citing_paper":"/paper/2512.01016"},"observation_digest":"sha256:18a4f34020c5a95a8878c79635d96230fad06f78952a4eb0b8ea6ca1574b9050","observation_id":"22b0f1eb-4add-4531-adcb-d29e3eea60f7","resolution":{"observed_at":"2026-08-03T19:30:23.113688Z","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-03T19:30:23.168845Z","title":"Tensor svd: Statistical and computational limits.IEEE Transactions on Information Theory, 64(11):7311–7338, 2018","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2512.01016","last_updated":"2026-07-06T15:38:39Z","snapshot_observed_at":"2026-08-10T20:45:16.934171Z","submitted_at":"2025-11-30T18:20:59Z","title":"A Provably Efficient Method for Tensor Ring Decomposition and Its Applications","version":2},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-03T19:30:23.168845Z"},"links":{"citing_paper":"/paper/2512.01016"},"observation_digest":"sha256:7b350fa2df7d7fb8ff287db70cc11ead231098f8d247f4c9089398a7c88c3c94","observation_id":"34d1d63f-041f-444f-92f4-737e344148eb","resolution":{"observed_at":"2026-08-03T19:30:23.168845Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1606.05535","last_updated":"2016-06-17T14:40:18Z","snapshot_observed_at":"2026-08-09T02:58:02.298584Z","submitted_at":"2016-06-17T14:40:18Z","title":"Tensor Ring Decomposition","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1606.05535","snapshot_observed_at":"2026-08-03T19:30:23.233123Z","title":"Tensor ring decomposition","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2512.01016","last_updated":"2026-07-06T15:38:39Z","snapshot_observed_at":"2026-08-10T20:45:16.934171Z","submitted_at":"2025-11-30T18:20:59Z","title":"A Provably Efficient Method for Tensor Ring Decomposition and Its Applications","version":2},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-03T19:30:23.233123Z"},"links":{"cited_paper":"/paper/1606.05535","citing_paper":"/paper/2512.01016"},"observation_digest":"sha256:044e4291268439dbb9cfda2371718aaad8706cdd55af652a47e739dfe16803ff","observation_id":"92f1fe5b-f218-4385-b744-1ea3512aa758","resolution":{"observed_at":"2026-08-03T19:30:23.233123Z","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-03T19:30:23.300292Z","title":"Learning with hypergraphs: Clustering, classification, and embedding.Advances in neural information processing systems, 19, 2006","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2512.01016","last_updated":"2026-07-06T15:38:39Z","snapshot_observed_at":"2026-08-10T20:45:16.934171Z","submitted_at":"2025-11-30T18:20:59Z","title":"A Provably Efficient Method for Tensor Ring Decomposition and Its Applications","version":2},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-03T19:30:23.300292Z"},"links":{"citing_paper":"/paper/2512.01016"},"observation_digest":"sha256:cc396f6283a46e6b104fba5b3064fea9197bd4ceb4f45ca3b69752aa4cc57e34","observation_id":"3895963b-c2be-418e-a532-08ef1f986a4f","resolution":{"observed_at":"2026-08-03T19:30:23.300292Z","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-03T19:30:23.452102Z","title":"Optimal high-order tensor svd via tensor- train orthogonal iteration.IEEE transactions on information theory, 68(6):3991–4019, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2512.01016","last_updated":"2026-07-06T15:38:39Z","snapshot_observed_at":"2026-08-10T20:45:16.934171Z","submitted_at":"2025-11-30T18:20:59Z","title":"A Provably Efficient Method for Tensor Ring Decomposition and Its Applications","version":2},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-03T19:30:23.452102Z"},"links":{"citing_paper":"/paper/2512.01016"},"observation_digest":"sha256:82b2215433b8c5cfe12555185b56b0c84750b46c34214e5d0532b2e49db36363","observation_id":"74955869-1eb0-4194-ade3-7080c6d2d00d","resolution":{"observed_at":"2026-08-03T19:30:23.452102Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2512.01016","last_updated":"2026-07-06T15:38:39Z","latest_version":2,"primary_category":"math.NA","snapshot_observed_at":"2026-08-10T20:45:16.934171Z","submitted_at":"2025-11-30T18:20:59Z","title":"A Provably Efficient Method for Tensor Ring Decomposition and Its Applications"},"reference_resolution":{"displayed":49,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":49,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":49},"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-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"thesis":"As of 12 August 2026, this Paper Citation Record lists 49 of 49 outbound references and 0 inbound Pith citation observations for arXiv:2512.01016."}