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-17T06:30:58.91139+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-17T06:30:58.91139+00:00.

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

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-17T06:30:58.91139+00:00.

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

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-17T06:30:58.91139+00:00.

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

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-17T06:30:58.91139+00:00.

source=arxiv_source observed=2026-08-12T17:09:37.854722Z digest=sha256:6ff8d77846a15608a092cef029182c804c4ef8df9114683fa352c95a423b6008

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-17T06:30:58.91139+00:00.

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

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-17T06:30:58.91139+00:00.

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

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-17T06:30:58.91139+00:00.

source=arxiv_source observed=2026-08-12T17:09:37.868962Z digest=sha256:9a7e3071e0ccda49eadcfd6f5cbfefa3cacf89c2e0894466e7520d720116b00f

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-17T06:30:58.91139+00:00.

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

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-17T06:30:58.91139+00:00.

source=arxiv_source observed=2026-08-12T17:09:37.879923Z digest=sha256:0635e05b7526edba9265e7b228d0c72e159e9ae0eb3d1322a28a3f543a9fe610

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-17T06:30:58.91139+00:00.

source=arxiv_source observed=2026-08-12T17:09:37.883704Z digest=sha256:9183e7c84190764d2d5dc00e75b4a37e1a2da011fd7abf449225a2fc58f4c419

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-17T06:30:58.91139+00:00.

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

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-17T06:30:58.91139+00:00.

source=arxiv_source observed=2026-08-12T17:09:37.890858Z digest=sha256:4c1c5db557d07f0295fcaec675825d5c67275b237e612caed0b79e6d19ff347c

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-17T06:30:58.91139+00:00.

source=arxiv_source observed=2026-08-12T17:09:37.894110Z digest=sha256:42f065178b2a7389ac752c9af46a57daa9f243fcf5d11bdbed55620dde0e8280

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-17T06:30:58.91139+00:00.

source=arxiv_source observed=2026-08-12T17:09:37.898125Z digest=sha256:0ea5499f11a95aca7ae7840b2deded0bf30129419df7d9d31bf0210c963b715b

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-17T06:30:58.91139+00:00.

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

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-17T06:30:58.91139+00:00.

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

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-17T06:30:58.91139+00:00.

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

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-17T06:30:58.91139+00:00.

source=arxiv_source observed=2026-08-12T17:09:37.915884Z digest=sha256:4c5a96358b552023f5445ca541209301c14c1b3d27251fbe0b36fef96f6230f1

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-17T06:30:58.91139+00:00.

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

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-17T06:30:58.91139+00:00.

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

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-17T06:30:58.91139+00:00.

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

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-17T06:30:58.91139+00:00.

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

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-17T06:30:58.91139+00:00.

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

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-17T06:30:58.91139+00:00.

source=arxiv_source observed=2026-08-12T17:09:37.939450Z digest=sha256:9a7f7700680b5a36e04729c46fb24a9d2302bcaeadd11c7fe2cd79c2bdc2382b

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-17T06:30:58.91139+00:00.

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

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-17T06:30:58.91139+00:00.

source=arxiv_source observed=2026-08-12T17:09:37.946165Z digest=sha256:389504cce71a3436e257749bdc58ac4b9341f52da5bf87b80bc226e9111af49f

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-17T06:30:58.91139+00:00.

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

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-17T06:30:58.91139+00:00.

source=arxiv_source observed=2026-08-12T17:09:37.953224Z digest=sha256:46b1641ae86b1de01b2a0f19af5dfb156ac89e8b33dac32af91307e2b4f816d4

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-17T06:30:58.91139+00:00.

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

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-17T06:30:58.91139+00:00.

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

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-17T06:30:58.91139+00:00.

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

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-17T06:30:58.91139+00:00.

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