{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:CGN7QPLRTAPJ7NXVLAFKA3VUEQ","short_pith_number":"pith:CGN7QPLR","schema_version":"1.0","canonical_sha256":"119bf83d71981e9fb6f5580aa06eb424384c499e5b56968e08b122632b494001","source":{"kind":"arxiv","id":"1404.3626","version":3},"attestation_state":"computed","paper":{"title":"Optimal Power Flow as a Polynomial Optimization Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"math.OC","authors_text":"Bissan Ghaddar, Jakub Marecek, Martin Mevissen","submitted_at":"2014-04-14T15:48:28Z","abstract_excerpt":"Formulating the alternating current optimal power flow (ACOPF) as a polynomial optimization problem makes it possible to solve large instances in practice and to guarantee asymptotic convergence in theory."},"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":"1404.3626","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-04-14T15:48:28Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"9e8db82de2ae2bd018e9048ca9b460b09a3a74d6a26f449f72706798f268784c","abstract_canon_sha256":"23d9ce50feb5eb1d2ad93f8a18208fd3658ab4391b0c68b913746c04798e1c9e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:23:09.857999Z","signature_b64":"7HiR0n1XWLYfgdTD2FZ0EWHM7I/4SU+xtY9sXN5NUto9lhe7hVNe19mXrH/St9590MSSO6buOtsnqKG5A5gMDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"119bf83d71981e9fb6f5580aa06eb424384c499e5b56968e08b122632b494001","last_reissued_at":"2026-05-18T00:23:09.857284Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:23:09.857284Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Power Flow as a Polynomial Optimization Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"math.OC","authors_text":"Bissan Ghaddar, Jakub Marecek, Martin Mevissen","submitted_at":"2014-04-14T15:48:28Z","abstract_excerpt":"Formulating the alternating current optimal power flow (ACOPF) as a polynomial optimization problem makes it possible to solve large instances in practice and to guarantee asymptotic convergence in theory."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.3626","kind":"arxiv","version":3},"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":"1404.3626","created_at":"2026-05-18T00:23:09.857391+00:00"},{"alias_kind":"arxiv_version","alias_value":"1404.3626v3","created_at":"2026-05-18T00:23:09.857391+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.3626","created_at":"2026-05-18T00:23:09.857391+00:00"},{"alias_kind":"pith_short_12","alias_value":"CGN7QPLRTAPJ","created_at":"2026-05-18T12:28:22.404517+00:00"},{"alias_kind":"pith_short_16","alias_value":"CGN7QPLRTAPJ7NXV","created_at":"2026-05-18T12:28:22.404517+00:00"},{"alias_kind":"pith_short_8","alias_value":"CGN7QPLR","created_at":"2026-05-18T12:28:22.404517+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/CGN7QPLRTAPJ7NXVLAFKA3VUEQ","json":"https://pith.science/pith/CGN7QPLRTAPJ7NXVLAFKA3VUEQ.json","graph_json":"https://pith.science/api/pith-number/CGN7QPLRTAPJ7NXVLAFKA3VUEQ/graph.json","events_json":"https://pith.science/api/pith-number/CGN7QPLRTAPJ7NXVLAFKA3VUEQ/events.json","paper":"https://pith.science/paper/CGN7QPLR"},"agent_actions":{"view_html":"https://pith.science/pith/CGN7QPLRTAPJ7NXVLAFKA3VUEQ","download_json":"https://pith.science/pith/CGN7QPLRTAPJ7NXVLAFKA3VUEQ.json","view_paper":"https://pith.science/paper/CGN7QPLR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1404.3626&json=true","fetch_graph":"https://pith.science/api/pith-number/CGN7QPLRTAPJ7NXVLAFKA3VUEQ/graph.json","fetch_events":"https://pith.science/api/pith-number/CGN7QPLRTAPJ7NXVLAFKA3VUEQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CGN7QPLRTAPJ7NXVLAFKA3VUEQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CGN7QPLRTAPJ7NXVLAFKA3VUEQ/action/storage_attestation","attest_author":"https://pith.science/pith/CGN7QPLRTAPJ7NXVLAFKA3VUEQ/action/author_attestation","sign_citation":"https://pith.science/pith/CGN7QPLRTAPJ7NXVLAFKA3VUEQ/action/citation_signature","submit_replication":"https://pith.science/pith/CGN7QPLRTAPJ7NXVLAFKA3VUEQ/action/replication_record"}},"created_at":"2026-05-18T00:23:09.857391+00:00","updated_at":"2026-05-18T00:23:09.857391+00:00"}