{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:S26VJGUOUJ5X2PWRTL23OUTBIL","short_pith_number":"pith:S26VJGUO","canonical_record":{"source":{"id":"1702.07945","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-02-25T20:49:05Z","cross_cats_sorted":["math.IT","math.OC"],"title_canon_sha256":"a70bd6a7543a7a18e0a1056b91eb6c361500a60829f2cd048ff16f6a63a408c5","abstract_canon_sha256":"b79a8e0796955bbb5ada4bc187854cd3f68019bc137303d426ed9bcb638c7afc"},"schema_version":"1.0"},"canonical_sha256":"96bd549a8ea27b7d3ed19af5b7526142dcdfea8728c5cfcd0fea66b40ae35d54","source":{"kind":"arxiv","id":"1702.07945","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.07945","created_at":"2026-05-18T00:11:43Z"},{"alias_kind":"arxiv_version","alias_value":"1702.07945v3","created_at":"2026-05-18T00:11:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.07945","created_at":"2026-05-18T00:11:43Z"},{"alias_kind":"pith_short_12","alias_value":"S26VJGUOUJ5X","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"S26VJGUOUJ5X2PWR","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"S26VJGUO","created_at":"2026-05-18T12:31:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:S26VJGUOUJ5X2PWRTL23OUTBIL","target":"record","payload":{"canonical_record":{"source":{"id":"1702.07945","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-02-25T20:49:05Z","cross_cats_sorted":["math.IT","math.OC"],"title_canon_sha256":"a70bd6a7543a7a18e0a1056b91eb6c361500a60829f2cd048ff16f6a63a408c5","abstract_canon_sha256":"b79a8e0796955bbb5ada4bc187854cd3f68019bc137303d426ed9bcb638c7afc"},"schema_version":"1.0"},"canonical_sha256":"96bd549a8ea27b7d3ed19af5b7526142dcdfea8728c5cfcd0fea66b40ae35d54","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:11:43.947759Z","signature_b64":"ez0EJnSvHCEDZ4AVPZbye3cmhgiYLlokyfn/5QiZFVtc82RUdLUxVYL7K2+O2eWY3cGLyDGTzWjk/J3jYy8wAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"96bd549a8ea27b7d3ed19af5b7526142dcdfea8728c5cfcd0fea66b40ae35d54","last_reissued_at":"2026-05-18T00:11:43.946984Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:11:43.946984Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1702.07945","source_version":3,"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:11:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zZQomiiYa43LFHnyvT5yuySAriAMDV4kiVsoZ9/wDXDTGpLuu+9hJLuoa+rvPNHiXJOElszmOfIkCqy19meUAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T02:18:54.067336Z"},"content_sha256":"ba9d1e3cec5e9bf19e84d90fa6d1f5e6c8d6633ab9e26f55e7747f4008993849","schema_version":"1.0","event_id":"sha256:ba9d1e3cec5e9bf19e84d90fa6d1f5e6c8d6633ab9e26f55e7747f4008993849"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:S26VJGUOUJ5X2PWRTL23OUTBIL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Global Optimality in Low-rank Matrix Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.OC"],"primary_cat":"cs.IT","authors_text":"Gongguo Tang, Michael B. Wakin, Qiuwei Li, Zhihui Zhu","submitted_at":"2017-02-25T20:49:05Z","abstract_excerpt":"This paper considers the minimization of a general objective function $f(X)$ over the set of rectangular $n\\times m$ matrices that have rank at most $r$. To reduce the computational burden, we factorize the variable $X$ into a product of two smaller matrices and optimize over these two matrices instead of $X$. Despite the resulting nonconvexity, recent studies in matrix completion and sensing have shown that the factored problem has no spurious local minima and obeys the so-called strict saddle property (the function has a directional negative curvature at all critical points but local minima)"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.07945","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"},"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:11:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"h2ZQ8uZo+K/flqzjvxWlaALJVIPyacS3z3Z9vH0aQPcO1QWFtV3OY4a9Tc4B6F3GcVcbAkoP2AvHxtiC7uXhDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T02:18:54.068059Z"},"content_sha256":"3d0ee466e364b6a396015cb22f23b499e48aa77f259f6e4b76ba728771b6e329","schema_version":"1.0","event_id":"sha256:3d0ee466e364b6a396015cb22f23b499e48aa77f259f6e4b76ba728771b6e329"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/S26VJGUOUJ5X2PWRTL23OUTBIL/bundle.json","state_url":"https://pith.science/pith/S26VJGUOUJ5X2PWRTL23OUTBIL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/S26VJGUOUJ5X2PWRTL23OUTBIL/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-05-30T02:18:54Z","links":{"resolver":"https://pith.science/pith/S26VJGUOUJ5X2PWRTL23OUTBIL","bundle":"https://pith.science/pith/S26VJGUOUJ5X2PWRTL23OUTBIL/bundle.json","state":"https://pith.science/pith/S26VJGUOUJ5X2PWRTL23OUTBIL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/S26VJGUOUJ5X2PWRTL23OUTBIL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:S26VJGUOUJ5X2PWRTL23OUTBIL","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":"b79a8e0796955bbb5ada4bc187854cd3f68019bc137303d426ed9bcb638c7afc","cross_cats_sorted":["math.IT","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-02-25T20:49:05Z","title_canon_sha256":"a70bd6a7543a7a18e0a1056b91eb6c361500a60829f2cd048ff16f6a63a408c5"},"schema_version":"1.0","source":{"id":"1702.07945","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.07945","created_at":"2026-05-18T00:11:43Z"},{"alias_kind":"arxiv_version","alias_value":"1702.07945v3","created_at":"2026-05-18T00:11:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.07945","created_at":"2026-05-18T00:11:43Z"},{"alias_kind":"pith_short_12","alias_value":"S26VJGUOUJ5X","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"S26VJGUOUJ5X2PWR","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"S26VJGUO","created_at":"2026-05-18T12:31:43Z"}],"graph_snapshots":[{"event_id":"sha256:3d0ee466e364b6a396015cb22f23b499e48aa77f259f6e4b76ba728771b6e329","target":"graph","created_at":"2026-05-18T00:11:43Z","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 considers the minimization of a general objective function $f(X)$ over the set of rectangular $n\\times m$ matrices that have rank at most $r$. To reduce the computational burden, we factorize the variable $X$ into a product of two smaller matrices and optimize over these two matrices instead of $X$. Despite the resulting nonconvexity, recent studies in matrix completion and sensing have shown that the factored problem has no spurious local minima and obeys the so-called strict saddle property (the function has a directional negative curvature at all critical points but local minima)","authors_text":"Gongguo Tang, Michael B. Wakin, Qiuwei Li, Zhihui Zhu","cross_cats":["math.IT","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-02-25T20:49:05Z","title":"Global Optimality in Low-rank Matrix Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.07945","kind":"arxiv","version":3},"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:ba9d1e3cec5e9bf19e84d90fa6d1f5e6c8d6633ab9e26f55e7747f4008993849","target":"record","created_at":"2026-05-18T00:11:43Z","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":"b79a8e0796955bbb5ada4bc187854cd3f68019bc137303d426ed9bcb638c7afc","cross_cats_sorted":["math.IT","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-02-25T20:49:05Z","title_canon_sha256":"a70bd6a7543a7a18e0a1056b91eb6c361500a60829f2cd048ff16f6a63a408c5"},"schema_version":"1.0","source":{"id":"1702.07945","kind":"arxiv","version":3}},"canonical_sha256":"96bd549a8ea27b7d3ed19af5b7526142dcdfea8728c5cfcd0fea66b40ae35d54","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"96bd549a8ea27b7d3ed19af5b7526142dcdfea8728c5cfcd0fea66b40ae35d54","first_computed_at":"2026-05-18T00:11:43.946984Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:11:43.946984Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ez0EJnSvHCEDZ4AVPZbye3cmhgiYLlokyfn/5QiZFVtc82RUdLUxVYL7K2+O2eWY3cGLyDGTzWjk/J3jYy8wAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:11:43.947759Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.07945","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ba9d1e3cec5e9bf19e84d90fa6d1f5e6c8d6633ab9e26f55e7747f4008993849","sha256:3d0ee466e364b6a396015cb22f23b499e48aa77f259f6e4b76ba728771b6e329"],"state_sha256":"48d18bbe2f4f8ae57f010b21e5ca3e08bd35a61f9904c6a97308462cb3e1d4e8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M/70DoSsPVByrsnxnpAC35FycpENywMa/Bi1tucjGDxj00d3SNT+2tBn6PeuvoTxJikiQwEOC3VoPBY8yKPtAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T02:18:54.071715Z","bundle_sha256":"17cc193ea2d5fa57a2d577eee5e3cf26f43259480f79202ecfe682d218c1e3af"}}