{"as_of":"2026-08-14T23:00:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:ade260a1724f304113939a8979d24adf27567a028b4f14bbd9be7b6fdb756f4f","coverage":[{"denominator":38,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":38,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T11:48:08.700850Z","state":"measured"},{"denominator":38,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":38,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-14T06:32:32.682623+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/1908.08479/citation-record","integrity":"/paper/1908.08479/integrity","json":"/paper/1908.08479/citation-record.json","paper":"/paper/1908.08479"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:48:09.124010Z","title":"A mathematical introduction to compressive sensing,","venue":null,"work_id":"717e9da3-8007-46a9-9ad2-fbdd8e709d28","year":2013},"citing_paper":{"arxiv_id":"1908.08479","last_updated":"2019-08-22T16:20:38Z","snapshot_observed_at":"2026-08-14T11:36:06.842576Z","submitted_at":"2019-08-22T16:20:38Z","title":"Iterative Hard Thresholding for Low CP-rank Tensor Models","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-14T11:48:08.570679Z"},"links":{"citing_paper":"/paper/1908.08479"},"observation_digest":"sha256:8412143dc7e8656515038341a77f412d367a18522d2141353816ebee7667693f","observation_id":"e22814e7-898f-48aa-8e9c-2a7953e0fbba","resolution":{"observed_at":"2026-08-14T11:48:09.127756Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-14T11:48:09.113496Z","title":null,"venue":null,"work_id":"17500f42-dba2-4d5c-9acf-971f720ae0ed","year":2012},"citing_paper":{"arxiv_id":"1908.08479","last_updated":"2019-08-22T16:20:38Z","snapshot_observed_at":"2026-08-14T11:36:06.842576Z","submitted_at":"2019-08-22T16:20:38Z","title":"Iterative Hard Thresholding for Low CP-rank Tensor Models","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-14T11:48:08.575414Z"},"links":{"citing_paper":"/paper/1908.08479"},"observation_digest":"sha256:bcb298f5a1f06f63fa241a63429ac61f380d3a63f262768370ca424106e52247","observation_id":"86df9b0a-18c1-4466-96ce-704fc77c46ba","resolution":{"observed_at":"2026-08-14T11:48:09.117198Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-14T11:48:09.103004Z","title":"Compressive multiplexing of correlated signals,","venue":null,"work_id":"c5521173-d26a-40e2-a7ab-eea2b9516d6f","year":2014},"citing_paper":{"arxiv_id":"1908.08479","last_updated":"2019-08-22T16:20:38Z","snapshot_observed_at":"2026-08-14T11:36:06.842576Z","submitted_at":"2019-08-22T16:20:38Z","title":"Iterative Hard Thresholding for Low CP-rank Tensor Models","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-14T11:48:08.579487Z"},"links":{"citing_paper":"/paper/1908.08479"},"observation_digest":"sha256:8a3e90e8f694fc2697d3a478d15cceb94a1c01c870e4357f1b85c5ff2946aa56","observation_id":"399b530a-2155-490b-81f3-26760e637ec7","resolution":{"observed_at":"2026-08-14T11:48:09.107076Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-14T11:48:09.091799Z","title":"Hyperspectral image restoration using low-rank matrix recovery,","venue":null,"work_id":"855a2016-fbee-450f-8665-f9fcfa0818a3","year":2013},"citing_paper":{"arxiv_id":"1908.08479","last_updated":"2019-08-22T16:20:38Z","snapshot_observed_at":"2026-08-14T11:36:06.842576Z","submitted_at":"2019-08-22T16:20:38Z","title":"Iterative Hard Thresholding for Low CP-rank Tensor Models","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-14T11:48:08.583560Z"},"links":{"citing_paper":"/paper/1908.08479"},"observation_digest":"sha256:83edd36a2cccc5db11d86d3fea2b95ab691d5f6b45bb43e190801966a96889e3","observation_id":"99221651-4bbc-43e2-b046-e7240405168c","resolution":{"observed_at":"2026-08-14T11:48:09.095452Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-14T11:48:09.081465Z","title":"Quantum state tomography via compressed sensing,","venue":null,"work_id":"a20b9d6d-de8b-417f-89f1-a34cb19acfae","year":2010},"citing_paper":{"arxiv_id":"1908.08479","last_updated":"2019-08-22T16:20:38Z","snapshot_observed_at":"2026-08-14T11:36:06.842576Z","submitted_at":"2019-08-22T16:20:38Z","title":"Iterative Hard Thresholding for Low CP-rank Tensor Models","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-14T11:48:08.588144Z"},"links":{"citing_paper":"/paper/1908.08479"},"observation_digest":"sha256:803d09b4653d08eb8bd9282229956adbda2d53e6c3f17ec547bb93e91a797dab","observation_id":"98574f68-e9f8-430a-9da7-ef0e702fbc35","resolution":{"observed_at":"2026-08-14T11:48:09.085091Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-14T11:48:09.071411Z","title":"Robust principal component analysis?,","venue":null,"work_id":"2d5c0d68-d3b3-48a9-be80-b686ca8da66d","year":2011},"citing_paper":{"arxiv_id":"1908.08479","last_updated":"2019-08-22T16:20:38Z","snapshot_observed_at":"2026-08-14T11:36:06.842576Z","submitted_at":"2019-08-22T16:20:38Z","title":"Iterative Hard Thresholding for Low CP-rank Tensor Models","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-14T11:48:08.592166Z"},"links":{"citing_paper":"/paper/1908.08479"},"observation_digest":"sha256:f13f6a85e061ee23fa3461bcd7664ee66f1552f6069e686726b6d5a0a553a855","observation_id":"5f02787d-251a-427b-a341-45010573be33","resolution":{"observed_at":"2026-08-14T11:48:09.074916Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-14T11:48:09.061659Z","title":"Lambertian reflectance and linear subspaces,","venue":null,"work_id":"065bad49-8924-43e8-b690-009b320daa30","year":2003},"citing_paper":{"arxiv_id":"1908.08479","last_updated":"2019-08-22T16:20:38Z","snapshot_observed_at":"2026-08-14T11:36:06.842576Z","submitted_at":"2019-08-22T16:20:38Z","title":"Iterative Hard Thresholding for Low CP-rank Tensor Models","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-14T11:48:08.596068Z"},"links":{"citing_paper":"/paper/1908.08479"},"observation_digest":"sha256:25a7af379e04126bcad2357ffb392e0f2e186cd19f6e02901dd3ba6df8748449","observation_id":"777a1118-cbcd-4732-bfce-fe908371ade6","resolution":{"observed_at":"2026-08-14T11:48:09.065299Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-14T11:48:09.051324Z","title":"Exact matrix completion via convex optimization,","venue":null,"work_id":"9158041a-aed6-4391-b772-75ba6cb34698","year":2009},"citing_paper":{"arxiv_id":"1908.08479","last_updated":"2019-08-22T16:20:38Z","snapshot_observed_at":"2026-08-14T11:36:06.842576Z","submitted_at":"2019-08-22T16:20:38Z","title":"Iterative Hard Thresholding for Low CP-rank Tensor Models","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-14T11:48:08.599468Z"},"links":{"citing_paper":"/paper/1908.08479"},"observation_digest":"sha256:b2516f8029ee9758be945a35ca0ad06502a1536501597e0a30436dc326386a96","observation_id":"19ebcd10-95ca-4a85-8c4f-928dbe21d02f","resolution":{"observed_at":"2026-08-14T11:48:09.054938Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-14T11:48:09.041442Z","title":"Uniqueness conditions for low-rank matrix recovery,","venue":null,"work_id":"63349656-23ca-4e57-a570-1810e5160259","year":2012},"citing_paper":{"arxiv_id":"1908.08479","last_updated":"2019-08-22T16:20:38Z","snapshot_observed_at":"2026-08-14T11:36:06.842576Z","submitted_at":"2019-08-22T16:20:38Z","title":"Iterative Hard Thresholding for Low CP-rank Tensor Models","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-14T11:48:08.602859Z"},"links":{"citing_paper":"/paper/1908.08479"},"observation_digest":"sha256:edbf6aba1b32ba6f1fdc7c2384c2f5bfdb8acc197d232f02493e7b9fe6ed8b67","observation_id":"a324c860-d1aa-4b40-aa5e-2176bf7f5026","resolution":{"observed_at":"2026-08-14T11:48:09.044924Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-14T11:48:09.031382Z","title":"Guaranteed minimum-rank solutions of linear matrix equa- tions via nuclear norm minimization,","venue":null,"work_id":"3b785f89-a419-44a7-a0e8-0d08f903b49b","year":2010},"citing_paper":{"arxiv_id":"1908.08479","last_updated":"2019-08-22T16:20:38Z","snapshot_observed_at":"2026-08-14T11:36:06.842576Z","submitted_at":"2019-08-22T16:20:38Z","title":"Iterative Hard Thresholding for Low CP-rank Tensor Models","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-14T11:48:08.606351Z"},"links":{"citing_paper":"/paper/1908.08479"},"observation_digest":"sha256:b2aa6b6e50850ae98d729bc13b410ce3bf41e5ab91e9040aade734ea74b20ce8","observation_id":"87bd4524-ffcb-4c32-9bab-a22cdb129434","resolution":{"observed_at":"2026-08-14T11:48:09.035028Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-14T11:48:09.020608Z","title":"Tight oracle bounds for low-rank matrix recovery from a mininal number of noisy random measurements,","venue":null,"work_id":"abafee9d-362c-42aa-98d8-4464ab1b4f67","year":2011},"citing_paper":{"arxiv_id":"1908.08479","last_updated":"2019-08-22T16:20:38Z","snapshot_observed_at":"2026-08-14T11:36:06.842576Z","submitted_at":"2019-08-22T16:20:38Z","title":"Iterative Hard Thresholding for Low CP-rank Tensor Models","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-14T11:48:08.609852Z"},"links":{"citing_paper":"/paper/1908.08479"},"observation_digest":"sha256:0c98c3041fb50ebfdbd3a1dcdcad47512e496c65f099728da611b50d5b903788","observation_id":"e58428e7-cb5b-4e5b-ac32-198306660a9f","resolution":{"observed_at":"2026-08-14T11:48:09.024653Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-14T11:48:09.010123Z","title":"Iterative hard thresholding for compressed sensing,","venue":null,"work_id":"4b5c1ef5-20c8-481c-8d74-8b7ea85dff78","year":2009},"citing_paper":{"arxiv_id":"1908.08479","last_updated":"2019-08-22T16:20:38Z","snapshot_observed_at":"2026-08-14T11:36:06.842576Z","submitted_at":"2019-08-22T16:20:38Z","title":"Iterative Hard Thresholding for Low CP-rank Tensor Models","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-14T11:48:08.613449Z"},"links":{"citing_paper":"/paper/1908.08479"},"observation_digest":"sha256:f932f8d12d94344831a02b64fc00defee26722dc88db76f5ce14d491b8a88daa","observation_id":"3576a011-86f9-466d-af48-cf362ce473e0","resolution":{"observed_at":"2026-08-14T11:48:09.014146Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-14T11:48:08.998779Z","title":"Normalized iterative hard thresholding: Guaranteed stability and performance,","venue":null,"work_id":"8377803c-ffaf-47ab-bc81-632a3aea842d","year":2010},"citing_paper":{"arxiv_id":"1908.08479","last_updated":"2019-08-22T16:20:38Z","snapshot_observed_at":"2026-08-14T11:36:06.842576Z","submitted_at":"2019-08-22T16:20:38Z","title":"Iterative Hard Thresholding for Low CP-rank Tensor Models","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-14T11:48:08.616715Z"},"links":{"citing_paper":"/paper/1908.08479"},"observation_digest":"sha256:453ef9dccbb0d76593ac3c77a0fefce8c7a86cfe21b5f6297182cbd8c4382b84","observation_id":"3852d4f5-1f32-499c-b9ee-fcf861b0a761","resolution":{"observed_at":"2026-08-14T11:48:09.002734Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-14T11:48:08.988219Z","title":"Normalized iterative hard thresholding for matrix completion,","venue":null,"work_id":"43408ed8-a3cb-455d-8906-c487e4fec925","year":2013},"citing_paper":{"arxiv_id":"1908.08479","last_updated":"2019-08-22T16:20:38Z","snapshot_observed_at":"2026-08-14T11:36:06.842576Z","submitted_at":"2019-08-22T16:20:38Z","title":"Iterative Hard Thresholding for Low CP-rank Tensor Models","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-14T11:48:08.620421Z"},"links":{"citing_paper":"/paper/1908.08479"},"observation_digest":"sha256:d52aa3069674eda3a80fd3acc716fa9a557345141c91005eceacf8ba564961e9","observation_id":"940f0f57-b9cc-433b-8b75-81ba95dc80a0","resolution":{"observed_at":"2026-08-14T11:48:08.991853Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-14T11:48:08.977930Z","title":"Decoding by linear programming,","venue":null,"work_id":"f455edd2-8355-4e27-a45f-2447c357aa01","year":2005},"citing_paper":{"arxiv_id":"1908.08479","last_updated":"2019-08-22T16:20:38Z","snapshot_observed_at":"2026-08-14T11:36:06.842576Z","submitted_at":"2019-08-22T16:20:38Z","title":"Iterative Hard Thresholding for Low CP-rank Tensor Models","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-14T11:48:08.624024Z"},"links":{"citing_paper":"/paper/1908.08479"},"observation_digest":"sha256:ac358038c5afd0ba98bb6b63e43345e97d8bbb0f3eaebc304f171ae7f8d37c6e","observation_id":"70d49197-6124-4b8e-a82f-636179873ecc","resolution":{"observed_at":"2026-08-14T11:48:08.981596Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-14T11:48:08.967183Z","title":"Tensor completion for estimating missing values in visual data,","venue":null,"work_id":"6fd7dd98-ab20-4f7b-9171-5e857eaf95a3","year":2012},"citing_paper":{"arxiv_id":"1908.08479","last_updated":"2019-08-22T16:20:38Z","snapshot_observed_at":"2026-08-14T11:36:06.842576Z","submitted_at":"2019-08-22T16:20:38Z","title":"Iterative Hard Thresholding for Low CP-rank Tensor Models","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-14T11:48:08.627562Z"},"links":{"citing_paper":"/paper/1908.08479"},"observation_digest":"sha256:88ef137b2072b06f9b3bcdfd36373e9cf34ac548868ad152b6094563eecc36f4","observation_id":"9f8e5c9f-a718-470d-aa14-1d591cd28b88","resolution":{"observed_at":"2026-08-14T11:48:08.970745Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-14T11:48:08.956152Z","title":"Efficient tensor completion for color image and video recovery: Low-rank tensor train,","venue":null,"work_id":"ff34f77f-e73a-4efa-8ee9-5d68f47d20fa","year":2017},"citing_paper":{"arxiv_id":"1908.08479","last_updated":"2019-08-22T16:20:38Z","snapshot_observed_at":"2026-08-14T11:36:06.842576Z","submitted_at":"2019-08-22T16:20:38Z","title":"Iterative Hard Thresholding for Low CP-rank Tensor Models","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-14T11:48:08.631112Z"},"links":{"citing_paper":"/paper/1908.08479"},"observation_digest":"sha256:5e2ce65c38e670127a1c441b9c3ec614442cb2ac95143f4d0fdd16bc655dc25b","observation_id":"20c96348-696b-473c-9914-f51388a1236c","resolution":{"observed_at":"2026-08-14T11:48:08.960070Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-14T11:48:08.945378Z","title":"Multilinear multitask learn- ing,","venue":null,"work_id":"9b2cd1a7-ba2b-4111-b912-10f3f0f93166","year":2013},"citing_paper":{"arxiv_id":"1908.08479","last_updated":"2019-08-22T16:20:38Z","snapshot_observed_at":"2026-08-14T11:36:06.842576Z","submitted_at":"2019-08-22T16:20:38Z","title":"Iterative Hard Thresholding for Low CP-rank Tensor Models","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-14T11:48:08.634515Z"},"links":{"citing_paper":"/paper/1908.08479"},"observation_digest":"sha256:21157de0dbf366c733e0aef076546de17e562b9fd0bf7c521c6c070a5fed75dc","observation_id":"a2692917-0c83-4034-b7cf-e4b9d09ea913","resolution":{"observed_at":"2026-08-14T11:48:08.948964Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-14T11:48:08.933856Z","title":"Multilinear independent components analysis,","venue":null,"work_id":"bec91e50-7d91-459c-9566-e8363e0ba50c","year":2005},"citing_paper":{"arxiv_id":"1908.08479","last_updated":"2019-08-22T16:20:38Z","snapshot_observed_at":"2026-08-14T11:36:06.842576Z","submitted_at":"2019-08-22T16:20:38Z","title":"Iterative Hard Thresholding for Low CP-rank Tensor Models","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-14T11:48:08.637840Z"},"links":{"citing_paper":"/paper/1908.08479"},"observation_digest":"sha256:f59316651be1b530d7f06b52a20b953c2c06527eff6f9372a61a2ad54f73b59f","observation_id":"050c68d8-82e6-4e4f-b4d2-4bfdc67d4f2f","resolution":{"observed_at":"2026-08-14T11:48:08.938417Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-14T11:48:08.922731Z","title":"The multiconfiguration time-dependent hartree (mctdh) method: a highly efficient algorithm for propagating wavepackets,","venue":null,"work_id":"c92b4b63-40b5-4732-b38b-c92eb435b414","year":2000},"citing_paper":{"arxiv_id":"1908.08479","last_updated":"2019-08-22T16:20:38Z","snapshot_observed_at":"2026-08-14T11:36:06.842576Z","submitted_at":"2019-08-22T16:20:38Z","title":"Iterative Hard Thresholding for Low CP-rank Tensor Models","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-14T11:48:08.641338Z"},"links":{"citing_paper":"/paper/1908.08479"},"observation_digest":"sha256:7df2d6fd3f6cba08ec7e9de1415642b7c0431095fb8789ad001e925dd2856811","observation_id":"36d372ff-2607-4afd-8d02-889018ab525b","resolution":{"observed_at":"2026-08-14T11:48:08.926680Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-14T11:48:08.911739Z","title":"Lubich,From quantum to classical molecular dynamics: reduced models and numerical analysis","venue":null,"work_id":"fd5d6392-5ffc-498c-b981-6d1b4b25ac64","year":2008},"citing_paper":{"arxiv_id":"1908.08479","last_updated":"2019-08-22T16:20:38Z","snapshot_observed_at":"2026-08-14T11:36:06.842576Z","submitted_at":"2019-08-22T16:20:38Z","title":"Iterative Hard Thresholding for Low CP-rank Tensor Models","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-14T11:48:08.644503Z"},"links":{"citing_paper":"/paper/1908.08479"},"observation_digest":"sha256:d29efa404ba4e104851b09fbc8597c42f7c040d00442daead579f946e4529d65","observation_id":"316b3e3a-6487-4718-943d-7f377958ce40","resolution":{"observed_at":"2026-08-14T11:48:08.915554Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-14T11:48:08.900736Z","title":"Some mathematical notes on three-mode factor analysis,","venue":null,"work_id":"68bf1419-8f13-470b-a384-831354fa6231","year":1966},"citing_paper":{"arxiv_id":"1908.08479","last_updated":"2019-08-22T16:20:38Z","snapshot_observed_at":"2026-08-14T11:36:06.842576Z","submitted_at":"2019-08-22T16:20:38Z","title":"Iterative Hard Thresholding for Low CP-rank Tensor Models","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-14T11:48:08.648016Z"},"links":{"citing_paper":"/paper/1908.08479"},"observation_digest":"sha256:260875f57b1ec6312a79223c53a294763f81f4d61f1ff8fbb485f9c771ea8e18","observation_id":"125ca7b2-086c-436b-9d43-97e427404dee","resolution":{"observed_at":"2026-08-14T11:48:08.904543Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:48:08.651271Z","title":"A multilinear singular value decomposition,","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"1908.08479","last_updated":"2019-08-22T16:20:38Z","snapshot_observed_at":"2026-08-14T11:36:06.842576Z","submitted_at":"2019-08-22T16:20:38Z","title":"Iterative Hard Thresholding for Low CP-rank Tensor Models","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-14T11:48:08.651271Z"},"links":{"citing_paper":"/paper/1908.08479"},"observation_digest":"sha256:43091d448c6b4a7fe3799e6c3d81658dcf628fe0a51550fb63b940d4f6951eca","observation_id":"a7a27234-ad37-415d-b561-8d8f95534698","resolution":{"observed_at":"2026-08-14T11:48:08.651271Z","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-14T11:48:08.883041Z","title":"Analysis of individual differences in multidimensional scaling via an n-way generalization of âĂIJeckart-youngâĂİ decomposition,","venue":null,"work_id":"50c56e93-512e-44fd-acac-8e56f820ffd7","year":1970},"citing_paper":{"arxiv_id":"1908.08479","last_updated":"2019-08-22T16:20:38Z","snapshot_observed_at":"2026-08-14T11:36:06.842576Z","submitted_at":"2019-08-22T16:20:38Z","title":"Iterative Hard Thresholding for Low CP-rank Tensor Models","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-14T11:48:08.654507Z"},"links":{"citing_paper":"/paper/1908.08479"},"observation_digest":"sha256:4a1eb7e0f491506238eb23b9f442092327e15c70a0d7a74ea57229b3038ff8d6","observation_id":"cfedcfc6-d764-40e1-8a8e-456cdaf26346","resolution":{"observed_at":"2026-08-14T11:48:08.887504Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-14T11:48:08.871028Z","title":"Foundations of the parafac procedure: Models and conditions for an","venue":null,"work_id":"3150dc29-e145-445c-a5cc-f4c61b8e0707","year":1970},"citing_paper":{"arxiv_id":"1908.08479","last_updated":"2019-08-22T16:20:38Z","snapshot_observed_at":"2026-08-14T11:36:06.842576Z","submitted_at":"2019-08-22T16:20:38Z","title":"Iterative Hard Thresholding for Low CP-rank Tensor Models","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-14T11:48:08.657778Z"},"links":{"citing_paper":"/paper/1908.08479"},"observation_digest":"sha256:5d0cb64c0e26a24e799341a5121ef1f96c389e1084d83e45862e8b9eb1362b81","observation_id":"453b4e78-e75c-4256-abd0-9aad3e9d2a48","resolution":{"observed_at":"2026-08-14T11:48:08.875589Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-14T11:48:08.860662Z","title":"Factorization strategies for third-order tensors,","venue":null,"work_id":"27991efa-3fd9-4dfd-9feb-c32f4219c9c9","year":2011},"citing_paper":{"arxiv_id":"1908.08479","last_updated":"2019-08-22T16:20:38Z","snapshot_observed_at":"2026-08-14T11:36:06.842576Z","submitted_at":"2019-08-22T16:20:38Z","title":"Iterative Hard Thresholding for Low CP-rank Tensor Models","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-14T11:48:08.661055Z"},"links":{"citing_paper":"/paper/1908.08479"},"observation_digest":"sha256:03e853c4126599d72af0d8bebb72450e72f31ed904982357a55d8cc645251bf8","observation_id":"0aea8a99-0f6f-4fbe-890d-2d5ee6a302ed","resolution":{"observed_at":"2026-08-14T11:48:08.864326Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-14T11:48:08.849873Z","title":"Novel methods for multilinear data completion and de-noising based on tensor-svd,","venue":null,"work_id":"f6adfeb1-e156-4fec-86a6-9683dde38701","year":2014},"citing_paper":{"arxiv_id":"1908.08479","last_updated":"2019-08-22T16:20:38Z","snapshot_observed_at":"2026-08-14T11:36:06.842576Z","submitted_at":"2019-08-22T16:20:38Z","title":"Iterative Hard Thresholding for Low CP-rank Tensor Models","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-14T11:48:08.664352Z"},"links":{"citing_paper":"/paper/1908.08479"},"observation_digest":"sha256:d61f80a79906befced1a662e87850eb529cfc5d66a7fef3c100ba0cb6ac82fa6","observation_id":"f5b83969-c63f-4691-803d-f87f7eb9cfa6","resolution":{"observed_at":"2026-08-14T11:48:08.853948Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-14T11:48:08.839791Z","title":"Tensor decompositions and applications,","venue":null,"work_id":"d6ea1c95-c9bf-49fa-9452-547bba2b27f2","year":2009},"citing_paper":{"arxiv_id":"1908.08479","last_updated":"2019-08-22T16:20:38Z","snapshot_observed_at":"2026-08-14T11:36:06.842576Z","submitted_at":"2019-08-22T16:20:38Z","title":"Iterative Hard Thresholding for Low CP-rank Tensor Models","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-14T11:48:08.667612Z"},"links":{"citing_paper":"/paper/1908.08479"},"observation_digest":"sha256:fcbdaf86c4f0b159f4d34d7721b342be6a7e924d51c91cbcaf1535ef3662a99b","observation_id":"177627bc-3643-46cd-89de-d3eb910d715c","resolution":{"observed_at":"2026-08-14T11:48:08.843134Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-14T11:48:08.829397Z","title":"Tensor decompositions for learninglatentvariablemodels,","venue":null,"work_id":"a2e38399-43ab-4a82-b2a2-84e10079d4a2","year":2014},"citing_paper":{"arxiv_id":"1908.08479","last_updated":"2019-08-22T16:20:38Z","snapshot_observed_at":"2026-08-14T11:36:06.842576Z","submitted_at":"2019-08-22T16:20:38Z","title":"Iterative Hard Thresholding for Low CP-rank Tensor Models","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-14T11:48:08.670883Z"},"links":{"citing_paper":"/paper/1908.08479"},"observation_digest":"sha256:0006b7dd14def2e1d61c160896e11fc3f49138548dc866140c3a18d38826ceba","observation_id":"a0c1e4ad-3a14-4fb1-93b0-883da6f1ca19","resolution":{"observed_at":"2026-08-14T11:48:08.832995Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-14T11:48:08.818864Z","title":"Most tensor problems are np-hard,","venue":null,"work_id":"da1a0b88-f968-4ad0-b9ed-6b4a3367b5ab","year":2013},"citing_paper":{"arxiv_id":"1908.08479","last_updated":"2019-08-22T16:20:38Z","snapshot_observed_at":"2026-08-14T11:36:06.842576Z","submitted_at":"2019-08-22T16:20:38Z","title":"Iterative Hard Thresholding for Low CP-rank Tensor Models","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-14T11:48:08.674261Z"},"links":{"citing_paper":"/paper/1908.08479"},"observation_digest":"sha256:330707f4f60a3fd12863602bd4d98ad7697926a19877172109a5d03f0cb52b87","observation_id":"63d538d7-07d6-4ef6-b1c3-182f2adf93b1","resolution":{"observed_at":"2026-08-14T11:48:08.822574Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-14T11:48:08.808278Z","title":"Low rank tensor recovery via iterative hard threshold- ing,","venue":null,"work_id":"93eb39d8-c46e-46b1-9e75-7c2c0f00b834","year":2017},"citing_paper":{"arxiv_id":"1908.08479","last_updated":"2019-08-22T16:20:38Z","snapshot_observed_at":"2026-08-14T11:36:06.842576Z","submitted_at":"2019-08-22T16:20:38Z","title":"Iterative Hard Thresholding for Low CP-rank Tensor Models","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-14T11:48:08.677403Z"},"links":{"citing_paper":"/paper/1908.08479"},"observation_digest":"sha256:af866a5525c53931debd9bd56829008d16e785c31cc4e6ebbfc7b3969eb8797d","observation_id":"3cfff1c5-260e-45ca-8c61-0b95a2bd8f9e","resolution":{"observed_at":"2026-08-14T11:48:08.812185Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-14T11:48:08.796348Z","title":"Relative error tensor low rank approximation,","venue":null,"work_id":"397b3bd1-9843-43e7-aa81-faf32e613b53","year":2019},"citing_paper":{"arxiv_id":"1908.08479","last_updated":"2019-08-22T16:20:38Z","snapshot_observed_at":"2026-08-14T11:36:06.842576Z","submitted_at":"2019-08-22T16:20:38Z","title":"Iterative Hard Thresholding for Low CP-rank Tensor Models","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-14T11:48:08.680577Z"},"links":{"citing_paper":"/paper/1908.08479"},"observation_digest":"sha256:63f70755db625d0c23085b4eb154ae93d4ae0544c0c0cf6f58f8ada6b7dab87d","observation_id":"4c17eb26-066c-4ac0-ac5d-5380a22199b2","resolution":{"observed_at":"2026-08-14T11:48:08.800229Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-14T11:48:08.784282Z","title":"Uniqueness of tensor decompositions with applications to polynomial identifiability,","venue":null,"work_id":"a59aac49-5b2a-4bc2-88eb-58969866645b","year":2014},"citing_paper":{"arxiv_id":"1908.08479","last_updated":"2019-08-22T16:20:38Z","snapshot_observed_at":"2026-08-14T11:36:06.842576Z","submitted_at":"2019-08-22T16:20:38Z","title":"Iterative Hard Thresholding for Low CP-rank Tensor Models","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-14T11:48:08.683854Z"},"links":{"citing_paper":"/paper/1908.08479"},"observation_digest":"sha256:8d043533cd36e138eb428ddb67ee145f13d97d164c0aa1bccb30991a33a065e7","observation_id":"4fd029db-07b7-4c16-974f-e6b485c95bb9","resolution":{"observed_at":"2026-08-14T11:48:08.788612Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-14T11:48:08.773940Z","title":null,"venue":null,"work_id":"47d1ecd9-c859-48a4-982f-6c4298835d73","year":1964},"citing_paper":{"arxiv_id":"1908.08479","last_updated":"2019-08-22T16:20:38Z","snapshot_observed_at":"2026-08-14T11:36:06.842576Z","submitted_at":"2019-08-22T16:20:38Z","title":"Iterative Hard Thresholding for Low CP-rank Tensor Models","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-14T11:48:08.687070Z"},"links":{"citing_paper":"/paper/1908.08479"},"observation_digest":"sha256:9519eba9183cb6d98ac52e21d1c24b80b4803fb5a1c865f04fcb5579ea9f7c38","observation_id":"323985ed-83f4-42bb-b7ec-cbdd5070d4d6","resolution":{"observed_at":"2026-08-14T11:48:08.777456Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1011.3027","last_updated":"2011-11-23T21:11:38Z","snapshot_observed_at":"2026-08-10T11:47:51.923745Z","submitted_at":"2010-11-12T20:20:28Z","title":"Introduction to the non-asymptotic analysis of random matrices","version":7},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1011.3027","snapshot_observed_at":"2026-08-14T11:48:08.690093Z","title":"Introduction to the non-asymptotic analysis of random matrices,","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"1908.08479","last_updated":"2019-08-22T16:20:38Z","snapshot_observed_at":"2026-08-14T11:36:06.842576Z","submitted_at":"2019-08-22T16:20:38Z","title":"Iterative Hard Thresholding for Low CP-rank Tensor Models","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-14T11:48:08.690093Z"},"links":{"cited_paper":"/paper/1011.3027","citing_paper":"/paper/1908.08479"},"observation_digest":"sha256:795878dd2eb132196c6fcda29a4a084a2701807ef635559add9946c28d4c975f","observation_id":"94a61eea-3cb6-4c45-8691-62145528beee","resolution":{"observed_at":"2026-08-14T11:48:08.690093Z","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-14T11:48:08.762602Z","title":"Tensorlab 3.0 – numerical optimization strategies for large-scale constrained and coupled matrix/tensor factorization,","venue":null,"work_id":"4b2ca4d5-03fa-42b2-b4bb-f898ee6ed979","year":2016},"citing_paper":{"arxiv_id":"1908.08479","last_updated":"2019-08-22T16:20:38Z","snapshot_observed_at":"2026-08-14T11:36:06.842576Z","submitted_at":"2019-08-22T16:20:38Z","title":"Iterative Hard Thresholding for Low CP-rank Tensor Models","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-14T11:48:08.693799Z"},"links":{"citing_paper":"/paper/1908.08479"},"observation_digest":"sha256:062346e54798a6bd2313dcada764f15fa925a0f121088d0a52afd0a5ed853413","observation_id":"5ea610f8-061d-4443-8979-a5e1c3e0a214","resolution":{"observed_at":"2026-08-14T11:48:08.767192Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-14T11:48:08.751996Z","title":"Linear convergence of stochastic iterative greedy algorithms with sparse constraints,","venue":null,"work_id":"08db1f57-6351-4137-9b64-c55290461133","year":2017},"citing_paper":{"arxiv_id":"1908.08479","last_updated":"2019-08-22T16:20:38Z","snapshot_observed_at":"2026-08-14T11:36:06.842576Z","submitted_at":"2019-08-22T16:20:38Z","title":"Iterative Hard Thresholding for Low CP-rank Tensor Models","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-14T11:48:08.697219Z"},"links":{"citing_paper":"/paper/1908.08479"},"observation_digest":"sha256:0c6f53e77c83bc191a7c742fe61b68da6d78011f1200c9a3fdf55e844bd7ffde","observation_id":"c786d3d3-08f4-47ac-a405-499c7eb354ef","resolution":{"observed_at":"2026-08-14T11:48:08.755781Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-14T11:48:08.738918Z","title":"Greedy low-rank approximation in tucker format of solutions of tensor linear systems,","venue":null,"work_id":"17ddcda9-7901-4004-babe-9fb27d17a0c4","year":2019},"citing_paper":{"arxiv_id":"1908.08479","last_updated":"2019-08-22T16:20:38Z","snapshot_observed_at":"2026-08-14T11:36:06.842576Z","submitted_at":"2019-08-22T16:20:38Z","title":"Iterative Hard Thresholding for Low CP-rank Tensor Models","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-14T11:48:08.700850Z"},"links":{"citing_paper":"/paper/1908.08479"},"observation_digest":"sha256:53fd2183987c171fc97cbb781ed8141fed25a086baa0bc9da9eb26df209cc5a9","observation_id":"c25df8d0-27b3-47d0-a546-a1444188cb9e","resolution":{"observed_at":"2026-08-14T11:48:08.744667Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"1908.08479","last_updated":"2019-08-22T16:20:38Z","latest_version":1,"primary_category":"math.NA","snapshot_observed_at":"2026-08-14T11:36:06.842576Z","submitted_at":"2019-08-22T16:20:38Z","title":"Iterative Hard Thresholding for Low CP-rank Tensor Models"},"reference_resolution":{"displayed":38,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":4,"verified_exact":0,"verified_fuzzy":34},"total_outbound_references":38},"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-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"thesis":"As of 14 August 2026, this Paper Citation Record lists 38 of 38 outbound references and 0 inbound Pith citation observations for arXiv:1908.08479."}