Pith. sign in

Paper Citation Record · LEDGER

Two-Sided Nearest Neighbors: An adaptive and minimax optimal procedure for matrix completion

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.

A citation records a reference. It does not transfer a finding from one paper to another.

pith.paper-citation-record.v1
2411.12965 v2

Coverage vector

measured 37 of 37 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-12T17:09:37.967943Z

measured 38 of 38 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-18T06:34:40.430872+00:00

measured 1 of 1 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-15T21:41:40.528629Z

measured 0 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: pith, observed 2026-08-15T21:41:40.563589Z

Reference resolution

37 of 37 outbound references displayed

  • verified exact4
  • verified fuzzy16
  • unresolved17
  • parse uncertain0
  • malformed identifier0
  • metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 76212259-c612-4d26-b405-ad60c47fa6bd · outbound

This paper cites Synthetic Interventions.

Two-Sided Nearest Neighbors: An adaptive and minimax optimal procedure for matrix completion Synthetic Interventions

Reference 1

Resolution
unresolved
no resolver link, observed 2026-08-12T17:09:37.835090Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-12T17:09:37.835090Z digest=sha256:46a46a9a91d32891de6fdf398814df1eb6a95c7263c3f61694cc7b86274716d1

Observation 487d7fd0-f784-412a-9683-3e90655015ac · outbound

This paper cites Causal Matrix Completion.

Two-Sided Nearest Neighbors: An adaptive and minimax optimal procedure for matrix completion Causal Matrix Completion

Reference 2

Resolution
unresolved
no resolver link, observed 2026-08-12T17:09:37.839267Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-12T17:09:37.839267Z digest=sha256:2953c22e6a413743e13b8e7b792ba6df097ec4e1800ef9f1e01d129bfab055b2

Observation 462ca9aa-8310-4b9d-950b-e3c1be11f9db · outbound

This paper cites Arkhangelsky, S.

Two-Sided Nearest Neighbors: An adaptive and minimax optimal procedure for matrix completion Arkhangelsky, S

Reference 3

Resolution
verified fuzzy
raw_fallback, observed 2026-08-12T17:09:38.382414Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

source=arxiv_source observed=2026-08-12T17:09:37.843113Z digest=sha256:ea556f41268689fc374eed30399b9ffd500db21ae99ea761345ae5fce65a87df

Observation a6d8ef5d-b33c-4c27-8286-8c62ca21e45a · outbound

This paper cites an unresolved cited work.

Two-Sided Nearest Neighbors: An adaptive and minimax optimal procedure for matrix completion Unresolved cited work

Reference 4

Resolution
unresolved
raw_fallback, observed 2026-08-12T17:09:38.372072Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

source=arxiv_source observed=2026-08-12T17:09:37.846813Z digest=sha256:532acb43859300da37f04d5c126ccc50f5c7c8390d26f5c565783819a01a4cc1

Observation 4228df7d-c088-4341-a94e-91e01d6bfaf2 · outbound

This paper cites Bertsimas and M.

Two-Sided Nearest Neighbors: An adaptive and minimax optimal procedure for matrix completion Bertsimas and M

Reference 5

Resolution
verified fuzzy
raw_fallback, observed 2026-08-12T17:09:38.361636Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

source=arxiv_source observed=2026-08-12T17:09:37.850449Z digest=sha256:f0ab83edb2d49d1e54c6258d592a64511f4b8fd568c00ad211bfc4b3f56e4271

Observation 8d7a5500-8b29-4514-b580-744de0adaffc · outbound

This paper cites Matrix completion with data-dependent missingness probabilities.

Two-Sided Nearest Neighbors: An adaptive and minimax optimal procedure for matrix completion Matrix completion with data-dependent missingness probabilities

Reference 6

Resolution
verified exact
local_arxiv, observed 2026-08-12T17:09:38.075643Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

source=arxiv_source observed=2026-08-12T17:09:37.854722Z digest=sha256:12928a0937ac90db72d5fdb634f56e3813a165c8fcdae47e954164fc3da23ea7

Observation bfd9d07e-af9a-43e8-a1f4-3aefed239b7b · outbound

This paper cites Burkina, I.

Two-Sided Nearest Neighbors: An adaptive and minimax optimal procedure for matrix completion Burkina, I

Reference 7

Resolution
verified fuzzy
raw_fallback, observed 2026-08-12T17:09:38.351478Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

source=arxiv_source observed=2026-08-12T17:09:37.859032Z digest=sha256:ad53648adedd3f81576e7d3f5f0dda4df81af140927d04835dada33eafaa8360

Observation 5d11549c-1c12-49e1-be54-81e2c22f77a3 · outbound

This paper cites Chatterjee.

Two-Sided Nearest Neighbors: An adaptive and minimax optimal procedure for matrix completion Chatterjee

Reference 8

Resolution
unresolved
no resolver link, observed 2026-08-12T17:09:37.862166Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-12T17:09:37.862166Z digest=sha256:35af02ec75027da7f046e04c8ca8f4e7ed42bfdb8879abf3e6ba2da29c6968fe

Observation 99122404-3443-4776-baeb-d017d3951cff · outbound

This paper cites Chiang, C.-J.

Two-Sided Nearest Neighbors: An adaptive and minimax optimal procedure for matrix completion Chiang, C.-J

Reference 9

Resolution
verified fuzzy
raw_fallback, observed 2026-08-12T17:09:38.333786Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

source=arxiv_source observed=2026-08-12T17:09:37.865803Z digest=sha256:9bdd6f7d59b93d160a54014115027da22c9befe841ff7d50fcbfe7f99cf5deb5

Observation 7b13c6ac-8f51-4181-9308-18c24de9ed51 · outbound

This paper cites Chiang, I.

Two-Sided Nearest Neighbors: An adaptive and minimax optimal procedure for matrix completion Chiang, I

Reference 10

Resolution
verified fuzzy
raw_fallback, observed 2026-08-12T17:09:38.323788Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

source=arxiv_source observed=2026-08-12T17:09:37.868962Z digest=sha256:8140aa19c5b67b4fa5e7dd89f70c8a3f64aa712dd3e5d55a5b39b2becd0ad3c7

Observation dfcb7eb5-9848-407f-96ca-3b2ee3808c5f · outbound

This paper cites Counterfactual inference in sequential experiments.

Two-Sided Nearest Neighbors: An adaptive and minimax optimal procedure for matrix completion Counterfactual inference in sequential experiments

Reference 11

Resolution
unresolved
no resolver link, observed 2026-08-12T17:09:37.872174Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-12T17:09:37.872174Z digest=sha256:e76ccd3840aefa5df7ccfd1d3b4c2ce97dadd1c5d0568b3a9f96624c4b5f5caf

Observation f68e2249-eb6d-455d-9580-3a08cd1186e3 · outbound

This paper cites Doubly robust nearest neighbors in factor models.

Two-Sided Nearest Neighbors: An adaptive and minimax optimal procedure for matrix completion Doubly robust nearest neighbors in factor models

Reference 12

Resolution
verified exact
local_arxiv, observed 2026-08-12T17:09:38.052030Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

source=arxiv_source observed=2026-08-12T17:09:37.876285Z digest=sha256:2f829925cb68ba0fb1d3e9982bfd24a701af07a5c3e954dbe2822fe27d3d6e38

Observation f0612c71-b89d-4cdf-a5dc-7783a19e50a1 · outbound

This paper cites Eftekhari, D.

Two-Sided Nearest Neighbors: An adaptive and minimax optimal procedure for matrix completion Eftekhari, D

Reference 13

Resolution
verified fuzzy
raw_fallback, observed 2026-08-12T17:09:38.313162Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

source=arxiv_source observed=2026-08-12T17:09:37.879923Z digest=sha256:79cc2c8f2fd68106bb3ec1caacba2b0f8d89f3436e79216ab032bc57c5a6baf2

Observation 7801b982-23cc-43d4-a34e-9bc825c2c4d6 · outbound

This paper cites an unresolved cited work.

Two-Sided Nearest Neighbors: An adaptive and minimax optimal procedure for matrix completion Unresolved cited work

Reference 14

Resolution
unresolved
raw_fallback, observed 2026-08-12T17:09:38.303300Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

source=arxiv_source observed=2026-08-12T17:09:37.883704Z digest=sha256:991e8663be0051757dadfe4c11f4312b698d0fa0eb7b8bcfed7f0c863c95538b

Observation faa0a334-7c12-4e4c-b72c-1205735f0f6a · outbound

This paper cites an unresolved cited work.

Two-Sided Nearest Neighbors: An adaptive and minimax optimal procedure for matrix completion Unresolved cited work

Reference 15

Resolution
unresolved
raw_fallback, observed 2026-08-12T17:09:38.292951Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

source=arxiv_source observed=2026-08-12T17:09:37.886858Z digest=sha256:135d02490931896dcd30056cf200eeaadd6c1ad6062a50440214f20b09a509de

Observation cc576426-9dda-42a9-b580-5fb4209bb07b · outbound

This paper cites Ghassemi, A.

Two-Sided Nearest Neighbors: An adaptive and minimax optimal procedure for matrix completion Ghassemi, A

Reference 16

Resolution
verified fuzzy
raw_fallback, observed 2026-08-12T17:09:38.283254Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

source=arxiv_source observed=2026-08-12T17:09:37.890858Z digest=sha256:77aa374124d02b8d4b3bf7d0d3fc8342fe9ef1893eba1a2ddb7edfcc0535fa80

Observation a4b50e8e-13be-48da-84c7-c8aaf98e7168 · outbound

This paper cites an unresolved cited work.

Two-Sided Nearest Neighbors: An adaptive and minimax optimal procedure for matrix completion Unresolved cited work

Reference 17

Resolution
unresolved
raw_fallback, observed 2026-08-12T17:09:38.272344Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

source=arxiv_source observed=2026-08-12T17:09:37.894110Z digest=sha256:55f7bd4aad6e1354562b28c379c3f08709cca2a6220b37b02fd3008df84af3b3

Observation d239bafb-2ee6-4086-8326-928af9a8cea9 · outbound

This paper cites Hagerup and C.

Two-Sided Nearest Neighbors: An adaptive and minimax optimal procedure for matrix completion Hagerup and C

Reference 18

Resolution
verified fuzzy
raw_fallback, observed 2026-08-12T17:09:38.261621Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

source=arxiv_source observed=2026-08-12T17:09:37.898125Z digest=sha256:5324af41d13cc6e262e1aab90c990837f849f565a9d928233164fc860c695244

Observation be2bb21a-9e67-43de-9071-93293bd948c2 · outbound

This paper cites Hastie, R.

Two-Sided Nearest Neighbors: An adaptive and minimax optimal procedure for matrix completion Hastie, R

Reference 19

Resolution
verified fuzzy
raw_fallback, observed 2026-08-12T17:09:38.250855Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

source=arxiv_source observed=2026-08-12T17:09:37.901558Z digest=sha256:b979d8dade599dffd97ac02fb5956e68abc8edafcbbb70d0dd9fc30d56cb87b3

Observation 08999c43-7361-483e-94ae-dce0b3c7dcd8 · outbound

This paper cites Provable Inductive Matrix Completion.

Two-Sided Nearest Neighbors: An adaptive and minimax optimal procedure for matrix completion Provable Inductive Matrix Completion

Reference 20

Resolution
unresolved
no resolver link, observed 2026-08-12T17:09:37.905346Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-12T17:09:37.905346Z digest=sha256:fcbbe07696353365c980e74145136116c1de3ab119cab22dc7bb0bc67bea6d28

Observation 5a521f68-3cd6-45d6-b40c-a1bd3c7402c5 · outbound

This paper cites Klasnja, S.

Two-Sided Nearest Neighbors: An adaptive and minimax optimal procedure for matrix completion Klasnja, S

Reference 21

Resolution
verified fuzzy
raw_fallback, observed 2026-08-12T17:09:38.240675Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

source=arxiv_source observed=2026-08-12T17:09:37.908976Z digest=sha256:e9d804192a1ab6ad00a31ab292506cb503fb6b8ab147db7f9327b404077a860c

Observation 8d2dfca3-a86a-4916-93f7-4a0715cde937 · outbound

This paper cites Klopp, A.

Two-Sided Nearest Neighbors: An adaptive and minimax optimal procedure for matrix completion Klopp, A

Reference 22

Resolution
verified fuzzy
raw_fallback, observed 2026-08-12T17:09:38.231090Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

source=arxiv_source observed=2026-08-12T17:09:37.912785Z digest=sha256:cbca4f152933c5ea2530858282ed7e129be9c39d08d0507fda5f913681a62752

Observation d45d617b-6e35-4ca5-a643-86cf346f9bf1 · outbound

This paper cites an unresolved cited work.

Two-Sided Nearest Neighbors: An adaptive and minimax optimal procedure for matrix completion Unresolved cited work

Reference 23

Resolution
unresolved
raw_fallback, observed 2026-08-12T17:09:38.221149Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

source=arxiv_source observed=2026-08-12T17:09:37.915884Z digest=sha256:1b666d9b89ae42c4b6d101fbfe4371abf5e6baaae2374531ee210b41555d47e7

Observation dc06d348-897b-4e75-b5c3-9d7e842c507e · outbound

This paper cites an unresolved cited work.

Two-Sided Nearest Neighbors: An adaptive and minimax optimal procedure for matrix completion Unresolved cited work

Reference 24

Resolution
unresolved
raw_fallback, observed 2026-08-12T17:09:38.210795Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

source=arxiv_source observed=2026-08-12T17:09:37.919323Z digest=sha256:ab1b61cd02ce57ee2c399217eda8d5fa2820922522fa0529b0db2e9f6aa89099

Observation 3c144127-49bd-4f11-91ca-9458cecfb796 · outbound

This paper cites Missing Not at Random in Matrix Completion: The Effectiveness of Estimating Missingness Probabilities Under a Low Nuclear Norm Assumption.

Two-Sided Nearest Neighbors: An adaptive and minimax optimal procedure for matrix completion Missing Not at Random in Matrix Completion: The Effectiveness of Estimating Missingness Probabilities Under a Low Nuclear Norm Assumption

Reference 25

Resolution
verified exact
local_arxiv, observed 2026-08-12T17:09:38.028117Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

source=arxiv_source observed=2026-08-12T17:09:37.923106Z digest=sha256:3220aef5eab6240e6f8e59ae451c0bd30365ab3379991a14038772f2493204d9

Observation 213fc37d-4ceb-4438-8975-e71366cc57bc · outbound

This paper cites Mazumder, T.

Two-Sided Nearest Neighbors: An adaptive and minimax optimal procedure for matrix completion Mazumder, T

Reference 26

Resolution
verified fuzzy
raw_fallback, observed 2026-08-12T17:09:38.200838Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

source=arxiv_source observed=2026-08-12T17:09:37.926950Z digest=sha256:c4db04f0970855a0c56f51d362304090276f4cd33c5623867ce4453946eda4b8

Observation 087efc3d-a242-4e5c-9c77-591ddb9382e2 · outbound

This paper cites Schnabel, A.

Two-Sided Nearest Neighbors: An adaptive and minimax optimal procedure for matrix completion Schnabel, A

Reference 27

Resolution
verified fuzzy
raw_fallback, observed 2026-08-12T17:09:38.190075Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

source=arxiv_source observed=2026-08-12T17:09:37.930558Z digest=sha256:fb35e4ae4f50e39821c670a82d0e11b3462497317dfbeae6500c0c1dcac79aa9

Observation 2047d758-7a16-4a36-bd86-dbcb7505acd1 · outbound

This paper cites an unresolved cited work.

Two-Sided Nearest Neighbors: An adaptive and minimax optimal procedure for matrix completion Unresolved cited work

Reference 28

Resolution
unresolved
raw_fallback, observed 2026-08-12T17:09:38.180039Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

source=arxiv_source observed=2026-08-12T17:09:37.935744Z digest=sha256:a8824ba0b6affc99ce055a2c245c91e83b29db0d3e379a72873416067db94e92

Observation 85ed3382-9b62-42ac-9ae5-8912ec17b8c5 · outbound

This paper cites Sportisse, C.

Two-Sided Nearest Neighbors: An adaptive and minimax optimal procedure for matrix completion Sportisse, C

Reference 29

Resolution
verified fuzzy
raw_fallback, observed 2026-08-12T17:09:38.169844Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

source=arxiv_source observed=2026-08-12T17:09:37.939450Z digest=sha256:6cad13812d3870df115bd0fc5ecc64c2977a0b033ea93fe2955363ef0362c0fb

Observation bf1189fa-d302-43fc-ad74-a872c46b3445 · outbound

This paper cites Sportisse, C.

Two-Sided Nearest Neighbors: An adaptive and minimax optimal procedure for matrix completion Sportisse, C

Reference 30

Resolution
verified fuzzy
raw_fallback, observed 2026-08-12T17:09:38.159043Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

source=arxiv_source observed=2026-08-12T17:09:37.942548Z digest=sha256:c4056a0142354712b6cb04e92a1ec017e540e6c847f095cf9a74560d80bc904f

Observation 7826c7c7-f432-44aa-a93b-14a75ffde025 · outbound

This paper cites an unresolved cited work.

Two-Sided Nearest Neighbors: An adaptive and minimax optimal procedure for matrix completion Unresolved cited work

Reference 31

Resolution
unresolved
raw_fallback, observed 2026-08-12T17:09:38.148283Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

source=arxiv_source observed=2026-08-12T17:09:37.946165Z digest=sha256:2c1c36716d56d6a33e852ac9a1b789613e2bf5233d8b0376359618c4ee9793eb

Observation b79f9423-a9bb-4e1d-9975-d845db127369 · outbound

This paper cites an unresolved cited work.

Two-Sided Nearest Neighbors: An adaptive and minimax optimal procedure for matrix completion Unresolved cited work

Reference 32

Resolution
unresolved
raw_fallback, observed 2026-08-12T17:09:38.138331Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

source=arxiv_source observed=2026-08-12T17:09:37.949825Z digest=sha256:b3f26aaea08c4d64c7defac85c2721b37e1e0efa99ab21c2d67f1a8fed58f208

Observation 2c053623-2bf8-4563-8b8c-dcdf296e6aca · outbound

This paper cites an unresolved cited work.

Two-Sided Nearest Neighbors: An adaptive and minimax optimal procedure for matrix completion Unresolved cited work

Reference 33

Resolution
unresolved
raw_fallback, observed 2026-08-12T17:09:38.127603Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

source=arxiv_source observed=2026-08-12T17:09:37.953224Z digest=sha256:48004e7250b7921a1f7d1e66f662b6b257e40e7d600878a8e4986edfaed0ee93

Observation b2955b50-8627-45f5-a5c5-2182ff054f04 · outbound

This paper cites TenIPS: Inverse Propensity Sampling for Tensor Completion.

Two-Sided Nearest Neighbors: An adaptive and minimax optimal procedure for matrix completion TenIPS: Inverse Propensity Sampling for Tensor Completion

Reference 34

Resolution
unresolved
no resolver link, observed 2026-08-12T17:09:37.956603Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-12T17:09:37.956603Z digest=sha256:27da2548481ab37061dcb43bb3a86bd05ae338c038028e660d95ea3379a68219

Observation 981a12e7-ec62-4220-b744-13979e5d0cfd · outbound

This paper cites an unresolved cited work.

Two-Sided Nearest Neighbors: An adaptive and minimax optimal procedure for matrix completion Unresolved cited work

Reference 35

Resolution
unresolved
raw_fallback, observed 2026-08-12T17:09:38.116131Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

source=arxiv_source observed=2026-08-12T17:09:37.960135Z digest=sha256:0c1188f9fe665358a90462fd65cca5f12053b58a6055c1f44580bca744b08209

Observation 3ce443cd-4888-4b78-9a4e-4ab89b04e896 · outbound

This paper cites Zhong, P.

Two-Sided Nearest Neighbors: An adaptive and minimax optimal procedure for matrix completion Zhong, P

Reference 36

Resolution
verified fuzzy
raw_fallback, observed 2026-08-12T17:09:38.105580Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

source=arxiv_source observed=2026-08-12T17:09:37.964288Z digest=sha256:f35fe7e8dbb35a4ed15effaf1ad58db156762ac5820d01875ea03cbad927e505

Observation c5a84adf-26ca-4f43-9aa8-6e8f3c7114bf · outbound

This paper cites High-dimensional principal component analysis with heterogeneous missingness.

Two-Sided Nearest Neighbors: An adaptive and minimax optimal procedure for matrix completion High-dimensional principal component analysis with heterogeneous missingness

Reference 37

Resolution
verified exact
local_arxiv, observed 2026-08-12T17:09:38.003228Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

source=arxiv_source observed=2026-08-12T17:09:37.967943Z digest=sha256:4c1d9239df19c5d6f9559bf07c586ce16f35300e3b0f76fb8819286aa56868b3

Pith citing papers

Observation 50835729-8d37-4037-9658-7023616f75a8 · inbound

Adaptively-weighted Nearest Neighbors for Matrix Completion cites this paper.

Adaptively-weighted Nearest Neighbors for Matrix Completion Two-Sided Nearest Neighbors: An adaptive and minimax optimal procedure for matrix completion

Reference 35

Resolution
metadata mismatch
local_arxiv, observed 2026-08-15T21:41:40.569452Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

source=arxiv_source observed=2026-08-15T21:41:40.528629Z digest=sha256:49d6aaffe04bba043022560a2c4a5c472baab9b0df6ab10b3fae0acebf9ff4f6