{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:3LCPW5KYL4IRYQEBYAQFBO4AAB","short_pith_number":"pith:3LCPW5KY","canonical_record":{"source":{"id":"1509.08021","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-09-26T19:26:39Z","cross_cats_sorted":[],"title_canon_sha256":"c853b17e0c12d52a38764c37a68a2b73913bae7f3ddda5a558d059e041a348a4","abstract_canon_sha256":"aced88fa8fea053473b3852e80b397b58d23acdc6cd167cc009112a05368ce4a"},"schema_version":"1.0"},"canonical_sha256":"dac4fb75585f111c4081c02050bb80007e5fd81d34580e08956440bf4bb9759b","source":{"kind":"arxiv","id":"1509.08021","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.08021","created_at":"2026-05-18T01:01:52Z"},{"alias_kind":"arxiv_version","alias_value":"1509.08021v2","created_at":"2026-05-18T01:01:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.08021","created_at":"2026-05-18T01:01:52Z"},{"alias_kind":"pith_short_12","alias_value":"3LCPW5KYL4IR","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_16","alias_value":"3LCPW5KYL4IRYQEB","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_8","alias_value":"3LCPW5KY","created_at":"2026-05-18T12:29:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:3LCPW5KYL4IRYQEBYAQFBO4AAB","target":"record","payload":{"canonical_record":{"source":{"id":"1509.08021","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-09-26T19:26:39Z","cross_cats_sorted":[],"title_canon_sha256":"c853b17e0c12d52a38764c37a68a2b73913bae7f3ddda5a558d059e041a348a4","abstract_canon_sha256":"aced88fa8fea053473b3852e80b397b58d23acdc6cd167cc009112a05368ce4a"},"schema_version":"1.0"},"canonical_sha256":"dac4fb75585f111c4081c02050bb80007e5fd81d34580e08956440bf4bb9759b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:01:52.181043Z","signature_b64":"ioQGi8X/krc02Vk+7o4ngqnSwruthbnkZ5yG7OLIsv+AfeFK69wXDdLIqrnAfSvIAs8dxzJx0ysuOQJDb6kpCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dac4fb75585f111c4081c02050bb80007e5fd81d34580e08956440bf4bb9759b","last_reissued_at":"2026-05-18T01:01:52.180400Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:01:52.180400Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1509.08021","source_version":2,"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-18T01:01:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mxibrfleXzWdABBX1zuhFimAnirupcZMGYdD0n3Krc3ONyV/6kH9oQ46XeQktEXFVh55B+oEbCUGpsHz8U6fDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T22:23:34.648026Z"},"content_sha256":"1bb0d89760b6aa8b43ed881445d37659913adca1017c235fb52fca51b072a479","schema_version":"1.0","event_id":"sha256:1bb0d89760b6aa8b43ed881445d37659913adca1017c235fb52fca51b072a479"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:3LCPW5KYL4IRYQEBYAQFBO4AAB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Degeneracy in Maximal Clique Decomposition for Semidefinite Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Andrew V. Knyazev, Arvind U. Raghunathan","submitted_at":"2015-09-26T19:26:39Z","abstract_excerpt":"Exploiting sparsity in Semidefinite Programs (SDP) is critical to solving large-scale problems. The chordal completion based maximal clique decomposition is the preferred approach for exploiting sparsity in SDPs. In this paper, we show that the maximal clique-based SDP decomposition is primal degenerate when the SDP has a low rank solution. We also derive conditions under which the multipliers in the maximal clique-based SDP formulation is not unique. Numerical experiments demonstrate that the SDP decomposition results in the schur-complement matrix of the Interior Point Method (IPM) having hi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.08021","kind":"arxiv","version":2},"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-18T01:01:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wZSt3luYioMNlMKhfb01Az8GNIdJs18VRq28XAcz12LCvmReuplg1HOIrLL0hF2C/x6zrGRsfnAkqMRWgsFFDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T22:23:34.648708Z"},"content_sha256":"6f8d4b902e9ae38b2ed4c409dfdde349a925f1445242ea557d379ef929fd364d","schema_version":"1.0","event_id":"sha256:6f8d4b902e9ae38b2ed4c409dfdde349a925f1445242ea557d379ef929fd364d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3LCPW5KYL4IRYQEBYAQFBO4AAB/bundle.json","state_url":"https://pith.science/pith/3LCPW5KYL4IRYQEBYAQFBO4AAB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3LCPW5KYL4IRYQEBYAQFBO4AAB/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-05-27T22:23:34Z","links":{"resolver":"https://pith.science/pith/3LCPW5KYL4IRYQEBYAQFBO4AAB","bundle":"https://pith.science/pith/3LCPW5KYL4IRYQEBYAQFBO4AAB/bundle.json","state":"https://pith.science/pith/3LCPW5KYL4IRYQEBYAQFBO4AAB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3LCPW5KYL4IRYQEBYAQFBO4AAB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:3LCPW5KYL4IRYQEBYAQFBO4AAB","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":"aced88fa8fea053473b3852e80b397b58d23acdc6cd167cc009112a05368ce4a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-09-26T19:26:39Z","title_canon_sha256":"c853b17e0c12d52a38764c37a68a2b73913bae7f3ddda5a558d059e041a348a4"},"schema_version":"1.0","source":{"id":"1509.08021","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.08021","created_at":"2026-05-18T01:01:52Z"},{"alias_kind":"arxiv_version","alias_value":"1509.08021v2","created_at":"2026-05-18T01:01:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.08021","created_at":"2026-05-18T01:01:52Z"},{"alias_kind":"pith_short_12","alias_value":"3LCPW5KYL4IR","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_16","alias_value":"3LCPW5KYL4IRYQEB","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_8","alias_value":"3LCPW5KY","created_at":"2026-05-18T12:29:02Z"}],"graph_snapshots":[{"event_id":"sha256:6f8d4b902e9ae38b2ed4c409dfdde349a925f1445242ea557d379ef929fd364d","target":"graph","created_at":"2026-05-18T01:01:52Z","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":"Exploiting sparsity in Semidefinite Programs (SDP) is critical to solving large-scale problems. The chordal completion based maximal clique decomposition is the preferred approach for exploiting sparsity in SDPs. In this paper, we show that the maximal clique-based SDP decomposition is primal degenerate when the SDP has a low rank solution. We also derive conditions under which the multipliers in the maximal clique-based SDP formulation is not unique. Numerical experiments demonstrate that the SDP decomposition results in the schur-complement matrix of the Interior Point Method (IPM) having hi","authors_text":"Andrew V. Knyazev, Arvind U. Raghunathan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-09-26T19:26:39Z","title":"Degeneracy in Maximal Clique Decomposition for Semidefinite Programs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.08021","kind":"arxiv","version":2},"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:1bb0d89760b6aa8b43ed881445d37659913adca1017c235fb52fca51b072a479","target":"record","created_at":"2026-05-18T01:01:52Z","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":"aced88fa8fea053473b3852e80b397b58d23acdc6cd167cc009112a05368ce4a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-09-26T19:26:39Z","title_canon_sha256":"c853b17e0c12d52a38764c37a68a2b73913bae7f3ddda5a558d059e041a348a4"},"schema_version":"1.0","source":{"id":"1509.08021","kind":"arxiv","version":2}},"canonical_sha256":"dac4fb75585f111c4081c02050bb80007e5fd81d34580e08956440bf4bb9759b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dac4fb75585f111c4081c02050bb80007e5fd81d34580e08956440bf4bb9759b","first_computed_at":"2026-05-18T01:01:52.180400Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:01:52.180400Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ioQGi8X/krc02Vk+7o4ngqnSwruthbnkZ5yG7OLIsv+AfeFK69wXDdLIqrnAfSvIAs8dxzJx0ysuOQJDb6kpCA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:01:52.181043Z","signed_message":"canonical_sha256_bytes"},"source_id":"1509.08021","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1bb0d89760b6aa8b43ed881445d37659913adca1017c235fb52fca51b072a479","sha256:6f8d4b902e9ae38b2ed4c409dfdde349a925f1445242ea557d379ef929fd364d"],"state_sha256":"7d9eb6003f5da59cfb1bf0f36293615ac7cb70f62b3305cf5e3f6ba77b88b6c6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/51hVUiTUPB6bfxlyNtgtd4zWE35OTUAEGWXup4ItoNPoNi+pdBMze1DVYgoLLVBnAKdorBVVdgVuUEtRh4dBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T22:23:34.652309Z","bundle_sha256":"0fe3d63f898713b3e1f014bea562c2ab67db0804a8f67d72c202c9d5cd7577ac"}}