{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:BACPVDZTMJKJ75BFFRZXIMF35R","short_pith_number":"pith:BACPVDZT","canonical_record":{"source":{"id":"1711.02151","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-11-06T20:14:08Z","cross_cats_sorted":[],"title_canon_sha256":"d9fd2d6e9e3927110ab088e904ff1b83fa664822cbc5e1a5f080473216c33765","abstract_canon_sha256":"6a490c524c29e2ca42cda01b065c376d0fe0a7cf245da684b32c7379317ec067"},"schema_version":"1.0"},"canonical_sha256":"0804fa8f3362549ff4252c737430bbec654b4acb37ffd4eac0c08022738140f2","source":{"kind":"arxiv","id":"1711.02151","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.02151","created_at":"2026-05-18T00:31:10Z"},{"alias_kind":"arxiv_version","alias_value":"1711.02151v1","created_at":"2026-05-18T00:31:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.02151","created_at":"2026-05-18T00:31:10Z"},{"alias_kind":"pith_short_12","alias_value":"BACPVDZTMJKJ","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"BACPVDZTMJKJ75BF","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"BACPVDZT","created_at":"2026-05-18T12:31:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:BACPVDZTMJKJ75BFFRZXIMF35R","target":"record","payload":{"canonical_record":{"source":{"id":"1711.02151","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-11-06T20:14:08Z","cross_cats_sorted":[],"title_canon_sha256":"d9fd2d6e9e3927110ab088e904ff1b83fa664822cbc5e1a5f080473216c33765","abstract_canon_sha256":"6a490c524c29e2ca42cda01b065c376d0fe0a7cf245da684b32c7379317ec067"},"schema_version":"1.0"},"canonical_sha256":"0804fa8f3362549ff4252c737430bbec654b4acb37ffd4eac0c08022738140f2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:10.862762Z","signature_b64":"ZLAOwG4KO4n75uk8g9EuT2MsbisjUrUUT6u+wv7pQVtpM6CENKrk6IOY9EXvlI4iCFkrLL0suDsYXGMtB0htCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0804fa8f3362549ff4252c737430bbec654b4acb37ffd4eac0c08022738140f2","last_reissued_at":"2026-05-18T00:31:10.862097Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:10.862097Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.02151","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:31:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E3QhpYyaah9Ym3NBJ4//UVpMtxAJCQPei3bQaftDLSn9UKY1fudZYH8IKX4EAsFtsmSpJGwkSdQyqkL0l/eyBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T18:05:59.757712Z"},"content_sha256":"1518c9b5cf6ba40ab5b2a6c458c57e6eddceb1a7f461a51d2fccf9535edbd07c","schema_version":"1.0","event_id":"sha256:1518c9b5cf6ba40ab5b2a6c458c57e6eddceb1a7f461a51d2fccf9535edbd07c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:BACPVDZTMJKJ75BFFRZXIMF35R","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Convergence of the Alternating Projection Method for Matrix Completion and Sparse Recovery Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Abraham Varghese, Ming Jun Lai","submitted_at":"2017-11-06T20:14:08Z","abstract_excerpt":"In this paper, we study the convergence of Alternating Projection (AP) algorithm for the matrix completion and compressed sensing problems. We also present computational evidence for the excellent performance of the algorithm. Also, in the last section, we prove using algebraic-geometric techniques that, fixing the known positions, if a rank r matrix can be completed in finitely many ways using one given set of known entries, then, for almost all set of known entries, the matrix can be only completed into a rank r matrix in finitely many ways."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.02151","kind":"arxiv","version":1},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:31:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5LY4Tr34QmCqfpESaDDcnUIBr0ii19mpA9ap9l5IEGKJZ6j3EMAtSF9/Xr6aCkk6F4KDTZncMIE7P19iUaBdCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T18:05:59.758180Z"},"content_sha256":"731605b4de4946fa260c9768aa44b16120ff1bc3fcff0d6677387d7a3dbc263a","schema_version":"1.0","event_id":"sha256:731605b4de4946fa260c9768aa44b16120ff1bc3fcff0d6677387d7a3dbc263a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BACPVDZTMJKJ75BFFRZXIMF35R/bundle.json","state_url":"https://pith.science/pith/BACPVDZTMJKJ75BFFRZXIMF35R/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BACPVDZTMJKJ75BFFRZXIMF35R/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-25T18:05:59Z","links":{"resolver":"https://pith.science/pith/BACPVDZTMJKJ75BFFRZXIMF35R","bundle":"https://pith.science/pith/BACPVDZTMJKJ75BFFRZXIMF35R/bundle.json","state":"https://pith.science/pith/BACPVDZTMJKJ75BFFRZXIMF35R/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BACPVDZTMJKJ75BFFRZXIMF35R/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:BACPVDZTMJKJ75BFFRZXIMF35R","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"6a490c524c29e2ca42cda01b065c376d0fe0a7cf245da684b32c7379317ec067","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-11-06T20:14:08Z","title_canon_sha256":"d9fd2d6e9e3927110ab088e904ff1b83fa664822cbc5e1a5f080473216c33765"},"schema_version":"1.0","source":{"id":"1711.02151","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.02151","created_at":"2026-05-18T00:31:10Z"},{"alias_kind":"arxiv_version","alias_value":"1711.02151v1","created_at":"2026-05-18T00:31:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.02151","created_at":"2026-05-18T00:31:10Z"},{"alias_kind":"pith_short_12","alias_value":"BACPVDZTMJKJ","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"BACPVDZTMJKJ75BF","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"BACPVDZT","created_at":"2026-05-18T12:31:08Z"}],"graph_snapshots":[{"event_id":"sha256:731605b4de4946fa260c9768aa44b16120ff1bc3fcff0d6677387d7a3dbc263a","target":"graph","created_at":"2026-05-18T00:31:10Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"In this paper, we study the convergence of Alternating Projection (AP) algorithm for the matrix completion and compressed sensing problems. We also present computational evidence for the excellent performance of the algorithm. Also, in the last section, we prove using algebraic-geometric techniques that, fixing the known positions, if a rank r matrix can be completed in finitely many ways using one given set of known entries, then, for almost all set of known entries, the matrix can be only completed into a rank r matrix in finitely many ways.","authors_text":"Abraham Varghese, Ming Jun Lai","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-11-06T20:14:08Z","title":"On Convergence of the Alternating Projection Method for Matrix Completion and Sparse Recovery Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.02151","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:1518c9b5cf6ba40ab5b2a6c458c57e6eddceb1a7f461a51d2fccf9535edbd07c","target":"record","created_at":"2026-05-18T00:31:10Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"6a490c524c29e2ca42cda01b065c376d0fe0a7cf245da684b32c7379317ec067","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-11-06T20:14:08Z","title_canon_sha256":"d9fd2d6e9e3927110ab088e904ff1b83fa664822cbc5e1a5f080473216c33765"},"schema_version":"1.0","source":{"id":"1711.02151","kind":"arxiv","version":1}},"canonical_sha256":"0804fa8f3362549ff4252c737430bbec654b4acb37ffd4eac0c08022738140f2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0804fa8f3362549ff4252c737430bbec654b4acb37ffd4eac0c08022738140f2","first_computed_at":"2026-05-18T00:31:10.862097Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:31:10.862097Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZLAOwG4KO4n75uk8g9EuT2MsbisjUrUUT6u+wv7pQVtpM6CENKrk6IOY9EXvlI4iCFkrLL0suDsYXGMtB0htCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:31:10.862762Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.02151","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1518c9b5cf6ba40ab5b2a6c458c57e6eddceb1a7f461a51d2fccf9535edbd07c","sha256:731605b4de4946fa260c9768aa44b16120ff1bc3fcff0d6677387d7a3dbc263a"],"state_sha256":"63cda1050d1bf3a0b9af6d6f265c0550a10a8696c65d151e6bfb2451c8b59b8e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2L2vbE8CfawiJ1JpP0Tf6DseHUi/RxFvJ5pkhz76XKlgFyS1oWT0P463FUQrGgVY/NS4jWifoQ6pNu1seDwsAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T18:05:59.760765Z","bundle_sha256":"7a18bdd6e0fbed50836871b48c15dedecf48ae3fcd1c3f2414445a9f9d0f563c"}}