{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:PGQPNAY25NSLS7RAHG6VP5SPKO","short_pith_number":"pith:PGQPNAY2","canonical_record":{"source":{"id":"1803.00186","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-03-01T03:11:11Z","cross_cats_sorted":["cs.LG","math.OC"],"title_canon_sha256":"2a6ca88a7fa5ee06cbb3b0b82982d07c13e57aedf7e761c3fcd097a6c3d94b46","abstract_canon_sha256":"5777bdba5be34401bdb598ed43989e0238b3e42342d7a21c4b31c9dc87f05428"},"schema_version":"1.0"},"canonical_sha256":"79a0f6831aeb64b97e2039bd57f64f53bb6ad1a6d07705828baa35ec0d366a32","source":{"kind":"arxiv","id":"1803.00186","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.00186","created_at":"2026-05-18T00:22:13Z"},{"alias_kind":"arxiv_version","alias_value":"1803.00186v1","created_at":"2026-05-18T00:22:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.00186","created_at":"2026-05-18T00:22:13Z"},{"alias_kind":"pith_short_12","alias_value":"PGQPNAY25NSL","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"PGQPNAY25NSLS7RA","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"PGQPNAY2","created_at":"2026-05-18T12:32:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:PGQPNAY25NSLS7RAHG6VP5SPKO","target":"record","payload":{"canonical_record":{"source":{"id":"1803.00186","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-03-01T03:11:11Z","cross_cats_sorted":["cs.LG","math.OC"],"title_canon_sha256":"2a6ca88a7fa5ee06cbb3b0b82982d07c13e57aedf7e761c3fcd097a6c3d94b46","abstract_canon_sha256":"5777bdba5be34401bdb598ed43989e0238b3e42342d7a21c4b31c9dc87f05428"},"schema_version":"1.0"},"canonical_sha256":"79a0f6831aeb64b97e2039bd57f64f53bb6ad1a6d07705828baa35ec0d366a32","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:13.092925Z","signature_b64":"9UZ1A2PqF2JScX4H3FmHetDjoX2jCGCiVOdZayh+zbl4ZF7AH3fC5sycZwe8kuMo+BO9FFCRXYax8oc2evHyBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"79a0f6831aeb64b97e2039bd57f64f53bb6ad1a6d07705828baa35ec0d366a32","last_reissued_at":"2026-05-18T00:22:13.092223Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:13.092223Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1803.00186","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:22:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HNot1YiIK6jkmz0NJ8iUqxIEdMKqiFL+ZhwoL1I2VdcELWVe9MP962joSrfL/ycTcLe1xSDuXF5KtPphZ4x2DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T22:21:12.176739Z"},"content_sha256":"9537aded4370bfbaf3350deeb33438c4d04346acaff46e5fd439667438798877","schema_version":"1.0","event_id":"sha256:9537aded4370bfbaf3350deeb33438c4d04346acaff46e5fd439667438798877"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:PGQPNAY25NSLS7RAHG6VP5SPKO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Smoothed analysis for low-rank solutions to semidefinite programs in quadratic penalty form","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.OC"],"primary_cat":"stat.ML","authors_text":"Nicolas Boumal, Praneeth Netrapalli, Prateek Jain, Srinadh Bhojanapalli","submitted_at":"2018-03-01T03:11:11Z","abstract_excerpt":"Semidefinite programs (SDP) are important in learning and combinatorial optimization with numerous applications. In pursuit of low-rank solutions and low complexity algorithms, we consider the Burer--Monteiro factorization approach for solving SDPs. We show that all approximate local optima are global optima for the penalty formulation of appropriately rank-constrained SDPs as long as the number of constraints scales sub-quadratically with the desired rank of the optimal solution. Our result is based on a simple penalty function formulation of the rank-constrained SDP along with a smoothed ana"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.00186","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:22:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BF9Vt7NgbBAPQ2bruBN81RIc2by8sfPP7r8rM2Z1gp0ZtjTMMLGSHxwJBGBxD2Q4zb149XkdICc9/KT9MJ54Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T22:21:12.177387Z"},"content_sha256":"8383140db8fbb4612b951170f065a7475476ba1c86285a84f9c9268efa410bd2","schema_version":"1.0","event_id":"sha256:8383140db8fbb4612b951170f065a7475476ba1c86285a84f9c9268efa410bd2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PGQPNAY25NSLS7RAHG6VP5SPKO/bundle.json","state_url":"https://pith.science/pith/PGQPNAY25NSLS7RAHG6VP5SPKO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PGQPNAY25NSLS7RAHG6VP5SPKO/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-26T22:21:12Z","links":{"resolver":"https://pith.science/pith/PGQPNAY25NSLS7RAHG6VP5SPKO","bundle":"https://pith.science/pith/PGQPNAY25NSLS7RAHG6VP5SPKO/bundle.json","state":"https://pith.science/pith/PGQPNAY25NSLS7RAHG6VP5SPKO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PGQPNAY25NSLS7RAHG6VP5SPKO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:PGQPNAY25NSLS7RAHG6VP5SPKO","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":"5777bdba5be34401bdb598ed43989e0238b3e42342d7a21c4b31c9dc87f05428","cross_cats_sorted":["cs.LG","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-03-01T03:11:11Z","title_canon_sha256":"2a6ca88a7fa5ee06cbb3b0b82982d07c13e57aedf7e761c3fcd097a6c3d94b46"},"schema_version":"1.0","source":{"id":"1803.00186","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.00186","created_at":"2026-05-18T00:22:13Z"},{"alias_kind":"arxiv_version","alias_value":"1803.00186v1","created_at":"2026-05-18T00:22:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.00186","created_at":"2026-05-18T00:22:13Z"},{"alias_kind":"pith_short_12","alias_value":"PGQPNAY25NSL","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"PGQPNAY25NSLS7RA","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"PGQPNAY2","created_at":"2026-05-18T12:32:43Z"}],"graph_snapshots":[{"event_id":"sha256:8383140db8fbb4612b951170f065a7475476ba1c86285a84f9c9268efa410bd2","target":"graph","created_at":"2026-05-18T00:22:13Z","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":"Semidefinite programs (SDP) are important in learning and combinatorial optimization with numerous applications. In pursuit of low-rank solutions and low complexity algorithms, we consider the Burer--Monteiro factorization approach for solving SDPs. We show that all approximate local optima are global optima for the penalty formulation of appropriately rank-constrained SDPs as long as the number of constraints scales sub-quadratically with the desired rank of the optimal solution. Our result is based on a simple penalty function formulation of the rank-constrained SDP along with a smoothed ana","authors_text":"Nicolas Boumal, Praneeth Netrapalli, Prateek Jain, Srinadh Bhojanapalli","cross_cats":["cs.LG","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-03-01T03:11:11Z","title":"Smoothed analysis for low-rank solutions to semidefinite programs in quadratic penalty form"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.00186","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:9537aded4370bfbaf3350deeb33438c4d04346acaff46e5fd439667438798877","target":"record","created_at":"2026-05-18T00:22:13Z","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":"5777bdba5be34401bdb598ed43989e0238b3e42342d7a21c4b31c9dc87f05428","cross_cats_sorted":["cs.LG","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-03-01T03:11:11Z","title_canon_sha256":"2a6ca88a7fa5ee06cbb3b0b82982d07c13e57aedf7e761c3fcd097a6c3d94b46"},"schema_version":"1.0","source":{"id":"1803.00186","kind":"arxiv","version":1}},"canonical_sha256":"79a0f6831aeb64b97e2039bd57f64f53bb6ad1a6d07705828baa35ec0d366a32","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"79a0f6831aeb64b97e2039bd57f64f53bb6ad1a6d07705828baa35ec0d366a32","first_computed_at":"2026-05-18T00:22:13.092223Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:22:13.092223Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9UZ1A2PqF2JScX4H3FmHetDjoX2jCGCiVOdZayh+zbl4ZF7AH3fC5sycZwe8kuMo+BO9FFCRXYax8oc2evHyBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:22:13.092925Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.00186","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9537aded4370bfbaf3350deeb33438c4d04346acaff46e5fd439667438798877","sha256:8383140db8fbb4612b951170f065a7475476ba1c86285a84f9c9268efa410bd2"],"state_sha256":"8da767b673773d3b1caf3660c49ad08303440fc135c45f85fafea539e74dc9e1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T/vDvr2dLlOpt31hqQ4J4BLMS5f5gugHQmPS92qZWp0h5cfMikLQTuCWzKq2o3LkxX36k8ZGhvTqkYF9GukvDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T22:21:12.181173Z","bundle_sha256":"bdfa4c4fa05005159d9244a6664f9c22afc2ad6bc3b6d806f1d0b35850071f3c"}}