{"as_of":"2026-08-14T13:11:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:19de1e4f07db5bb3f1c19ae9cf1ad64a6aa309f5cc8cff47fb26da9e9555aef4","coverage":[{"denominator":46,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":46,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T21:16:19.084654Z","state":"measured"},{"denominator":46,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":46,"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/2502.09534/citation-record","integrity":"/paper/2502.09534/integrity","json":"/paper/2502.09534/citation-record.json","paper":"/paper/2502.09534"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T21:16:18.872884Z","title":"write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.09534","last_updated":"2025-08-12T13:48:49Z","snapshot_observed_at":"2026-08-13T16:46:54.176850Z","submitted_at":"2025-02-13T17:50:27Z","title":"Fast Tensor Completion via Approximate Richardson Iteration","version":2},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-07T21:16:18.872884Z"},"links":{"citing_paper":"/paper/2502.09534"},"observation_digest":"sha256:4fa268973e8dea77a32107a70307ce8e4179b57f7e497a21b8a9b97287454255","observation_id":"88796277-d9ee-4a54-b345-1570ea78ba43","resolution":{"observed_at":"2026-08-07T21:16:18.872884Z","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-07T21:16:19.771821Z","title":"M., Kolda, T","venue":null,"work_id":"be992959-d531-4033-a997-e4f79019fd31","year":2011},"citing_paper":{"arxiv_id":"2502.09534","last_updated":"2025-08-12T13:48:49Z","snapshot_observed_at":"2026-08-13T16:46:54.176850Z","submitted_at":"2025-02-13T17:50:27Z","title":"Fast Tensor Completion via Approximate Richardson Iteration","version":2},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-07T21:16:18.879141Z"},"links":{"citing_paper":"/paper/2502.09534"},"observation_digest":"sha256:c0e7a4d62ab0100c79b6538a5eba4fdc1f1e7312f52cc39db2ab4ebd98718b10","observation_id":"3add6d78-7d25-48ca-9a3f-f29f6adcf9e3","resolution":{"observed_at":"2026-08-07T21:16:19.776499Z","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-07T21:16:19.758734Z","title":null,"venue":null,"work_id":"a3e058b9-e7c5-4aa2-9220-89865122fa84","year":2023},"citing_paper":{"arxiv_id":"2502.09534","last_updated":"2025-08-12T13:48:49Z","snapshot_observed_at":"2026-08-13T16:46:54.176850Z","submitted_at":"2025-02-13T17:50:27Z","title":"Fast Tensor Completion via Approximate Richardson Iteration","version":2},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-07T21:16:18.884361Z"},"links":{"citing_paper":"/paper/2502.09534"},"observation_digest":"sha256:636c8e5d08589faeb82fbc80205ae0a64aa84ef1c7a3fa90a14c05f4df7ab39c","observation_id":"2ad54d5e-6e26-471f-926d-a721aab14dfc","resolution":{"observed_at":"2026-08-07T21:16:19.762596Z","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-07T21:16:19.744679Z","title":"and Kala, R","venue":null,"work_id":"fb38c6cb-c27f-4759-aba5-c751594af863","year":1980},"citing_paper":{"arxiv_id":"2502.09534","last_updated":"2025-08-12T13:48:49Z","snapshot_observed_at":"2026-08-13T16:46:54.176850Z","submitted_at":"2025-02-13T17:50:27Z","title":"Fast Tensor Completion via Approximate Richardson Iteration","version":2},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-07T21:16:18.888507Z"},"links":{"citing_paper":"/paper/2502.09534"},"observation_digest":"sha256:ede56e707aa98f0425a1407d61aab75a99f09e2b1fd36a9d3b7526e0feab3e72","observation_id":"f32e2407-a060-4174-afbd-001b043c1c37","resolution":{"observed_at":"2026-08-07T21:16:19.749145Z","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-07T21:16:19.729522Z","title":"and Moitra, A","venue":null,"work_id":"c2bca414-f41a-4c81-874b-005b8941b4a1","year":2016},"citing_paper":{"arxiv_id":"2502.09534","last_updated":"2025-08-12T13:48:49Z","snapshot_observed_at":"2026-08-13T16:46:54.176850Z","submitted_at":"2025-02-13T17:50:27Z","title":"Fast Tensor Completion via Approximate Richardson Iteration","version":2},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-07T21:16:18.893496Z"},"links":{"citing_paper":"/paper/2502.09534"},"observation_digest":"sha256:fc71c4fc92f1d94bd7e4b8d6aa87e71235e055bd930445259cb466a99185d426","observation_id":"e18a5161-f94e-465e-a195-f2063d0bca2d","resolution":{"observed_at":"2026-08-07T21:16:19.734739Z","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-07T21:16:19.715079Z","title":"A., Murray, R., Grigori, L., Buluc, A., and Demmel, J","venue":null,"work_id":"1a2e1191-46d1-49e4-aa71-65ccbcd6d345","year":2023},"citing_paper":{"arxiv_id":"2502.09534","last_updated":"2025-08-12T13:48:49Z","snapshot_observed_at":"2026-08-13T16:46:54.176850Z","submitted_at":"2025-02-13T17:50:27Z","title":"Fast Tensor Completion via Approximate Richardson Iteration","version":2},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-07T21:16:18.898218Z"},"links":{"citing_paper":"/paper/2502.09534"},"observation_digest":"sha256:6fc17c09486eec434c240ae3b3c6b08d3b5ffc69a3be22f5ae0cbef6277b37e9","observation_id":"45d56278-d9dc-4d43-bd1f-d06150eb2e95","resolution":{"observed_at":"2026-08-07T21:16:19.719688Z","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-07T21:16:19.701045Z","title":"T., Malik, O","venue":null,"work_id":"0ddad300-c39a-423d-9028-554b73562450","year":2024},"citing_paper":{"arxiv_id":"2502.09534","last_updated":"2025-08-12T13:48:49Z","snapshot_observed_at":"2026-08-13T16:46:54.176850Z","submitted_at":"2025-02-13T17:50:27Z","title":"Fast Tensor Completion via Approximate Richardson Iteration","version":2},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-07T21:16:18.903056Z"},"links":{"citing_paper":"/paper/2502.09534"},"observation_digest":"sha256:3d088fa0726bf087290da25a2802758de48fb96b867e8e382dacc8e4681e4249","observation_id":"db659eac-bc5f-4322-9774-5f6d964ea73c","resolution":{"observed_at":"2026-08-07T21:16:19.705026Z","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-07T21:16:19.688150Z","title":"and Recht, B","venue":null,"work_id":"e46553bf-83a6-4c7e-b58f-ffda44330b0c","year":2012},"citing_paper":{"arxiv_id":"2502.09534","last_updated":"2025-08-12T13:48:49Z","snapshot_observed_at":"2026-08-13T16:46:54.176850Z","submitted_at":"2025-02-13T17:50:27Z","title":"Fast Tensor Completion via Approximate Richardson Iteration","version":2},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-07T21:16:18.908734Z"},"links":{"citing_paper":"/paper/2502.09534"},"observation_digest":"sha256:0c0e533d68265d9280c64fc88265f4e3699e0079d41473fd040676300280cdbf","observation_id":"c0e6d489-12cb-43c4-a06d-f3f89f578e3c","resolution":{"observed_at":"2026-08-07T21:16:19.692127Z","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-07T21:16:19.672302Z","title":"Incoherence-optimal matrix completion","venue":null,"work_id":"e17370e2-094d-4761-af17-75902970ff25","year":2015},"citing_paper":{"arxiv_id":"2502.09534","last_updated":"2025-08-12T13:48:49Z","snapshot_observed_at":"2026-08-13T16:46:54.176850Z","submitted_at":"2025-02-13T17:50:27Z","title":"Fast Tensor Completion via Approximate Richardson Iteration","version":2},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-07T21:16:18.913214Z"},"links":{"citing_paper":"/paper/2502.09534"},"observation_digest":"sha256:39c1b342e709fc2625f18f4601392e161fc14bf61ae094955898d051df07da02","observation_id":"d0815eff-0ade-4bba-b7e3-5e3fd48e50bd","resolution":{"observed_at":"2026-08-07T21:16:19.677801Z","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-07T21:16:19.658146Z","title":"SPALS : F ast alternating least squares via implicit leverage scores sampling","venue":null,"work_id":"7d78bc3c-efbc-4387-9a33-999fb2e00871","year":2016},"citing_paper":{"arxiv_id":"2502.09534","last_updated":"2025-08-12T13:48:49Z","snapshot_observed_at":"2026-08-13T16:46:54.176850Z","submitted_at":"2025-02-13T17:50:27Z","title":"Fast Tensor Completion via Approximate Richardson Iteration","version":2},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-07T21:16:18.917775Z"},"links":{"citing_paper":"/paper/2502.09534"},"observation_digest":"sha256:9e824c801a47ac649a02de60953e184996e9a8e9f9e8602ce8eec272c87a72e2","observation_id":"baab00be-e248-4afc-bbbd-c8ae533439b5","resolution":{"observed_at":"2026-08-07T21:16:19.662827Z","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-07T21:16:19.643060Z","title":"B., Lee, Y","venue":null,"work_id":"f1de1558-b2fe-4a99-aa60-4c1b178fde60","year":2015},"citing_paper":{"arxiv_id":"2502.09534","last_updated":"2025-08-12T13:48:49Z","snapshot_observed_at":"2026-08-13T16:46:54.176850Z","submitted_at":"2025-02-13T17:50:27Z","title":"Fast Tensor Completion via Approximate Richardson Iteration","version":2},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-07T21:16:18.922453Z"},"links":{"citing_paper":"/paper/2502.09534"},"observation_digest":"sha256:b06287715d23a16349a9c84d46595f9f04ff8536bee5fd6ec750a6fc71b92ff6","observation_id":"ca00b830-05cf-4cc8-9bf2-ca75d4cadecd","resolution":{"observed_at":"2026-08-07T21:16:19.648290Z","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-07T21:16:19.626462Z","title":"Optimal sketching for K ronecker product regression and low rank approximation","venue":null,"work_id":"422e860e-345f-4cf2-9074-6a92e1389718","year":2019},"citing_paper":{"arxiv_id":"2502.09534","last_updated":"2025-08-12T13:48:49Z","snapshot_observed_at":"2026-08-13T16:46:54.176850Z","submitted_at":"2025-02-13T17:50:27Z","title":"Fast Tensor Completion via Approximate Richardson Iteration","version":2},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-07T21:16:18.927217Z"},"links":{"citing_paper":"/paper/2502.09534"},"observation_digest":"sha256:f662ac37f9017889725d9709f449c73961ab7b73efa69601e97e2775fc7d80e5","observation_id":"e15ae3a1-43ff-4a77-81a7-89c1630f1b85","resolution":{"observed_at":"2026-08-07T21:16:19.632398Z","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-07T21:16:19.612417Z","title":"Subquadratic K ronecker regression with applications to tensor decomposition","venue":null,"work_id":"bef7efa2-e2ba-4f38-81d5-2bf978062512","year":2022},"citing_paper":{"arxiv_id":"2502.09534","last_updated":"2025-08-12T13:48:49Z","snapshot_observed_at":"2026-08-13T16:46:54.176850Z","submitted_at":"2025-02-13T17:50:27Z","title":"Fast Tensor Completion via Approximate Richardson Iteration","version":2},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-07T21:16:18.931786Z"},"links":{"citing_paper":"/paper/2502.09534"},"observation_digest":"sha256:7c5d31b135e6cbc96a12162868742361ce89dfb1a5052a70f42e612450794975","observation_id":"a4ab7a5f-16c1-4391-956a-43f7eb82b58d","resolution":{"observed_at":"2026-08-07T21:16:19.617192Z","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-07T21:16:19.596619Z","title":"Matrix Rank Minimization with Applications","venue":null,"work_id":"24653396-7a89-4ba2-89d8-7926c4464ce1","year":2002},"citing_paper":{"arxiv_id":"2502.09534","last_updated":"2025-08-12T13:48:49Z","snapshot_observed_at":"2026-08-13T16:46:54.176850Z","submitted_at":"2025-02-13T17:50:27Z","title":"Fast Tensor Completion via Approximate Richardson Iteration","version":2},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-07T21:16:18.936382Z"},"links":{"citing_paper":"/paper/2502.09534"},"observation_digest":"sha256:c38c67bdf8f82843604f21a24d1d39c064d257a5fddd0152303bceb8a09ca646","observation_id":"296e3314-3590-4fc4-9202-4c2bd9016612","resolution":{"observed_at":"2026-08-07T21:16:19.602425Z","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-07T21:16:19.581923Z","title":"and Juki \\'c , A","venue":null,"work_id":"fdc628ac-e654-4db2-885e-f5b775caa58c","year":2015},"citing_paper":{"arxiv_id":"2502.09534","last_updated":"2025-08-12T13:48:49Z","snapshot_observed_at":"2026-08-13T16:46:54.176850Z","submitted_at":"2025-02-13T17:50:27Z","title":"Fast Tensor Completion via Approximate Richardson Iteration","version":2},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-07T21:16:18.941056Z"},"links":{"citing_paper":"/paper/2502.09534"},"observation_digest":"sha256:aade5e60d4f601091f1e5d21dec487fa4528e279f2f4c528c5657264fa1e38b3","observation_id":"ef5831db-47a6-493c-a334-050f940a3460","resolution":{"observed_at":"2026-08-07T21:16:19.586693Z","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-07T21:16:19.566039Z","title":"Approximately optimal core shapes for tensor decompositions","venue":null,"work_id":"19a56277-b566-46ea-a9b7-74fdb6dee75d","year":2023},"citing_paper":{"arxiv_id":"2502.09534","last_updated":"2025-08-12T13:48:49Z","snapshot_observed_at":"2026-08-13T16:46:54.176850Z","submitted_at":"2025-02-13T17:50:27Z","title":"Fast Tensor Completion via Approximate Richardson Iteration","version":2},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-07T21:16:18.945399Z"},"links":{"citing_paper":"/paper/2502.09534"},"observation_digest":"sha256:39f49ff47bff8f1a8110288c735e9f59e59b69f0eecab0f025228e0a05cd6b65","observation_id":"4b1b9806-30c8-4070-b7af-19046a5fd00a","resolution":{"observed_at":"2026-08-07T21:16:19.571374Z","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-07T21:16:19.552408Z","title":null,"venue":null,"work_id":"c887d0e1-71da-4031-ad3b-71006eb1d1ba","year":2023},"citing_paper":{"arxiv_id":"2502.09534","last_updated":"2025-08-12T13:48:49Z","snapshot_observed_at":"2026-08-13T16:46:54.176850Z","submitted_at":"2025-02-13T17:50:27Z","title":"Fast Tensor Completion via Approximate Richardson Iteration","version":2},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-07T21:16:18.949745Z"},"links":{"citing_paper":"/paper/2502.09534"},"observation_digest":"sha256:e322e949d0ac6c513cbba60ac3808b3fe6ea9b42d0cbc7154c358de289a97f4a","observation_id":"8702e697-a040-4c25-987a-42ea104c8cbd","resolution":{"observed_at":"2026-08-07T21:16:19.556524Z","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-07T21:16:19.538197Z","title":"T., Padmanabhan, S., Swartworth, W., Woodruff, D","venue":null,"work_id":"54571126-26f4-4612-a15a-7c48de7556be","year":2024},"citing_paper":{"arxiv_id":"2502.09534","last_updated":"2025-08-12T13:48:49Z","snapshot_observed_at":"2026-08-13T16:46:54.176850Z","submitted_at":"2025-02-13T17:50:27Z","title":"Fast Tensor Completion via Approximate Richardson Iteration","version":2},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-07T21:16:18.954234Z"},"links":{"citing_paper":"/paper/2502.09534"},"observation_digest":"sha256:a195a0d5b504eaa7018488c05222a1286df8f03dba7227799a392cdc30cea127","observation_id":"f401d857-f709-4b51-8779-e479146f2ef5","resolution":{"observed_at":"2026-08-07T21:16:19.542942Z","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-07T21:16:19.522639Z","title":null,"venue":null,"work_id":"9ee26e8c-602a-4975-b7ee-349776b56ac6","year":1988},"citing_paper":{"arxiv_id":"2502.09534","last_updated":"2025-08-12T13:48:49Z","snapshot_observed_at":"2026-08-13T16:46:54.176850Z","submitted_at":"2025-02-13T17:50:27Z","title":"Fast Tensor Completion via Approximate Richardson Iteration","version":2},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-07T21:16:18.958623Z"},"links":{"citing_paper":"/paper/2502.09534"},"observation_digest":"sha256:30696a6eaeece6e87be925b5f690c6741d467bf5e63680a294958a440befce11","observation_id":"a63dece9-84c5-4ebb-99cb-e76cdba78555","resolution":{"observed_at":"2026-08-07T21:16:19.527456Z","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-07T21:16:19.506435Z","title":null,"venue":null,"work_id":"4bc774f7-c96d-426d-85b8-8dd7ed8713e0","year":1997},"citing_paper":{"arxiv_id":"2502.09534","last_updated":"2025-08-12T13:48:49Z","snapshot_observed_at":"2026-08-13T16:46:54.176850Z","submitted_at":"2025-02-13T17:50:27Z","title":"Fast Tensor Completion via Approximate Richardson Iteration","version":2},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-07T21:16:18.963490Z"},"links":{"citing_paper":"/paper/2502.09534"},"observation_digest":"sha256:9b8e613fff652b5dd0ece65f42d321cded119a053e1501ddc581d4502c624323","observation_id":"a5e8b450-faff-4915-842f-8599879b3a02","resolution":{"observed_at":"2026-08-07T21:16:19.512513Z","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-07T21:16:19.489607Z","title":"R., Millman, K","venue":null,"work_id":"01bb3905-7606-44d9-acdb-7adba4ae0e53","year":2020},"citing_paper":{"arxiv_id":"2502.09534","last_updated":"2025-08-12T13:48:49Z","snapshot_observed_at":"2026-08-13T16:46:54.176850Z","submitted_at":"2025-02-13T17:50:27Z","title":"Fast Tensor Completion via Approximate Richardson Iteration","version":2},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-07T21:16:18.967900Z"},"links":{"citing_paper":"/paper/2502.09534"},"observation_digest":"sha256:8ff83af6026d5fefdeeb6367039e9a46df1e4d4536f630166051cb178078a2bf","observation_id":"17b3d60b-0539-4aba-add4-fa82ec652aff","resolution":{"observed_at":"2026-08-07T21:16:19.495127Z","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-07T21:16:19.475323Z","title":"and Westmacott, M","venue":null,"work_id":"8ba0bf39-e9ef-415c-90d9-0daef96ee068","year":1956},"citing_paper":{"arxiv_id":"2502.09534","last_updated":"2025-08-12T13:48:49Z","snapshot_observed_at":"2026-08-13T16:46:54.176850Z","submitted_at":"2025-02-13T17:50:27Z","title":"Fast Tensor Completion via Approximate Richardson Iteration","version":2},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-07T21:16:18.973550Z"},"links":{"citing_paper":"/paper/2502.09534"},"observation_digest":"sha256:20cc7100c3cc68a6c72b4f0e9bf966630db480ad656751d06bc3dbe83dd323d1","observation_id":"dbeea8ba-16d9-443a-bbae-9947787e787e","resolution":{"observed_at":"2026-08-07T21:16:19.479843Z","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-07T21:16:19.461358Z","title":null,"venue":null,"work_id":"b7da190f-8f09-40a3-b92e-73816daf2200","year":2013},"citing_paper":{"arxiv_id":"2502.09534","last_updated":"2025-08-12T13:48:49Z","snapshot_observed_at":"2026-08-13T16:46:54.176850Z","submitted_at":"2025-02-13T17:50:27Z","title":"Fast Tensor Completion via Approximate Richardson Iteration","version":2},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-07T21:16:18.978196Z"},"links":{"citing_paper":"/paper/2502.09534"},"observation_digest":"sha256:f29a5fe98a13b0c3c6adefa8afdca9a544b0b75694780c3b4c1ac920639db552","observation_id":"af3d2042-9b9a-41c0-8e82-3b84edc55bbf","resolution":{"observed_at":"2026-08-07T21:16:19.465977Z","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-07T21:16:19.447255Z","title":"and Oh, S","venue":null,"work_id":"38a47824-a8f7-41bb-9a93-228b496a7ee7","year":2014},"citing_paper":{"arxiv_id":"2502.09534","last_updated":"2025-08-12T13:48:49Z","snapshot_observed_at":"2026-08-13T16:46:54.176850Z","submitted_at":"2025-02-13T17:50:27Z","title":"Fast Tensor Completion via Approximate Richardson Iteration","version":2},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-07T21:16:18.982969Z"},"links":{"citing_paper":"/paper/2502.09534"},"observation_digest":"sha256:506bec6b0dbc99398e2c7e021ee920d26877db8d789b0f762906a16165666840","observation_id":"c2c5b432-9f22-4672-a2f3-4bfe23dffa3e","resolution":{"observed_at":"2026-08-07T21:16:19.451980Z","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-07T21:16:19.431791Z","title":null,"venue":null,"work_id":"4e43ada5-0e7b-4c30-b92f-f3ea36642946","year":2011},"citing_paper":{"arxiv_id":"2502.09534","last_updated":"2025-08-12T13:48:49Z","snapshot_observed_at":"2026-08-13T16:46:54.176850Z","submitted_at":"2025-02-13T17:50:27Z","title":"Fast Tensor Completion via Approximate Richardson Iteration","version":2},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-07T21:16:18.987422Z"},"links":{"citing_paper":"/paper/2502.09534"},"observation_digest":"sha256:c81ad15a55b1c14e88980eed157e77dd027071c01efb2fac04f931d35c0631ee","observation_id":"5fa87e71-fe8d-4896-acfe-abf58e191315","resolution":{"observed_at":"2026-08-07T21:16:19.437640Z","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-07T21:16:19.417889Z","title":null,"venue":null,"work_id":"6923e6f5-26a0-4556-8ee1-c23a5fb7ebb1","year":2009},"citing_paper":{"arxiv_id":"2502.09534","last_updated":"2025-08-12T13:48:49Z","snapshot_observed_at":"2026-08-13T16:46:54.176850Z","submitted_at":"2025-02-13T17:50:27Z","title":"Fast Tensor Completion via Approximate Richardson Iteration","version":2},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-07T21:16:18.991868Z"},"links":{"citing_paper":"/paper/2502.09534"},"observation_digest":"sha256:6fafc01105054edfe01741ad7591790f84243049a09ede2ec3f9c33dcd2ffe57","observation_id":"79790f31-340f-4b1f-b4ad-248486ae337b","resolution":{"observed_at":"2026-08-07T21:16:19.422253Z","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-07T21:16:19.403011Z","title":"TensorLy : T ensor learning in P ython","venue":null,"work_id":"12c68980-1bd8-44b6-920c-8bdf97c8bd66","year":2019},"citing_paper":{"arxiv_id":"2502.09534","last_updated":"2025-08-12T13:48:49Z","snapshot_observed_at":"2026-08-13T16:46:54.176850Z","submitted_at":"2025-02-13T17:50:27Z","title":"Fast Tensor Completion via Approximate Richardson Iteration","version":2},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-07T21:16:18.996716Z"},"links":{"citing_paper":"/paper/2502.09534"},"observation_digest":"sha256:66cf2385c998b11b379e7675b4c6aa5800cddc727469f76cc794bddb769df4f2","observation_id":"81db9fc9-49d7-430f-8254-ac18bbaf36f2","resolution":{"observed_at":"2026-08-07T21:16:19.407948Z","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-07T21:16:19.389380Z","title":null,"venue":null,"work_id":"d01f63dd-f88c-41f0-bfe8-1df6caafe3b5","year":2022},"citing_paper":{"arxiv_id":"2502.09534","last_updated":"2025-08-12T13:48:49Z","snapshot_observed_at":"2026-08-13T16:46:54.176850Z","submitted_at":"2025-02-13T17:50:27Z","title":"Fast Tensor Completion via Approximate Richardson Iteration","version":2},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-07T21:16:19.002461Z"},"links":{"citing_paper":"/paper/2502.09534"},"observation_digest":"sha256:1881caca7e2a818d9c53ccd7097647fb9123c70e9a057ff01c4e328531fa5f3b","observation_id":"1fdbbd52-ebcf-4203-be5d-78b7841ec26b","resolution":{"observed_at":"2026-08-07T21:16:19.393521Z","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-07T21:16:19.375438Z","title":null,"venue":null,"work_id":"790a04ae-d1b3-4bb2-8ff3-321c50f417df","year":2024},"citing_paper":{"arxiv_id":"2502.09534","last_updated":"2025-08-12T13:48:49Z","snapshot_observed_at":"2026-08-13T16:46:54.176850Z","submitted_at":"2025-02-13T17:50:27Z","title":"Fast Tensor Completion via Approximate Richardson Iteration","version":2},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-07T21:16:19.007489Z"},"links":{"citing_paper":"/paper/2502.09534"},"observation_digest":"sha256:aa14fb5b85b6dd50b6f71e5ed7039cfccbec9a776aed95eec073920ebddf2fd6","observation_id":"fdb6e1e3-c278-4c71-85ae-29e9104c5287","resolution":{"observed_at":"2026-08-07T21:16:19.379917Z","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-07T21:16:19.361552Z","title":null,"venue":null,"work_id":"4992cc41-d15a-4d3c-82b5-370b93662682","year":2019},"citing_paper":{"arxiv_id":"2502.09534","last_updated":"2025-08-12T13:48:49Z","snapshot_observed_at":"2026-08-13T16:46:54.176850Z","submitted_at":"2025-02-13T17:50:27Z","title":"Fast Tensor Completion via Approximate Richardson Iteration","version":2},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-07T21:16:19.012172Z"},"links":{"citing_paper":"/paper/2502.09534"},"observation_digest":"sha256:d3ee54e4de62adeb49dfc3f41f5ea037ec9914859210c038875e8c49bc15b2fa","observation_id":"4136f8b0-1f93-4a9e-ba3b-74b9515ee631","resolution":{"observed_at":"2026-08-07T21:16:19.365909Z","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-07T21:16:19.346385Z","title":"and Moitra, A","venue":null,"work_id":"fb76d81f-7361-4ee4-9d1a-4194adc43520","year":2020},"citing_paper":{"arxiv_id":"2502.09534","last_updated":"2025-08-12T13:48:49Z","snapshot_observed_at":"2026-08-13T16:46:54.176850Z","submitted_at":"2025-02-13T17:50:27Z","title":"Fast Tensor Completion via Approximate Richardson Iteration","version":2},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-07T21:16:19.016489Z"},"links":{"citing_paper":"/paper/2502.09534"},"observation_digest":"sha256:79958d3101516b9190df9a2ebcc22fbdbb5421c1c9d9e079919e763deea760e0","observation_id":"e62bca8f-fb9d-42a3-9e13-205e34fc0745","resolution":{"observed_at":"2026-08-07T21:16:19.351195Z","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-07T21:16:19.332293Z","title":null,"venue":null,"work_id":"aa7d6f7c-1cd8-46a3-8eda-f37e11f3063b","year":2021},"citing_paper":{"arxiv_id":"2502.09534","last_updated":"2025-08-12T13:48:49Z","snapshot_observed_at":"2026-08-13T16:46:54.176850Z","submitted_at":"2025-02-13T17:50:27Z","title":"Fast Tensor Completion via Approximate Richardson Iteration","version":2},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-07T21:16:19.020582Z"},"links":{"citing_paper":"/paper/2502.09534"},"observation_digest":"sha256:2d16a487f55153e6e988257c8d4b89655395e677b0f75c90816eb59ed959532c","observation_id":"d89861e5-f5c3-4757-9f76-286997decf35","resolution":{"observed_at":"2026-08-07T21:16:19.336953Z","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":"2210.03828","last_updated":"2022-10-07T21:46:26Z","snapshot_observed_at":"2026-08-13T14:10:13.827927Z","submitted_at":"2022-10-07T21:46:26Z","title":"Sampling-Based Decomposition Algorithms for Arbitrary Tensor Networks","version":1},"cited_work":{"arxiv_id":"2210.03828","doi":null,"metadata_source":"pith","pith_arxiv_id":"2210.03828","snapshot_observed_at":"2026-08-07T21:16:19.137754Z","title":"Sampling-Based Decomposition Algorithms for Arbitrary Tensor Networks","venue":"math.NA","work_id":"6153655a-88f5-49f0-8c72-9f412842f844","year":2022},"citing_paper":{"arxiv_id":"2502.09534","last_updated":"2025-08-12T13:48:49Z","snapshot_observed_at":"2026-08-13T16:46:54.176850Z","submitted_at":"2025-02-13T17:50:27Z","title":"Fast Tensor Completion via Approximate Richardson Iteration","version":2},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-07T21:16:19.025175Z"},"links":{"cited_paper":"/paper/2210.03828","citing_paper":"/paper/2502.09534"},"observation_digest":"sha256:7597103d359f22e6696c41e377d2eb1a17f81918050a8a6df1d23d2214e60b70","observation_id":"8e3ca50f-625e-4c8b-9100-96f874e67a9c","resolution":{"observed_at":"2026-08-07T21:16:19.144796Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"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-07T21:16:19.318691Z","title":"and Sun, N","venue":null,"work_id":"094ed40a-da22-4c18-886e-245198335309","year":2018},"citing_paper":{"arxiv_id":"2502.09534","last_updated":"2025-08-12T13:48:49Z","snapshot_observed_at":"2026-08-13T16:46:54.176850Z","submitted_at":"2025-02-13T17:50:27Z","title":"Fast Tensor Completion via Approximate Richardson Iteration","version":2},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-07T21:16:19.029638Z"},"links":{"citing_paper":"/paper/2502.09534"},"observation_digest":"sha256:10d96aa87458b2b6f2248da52d15977c0bee9ff890c71c42380ac448bfcf8d05","observation_id":"9c4fa716-5920-4a20-9065-66495709dee0","resolution":{"observed_at":"2026-08-07T21:16:19.323017Z","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-07T21:16:19.305002Z","title":"M., Amano, K., and Foster, D","venue":null,"work_id":"83fd4b53-f376-4a40-a444-094c0a2e0d7d","year":2016},"citing_paper":{"arxiv_id":"2502.09534","last_updated":"2025-08-12T13:48:49Z","snapshot_observed_at":"2026-08-13T16:46:54.176850Z","submitted_at":"2025-02-13T17:50:27Z","title":"Fast Tensor Completion via Approximate Richardson Iteration","version":2},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-07T21:16:19.034040Z"},"links":{"citing_paper":"/paper/2502.09534"},"observation_digest":"sha256:7e9cf170223695e1357b8801f9a7e54cc14bcf02d3452bc9100856995efa5620","observation_id":"470e5281-9ee7-424e-a2a0-066c50c2e018","resolution":{"observed_at":"2026-08-07T21:16:19.309511Z","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-07T21:16:19.291043Z","title":null,"venue":null,"work_id":"240fd31d-8cb3-48af-a334-04e30b24517c","year":2011},"citing_paper":{"arxiv_id":"2502.09534","last_updated":"2025-08-12T13:48:49Z","snapshot_observed_at":"2026-08-13T16:46:54.176850Z","submitted_at":"2025-02-13T17:50:27Z","title":"Fast Tensor Completion via Approximate Richardson Iteration","version":2},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-07T21:16:19.038774Z"},"links":{"citing_paper":"/paper/2502.09534"},"observation_digest":"sha256:0118946cf303d4a2474f80cd4c885e85ca14204a96ba570322bf2e5ef8051bf7","observation_id":"de3a8d97-dd41-4820-ae29-c0bbb5220c44","resolution":{"observed_at":"2026-08-07T21:16:19.295637Z","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-07T21:16:19.276931Z","title":null,"venue":null,"work_id":"6d6ac847-f859-4449-a8a1-c6f4904f69ea","year":1911},"citing_paper":{"arxiv_id":"2502.09534","last_updated":"2025-08-12T13:48:49Z","snapshot_observed_at":"2026-08-13T16:46:54.176850Z","submitted_at":"2025-02-13T17:50:27Z","title":"Fast Tensor Completion via Approximate Richardson Iteration","version":2},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-07T21:16:19.043343Z"},"links":{"citing_paper":"/paper/2502.09534"},"observation_digest":"sha256:28aaa63c591a109fca88c14e225242a313d0f4690af7fe1bff968f722beb0c0d","observation_id":"f977859a-21ad-4298-8a3a-2b00a6c10b63","resolution":{"observed_at":"2026-08-07T21:16:19.281455Z","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-07T21:16:19.262543Z","title":"and Yu, C","venue":null,"work_id":"0a585f70-4f7d-4fb1-bcf3-e4838b0dc1d2","year":2019},"citing_paper":{"arxiv_id":"2502.09534","last_updated":"2025-08-12T13:48:49Z","snapshot_observed_at":"2026-08-13T16:46:54.176850Z","submitted_at":"2025-02-13T17:50:27Z","title":"Fast Tensor Completion via Approximate Richardson Iteration","version":2},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-07T21:16:19.047896Z"},"links":{"citing_paper":"/paper/2502.09534"},"observation_digest":"sha256:7f83e1e9eeee79f3634d2a1e4c1e3feed0b389f945a15a0df7103c9eb606112c","observation_id":"52c231f4-5fc5-4794-9bde-138dc1a61aa6","resolution":{"observed_at":"2026-08-07T21:16:19.267074Z","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-07T21:16:19.249367Z","title":"and Yu, C","venue":null,"work_id":"12e9339c-9d90-4c47-aec7-f3f5f4eb2ec4","year":2023},"citing_paper":{"arxiv_id":"2502.09534","last_updated":"2025-08-12T13:48:49Z","snapshot_observed_at":"2026-08-13T16:46:54.176850Z","submitted_at":"2025-02-13T17:50:27Z","title":"Fast Tensor Completion via Approximate Richardson Iteration","version":2},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-07T21:16:19.052344Z"},"links":{"citing_paper":"/paper/2502.09534"},"observation_digest":"sha256:d6e45cf4ff557942eac55c613392e3b36de35a55c5a09dd41ecb30e38d89fe96","observation_id":"87798298-b8c3-4479-9a97-195ea66bd1d9","resolution":{"observed_at":"2026-08-07T21:16:19.253467Z","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-07T21:16:19.234129Z","title":"Tensor completion algorithms in big data analytics","venue":null,"work_id":"3589727a-1851-4776-83da-e1224270da3c","year":2019},"citing_paper":{"arxiv_id":"2502.09534","last_updated":"2025-08-12T13:48:49Z","snapshot_observed_at":"2026-08-13T16:46:54.176850Z","submitted_at":"2025-02-13T17:50:27Z","title":"Fast Tensor Completion via Approximate Richardson Iteration","version":2},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-07T21:16:19.057173Z"},"links":{"citing_paper":"/paper/2502.09534"},"observation_digest":"sha256:2528382ccec9b96dc13d5d41467598000466802999c6aae23b065ec740c9743e","observation_id":"81a9df91-126d-46d2-a8ec-3ab8eeb80570","resolution":{"observed_at":"2026-08-07T21:16:19.238956Z","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-07T21:16:19.218157Z","title":null,"venue":null,"work_id":"e9698906-6188-46ba-b4e1-397f92bc3340","year":2018},"citing_paper":{"arxiv_id":"2502.09534","last_updated":"2025-08-12T13:48:49Z","snapshot_observed_at":"2026-08-13T16:46:54.176850Z","submitted_at":"2025-02-13T17:50:27Z","title":"Fast Tensor Completion via Approximate Richardson Iteration","version":2},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-07T21:16:19.062080Z"},"links":{"citing_paper":"/paper/2502.09534"},"observation_digest":"sha256:179e8e3686559de6d864a813918e8d6c240cffa888f2fc18409c00c9f2828253","observation_id":"d34114f8-77b3-428b-ab92-ff7f99a09cb1","resolution":{"observed_at":"2026-08-07T21:16:19.223228Z","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-07T21:16:19.202369Z","title":"and Bro, R","venue":null,"work_id":"5053d70c-c3e7-4efe-8d1c-025fd2ff87be","year":2005},"citing_paper":{"arxiv_id":"2502.09534","last_updated":"2025-08-12T13:48:49Z","snapshot_observed_at":"2026-08-13T16:46:54.176850Z","submitted_at":"2025-02-13T17:50:27Z","title":"Fast Tensor Completion via Approximate Richardson Iteration","version":2},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-07T21:16:19.066524Z"},"links":{"citing_paper":"/paper/2502.09534"},"observation_digest":"sha256:7a4b7978d8415073f26ca690a0f686f5a8e253fb9f813853f40b617459ee7ff7","observation_id":"49294c60-44e0-4b0f-9abb-fdd513369242","resolution":{"observed_at":"2026-08-07T21:16:19.207161Z","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-07T21:16:19.187622Z","title":"Randomized tensor wheel decomposition","venue":null,"work_id":"b0ffc82f-c6ca-405f-90f3-a6c1d128e6d7","year":2024},"citing_paper":{"arxiv_id":"2502.09534","last_updated":"2025-08-12T13:48:49Z","snapshot_observed_at":"2026-08-13T16:46:54.176850Z","submitted_at":"2025-02-13T17:50:27Z","title":"Fast Tensor Completion via Approximate Richardson Iteration","version":2},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-07T21:16:19.071101Z"},"links":{"citing_paper":"/paper/2502.09534"},"observation_digest":"sha256:96f08732ed9f9641e4e1a026ba4c45f613cb3429426315eacd4f99284ac6f876","observation_id":"037bad91-a0cb-4699-8284-187ef5d39716","resolution":{"observed_at":"2026-08-07T21:16:19.192353Z","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-07T21:16:19.172741Z","title":"Tensor wheel decomposition and its tensor completion application","venue":null,"work_id":"0018d7a7-b649-49e3-b614-020fef3b12a6","year":2022},"citing_paper":{"arxiv_id":"2502.09534","last_updated":"2025-08-12T13:48:49Z","snapshot_observed_at":"2026-08-13T16:46:54.176850Z","submitted_at":"2025-02-13T17:50:27Z","title":"Fast Tensor Completion via Approximate Richardson Iteration","version":2},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-07T21:16:19.075785Z"},"links":{"citing_paper":"/paper/2502.09534"},"observation_digest":"sha256:01b714bd4cfbc2abd634b0129e480bc14ad119427a24d0e77954738d3cd1d798","observation_id":"eb035bf6-40ec-4c2f-bf68-27d158f84f04","resolution":{"observed_at":"2026-08-07T21:16:19.177000Z","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":{"arxiv_id":"1606.05535","last_updated":"2016-06-17T14:40:18Z","snapshot_observed_at":"2026-08-09T02:58:02.298584Z","submitted_at":"2016-06-17T14:40:18Z","title":"Tensor Ring Decomposition","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1606.05535","snapshot_observed_at":"2026-08-07T21:16:19.079955Z","title":"Tensor ring decomposition","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2502.09534","last_updated":"2025-08-12T13:48:49Z","snapshot_observed_at":"2026-08-13T16:46:54.176850Z","submitted_at":"2025-02-13T17:50:27Z","title":"Fast Tensor Completion via Approximate Richardson Iteration","version":2},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-07T21:16:19.079955Z"},"links":{"cited_paper":"/paper/1606.05535","citing_paper":"/paper/2502.09534"},"observation_digest":"sha256:186b6a75f58f9615eac89893fdbd841c471e384770e8241f204cce90901e06bd","observation_id":"097623c1-bebf-4dc8-b788-0493853f2b53","resolution":{"observed_at":"2026-08-07T21:16:19.079955Z","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-07T21:16:19.156590Z","title":"Fully-connected tensor network decomposition and its application to higher-order tensor completion","venue":null,"work_id":"ebf314fe-bd15-48bb-849a-712fa62e2ea8","year":2021},"citing_paper":{"arxiv_id":"2502.09534","last_updated":"2025-08-12T13:48:49Z","snapshot_observed_at":"2026-08-13T16:46:54.176850Z","submitted_at":"2025-02-13T17:50:27Z","title":"Fast Tensor Completion via Approximate Richardson Iteration","version":2},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-07T21:16:19.084654Z"},"links":{"citing_paper":"/paper/2502.09534"},"observation_digest":"sha256:04f1f1ec933881b7fa0a906619475630d77a458ae8ac2b8faca2fdc708a44b83","observation_id":"92513555-eb56-4c52-befe-f2b7fb0d3c95","resolution":{"observed_at":"2026-08-07T21:16:19.162125Z","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":"2502.09534","last_updated":"2025-08-12T13:48:49Z","latest_version":2,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-13T16:46:54.176850Z","submitted_at":"2025-02-13T17:50:27Z","title":"Fast Tensor Completion via Approximate Richardson Iteration"},"reference_resolution":{"displayed":46,"state_counts":{"malformed_identifier":0,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":16,"verified_exact":0,"verified_fuzzy":29},"total_outbound_references":46},"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 46 of 46 outbound references and 0 inbound Pith citation observations for arXiv:2502.09534."}