{"as_of":"2026-08-10T06:16:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:b67bca4360af4d72dbb8be33dd79d1585105a130df775c066c01cff6f9480300","coverage":[{"denominator":63,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":63,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-09T11:03:54.211914Z","state":"measured"},{"denominator":63,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":63,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+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/2502.02843/citation-record","integrity":"/paper/2502.02843/integrity","json":"/paper/2502.02843/citation-record.json","paper":"/paper/2502.02843"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T11:03:54.009189Z","title":"The approximation of one matrix by another of lower rank","venue":null,"work_id":null,"year":1936},"citing_paper":{"arxiv_id":"2502.02843","last_updated":"2026-07-09T18:33:42Z","snapshot_observed_at":"2026-08-10T03:51:54.414050Z","submitted_at":"2025-02-05T02:58:21Z","title":"On Trimming Tensor-structured Measurements and Efficient Low-rank Tensor Recovery","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-09T11:03:54.009189Z"},"links":{"citing_paper":"/paper/2502.02843"},"observation_digest":"sha256:661d0111eefa71fb1f79622665e2330844494d3ab93ca495676e9bcd67dba611","observation_id":"7f58548f-c94a-4e27-ac9c-2bde7385ceed","resolution":{"observed_at":"2026-08-09T11:03:54.009189Z","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-09T11:03:54.833818Z","title":"Angen¨ aherte Aufl¨ osung von Systemen linearer Gleichungen","venue":null,"work_id":"8d1061f8-2499-4114-bbc2-3e27ecf48508","year":1937},"citing_paper":{"arxiv_id":"2502.02843","last_updated":"2026-07-09T18:33:42Z","snapshot_observed_at":"2026-08-10T03:51:54.414050Z","submitted_at":"2025-02-05T02:58:21Z","title":"On Trimming Tensor-structured Measurements and Efficient Low-rank Tensor Recovery","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-09T11:03:54.014243Z"},"links":{"citing_paper":"/paper/2502.02843"},"observation_digest":"sha256:7528152f293f87823f9972d368d20c1e3ae5d6e0a395757dc051a5997c98578d","observation_id":"9cc37622-62e8-4b87-ad18-02a4e08e9fca","resolution":{"observed_at":"2026-08-09T11:03:54.836680Z","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-09T11:03:54.824759Z","title":"A multilinear singular value decomposition","venue":null,"work_id":"7d12f44d-59fb-454a-ad9f-2ab34dbb9f95","year":2000},"citing_paper":{"arxiv_id":"2502.02843","last_updated":"2026-07-09T18:33:42Z","snapshot_observed_at":"2026-08-10T03:51:54.414050Z","submitted_at":"2025-02-05T02:58:21Z","title":"On Trimming Tensor-structured Measurements and Efficient Low-rank Tensor Recovery","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-09T11:03:54.018171Z"},"links":{"citing_paper":"/paper/2502.02843"},"observation_digest":"sha256:d0ff71386c1d06e1c8ff84918e6505281b2d12a1bc2b758339a5157a6ca53bd7","observation_id":"da502b0d-6f57-4715-a3c8-5b06160e1516","resolution":{"observed_at":"2026-08-09T11:03:54.828307Z","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-09T11:03:54.814835Z","title":"On the best rank-1 and rank-(r1, r2,..., rn) approximation of higher-order tensors","venue":null,"work_id":"adddc0c9-782d-4daf-ba0a-d64812913e83","year":2000},"citing_paper":{"arxiv_id":"2502.02843","last_updated":"2026-07-09T18:33:42Z","snapshot_observed_at":"2026-08-10T03:51:54.414050Z","submitted_at":"2025-02-05T02:58:21Z","title":"On Trimming Tensor-structured Measurements and Efficient Low-rank Tensor Recovery","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-09T11:03:54.022385Z"},"links":{"citing_paper":"/paper/2502.02843"},"observation_digest":"sha256:609c88a8f12262ee146a7bf9df19153431ad65f63f55eece7e050809a6bcf7f5","observation_id":"7ef271cf-21b7-4513-80a7-721ce701a1c5","resolution":{"observed_at":"2026-08-09T11:03:54.818635Z","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-09T11:03:54.804333Z","title":"Construction and analysis of degenerate PARAF AC models","venue":null,"work_id":"5eb73ef2-103b-40d8-81e8-5a725b6c7eae","year":2000},"citing_paper":{"arxiv_id":"2502.02843","last_updated":"2026-07-09T18:33:42Z","snapshot_observed_at":"2026-08-10T03:51:54.414050Z","submitted_at":"2025-02-05T02:58:21Z","title":"On Trimming Tensor-structured Measurements and Efficient Low-rank Tensor Recovery","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-09T11:03:54.026754Z"},"links":{"citing_paper":"/paper/2502.02843"},"observation_digest":"sha256:2abc5624f079ccf6017f9f32fe4e3709cb8aa6d5ce714794abfc739c39a051d2","observation_id":"54362c38-2f5e-4f59-83e1-ecd76dfe952c","resolution":{"observed_at":"2026-08-09T11:03:54.808190Z","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-09T11:03:54.794171Z","title":"Robust uncertainty principles: Exact signal reconstruction from highly incomplete frequency information","venue":null,"work_id":"baf9a6b9-93c2-47d8-9817-d900091b85f6","year":2006},"citing_paper":{"arxiv_id":"2502.02843","last_updated":"2026-07-09T18:33:42Z","snapshot_observed_at":"2026-08-10T03:51:54.414050Z","submitted_at":"2025-02-05T02:58:21Z","title":"On Trimming Tensor-structured Measurements and Efficient Low-rank Tensor Recovery","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-09T11:03:54.030881Z"},"links":{"citing_paper":"/paper/2502.02843"},"observation_digest":"sha256:45dc9b32a3c19b5d805d0ab3a353a853f86e2066e5e02c37fc83a1d57432b90c","observation_id":"279930b1-d724-4c3c-8cfc-9154e7b8e8d0","resolution":{"observed_at":"2026-08-09T11:03:54.797718Z","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-09T11:03:54.784250Z","title":"The restricted isometry property and its implications for compressed sensing","venue":null,"work_id":"d5d26c30-6aa3-4935-93ab-2e9acac476a6","year":2008},"citing_paper":{"arxiv_id":"2502.02843","last_updated":"2026-07-09T18:33:42Z","snapshot_observed_at":"2026-08-10T03:51:54.414050Z","submitted_at":"2025-02-05T02:58:21Z","title":"On Trimming Tensor-structured Measurements and Efficient Low-rank Tensor Recovery","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-09T11:03:54.034975Z"},"links":{"citing_paper":"/paper/2502.02843"},"observation_digest":"sha256:97affa9f70efea11def7883af21052276b7d6a055cc8f9c426fd2ef704ef191c","observation_id":"152a3188-4275-45b4-b703-8d510b575acc","resolution":{"observed_at":"2026-08-09T11:03:54.787792Z","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-09T11:03:54.774549Z","title":"The fast Johnson–Lindenstrauss transform and approximate nearest neighbors","venue":null,"work_id":"e0154d48-94fc-4868-8338-08fd945d90ad","year":2009},"citing_paper":{"arxiv_id":"2502.02843","last_updated":"2026-07-09T18:33:42Z","snapshot_observed_at":"2026-08-10T03:51:54.414050Z","submitted_at":"2025-02-05T02:58:21Z","title":"On Trimming Tensor-structured Measurements and Efficient Low-rank Tensor Recovery","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-09T11:03:54.038601Z"},"links":{"citing_paper":"/paper/2502.02843"},"observation_digest":"sha256:bd0726f5cc4ded2b1be917c44a504c4f02815e2cd33c627a9f1a557f5e48114a","observation_id":"98c6af39-64cd-453d-8245-5834d0e3703d","resolution":{"observed_at":"2026-08-09T11:03:54.778142Z","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-09T11:03:54.764802Z","title":"Tensor decompositions and applications","venue":null,"work_id":"92a66ba3-5ca4-473b-9728-b5faf5ed4277","year":2009},"citing_paper":{"arxiv_id":"2502.02843","last_updated":"2026-07-09T18:33:42Z","snapshot_observed_at":"2026-08-10T03:51:54.414050Z","submitted_at":"2025-02-05T02:58:21Z","title":"On Trimming Tensor-structured Measurements and Efficient Low-rank Tensor Recovery","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-09T11:03:54.042258Z"},"links":{"citing_paper":"/paper/2502.02843"},"observation_digest":"sha256:f9e6154cdefe7a672fd128ea3beb9e12668e9963dc120d191738e179342dc714","observation_id":"fc5ff8a8-1e12-4a9d-ab96-48b9766cd62b","resolution":{"observed_at":"2026-08-09T11:03:54.768107Z","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-09T11:03:54.755192Z","title":"A randomized Kaczmarz algorithm with expo- nential convergence","venue":null,"work_id":"353b0475-6678-4ba6-8bfd-184a92b3565c","year":2009},"citing_paper":{"arxiv_id":"2502.02843","last_updated":"2026-07-09T18:33:42Z","snapshot_observed_at":"2026-08-10T03:51:54.414050Z","submitted_at":"2025-02-05T02:58:21Z","title":"On Trimming Tensor-structured Measurements and Efficient Low-rank Tensor Recovery","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-09T11:03:54.045755Z"},"links":{"citing_paper":"/paper/2502.02843"},"observation_digest":"sha256:9a9af416cb41af69d44d9d0904182462cc2e8d5f2f0c9dc2e89b74975cb3d65a","observation_id":"e32c2dab-89c1-4bee-b53b-8509c8b11bad","resolution":{"observed_at":"2026-08-09T11:03:54.758652Z","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-09T11:03:54.745584Z","title":"A singular value thresholding al- gorithm for matrix completion","venue":null,"work_id":"39ccde2e-ac6f-49c6-b046-af3ac5d15174","year":2010},"citing_paper":{"arxiv_id":"2502.02843","last_updated":"2026-07-09T18:33:42Z","snapshot_observed_at":"2026-08-10T03:51:54.414050Z","submitted_at":"2025-02-05T02:58:21Z","title":"On Trimming Tensor-structured Measurements and Efficient Low-rank Tensor Recovery","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-09T11:03:54.049229Z"},"links":{"citing_paper":"/paper/2502.02843"},"observation_digest":"sha256:36b932be67453e41786b529365e357fa8a90c5339ba9cfb4a6bea18802632503","observation_id":"0d4e796f-8e01-4e4c-90dd-60e6af177bf7","resolution":{"observed_at":"2026-08-09T11:03:54.749268Z","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-09T11:03:54.736400Z","title":"A sparse Johnson- Lindenstrauss trans- form","venue":null,"work_id":"d29962b4-8c6b-4729-80d5-1db7acb3a532","year":2010},"citing_paper":{"arxiv_id":"2502.02843","last_updated":"2026-07-09T18:33:42Z","snapshot_observed_at":"2026-08-10T03:51:54.414050Z","submitted_at":"2025-02-05T02:58:21Z","title":"On Trimming Tensor-structured Measurements and Efficient Low-rank Tensor Recovery","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-09T11:03:54.052925Z"},"links":{"citing_paper":"/paper/2502.02843"},"observation_digest":"sha256:7617615421aa5fbd1ea4f4268e8aefc247583467b41435965724d6ec0002098b","observation_id":"5dfcb9f7-b0da-4b48-ab6d-97ca1ad9b969","resolution":{"observed_at":"2026-08-09T11:03:54.739593Z","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-09T11:03:54.727177Z","title":"Tensor completion for estimating missing values in visual data","venue":null,"work_id":"7a985387-1e6d-4433-ae1a-83593f4abaec","year":2012},"citing_paper":{"arxiv_id":"2502.02843","last_updated":"2026-07-09T18:33:42Z","snapshot_observed_at":"2026-08-10T03:51:54.414050Z","submitted_at":"2025-02-05T02:58:21Z","title":"On Trimming Tensor-structured Measurements and Efficient Low-rank Tensor Recovery","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-09T11:03:54.056319Z"},"links":{"citing_paper":"/paper/2502.02843"},"observation_digest":"sha256:c9f00b2e6d9ea18991f5c746041aac8927cd60df93ef828c804a1271f112394a","observation_id":"ac7c191e-12a2-4765-a0f5-174305a31bac","resolution":{"observed_at":"2026-08-09T11:03:54.730482Z","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-09T11:03:54.717508Z","title":"A new truncation strategy for the higher-order singular value decomposition","venue":null,"work_id":"7bee8ca3-ca1e-4baa-8025-af0fc4e20eb6","year":2012},"citing_paper":{"arxiv_id":"2502.02843","last_updated":"2026-07-09T18:33:42Z","snapshot_observed_at":"2026-08-10T03:51:54.414050Z","submitted_at":"2025-02-05T02:58:21Z","title":"On Trimming Tensor-structured Measurements and Efficient Low-rank Tensor Recovery","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-09T11:03:54.059723Z"},"links":{"citing_paper":"/paper/2502.02843"},"observation_digest":"sha256:226b243617267d433be37a0ee872c69c06e753e468610935fbb1ba16b78866bc","observation_id":"8c27257d-191a-4ae9-ab17-96336ffd663f","resolution":{"observed_at":"2026-08-09T11:03:54.720754Z","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-09T11:03:54.707769Z","title":"Normalized iterative hard thresholding for matrix completion","venue":null,"work_id":"1d9fd2cc-dbeb-4f9a-864e-8e8c193d27ec","year":2013},"citing_paper":{"arxiv_id":"2502.02843","last_updated":"2026-07-09T18:33:42Z","snapshot_observed_at":"2026-08-10T03:51:54.414050Z","submitted_at":"2025-02-05T02:58:21Z","title":"On Trimming Tensor-structured Measurements and Efficient Low-rank Tensor Recovery","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-09T11:03:54.063083Z"},"links":{"citing_paper":"/paper/2502.02843"},"observation_digest":"sha256:37ee3cab63239a42899139ff84d9f619637bb040499cb308c42ead3ab7c51da4","observation_id":"f6db88b9-2469-4dd4-8e0e-82a62cd4dd15","resolution":{"observed_at":"2026-08-09T11:03:54.711226Z","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-09T11:03:54.698780Z","title":"Sparser Johnson- Lindenstrauss transforms","venue":null,"work_id":"2b6ad887-95e4-4c55-a1d8-62f78dc3f4fc","year":2014},"citing_paper":{"arxiv_id":"2502.02843","last_updated":"2026-07-09T18:33:42Z","snapshot_observed_at":"2026-08-10T03:51:54.414050Z","submitted_at":"2025-02-05T02:58:21Z","title":"On Trimming Tensor-structured Measurements and Efficient Low-rank Tensor Recovery","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-09T11:03:54.066436Z"},"links":{"citing_paper":"/paper/2502.02843"},"observation_digest":"sha256:ba65f1287748df356e4f426c058e4bcf491441cd96bf4403f107da57c8fb2b82","observation_id":"e25b17c7-d23b-42eb-bea3-4cc6756213f6","resolution":{"observed_at":"2026-08-09T11:03:54.701843Z","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-09T11:03:54.689594Z","title":"ROP: Matrix recovery via rank-one projections","venue":null,"work_id":"cefbac9a-49f2-42b5-9ac0-6d948696e0d0","year":2015},"citing_paper":{"arxiv_id":"2502.02843","last_updated":"2026-07-09T18:33:42Z","snapshot_observed_at":"2026-08-10T03:51:54.414050Z","submitted_at":"2025-02-05T02:58:21Z","title":"On Trimming Tensor-structured Measurements and Efficient Low-rank Tensor Recovery","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-09T11:03:54.069689Z"},"links":{"citing_paper":"/paper/2502.02843"},"observation_digest":"sha256:7fc608e3e377fb4b7bacb253fb6cd951ccb146a4fed597814641b1b1ff8df971","observation_id":"20261afd-b695-4d8e-9983-4508eb072b7f","resolution":{"observed_at":"2026-08-09T11:03:54.692574Z","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-09T11:03:54.679754Z","title":"Tensor decompositions for signal processing applications: From two- way to multiway component analysis","venue":null,"work_id":"0432bc00-7aa8-46fd-b112-e3c30bb2a4ac","year":2015},"citing_paper":{"arxiv_id":"2502.02843","last_updated":"2026-07-09T18:33:42Z","snapshot_observed_at":"2026-08-10T03:51:54.414050Z","submitted_at":"2025-02-05T02:58:21Z","title":"On Trimming Tensor-structured Measurements and Efficient Low-rank Tensor Recovery","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-09T11:03:54.072994Z"},"links":{"citing_paper":"/paper/2502.02843"},"observation_digest":"sha256:270039ca98774c492def02a12f709356637a2a43eaf16f0284797a768f4670ce","observation_id":"6078bb97-cb43-40ae-a0e7-58518acd2d31","resolution":{"observed_at":"2026-08-09T11:03:54.683436Z","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-09T11:03:54.669797Z","title":"Dimensionality reduction for k-means clustering and low rank ap- proximation","venue":null,"work_id":"d6998262-4070-4cd3-8d96-2d626d199b80","year":2015},"citing_paper":{"arxiv_id":"2502.02843","last_updated":"2026-07-09T18:33:42Z","snapshot_observed_at":"2026-08-10T03:51:54.414050Z","submitted_at":"2025-02-05T02:58:21Z","title":"On Trimming Tensor-structured Measurements and Efficient Low-rank Tensor Recovery","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-09T11:03:54.076371Z"},"links":{"citing_paper":"/paper/2502.02843"},"observation_digest":"sha256:70b0bed804e0d0e5a66a9695f44c07084705cfcdee06a8d84f44e7202e1ba5cb","observation_id":"47e78f88-a0ee-4959-98d7-43fdd9895e64","resolution":{"observed_at":"2026-08-09T11:03:54.673603Z","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-09T11:03:54.660065Z","title":"An iterative hard thresholding algorithm with improved convergence for low-rank tensor recovery","venue":null,"work_id":"2fb684ba-6e5e-4a12-b22b-4501cb9ad981","year":2015},"citing_paper":{"arxiv_id":"2502.02843","last_updated":"2026-07-09T18:33:42Z","snapshot_observed_at":"2026-08-10T03:51:54.414050Z","submitted_at":"2025-02-05T02:58:21Z","title":"On Trimming Tensor-structured Measurements and Efficient Low-rank Tensor Recovery","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-09T11:03:54.080023Z"},"links":{"citing_paper":"/paper/2502.02843"},"observation_digest":"sha256:d9a7bdf2a5be44dfb0d62e86724d965d9e1c3050ee0e0f63a950444669950d04","observation_id":"ab666362-1b20-462a-8541-79a0ac6d5481","resolution":{"observed_at":"2026-08-09T11:03:54.663630Z","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-09T11:03:54.650796Z","title":"Modified distributed iterative hard thresh- olding","venue":null,"work_id":"d50581ab-b0e3-45f1-8598-a922baee704c","year":2015},"citing_paper":{"arxiv_id":"2502.02843","last_updated":"2026-07-09T18:33:42Z","snapshot_observed_at":"2026-08-10T03:51:54.414050Z","submitted_at":"2025-02-05T02:58:21Z","title":"On Trimming Tensor-structured Measurements and Efficient Low-rank Tensor Recovery","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-09T11:03:54.083113Z"},"links":{"citing_paper":"/paper/2502.02843"},"observation_digest":"sha256:67d08f447d42d27162e3aea0788f5dde49ae979ca7ec46a22366ed45fb928a0e","observation_id":"a77f9971-09a7-417f-bc76-27dfd6071f7d","resolution":{"observed_at":"2026-08-09T11:03:54.654115Z","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-09T11:03:54.640652Z","title":"Iterative hard thresholding based on ran- domized Kaczmarz method","venue":null,"work_id":"d70cdf65-cff9-4c74-ab86-a6ff01262128","year":2015},"citing_paper":{"arxiv_id":"2502.02843","last_updated":"2026-07-09T18:33:42Z","snapshot_observed_at":"2026-08-10T03:51:54.414050Z","submitted_at":"2025-02-05T02:58:21Z","title":"On Trimming Tensor-structured Measurements and Efficient Low-rank Tensor Recovery","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-09T11:03:54.085750Z"},"links":{"citing_paper":"/paper/2502.02843"},"observation_digest":"sha256:bad9529ef7047c860ce8bd26e33659e7e66d67fc4c8a125580a62dfb5e05bf87","observation_id":"8159d4aa-410f-4c6f-8238-5c191a97cf8c","resolution":{"observed_at":"2026-08-09T11:03:54.644366Z","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-09T11:03:54.630990Z","title":"Efficient matrix sensing using rank-1 gauss- ian measurements","venue":null,"work_id":"6afd1262-6a85-41e2-909d-5abdd9cea2c4","year":2015},"citing_paper":{"arxiv_id":"2502.02843","last_updated":"2026-07-09T18:33:42Z","snapshot_observed_at":"2026-08-10T03:51:54.414050Z","submitted_at":"2025-02-05T02:58:21Z","title":"On Trimming Tensor-structured Measurements and Efficient Low-rank Tensor Recovery","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-09T11:03:54.088565Z"},"links":{"citing_paper":"/paper/2502.02843"},"observation_digest":"sha256:dcd8f9cc27b8ef5b422a8f89d08bc4b101ab4f9054b2edd571a0ec089b03b9e7","observation_id":"9927eafa-1d31-495b-9c4b-148c85bdca8f","resolution":{"observed_at":"2026-08-09T11:03:54.634554Z","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-09T11:03:54.621107Z","title":"Parallel tensor compression for large- scale scientific data","venue":null,"work_id":"381bf701-3c7a-46ff-bf8c-2fce9d12c7a5","year":2016},"citing_paper":{"arxiv_id":"2502.02843","last_updated":"2026-07-09T18:33:42Z","snapshot_observed_at":"2026-08-10T03:51:54.414050Z","submitted_at":"2025-02-05T02:58:21Z","title":"On Trimming Tensor-structured Measurements and Efficient Low-rank Tensor Recovery","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-09T11:03:54.091323Z"},"links":{"citing_paper":"/paper/2502.02843"},"observation_digest":"sha256:ffb874922448936cd82beffb6df01cdd3852efe1419c3699262b089c961b86f1","observation_id":"ebb32289-b8cf-4b14-890f-c152f062d0a6","resolution":{"observed_at":"2026-08-09T11:03:54.624647Z","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-09T11:03:54.610523Z","title":"Kaczmarz method for solving quadratic equations","venue":null,"work_id":"a4345efa-ce9c-4d1b-95b3-3e79c1c00ae0","year":2016},"citing_paper":{"arxiv_id":"2502.02843","last_updated":"2026-07-09T18:33:42Z","snapshot_observed_at":"2026-08-10T03:51:54.414050Z","submitted_at":"2025-02-05T02:58:21Z","title":"On Trimming Tensor-structured Measurements and Efficient Low-rank Tensor Recovery","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-09T11:03:54.093950Z"},"links":{"citing_paper":"/paper/2502.02843"},"observation_digest":"sha256:6de6a0d624045c833ccce29efcf1400ce3bd5e156aa7a2f1e0957c924815afe8","observation_id":"45095fc5-524a-4ec0-a4ab-654b4545727c","resolution":{"observed_at":"2026-08-09T11:03:54.614279Z","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-09T11:03:54.600784Z","title":"Conjugate gradient acceleration of iteratively re-weighted least squares methods","venue":null,"work_id":"b27b12ad-0ff2-4327-a7d4-7b464a28c956","year":2016},"citing_paper":{"arxiv_id":"2502.02843","last_updated":"2026-07-09T18:33:42Z","snapshot_observed_at":"2026-08-10T03:51:54.414050Z","submitted_at":"2025-02-05T02:58:21Z","title":"On Trimming Tensor-structured Measurements and Efficient Low-rank Tensor Recovery","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-09T11:03:54.096695Z"},"links":{"citing_paper":"/paper/2502.02843"},"observation_digest":"sha256:8dd6eaa5b4bb451a9874f3acc58f99f1a75de01ec49ab624286addd38adcad03","observation_id":"11be1c77-d9a6-4867-9d22-5cb136cabb93","resolution":{"observed_at":"2026-08-09T11:03:54.603814Z","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-09T11:03:54.591609Z","title":"Support tensor machines for classification of hyperspectral remote sensing imagery","venue":null,"work_id":"cf3909cb-70b8-4c86-a681-a245e98bd3f4","year":2016},"citing_paper":{"arxiv_id":"2502.02843","last_updated":"2026-07-09T18:33:42Z","snapshot_observed_at":"2026-08-10T03:51:54.414050Z","submitted_at":"2025-02-05T02:58:21Z","title":"On Trimming Tensor-structured Measurements and Efficient Low-rank Tensor Recovery","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-09T11:03:54.099352Z"},"links":{"citing_paper":"/paper/2502.02843"},"observation_digest":"sha256:f2f751be134f266eb18541c3cd205dd12263b3597bf094446243d379482b38e9","observation_id":"1f288726-65e9-4277-8159-2a09ca762219","resolution":{"observed_at":"2026-08-09T11:03:54.594841Z","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-09T11:03:54.582576Z","title":"Tensors for data mining and data fusion: Models, applications, and scalable algorithms","venue":null,"work_id":"9e525e65-1367-49c1-99e4-89b082fa8b67","year":2016},"citing_paper":{"arxiv_id":"2502.02843","last_updated":"2026-07-09T18:33:42Z","snapshot_observed_at":"2026-08-10T03:51:54.414050Z","submitted_at":"2025-02-05T02:58:21Z","title":"On Trimming Tensor-structured Measurements and Efficient Low-rank Tensor Recovery","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-09T11:03:54.102213Z"},"links":{"citing_paper":"/paper/2502.02843"},"observation_digest":"sha256:1347daa438303c20a351434f78b4f79adf716230b560c9bbe11b5b8f306a4bd7","observation_id":"e52c0085-48b6-48df-bade-9cdded75cf38","resolution":{"observed_at":"2026-08-09T11:03:54.585577Z","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-09T11:03:54.573916Z","title":"Guarantees of Riemannian optimization for low rank matrix recovery","venue":null,"work_id":"9bbbd0ea-03b5-4ebb-b060-81db5eceba12","year":2016},"citing_paper":{"arxiv_id":"2502.02843","last_updated":"2026-07-09T18:33:42Z","snapshot_observed_at":"2026-08-10T03:51:54.414050Z","submitted_at":"2025-02-05T02:58:21Z","title":"On Trimming Tensor-structured Measurements and Efficient Low-rank Tensor Recovery","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-09T11:03:54.105120Z"},"links":{"citing_paper":"/paper/2502.02843"},"observation_digest":"sha256:24930e5655e23842ac58c420b0b7d5eb48179615505f8f6c7ab1cc315fd70366","observation_id":"615c0884-283b-4628-90fa-7ed400d53988","resolution":{"observed_at":"2026-08-09T11:03:54.576977Z","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-09T11:03:54.564976Z","title":"Exact tensor completion using t-SVD","venue":null,"work_id":"d5388202-7bb2-46fe-9a5f-545c524ef9da","year":2016},"citing_paper":{"arxiv_id":"2502.02843","last_updated":"2026-07-09T18:33:42Z","snapshot_observed_at":"2026-08-10T03:51:54.414050Z","submitted_at":"2025-02-05T02:58:21Z","title":"On Trimming Tensor-structured Measurements and Efficient Low-rank Tensor Recovery","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-09T11:03:54.107982Z"},"links":{"citing_paper":"/paper/2502.02843"},"observation_digest":"sha256:5d78768a289a8ed9193e2faf54c10b8ad53c8683588af8ba42634fabc1513cb4","observation_id":"249fdaa1-45c6-42a2-b4a9-c39d1d090bed","resolution":{"observed_at":"2026-08-09T11:03:54.567930Z","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-09T11:03:54.556374Z","title":"Linked component analysis from matrices to high-order tensors: Applica- tions to biomedical data","venue":null,"work_id":"5d86c629-6773-403a-9b68-ed1287a8b036","year":2016},"citing_paper":{"arxiv_id":"2502.02843","last_updated":"2026-07-09T18:33:42Z","snapshot_observed_at":"2026-08-10T03:51:54.414050Z","submitted_at":"2025-02-05T02:58:21Z","title":"On Trimming Tensor-structured Measurements and Efficient Low-rank Tensor Recovery","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-09T11:03:54.110798Z"},"links":{"citing_paper":"/paper/2502.02843"},"observation_digest":"sha256:3ce83d92be44b1eafd0f159a54f36a19b39413b286a2103a3069e5f28d41fd9b","observation_id":"25ef8671-1ead-459c-b24a-25eb152f15ba","resolution":{"observed_at":"2026-08-09T11:03:54.559416Z","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-09T11:03:54.547573Z","title":"Tensor decompositions and data fusion in epileptic electroencephalog- raphy and functional magnetic resonance imaging data","venue":null,"work_id":"394e1f67-bd1f-410d-8afe-5324266a5fb4","year":2017},"citing_paper":{"arxiv_id":"2502.02843","last_updated":"2026-07-09T18:33:42Z","snapshot_observed_at":"2026-08-10T03:51:54.414050Z","submitted_at":"2025-02-05T02:58:21Z","title":"On Trimming Tensor-structured Measurements and Efficient Low-rank Tensor Recovery","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-09T11:03:54.113492Z"},"links":{"citing_paper":"/paper/2502.02843"},"observation_digest":"sha256:e163b343e41ad5241720476e5451ccbae512aa509a23e21b882cd2dd0f01e02f","observation_id":"61350726-1a2f-472a-8fc1-252410363959","resolution":{"observed_at":"2026-08-09T11:03:54.550835Z","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-09T11:03:54.537845Z","title":"Low rank tensor recovery via iterative hard thresholding","venue":null,"work_id":"1c5637b4-05ba-42de-98c4-31ec0e0aa1ed","year":2017},"citing_paper":{"arxiv_id":"2502.02843","last_updated":"2026-07-09T18:33:42Z","snapshot_observed_at":"2026-08-10T03:51:54.414050Z","submitted_at":"2025-02-05T02:58:21Z","title":"On Trimming Tensor-structured Measurements and Efficient Low-rank Tensor Recovery","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-09T11:03:54.116258Z"},"links":{"citing_paper":"/paper/2502.02843"},"observation_digest":"sha256:ec26a6f5e4bf09d8a0c669f66a1df4952cda0c432146512bbb6d1b034601dc95","observation_id":"08a747e7-e373-4c92-8d79-fa4339a0a92c","resolution":{"observed_at":"2026-08-09T11:03:54.541367Z","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-09T11:03:54.528434Z","title":"Tensor decomposition for signal processing and machine learn- ing","venue":null,"work_id":"7a4c48e1-b1e6-4bae-bc7c-d77ae66a1159","year":2017},"citing_paper":{"arxiv_id":"2502.02843","last_updated":"2026-07-09T18:33:42Z","snapshot_observed_at":"2026-08-10T03:51:54.414050Z","submitted_at":"2025-02-05T02:58:21Z","title":"On Trimming Tensor-structured Measurements and Efficient Low-rank Tensor Recovery","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-09T11:03:54.119176Z"},"links":{"citing_paper":"/paper/2502.02843"},"observation_digest":"sha256:1ed41886821bf037118815d8ff62e8f03bcea33ebe2b1211ab3610add06137f1","observation_id":"9da6bb25-672f-4472-ad0d-4dc83271e749","resolution":{"observed_at":"2026-08-09T11:03:54.531802Z","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-09T11:03:54.518688Z","title":"A practical randomized CP tensor decomposition","venue":null,"work_id":"d7928422-9b33-4754-b735-abd0a178443e","year":2018},"citing_paper":{"arxiv_id":"2502.02843","last_updated":"2026-07-09T18:33:42Z","snapshot_observed_at":"2026-08-10T03:51:54.414050Z","submitted_at":"2025-02-05T02:58:21Z","title":"On Trimming Tensor-structured Measurements and Efficient Low-rank Tensor Recovery","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-09T11:03:54.121855Z"},"links":{"citing_paper":"/paper/2502.02843"},"observation_digest":"sha256:5c95b81189da66c23767cb1dfcb2f135c9eec46a58ba302f1d40207c13ce8e48","observation_id":"093cd904-a691-4f4c-81f8-3822f0181797","resolution":{"observed_at":"2026-08-09T11:03:54.522162Z","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-09T11:03:54.508914Z","title":"High-dimensional probability: An introduction with applications in data science","venue":null,"work_id":"bac1b279-1b44-48ad-8b35-29a9d3cfedf5","year":2018},"citing_paper":{"arxiv_id":"2502.02843","last_updated":"2026-07-09T18:33:42Z","snapshot_observed_at":"2026-08-10T03:51:54.414050Z","submitted_at":"2025-02-05T02:58:21Z","title":"On Trimming Tensor-structured Measurements and Efficient Low-rank Tensor Recovery","version":2},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-09T11:03:54.124780Z"},"links":{"citing_paper":"/paper/2502.02843"},"observation_digest":"sha256:596dbc54fca65b99ed9837950013c6b2dca749fdb9d0b7e9142c22860b251b8a","observation_id":"dd36afa2-a0bb-4b15-9b99-633bc16595ea","resolution":{"observed_at":"2026-08-09T11:03:54.512407Z","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-09T11:03:54.498896Z","title":"Sketched ridge regression: Opti- mization perspective, statistical perspective, and model averaging","venue":null,"work_id":"2eb64578-43a0-4757-9251-a0d64d17b147","year":2018},"citing_paper":{"arxiv_id":"2502.02843","last_updated":"2026-07-09T18:33:42Z","snapshot_observed_at":"2026-08-10T03:51:54.414050Z","submitted_at":"2025-02-05T02:58:21Z","title":"On Trimming Tensor-structured Measurements and Efficient Low-rank Tensor Recovery","version":2},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-09T11:03:54.127754Z"},"links":{"citing_paper":"/paper/2502.02843"},"observation_digest":"sha256:464312eac239d8fc4f10c5c016626c5f248c86e619f39029feb05d88c4bfd66c","observation_id":"b748c1b8-b460-44eb-b9e5-09307c5ba9fc","resolution":{"observed_at":"2026-08-09T11:03:54.502558Z","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-09T11:03:54.488800Z","title":"Median-truncated nonconvex approach for phase retrieval with outliers","venue":null,"work_id":"8b7a7982-47a5-45e2-aa87-e440f712d224","year":2018},"citing_paper":{"arxiv_id":"2502.02843","last_updated":"2026-07-09T18:33:42Z","snapshot_observed_at":"2026-08-10T03:51:54.414050Z","submitted_at":"2025-02-05T02:58:21Z","title":"On Trimming Tensor-structured Measurements and Efficient Low-rank Tensor Recovery","version":2},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-09T11:03:54.130429Z"},"links":{"citing_paper":"/paper/2502.02843"},"observation_digest":"sha256:157bcf16afa1d28f8bf5b39487c196ade7e96603d01ca865395bc64d74417a5b","observation_id":"3520f361-175e-4e8c-b32e-b6d50be4f074","resolution":{"observed_at":"2026-08-09T11:03:54.492279Z","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":"1909.01821","last_updated":"2019-09-03T08:56:59Z","snapshot_observed_at":"2026-08-09T11:46:33.619007Z","submitted_at":"2019-09-03T08:56:59Z","title":"Almost Optimal Tensor Sketch","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1909.01821","snapshot_observed_at":"2026-08-09T11:03:54.133001Z","title":"Almost optimal tensor sketch","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2502.02843","last_updated":"2026-07-09T18:33:42Z","snapshot_observed_at":"2026-08-10T03:51:54.414050Z","submitted_at":"2025-02-05T02:58:21Z","title":"On Trimming Tensor-structured Measurements and Efficient Low-rank Tensor Recovery","version":2},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-09T11:03:54.133001Z"},"links":{"cited_paper":"/paper/1909.01821","citing_paper":"/paper/2502.02843"},"observation_digest":"sha256:7ce639cbd58b0400308698a6024b2b923cad94324075b7a69d20a9e3ec593fa8","observation_id":"13c2177c-12be-4849-bdc6-32a7a04e3435","resolution":{"observed_at":"2026-08-09T11:03:54.133001Z","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-09T11:03:54.478700Z","title":"TTHRESH: Tensor compres- sion for multidimensional visual data","venue":null,"work_id":"6d328ab4-885b-4fbe-8594-3662846ab7ad","year":2019},"citing_paper":{"arxiv_id":"2502.02843","last_updated":"2026-07-09T18:33:42Z","snapshot_observed_at":"2026-08-10T03:51:54.414050Z","submitted_at":"2025-02-05T02:58:21Z","title":"On Trimming Tensor-structured Measurements and Efficient Low-rank Tensor Recovery","version":2},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-09T11:03:54.136000Z"},"links":{"citing_paper":"/paper/2502.02843"},"observation_digest":"sha256:4d64c456a41446b75d9686c0c4a3c5db60499e6aaf5b047ab181932dc44fe8e9","observation_id":"a1c9a032-131e-4e0c-a608-0865d5126ebd","resolution":{"observed_at":"2026-08-09T11:03:54.482463Z","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-09T11:03:54.469204Z","title":"Iterative hard thresholding for low-rank recovery from rank-one projections","venue":null,"work_id":"3c20a7a1-7852-4294-a88d-1b643a6907d3","year":2019},"citing_paper":{"arxiv_id":"2502.02843","last_updated":"2026-07-09T18:33:42Z","snapshot_observed_at":"2026-08-10T03:51:54.414050Z","submitted_at":"2025-02-05T02:58:21Z","title":"On Trimming Tensor-structured Measurements and Efficient Low-rank Tensor Recovery","version":2},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-09T11:03:54.139127Z"},"links":{"citing_paper":"/paper/2502.02843"},"observation_digest":"sha256:5c12e26407e78ea9249feff5973e7470c0261985d5ca0a37bb4742ce6a76f833","observation_id":"5d3ca5c4-3336-4816-8246-7012aff3cfb3","resolution":{"observed_at":"2026-08-09T11:03:54.472259Z","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-09T11:03:54.460466Z","title":"Tensorly: Tensor learning in python","venue":null,"work_id":"2abc3580-c48c-414c-b17c-2b3862dddf29","year":2019},"citing_paper":{"arxiv_id":"2502.02843","last_updated":"2026-07-09T18:33:42Z","snapshot_observed_at":"2026-08-10T03:51:54.414050Z","submitted_at":"2025-02-05T02:58:21Z","title":"On Trimming Tensor-structured Measurements and Efficient Low-rank Tensor Recovery","version":2},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-09T11:03:54.142661Z"},"links":{"citing_paper":"/paper/2502.02843"},"observation_digest":"sha256:a8731eed990db12e53454cf14429d7c195031a48b6567f933677e21d4dc9f8b2","observation_id":"2ff12218-4de4-412d-9a7b-6e61c17abf98","resolution":{"observed_at":"2026-08-09T11:03:54.463532Z","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-09T11:03:54.451730Z","title":"Relative error tensor low rank approxima- tion","venue":null,"work_id":"364dc6bd-089c-4d73-aeb9-954f2e04a4fd","year":2019},"citing_paper":{"arxiv_id":"2502.02843","last_updated":"2026-07-09T18:33:42Z","snapshot_observed_at":"2026-08-10T03:51:54.414050Z","submitted_at":"2025-02-05T02:58:21Z","title":"On Trimming Tensor-structured Measurements and Efficient Low-rank Tensor Recovery","version":2},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-09T11:03:54.145905Z"},"links":{"citing_paper":"/paper/2502.02843"},"observation_digest":"sha256:da9a5ae220d219ea1f7b9748819e14430b4e3cf27401a81fc8237c06845fa6e6","observation_id":"c0b494fb-5605-4751-8121-670fc90a7a93","resolution":{"observed_at":"2026-08-09T11:03:54.454729Z","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-09T11:03:54.441949Z","title":"Oblivious sketching of high-degree polynomial kernels","venue":null,"work_id":"3902d463-5d4e-419f-8c97-84a98ba6941f","year":2020},"citing_paper":{"arxiv_id":"2502.02843","last_updated":"2026-07-09T18:33:42Z","snapshot_observed_at":"2026-08-10T03:51:54.414050Z","submitted_at":"2025-02-05T02:58:21Z","title":"On Trimming Tensor-structured Measurements and Efficient Low-rank Tensor Recovery","version":2},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-09T11:03:54.149747Z"},"links":{"citing_paper":"/paper/2502.02843"},"observation_digest":"sha256:61865dc3abd88d40f81db256a1af24aa50d42cd107ed256c4d467a140f936309","observation_id":"071a0c4d-914c-40b5-8b57-8b798bde4106","resolution":{"observed_at":"2026-08-09T11:03:54.445796Z","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-09T11:03:54.432758Z","title":"Stochastic iterative hard thresholding for low-Tucker-rank tensor recovery","venue":null,"work_id":"ffe296d0-a2c6-460f-be44-0fad70c819d8","year":2020},"citing_paper":{"arxiv_id":"2502.02843","last_updated":"2026-07-09T18:33:42Z","snapshot_observed_at":"2026-08-10T03:51:54.414050Z","submitted_at":"2025-02-05T02:58:21Z","title":"On Trimming Tensor-structured Measurements and Efficient Low-rank Tensor Recovery","version":2},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-09T11:03:54.152983Z"},"links":{"citing_paper":"/paper/2502.02843"},"observation_digest":"sha256:dfc11a18b9cc2fbaef8f32e9eeb4557f987cd1254e9c805c693c5536e683e81f","observation_id":"11795407-b07d-4918-a1a3-d6d5011e97f4","resolution":{"observed_at":"2026-08-09T11:03:54.435749Z","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-09T11:03:54.423931Z","title":"On recoverability of randomly compressed tensors with low CP rank","venue":null,"work_id":"a18e438d-2876-4b5f-bf90-5c1f0cda10ef","year":2020},"citing_paper":{"arxiv_id":"2502.02843","last_updated":"2026-07-09T18:33:42Z","snapshot_observed_at":"2026-08-10T03:51:54.414050Z","submitted_at":"2025-02-05T02:58:21Z","title":"On Trimming Tensor-structured Measurements and Efficient Low-rank Tensor Recovery","version":2},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-09T11:03:54.156182Z"},"links":{"citing_paper":"/paper/2502.02843"},"observation_digest":"sha256:1afa309e4d725c9f19708d49e8915d6733288cfaa9842a8e11290a13e8b64a26","observation_id":"3d6c94d4-066e-4d11-b006-bae47488bc18","resolution":{"observed_at":"2026-08-09T11:03:54.427033Z","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-09T11:03:54.414747Z","title":"Concentration inequalities for random tensors","venue":null,"work_id":"28740642-85ed-48e2-bde5-cf65c8c05f82","year":2020},"citing_paper":{"arxiv_id":"2502.02843","last_updated":"2026-07-09T18:33:42Z","snapshot_observed_at":"2026-08-10T03:51:54.414050Z","submitted_at":"2025-02-05T02:58:21Z","title":"On Trimming Tensor-structured Measurements and Efficient Low-rank Tensor Recovery","version":2},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-09T11:03:54.159479Z"},"links":{"citing_paper":"/paper/2502.02843"},"observation_digest":"sha256:457f8a322d4d15c6807655703836b0ceb3278f6aa282aaf44543b1584d310049","observation_id":"f3db13bc-5122-4c6f-8ec5-ca2b0c3ce5e2","resolution":{"observed_at":"2026-08-09T11:03:54.417881Z","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-09T11:03:54.405414Z","title":"Regularized Kaczmarz algorithms for tensor recovery","venue":null,"work_id":"7cdcd212-6864-417d-8424-726b556dafe7","year":2021},"citing_paper":{"arxiv_id":"2502.02843","last_updated":"2026-07-09T18:33:42Z","snapshot_observed_at":"2026-08-10T03:51:54.414050Z","submitted_at":"2025-02-05T02:58:21Z","title":"On Trimming Tensor-structured Measurements and Efficient Low-rank Tensor Recovery","version":2},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-09T11:03:54.162793Z"},"links":{"citing_paper":"/paper/2502.02843"},"observation_digest":"sha256:18d2b9d2e7ccdeb8df55aff13a61ebf372e7a76510442626a4d9a76e6f3311f3","observation_id":"e87cefd8-0dee-4229-837d-96d4e705472c","resolution":{"observed_at":"2026-08-09T11:03:54.408828Z","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-09T11:03:54.395363Z","title":"Lower memory oblivious (tensor) subspace embeddings with fewer ran- dom bits: modewise methods for least squares","venue":null,"work_id":"ad351780-080c-4a4f-ad59-ef63352bda87","year":2021},"citing_paper":{"arxiv_id":"2502.02843","last_updated":"2026-07-09T18:33:42Z","snapshot_observed_at":"2026-08-10T03:51:54.414050Z","submitted_at":"2025-02-05T02:58:21Z","title":"On Trimming Tensor-structured Measurements and Efficient Low-rank Tensor Recovery","version":2},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-09T11:03:54.166007Z"},"links":{"citing_paper":"/paper/2502.02843"},"observation_digest":"sha256:7dbd8f57663c04f0563e5ad6176ca0b83c13c07e4125791998027307d81e1984","observation_id":"944a991d-ae06-48fd-b37b-cc7815cd76ac","resolution":{"observed_at":"2026-08-09T11:03:54.398922Z","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-09T11:03:54.384660Z","title":"Faster Johnson–Lindenstrauss transforms via Kronecker products","venue":null,"work_id":"57b541e7-cfed-4b94-beac-3b412380b4b1","year":2021},"citing_paper":{"arxiv_id":"2502.02843","last_updated":"2026-07-09T18:33:42Z","snapshot_observed_at":"2026-08-10T03:51:54.414050Z","submitted_at":"2025-02-05T02:58:21Z","title":"On Trimming Tensor-structured Measurements and Efficient Low-rank Tensor Recovery","version":2},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-09T11:03:54.169303Z"},"links":{"citing_paper":"/paper/2502.02843"},"observation_digest":"sha256:49c7ead9ab7dfcc274065052ca92e07bd522e35bb9ec3ec96eedbe73367897cb","observation_id":"12b6c46a-612f-46b6-b277-82a3989583bf","resolution":{"observed_at":"2026-08-09T11:03:54.388498Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"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":"2105.00105","last_updated":"2021-04-30T22:08:04Z","snapshot_observed_at":"2026-08-04T21:36:19.116973Z","submitted_at":"2021-04-30T22:08:04Z","title":"Tensor Random Projection for Low Memory Dimension Reduction","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2105.00105","snapshot_observed_at":"2026-08-09T11:03:54.172525Z","title":"Tensor random projection for low memory dimension reduction","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2502.02843","last_updated":"2026-07-09T18:33:42Z","snapshot_observed_at":"2026-08-10T03:51:54.414050Z","submitted_at":"2025-02-05T02:58:21Z","title":"On Trimming Tensor-structured Measurements and Efficient Low-rank Tensor Recovery","version":2},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-09T11:03:54.172525Z"},"links":{"cited_paper":"/paper/2105.00105","citing_paper":"/paper/2502.02843"},"observation_digest":"sha256:4359e7ad6d8ffafb9fa5f7377bffef7a90f267583b6130acd86ff9138f508817","observation_id":"703e4dd1-3df3-4b47-8332-d3be3a11d2b4","resolution":{"observed_at":"2026-08-09T11:03:54.172525Z","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-09T11:03:54.373868Z","title":"Iterative hard thresholding with adaptive regu- larization: Sparser solutions without sacrificing runtime","venue":null,"work_id":"5bc5f6d8-044d-4e6f-bb48-96c43ff721e4","year":2022},"citing_paper":{"arxiv_id":"2502.02843","last_updated":"2026-07-09T18:33:42Z","snapshot_observed_at":"2026-08-10T03:51:54.414050Z","submitted_at":"2025-02-05T02:58:21Z","title":"On Trimming Tensor-structured Measurements and Efficient Low-rank Tensor Recovery","version":2},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-09T11:03:54.176233Z"},"links":{"citing_paper":"/paper/2502.02843"},"observation_digest":"sha256:0d6bfba1abca2581a163cc2f3276cf07834173d46b5b618a2795d697dd761c81","observation_id":"77324cbf-9f72-49e0-90f4-ea49a35ccc74","resolution":{"observed_at":"2026-08-09T11:03:54.377518Z","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-09T11:03:54.363345Z","title":"On block accelerations of quantile randomized Kaczmarz for corrupted systems of linear equations","venue":null,"work_id":"bec13673-1886-4717-bd76-75e43cfdb725","year":2022},"citing_paper":{"arxiv_id":"2502.02843","last_updated":"2026-07-09T18:33:42Z","snapshot_observed_at":"2026-08-10T03:51:54.414050Z","submitted_at":"2025-02-05T02:58:21Z","title":"On Trimming Tensor-structured Measurements and Efficient Low-rank Tensor Recovery","version":2},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-09T11:03:54.179517Z"},"links":{"citing_paper":"/paper/2502.02843"},"observation_digest":"sha256:6810155aab4c3c3f79291d0bad262469af7068427a294d8a3db51627ba8d9a09","observation_id":"a67ad7c6-0ea9-4a5e-983a-665601642bd3","resolution":{"observed_at":"2026-08-09T11:03:54.367129Z","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-09T11:03:54.352918Z","title":"Quantile-based iterative methods for corrupted systems of linear equa- tions","venue":null,"work_id":"d294141e-2678-48c6-8bb2-963d16ccea1b","year":2022},"citing_paper":{"arxiv_id":"2502.02843","last_updated":"2026-07-09T18:33:42Z","snapshot_observed_at":"2026-08-10T03:51:54.414050Z","submitted_at":"2025-02-05T02:58:21Z","title":"On Trimming Tensor-structured Measurements and Efficient Low-rank Tensor Recovery","version":2},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-09T11:03:54.182591Z"},"links":{"citing_paper":"/paper/2502.02843"},"observation_digest":"sha256:6950cef93f13fbcf9c12f3fa4cdf9b618bad8846b04bef18dee273e9c9e5e12d","observation_id":"a2d852e8-bd84-414b-a85c-cec1e2c8c7cc","resolution":{"observed_at":"2026-08-09T11:03:54.356578Z","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-09T11:03:54.341846Z","title":"Near-isometric properties of Kronecker-structured random tensor embeddings","venue":null,"work_id":"90ddc72e-1222-4b4d-b099-560acd40bf2f","year":2022},"citing_paper":{"arxiv_id":"2502.02843","last_updated":"2026-07-09T18:33:42Z","snapshot_observed_at":"2026-08-10T03:51:54.414050Z","submitted_at":"2025-02-05T02:58:21Z","title":"On Trimming Tensor-structured Measurements and Efficient Low-rank Tensor Recovery","version":2},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-09T11:03:54.185881Z"},"links":{"citing_paper":"/paper/2502.02843"},"observation_digest":"sha256:10de659aabe8034aaeac38f0a62e257535033d6292e4f914b209a88208d5e8c0","observation_id":"560930ae-142d-406f-be4b-5d5905f47145","resolution":{"observed_at":"2026-08-09T11:03:54.345920Z","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-09T11:03:54.330526Z","title":"Optimal statistical estimation: sub-Gaussian properties, heavy- tailed data, and robust-ness","venue":null,"work_id":"a60d92fb-b12f-4f64-98c5-a7a84db8b64c","year":2022},"citing_paper":{"arxiv_id":"2502.02843","last_updated":"2026-07-09T18:33:42Z","snapshot_observed_at":"2026-08-10T03:51:54.414050Z","submitted_at":"2025-02-05T02:58:21Z","title":"On Trimming Tensor-structured Measurements and Efficient Low-rank Tensor Recovery","version":2},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-09T11:03:54.189077Z"},"links":{"citing_paper":"/paper/2502.02843"},"observation_digest":"sha256:15ab6b15d5bd3b12a8b213851c7b76d285962aadedce3faef1c3ea92fbd4ae6f","observation_id":"627981d0-3da5-4380-9af6-b5ed3341163b","resolution":{"observed_at":"2026-08-09T11:03:54.334263Z","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":"2304.04860","last_updated":"2023-12-26T18:23:02Z","snapshot_observed_at":"2026-07-06T15:14:09.971106Z","submitted_at":"2023-04-10T20:46:32Z","title":"Iterative Singular Tube Hard Thresholding Algorithms for Tensor Recovery","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2304.04860","snapshot_observed_at":"2026-08-09T11:03:54.192603Z","title":"Iterative singular tube hard thresholding algorithms for tensor recov- ery","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.02843","last_updated":"2026-07-09T18:33:42Z","snapshot_observed_at":"2026-08-10T03:51:54.414050Z","submitted_at":"2025-02-05T02:58:21Z","title":"On Trimming Tensor-structured Measurements and Efficient Low-rank Tensor Recovery","version":2},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-09T11:03:54.192603Z"},"links":{"cited_paper":"/paper/2304.04860","citing_paper":"/paper/2502.02843"},"observation_digest":"sha256:e830b4bb0288c982d37f4b2dc350803e68b385add41a8c871da7bba7dbde2676","observation_id":"44dd3b9b-40cb-4014-8fba-a915a29daa48","resolution":{"observed_at":"2026-08-09T11:03:54.192603Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2308.13709","last_updated":"2023-08-25T23:44:47Z","snapshot_observed_at":"2026-07-06T16:10:38.925065Z","submitted_at":"2023-08-25T23:44:47Z","title":"Fast and Low-Memory Compressive Sensing Algorithms for Low Tucker-Rank Tensor Approximation from Streamed Measurements","version":1},"cited_work":{"arxiv_id":"2308.13709","doi":null,"metadata_source":"pith","pith_arxiv_id":"2308.13709","snapshot_observed_at":"2026-08-09T11:03:54.251049Z","title":"Fast and Low-Memory Compressive Sensing Algorithms for Low Tucker-Rank Tensor Approximation from Streamed Measurements","venue":"cs.IT","work_id":"dd1e4dad-a91c-4622-900f-2f38e11f7ae6","year":2023},"citing_paper":{"arxiv_id":"2502.02843","last_updated":"2026-07-09T18:33:42Z","snapshot_observed_at":"2026-08-10T03:51:54.414050Z","submitted_at":"2025-02-05T02:58:21Z","title":"On Trimming Tensor-structured Measurements and Efficient Low-rank Tensor Recovery","version":2},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-09T11:03:54.196152Z"},"links":{"cited_paper":"/paper/2308.13709","citing_paper":"/paper/2502.02843"},"observation_digest":"sha256:e65011f70d4fee59aba842f46a387055cf9355f8f0d09847d1ceb1b3391731ab","observation_id":"01761e7a-e50a-4509-8c64-3f970c9c6034","resolution":{"observed_at":"2026-08-09T11:03:54.256642Z","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-09T11:03:54.320441Z","title":"Modewise operators, the tensor restricted isometry property, and low-rank tensor recovery","venue":null,"work_id":"1ee44c17-3d7b-4f6e-a6ce-d51a6ba96ca4","year":2023},"citing_paper":{"arxiv_id":"2502.02843","last_updated":"2026-07-09T18:33:42Z","snapshot_observed_at":"2026-08-10T03:51:54.414050Z","submitted_at":"2025-02-05T02:58:21Z","title":"On Trimming Tensor-structured Measurements and Efficient Low-rank Tensor Recovery","version":2},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-09T11:03:54.199667Z"},"links":{"citing_paper":"/paper/2502.02843"},"observation_digest":"sha256:a659bd7e9168a9a289c5e9072a5e653e49ce40f44f0d6254ac232bfca9b12cdd","observation_id":"2cb2cf87-2648-4c3e-9a7b-ad4714d3128f","resolution":{"observed_at":"2026-08-09T11:03:54.323662Z","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":"2304.10123","last_updated":"2023-04-20T07:14:24Z","snapshot_observed_at":"2026-08-08T12:48:05.133997Z","submitted_at":"2023-04-20T07:14:24Z","title":"Linear Convergence of Reshuffling Kaczmarz Methods With Sparse Constraints","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2304.10123","snapshot_observed_at":"2026-08-09T11:03:54.203142Z","title":"Linear Convergence of Reshuffling Kaczmarz Methods With Sparse Constraints","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.02843","last_updated":"2026-07-09T18:33:42Z","snapshot_observed_at":"2026-08-10T03:51:54.414050Z","submitted_at":"2025-02-05T02:58:21Z","title":"On Trimming Tensor-structured Measurements and Efficient Low-rank Tensor Recovery","version":2},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-09T11:03:54.203142Z"},"links":{"cited_paper":"/paper/2304.10123","citing_paper":"/paper/2502.02843"},"observation_digest":"sha256:7fc69fb4d4bf6c055153a09375bcd29fb1f8386a32252f170fade2202d6a802e","observation_id":"4779ec35-4217-4f24-8233-31dbe9e493ac","resolution":{"observed_at":"2026-08-09T11:03:54.203142Z","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-09T11:03:54.310654Z","title":"Low-rank tensor estimation via Riemannian Gauss-Newton: Statistical optimality and second-order convergence","venue":null,"work_id":"3ea61b50-962d-4e41-99cf-ebff1410a9a5","year":2023},"citing_paper":{"arxiv_id":"2502.02843","last_updated":"2026-07-09T18:33:42Z","snapshot_observed_at":"2026-08-10T03:51:54.414050Z","submitted_at":"2025-02-05T02:58:21Z","title":"On Trimming Tensor-structured Measurements and Efficient Low-rank Tensor Recovery","version":2},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-09T11:03:54.206319Z"},"links":{"citing_paper":"/paper/2502.02843"},"observation_digest":"sha256:818a1aee7e7b5ef673f8bea28f803abad0b4afb9a2c27e429f2172cc32024b68","observation_id":"ccb375ec-0a3f-44a3-91ea-e2a8d579074d","resolution":{"observed_at":"2026-08-09T11:03:54.314137Z","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-09T11:03:54.301290Z","title":"Covering Number of Real Algebraic Varieties and Beyond: Improved Bounds and Applications","venue":null,"work_id":"4525a901-0c19-43cc-ade9-9dae7bfe6a06","year":2023},"citing_paper":{"arxiv_id":"2502.02843","last_updated":"2026-07-09T18:33:42Z","snapshot_observed_at":"2026-08-10T03:51:54.414050Z","submitted_at":"2025-02-05T02:58:21Z","title":"On Trimming Tensor-structured Measurements and Efficient Low-rank Tensor Recovery","version":2},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-09T11:03:54.209172Z"},"links":{"citing_paper":"/paper/2502.02843"},"observation_digest":"sha256:9f86f7876f43ec324795e63fc9d104bc7137e1522b930c54d66397484ffc51f4","observation_id":"56f66039-eb88-43de-9270-ae370f4a92a1","resolution":{"observed_at":"2026-08-09T11:03:54.304352Z","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-09T11:03:54.291948Z","title":"Tensor Decompositions for Data Science","venue":null,"work_id":"c83d3bba-9072-4cf4-a37a-38b114117d1c","year":2025},"citing_paper":{"arxiv_id":"2502.02843","last_updated":"2026-07-09T18:33:42Z","snapshot_observed_at":"2026-08-10T03:51:54.414050Z","submitted_at":"2025-02-05T02:58:21Z","title":"On Trimming Tensor-structured Measurements and Efficient Low-rank Tensor Recovery","version":2},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-09T11:03:54.211914Z"},"links":{"citing_paper":"/paper/2502.02843"},"observation_digest":"sha256:6e95637cf8279bcd62525f6284c2633cd2fc883452a202a91094cd02d8b32eb4","observation_id":"37c84720-5940-4a3b-900c-d0ff718a522a","resolution":{"observed_at":"2026-08-09T11:03:54.295247Z","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":"2502.02843","last_updated":"2026-07-09T18:33:42Z","latest_version":2,"primary_category":"math.NA","snapshot_observed_at":"2026-08-10T03:51:54.414050Z","submitted_at":"2025-02-05T02:58:21Z","title":"On Trimming Tensor-structured Measurements and Efficient Low-rank Tensor Recovery"},"reference_resolution":{"displayed":63,"state_counts":{"malformed_identifier":1,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":5,"verified_exact":1,"verified_fuzzy":56},"total_outbound_references":63},"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 63 of 63 outbound references and 0 inbound Pith citation observations for arXiv:2502.02843."}