{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:CQXC2EUSCHZFZHS723KWTLATSH","short_pith_number":"pith:CQXC2EUS","canonical_record":{"source":{"id":"1804.05128","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-04-13T21:35:28Z","cross_cats_sorted":[],"title_canon_sha256":"2731ef143c334f582cfb886928dbeeb170f6a5f557538da8d06f3c435e87018a","abstract_canon_sha256":"ea1c826e8e9fa137f15cb4ba497906aa54957240a9efa01e6fdc1c5b525f14c0"},"schema_version":"1.0"},"canonical_sha256":"142e2d129211f25c9e5fd6d569ac1391ff072cc8931b4a94cc4e0580c12a8fd1","source":{"kind":"arxiv","id":"1804.05128","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.05128","created_at":"2026-05-18T00:03:56Z"},{"alias_kind":"arxiv_version","alias_value":"1804.05128v2","created_at":"2026-05-18T00:03:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.05128","created_at":"2026-05-18T00:03:56Z"},{"alias_kind":"pith_short_12","alias_value":"CQXC2EUSCHZF","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"CQXC2EUSCHZFZHS7","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"CQXC2EUS","created_at":"2026-05-18T12:32:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:CQXC2EUSCHZFZHS723KWTLATSH","target":"record","payload":{"canonical_record":{"source":{"id":"1804.05128","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-04-13T21:35:28Z","cross_cats_sorted":[],"title_canon_sha256":"2731ef143c334f582cfb886928dbeeb170f6a5f557538da8d06f3c435e87018a","abstract_canon_sha256":"ea1c826e8e9fa137f15cb4ba497906aa54957240a9efa01e6fdc1c5b525f14c0"},"schema_version":"1.0"},"canonical_sha256":"142e2d129211f25c9e5fd6d569ac1391ff072cc8931b4a94cc4e0580c12a8fd1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:03:56.151458Z","signature_b64":"+/1zEun8wPvzjDF/o9AP38AbdQJYMWVVXokQkORbiwJvyK/0tphqYDDyT1u2xd8cebeLxUbG6aXtGjBWKQGZAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"142e2d129211f25c9e5fd6d569ac1391ff072cc8931b4a94cc4e0580c12a8fd1","last_reissued_at":"2026-05-18T00:03:56.150758Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:03:56.150758Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1804.05128","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-18T00:03:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DBuyWic2OKa5m2YwoWEan9MMi4pgSlFKmN8EnWmgrxDvVRNry6+ORBA7o7hmMZ+8Pc2O8ydlJFmR3SqZfLFYAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T13:36:58.825870Z"},"content_sha256":"98f2388cca46f43439b8f07abf51d5c6828607d4a2e0ba1ff8ecf04845531d52","schema_version":"1.0","event_id":"sha256:98f2388cca46f43439b8f07abf51d5c6828607d4a2e0ba1ff8ecf04845531d52"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:CQXC2EUSCHZFZHS723KWTLATSH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Achieving SDP Tightness Through SOCP Relaxation with Cycle-Based SDP Feasibility Constraints for AC OPF","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Bo Zeng, Hossein Ghassempour Aghamolki, Lingling Fan, Zhixin Miao","submitted_at":"2018-04-13T21:35:28Z","abstract_excerpt":"In this paper, we show that the standard semidefinite programming (SDP) relaxation of altering current optimal power flow (AC OPF) can be equivalently reformulated as second-order cone programming (SOCP) relaxation with maximal clique- and cycle-based SDP feasibility constraints. The formulation is based on the positive semi-definite (PSD) matrix completion theorem, which states that if all sub-matrices corresponding to maximal cliques in a chordal graph are PSD, then the partial matrix related to the chordal graph can be completed as a full PSD matrix. Existing methods in [1] first construct "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.05128","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-18T00:03:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"W/2mN2cAbcA6cIgD2RNuQ3a9CzI5gwt0pJ+NhlaFWVphIPvw8MhBKGrGB4VGQ++JwXZPJnFkyjp0ULaA0vLBAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T13:36:58.826430Z"},"content_sha256":"3f43db8c2efa8b9ad5ce4eb09333b3fba9f7a4aac8e517a83c190f9bd21461ea","schema_version":"1.0","event_id":"sha256:3f43db8c2efa8b9ad5ce4eb09333b3fba9f7a4aac8e517a83c190f9bd21461ea"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CQXC2EUSCHZFZHS723KWTLATSH/bundle.json","state_url":"https://pith.science/pith/CQXC2EUSCHZFZHS723KWTLATSH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CQXC2EUSCHZFZHS723KWTLATSH/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-06-05T13:36:58Z","links":{"resolver":"https://pith.science/pith/CQXC2EUSCHZFZHS723KWTLATSH","bundle":"https://pith.science/pith/CQXC2EUSCHZFZHS723KWTLATSH/bundle.json","state":"https://pith.science/pith/CQXC2EUSCHZFZHS723KWTLATSH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CQXC2EUSCHZFZHS723KWTLATSH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:CQXC2EUSCHZFZHS723KWTLATSH","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":"ea1c826e8e9fa137f15cb4ba497906aa54957240a9efa01e6fdc1c5b525f14c0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-04-13T21:35:28Z","title_canon_sha256":"2731ef143c334f582cfb886928dbeeb170f6a5f557538da8d06f3c435e87018a"},"schema_version":"1.0","source":{"id":"1804.05128","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.05128","created_at":"2026-05-18T00:03:56Z"},{"alias_kind":"arxiv_version","alias_value":"1804.05128v2","created_at":"2026-05-18T00:03:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.05128","created_at":"2026-05-18T00:03:56Z"},{"alias_kind":"pith_short_12","alias_value":"CQXC2EUSCHZF","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"CQXC2EUSCHZFZHS7","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"CQXC2EUS","created_at":"2026-05-18T12:32:16Z"}],"graph_snapshots":[{"event_id":"sha256:3f43db8c2efa8b9ad5ce4eb09333b3fba9f7a4aac8e517a83c190f9bd21461ea","target":"graph","created_at":"2026-05-18T00:03:56Z","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":"In this paper, we show that the standard semidefinite programming (SDP) relaxation of altering current optimal power flow (AC OPF) can be equivalently reformulated as second-order cone programming (SOCP) relaxation with maximal clique- and cycle-based SDP feasibility constraints. The formulation is based on the positive semi-definite (PSD) matrix completion theorem, which states that if all sub-matrices corresponding to maximal cliques in a chordal graph are PSD, then the partial matrix related to the chordal graph can be completed as a full PSD matrix. Existing methods in [1] first construct ","authors_text":"Bo Zeng, Hossein Ghassempour Aghamolki, Lingling Fan, Zhixin Miao","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-04-13T21:35:28Z","title":"Achieving SDP Tightness Through SOCP Relaxation with Cycle-Based SDP Feasibility Constraints for AC OPF"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.05128","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:98f2388cca46f43439b8f07abf51d5c6828607d4a2e0ba1ff8ecf04845531d52","target":"record","created_at":"2026-05-18T00:03:56Z","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":"ea1c826e8e9fa137f15cb4ba497906aa54957240a9efa01e6fdc1c5b525f14c0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-04-13T21:35:28Z","title_canon_sha256":"2731ef143c334f582cfb886928dbeeb170f6a5f557538da8d06f3c435e87018a"},"schema_version":"1.0","source":{"id":"1804.05128","kind":"arxiv","version":2}},"canonical_sha256":"142e2d129211f25c9e5fd6d569ac1391ff072cc8931b4a94cc4e0580c12a8fd1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"142e2d129211f25c9e5fd6d569ac1391ff072cc8931b4a94cc4e0580c12a8fd1","first_computed_at":"2026-05-18T00:03:56.150758Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:03:56.150758Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+/1zEun8wPvzjDF/o9AP38AbdQJYMWVVXokQkORbiwJvyK/0tphqYDDyT1u2xd8cebeLxUbG6aXtGjBWKQGZAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:03:56.151458Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.05128","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:98f2388cca46f43439b8f07abf51d5c6828607d4a2e0ba1ff8ecf04845531d52","sha256:3f43db8c2efa8b9ad5ce4eb09333b3fba9f7a4aac8e517a83c190f9bd21461ea"],"state_sha256":"60bdf32b8456799f677b573d3711deb6231d71dc4608939da9e199ee298c83d4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QnQN+c6EwAJ5LIEhwJpOpvnb8oZEbf52BgSsdAuDc8ef+rEEoQ2iRTLV+yMvnWLCH61QOCq9aOnRX0pUC9YjBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T13:36:58.829016Z","bundle_sha256":"5e12bd202786d6289b2be40d658c223b3cd811c393a237cdc3924ace67531046"}}