{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:5WA23ITWJQBL6EUWARNAJQ6MND","short_pith_number":"pith:5WA23ITW","schema_version":"1.0","canonical_sha256":"ed81ada2764c02bf1296045a04c3cc68cd232d532b068b30a57bc78296900063","source":{"kind":"arxiv","id":"1810.05231","version":3},"attestation_state":"computed","paper":{"title":"Exploiting Low-Rank Structure in Semidefinite Programming by Approximate Operator Splitting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Alvaro Veiga, Joaquim D. Garcia, Mario Souto","submitted_at":"2018-10-11T20:10:21Z","abstract_excerpt":"In contrast with many other convex optimization classes, state-of-the-art semidefinite programming solvers are yet unable to efficiently solve large scale instances. This work aims to reduce this scalability gap by proposing a novel proximal algorithm for solving general semidefinite programming problems. The proposed methodology, based on the primal-dual hybrid gradient method, allows the presence of linear inequalities without the need of adding extra slack variables and avoids solving a linear system at each iteration. More importantly, it does simultaneously compute the dual variables asso"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1810.05231","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-10-11T20:10:21Z","cross_cats_sorted":[],"title_canon_sha256":"22bb7433de6dcddfb6713ab1601afcb0f57f804805d74e66df85622c54dd1018","abstract_canon_sha256":"0afad65acbe92cb754d1711b0d13e4565cf8955bb747675ac42e9aab67a77b23"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:57:56.997146Z","signature_b64":"OdwjDvNrcPJS3OHteZg5ns1KZDYEpW7VVYkHANdKD7/X3/FPcsrODIU//3csd+AYK6UcGk3LKlO9fpLeca6fBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ed81ada2764c02bf1296045a04c3cc68cd232d532b068b30a57bc78296900063","last_reissued_at":"2026-05-17T23:57:56.996453Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:57:56.996453Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Exploiting Low-Rank Structure in Semidefinite Programming by Approximate Operator Splitting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Alvaro Veiga, Joaquim D. Garcia, Mario Souto","submitted_at":"2018-10-11T20:10:21Z","abstract_excerpt":"In contrast with many other convex optimization classes, state-of-the-art semidefinite programming solvers are yet unable to efficiently solve large scale instances. This work aims to reduce this scalability gap by proposing a novel proximal algorithm for solving general semidefinite programming problems. The proposed methodology, based on the primal-dual hybrid gradient method, allows the presence of linear inequalities without the need of adding extra slack variables and avoids solving a linear system at each iteration. More importantly, it does simultaneously compute the dual variables asso"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.05231","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1810.05231","created_at":"2026-05-17T23:57:56.996534+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.05231v3","created_at":"2026-05-17T23:57:56.996534+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.05231","created_at":"2026-05-17T23:57:56.996534+00:00"},{"alias_kind":"pith_short_12","alias_value":"5WA23ITWJQBL","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_16","alias_value":"5WA23ITWJQBL6EUW","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_8","alias_value":"5WA23ITW","created_at":"2026-05-18T12:32:08.215937+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5WA23ITWJQBL6EUWARNAJQ6MND","json":"https://pith.science/pith/5WA23ITWJQBL6EUWARNAJQ6MND.json","graph_json":"https://pith.science/api/pith-number/5WA23ITWJQBL6EUWARNAJQ6MND/graph.json","events_json":"https://pith.science/api/pith-number/5WA23ITWJQBL6EUWARNAJQ6MND/events.json","paper":"https://pith.science/paper/5WA23ITW"},"agent_actions":{"view_html":"https://pith.science/pith/5WA23ITWJQBL6EUWARNAJQ6MND","download_json":"https://pith.science/pith/5WA23ITWJQBL6EUWARNAJQ6MND.json","view_paper":"https://pith.science/paper/5WA23ITW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.05231&json=true","fetch_graph":"https://pith.science/api/pith-number/5WA23ITWJQBL6EUWARNAJQ6MND/graph.json","fetch_events":"https://pith.science/api/pith-number/5WA23ITWJQBL6EUWARNAJQ6MND/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5WA23ITWJQBL6EUWARNAJQ6MND/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5WA23ITWJQBL6EUWARNAJQ6MND/action/storage_attestation","attest_author":"https://pith.science/pith/5WA23ITWJQBL6EUWARNAJQ6MND/action/author_attestation","sign_citation":"https://pith.science/pith/5WA23ITWJQBL6EUWARNAJQ6MND/action/citation_signature","submit_replication":"https://pith.science/pith/5WA23ITWJQBL6EUWARNAJQ6MND/action/replication_record"}},"created_at":"2026-05-17T23:57:56.996534+00:00","updated_at":"2026-05-17T23:57:56.996534+00:00"}