{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:4AOARMB5WJ653HGPCULYTDX4VS","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":"fb5b739642cb8c9e80cabfd0c5660bda32828fdce469d81bd7c88fcdd8a4c0e8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-07-21T04:21:40Z","title_canon_sha256":"9704cc309d879e954041791b878b64fdca9fc8dcb69dab9798eee426feaaf7da"},"schema_version":"1.0","source":{"id":"2407.15049","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2407.15049","created_at":"2026-07-05T08:58:45Z"},{"alias_kind":"arxiv_version","alias_value":"2407.15049v3","created_at":"2026-07-05T08:58:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.15049","created_at":"2026-07-05T08:58:45Z"},{"alias_kind":"pith_short_12","alias_value":"4AOARMB5WJ65","created_at":"2026-07-05T08:58:45Z"},{"alias_kind":"pith_short_16","alias_value":"4AOARMB5WJ653HGP","created_at":"2026-07-05T08:58:45Z"},{"alias_kind":"pith_short_8","alias_value":"4AOARMB5","created_at":"2026-07-05T08:58:45Z"}],"graph_snapshots":[{"event_id":"sha256:392c620a0b7ab2bf8e4160200466766438246cab04a0e22b352a596576e80605","target":"graph","created_at":"2026-07-05T08:58:45Z","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/2407.15049/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper, we address a long-standing challenge: how to achieve both efficiency and scalability in solving semidefinite programming problems. We propose breakthrough acceleration techniques for a wide range of low-rank factorization-based first-order methods using GPUs, making the computation much more efficient and scalable. To illustrate the idea and effectiveness of our approach, we use the low-rank factorization-based SDP solver, LoRADS, as an example, which involves both the classic Burer-Monterio method and a novel splitting scheme with a starting logarithmic rank. Our numerical resu","authors_text":"Caihua Chen, Dongdong Ge, Hanwen Liu, Qi Deng, Qiushi Han, Yinyu Ye, Zhenwei Lin","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-07-21T04:21:40Z","title":"Accelerating Low-Rank Factorization-Based Semidefinite Programming Algorithms on GPU"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.15049","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:d1bbccd757059325695ac408acb2fdf0fb7c6497aa86e079136b838d0bbcd956","target":"record","created_at":"2026-07-05T08:58:45Z","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":"fb5b739642cb8c9e80cabfd0c5660bda32828fdce469d81bd7c88fcdd8a4c0e8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-07-21T04:21:40Z","title_canon_sha256":"9704cc309d879e954041791b878b64fdca9fc8dcb69dab9798eee426feaaf7da"},"schema_version":"1.0","source":{"id":"2407.15049","kind":"arxiv","version":3}},"canonical_sha256":"e01c08b03db27ddd9ccf1517898efcac86924f06fd47db0bc48a22139a3b9aa9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e01c08b03db27ddd9ccf1517898efcac86924f06fd47db0bc48a22139a3b9aa9","first_computed_at":"2026-07-05T08:58:45.679319Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:58:45.679319Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OQ/9o65BCY61J9qBaaiEdgxya9ZscAwA/k8nQF4pOyobli6Ws3TOqudaVXDme4N5/aXU6wpzut2bapoB9SbXCw==","signature_status":"signed_v1","signed_at":"2026-07-05T08:58:45.679976Z","signed_message":"canonical_sha256_bytes"},"source_id":"2407.15049","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d1bbccd757059325695ac408acb2fdf0fb7c6497aa86e079136b838d0bbcd956","sha256:392c620a0b7ab2bf8e4160200466766438246cab04a0e22b352a596576e80605"],"state_sha256":"f7339139230230e0a197d02ed0f48685e541db01d1d36bcdfe63cddb69610570"}