{"as_of":"2026-08-16T11:56:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:f0ef21b2f522d69a169d217a42aae75d9a55c410bc22100dfd03b6c14d23e4c3","coverage":[{"denominator":30,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":30,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T15:38:18.634442Z","state":"measured"},{"denominator":30,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":30,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+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.01241/citation-record","integrity":"/paper/1908.01241/integrity","json":"/paper/1908.01241/citation-record.json","paper":"/paper/1908.01241"},"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-14T15:38:19.126617Z","title":"Noisy tensor completion via the sum-of-squares hierarchy","venue":null,"work_id":"2da01a4c-2d87-472d-bf58-bd9c368efcd4","year":2016},"citing_paper":{"arxiv_id":"1908.01241","last_updated":"2023-01-17T14:21:40Z","snapshot_observed_at":"2026-08-16T07:37:16.712879Z","submitted_at":"2019-08-03T22:27:26Z","title":"Robust Max Entrywise Error Bounds for Tensor Estimation from Sparse Observations via Similarity Based Collaborative Filtering","version":4},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-14T15:38:18.498236Z"},"links":{"citing_paper":"/paper/1908.01241"},"observation_digest":"sha256:390a02b5f1bd5bb6ed83657ea155cf09b41e93ad9042a9e23ddad8fb07440753","observation_id":"46f7f32e-ca76-46d4-9e76-e8c98da0d6ec","resolution":{"observed_at":"2026-08-14T15:38:19.131481Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1502.05023","last_updated":"2015-02-19T21:05:53Z","snapshot_observed_at":"2026-08-16T06:33:39.321151Z","submitted_at":"2015-02-17T20:23:13Z","title":"A New Sampling Technique for Tensors","version":2},"cited_work":{"arxiv_id":"1502.05023","doi":null,"metadata_source":"pith","pith_arxiv_id":"1502.05023","snapshot_observed_at":"2026-08-14T15:38:18.751202Z","title":"A New Sampling Technique for Tensors","venue":"stat.ML","work_id":"cf067b05-54ad-4e37-8d56-b87ddc0b4f1d","year":2015},"citing_paper":{"arxiv_id":"1908.01241","last_updated":"2023-01-17T14:21:40Z","snapshot_observed_at":"2026-08-16T07:37:16.712879Z","submitted_at":"2019-08-03T22:27:26Z","title":"Robust Max Entrywise Error Bounds for Tensor Estimation from Sparse Observations via Similarity Based Collaborative Filtering","version":4},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-14T15:38:18.503665Z"},"links":{"cited_paper":"/paper/1502.05023","citing_paper":"/paper/1908.01241"},"observation_digest":"sha256:de149ba7ea823478d394eda49cfc3517a8a658934c4507efe8b0eefd1244b2f8","observation_id":"ebb18450-6416-4dd4-8eb5-53f037c955eb","resolution":{"observed_at":"2026-08-14T15:38:18.756975Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:38:19.112107Z","title":"Thy friend is my friend: Iterative collaborative filtering for sparse matrix estimation","venue":null,"work_id":"93d38837-222d-4b6e-990f-7f992babad55","year":2017},"citing_paper":{"arxiv_id":"1908.01241","last_updated":"2023-01-17T14:21:40Z","snapshot_observed_at":"2026-08-16T07:37:16.712879Z","submitted_at":"2019-08-03T22:27:26Z","title":"Robust Max Entrywise Error Bounds for Tensor Estimation from Sparse Observations via Similarity Based Collaborative Filtering","version":4},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-14T15:38:18.508948Z"},"links":{"citing_paper":"/paper/1908.01241"},"observation_digest":"sha256:bfafc32576214dd2f8b633a9eb026cd1773c8feb6dbeba637583892fa159da11","observation_id":"e6a3d6f2-a989-400b-9535-1b9a6deb619e","resolution":{"observed_at":"2026-08-14T15:38:19.116444Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:38:19.098228Z","title":"Exact matrix completion via convex optimization","venue":null,"work_id":"32eba2fa-390c-43ad-967b-8e3f610ec3ef","year":2009},"citing_paper":{"arxiv_id":"1908.01241","last_updated":"2023-01-17T14:21:40Z","snapshot_observed_at":"2026-08-16T07:37:16.712879Z","submitted_at":"2019-08-03T22:27:26Z","title":"Robust Max Entrywise Error Bounds for Tensor Estimation from Sparse Observations via Similarity Based Collaborative Filtering","version":4},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-14T15:38:18.513744Z"},"links":{"citing_paper":"/paper/1908.01241"},"observation_digest":"sha256:0eec1278723c92f3f7abfcf90c28dcdfb2058e9be414046a2ed43b258a3368dc","observation_id":"cd6e6909-1244-4dd2-8263-2f10a86c7f7b","resolution":{"observed_at":"2026-08-14T15:38:19.102831Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:38:19.084119Z","title":"Matrix completion with noise","venue":null,"work_id":"fdff5e8d-25d5-4663-962a-8d83c84ceaff","year":2010},"citing_paper":{"arxiv_id":"1908.01241","last_updated":"2023-01-17T14:21:40Z","snapshot_observed_at":"2026-08-16T07:37:16.712879Z","submitted_at":"2019-08-03T22:27:26Z","title":"Robust Max Entrywise Error Bounds for Tensor Estimation from Sparse Observations via Similarity Based Collaborative Filtering","version":4},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-14T15:38:18.517908Z"},"links":{"citing_paper":"/paper/1908.01241"},"observation_digest":"sha256:6c559272c8b8d0b841bbb79dfca302b971fd74b29b1649e0836c635b98d9fe83","observation_id":"61649f04-e05e-45ee-a075-d87b70a500f3","resolution":{"observed_at":"2026-08-14T15:38:19.088706Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:38:19.069385Z","title":"The power of convex relaxation: Near-optimal matrix completion","venue":null,"work_id":"2397147d-fcc6-4da8-a73c-b7289677a337","year":2010},"citing_paper":{"arxiv_id":"1908.01241","last_updated":"2023-01-17T14:21:40Z","snapshot_observed_at":"2026-08-16T07:37:16.712879Z","submitted_at":"2019-08-03T22:27:26Z","title":"Robust Max Entrywise Error Bounds for Tensor Estimation from Sparse Observations via Similarity Based Collaborative Filtering","version":4},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-14T15:38:18.521817Z"},"links":{"citing_paper":"/paper/1908.01241"},"observation_digest":"sha256:30b37277b8ecdcf32761de2e3a4d7b854d8b13c089b0ff746ea8cbfb8cd6e56e","observation_id":"af6bea67-9e23-4bc6-aef6-1b63c39abe0f","resolution":{"observed_at":"2026-08-14T15:38:19.074616Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:38:19.053618Z","title":"Matrix estimation by universal singular value thresholding","venue":null,"work_id":"9c4c2ce1-40de-48ad-bbed-0a7236e65c91","year":2015},"citing_paper":{"arxiv_id":"1908.01241","last_updated":"2023-01-17T14:21:40Z","snapshot_observed_at":"2026-08-16T07:37:16.712879Z","submitted_at":"2019-08-03T22:27:26Z","title":"Robust Max Entrywise Error Bounds for Tensor Estimation from Sparse Observations via Similarity Based Collaborative Filtering","version":4},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-14T15:38:18.526781Z"},"links":{"citing_paper":"/paper/1908.01241"},"observation_digest":"sha256:f5731b719dee685b2adf93362d2945e4eab0d32d9ce8c654f79200ee659e9d42","observation_id":"1edecf91-feb2-46fb-a819-6d1eee1481b0","resolution":{"observed_at":"2026-08-14T15:38:19.058332Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1509.03025","last_updated":"2015-09-10T06:07:52Z","snapshot_observed_at":"2026-08-14T22:33:01.643882Z","submitted_at":"2015-09-10T06:07:52Z","title":"Fast low-rank estimation by projected gradient descent: General statistical and algorithmic guarantees","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1509.03025","snapshot_observed_at":"2026-08-14T15:38:18.531158Z","title":"Fast low-rank estimation by projected gradient descent: General statistical and algorithmic guarantees","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"1908.01241","last_updated":"2023-01-17T14:21:40Z","snapshot_observed_at":"2026-08-16T07:37:16.712879Z","submitted_at":"2019-08-03T22:27:26Z","title":"Robust Max Entrywise Error Bounds for Tensor Estimation from Sparse Observations via Similarity Based Collaborative Filtering","version":4},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-14T15:38:18.531158Z"},"links":{"cited_paper":"/paper/1509.03025","citing_paper":"/paper/1908.01241"},"observation_digest":"sha256:e27ef4e624c286862b871ecd05cf3564015502b8da4db57d07354048db83e754","observation_id":"6f2dce2b-f10d-430a-9835-eede1f1d9f16","resolution":{"observed_at":"2026-08-14T15:38:18.531158Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1410.6072","last_updated":"2016-05-18T03:21:47Z","snapshot_observed_at":"2026-08-14T23:14:42.263346Z","submitted_at":"2014-10-22T15:23:45Z","title":"Nuclear Norm of Higher-Order Tensors","version":3},"cited_work":{"arxiv_id":"1410.6072","doi":null,"metadata_source":"pith","pith_arxiv_id":"1410.6072","snapshot_observed_at":"2026-08-14T15:38:18.713560Z","title":"Nuclear Norm of Higher-Order Tensors","venue":"cs.CC","work_id":"eefc97c8-1003-40d7-a851-41e312a1d21b","year":2014},"citing_paper":{"arxiv_id":"1908.01241","last_updated":"2023-01-17T14:21:40Z","snapshot_observed_at":"2026-08-16T07:37:16.712879Z","submitted_at":"2019-08-03T22:27:26Z","title":"Robust Max Entrywise Error Bounds for Tensor Estimation from Sparse Observations via Similarity Based Collaborative Filtering","version":4},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-14T15:38:18.535334Z"},"links":{"cited_paper":"/paper/1410.6072","citing_paper":"/paper/1908.01241"},"observation_digest":"sha256:5ff79491a479680ab9cfcfd31526dfec677839aaead1cabde576bac3d0bba02c","observation_id":"e91db11d-54bf-4da5-8325-572c14c6e1b2","resolution":{"observed_at":"2026-08-14T15:38:18.719748Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:38:19.038105Z","title":"Tensor completion and low-n-rank tensor recovery via convex optimization","venue":null,"work_id":"d1b1b4eb-4728-470a-b346-848411444588","year":2011},"citing_paper":{"arxiv_id":"1908.01241","last_updated":"2023-01-17T14:21:40Z","snapshot_observed_at":"2026-08-16T07:37:16.712879Z","submitted_at":"2019-08-03T22:27:26Z","title":"Robust Max Entrywise Error Bounds for Tensor Estimation from Sparse Observations via Similarity Based Collaborative Filtering","version":4},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-14T15:38:18.540204Z"},"links":{"citing_paper":"/paper/1908.01241"},"observation_digest":"sha256:25f10192cdccfcfcbaf50209eef583289eb399ff6460fc3d06ef3b8622a07c16","observation_id":"5bb54d4f-3ca1-4042-9666-fba5252d0112","resolution":{"observed_at":"2026-08-14T15:38:19.042468Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:38:19.021937Z","title":"Matrix completion has no spurious local minimum","venue":null,"work_id":"62c7538b-af2a-4812-885d-7e89b6d5d503","year":2016},"citing_paper":{"arxiv_id":"1908.01241","last_updated":"2023-01-17T14:21:40Z","snapshot_observed_at":"2026-08-16T07:37:16.712879Z","submitted_at":"2019-08-03T22:27:26Z","title":"Robust Max Entrywise Error Bounds for Tensor Estimation from Sparse Observations via Similarity Based Collaborative Filtering","version":4},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-14T15:38:18.545207Z"},"links":{"citing_paper":"/paper/1908.01241"},"observation_digest":"sha256:328a34d3fab866e2c44e39ebacaf731ce475d27ddaeb0d308347685a46271dc0","observation_id":"c2c37f4a-a2eb-4b41-8284-a6c380dfc073","resolution":{"observed_at":"2026-08-14T15:38:19.027378Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:38:19.005151Z","title":"Oki, and Douglas Terry","venue":null,"work_id":"465c4ba4-12aa-4f10-943e-848984ec225d","year":1992},"citing_paper":{"arxiv_id":"1908.01241","last_updated":"2023-01-17T14:21:40Z","snapshot_observed_at":"2026-08-16T07:37:16.712879Z","submitted_at":"2019-08-03T22:27:26Z","title":"Robust Max Entrywise Error Bounds for Tensor Estimation from Sparse Observations via Similarity Based Collaborative Filtering","version":4},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-14T15:38:18.549787Z"},"links":{"citing_paper":"/paper/1908.01241"},"observation_digest":"sha256:92abecb6a1d013cd5aac44bdbfee7ba3a3f9c5d42d2ea2dac7a2590ca2b1dc59","observation_id":"6aa402cf-4d32-4bc7-9397-700128fc9d7c","resolution":{"observed_at":"2026-08-14T15:38:19.010146Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:38:18.988799Z","title":"Understanding alternating minimization for matrix completion","venue":null,"work_id":"fa62edce-c664-42da-ba27-616291055fa9","year":2014},"citing_paper":{"arxiv_id":"1908.01241","last_updated":"2023-01-17T14:21:40Z","snapshot_observed_at":"2026-08-16T07:37:16.712879Z","submitted_at":"2019-08-03T22:27:26Z","title":"Robust Max Entrywise Error Bounds for Tensor Estimation from Sparse Observations via Similarity Based Collaborative Filtering","version":4},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-14T15:38:18.554372Z"},"links":{"citing_paper":"/paper/1908.01241"},"observation_digest":"sha256:63a7595b4ffff005fa832dfea0d4b7b769cf2389f953ffc51c4315acb75b8807","observation_id":"df655056-456b-4699-a6a6-852f4166db91","resolution":{"observed_at":"2026-08-14T15:38:18.994026Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:38:18.974131Z","title":"Hoeffding","venue":null,"work_id":"e2300a84-25b5-40cb-8f14-f014941db31b","year":1963},"citing_paper":{"arxiv_id":"1908.01241","last_updated":"2023-01-17T14:21:40Z","snapshot_observed_at":"2026-08-16T07:37:16.712879Z","submitted_at":"2019-08-03T22:27:26Z","title":"Robust Max Entrywise Error Bounds for Tensor Estimation from Sparse Observations via Similarity Based Collaborative Filtering","version":4},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-14T15:38:18.558692Z"},"links":{"citing_paper":"/paper/1908.01241"},"observation_digest":"sha256:75b5824a3f07a0f8bcbe36331a044b009a8d02b84530dc020c03abbc4f44654d","observation_id":"1bb03699-44ef-4dbe-b9f2-9686ff4bf795","resolution":{"observed_at":"2026-08-14T15:38:18.978968Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:38:18.957336Z","title":"Low-rank matrix completion using alternating minimization","venue":null,"work_id":"868561d3-bd5f-4a9e-9149-c2d72bc58b5a","year":2013},"citing_paper":{"arxiv_id":"1908.01241","last_updated":"2023-01-17T14:21:40Z","snapshot_observed_at":"2026-08-16T07:37:16.712879Z","submitted_at":"2019-08-03T22:27:26Z","title":"Robust Max Entrywise Error Bounds for Tensor Estimation from Sparse Observations via Similarity Based Collaborative Filtering","version":4},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-14T15:38:18.563075Z"},"links":{"citing_paper":"/paper/1908.01241"},"observation_digest":"sha256:732a0b9bcea1fc833c256c62ac0d53cad54019ed9aba6e9f43bd2a576b734c95","observation_id":"0ea4c11c-ff14-4c3f-b698-74d878e7e429","resolution":{"observed_at":"2026-08-14T15:38:18.963083Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:38:18.940647Z","title":"Provable tensor factorization with missing data","venue":null,"work_id":"27a895dc-a426-4130-bfbe-dc3cba322d57","year":2014},"citing_paper":{"arxiv_id":"1908.01241","last_updated":"2023-01-17T14:21:40Z","snapshot_observed_at":"2026-08-16T07:37:16.712879Z","submitted_at":"2019-08-03T22:27:26Z","title":"Robust Max Entrywise Error Bounds for Tensor Estimation from Sparse Observations via Similarity Based Collaborative Filtering","version":4},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-14T15:38:18.567343Z"},"links":{"citing_paper":"/paper/1908.01241"},"observation_digest":"sha256:4af75ac69f1901d7d591a60a0425fb088837a30ba2e5bb672eb8b09a9533453e","observation_id":"6e2e5c3b-2636-4465-820b-74a42d2478b0","resolution":{"observed_at":"2026-08-14T15:38:18.945731Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:38:18.925483Z","title":"Matrix completion from a few entries","venue":null,"work_id":"648cf908-bc50-45f2-ac6c-83c0a386dccd","year":2010},"citing_paper":{"arxiv_id":"1908.01241","last_updated":"2023-01-17T14:21:40Z","snapshot_observed_at":"2026-08-16T07:37:16.712879Z","submitted_at":"2019-08-03T22:27:26Z","title":"Robust Max Entrywise Error Bounds for Tensor Estimation from Sparse Observations via Similarity Based Collaborative Filtering","version":4},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-14T15:38:18.571846Z"},"links":{"citing_paper":"/paper/1908.01241"},"observation_digest":"sha256:d375887cd5bdf08399e77be3acea97dd22fddc1cba289736515d7ef2b1132b6d","observation_id":"cba4db30-2025-4154-a966-3fe4a2803706","resolution":{"observed_at":"2026-08-14T15:38:18.929760Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:38:18.908542Z","title":"Matrix completion from noisy entries","venue":null,"work_id":"12e71d2b-268a-4075-b1a7-984c45e0e8e7","year":2010},"citing_paper":{"arxiv_id":"1908.01241","last_updated":"2023-01-17T14:21:40Z","snapshot_observed_at":"2026-08-16T07:37:16.712879Z","submitted_at":"2019-08-03T22:27:26Z","title":"Robust Max Entrywise Error Bounds for Tensor Estimation from Sparse Observations via Similarity Based Collaborative Filtering","version":4},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-14T15:38:18.576456Z"},"links":{"citing_paper":"/paper/1908.01241"},"observation_digest":"sha256:d7e914cc65e267ea42d3818df3bb2828d58d575afac0b8a722f1aea63388f9d2","observation_id":"9c2fb5d4-db25-4447-8f26-12ac055d387a","resolution":{"observed_at":"2026-08-14T15:38:18.913382Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:38:18.893540Z","title":null,"venue":null,"work_id":"76b3b2e0-ae48-41fb-9e0c-35663c9bda25","year":2020},"citing_paper":{"arxiv_id":"1908.01241","last_updated":"2023-01-17T14:21:40Z","snapshot_observed_at":"2026-08-16T07:37:16.712879Z","submitted_at":"2019-08-03T22:27:26Z","title":"Robust Max Entrywise Error Bounds for Tensor Estimation from Sparse Observations via Similarity Based Collaborative Filtering","version":4},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-14T15:38:18.580847Z"},"links":{"citing_paper":"/paper/1908.01241"},"observation_digest":"sha256:0f8dbd910a4db2062ed7263c4e57540a65f2fd3a3eb7f412dbf99035316f80e0","observation_id":"111f381a-3515-432f-8fa6-d1dc1881012e","resolution":{"observed_at":"2026-08-14T15:38:18.898223Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:38:18.878244Z","title":"Tensor completion for estimating missing values in visual data","venue":null,"work_id":"87d81a52-d2d5-4c5b-b003-5af8d2ddfadc","year":2013},"citing_paper":{"arxiv_id":"1908.01241","last_updated":"2023-01-17T14:21:40Z","snapshot_observed_at":"2026-08-16T07:37:16.712879Z","submitted_at":"2019-08-03T22:27:26Z","title":"Robust Max Entrywise Error Bounds for Tensor Estimation from Sparse Observations via Similarity Based Collaborative Filtering","version":4},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-14T15:38:18.585584Z"},"links":{"citing_paper":"/paper/1908.01241"},"observation_digest":"sha256:df7c7d584a4746c1281e8b158036e253534493e5111d0c1efc4db133b0962c9e","observation_id":"06e9afd8-b9ce-489d-aaa6-9669b06dcb4e","resolution":{"observed_at":"2026-08-14T15:38:18.883200Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:38:18.590469Z","title":"Spectral regularization algorithms for learning large incomplete matrices","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"1908.01241","last_updated":"2023-01-17T14:21:40Z","snapshot_observed_at":"2026-08-16T07:37:16.712879Z","submitted_at":"2019-08-03T22:27:26Z","title":"Robust Max Entrywise Error Bounds for Tensor Estimation from Sparse Observations via Similarity Based Collaborative Filtering","version":4},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-14T15:38:18.590469Z"},"links":{"citing_paper":"/paper/1908.01241"},"observation_digest":"sha256:b261d1626c34610c97f4f3b69dc1ea00b64284e31e6410850a1b577003403aa9","observation_id":"dcd174d9-8075-4e4c-a2f7-48d2197825ce","resolution":{"observed_at":"2026-08-14T15:38:18.590469Z","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-14T15:38:18.853268Z","title":"Spectral algorithms for tensor completion","venue":null,"work_id":"4d5d5d88-78c8-4b8d-859e-9200a97d3d60","year":2018},"citing_paper":{"arxiv_id":"1908.01241","last_updated":"2023-01-17T14:21:40Z","snapshot_observed_at":"2026-08-16T07:37:16.712879Z","submitted_at":"2019-08-03T22:27:26Z","title":"Robust Max Entrywise Error Bounds for Tensor Estimation from Sparse Observations via Similarity Based Collaborative Filtering","version":4},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-14T15:38:18.595589Z"},"links":{"citing_paper":"/paper/1908.01241"},"observation_digest":"sha256:afb3d1aed3f08cf117cedb325c851971460aa91689f12d28197662403437e933","observation_id":"bbf059f4-287b-4fd2-9bfb-bb75816d8f23","resolution":{"observed_at":"2026-08-14T15:38:18.857502Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:38:18.837862Z","title":"Estimation of (near) low-rank matrices with noise and high-dimensional scaling","venue":null,"work_id":"3e5f06ef-eb58-46d4-923d-a8d628e9854c","year":2011},"citing_paper":{"arxiv_id":"1908.01241","last_updated":"2023-01-17T14:21:40Z","snapshot_observed_at":"2026-08-16T07:37:16.712879Z","submitted_at":"2019-08-03T22:27:26Z","title":"Robust Max Entrywise Error Bounds for Tensor Estimation from Sparse Observations via Similarity Based Collaborative Filtering","version":4},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-14T15:38:18.600416Z"},"links":{"citing_paper":"/paper/1908.01241"},"observation_digest":"sha256:7ccfeee8937f55df2b6fda791e53486a458e7af8e59ad3027528e979a18067cb","observation_id":"911cec4e-864b-4632-b6fd-bf655cccc64d","resolution":{"observed_at":"2026-08-14T15:38:18.843351Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1702.06237","last_updated":"2017-06-23T18:24:50Z","snapshot_observed_at":"2026-08-15T05:18:03.402369Z","submitted_at":"2017-02-21T02:14:31Z","title":"Exact tensor completion with sum-of-squares","version":3},"cited_work":{"arxiv_id":"1702.06237","doi":null,"metadata_source":"pith","pith_arxiv_id":"1702.06237","snapshot_observed_at":"2026-08-14T15:38:18.687852Z","title":"Exact tensor completion with sum-of-squares","venue":"cs.LG","work_id":"f545419a-d9e5-47a6-b137-ca1cb51214af","year":2017},"citing_paper":{"arxiv_id":"1908.01241","last_updated":"2023-01-17T14:21:40Z","snapshot_observed_at":"2026-08-16T07:37:16.712879Z","submitted_at":"2019-08-03T22:27:26Z","title":"Robust Max Entrywise Error Bounds for Tensor Estimation from Sparse Observations via Similarity Based Collaborative Filtering","version":4},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-14T15:38:18.605193Z"},"links":{"cited_paper":"/paper/1702.06237","citing_paper":"/paper/1908.01241"},"observation_digest":"sha256:c80abddc0ce287ffbaba38be3717c0fd4141110d8a580de5706b59f8a6fead21","observation_id":"378fd915-a91b-423c-b854-6c4caea876cd","resolution":{"observed_at":"2026-08-14T15:38:18.695380Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:38:18.823173Z","title":"A simpler approach to matrix completion","venue":null,"work_id":"8063c94d-2154-4fac-8219-de09d8e53060","year":2011},"citing_paper":{"arxiv_id":"1908.01241","last_updated":"2023-01-17T14:21:40Z","snapshot_observed_at":"2026-08-16T07:37:16.712879Z","submitted_at":"2019-08-03T22:27:26Z","title":"Robust Max Entrywise Error Bounds for Tensor Estimation from Sparse Observations via Similarity Based Collaborative Filtering","version":4},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-14T15:38:18.610135Z"},"links":{"citing_paper":"/paper/1908.01241"},"observation_digest":"sha256:d40606766a9a01b637691c9babb3a41bebe32a919b6d2951ecf8c94cb6bc5988","observation_id":"a8b893f0-fe12-478e-9d08-7ba17629452c","resolution":{"observed_at":"2026-08-14T15:38:18.828014Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:38:18.808042Z","title":"Guaranteed matrix completion via non-convex factorization","venue":null,"work_id":"80ef60f4-3c9c-4613-8da1-d21154215a2c","year":2016},"citing_paper":{"arxiv_id":"1908.01241","last_updated":"2023-01-17T14:21:40Z","snapshot_observed_at":"2026-08-16T07:37:16.712879Z","submitted_at":"2019-08-03T22:27:26Z","title":"Robust Max Entrywise Error Bounds for Tensor Estimation from Sparse Observations via Similarity Based Collaborative Filtering","version":4},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-14T15:38:18.615076Z"},"links":{"citing_paper":"/paper/1908.01241"},"observation_digest":"sha256:706dab93c3e88320fa20744b915b4e99925adc529b6ec8ba532a317493096554","observation_id":"f934af78-0f9d-4a99-8d82-a88a24e0052a","resolution":{"observed_at":"2026-08-14T15:38:18.812749Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1010.0789","last_updated":"2011-03-02T08:12:24Z","snapshot_observed_at":"2026-08-15T05:06:58.593257Z","submitted_at":"2010-10-05T08:00:33Z","title":"Estimation of low-rank tensors via convex optimization","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1010.0789","snapshot_observed_at":"2026-08-14T15:38:18.619682Z","title":"Estimation of low-rank tensors via convex optimization","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"1908.01241","last_updated":"2023-01-17T14:21:40Z","snapshot_observed_at":"2026-08-16T07:37:16.712879Z","submitted_at":"2019-08-03T22:27:26Z","title":"Robust Max Entrywise Error Bounds for Tensor Estimation from Sparse Observations via Similarity Based Collaborative Filtering","version":4},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-14T15:38:18.619682Z"},"links":{"cited_paper":"/paper/1010.0789","citing_paper":"/paper/1908.01241"},"observation_digest":"sha256:4b6b71b3356827493706b4dc21661285206a11224baab0f0ceb7cc6ad85e1c7f","observation_id":"9a759e89-acd3-43e2-9ced-e7cb9fec283d","resolution":{"observed_at":"2026-08-14T15:38:18.619682Z","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-14T15:38:18.793405Z","title":"Statistical performance of convex tensor decomposition","venue":null,"work_id":"8c82ea3b-6fcb-4f05-99b8-463c797062d5","year":2011},"citing_paper":{"arxiv_id":"1908.01241","last_updated":"2023-01-17T14:21:40Z","snapshot_observed_at":"2026-08-16T07:37:16.712879Z","submitted_at":"2019-08-03T22:27:26Z","title":"Robust Max Entrywise Error Bounds for Tensor Estimation from Sparse Observations via Similarity Based Collaborative Filtering","version":4},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-14T15:38:18.625138Z"},"links":{"citing_paper":"/paper/1908.01241"},"observation_digest":"sha256:c9e92a720a92d623ebf8cec7e7ecf30707ffdf61ba6c15de5c91a333a7c31632","observation_id":"826cf987-5624-4b47-8e0e-9768b4929f9f","resolution":{"observed_at":"2026-08-14T15:38:18.798208Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:38:18.629784Z","title":"High-dimensional statistics: A non-asymptotic viewpoint , volume 48","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"1908.01241","last_updated":"2023-01-17T14:21:40Z","snapshot_observed_at":"2026-08-16T07:37:16.712879Z","submitted_at":"2019-08-03T22:27:26Z","title":"Robust Max Entrywise Error Bounds for Tensor Estimation from Sparse Observations via Similarity Based Collaborative Filtering","version":4},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-14T15:38:18.629784Z"},"links":{"citing_paper":"/paper/1908.01241"},"observation_digest":"sha256:7285c39df735af79e421d1c6cd4aa17817d858d6b19b44e61d26ae2bde0a6fd1","observation_id":"35f973ec-6682-49be-80e5-97a073490f66","resolution":{"observed_at":"2026-08-14T15:38:18.629784Z","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-14T15:38:18.768099Z","title":"On tensor completion via nuclear norm minimization","venue":null,"work_id":"5df59357-1c82-488c-9217-127faacab77b","year":2016},"citing_paper":{"arxiv_id":"1908.01241","last_updated":"2023-01-17T14:21:40Z","snapshot_observed_at":"2026-08-16T07:37:16.712879Z","submitted_at":"2019-08-03T22:27:26Z","title":"Robust Max Entrywise Error Bounds for Tensor Estimation from Sparse Observations via Similarity Based Collaborative Filtering","version":4},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-14T15:38:18.634442Z"},"links":{"citing_paper":"/paper/1908.01241"},"observation_digest":"sha256:cf72439e0d2ca094b6822ba1bc169affe5601114c2278a6b934a8efb7531a48c","observation_id":"15331cbf-4d6a-4de6-b0e9-a6ccc3f8de36","resolution":{"observed_at":"2026-08-14T15:38:18.773614Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"1908.01241","last_updated":"2023-01-17T14:21:40Z","latest_version":4,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-16T07:37:16.712879Z","submitted_at":"2019-08-03T22:27:26Z","title":"Robust Max Entrywise Error Bounds for Tensor Estimation from Sparse Observations via Similarity Based Collaborative Filtering"},"reference_resolution":{"displayed":30,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":5,"verified_exact":3,"verified_fuzzy":22},"total_outbound_references":30},"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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 30 of 30 outbound references and 0 inbound Pith citation observations for arXiv:1908.01241."}