{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:YSRVKIW2RWRT7GCBLK7YGQXYWF","short_pith_number":"pith:YSRVKIW2","schema_version":"1.0","canonical_sha256":"c4a35522da8da33f98415abf8342f8b17898a7727423f92cf0ebf40301636326","source":{"kind":"arxiv","id":"2106.02290","version":3},"attestation_state":"computed","paper":{"title":"Matrix completion with data-dependent missingness probabilities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT","math.PR","stat.ME","stat.TH"],"primary_cat":"math.ST","authors_text":"Sohom Bhattacharya, Sourav Chatterjee","submitted_at":"2021-06-04T07:07:14Z","abstract_excerpt":"The problem of completing a large matrix with lots of missing entries has received widespread attention in the last couple of decades. Two popular approaches to the matrix completion problem are based on singular value thresholding and nuclear norm minimization. Most of the past works on this subject assume that there is a single number $p$ such that each entry of the matrix is available independently with probability $p$ and missing otherwise. This assumption may not be realistic for many applications. In this work, we replace it with the assumption that the probability that an entry is avail"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2106.02290","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2021-06-04T07:07:14Z","cross_cats_sorted":["cs.IT","math.IT","math.PR","stat.ME","stat.TH"],"title_canon_sha256":"50de21f90e8a4d4808317fcd9e6725efb02f651eb6444d29c540dcf57e375896","abstract_canon_sha256":"05baa041487f6877a2773bd0eed641411fc2a840cf7c486b8d9930e5421d28b2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:16:51.828920Z","signature_b64":"VYn2whSpCwGTbFI50u+JccxVfjA3oYt85VMCD8Dj9rHbHIaIv280MmZ+7gXiEp3DayG89mcuhd/7/sBGZoZgAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c4a35522da8da33f98415abf8342f8b17898a7727423f92cf0ebf40301636326","last_reissued_at":"2026-07-05T04:16:51.828502Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:16:51.828502Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Matrix completion with data-dependent missingness probabilities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT","math.PR","stat.ME","stat.TH"],"primary_cat":"math.ST","authors_text":"Sohom Bhattacharya, Sourav Chatterjee","submitted_at":"2021-06-04T07:07:14Z","abstract_excerpt":"The problem of completing a large matrix with lots of missing entries has received widespread attention in the last couple of decades. Two popular approaches to the matrix completion problem are based on singular value thresholding and nuclear norm minimization. Most of the past works on this subject assume that there is a single number $p$ such that each entry of the matrix is available independently with probability $p$ and missing otherwise. This assumption may not be realistic for many applications. In this work, we replace it with the assumption that the probability that an entry is avail"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2106.02290","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2106.02290/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2106.02290","created_at":"2026-07-05T04:16:51.828569+00:00"},{"alias_kind":"arxiv_version","alias_value":"2106.02290v3","created_at":"2026-07-05T04:16:51.828569+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2106.02290","created_at":"2026-07-05T04:16:51.828569+00:00"},{"alias_kind":"pith_short_12","alias_value":"YSRVKIW2RWRT","created_at":"2026-07-05T04:16:51.828569+00:00"},{"alias_kind":"pith_short_16","alias_value":"YSRVKIW2RWRT7GCB","created_at":"2026-07-05T04:16:51.828569+00:00"},{"alias_kind":"pith_short_8","alias_value":"YSRVKIW2","created_at":"2026-07-05T04:16:51.828569+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2411.12965","citing_title":"Two-Sided Nearest Neighbors: An adaptive and minimax optimal procedure for matrix completion","ref_index":6,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YSRVKIW2RWRT7GCBLK7YGQXYWF","json":"https://pith.science/pith/YSRVKIW2RWRT7GCBLK7YGQXYWF.json","graph_json":"https://pith.science/api/pith-number/YSRVKIW2RWRT7GCBLK7YGQXYWF/graph.json","events_json":"https://pith.science/api/pith-number/YSRVKIW2RWRT7GCBLK7YGQXYWF/events.json","paper":"https://pith.science/paper/YSRVKIW2"},"agent_actions":{"view_html":"https://pith.science/pith/YSRVKIW2RWRT7GCBLK7YGQXYWF","download_json":"https://pith.science/pith/YSRVKIW2RWRT7GCBLK7YGQXYWF.json","view_paper":"https://pith.science/paper/YSRVKIW2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2106.02290&json=true","fetch_graph":"https://pith.science/api/pith-number/YSRVKIW2RWRT7GCBLK7YGQXYWF/graph.json","fetch_events":"https://pith.science/api/pith-number/YSRVKIW2RWRT7GCBLK7YGQXYWF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YSRVKIW2RWRT7GCBLK7YGQXYWF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YSRVKIW2RWRT7GCBLK7YGQXYWF/action/storage_attestation","attest_author":"https://pith.science/pith/YSRVKIW2RWRT7GCBLK7YGQXYWF/action/author_attestation","sign_citation":"https://pith.science/pith/YSRVKIW2RWRT7GCBLK7YGQXYWF/action/citation_signature","submit_replication":"https://pith.science/pith/YSRVKIW2RWRT7GCBLK7YGQXYWF/action/replication_record"}},"created_at":"2026-07-05T04:16:51.828569+00:00","updated_at":"2026-07-05T04:16:51.828569+00:00"}