{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:DT2G2ZBYDB7GHZAVVQY6QJG5SN","short_pith_number":"pith:DT2G2ZBY","schema_version":"1.0","canonical_sha256":"1cf46d6438187e63e415ac31e824dd93523478f88fc44d0f74140759672857ee","source":{"kind":"arxiv","id":"1503.02596","version":3},"attestation_state":"computed","paper":{"title":"A Characterization of Deterministic Sampling Patterns for Low-Rank Matrix Completion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.AG"],"primary_cat":"stat.ML","authors_text":"Daniel L. Pimentel-Alarc\\'on, Nigel Boston, Robert D. Nowak","submitted_at":"2015-03-09T18:12:58Z","abstract_excerpt":"Low-rank matrix completion (LRMC) problems arise in a wide variety of applications. Previous theory mainly provides conditions for completion under missing-at-random samplings. This paper studies deterministic conditions for completion. An incomplete $d \\times N$ matrix is finitely rank-$r$ completable if there are at most finitely many rank-$r$ matrices that agree with all its observed entries. Finite completability is the tipping point in LRMC, as a few additional samples of a finitely completable matrix guarantee its unique completability. The main contribution of this paper is a determinis"},"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":"1503.02596","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-03-09T18:12:58Z","cross_cats_sorted":["cs.LG","math.AG"],"title_canon_sha256":"ec38a233fa199b6a575971837f4c7ea05d15aafe1bb182db11fc76169ea0687d","abstract_canon_sha256":"8a2720056c02fb7149b2aff6100bd32c5e5d9d48e00e3d7c401b3d76e8c4db57"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:02:45.972050Z","signature_b64":"zp2fGj9aYqObkWbTJvP6EF1ktavmtpxZtFrLpLtalxmLBqr2JZhOgEAqw3+j+9jwvlIpC5YACwNe3z7I4BEBCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1cf46d6438187e63e415ac31e824dd93523478f88fc44d0f74140759672857ee","last_reissued_at":"2026-05-18T01:02:45.971614Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:02:45.971614Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Characterization of Deterministic Sampling Patterns for Low-Rank Matrix Completion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.AG"],"primary_cat":"stat.ML","authors_text":"Daniel L. Pimentel-Alarc\\'on, Nigel Boston, Robert D. Nowak","submitted_at":"2015-03-09T18:12:58Z","abstract_excerpt":"Low-rank matrix completion (LRMC) problems arise in a wide variety of applications. Previous theory mainly provides conditions for completion under missing-at-random samplings. This paper studies deterministic conditions for completion. An incomplete $d \\times N$ matrix is finitely rank-$r$ completable if there are at most finitely many rank-$r$ matrices that agree with all its observed entries. Finite completability is the tipping point in LRMC, as a few additional samples of a finitely completable matrix guarantee its unique completability. The main contribution of this paper is a determinis"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.02596","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":""},"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":"1503.02596","created_at":"2026-05-18T01:02:45.971671+00:00"},{"alias_kind":"arxiv_version","alias_value":"1503.02596v3","created_at":"2026-05-18T01:02:45.971671+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.02596","created_at":"2026-05-18T01:02:45.971671+00:00"},{"alias_kind":"pith_short_12","alias_value":"DT2G2ZBYDB7G","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_16","alias_value":"DT2G2ZBYDB7GHZAV","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_8","alias_value":"DT2G2ZBY","created_at":"2026-05-18T12:29:17.054201+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DT2G2ZBYDB7GHZAVVQY6QJG5SN","json":"https://pith.science/pith/DT2G2ZBYDB7GHZAVVQY6QJG5SN.json","graph_json":"https://pith.science/api/pith-number/DT2G2ZBYDB7GHZAVVQY6QJG5SN/graph.json","events_json":"https://pith.science/api/pith-number/DT2G2ZBYDB7GHZAVVQY6QJG5SN/events.json","paper":"https://pith.science/paper/DT2G2ZBY"},"agent_actions":{"view_html":"https://pith.science/pith/DT2G2ZBYDB7GHZAVVQY6QJG5SN","download_json":"https://pith.science/pith/DT2G2ZBYDB7GHZAVVQY6QJG5SN.json","view_paper":"https://pith.science/paper/DT2G2ZBY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1503.02596&json=true","fetch_graph":"https://pith.science/api/pith-number/DT2G2ZBYDB7GHZAVVQY6QJG5SN/graph.json","fetch_events":"https://pith.science/api/pith-number/DT2G2ZBYDB7GHZAVVQY6QJG5SN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DT2G2ZBYDB7GHZAVVQY6QJG5SN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DT2G2ZBYDB7GHZAVVQY6QJG5SN/action/storage_attestation","attest_author":"https://pith.science/pith/DT2G2ZBYDB7GHZAVVQY6QJG5SN/action/author_attestation","sign_citation":"https://pith.science/pith/DT2G2ZBYDB7GHZAVVQY6QJG5SN/action/citation_signature","submit_replication":"https://pith.science/pith/DT2G2ZBYDB7GHZAVVQY6QJG5SN/action/replication_record"}},"created_at":"2026-05-18T01:02:45.971671+00:00","updated_at":"2026-05-18T01:02:45.971671+00:00"}