{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:CBQLMS2GY2VWZIIL3VNOW4RR4B","short_pith_number":"pith:CBQLMS2G","canonical_record":{"source":{"id":"2410.23849","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-10-31T12:00:43Z","cross_cats_sorted":[],"title_canon_sha256":"672bcd40ed538323d157da7bf26456afbf8911c900a249d447e7dba2aece36ea","abstract_canon_sha256":"63362538c00476f01452a8e1e31fb136f4aaf75ef5827a94ba783cd524b4a3b8"},"schema_version":"1.0"},"canonical_sha256":"1060b64b46c6ab6ca10bdd5aeb7231e0759ff31f0048932326cba12dcd461679","source":{"kind":"arxiv","id":"2410.23849","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2410.23849","created_at":"2026-07-05T09:29:05Z"},{"alias_kind":"arxiv_version","alias_value":"2410.23849v1","created_at":"2026-07-05T09:29:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.23849","created_at":"2026-07-05T09:29:05Z"},{"alias_kind":"pith_short_12","alias_value":"CBQLMS2GY2VW","created_at":"2026-07-05T09:29:05Z"},{"alias_kind":"pith_short_16","alias_value":"CBQLMS2GY2VWZIIL","created_at":"2026-07-05T09:29:05Z"},{"alias_kind":"pith_short_8","alias_value":"CBQLMS2G","created_at":"2026-07-05T09:29:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:CBQLMS2GY2VWZIIL3VNOW4RR4B","target":"record","payload":{"canonical_record":{"source":{"id":"2410.23849","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-10-31T12:00:43Z","cross_cats_sorted":[],"title_canon_sha256":"672bcd40ed538323d157da7bf26456afbf8911c900a249d447e7dba2aece36ea","abstract_canon_sha256":"63362538c00476f01452a8e1e31fb136f4aaf75ef5827a94ba783cd524b4a3b8"},"schema_version":"1.0"},"canonical_sha256":"1060b64b46c6ab6ca10bdd5aeb7231e0759ff31f0048932326cba12dcd461679","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:29:05.987661Z","signature_b64":"ushq6HU6JrhxOd/UOoanmUgjZh9cRfkSgM1Yun1W5aDGJH4MwpKPEhBU5pcuLfk7sGE/a6DjAQd3Qs0af0MDCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1060b64b46c6ab6ca10bdd5aeb7231e0759ff31f0048932326cba12dcd461679","last_reissued_at":"2026-07-05T09:29:05.987180Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:29:05.987180Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2410.23849","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-05T09:29:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CYfUpcgxgCzr1VhSrnH3qedHNYC8ZJxGCMmWpz52120G7Bjkw+2N/zHNrQ7OwxhJ/D7nxbBSAy4lLnE9etVuBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T14:15:00.875569Z"},"content_sha256":"6a0e3cde86d26a48a07f9da6ac706785fb964c8036c9aabd10a85bba0f57682f","schema_version":"1.0","event_id":"sha256:6a0e3cde86d26a48a07f9da6ac706785fb964c8036c9aabd10a85bba0f57682f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:CBQLMS2GY2VWZIIL3VNOW4RR4B","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Exploring chordal sparsity in semidefinite programming with sparse plus low-rank data matrices","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Kim-Chuan Toh, Tianyun Tang","submitted_at":"2024-10-31T12:00:43Z","abstract_excerpt":"Semidefinite programming (SDP) problems are challenging to solve because of their high dimensionality. However, solving sparse SDP problems with small tree-width are known to be relatively easier because: (1) they can be decomposed into smaller multi-block SDP problems through chordal conversion; (2) they have low-rank optimal solutions. In this paper, we study more general SDP problems whose coefficient matrices have sparse plus low-rank (SPLR) structure. We develop a unified framework to convert such problems into sparse SDP problems with bounded tree-width. Based on this, we derive rank bou"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.23849","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/2410.23849/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-05T09:29:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RGUYLo7I7BQr8fk87m+MitVz7Ys6ovgtrx46LDlTYyzlb5Ohj3HIcFXc85vk6XHi+DlIWi9uiXNHDhKttHzyBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T14:15:00.876196Z"},"content_sha256":"c1af2e8c5206fc87d6e71c56a586b3e1cabc15cad5a19a07da1d0040b10d5a76","schema_version":"1.0","event_id":"sha256:c1af2e8c5206fc87d6e71c56a586b3e1cabc15cad5a19a07da1d0040b10d5a76"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CBQLMS2GY2VWZIIL3VNOW4RR4B/bundle.json","state_url":"https://pith.science/pith/CBQLMS2GY2VWZIIL3VNOW4RR4B/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CBQLMS2GY2VWZIIL3VNOW4RR4B/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-10T14:15:00Z","links":{"resolver":"https://pith.science/pith/CBQLMS2GY2VWZIIL3VNOW4RR4B","bundle":"https://pith.science/pith/CBQLMS2GY2VWZIIL3VNOW4RR4B/bundle.json","state":"https://pith.science/pith/CBQLMS2GY2VWZIIL3VNOW4RR4B/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CBQLMS2GY2VWZIIL3VNOW4RR4B/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:CBQLMS2GY2VWZIIL3VNOW4RR4B","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":"63362538c00476f01452a8e1e31fb136f4aaf75ef5827a94ba783cd524b4a3b8","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-10-31T12:00:43Z","title_canon_sha256":"672bcd40ed538323d157da7bf26456afbf8911c900a249d447e7dba2aece36ea"},"schema_version":"1.0","source":{"id":"2410.23849","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2410.23849","created_at":"2026-07-05T09:29:05Z"},{"alias_kind":"arxiv_version","alias_value":"2410.23849v1","created_at":"2026-07-05T09:29:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.23849","created_at":"2026-07-05T09:29:05Z"},{"alias_kind":"pith_short_12","alias_value":"CBQLMS2GY2VW","created_at":"2026-07-05T09:29:05Z"},{"alias_kind":"pith_short_16","alias_value":"CBQLMS2GY2VWZIIL","created_at":"2026-07-05T09:29:05Z"},{"alias_kind":"pith_short_8","alias_value":"CBQLMS2G","created_at":"2026-07-05T09:29:05Z"}],"graph_snapshots":[{"event_id":"sha256:c1af2e8c5206fc87d6e71c56a586b3e1cabc15cad5a19a07da1d0040b10d5a76","target":"graph","created_at":"2026-07-05T09:29:05Z","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/2410.23849/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Semidefinite programming (SDP) problems are challenging to solve because of their high dimensionality. However, solving sparse SDP problems with small tree-width are known to be relatively easier because: (1) they can be decomposed into smaller multi-block SDP problems through chordal conversion; (2) they have low-rank optimal solutions. In this paper, we study more general SDP problems whose coefficient matrices have sparse plus low-rank (SPLR) structure. We develop a unified framework to convert such problems into sparse SDP problems with bounded tree-width. Based on this, we derive rank bou","authors_text":"Kim-Chuan Toh, Tianyun Tang","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-10-31T12:00:43Z","title":"Exploring chordal sparsity in semidefinite programming with sparse plus low-rank data matrices"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.23849","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:6a0e3cde86d26a48a07f9da6ac706785fb964c8036c9aabd10a85bba0f57682f","target":"record","created_at":"2026-07-05T09:29:05Z","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":"63362538c00476f01452a8e1e31fb136f4aaf75ef5827a94ba783cd524b4a3b8","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-10-31T12:00:43Z","title_canon_sha256":"672bcd40ed538323d157da7bf26456afbf8911c900a249d447e7dba2aece36ea"},"schema_version":"1.0","source":{"id":"2410.23849","kind":"arxiv","version":1}},"canonical_sha256":"1060b64b46c6ab6ca10bdd5aeb7231e0759ff31f0048932326cba12dcd461679","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1060b64b46c6ab6ca10bdd5aeb7231e0759ff31f0048932326cba12dcd461679","first_computed_at":"2026-07-05T09:29:05.987180Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:29:05.987180Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ushq6HU6JrhxOd/UOoanmUgjZh9cRfkSgM1Yun1W5aDGJH4MwpKPEhBU5pcuLfk7sGE/a6DjAQd3Qs0af0MDCw==","signature_status":"signed_v1","signed_at":"2026-07-05T09:29:05.987661Z","signed_message":"canonical_sha256_bytes"},"source_id":"2410.23849","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6a0e3cde86d26a48a07f9da6ac706785fb964c8036c9aabd10a85bba0f57682f","sha256:c1af2e8c5206fc87d6e71c56a586b3e1cabc15cad5a19a07da1d0040b10d5a76"],"state_sha256":"f8ace32be2263c3c6fe5c0ecda706336c685dcb06bd6082911a9325cc3745551"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+fL8zBIeMOfnmFDfYza3X0nyrxXM8JwInq1d/owkKAu8qKFQRAmlfwEl6HcMz0Z0qoBr60AA/whIny+YkwRkDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-10T14:15:00.880412Z","bundle_sha256":"5aa4736cfe3099d10219c8e93400af09093090c34a0cbbaa5c303af01dfbe7f6"}}