Paper Citation Record · LEDGER

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

As of 13 August 2026, this Paper Citation Record lists 37 of 37 outbound references and 0 inbound Pith citation observations 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 37 of 37 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-13T06:32:02.005865+00:00

measured 0 of 0 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links

measured 0 of 1 external citation measurements

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

Source: cited_works

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.

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.

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-13T06:32:02.005865+00:00.

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-13T06:32:02.005865+00:00.

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-13T06:32:02.005865+00:00.

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-13T06:32:02.005865+00:00.

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-13T06:32:02.005865+00:00.

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.

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-13T06:32:02.005865+00:00.

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-13T06:32:02.005865+00:00.

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.

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-13T06:32:02.005865+00:00.

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-13T06:32:02.005865+00:00.

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-13T06:32:02.005865+00:00.

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-13T06:32:02.005865+00:00.

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-13T06:32:02.005865+00:00.

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-13T06:32:02.005865+00:00.

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-13T06:32:02.005865+00:00.

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-13T06:32:02.005865+00:00.

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.

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-13T06:32:02.005865+00:00.

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-13T06:32:02.005865+00:00.

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-13T06:32:02.005865+00:00.

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-13T06:32:02.005865+00:00.

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-13T06:32:02.005865+00:00.

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-13T06:32:02.005865+00:00.

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-13T06:32:02.005865+00:00.

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-13T06:32:02.005865+00:00.

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-13T06:32:02.005865+00:00.

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-13T06:32:02.005865+00:00.

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-13T06:32:02.005865+00:00.

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-13T06:32:02.005865+00:00.

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-13T06:32:02.005865+00:00.

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.

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-13T06:32:02.005865+00:00.

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-13T06:32:02.005865+00:00.

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-13T06:32:02.005865+00:00.

Pith citing papers

No inbound Pith citation observations are available.