{"as_of":"2026-08-18T08:44:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e6e9133e2c6c4d0ca41fd16d136eb4591eb96297d6ecc6cda51d48dbcf93031f","coverage":[{"denominator":38,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":38,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T21:41:40.539671Z","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":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2505.09612/citation-record","integrity":"/paper/2505.09612/integrity","json":"/paper/2505.09612/citation-record.json","paper":"/paper/2505.09612"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:41:40.941802Z","title":"Synthetic difference in differences","venue":null,"work_id":"12bf60f3-2d21-4e93-821c-cf70cf96e945","year":2019},"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":1,"source":"arxiv_source","source_observed_at":"2026-08-15T21:41:40.413662Z"},"links":{"citing_paper":"/paper/2505.09612"},"observation_digest":"sha256:ba0c12834e003cd309d5227259c79b2046693f3cb9053ab21f5f4807937a426a","observation_id":"ffdbd1d6-7344-46eb-bfa0-c5a31835edd7","resolution":{"observed_at":"2026-08-15T21:41:40.944811Z","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-15T21:41:40.932191Z","title":"Abadie, A","venue":null,"work_id":"e40ef22b-a15a-4ea5-9bc2-2720c740aa1c","year":2010},"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":2,"source":"arxiv_source","source_observed_at":"2026-08-15T21:41:40.417911Z"},"links":{"citing_paper":"/paper/2505.09612"},"observation_digest":"sha256:4221b95bcb6a7e9ca4bce9e2cd0590f9a81d3bd95fc235cc7b8711f74cd0e82a","observation_id":"3ad32945-8e2b-4ee2-97ea-d63189f4f3c2","resolution":{"observed_at":"2026-08-15T21:41:40.935504Z","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":"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-15T21:41:40.421934Z","title":"Causal matrix completion","venue":null,"work_id":null,"year":2021},"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":3,"source":"arxiv_source","source_observed_at":"2026-08-15T21:41:40.421934Z"},"links":{"cited_paper":"/paper/2109.15154","citing_paper":"/paper/2505.09612"},"observation_digest":"sha256:b1206485bcd45a61beacb5539bb244addc9663e9e9a47489734200d813334052","observation_id":"fd59fb5b-a69c-4cbe-a9c1-457ba38c5635","resolution":{"observed_at":"2026-08-15T21:41:40.421934Z","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-15T21:41:40.921458Z","title":"Abadie and J","venue":null,"work_id":"7965ee15-072a-4a9c-8fe3-99b51a2584de","year":2003},"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":4,"source":"arxiv_source","source_observed_at":"2026-08-15T21:41:40.425966Z"},"links":{"citing_paper":"/paper/2505.09612"},"observation_digest":"sha256:29219062360b65541533201f330471af8fb848601c32b9853bad737f72bc61e9","observation_id":"4486f9a8-7d59-475a-9291-3971cf69b6c1","resolution":{"observed_at":"2026-08-15T21:41:40.924524Z","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-15T21:41:40.911211Z","title":"Design-based analysis in difference-in-differences settings with staggered adoption","venue":null,"work_id":"b0d80f4a-9962-4b22-a057-a8978931496e","year":2022},"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":5,"source":"arxiv_source","source_observed_at":"2026-08-15T21:41:40.429360Z"},"links":{"citing_paper":"/paper/2505.09612"},"observation_digest":"sha256:f19f8ab75e299fa50f7f12bd8e77b82aba26d980c6f11573a7741010a10346a7","observation_id":"03ef516c-6eb3-45d9-980b-c05f870db923","resolution":{"observed_at":"2026-08-15T21:41:40.914346Z","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-15T21:41:40.900537Z","title":"In retrospect: Book of optics, 2015","venue":null,"work_id":"79b96124-dc5a-422f-81a0-fdba159e2b42","year":2015},"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":6,"source":"arxiv_source","source_observed_at":"2026-08-15T21:41:40.432793Z"},"links":{"citing_paper":"/paper/2505.09612"},"observation_digest":"sha256:7d44db42824b662a62a5343b43a95aaab3197577f7a47d2d8877a3f7b7cae56f","observation_id":"aa5afc53-bce1-4960-886a-17f4e7762bde","resolution":{"observed_at":"2026-08-15T21:41:40.903648Z","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":"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-15T21:41:40.437722Z","title":"Synthetic interventions","venue":null,"work_id":null,"year":2006},"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":7,"source":"arxiv_source","source_observed_at":"2026-08-15T21:41:40.437722Z"},"links":{"cited_paper":"/paper/2006.07691","citing_paper":"/paper/2505.09612"},"observation_digest":"sha256:3322f6be271d9d4ed41cdd6dd2dc7ade5c15642ac127e4890fa8c4a193bc0284","observation_id":"3fc8d8db-24d5-46c7-86d1-793bfaf3646e","resolution":{"observed_at":"2026-08-15T21:41:40.437722Z","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-15T21:41:40.890436Z","title":"Matrix completion with data-dependent missingness probabilities","venue":null,"work_id":"7aaabb1c-4a0a-494e-8214-c0923129c3cf","year":2022},"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":8,"source":"arxiv_source","source_observed_at":"2026-08-15T21:41:40.441907Z"},"links":{"citing_paper":"/paper/2505.09612"},"observation_digest":"sha256:1190da2a9fc369acf3e2cbffb1f5ddac29eefa3e87880fdda5094f730324c2f3","observation_id":"e241329b-a6b2-47fe-9c31-805f2dd17319","resolution":{"observed_at":"2026-08-15T21:41:40.893078Z","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-15T21:41:40.878384Z","title":"On hoeffding’s inequalities","venue":null,"work_id":"a64d1d61-ab6f-4b5a-bf05-694d56adba05","year":2004},"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":9,"source":"arxiv_source","source_observed_at":"2026-08-15T21:41:40.444775Z"},"links":{"citing_paper":"/paper/2505.09612"},"observation_digest":"sha256:9c859e91f3dc54c9a5f30e6372b9cf6ad5cc0027275e93fbbbda0f91389d5550","observation_id":"b915153b-dcaa-4fbd-87e7-0e8f3eddf2de","resolution":{"observed_at":"2026-08-15T21:41:40.882370Z","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-15T21:41:40.866937Z","title":"Fast exact matrix completion: A unified optimization framework for matrix completion","venue":null,"work_id":"cc752146-d6ea-4499-b466-dc05a26ad849","year":2020},"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":10,"source":"arxiv_source","source_observed_at":"2026-08-15T21:41:40.447264Z"},"links":{"citing_paper":"/paper/2505.09612"},"observation_digest":"sha256:f8550e12d8e59e1b5799652f5813cc2d21964d1740b41b5bd59ab5e84038aa95","observation_id":"0f02de3a-3296-4e23-bdd1-14806ce173e5","resolution":{"observed_at":"2026-08-15T21:41:40.870554Z","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-15T21:41:40.856337Z","title":"Synthetic controls with staggered adoption","venue":null,"work_id":"b021b34f-e78d-40a6-b778-4a45eaf55d7b","year":2022},"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":11,"source":"arxiv_source","source_observed_at":"2026-08-15T21:41:40.449897Z"},"links":{"citing_paper":"/paper/2505.09612"},"observation_digest":"sha256:39fb66fcfd66e287b3796d42a6fada6907d00dea853257ed20872db6649d5532","observation_id":"aa2e9b8f-34cb-4f42-b8c7-64be772037cb","resolution":{"observed_at":"2026-08-15T21:41:40.860132Z","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-15T21:41:40.845163Z","title":"Local nearest neighbour classification with applications to semi-supervised learning","venue":null,"work_id":"056e31ff-dad3-419f-8ab7-697b01f0d98a","year":2020},"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":12,"source":"arxiv_source","source_observed_at":"2026-08-15T21:41:40.452635Z"},"links":{"citing_paper":"/paper/2505.09612"},"observation_digest":"sha256:dad8698972c139f609dc8516ffac44b7afda98e66c811e3916d3dc4bda992e09","observation_id":"0d009839-74a9-41b7-a93b-013de370efb1","resolution":{"observed_at":"2026-08-15T21:41:40.848946Z","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-15T21:41:40.455465Z","title":"Noisy matrix completion: Understanding statistical guarantees for convex relaxation via nonconvex optimization","venue":null,"work_id":null,"year":2020},"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":13,"source":"arxiv_source","source_observed_at":"2026-08-15T21:41:40.455465Z"},"links":{"citing_paper":"/paper/2505.09612"},"observation_digest":"sha256:bb6eada3b5778be7fa876959abe2d6903c21b74fe5e280e5334cf6d51313ba56","observation_id":"00ab35cb-ee70-46cd-aff3-710b351a608f","resolution":{"observed_at":"2026-08-15T21:41:40.455465Z","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-15T21:41:40.829697Z","title":"Using side information to reliably learn low-rank matrices from missing and corrupted observations","venue":null,"work_id":"e7f14ff0-5e8b-4023-8ce4-1280e0d16263","year":2018},"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":14,"source":"arxiv_source","source_observed_at":"2026-08-15T21:41:40.458986Z"},"links":{"citing_paper":"/paper/2505.09612"},"observation_digest":"sha256:5e84022c4a87938258efe48dac970c1d13e7b6262f9491dfd15edf1243705667","observation_id":"59bb159e-6ee1-41f8-87fd-4e35473272e1","resolution":{"observed_at":"2026-08-15T21:41:40.833438Z","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-15T21:41:40.818726Z","title":"Nearest neighbor pattern classification","venue":null,"work_id":"55f65d1b-2093-4b5f-8893-d519b21c0cc3","year":1967},"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":15,"source":"arxiv_source","source_observed_at":"2026-08-15T21:41:40.463684Z"},"links":{"citing_paper":"/paper/2505.09612"},"observation_digest":"sha256:d1dbdfdc019c6dd6e1ab4e5a3fcc4c584cee14e88939906c104c6e9f46c0d7d6","observation_id":"ea10962e-e881-42e0-a160-51fad9b1e867","resolution":{"observed_at":"2026-08-15T21:41:40.822696Z","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-15T21:41:40.808219Z","title":"Matrix estimation by universal singular value thresholding","venue":null,"work_id":"d5f1ee0a-cf10-4919-ac84-0a97398d2783","year":2015},"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":16,"source":"arxiv_source","source_observed_at":"2026-08-15T21:41:40.467737Z"},"links":{"citing_paper":"/paper/2505.09612"},"observation_digest":"sha256:e8527b7efe1231b6857dc56f522476dcc2802e4de889b90370638d35aa35866e","observation_id":"f22cc255-e365-4015-bf3e-7d7359873f18","resolution":{"observed_at":"2026-08-15T21:41:40.811527Z","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-15T21:41:40.797562Z","title":"Matrix completion with noisy side information","venue":null,"work_id":"e1e19002-3bf5-43ae-9cee-5ad449a1df01","year":2015},"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":17,"source":"arxiv_source","source_observed_at":"2026-08-15T21:41:40.471464Z"},"links":{"citing_paper":"/paper/2505.09612"},"observation_digest":"sha256:34d495240bd3503fe8892779bc9dbd6da4fcaf6e67bf5e86b63d18da1cacb5e5","observation_id":"2a143b96-5574-4aab-9d3c-f56fdf7519ee","resolution":{"observed_at":"2026-08-15T21:41:40.801144Z","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-15T21:41:40.474396Z","title":"Counterfactual inference for sequential experiments","venue":null,"work_id":null,"year":2022},"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":18,"source":"arxiv_source","source_observed_at":"2026-08-15T21:41:40.474396Z"},"links":{"cited_paper":"/paper/2202.06891","citing_paper":"/paper/2505.09612"},"observation_digest":"sha256:ca1884dbde84a346b7bbf2cee8af547af90ed8ab7c7af43f4a0dbcc91f1602d4","observation_id":"d26b5de0-0fd7-4e07-a732-f1faf0cdc342","resolution":{"observed_at":"2026-08-15T21:41:40.474396Z","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":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2211.14297","snapshot_observed_at":"2026-08-15T21:41:40.478268Z","title":"Doubly robust nearest neighbors in factor models","venue":null,"work_id":null,"year":2022},"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":19,"source":"arxiv_source","source_observed_at":"2026-08-15T21:41:40.478268Z"},"links":{"cited_paper":"/paper/2211.14297","citing_paper":"/paper/2505.09612"},"observation_digest":"sha256:c0b897504cd78d298255dec3e48688601c6e949dde1acb3e95a1799efa95f369","observation_id":"2777bb3e-05be-4eed-aa4e-727b93f1fee2","resolution":{"observed_at":"2026-08-15T21:41:40.478268Z","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-15T21:41:40.787866Z","title":"Weighted matrix completion and recovery with prior subspace information","venue":null,"work_id":"3ea8eb35-de3c-4584-b63d-3840c747a320","year":2018},"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":20,"source":"arxiv_source","source_observed_at":"2026-08-15T21:41:40.481629Z"},"links":{"citing_paper":"/paper/2505.09612"},"observation_digest":"sha256:e5ae68153ee8fd59f9561a0add70c59f53961031bc351ff0470a520ce528d2ee","observation_id":"898e421b-82c8-48a4-9dcc-4b676336b21c","resolution":{"observed_at":"2026-08-15T21:41:40.790577Z","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-15T21:41:40.777251Z","title":"Discriminatory analysis: nonparametric discrimination, small sample performance","venue":null,"work_id":"4d376f6a-3bdc-4525-8f7c-d290bab4474b","year":1952},"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":21,"source":"arxiv_source","source_observed_at":"2026-08-15T21:41:40.485048Z"},"links":{"citing_paper":"/paper/2505.09612"},"observation_digest":"sha256:bf571fd3f920647ddf68b646c746cf4b82db0342d739afdc85fffe730813ae73","observation_id":"65c9426a-297f-4c2e-a409-d7af25e615c3","resolution":{"observed_at":"2026-08-15T21:41:40.780277Z","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-15T21:41:40.766025Z","title":"Bandwidth selection in kernel density estimation: Oracle inequalities and adaptive minimax optimality","venue":null,"work_id":"5308850d-5b21-4996-bb7f-f3fa35f1845f","year":2011},"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":22,"source":"arxiv_source","source_observed_at":"2026-08-15T21:41:40.489172Z"},"links":{"citing_paper":"/paper/2505.09612"},"observation_digest":"sha256:d60000ba74bed115fcae3bd2fde082abd966e16ff2d6720671d36f6855e362bc","observation_id":"b2a2e2ec-2b9f-43b5-8984-a104bd65bead","resolution":{"observed_at":"2026-08-15T21:41:40.770054Z","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-15T21:41:40.755403Z","title":"General selection rule from a family of linear estimators","venue":null,"work_id":"fe5adf94-7047-43fa-ba70-76024497ee4c","year":2013},"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":23,"source":"arxiv_source","source_observed_at":"2026-08-15T21:41:40.492913Z"},"links":{"citing_paper":"/paper/2505.09612"},"observation_digest":"sha256:c2611232802fac6cc0ba68a7d79adfee3d7998d7052fd04ef38d9d6226b102ff","observation_id":"c2337cce-3470-455e-af95-b3b7efe80f42","resolution":{"observed_at":"2026-08-15T21:41:40.758984Z","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-15T21:41:40.744721Z","title":"Global optimality in inductive matrix completion","venue":null,"work_id":"2b010e8f-770f-42e5-b6af-ddf3a7e4a458","year":2018},"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":24,"source":"arxiv_source","source_observed_at":"2026-08-15T21:41:40.495932Z"},"links":{"citing_paper":"/paper/2505.09612"},"observation_digest":"sha256:e372aa173559c0d136c4b54e68f6809283ebbf14ce13f8051c0bc5f71f1fe51b","observation_id":"fbc59ae8-0ece-442f-9003-a3afd60c881e","resolution":{"observed_at":"2026-08-15T21:41:40.748121Z","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-15T21:41:40.734567Z","title":"Convex co-embedding for matrix completion with predictive side information","venue":null,"work_id":"71948a4d-ad93-4448-8c08-fec822245054","year":2017},"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":25,"source":"arxiv_source","source_observed_at":"2026-08-15T21:41:40.499231Z"},"links":{"citing_paper":"/paper/2505.09612"},"observation_digest":"sha256:4c9e890ee7e00b557c975b71d696b52ef7f6e67cf3ce90c2b843b56e12c6114d","observation_id":"5cc758b4-4ce3-49c7-b9b8-cfab7255f2bb","resolution":{"observed_at":"2026-08-15T21:41:40.737895Z","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-15T21:41:40.723789Z","title":"Matrix completion and low-rank svd via fast alternating least squares","venue":null,"work_id":"90823a03-afdd-4684-aed1-e7d03ffe1acf","year":2015},"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":26,"source":"arxiv_source","source_observed_at":"2026-08-15T21:41:40.502282Z"},"links":{"citing_paper":"/paper/2505.09612"},"observation_digest":"sha256:0a980defeebb3a125b950c5c9f4763b033f1f6e7085fe744739f1cb84ee10f87","observation_id":"1b25007b-3173-4bb5-b39e-be5d65d1b823","resolution":{"observed_at":"2026-08-15T21:41:40.727453Z","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-15T21:41:40.505752Z","title":"Provable inductive matrix completion","venue":null,"work_id":null,"year":2013},"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":27,"source":"arxiv_source","source_observed_at":"2026-08-15T21:41:40.505752Z"},"links":{"cited_paper":"/paper/1306.0626","citing_paper":"/paper/2505.09612"},"observation_digest":"sha256:a738e66ecb99bdc1a361aaadedc196a6ea83261a285356a50bca3ea124e62c39","observation_id":"40cbbf4b-12ba-42d6-b2ea-27aa9c2bff10","resolution":{"observed_at":"2026-08-15T21:41:40.505752Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:41:40.509051Z","title":"Matrix factorization techniques for recommender systems","venue":null,"work_id":null,"year":2009},"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":28,"source":"arxiv_source","source_observed_at":"2026-08-15T21:41:40.509051Z"},"links":{"citing_paper":"/paper/2505.09612"},"observation_digest":"sha256:f8b6e72ae877ce82029fc60f7bcef0d5f1070f221cfbdf65d3a4b6f8786a8e2d","observation_id":"168e2a77-9fb7-45d1-9c77-0f33b1caab54","resolution":{"observed_at":"2026-08-15T21:41:40.509051Z","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-15T21:41:40.707142Z","title":"An inequality for the analysis of variance","venue":null,"work_id":"af90a09d-b605-4599-adca-d9905d2a3b85","year":2020},"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":29,"source":"arxiv_source","source_observed_at":"2026-08-15T21:41:40.511945Z"},"links":{"citing_paper":"/paper/2505.09612"},"observation_digest":"sha256:f9e5fd32f6f2600ad787019ae671cd207f3aa770b84da3e42aa75744b575c290","observation_id":"c99db447-bda0-477c-ae1a-ab0b6baa4643","resolution":{"observed_at":"2026-08-15T21:41:40.710246Z","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-15T21:41:40.696838Z","title":"A sparse interactive model for matrix completion with side information","venue":null,"work_id":"0b29a40c-dd5e-4992-8993-d744e4523379","year":2016},"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":30,"source":"arxiv_source","source_observed_at":"2026-08-15T21:41:40.514613Z"},"links":{"citing_paper":"/paper/2505.09612"},"observation_digest":"sha256:d71dc0b6a4b437f286137000b7f574f6b4801a974a903a942cdba5b6536380a0","observation_id":"21457e84-bce5-462d-a27d-8ef0371ecfc8","resolution":{"observed_at":"2026-08-15T21:41:40.700099Z","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-15T21:41:40.685776Z","title":"Nearest neighbors for matrix estimation interpreted as blind regression for latent variable model","venue":null,"work_id":"e312acee-ca1e-43c3-96b0-2725334728a3","year":2019},"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":31,"source":"arxiv_source","source_observed_at":"2026-08-15T21:41:40.517858Z"},"links":{"citing_paper":"/paper/2505.09612"},"observation_digest":"sha256:164b3d32d0ccf567ca864de0f23f3f38392d2d2f9560e5bc3913e40a52b09b45","observation_id":"30b8c31b-5122-4e17-a301-86e7c6a6856c","resolution":{"observed_at":"2026-08-15T21:41:40.689785Z","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-15T21:41:40.674785Z","title":"Trust your neighbors: A comprehensive survey of neighborhood-based methods for recommender systems","venue":null,"work_id":"3641627c-dd12-43cc-8e8d-5ba9e2823be9","year":2021},"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":32,"source":"arxiv_source","source_observed_at":"2026-08-15T21:41:40.520404Z"},"links":{"citing_paper":"/paper/2505.09612"},"observation_digest":"sha256:ec6f5754215c6c1b595893ea0f412c1c929f16b073887e0668f75cab5485a0eb","observation_id":"877b4709-f52d-4912-a93f-e7944e852c73","resolution":{"observed_at":"2026-08-15T21:41:40.679097Z","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-15T21:41:40.665003Z","title":"Alhazen and the nearest neighbor rule","venue":null,"work_id":"e4229f3f-5605-4dd6-af72-267c94e1cd93","year":2014},"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":33,"source":"arxiv_source","source_observed_at":"2026-08-15T21:41:40.522764Z"},"links":{"citing_paper":"/paper/2505.09612"},"observation_digest":"sha256:157ec9f90fb72bc5ed2f573d3b3c410b633f5c0542b5098ee427c4c199119a6d","observation_id":"22b0a257-cf2e-4c1e-8ddf-c757970f497e","resolution":{"observed_at":"2026-08-15T21:41:40.667756Z","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-15T21:41:40.525948Z","title":"A simpler approach to matrix completion","venue":null,"work_id":null,"year":2011},"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":34,"source":"arxiv_source","source_observed_at":"2026-08-15T21:41:40.525948Z"},"links":{"citing_paper":"/paper/2505.09612"},"observation_digest":"sha256:58ace4ec91d6aff99a07fea22e97d7fe50a1e2f66a3dfc2ceff604d2fca43b66","observation_id":"8256b73b-b425-452a-ae79-d5fba6a10b6d","resolution":{"observed_at":"2026-08-15T21:41:40.525948Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:41:40.650441Z","title":"Speedup matrix completion with side information: Application to multi-label learning","venue":null,"work_id":"80fed179-0b53-46ac-b5c9-447b5891a015","year":2013},"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":36,"source":"arxiv_source","source_observed_at":"2026-08-15T21:41:40.532376Z"},"links":{"citing_paper":"/paper/2505.09612"},"observation_digest":"sha256:95ff1849aec2c91fabb8db0cd6011c5b6dff0c72953ab8d85a307d717d94a84d","observation_id":"4c79cc6c-fe4d-44c8-8999-f5a4282afad5","resolution":{"observed_at":"2026-08-15T21:41:40.653210Z","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-15T21:41:40.640955Z","title":"Nonparametric matrix estimation with one-sided covariates","venue":null,"work_id":"0e10b57f-48fe-4b80-8e20-a9ff35edc1fe","year":2022},"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":37,"source":"arxiv_source","source_observed_at":"2026-08-15T21:41:40.535674Z"},"links":{"citing_paper":"/paper/2505.09612"},"observation_digest":"sha256:74f4809c062b7e0e4aa82cb8bf894940c38b6f9ddcf68e1508fdfbc7011ad34d","observation_id":"de1480a4-bdc7-453f-a3af-ce5ba0a65ec7","resolution":{"observed_at":"2026-08-15T21:41:40.644335Z","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-15T21:41:40.629627Z","title":"Efficient matrix sensing using rank-1 gaussian measurements","venue":null,"work_id":"a98959e1-b152-4b4c-8740-36070cd4d053","year":2015},"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":38,"source":"arxiv_source","source_observed_at":"2026-08-15T21:41:40.539671Z"},"links":{"citing_paper":"/paper/2505.09612"},"observation_digest":"sha256:b95e03e05b0569f8db02cfc6dbee29d0bac5471909835d8cb99d3e2d169908a6","observation_id":"43f4f163-ce56-4bc4-a04d-d85aeba93ddf","resolution":{"observed_at":"2026-08-15T21:41:40.632966Z","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"}}],"paper":{"arxiv_id":"2505.09612","last_updated":"2025-05-14T17:59:17Z","latest_version":1,"primary_category":"stat.ML","snapshot_observed_at":"2026-08-15T21:24:57.141587Z","submitted_at":"2025-05-14T17:59:17Z","title":"Adaptively-weighted Nearest Neighbors for Matrix Completion"},"reference_resolution":{"displayed":38,"state_counts":{"malformed_identifier":0,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":8,"verified_exact":0,"verified_fuzzy":29},"total_outbound_references":38},"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 38 of 38 outbound references and 0 inbound Pith citation observations for arXiv:2505.09612."}