{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:SPVQSZNJWTM5RDKG6BLZPXUBF2","short_pith_number":"pith:SPVQSZNJ","canonical_record":{"source":{"id":"2303.01722","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2023-03-03T05:59:39Z","cross_cats_sorted":[],"title_canon_sha256":"4e9d42f4391ec5da8401f2d20a6074ed20156f833cd7591e3c0baefa94d17059","abstract_canon_sha256":"78015e11c34766270cde7ff8332f7683b4bd900266658f16399ff76be962da01"},"schema_version":"1.0"},"canonical_sha256":"93eb0965a9b4d9d88d46f05797de812e9976f980898a39fd102393f383372ecf","source":{"kind":"arxiv","id":"2303.01722","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2303.01722","created_at":"2026-07-05T10:55:16Z"},{"alias_kind":"arxiv_version","alias_value":"2303.01722v4","created_at":"2026-07-05T10:55:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2303.01722","created_at":"2026-07-05T10:55:16Z"},{"alias_kind":"pith_short_12","alias_value":"SPVQSZNJWTM5","created_at":"2026-07-05T10:55:16Z"},{"alias_kind":"pith_short_16","alias_value":"SPVQSZNJWTM5RDKG","created_at":"2026-07-05T10:55:16Z"},{"alias_kind":"pith_short_8","alias_value":"SPVQSZNJ","created_at":"2026-07-05T10:55:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:SPVQSZNJWTM5RDKG6BLZPXUBF2","target":"record","payload":{"canonical_record":{"source":{"id":"2303.01722","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2023-03-03T05:59:39Z","cross_cats_sorted":[],"title_canon_sha256":"4e9d42f4391ec5da8401f2d20a6074ed20156f833cd7591e3c0baefa94d17059","abstract_canon_sha256":"78015e11c34766270cde7ff8332f7683b4bd900266658f16399ff76be962da01"},"schema_version":"1.0"},"canonical_sha256":"93eb0965a9b4d9d88d46f05797de812e9976f980898a39fd102393f383372ecf","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:55:16.034771Z","signature_b64":"6p/PBiD453bbdk534B7KuFZbmhpn3yq4y6cYEIBqhCbL2xd8zdiaDBMs/eEAQMgP6Hu1S0pnngpKr3rz4jIvAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"93eb0965a9b4d9d88d46f05797de812e9976f980898a39fd102393f383372ecf","last_reissued_at":"2026-07-05T10:55:16.034296Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:55:16.034296Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2303.01722","source_version":4,"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-07-05T10:55:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nKxjctNaMUocUMKX5DJMn7km1nAiU/byYFDJF+cYDT8KHfoJt/Gz5IE9aC1PBEBRiUEFyjkZiYPQtJ6JFm67AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T02:55:06.166242Z"},"content_sha256":"52eddc17dc55135111ae9e0a69311916f47bad930065049cb1d428c2ffcaa601","schema_version":"1.0","event_id":"sha256:52eddc17dc55135111ae9e0a69311916f47bad930065049cb1d428c2ffcaa601"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:SPVQSZNJWTM5RDKG6BLZPXUBF2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Solving Low-Rank Semidefinite Programs via Manifold Optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Jie Wang, Liangbing Hu","submitted_at":"2023-03-03T05:59:39Z","abstract_excerpt":"We propose a manifold optimization approach to solve linear semidefinite programs (SDP) with low-rank solutions, with an emphasis on SDP relaxations for polynomial optimization problems. This approach incorporates the inexact augmented Lagrangian method (ALM) and the Burer-Monteiro factorization, and features the self-adaptive strategies for updating the factorization size and the penalty parameter. We establish global convergence of the inexact ALM, despite the non-convexity brought by the Burer-Monteiro factorization. We further provide a practical algorithm building on the inexact ALM, and "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2303.01722","kind":"arxiv","version":4},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2303.01722/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T10:55:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"p0KDUVxa7e0IpISodPIZiUmvRh/Uumwc0Zc6cD/X89ku+0AUHfHSLN9ww2vgJNbljcr88WezUu0+gujp+B7QAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T02:55:06.166729Z"},"content_sha256":"0160345159bd40a8601a2296b62b22df0211e2d140b812ccca0fdd8356894e16","schema_version":"1.0","event_id":"sha256:0160345159bd40a8601a2296b62b22df0211e2d140b812ccca0fdd8356894e16"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SPVQSZNJWTM5RDKG6BLZPXUBF2/bundle.json","state_url":"https://pith.science/pith/SPVQSZNJWTM5RDKG6BLZPXUBF2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SPVQSZNJWTM5RDKG6BLZPXUBF2/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-08-08T02:55:06Z","links":{"resolver":"https://pith.science/pith/SPVQSZNJWTM5RDKG6BLZPXUBF2","bundle":"https://pith.science/pith/SPVQSZNJWTM5RDKG6BLZPXUBF2/bundle.json","state":"https://pith.science/pith/SPVQSZNJWTM5RDKG6BLZPXUBF2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SPVQSZNJWTM5RDKG6BLZPXUBF2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:SPVQSZNJWTM5RDKG6BLZPXUBF2","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":"78015e11c34766270cde7ff8332f7683b4bd900266658f16399ff76be962da01","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2023-03-03T05:59:39Z","title_canon_sha256":"4e9d42f4391ec5da8401f2d20a6074ed20156f833cd7591e3c0baefa94d17059"},"schema_version":"1.0","source":{"id":"2303.01722","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2303.01722","created_at":"2026-07-05T10:55:16Z"},{"alias_kind":"arxiv_version","alias_value":"2303.01722v4","created_at":"2026-07-05T10:55:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2303.01722","created_at":"2026-07-05T10:55:16Z"},{"alias_kind":"pith_short_12","alias_value":"SPVQSZNJWTM5","created_at":"2026-07-05T10:55:16Z"},{"alias_kind":"pith_short_16","alias_value":"SPVQSZNJWTM5RDKG","created_at":"2026-07-05T10:55:16Z"},{"alias_kind":"pith_short_8","alias_value":"SPVQSZNJ","created_at":"2026-07-05T10:55:16Z"}],"graph_snapshots":[{"event_id":"sha256:0160345159bd40a8601a2296b62b22df0211e2d140b812ccca0fdd8356894e16","target":"graph","created_at":"2026-07-05T10:55:16Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2303.01722/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We propose a manifold optimization approach to solve linear semidefinite programs (SDP) with low-rank solutions, with an emphasis on SDP relaxations for polynomial optimization problems. This approach incorporates the inexact augmented Lagrangian method (ALM) and the Burer-Monteiro factorization, and features the self-adaptive strategies for updating the factorization size and the penalty parameter. We establish global convergence of the inexact ALM, despite the non-convexity brought by the Burer-Monteiro factorization. We further provide a practical algorithm building on the inexact ALM, and ","authors_text":"Jie Wang, Liangbing Hu","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2023-03-03T05:59:39Z","title":"Solving Low-Rank Semidefinite Programs via Manifold Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2303.01722","kind":"arxiv","version":4},"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:52eddc17dc55135111ae9e0a69311916f47bad930065049cb1d428c2ffcaa601","target":"record","created_at":"2026-07-05T10:55:16Z","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":"78015e11c34766270cde7ff8332f7683b4bd900266658f16399ff76be962da01","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2023-03-03T05:59:39Z","title_canon_sha256":"4e9d42f4391ec5da8401f2d20a6074ed20156f833cd7591e3c0baefa94d17059"},"schema_version":"1.0","source":{"id":"2303.01722","kind":"arxiv","version":4}},"canonical_sha256":"93eb0965a9b4d9d88d46f05797de812e9976f980898a39fd102393f383372ecf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"93eb0965a9b4d9d88d46f05797de812e9976f980898a39fd102393f383372ecf","first_computed_at":"2026-07-05T10:55:16.034296Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:55:16.034296Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6p/PBiD453bbdk534B7KuFZbmhpn3yq4y6cYEIBqhCbL2xd8zdiaDBMs/eEAQMgP6Hu1S0pnngpKr3rz4jIvAA==","signature_status":"signed_v1","signed_at":"2026-07-05T10:55:16.034771Z","signed_message":"canonical_sha256_bytes"},"source_id":"2303.01722","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:52eddc17dc55135111ae9e0a69311916f47bad930065049cb1d428c2ffcaa601","sha256:0160345159bd40a8601a2296b62b22df0211e2d140b812ccca0fdd8356894e16"],"state_sha256":"ca7479c4495a30203c71cb1f264fc45c922209200e03cc981de315f17648a00a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aYpp0D+7WlLMRDZKIj6HBiziotYMFHEVJB1fVLdMP+14Go6x9gkoRBoW6gp6yhkESv7bxt5v+9vGGC5ODfAiAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T02:55:06.170139Z","bundle_sha256":"7e6717aaa828d1179d4f492e378b3ff9461e82d8f1ca443dcc11e5cf993dad58"}}