{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:5WA23ITWJQBL6EUWARNAJQ6MND","short_pith_number":"pith:5WA23ITW","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"},"canonical_sha256":"ed81ada2764c02bf1296045a04c3cc68cd232d532b068b30a57bc78296900063","source":{"kind":"arxiv","id":"1810.05231","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.05231","created_at":"2026-05-17T23:57:56Z"},{"alias_kind":"arxiv_version","alias_value":"1810.05231v3","created_at":"2026-05-17T23:57:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.05231","created_at":"2026-05-17T23:57:56Z"},{"alias_kind":"pith_short_12","alias_value":"5WA23ITWJQBL","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"5WA23ITWJQBL6EUW","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"5WA23ITW","created_at":"2026-05-18T12:32:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:5WA23ITWJQBL6EUWARNAJQ6MND","target":"record","payload":{"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"},"canonical_sha256":"ed81ada2764c02bf1296045a04c3cc68cd232d532b068b30a57bc78296900063","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"},"source_kind":"arxiv","source_id":"1810.05231","source_version":3,"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-17T23:57:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9hGQYd0FQO3kty4W2BY33hI5z1hyFLAMDSeA1YYIqZ2RJHmIZBFMK0tEVmVk4bDArZwxNUMnjoWt75WBjZtkDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T09:20:41.120503Z"},"content_sha256":"45d03ef43f6c8cde8859f4e1c97ba89169a35dc705ed2988867bcb6a66f103ea","schema_version":"1.0","event_id":"sha256:45d03ef43f6c8cde8859f4e1c97ba89169a35dc705ed2988867bcb6a66f103ea"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:5WA23ITWJQBL6EUWARNAJQ6MND","target":"graph","payload":{"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"},"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-17T23:57:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9Iwpsb9BjrIGXJp/T8mWKyYyIIE8SNiXmTaq48H40LhKy/wJl5oMdnpBjrzFIhpbPsvZjAMqp1Z7hnn6sTWBAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T09:20:41.120840Z"},"content_sha256":"8d7c3e812e06a5c05b6e1cc7d80af70fd16d3dabe9b63f980ceab762d5215ee0","schema_version":"1.0","event_id":"sha256:8d7c3e812e06a5c05b6e1cc7d80af70fd16d3dabe9b63f980ceab762d5215ee0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5WA23ITWJQBL6EUWARNAJQ6MND/bundle.json","state_url":"https://pith.science/pith/5WA23ITWJQBL6EUWARNAJQ6MND/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5WA23ITWJQBL6EUWARNAJQ6MND/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-06-11T09:20:41Z","links":{"resolver":"https://pith.science/pith/5WA23ITWJQBL6EUWARNAJQ6MND","bundle":"https://pith.science/pith/5WA23ITWJQBL6EUWARNAJQ6MND/bundle.json","state":"https://pith.science/pith/5WA23ITWJQBL6EUWARNAJQ6MND/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5WA23ITWJQBL6EUWARNAJQ6MND/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:5WA23ITWJQBL6EUWARNAJQ6MND","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":"0afad65acbe92cb754d1711b0d13e4565cf8955bb747675ac42e9aab67a77b23","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-10-11T20:10:21Z","title_canon_sha256":"22bb7433de6dcddfb6713ab1601afcb0f57f804805d74e66df85622c54dd1018"},"schema_version":"1.0","source":{"id":"1810.05231","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.05231","created_at":"2026-05-17T23:57:56Z"},{"alias_kind":"arxiv_version","alias_value":"1810.05231v3","created_at":"2026-05-17T23:57:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.05231","created_at":"2026-05-17T23:57:56Z"},{"alias_kind":"pith_short_12","alias_value":"5WA23ITWJQBL","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"5WA23ITWJQBL6EUW","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"5WA23ITW","created_at":"2026-05-18T12:32:08Z"}],"graph_snapshots":[{"event_id":"sha256:8d7c3e812e06a5c05b6e1cc7d80af70fd16d3dabe9b63f980ceab762d5215ee0","target":"graph","created_at":"2026-05-17T23:57:56Z","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":"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","authors_text":"Alvaro Veiga, Joaquim D. Garcia, Mario Souto","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-10-11T20:10:21Z","title":"Exploiting Low-Rank Structure in Semidefinite Programming by Approximate Operator Splitting"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.05231","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:45d03ef43f6c8cde8859f4e1c97ba89169a35dc705ed2988867bcb6a66f103ea","target":"record","created_at":"2026-05-17T23:57:56Z","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":"0afad65acbe92cb754d1711b0d13e4565cf8955bb747675ac42e9aab67a77b23","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-10-11T20:10:21Z","title_canon_sha256":"22bb7433de6dcddfb6713ab1601afcb0f57f804805d74e66df85622c54dd1018"},"schema_version":"1.0","source":{"id":"1810.05231","kind":"arxiv","version":3}},"canonical_sha256":"ed81ada2764c02bf1296045a04c3cc68cd232d532b068b30a57bc78296900063","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ed81ada2764c02bf1296045a04c3cc68cd232d532b068b30a57bc78296900063","first_computed_at":"2026-05-17T23:57:56.996453Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:57:56.996453Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OdwjDvNrcPJS3OHteZg5ns1KZDYEpW7VVYkHANdKD7/X3/FPcsrODIU//3csd+AYK6UcGk3LKlO9fpLeca6fBw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:57:56.997146Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.05231","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:45d03ef43f6c8cde8859f4e1c97ba89169a35dc705ed2988867bcb6a66f103ea","sha256:8d7c3e812e06a5c05b6e1cc7d80af70fd16d3dabe9b63f980ceab762d5215ee0"],"state_sha256":"3c312195838364cc32000342cda4b4b85bb32153b472734215d08cbbad1de8ea"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"asr0EkmtwL9yzRUGFvC7nBURHqxTNvm3aNh5n8tqLO/vQfcPXt4Fpq0YRUWeztZcNWbHBkKRU9FD+vp7GBTgAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T09:20:41.122858Z","bundle_sha256":"b615790e96ea172a4bcc6f832cd4e80b737b35f0a4c4808f2b5c1791f92bef88"}}