{"as_of":"2026-08-18T09:22:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e6947433aa27708fee53c2f9797faffee7d55a51210206027dfdfab27ba76576","coverage":[{"denominator":37,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":37,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T17:09:37.967943Z","state":"measured"},{"denominator":38,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":38,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-18T06:34:40.430872+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T21:41:40.528629Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-15T21:41:40.563589Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2411.12965","last_updated":"2025-09-01T20:44:58Z","snapshot_observed_at":"2026-08-14T07:41:39.550881Z","submitted_at":"2024-11-20T01:40:53Z","title":"Two-Sided Nearest Neighbors: An adaptive and minimax optimal procedure for matrix completion","version":2},"cited_work":{"arxiv_id":"2411.12965","doi":null,"metadata_source":"pith","pith_arxiv_id":"2411.12965","snapshot_observed_at":"2026-08-15T21:41:40.563589Z","title":"Two-Sided Nearest Neighbors: An adaptive and minimax optimal procedure for matrix completion","venue":"stat.ML","work_id":"2f96d29e-85f8-438c-9703-f5962d187a53","year":2024},"citing_paper":{"arxiv_id":"2505.09612","last_updated":"2025-05-14T17:59:17Z","snapshot_observed_at":"2026-08-15T21:24:57.141587Z","submitted_at":"2025-05-14T17:59:17Z","title":"Adaptively-weighted Nearest Neighbors for Matrix Completion","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-15T21:41:40.528629Z"},"links":{"cited_paper":"/paper/2411.12965","citing_paper":"/paper/2505.09612"},"observation_digest":"sha256:49d6aaffe04bba043022560a2c4a5c472baab9b0df6ab10b3fae0acebf9ff4f6","observation_id":"50835729-8d37-4037-9658-7023616f75a8","resolution":{"observed_at":"2026-08-15T21:41:40.569452Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2411.12965/citation-record","integrity":"/paper/2411.12965/integrity","json":"/paper/2411.12965/citation-record.json","paper":"/paper/2411.12965"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2006.07691","last_updated":"2024-08-24T01:05:42Z","snapshot_observed_at":"2026-08-04T17:19:56.776844Z","submitted_at":"2020-06-13T18:15:22Z","title":"Synthetic Interventions","version":7},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2006.07691","snapshot_observed_at":"2026-08-12T17:09:37.835090Z","title":"Agarwal, D","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2411.12965","last_updated":"2025-09-01T20:44:58Z","snapshot_observed_at":"2026-08-14T07:41:39.550881Z","submitted_at":"2024-11-20T01:40:53Z","title":"Two-Sided Nearest Neighbors: An adaptive and minimax optimal procedure for matrix completion","version":2},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-12T17:09:37.835090Z"},"links":{"cited_paper":"/paper/2006.07691","citing_paper":"/paper/2411.12965"},"observation_digest":"sha256:46a46a9a91d32891de6fdf398814df1eb6a95c7263c3f61694cc7b86274716d1","observation_id":"76212259-c612-4d26-b405-ad60c47fa6bd","resolution":{"observed_at":"2026-08-12T17:09:37.835090Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2109.15154","last_updated":"2021-09-30T14:17:56Z","snapshot_observed_at":"2026-08-16T17:52:45.507722Z","submitted_at":"2021-09-30T14:17:56Z","title":"Causal Matrix Completion","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2109.15154","snapshot_observed_at":"2026-08-12T17:09:37.839267Z","title":"Agarwal, M","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2411.12965","last_updated":"2025-09-01T20:44:58Z","snapshot_observed_at":"2026-08-14T07:41:39.550881Z","submitted_at":"2024-11-20T01:40:53Z","title":"Two-Sided Nearest Neighbors: An adaptive and minimax optimal procedure for matrix completion","version":2},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-12T17:09:37.839267Z"},"links":{"cited_paper":"/paper/2109.15154","citing_paper":"/paper/2411.12965"},"observation_digest":"sha256:2953c22e6a413743e13b8e7b792ba6df097ec4e1800ef9f1e01d129bfab055b2","observation_id":"487d7fd0-f784-412a-9683-3e90655015ac","resolution":{"observed_at":"2026-08-12T17:09:37.839267Z","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-12T17:09:38.379035Z","title":"Arkhangelsky, S","venue":null,"work_id":"723d4cc3-38c8-4f38-8563-58f4b58a24ff","year":2019},"citing_paper":{"arxiv_id":"2411.12965","last_updated":"2025-09-01T20:44:58Z","snapshot_observed_at":"2026-08-14T07:41:39.550881Z","submitted_at":"2024-11-20T01:40:53Z","title":"Two-Sided Nearest Neighbors: An adaptive and minimax optimal procedure for matrix completion","version":2},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-12T17:09:37.843113Z"},"links":{"citing_paper":"/paper/2411.12965"},"observation_digest":"sha256:ea556f41268689fc374eed30399b9ffd500db21ae99ea761345ae5fce65a87df","observation_id":"462ca9aa-8310-4b9d-950b-e3c1be11f9db","resolution":{"observed_at":"2026-08-12T17:09:38.382414Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-12T17:09:38.368458Z","title":null,"venue":null,"work_id":"9cf534b8-8894-4f0d-a39c-a558a6a011a6","year":2004},"citing_paper":{"arxiv_id":"2411.12965","last_updated":"2025-09-01T20:44:58Z","snapshot_observed_at":"2026-08-14T07:41:39.550881Z","submitted_at":"2024-11-20T01:40:53Z","title":"Two-Sided Nearest Neighbors: An adaptive and minimax optimal procedure for matrix completion","version":2},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-12T17:09:37.846813Z"},"links":{"citing_paper":"/paper/2411.12965"},"observation_digest":"sha256:532acb43859300da37f04d5c126ccc50f5c7c8390d26f5c565783819a01a4cc1","observation_id":"a6d8ef5d-b33c-4c27-8286-8c62ca21e45a","resolution":{"observed_at":"2026-08-12T17:09:38.372072Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-12T17:09:38.357996Z","title":"Bertsimas and M","venue":null,"work_id":"b8227732-9840-4d27-8e9d-cfc395f208a4","year":2020},"citing_paper":{"arxiv_id":"2411.12965","last_updated":"2025-09-01T20:44:58Z","snapshot_observed_at":"2026-08-14T07:41:39.550881Z","submitted_at":"2024-11-20T01:40:53Z","title":"Two-Sided Nearest Neighbors: An adaptive and minimax optimal procedure for matrix completion","version":2},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-12T17:09:37.850449Z"},"links":{"citing_paper":"/paper/2411.12965"},"observation_digest":"sha256:f0ab83edb2d49d1e54c6258d592a64511f4b8fd568c00ad211bfc4b3f56e4271","observation_id":"4228df7d-c088-4341-a94e-91e01d6bfaf2","resolution":{"observed_at":"2026-08-12T17:09:38.361636Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2106.02290","last_updated":"2022-04-22T07:48:17Z","snapshot_observed_at":"2026-08-18T03:18:52.093831Z","submitted_at":"2021-06-04T07:07:14Z","title":"Matrix completion with data-dependent missingness probabilities","version":3},"cited_work":{"arxiv_id":"2106.02290","doi":null,"metadata_source":"pith","pith_arxiv_id":"2106.02290","snapshot_observed_at":"2026-08-12T17:09:38.071270Z","title":"Matrix completion with data-dependent missingness probabilities","venue":"math.ST","work_id":"792641c5-50f6-43d2-8f00-fe3ba4ef8a6f","year":2021},"citing_paper":{"arxiv_id":"2411.12965","last_updated":"2025-09-01T20:44:58Z","snapshot_observed_at":"2026-08-14T07:41:39.550881Z","submitted_at":"2024-11-20T01:40:53Z","title":"Two-Sided Nearest Neighbors: An adaptive and minimax optimal procedure for matrix completion","version":2},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-12T17:09:37.854722Z"},"links":{"cited_paper":"/paper/2106.02290","citing_paper":"/paper/2411.12965"},"observation_digest":"sha256:12928a0937ac90db72d5fdb634f56e3813a165c8fcdae47e954164fc3da23ea7","observation_id":"8d7a5500-8b29-4514-b580-744de0adaffc","resolution":{"observed_at":"2026-08-12T17:09:38.075643Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-12T17:09:38.347670Z","title":"Burkina, I","venue":null,"work_id":"f76a50e6-7ba1-4a2e-aedc-6e436dd3f6ee","year":2021},"citing_paper":{"arxiv_id":"2411.12965","last_updated":"2025-09-01T20:44:58Z","snapshot_observed_at":"2026-08-14T07:41:39.550881Z","submitted_at":"2024-11-20T01:40:53Z","title":"Two-Sided Nearest Neighbors: An adaptive and minimax optimal procedure for matrix completion","version":2},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-12T17:09:37.859032Z"},"links":{"citing_paper":"/paper/2411.12965"},"observation_digest":"sha256:ad53648adedd3f81576e7d3f5f0dda4df81af140927d04835dada33eafaa8360","observation_id":"bfd9d07e-af9a-43e8-a1f4-3aefed239b7b","resolution":{"observed_at":"2026-08-12T17:09:38.351478Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-12T17:09:37.862166Z","title":"Chatterjee","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2411.12965","last_updated":"2025-09-01T20:44:58Z","snapshot_observed_at":"2026-08-14T07:41:39.550881Z","submitted_at":"2024-11-20T01:40:53Z","title":"Two-Sided Nearest Neighbors: An adaptive and minimax optimal procedure for matrix completion","version":2},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-12T17:09:37.862166Z"},"links":{"citing_paper":"/paper/2411.12965"},"observation_digest":"sha256:35af02ec75027da7f046e04c8ca8f4e7ed42bfdb8879abf3e6ba2da29c6968fe","observation_id":"5d11549c-1c12-49e1-be54-81e2c22f77a3","resolution":{"observed_at":"2026-08-12T17:09:37.862166Z","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-12T17:09:38.330249Z","title":"Chiang, C.-J","venue":null,"work_id":"2b16bb6b-9c92-4543-9dc3-ba23304ccf86","year":2015},"citing_paper":{"arxiv_id":"2411.12965","last_updated":"2025-09-01T20:44:58Z","snapshot_observed_at":"2026-08-14T07:41:39.550881Z","submitted_at":"2024-11-20T01:40:53Z","title":"Two-Sided Nearest Neighbors: An adaptive and minimax optimal procedure for matrix completion","version":2},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-12T17:09:37.865803Z"},"links":{"citing_paper":"/paper/2411.12965"},"observation_digest":"sha256:9bdd6f7d59b93d160a54014115027da22c9befe841ff7d50fcbfe7f99cf5deb5","observation_id":"99122404-3443-4776-baeb-d017d3951cff","resolution":{"observed_at":"2026-08-12T17:09:38.333786Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-12T17:09:38.320427Z","title":"Chiang, I","venue":null,"work_id":"d1b188ee-1388-4924-925b-681c8976f420","year":2018},"citing_paper":{"arxiv_id":"2411.12965","last_updated":"2025-09-01T20:44:58Z","snapshot_observed_at":"2026-08-14T07:41:39.550881Z","submitted_at":"2024-11-20T01:40:53Z","title":"Two-Sided Nearest Neighbors: An adaptive and minimax optimal procedure for matrix completion","version":2},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-12T17:09:37.868962Z"},"links":{"citing_paper":"/paper/2411.12965"},"observation_digest":"sha256:8140aa19c5b67b4fa5e7dd89f70c8a3f64aa712dd3e5d55a5b39b2becd0ad3c7","observation_id":"7b13c6ac-8f51-4181-9308-18c24de9ed51","resolution":{"observed_at":"2026-08-12T17:09:38.323788Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2202.06891","last_updated":"2025-06-08T19:29:18Z","snapshot_observed_at":"2026-08-16T17:21:24.756739Z","submitted_at":"2022-02-14T17:24:27Z","title":"Counterfactual inference in sequential experiments","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2202.06891","snapshot_observed_at":"2026-08-12T17:09:37.872174Z","title":"Dwivedi, K","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2411.12965","last_updated":"2025-09-01T20:44:58Z","snapshot_observed_at":"2026-08-14T07:41:39.550881Z","submitted_at":"2024-11-20T01:40:53Z","title":"Two-Sided Nearest Neighbors: An adaptive and minimax optimal procedure for matrix completion","version":2},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-12T17:09:37.872174Z"},"links":{"cited_paper":"/paper/2202.06891","citing_paper":"/paper/2411.12965"},"observation_digest":"sha256:e76ccd3840aefa5df7ccfd1d3b4c2ce97dadd1c5d0568b3a9f96624c4b5f5caf","observation_id":"dfcb7eb5-9848-407f-96ca-3b2ee3808c5f","resolution":{"observed_at":"2026-08-12T17:09:37.872174Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2211.14297","last_updated":"2024-01-30T03:16:53Z","snapshot_observed_at":"2026-08-16T16:13:16.125999Z","submitted_at":"2022-11-25T18:56:09Z","title":"Doubly robust nearest neighbors in factor models","version":3},"cited_work":{"arxiv_id":"2211.14297","doi":null,"metadata_source":"pith","pith_arxiv_id":"2211.14297","snapshot_observed_at":"2026-08-12T17:09:38.047797Z","title":"Doubly robust nearest neighbors in factor models","venue":"stat.ML","work_id":"000de875-e420-4cc2-a7e8-fca182e2da2c","year":2022},"citing_paper":{"arxiv_id":"2411.12965","last_updated":"2025-09-01T20:44:58Z","snapshot_observed_at":"2026-08-14T07:41:39.550881Z","submitted_at":"2024-11-20T01:40:53Z","title":"Two-Sided Nearest Neighbors: An adaptive and minimax optimal procedure for matrix completion","version":2},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-12T17:09:37.876285Z"},"links":{"cited_paper":"/paper/2211.14297","citing_paper":"/paper/2411.12965"},"observation_digest":"sha256:2f829925cb68ba0fb1d3e9982bfd24a701af07a5c3e954dbe2822fe27d3d6e38","observation_id":"f68e2249-eb6d-455d-9580-3a08cd1186e3","resolution":{"observed_at":"2026-08-12T17:09:38.052030Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-12T17:09:38.309371Z","title":"Eftekhari, D","venue":null,"work_id":"90bf172e-4d48-4f30-8ef2-0c9bb1c542ee","year":2018},"citing_paper":{"arxiv_id":"2411.12965","last_updated":"2025-09-01T20:44:58Z","snapshot_observed_at":"2026-08-14T07:41:39.550881Z","submitted_at":"2024-11-20T01:40:53Z","title":"Two-Sided Nearest Neighbors: An adaptive and minimax optimal procedure for matrix completion","version":2},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-12T17:09:37.879923Z"},"links":{"citing_paper":"/paper/2411.12965"},"observation_digest":"sha256:79cc2c8f2fd68106bb3ec1caacba2b0f8d89f3436e79216ab032bc57c5a6baf2","observation_id":"f0612c71-b89d-4cdf-a5dc-7783a19e50a1","resolution":{"observed_at":"2026-08-12T17:09:38.313162Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-12T17:09:38.300009Z","title":null,"venue":null,"work_id":"1cbca687-ed7e-49dc-ba7d-4441b0c5a610","year":2015},"citing_paper":{"arxiv_id":"2411.12965","last_updated":"2025-09-01T20:44:58Z","snapshot_observed_at":"2026-08-14T07:41:39.550881Z","submitted_at":"2024-11-20T01:40:53Z","title":"Two-Sided Nearest Neighbors: An adaptive and minimax optimal procedure for matrix completion","version":2},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-12T17:09:37.883704Z"},"links":{"citing_paper":"/paper/2411.12965"},"observation_digest":"sha256:991e8663be0051757dadfe4c11f4312b698d0fa0eb7b8bcfed7f0c863c95538b","observation_id":"7801b982-23cc-43d4-a34e-9bc825c2c4d6","resolution":{"observed_at":"2026-08-12T17:09:38.303300Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-12T17:09:38.289767Z","title":null,"venue":null,"work_id":"12dfd6a9-e150-47fa-9b57-1ecbecb0e03b","year":2016},"citing_paper":{"arxiv_id":"2411.12965","last_updated":"2025-09-01T20:44:58Z","snapshot_observed_at":"2026-08-14T07:41:39.550881Z","submitted_at":"2024-11-20T01:40:53Z","title":"Two-Sided Nearest Neighbors: An adaptive and minimax optimal procedure for matrix completion","version":2},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-12T17:09:37.886858Z"},"links":{"citing_paper":"/paper/2411.12965"},"observation_digest":"sha256:135d02490931896dcd30056cf200eeaadd6c1ad6062a50440214f20b09a509de","observation_id":"faa0a334-7c12-4e4c-b72c-1205735f0f6a","resolution":{"observed_at":"2026-08-12T17:09:38.292951Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-12T17:09:38.279791Z","title":"Ghassemi, A","venue":null,"work_id":"bacf2f52-a586-40a1-87f4-0f2b2fb3e964","year":2018},"citing_paper":{"arxiv_id":"2411.12965","last_updated":"2025-09-01T20:44:58Z","snapshot_observed_at":"2026-08-14T07:41:39.550881Z","submitted_at":"2024-11-20T01:40:53Z","title":"Two-Sided Nearest Neighbors: An adaptive and minimax optimal procedure for matrix completion","version":2},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-12T17:09:37.890858Z"},"links":{"citing_paper":"/paper/2411.12965"},"observation_digest":"sha256:77aa374124d02b8d4b3bf7d0d3fc8342fe9ef1893eba1a2ddb7edfcc0535fa80","observation_id":"cc576426-9dda-42a9-b580-5fb4209bb07b","resolution":{"observed_at":"2026-08-12T17:09:38.283254Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-12T17:09:38.268128Z","title":null,"venue":null,"work_id":"6d7bb96f-3fc5-4f40-b16a-3b40ce591a31","year":2017},"citing_paper":{"arxiv_id":"2411.12965","last_updated":"2025-09-01T20:44:58Z","snapshot_observed_at":"2026-08-14T07:41:39.550881Z","submitted_at":"2024-11-20T01:40:53Z","title":"Two-Sided Nearest Neighbors: An adaptive and minimax optimal procedure for matrix completion","version":2},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-12T17:09:37.894110Z"},"links":{"citing_paper":"/paper/2411.12965"},"observation_digest":"sha256:55f7bd4aad6e1354562b28c379c3f08709cca2a6220b37b02fd3008df84af3b3","observation_id":"a4b50e8e-13be-48da-84c7-c8aaf98e7168","resolution":{"observed_at":"2026-08-12T17:09:38.272344Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-12T17:09:38.257635Z","title":"Hagerup and C","venue":null,"work_id":"b7e772f7-37c9-4519-82b3-ea12e6221a96","year":1990},"citing_paper":{"arxiv_id":"2411.12965","last_updated":"2025-09-01T20:44:58Z","snapshot_observed_at":"2026-08-14T07:41:39.550881Z","submitted_at":"2024-11-20T01:40:53Z","title":"Two-Sided Nearest Neighbors: An adaptive and minimax optimal procedure for matrix completion","version":2},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-12T17:09:37.898125Z"},"links":{"citing_paper":"/paper/2411.12965"},"observation_digest":"sha256:5324af41d13cc6e262e1aab90c990837f849f565a9d928233164fc860c695244","observation_id":"d239bafb-2ee6-4086-8326-928af9a8cea9","resolution":{"observed_at":"2026-08-12T17:09:38.261621Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-12T17:09:38.247361Z","title":"Hastie, R","venue":null,"work_id":"0d02ee97-00f7-4ecf-900d-4abacf4feb8e","year":2015},"citing_paper":{"arxiv_id":"2411.12965","last_updated":"2025-09-01T20:44:58Z","snapshot_observed_at":"2026-08-14T07:41:39.550881Z","submitted_at":"2024-11-20T01:40:53Z","title":"Two-Sided Nearest Neighbors: An adaptive and minimax optimal procedure for matrix completion","version":2},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-12T17:09:37.901558Z"},"links":{"citing_paper":"/paper/2411.12965"},"observation_digest":"sha256:b979d8dade599dffd97ac02fb5956e68abc8edafcbbb70d0dd9fc30d56cb87b3","observation_id":"be2bb21a-9e67-43de-9071-93293bd948c2","resolution":{"observed_at":"2026-08-12T17:09:38.250855Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1306.0626","last_updated":"2013-06-04T00:38:17Z","snapshot_observed_at":"2026-08-15T00:15:20.589809Z","submitted_at":"2013-06-04T00:38:17Z","title":"Provable Inductive Matrix Completion","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1306.0626","snapshot_observed_at":"2026-08-12T17:09:37.905346Z","title":"Jain and I","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2411.12965","last_updated":"2025-09-01T20:44:58Z","snapshot_observed_at":"2026-08-14T07:41:39.550881Z","submitted_at":"2024-11-20T01:40:53Z","title":"Two-Sided Nearest Neighbors: An adaptive and minimax optimal procedure for matrix completion","version":2},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-12T17:09:37.905346Z"},"links":{"cited_paper":"/paper/1306.0626","citing_paper":"/paper/2411.12965"},"observation_digest":"sha256:fcbbe07696353365c980e74145136116c1de3ab119cab22dc7bb0bc67bea6d28","observation_id":"08999c43-7361-483e-94ae-dce0b3c7dcd8","resolution":{"observed_at":"2026-08-12T17:09:37.905346Z","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-12T17:09:38.237352Z","title":"Klasnja, S","venue":null,"work_id":"16ad7370-71ea-4d4e-91a4-56e6ba35408d","year":2019},"citing_paper":{"arxiv_id":"2411.12965","last_updated":"2025-09-01T20:44:58Z","snapshot_observed_at":"2026-08-14T07:41:39.550881Z","submitted_at":"2024-11-20T01:40:53Z","title":"Two-Sided Nearest Neighbors: An adaptive and minimax optimal procedure for matrix completion","version":2},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-12T17:09:37.908976Z"},"links":{"citing_paper":"/paper/2411.12965"},"observation_digest":"sha256:e9d804192a1ab6ad00a31ab292506cb503fb6b8ab147db7f9327b404077a860c","observation_id":"5a521f68-3cd6-45d6-b40c-a1bd3c7402c5","resolution":{"observed_at":"2026-08-12T17:09:38.240675Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-12T17:09:38.227372Z","title":"Klopp, A","venue":null,"work_id":"2bca32e6-e1ee-4ad1-b1b5-17e4bb0b56a2","year":2017},"citing_paper":{"arxiv_id":"2411.12965","last_updated":"2025-09-01T20:44:58Z","snapshot_observed_at":"2026-08-14T07:41:39.550881Z","submitted_at":"2024-11-20T01:40:53Z","title":"Two-Sided Nearest Neighbors: An adaptive and minimax optimal procedure for matrix completion","version":2},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-12T17:09:37.912785Z"},"links":{"citing_paper":"/paper/2411.12965"},"observation_digest":"sha256:cbca4f152933c5ea2530858282ed7e129be9c39d08d0507fda5f913681a62752","observation_id":"8d2dfca3-a86a-4916-93f7-4a0715cde937","resolution":{"observed_at":"2026-08-12T17:09:38.231090Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-12T17:09:38.217679Z","title":null,"venue":null,"work_id":"d1d8e353-6937-43bb-ac3b-bb5123f86b17","year":2019},"citing_paper":{"arxiv_id":"2411.12965","last_updated":"2025-09-01T20:44:58Z","snapshot_observed_at":"2026-08-14T07:41:39.550881Z","submitted_at":"2024-11-20T01:40:53Z","title":"Two-Sided Nearest Neighbors: An adaptive and minimax optimal procedure for matrix completion","version":2},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-12T17:09:37.915884Z"},"links":{"citing_paper":"/paper/2411.12965"},"observation_digest":"sha256:1b666d9b89ae42c4b6d101fbfe4371abf5e6baaae2374531ee210b41555d47e7","observation_id":"d45d617b-6e35-4ca5-a643-86cf346f9bf1","resolution":{"observed_at":"2026-08-12T17:09:38.221149Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-12T17:09:38.207249Z","title":null,"venue":null,"work_id":"bf90d8b4-0b39-49da-a63a-e0566e8c18ab","year":2016},"citing_paper":{"arxiv_id":"2411.12965","last_updated":"2025-09-01T20:44:58Z","snapshot_observed_at":"2026-08-14T07:41:39.550881Z","submitted_at":"2024-11-20T01:40:53Z","title":"Two-Sided Nearest Neighbors: An adaptive and minimax optimal procedure for matrix completion","version":2},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-12T17:09:37.919323Z"},"links":{"citing_paper":"/paper/2411.12965"},"observation_digest":"sha256:ab1b61cd02ce57ee2c399217eda8d5fa2820922522fa0529b0db2e9f6aa89099","observation_id":"dc06d348-897b-4e75-b5c3-9d7e842c507e","resolution":{"observed_at":"2026-08-12T17:09:38.210795Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1910.12774","last_updated":"2019-10-29T12:25:33Z","snapshot_observed_at":"2026-07-06T08:32:49.003018Z","submitted_at":"2019-10-28T16:01:47Z","title":"Missing Not at Random in Matrix Completion: The Effectiveness of Estimating Missingness Probabilities Under a Low Nuclear Norm Assumption","version":2},"cited_work":{"arxiv_id":"1910.12774","doi":null,"metadata_source":"pith","pith_arxiv_id":"1910.12774","snapshot_observed_at":"2026-08-12T17:09:38.023672Z","title":"Missing Not at Random in Matrix Completion: The Effectiveness of Estimating Missingness Probabilities Under a Low Nuclear Norm Assumption","venue":"stat.ML","work_id":"ea4665d5-33cb-4632-a09b-b619f5785b58","year":2019},"citing_paper":{"arxiv_id":"2411.12965","last_updated":"2025-09-01T20:44:58Z","snapshot_observed_at":"2026-08-14T07:41:39.550881Z","submitted_at":"2024-11-20T01:40:53Z","title":"Two-Sided Nearest Neighbors: An adaptive and minimax optimal procedure for matrix completion","version":2},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-12T17:09:37.923106Z"},"links":{"cited_paper":"/paper/1910.12774","citing_paper":"/paper/2411.12965"},"observation_digest":"sha256:3220aef5eab6240e6f8e59ae451c0bd30365ab3379991a14038772f2493204d9","observation_id":"3c144127-49bd-4f11-91ca-9458cecfb796","resolution":{"observed_at":"2026-08-12T17:09:38.028117Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-12T17:09:38.197535Z","title":"Mazumder, T","venue":null,"work_id":"3df3d5c2-899a-45c3-9aec-cad393db9772","year":2010},"citing_paper":{"arxiv_id":"2411.12965","last_updated":"2025-09-01T20:44:58Z","snapshot_observed_at":"2026-08-14T07:41:39.550881Z","submitted_at":"2024-11-20T01:40:53Z","title":"Two-Sided Nearest Neighbors: An adaptive and minimax optimal procedure for matrix completion","version":2},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-12T17:09:37.926950Z"},"links":{"citing_paper":"/paper/2411.12965"},"observation_digest":"sha256:c4db04f0970855a0c56f51d362304090276f4cd33c5623867ce4453946eda4b8","observation_id":"213fc37d-4ceb-4438-8975-e71366cc57bc","resolution":{"observed_at":"2026-08-12T17:09:38.200838Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-12T17:09:38.186336Z","title":"Schnabel, A","venue":null,"work_id":"45e7258c-a4c5-4338-8a0b-2e6979939e66","year":2016},"citing_paper":{"arxiv_id":"2411.12965","last_updated":"2025-09-01T20:44:58Z","snapshot_observed_at":"2026-08-14T07:41:39.550881Z","submitted_at":"2024-11-20T01:40:53Z","title":"Two-Sided Nearest Neighbors: An adaptive and minimax optimal procedure for matrix completion","version":2},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-12T17:09:37.930558Z"},"links":{"citing_paper":"/paper/2411.12965"},"observation_digest":"sha256:fb35e4ae4f50e39821c670a82d0e11b3462497317dfbeae6500c0c1dcac79aa9","observation_id":"087efc3d-a242-4e5c-9c77-591ddb9382e2","resolution":{"observed_at":"2026-08-12T17:09:38.190075Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-12T17:09:38.176636Z","title":null,"venue":null,"work_id":"fff69d3b-4b14-49b7-9f6a-6466c9297210","year":2016},"citing_paper":{"arxiv_id":"2411.12965","last_updated":"2025-09-01T20:44:58Z","snapshot_observed_at":"2026-08-14T07:41:39.550881Z","submitted_at":"2024-11-20T01:40:53Z","title":"Two-Sided Nearest Neighbors: An adaptive and minimax optimal procedure for matrix completion","version":2},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-12T17:09:37.935744Z"},"links":{"citing_paper":"/paper/2411.12965"},"observation_digest":"sha256:a8824ba0b6affc99ce055a2c245c91e83b29db0d3e379a72873416067db94e92","observation_id":"2047d758-7a16-4a36-bd86-dbcb7505acd1","resolution":{"observed_at":"2026-08-12T17:09:38.180039Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-12T17:09:38.166102Z","title":"Sportisse, C","venue":null,"work_id":"2716257f-3f22-4804-bd16-596bf14a5610","year":2020},"citing_paper":{"arxiv_id":"2411.12965","last_updated":"2025-09-01T20:44:58Z","snapshot_observed_at":"2026-08-14T07:41:39.550881Z","submitted_at":"2024-11-20T01:40:53Z","title":"Two-Sided Nearest Neighbors: An adaptive and minimax optimal procedure for matrix completion","version":2},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-12T17:09:37.939450Z"},"links":{"citing_paper":"/paper/2411.12965"},"observation_digest":"sha256:6cad13812d3870df115bd0fc5ecc64c2977a0b033ea93fe2955363ef0362c0fb","observation_id":"85ed3382-9b62-42ac-9ae5-8912ec17b8c5","resolution":{"observed_at":"2026-08-12T17:09:38.169844Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-12T17:09:38.155435Z","title":"Sportisse, C","venue":null,"work_id":"58a65a33-53ce-4517-9e7e-a792ec8d3b21","year":2020},"citing_paper":{"arxiv_id":"2411.12965","last_updated":"2025-09-01T20:44:58Z","snapshot_observed_at":"2026-08-14T07:41:39.550881Z","submitted_at":"2024-11-20T01:40:53Z","title":"Two-Sided Nearest Neighbors: An adaptive and minimax optimal procedure for matrix completion","version":2},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-12T17:09:37.942548Z"},"links":{"citing_paper":"/paper/2411.12965"},"observation_digest":"sha256:c4056a0142354712b6cb04e92a1ec017e540e6c847f095cf9a74560d80bc904f","observation_id":"bf1189fa-d302-43fc-ad74-a872c46b3445","resolution":{"observed_at":"2026-08-12T17:09:38.159043Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-12T17:09:38.144897Z","title":null,"venue":null,"work_id":"dc801ee1-1673-4d8a-a600-09fe995783e7","year":2020},"citing_paper":{"arxiv_id":"2411.12965","last_updated":"2025-09-01T20:44:58Z","snapshot_observed_at":"2026-08-14T07:41:39.550881Z","submitted_at":"2024-11-20T01:40:53Z","title":"Two-Sided Nearest Neighbors: An adaptive and minimax optimal procedure for matrix completion","version":2},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-12T17:09:37.946165Z"},"links":{"citing_paper":"/paper/2411.12965"},"observation_digest":"sha256:2c1c36716d56d6a33e852ac9a1b789613e2bf5233d8b0376359618c4ee9793eb","observation_id":"7826c7c7-f432-44aa-a93b-14a75ffde025","resolution":{"observed_at":"2026-08-12T17:09:38.148283Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-12T17:09:38.134914Z","title":null,"venue":null,"work_id":"f42aff32-a7f1-4a82-b15c-029cab80445c","year":2018},"citing_paper":{"arxiv_id":"2411.12965","last_updated":"2025-09-01T20:44:58Z","snapshot_observed_at":"2026-08-14T07:41:39.550881Z","submitted_at":"2024-11-20T01:40:53Z","title":"Two-Sided Nearest Neighbors: An adaptive and minimax optimal procedure for matrix completion","version":2},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-12T17:09:37.949825Z"},"links":{"citing_paper":"/paper/2411.12965"},"observation_digest":"sha256:b3f26aaea08c4d64c7defac85c2721b37e1e0efa99ab21c2d67f1a8fed58f208","observation_id":"b79f9423-a9bb-4e1d-9975-d845db127369","resolution":{"observed_at":"2026-08-12T17:09:38.138331Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-12T17:09:38.123575Z","title":null,"venue":null,"work_id":"4bfa13b1-1da5-4271-b4ff-99c91e3b24b4","year":2013},"citing_paper":{"arxiv_id":"2411.12965","last_updated":"2025-09-01T20:44:58Z","snapshot_observed_at":"2026-08-14T07:41:39.550881Z","submitted_at":"2024-11-20T01:40:53Z","title":"Two-Sided Nearest Neighbors: An adaptive and minimax optimal procedure for matrix completion","version":2},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-12T17:09:37.953224Z"},"links":{"citing_paper":"/paper/2411.12965"},"observation_digest":"sha256:48004e7250b7921a1f7d1e66f662b6b257e40e7d600878a8e4986edfaed0ee93","observation_id":"2c053623-2bf8-4563-8b8c-dcdf296e6aca","resolution":{"observed_at":"2026-08-12T17:09:38.127603Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2101.00323","last_updated":"2021-04-22T15:41:38Z","snapshot_observed_at":"2026-08-17T16:54:10.524747Z","submitted_at":"2021-01-01T22:13:19Z","title":"TenIPS: Inverse Propensity Sampling for Tensor Completion","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2101.00323","snapshot_observed_at":"2026-08-12T17:09:37.956603Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2411.12965","last_updated":"2025-09-01T20:44:58Z","snapshot_observed_at":"2026-08-14T07:41:39.550881Z","submitted_at":"2024-11-20T01:40:53Z","title":"Two-Sided Nearest Neighbors: An adaptive and minimax optimal procedure for matrix completion","version":2},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-12T17:09:37.956603Z"},"links":{"cited_paper":"/paper/2101.00323","citing_paper":"/paper/2411.12965"},"observation_digest":"sha256:27da2548481ab37061dcb43bb3a86bd05ae338c038028e660d95ea3379a68219","observation_id":"b2955b50-8627-45f5-a5c5-2182ff054f04","resolution":{"observed_at":"2026-08-12T17:09:37.956603Z","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-12T17:09:38.112310Z","title":null,"venue":null,"work_id":"aa23201c-eb03-4d30-879e-b320d4046882","year":2022},"citing_paper":{"arxiv_id":"2411.12965","last_updated":"2025-09-01T20:44:58Z","snapshot_observed_at":"2026-08-14T07:41:39.550881Z","submitted_at":"2024-11-20T01:40:53Z","title":"Two-Sided Nearest Neighbors: An adaptive and minimax optimal procedure for matrix completion","version":2},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-12T17:09:37.960135Z"},"links":{"citing_paper":"/paper/2411.12965"},"observation_digest":"sha256:0c1188f9fe665358a90462fd65cca5f12053b58a6055c1f44580bca744b08209","observation_id":"981a12e7-ec62-4220-b744-13979e5d0cfd","resolution":{"observed_at":"2026-08-12T17:09:38.116131Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-12T17:09:38.101918Z","title":"Zhong, P","venue":null,"work_id":"78f5f52d-184f-403f-8a4c-4a89b61fd694","year":2015},"citing_paper":{"arxiv_id":"2411.12965","last_updated":"2025-09-01T20:44:58Z","snapshot_observed_at":"2026-08-14T07:41:39.550881Z","submitted_at":"2024-11-20T01:40:53Z","title":"Two-Sided Nearest Neighbors: An adaptive and minimax optimal procedure for matrix completion","version":2},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-12T17:09:37.964288Z"},"links":{"citing_paper":"/paper/2411.12965"},"observation_digest":"sha256:f35fe7e8dbb35a4ed15effaf1ad58db156762ac5820d01875ea03cbad927e505","observation_id":"3ce443cd-4888-4b78-9a4e-4ab89b04e896","resolution":{"observed_at":"2026-08-12T17:09:38.105580Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1906.12125","last_updated":"2019-06-28T10:37:16Z","snapshot_observed_at":"2026-08-15T05:10:59.884835Z","submitted_at":"2019-06-28T10:37:16Z","title":"High-dimensional principal component analysis with heterogeneous missingness","version":1},"cited_work":{"arxiv_id":"1906.12125","doi":null,"metadata_source":"pith","pith_arxiv_id":"1906.12125","snapshot_observed_at":"2026-08-12T17:09:37.997534Z","title":"High-dimensional principal component analysis with heterogeneous missingness","venue":"stat.ME","work_id":"9da5fb8d-600c-4fb2-92a3-511dd65b1a94","year":2019},"citing_paper":{"arxiv_id":"2411.12965","last_updated":"2025-09-01T20:44:58Z","snapshot_observed_at":"2026-08-14T07:41:39.550881Z","submitted_at":"2024-11-20T01:40:53Z","title":"Two-Sided Nearest Neighbors: An adaptive and minimax optimal procedure for matrix completion","version":2},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-12T17:09:37.967943Z"},"links":{"cited_paper":"/paper/1906.12125","citing_paper":"/paper/2411.12965"},"observation_digest":"sha256:4c1d9239df19c5d6f9559bf07c586ce16f35300e3b0f76fb8819286aa56868b3","observation_id":"c5a84adf-26ca-4f43-9aa8-6e8f3c7114bf","resolution":{"observed_at":"2026-08-12T17:09:38.003228Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2411.12965","last_updated":"2025-09-01T20:44:58Z","latest_version":2,"primary_category":"stat.ML","snapshot_observed_at":"2026-08-14T07:41:39.550881Z","submitted_at":"2024-11-20T01:40:53Z","title":"Two-Sided Nearest Neighbors: An adaptive and minimax optimal procedure for matrix completion"},"reference_resolution":{"displayed":37,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":17,"verified_exact":4,"verified_fuzzy":16},"total_outbound_references":37},"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-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 37 of 37 outbound references and 1 inbound Pith citation observation for arXiv:2411.12965."}