{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:7ZQUMLDJG4BSDW7R3NJQ4MS5VD","short_pith_number":"pith:7ZQUMLDJ","schema_version":"1.0","canonical_sha256":"fe61462c69370321dbf1db530e325da8e737ec1264e6387da3db0e780127b9dc","source":{"kind":"arxiv","id":"1506.08568","version":2},"attestation_state":"computed","paper":{"title":"A Low-Rank Coordinate-Descent Algorithm for Semidefinite Programming Relaxations of Optimal Power Flow","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Jakub Marecek, Martin Takac","submitted_at":"2015-06-29T10:09:46Z","abstract_excerpt":"The alternating-current optimal power flow (ACOPF) is one of the best known non-convex non-linear optimisation problems. We present a novel re-formulation of ACOPF, which is based on lifting the rectangular power-voltage rank-constrained formulation, and makes it possible to derive alternative SDP relaxations. For those, we develop a first-order method based on the parallel coordinate descent with a novel closed-form step based on roots of cubic polynomials."},"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":"1506.08568","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-06-29T10:09:46Z","cross_cats_sorted":[],"title_canon_sha256":"524619a7ed94e51c2f53ac87cbd904ee3e22d4032e17b394c45aa0b8ef604c0d","abstract_canon_sha256":"0e8d8f1b5e418a8fea6d0ae24bab16e846ec7e2ee21e6c600b54d67a8a96f6c2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:23:09.718127Z","signature_b64":"qZ/RA4wUNB8jaYaxYijUj4hnttRQCC/XQus+MUdEXQJBvemtXDRteLVwM3Hk6def7ft+WoDiZYuBbmA99bsGDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fe61462c69370321dbf1db530e325da8e737ec1264e6387da3db0e780127b9dc","last_reissued_at":"2026-05-18T00:23:09.717448Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:23:09.717448Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Low-Rank Coordinate-Descent Algorithm for Semidefinite Programming Relaxations of Optimal Power Flow","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Jakub Marecek, Martin Takac","submitted_at":"2015-06-29T10:09:46Z","abstract_excerpt":"The alternating-current optimal power flow (ACOPF) is one of the best known non-convex non-linear optimisation problems. We present a novel re-formulation of ACOPF, which is based on lifting the rectangular power-voltage rank-constrained formulation, and makes it possible to derive alternative SDP relaxations. For those, we develop a first-order method based on the parallel coordinate descent with a novel closed-form step based on roots of cubic polynomials."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.08568","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1506.08568","created_at":"2026-05-18T00:23:09.717551+00:00"},{"alias_kind":"arxiv_version","alias_value":"1506.08568v2","created_at":"2026-05-18T00:23:09.717551+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.08568","created_at":"2026-05-18T00:23:09.717551+00:00"},{"alias_kind":"pith_short_12","alias_value":"7ZQUMLDJG4BS","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_16","alias_value":"7ZQUMLDJG4BSDW7R","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_8","alias_value":"7ZQUMLDJ","created_at":"2026-05-18T12:29:10.953037+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/7ZQUMLDJG4BSDW7R3NJQ4MS5VD","json":"https://pith.science/pith/7ZQUMLDJG4BSDW7R3NJQ4MS5VD.json","graph_json":"https://pith.science/api/pith-number/7ZQUMLDJG4BSDW7R3NJQ4MS5VD/graph.json","events_json":"https://pith.science/api/pith-number/7ZQUMLDJG4BSDW7R3NJQ4MS5VD/events.json","paper":"https://pith.science/paper/7ZQUMLDJ"},"agent_actions":{"view_html":"https://pith.science/pith/7ZQUMLDJG4BSDW7R3NJQ4MS5VD","download_json":"https://pith.science/pith/7ZQUMLDJG4BSDW7R3NJQ4MS5VD.json","view_paper":"https://pith.science/paper/7ZQUMLDJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1506.08568&json=true","fetch_graph":"https://pith.science/api/pith-number/7ZQUMLDJG4BSDW7R3NJQ4MS5VD/graph.json","fetch_events":"https://pith.science/api/pith-number/7ZQUMLDJG4BSDW7R3NJQ4MS5VD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7ZQUMLDJG4BSDW7R3NJQ4MS5VD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7ZQUMLDJG4BSDW7R3NJQ4MS5VD/action/storage_attestation","attest_author":"https://pith.science/pith/7ZQUMLDJG4BSDW7R3NJQ4MS5VD/action/author_attestation","sign_citation":"https://pith.science/pith/7ZQUMLDJG4BSDW7R3NJQ4MS5VD/action/citation_signature","submit_replication":"https://pith.science/pith/7ZQUMLDJG4BSDW7R3NJQ4MS5VD/action/replication_record"}},"created_at":"2026-05-18T00:23:09.717551+00:00","updated_at":"2026-05-18T00:23:09.717551+00:00"}