{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:7OHORBZBYSM5F4LEI76V3WKIQO","short_pith_number":"pith:7OHORBZB","canonical_record":{"source":{"id":"2302.04016","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-02-08T12:07:43Z","cross_cats_sorted":[],"title_canon_sha256":"b006ac5c0d03435a9aa01765fbe5faa6c17032f2f00365c7aca1af1f8e306b4b","abstract_canon_sha256":"d6989f876cff8667ac31bc30cb226868512b39cb5529422bc003cf8a0d38d5d1"},"schema_version":"1.0"},"canonical_sha256":"fb8ee88721c499d2f16447fd5dd94883b33da65bf22fc67eed35db75ab094935","source":{"kind":"arxiv","id":"2302.04016","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2302.04016","created_at":"2026-07-05T05:40:00Z"},{"alias_kind":"arxiv_version","alias_value":"2302.04016v1","created_at":"2026-07-05T05:40:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.04016","created_at":"2026-07-05T05:40:00Z"},{"alias_kind":"pith_short_12","alias_value":"7OHORBZBYSM5","created_at":"2026-07-05T05:40:00Z"},{"alias_kind":"pith_short_16","alias_value":"7OHORBZBYSM5F4LE","created_at":"2026-07-05T05:40:00Z"},{"alias_kind":"pith_short_8","alias_value":"7OHORBZB","created_at":"2026-07-05T05:40:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:7OHORBZBYSM5F4LEI76V3WKIQO","target":"record","payload":{"canonical_record":{"source":{"id":"2302.04016","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-02-08T12:07:43Z","cross_cats_sorted":[],"title_canon_sha256":"b006ac5c0d03435a9aa01765fbe5faa6c17032f2f00365c7aca1af1f8e306b4b","abstract_canon_sha256":"d6989f876cff8667ac31bc30cb226868512b39cb5529422bc003cf8a0d38d5d1"},"schema_version":"1.0"},"canonical_sha256":"fb8ee88721c499d2f16447fd5dd94883b33da65bf22fc67eed35db75ab094935","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:40:00.266018Z","signature_b64":"q8t1d1BeBZIBrjCgJjpmPbGKybueOR4qYFO/TLIFMFjLngJ0c4C7pRhyvlLDNR14SYvW8V0gn7umI8AhVRiGCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fb8ee88721c499d2f16447fd5dd94883b33da65bf22fc67eed35db75ab094935","last_reissued_at":"2026-07-05T05:40:00.265603Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:40:00.265603Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2302.04016","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-07-05T05:40:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UWH2X0h/sk2yJLUFzwXVRg5dfkoGEsytlarRvlHWNVnT9KhvHUMJcSdsiSGjDFhi6VNfEijJU33NjctlGrwPAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T08:37:13.341066Z"},"content_sha256":"c1983e53ec8ae8b830bca246f8ba57dd06c57c11797d41f6c49fe9989a5e9163","schema_version":"1.0","event_id":"sha256:c1983e53ec8ae8b830bca246f8ba57dd06c57c11797d41f6c49fe9989a5e9163"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:7OHORBZBYSM5F4LEI76V3WKIQO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Burer-Monteiro ADMM for Large-scale SDPs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Paul Goulart, Yuwen Chen","submitted_at":"2023-02-08T12:07:43Z","abstract_excerpt":"We propose a bilinear decomposition for the Burer-Monteiro method and combine it with the standard Alternating Direction Method of Multipliers algorithm for semidefinite programming. Bilinear decomposition reduces the degree of the augmented Lagrangian from four to two, which makes each of the subproblems a quadratic programming and hence computationally efficient. Our approach is able to solve a class of large-scale SDPs with diagonal constraints. We prove that our ADMM algorithm converges globally to a first-order stationary point, and show by exploiting the negative curvature that the algor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.04016","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2302.04016/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-05T05:40:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KyzDUhOx9VVhBV3zDL94whGrGWi2FaCatMRrPNV94+XNXzGH4+FaVz3e29mQPId1jheKfKn8LEe/HkVzUI5rDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T08:37:13.341917Z"},"content_sha256":"944874ae1e35b8518c8840f2ec9b2a40d05758d518c64929295e1992ee6c98e9","schema_version":"1.0","event_id":"sha256:944874ae1e35b8518c8840f2ec9b2a40d05758d518c64929295e1992ee6c98e9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7OHORBZBYSM5F4LEI76V3WKIQO/bundle.json","state_url":"https://pith.science/pith/7OHORBZBYSM5F4LEI76V3WKIQO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7OHORBZBYSM5F4LEI76V3WKIQO/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-18T08:37:13Z","links":{"resolver":"https://pith.science/pith/7OHORBZBYSM5F4LEI76V3WKIQO","bundle":"https://pith.science/pith/7OHORBZBYSM5F4LEI76V3WKIQO/bundle.json","state":"https://pith.science/pith/7OHORBZBYSM5F4LEI76V3WKIQO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7OHORBZBYSM5F4LEI76V3WKIQO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:7OHORBZBYSM5F4LEI76V3WKIQO","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":"d6989f876cff8667ac31bc30cb226868512b39cb5529422bc003cf8a0d38d5d1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-02-08T12:07:43Z","title_canon_sha256":"b006ac5c0d03435a9aa01765fbe5faa6c17032f2f00365c7aca1af1f8e306b4b"},"schema_version":"1.0","source":{"id":"2302.04016","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2302.04016","created_at":"2026-07-05T05:40:00Z"},{"alias_kind":"arxiv_version","alias_value":"2302.04016v1","created_at":"2026-07-05T05:40:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.04016","created_at":"2026-07-05T05:40:00Z"},{"alias_kind":"pith_short_12","alias_value":"7OHORBZBYSM5","created_at":"2026-07-05T05:40:00Z"},{"alias_kind":"pith_short_16","alias_value":"7OHORBZBYSM5F4LE","created_at":"2026-07-05T05:40:00Z"},{"alias_kind":"pith_short_8","alias_value":"7OHORBZB","created_at":"2026-07-05T05:40:00Z"}],"graph_snapshots":[{"event_id":"sha256:944874ae1e35b8518c8840f2ec9b2a40d05758d518c64929295e1992ee6c98e9","target":"graph","created_at":"2026-07-05T05:40:00Z","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/2302.04016/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We propose a bilinear decomposition for the Burer-Monteiro method and combine it with the standard Alternating Direction Method of Multipliers algorithm for semidefinite programming. Bilinear decomposition reduces the degree of the augmented Lagrangian from four to two, which makes each of the subproblems a quadratic programming and hence computationally efficient. Our approach is able to solve a class of large-scale SDPs with diagonal constraints. We prove that our ADMM algorithm converges globally to a first-order stationary point, and show by exploiting the negative curvature that the algor","authors_text":"Paul Goulart, Yuwen Chen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-02-08T12:07:43Z","title":"Burer-Monteiro ADMM for Large-scale SDPs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.04016","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:c1983e53ec8ae8b830bca246f8ba57dd06c57c11797d41f6c49fe9989a5e9163","target":"record","created_at":"2026-07-05T05:40:00Z","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":"d6989f876cff8667ac31bc30cb226868512b39cb5529422bc003cf8a0d38d5d1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-02-08T12:07:43Z","title_canon_sha256":"b006ac5c0d03435a9aa01765fbe5faa6c17032f2f00365c7aca1af1f8e306b4b"},"schema_version":"1.0","source":{"id":"2302.04016","kind":"arxiv","version":1}},"canonical_sha256":"fb8ee88721c499d2f16447fd5dd94883b33da65bf22fc67eed35db75ab094935","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fb8ee88721c499d2f16447fd5dd94883b33da65bf22fc67eed35db75ab094935","first_computed_at":"2026-07-05T05:40:00.265603Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:40:00.265603Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"q8t1d1BeBZIBrjCgJjpmPbGKybueOR4qYFO/TLIFMFjLngJ0c4C7pRhyvlLDNR14SYvW8V0gn7umI8AhVRiGCg==","signature_status":"signed_v1","signed_at":"2026-07-05T05:40:00.266018Z","signed_message":"canonical_sha256_bytes"},"source_id":"2302.04016","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c1983e53ec8ae8b830bca246f8ba57dd06c57c11797d41f6c49fe9989a5e9163","sha256:944874ae1e35b8518c8840f2ec9b2a40d05758d518c64929295e1992ee6c98e9"],"state_sha256":"f1113adec4e4be4a7c94bff2386cb06feb3d194b2ca66a1d7c7a30c1383660fd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5Fz3aMj8BrZJf+CRyF/pIAkFm0/36ps0loSfUyoP622FQ7FA2sYESPyn93aIIN1jtfRQUHtNFaSEcoHauLQ7Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-18T08:37:13.346422Z","bundle_sha256":"febabdc76244610969e1936c46fc7ac29121c79760c283551b99b8852012d3b0"}}