{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:6YFWWSLS45QC2RWEVNBJJBYKY4","short_pith_number":"pith:6YFWWSLS","schema_version":"1.0","canonical_sha256":"f60b6b4972e7602d46c4ab4294870ac70bf119bb2271ed845b210b2b53a898b3","source":{"kind":"arxiv","id":"1504.07755","version":1},"attestation_state":"computed","paper":{"title":"Distributed Semidefinite Programming with Application to Large-scale System Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Anders Hansson, Anders Rantzer, Martin S. Andersen, Sina Khoshfetrat Pakazad","submitted_at":"2015-04-29T08:15:08Z","abstract_excerpt":"Distributed algorithms for solving coupled semidefinite programs (SDPs) commonly require many iterations to converge. They also put high computational demand on the computational agents. In this paper we show that in case the coupled problem has an inherent tree structure, it is possible to devise an efficient distributed algorithm for solving such problems. This algorithm can potentially enjoy the same efficiency as centralized solvers that exploit sparsity. The proposed algorithm relies on predictor-corrector primal-dual interior-point methods, where we use a message-passing algorithm to com"},"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":"1504.07755","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-04-29T08:15:08Z","cross_cats_sorted":[],"title_canon_sha256":"34097502f3efe39693c11f45f934127b708cbeb6a28a1354ddfb1c6f443a09a6","abstract_canon_sha256":"52cb21b1ec610238cdd5a9aef26180346a561be24dedfa10b2634c216e6251eb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:17:32.334903Z","signature_b64":"YL3B43bGMKgcGohk/+lGqZ7O8mVGatMR2tAAsPr9oBOU6le/Qhe9HtrH2U1aIn1d1t/2zqx68DU+NwZC6+e5BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f60b6b4972e7602d46c4ab4294870ac70bf119bb2271ed845b210b2b53a898b3","last_reissued_at":"2026-05-18T02:17:32.334123Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:17:32.334123Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distributed Semidefinite Programming with Application to Large-scale System Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Anders Hansson, Anders Rantzer, Martin S. Andersen, Sina Khoshfetrat Pakazad","submitted_at":"2015-04-29T08:15:08Z","abstract_excerpt":"Distributed algorithms for solving coupled semidefinite programs (SDPs) commonly require many iterations to converge. They also put high computational demand on the computational agents. In this paper we show that in case the coupled problem has an inherent tree structure, it is possible to devise an efficient distributed algorithm for solving such problems. This algorithm can potentially enjoy the same efficiency as centralized solvers that exploit sparsity. The proposed algorithm relies on predictor-corrector primal-dual interior-point methods, where we use a message-passing algorithm to com"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.07755","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":""},"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":"1504.07755","created_at":"2026-05-18T02:17:32.334233+00:00"},{"alias_kind":"arxiv_version","alias_value":"1504.07755v1","created_at":"2026-05-18T02:17:32.334233+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.07755","created_at":"2026-05-18T02:17:32.334233+00:00"},{"alias_kind":"pith_short_12","alias_value":"6YFWWSLS45QC","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_16","alias_value":"6YFWWSLS45QC2RWE","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_8","alias_value":"6YFWWSLS","created_at":"2026-05-18T12:29:07.941421+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/6YFWWSLS45QC2RWEVNBJJBYKY4","json":"https://pith.science/pith/6YFWWSLS45QC2RWEVNBJJBYKY4.json","graph_json":"https://pith.science/api/pith-number/6YFWWSLS45QC2RWEVNBJJBYKY4/graph.json","events_json":"https://pith.science/api/pith-number/6YFWWSLS45QC2RWEVNBJJBYKY4/events.json","paper":"https://pith.science/paper/6YFWWSLS"},"agent_actions":{"view_html":"https://pith.science/pith/6YFWWSLS45QC2RWEVNBJJBYKY4","download_json":"https://pith.science/pith/6YFWWSLS45QC2RWEVNBJJBYKY4.json","view_paper":"https://pith.science/paper/6YFWWSLS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1504.07755&json=true","fetch_graph":"https://pith.science/api/pith-number/6YFWWSLS45QC2RWEVNBJJBYKY4/graph.json","fetch_events":"https://pith.science/api/pith-number/6YFWWSLS45QC2RWEVNBJJBYKY4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6YFWWSLS45QC2RWEVNBJJBYKY4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6YFWWSLS45QC2RWEVNBJJBYKY4/action/storage_attestation","attest_author":"https://pith.science/pith/6YFWWSLS45QC2RWEVNBJJBYKY4/action/author_attestation","sign_citation":"https://pith.science/pith/6YFWWSLS45QC2RWEVNBJJBYKY4/action/citation_signature","submit_replication":"https://pith.science/pith/6YFWWSLS45QC2RWEVNBJJBYKY4/action/replication_record"}},"created_at":"2026-05-18T02:17:32.334233+00:00","updated_at":"2026-05-18T02:17:32.334233+00:00"}