{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:XTZWBOHMITFHZFFVJ2P6YSIMFO","short_pith_number":"pith:XTZWBOHM","canonical_record":{"source":{"id":"1801.00368","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2017-12-31T22:31:56Z","cross_cats_sorted":[],"title_canon_sha256":"539110b5fbfb61f27f84f2ff3c945135da8ced66161397776360022a94ab7710","abstract_canon_sha256":"f12123078f28adebf844267e59fe387b3c81469bbe2fddf50846ada654a846a7"},"schema_version":"1.0"},"canonical_sha256":"bcf360b8ec44ca7c94b54e9fec490c2b947fc6212af40e275c9e096d26708978","source":{"kind":"arxiv","id":"1801.00368","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.00368","created_at":"2026-05-18T00:26:58Z"},{"alias_kind":"arxiv_version","alias_value":"1801.00368v1","created_at":"2026-05-18T00:26:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.00368","created_at":"2026-05-18T00:26:58Z"},{"alias_kind":"pith_short_12","alias_value":"XTZWBOHMITFH","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"XTZWBOHMITFHZFFV","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"XTZWBOHM","created_at":"2026-05-18T12:31:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:XTZWBOHMITFHZFFVJ2P6YSIMFO","target":"record","payload":{"canonical_record":{"source":{"id":"1801.00368","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2017-12-31T22:31:56Z","cross_cats_sorted":[],"title_canon_sha256":"539110b5fbfb61f27f84f2ff3c945135da8ced66161397776360022a94ab7710","abstract_canon_sha256":"f12123078f28adebf844267e59fe387b3c81469bbe2fddf50846ada654a846a7"},"schema_version":"1.0"},"canonical_sha256":"bcf360b8ec44ca7c94b54e9fec490c2b947fc6212af40e275c9e096d26708978","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:26:58.535938Z","signature_b64":"4hOeu/s4+8OP9RXNaIXtmBBgly6V7UmKvk77G41lBchDu5/5RIL8uqdct1/1Fzy34LLd/xmnjEqn3FZ483ysDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bcf360b8ec44ca7c94b54e9fec490c2b947fc6212af40e275c9e096d26708978","last_reissued_at":"2026-05-18T00:26:58.535163Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:26:58.535163Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1801.00368","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:26:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I6ssTnt5iekPixB8bI/z9J9NUVaZhEnFcg8r1sHvYobtq3q/f6pY6g/BaXmOFpFp5NEO/btq+CKcFXCKpHNHCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T10:00:31.816650Z"},"content_sha256":"1cb66128dba72b5abde678bec8be517c8b69042bcb588362ad8ec25133f3ed90","schema_version":"1.0","event_id":"sha256:1cb66128dba72b5abde678bec8be517c8b69042bcb588362ad8ec25133f3ed90"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:XTZWBOHMITFHZFFVJ2P6YSIMFO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Stable rank one matrix completion is solved by two rounds of semidefinite programming relaxation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Augustin Cosse, Laurent Demanet","submitted_at":"2017-12-31T22:31:56Z","abstract_excerpt":"This paper studies the problem of deterministic rank-one matrix completion. It is known that the simplest semidefinite programming relaxation, involving minimization of the nuclear norm, does not in general return the solution for this problem. In this paper, we show that in every instance where the problem has a unique solution, one can provably recover the original matrix through two rounds of semidefinite programming relaxation with minimization of the trace norm. We further show that the solution of the proposed semidefinite program is Lipschitz-stable with respect to perturbations of the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.00368","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:26:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o5kkfAKn5UOjHN6GJzofxZBYA86E72IU83py429he1QbJwWp+CdFH9Xbf8U8O4gIVWhgFIRHpSOcg4MJhyFmDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T10:00:31.816998Z"},"content_sha256":"40fbe4cf1d86c2b7bd0649bd5f2ee29265d46c99911de33fd2836cd2ca62ecf4","schema_version":"1.0","event_id":"sha256:40fbe4cf1d86c2b7bd0649bd5f2ee29265d46c99911de33fd2836cd2ca62ecf4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XTZWBOHMITFHZFFVJ2P6YSIMFO/bundle.json","state_url":"https://pith.science/pith/XTZWBOHMITFHZFFVJ2P6YSIMFO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XTZWBOHMITFHZFFVJ2P6YSIMFO/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-01T10:00:31Z","links":{"resolver":"https://pith.science/pith/XTZWBOHMITFHZFFVJ2P6YSIMFO","bundle":"https://pith.science/pith/XTZWBOHMITFHZFFVJ2P6YSIMFO/bundle.json","state":"https://pith.science/pith/XTZWBOHMITFHZFFVJ2P6YSIMFO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XTZWBOHMITFHZFFVJ2P6YSIMFO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:XTZWBOHMITFHZFFVJ2P6YSIMFO","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":"f12123078f28adebf844267e59fe387b3c81469bbe2fddf50846ada654a846a7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2017-12-31T22:31:56Z","title_canon_sha256":"539110b5fbfb61f27f84f2ff3c945135da8ced66161397776360022a94ab7710"},"schema_version":"1.0","source":{"id":"1801.00368","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.00368","created_at":"2026-05-18T00:26:58Z"},{"alias_kind":"arxiv_version","alias_value":"1801.00368v1","created_at":"2026-05-18T00:26:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.00368","created_at":"2026-05-18T00:26:58Z"},{"alias_kind":"pith_short_12","alias_value":"XTZWBOHMITFH","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"XTZWBOHMITFHZFFV","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"XTZWBOHM","created_at":"2026-05-18T12:31:56Z"}],"graph_snapshots":[{"event_id":"sha256:40fbe4cf1d86c2b7bd0649bd5f2ee29265d46c99911de33fd2836cd2ca62ecf4","target":"graph","created_at":"2026-05-18T00:26:58Z","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":"This paper studies the problem of deterministic rank-one matrix completion. It is known that the simplest semidefinite programming relaxation, involving minimization of the nuclear norm, does not in general return the solution for this problem. In this paper, we show that in every instance where the problem has a unique solution, one can provably recover the original matrix through two rounds of semidefinite programming relaxation with minimization of the trace norm. We further show that the solution of the proposed semidefinite program is Lipschitz-stable with respect to perturbations of the ","authors_text":"Augustin Cosse, Laurent Demanet","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2017-12-31T22:31:56Z","title":"Stable rank one matrix completion is solved by two rounds of semidefinite programming relaxation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.00368","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:1cb66128dba72b5abde678bec8be517c8b69042bcb588362ad8ec25133f3ed90","target":"record","created_at":"2026-05-18T00:26:58Z","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":"f12123078f28adebf844267e59fe387b3c81469bbe2fddf50846ada654a846a7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2017-12-31T22:31:56Z","title_canon_sha256":"539110b5fbfb61f27f84f2ff3c945135da8ced66161397776360022a94ab7710"},"schema_version":"1.0","source":{"id":"1801.00368","kind":"arxiv","version":1}},"canonical_sha256":"bcf360b8ec44ca7c94b54e9fec490c2b947fc6212af40e275c9e096d26708978","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bcf360b8ec44ca7c94b54e9fec490c2b947fc6212af40e275c9e096d26708978","first_computed_at":"2026-05-18T00:26:58.535163Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:26:58.535163Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4hOeu/s4+8OP9RXNaIXtmBBgly6V7UmKvk77G41lBchDu5/5RIL8uqdct1/1Fzy34LLd/xmnjEqn3FZ483ysDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:26:58.535938Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.00368","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1cb66128dba72b5abde678bec8be517c8b69042bcb588362ad8ec25133f3ed90","sha256:40fbe4cf1d86c2b7bd0649bd5f2ee29265d46c99911de33fd2836cd2ca62ecf4"],"state_sha256":"292c9a8a3d63ac3394e6a6d0d4f6d631c5283b0e075661ff10edc6fbca624b5e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iGd7UPAEFH3B7fU0kGRUIxH3JohQuHJllbz9zrrE92Iay94PFg483jYAOcouR8uFx7gMjf5v3j87OeqK2mglBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T10:00:31.819251Z","bundle_sha256":"034a553f63e94f30fea265aa924f5ba13d025bfe6e11902f536aa2b8536cc176"}}