{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:B6PKMFFOSUZ42AA24VYLPAUJM6","short_pith_number":"pith:B6PKMFFO","schema_version":"1.0","canonical_sha256":"0f9ea614ae9533cd001ae570b7828967848fde53532c0150d1afcac0941b31b4","source":{"kind":"arxiv","id":"1603.05188","version":1},"attestation_state":"computed","paper":{"title":"Computational Analysis of Sparsity-Exploiting Moment Relaxations of the OPF Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Cedric Josz, Daniel K. Molzahn, Ian A. Hiskens, Patrick Panciatici","submitted_at":"2016-03-16T17:41:41Z","abstract_excerpt":"With the potential to find global solutions, significant research interest has focused on convex relaxations of the non-convex OPF problem. Recently, \"moment-based\" relaxations from the Lasserre hierarchy for polynomial optimization have been shown capable of globally solving a broad class of OPF problems. Global solution of many large-scale test cases is accomplished by exploiting sparsity and selectively applying the computationally intensive higher-order relaxation constraints. Previous work describes an iterative algorithm that indicates the buses for which the higher-order constraints sho"},"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":"1603.05188","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-03-16T17:41:41Z","cross_cats_sorted":[],"title_canon_sha256":"7aef8f208366fb4e1823b4620c22ed1dafedc77ec71727d4b2525722f42bc562","abstract_canon_sha256":"234799fe3a5de6fda3831cbec4f0c534c8a5c7c38d3dc8a88cfed059653b764f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:18:57.909027Z","signature_b64":"Eqaf6hB4o97Z62IpnVjGPNWxkNDn/T71nsOmYQu5m0yQwLUGrh3eDQ1jiJ57FRr8R3KECHjiMp12OjD4YpIECw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0f9ea614ae9533cd001ae570b7828967848fde53532c0150d1afcac0941b31b4","last_reissued_at":"2026-05-18T01:18:57.908590Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:18:57.908590Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computational Analysis of Sparsity-Exploiting Moment Relaxations of the OPF Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Cedric Josz, Daniel K. Molzahn, Ian A. Hiskens, Patrick Panciatici","submitted_at":"2016-03-16T17:41:41Z","abstract_excerpt":"With the potential to find global solutions, significant research interest has focused on convex relaxations of the non-convex OPF problem. Recently, \"moment-based\" relaxations from the Lasserre hierarchy for polynomial optimization have been shown capable of globally solving a broad class of OPF problems. Global solution of many large-scale test cases is accomplished by exploiting sparsity and selectively applying the computationally intensive higher-order relaxation constraints. Previous work describes an iterative algorithm that indicates the buses for which the higher-order constraints sho"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.05188","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":"1603.05188","created_at":"2026-05-18T01:18:57.908667+00:00"},{"alias_kind":"arxiv_version","alias_value":"1603.05188v1","created_at":"2026-05-18T01:18:57.908667+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.05188","created_at":"2026-05-18T01:18:57.908667+00:00"},{"alias_kind":"pith_short_12","alias_value":"B6PKMFFOSUZ4","created_at":"2026-05-18T12:30:07.202191+00:00"},{"alias_kind":"pith_short_16","alias_value":"B6PKMFFOSUZ42AA2","created_at":"2026-05-18T12:30:07.202191+00:00"},{"alias_kind":"pith_short_8","alias_value":"B6PKMFFO","created_at":"2026-05-18T12:30:07.202191+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/B6PKMFFOSUZ42AA24VYLPAUJM6","json":"https://pith.science/pith/B6PKMFFOSUZ42AA24VYLPAUJM6.json","graph_json":"https://pith.science/api/pith-number/B6PKMFFOSUZ42AA24VYLPAUJM6/graph.json","events_json":"https://pith.science/api/pith-number/B6PKMFFOSUZ42AA24VYLPAUJM6/events.json","paper":"https://pith.science/paper/B6PKMFFO"},"agent_actions":{"view_html":"https://pith.science/pith/B6PKMFFOSUZ42AA24VYLPAUJM6","download_json":"https://pith.science/pith/B6PKMFFOSUZ42AA24VYLPAUJM6.json","view_paper":"https://pith.science/paper/B6PKMFFO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1603.05188&json=true","fetch_graph":"https://pith.science/api/pith-number/B6PKMFFOSUZ42AA24VYLPAUJM6/graph.json","fetch_events":"https://pith.science/api/pith-number/B6PKMFFOSUZ42AA24VYLPAUJM6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/B6PKMFFOSUZ42AA24VYLPAUJM6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/B6PKMFFOSUZ42AA24VYLPAUJM6/action/storage_attestation","attest_author":"https://pith.science/pith/B6PKMFFOSUZ42AA24VYLPAUJM6/action/author_attestation","sign_citation":"https://pith.science/pith/B6PKMFFOSUZ42AA24VYLPAUJM6/action/citation_signature","submit_replication":"https://pith.science/pith/B6PKMFFOSUZ42AA24VYLPAUJM6/action/replication_record"}},"created_at":"2026-05-18T01:18:57.908667+00:00","updated_at":"2026-05-18T01:18:57.908667+00:00"}