{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:KOKN5MFEL3JRNFN6BVESVXERBZ","short_pith_number":"pith:KOKN5MFE","canonical_record":{"source":{"id":"2406.10407","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-06-14T20:31:22Z","cross_cats_sorted":["cs.LG","cs.NA","math.NA"],"title_canon_sha256":"4e9f4159d5788ec5808591050c1106ec91ada8fa9419321c98b95b1dc0dfaa75","abstract_canon_sha256":"357c8cd663aa0048cbf0da0b2d8a2cdef8d846bb0b53f614bd8d91009ab99fb8"},"schema_version":"1.0"},"canonical_sha256":"5394deb0a45ed31695be0d492adc910e553a3ae3b794cee1c06ed98be47ef43c","source":{"kind":"arxiv","id":"2406.10407","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2406.10407","created_at":"2026-06-03T01:05:03Z"},{"alias_kind":"arxiv_version","alias_value":"2406.10407v3","created_at":"2026-06-03T01:05:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.10407","created_at":"2026-06-03T01:05:03Z"},{"alias_kind":"pith_short_12","alias_value":"KOKN5MFEL3JR","created_at":"2026-06-03T01:05:03Z"},{"alias_kind":"pith_short_16","alias_value":"KOKN5MFEL3JRNFN6","created_at":"2026-06-03T01:05:03Z"},{"alias_kind":"pith_short_8","alias_value":"KOKN5MFE","created_at":"2026-06-03T01:05:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:KOKN5MFEL3JRNFN6BVESVXERBZ","target":"record","payload":{"canonical_record":{"source":{"id":"2406.10407","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-06-14T20:31:22Z","cross_cats_sorted":["cs.LG","cs.NA","math.NA"],"title_canon_sha256":"4e9f4159d5788ec5808591050c1106ec91ada8fa9419321c98b95b1dc0dfaa75","abstract_canon_sha256":"357c8cd663aa0048cbf0da0b2d8a2cdef8d846bb0b53f614bd8d91009ab99fb8"},"schema_version":"1.0"},"canonical_sha256":"5394deb0a45ed31695be0d492adc910e553a3ae3b794cee1c06ed98be47ef43c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-03T01:05:03.416868Z","signature_b64":"oxwViUAa56XEymmDc37Nepd5kddOZ3WeMZRsJMM8R+dOZajHn77sHwTNWhyt4jQ0bfyxKgldy41YPNRfD0WgAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5394deb0a45ed31695be0d492adc910e553a3ae3b794cee1c06ed98be47ef43c","last_reissued_at":"2026-06-03T01:05:03.416327Z","signature_status":"signed_v1","first_computed_at":"2026-06-03T01:05:03.416327Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2406.10407","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-06-03T01:05:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/nIb1KqXA6eKYCDNrUNgx4SMNyaLLweoojfKs8LRtOr5cKMnwUdkvjHcE/4oKcQWONp7/w2N1r1zqqmFek70Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T18:33:16.492618Z"},"content_sha256":"336a7e4a23d51b660d51f2bdfad2f05a9ed28dc09fb59b1182948b57419533e5","schema_version":"1.0","event_id":"sha256:336a7e4a23d51b660d51f2bdfad2f05a9ed28dc09fb59b1182948b57419533e5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:KOKN5MFEL3JRNFN6BVESVXERBZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Suboptimality bounds for trace-bounded SDPs enable a faster and scalable low-rank SDP solver SDPLR+","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.NA","math.NA"],"primary_cat":"math.OC","authors_text":"David F. Gleich, Yufan Huang","submitted_at":"2024-06-14T20:31:22Z","abstract_excerpt":"Semidefinite programs (SDPs) and their solvers are powerful tools with many applications in machine learning and data science. Designing scalable SDP solvers is challenging because by standard the positive semidefinite decision variable is an $n \\times n$ dense matrix, even though the input is often an $n \\times n$ sparse matrix. However, the solution may not require a full-rank matrix, as shown by Barvinok and Pataki. Two decades ago, Burer and Monteiro developed an SDP solver \\texttt{SDPLR} that optimizes over a low-rank factorization instead of the full matrix. This greatly decreases the st"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.10407","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2406.10407/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-06-03T01:05:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"daEe1VyBSyQpVcK6CDx3N8xYv3bHRFaqjsJCoZZHq2GabTMt2mHirVIPu/YG4MBseTbO8LKYCxrstJrqhN7zBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T18:33:16.493333Z"},"content_sha256":"058cb9c8f0c90a1f4bf0c3fe3c4244430ca2919fad6e8480a8afd04a41286a0d","schema_version":"1.0","event_id":"sha256:058cb9c8f0c90a1f4bf0c3fe3c4244430ca2919fad6e8480a8afd04a41286a0d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KOKN5MFEL3JRNFN6BVESVXERBZ/bundle.json","state_url":"https://pith.science/pith/KOKN5MFEL3JRNFN6BVESVXERBZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KOKN5MFEL3JRNFN6BVESVXERBZ/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-06T18:33:16Z","links":{"resolver":"https://pith.science/pith/KOKN5MFEL3JRNFN6BVESVXERBZ","bundle":"https://pith.science/pith/KOKN5MFEL3JRNFN6BVESVXERBZ/bundle.json","state":"https://pith.science/pith/KOKN5MFEL3JRNFN6BVESVXERBZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KOKN5MFEL3JRNFN6BVESVXERBZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:KOKN5MFEL3JRNFN6BVESVXERBZ","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":"357c8cd663aa0048cbf0da0b2d8a2cdef8d846bb0b53f614bd8d91009ab99fb8","cross_cats_sorted":["cs.LG","cs.NA","math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-06-14T20:31:22Z","title_canon_sha256":"4e9f4159d5788ec5808591050c1106ec91ada8fa9419321c98b95b1dc0dfaa75"},"schema_version":"1.0","source":{"id":"2406.10407","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2406.10407","created_at":"2026-06-03T01:05:03Z"},{"alias_kind":"arxiv_version","alias_value":"2406.10407v3","created_at":"2026-06-03T01:05:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.10407","created_at":"2026-06-03T01:05:03Z"},{"alias_kind":"pith_short_12","alias_value":"KOKN5MFEL3JR","created_at":"2026-06-03T01:05:03Z"},{"alias_kind":"pith_short_16","alias_value":"KOKN5MFEL3JRNFN6","created_at":"2026-06-03T01:05:03Z"},{"alias_kind":"pith_short_8","alias_value":"KOKN5MFE","created_at":"2026-06-03T01:05:03Z"}],"graph_snapshots":[{"event_id":"sha256:058cb9c8f0c90a1f4bf0c3fe3c4244430ca2919fad6e8480a8afd04a41286a0d","target":"graph","created_at":"2026-06-03T01:05:03Z","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/2406.10407/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Semidefinite programs (SDPs) and their solvers are powerful tools with many applications in machine learning and data science. Designing scalable SDP solvers is challenging because by standard the positive semidefinite decision variable is an $n \\times n$ dense matrix, even though the input is often an $n \\times n$ sparse matrix. However, the solution may not require a full-rank matrix, as shown by Barvinok and Pataki. Two decades ago, Burer and Monteiro developed an SDP solver \\texttt{SDPLR} that optimizes over a low-rank factorization instead of the full matrix. This greatly decreases the st","authors_text":"David F. Gleich, Yufan Huang","cross_cats":["cs.LG","cs.NA","math.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-06-14T20:31:22Z","title":"Suboptimality bounds for trace-bounded SDPs enable a faster and scalable low-rank SDP solver SDPLR+"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.10407","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:336a7e4a23d51b660d51f2bdfad2f05a9ed28dc09fb59b1182948b57419533e5","target":"record","created_at":"2026-06-03T01:05:03Z","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":"357c8cd663aa0048cbf0da0b2d8a2cdef8d846bb0b53f614bd8d91009ab99fb8","cross_cats_sorted":["cs.LG","cs.NA","math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-06-14T20:31:22Z","title_canon_sha256":"4e9f4159d5788ec5808591050c1106ec91ada8fa9419321c98b95b1dc0dfaa75"},"schema_version":"1.0","source":{"id":"2406.10407","kind":"arxiv","version":3}},"canonical_sha256":"5394deb0a45ed31695be0d492adc910e553a3ae3b794cee1c06ed98be47ef43c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5394deb0a45ed31695be0d492adc910e553a3ae3b794cee1c06ed98be47ef43c","first_computed_at":"2026-06-03T01:05:03.416327Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-03T01:05:03.416327Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oxwViUAa56XEymmDc37Nepd5kddOZ3WeMZRsJMM8R+dOZajHn77sHwTNWhyt4jQ0bfyxKgldy41YPNRfD0WgAw==","signature_status":"signed_v1","signed_at":"2026-06-03T01:05:03.416868Z","signed_message":"canonical_sha256_bytes"},"source_id":"2406.10407","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:336a7e4a23d51b660d51f2bdfad2f05a9ed28dc09fb59b1182948b57419533e5","sha256:058cb9c8f0c90a1f4bf0c3fe3c4244430ca2919fad6e8480a8afd04a41286a0d"],"state_sha256":"9141a5f587125611f7131c19a20a6f8518d413d9b2bc046184a566ba506c19a0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qIxKWJcI+tT9b87SKZnf6ui88p7PXIb/P39x2EkyZ0Lncz76sEvmyelohAzPy5B4RpdP5LgfEc9kGqZBeWs0Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T18:33:16.496598Z","bundle_sha256":"8ac88c0fa8351ed3150a94dcd0e2414ee79f05d6609f62501c7266e2741c41bf"}}