{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:B5IY4ECDQ7FBPZ6ZSXNN5G2FCL","short_pith_number":"pith:B5IY4ECD","canonical_record":{"source":{"id":"1907.03173","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-07-06T19:30:20Z","cross_cats_sorted":[],"title_canon_sha256":"d8b33ab87d8cabcbb57a9a1fff199475b7553c4825c70be1ba727191df38643b","abstract_canon_sha256":"c2e74c832b110497e1568bddb7e52a4449d91aab64f16431569bf46919e0c1f0"},"schema_version":"1.0"},"canonical_sha256":"0f518e104387ca17e7d995dade9b4512f3aaaa9b0ab14ec2aa0f71adf7c9784c","source":{"kind":"arxiv","id":"1907.03173","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.03173","created_at":"2026-05-17T23:41:18Z"},{"alias_kind":"arxiv_version","alias_value":"1907.03173v1","created_at":"2026-05-17T23:41:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.03173","created_at":"2026-05-17T23:41:18Z"},{"alias_kind":"pith_short_12","alias_value":"B5IY4ECDQ7FB","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"B5IY4ECDQ7FBPZ6Z","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"B5IY4ECD","created_at":"2026-05-18T12:33:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:B5IY4ECDQ7FBPZ6ZSXNN5G2FCL","target":"record","payload":{"canonical_record":{"source":{"id":"1907.03173","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-07-06T19:30:20Z","cross_cats_sorted":[],"title_canon_sha256":"d8b33ab87d8cabcbb57a9a1fff199475b7553c4825c70be1ba727191df38643b","abstract_canon_sha256":"c2e74c832b110497e1568bddb7e52a4449d91aab64f16431569bf46919e0c1f0"},"schema_version":"1.0"},"canonical_sha256":"0f518e104387ca17e7d995dade9b4512f3aaaa9b0ab14ec2aa0f71adf7c9784c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:18.737847Z","signature_b64":"cfI4ORIlJwcdRo0RkeTVyKOsx3YKXlfBPMNALbK1rLWcTDgmViTr4+wZaJvl5FY9VX72YIWyOcdLfUMVUcsABA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0f518e104387ca17e7d995dade9b4512f3aaaa9b0ab14ec2aa0f71adf7c9784c","last_reissued_at":"2026-05-17T23:41:18.737330Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:18.737330Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1907.03173","source_version":1,"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-17T23:41:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B0H6V3fPTuyWfJ/6aG4Xis0Pu1r2/2IVfFzBzKFqQhd65DC/WLLC6zPPEo5FGiOxjKMv+BaQC1tjKY+jboxOCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T22:31:45.147405Z"},"content_sha256":"da65ce6a9e042d5a9b403ca791b1f9cf478d72802863da4967e856e044f43864","schema_version":"1.0","event_id":"sha256:da65ce6a9e042d5a9b403ca791b1f9cf478d72802863da4967e856e044f43864"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:B5IY4ECDQ7FBPZ6ZSXNN5G2FCL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Plug-n-Play Alternating Projection Algorithm for Large-scale Security Constraint Optimal Power Flow","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Tuyen Vu","submitted_at":"2019-07-06T19:30:20Z","abstract_excerpt":"In this paper, we present an optimization algorithm based on an alternating projection method to solve the large-scale security constraint optimal power flow (SCOPF) problem in power systems. The SCOPF is first partitioned into sub-problems, which share common power components. The proposed algorithm is fundamentally a distributed computing algorithm, which optimizes power flow in each electrical bus. The output of the local optimization problem will be exchanged among neighboring buses for the overall solution for the whole power system. We performed the algorithm against a modified 14-bus po"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.03173","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"},"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-17T23:41:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AiMztwz7gPHVB6cnhl5dpxkAygPf0UZipPDuk5Ob+DUgalBU+SkcTmHaALLpReQB+Ia2FhA2odGdblVkeb9QAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T22:31:45.148019Z"},"content_sha256":"d63c77f661201bd6de663cd26bd6406475d4ded0d3f0e9101b869e82e49693a0","schema_version":"1.0","event_id":"sha256:d63c77f661201bd6de663cd26bd6406475d4ded0d3f0e9101b869e82e49693a0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/B5IY4ECDQ7FBPZ6ZSXNN5G2FCL/bundle.json","state_url":"https://pith.science/pith/B5IY4ECDQ7FBPZ6ZSXNN5G2FCL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/B5IY4ECDQ7FBPZ6ZSXNN5G2FCL/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-05-25T22:31:45Z","links":{"resolver":"https://pith.science/pith/B5IY4ECDQ7FBPZ6ZSXNN5G2FCL","bundle":"https://pith.science/pith/B5IY4ECDQ7FBPZ6ZSXNN5G2FCL/bundle.json","state":"https://pith.science/pith/B5IY4ECDQ7FBPZ6ZSXNN5G2FCL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/B5IY4ECDQ7FBPZ6ZSXNN5G2FCL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:B5IY4ECDQ7FBPZ6ZSXNN5G2FCL","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":"c2e74c832b110497e1568bddb7e52a4449d91aab64f16431569bf46919e0c1f0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-07-06T19:30:20Z","title_canon_sha256":"d8b33ab87d8cabcbb57a9a1fff199475b7553c4825c70be1ba727191df38643b"},"schema_version":"1.0","source":{"id":"1907.03173","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.03173","created_at":"2026-05-17T23:41:18Z"},{"alias_kind":"arxiv_version","alias_value":"1907.03173v1","created_at":"2026-05-17T23:41:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.03173","created_at":"2026-05-17T23:41:18Z"},{"alias_kind":"pith_short_12","alias_value":"B5IY4ECDQ7FB","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"B5IY4ECDQ7FBPZ6Z","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"B5IY4ECD","created_at":"2026-05-18T12:33:12Z"}],"graph_snapshots":[{"event_id":"sha256:d63c77f661201bd6de663cd26bd6406475d4ded0d3f0e9101b869e82e49693a0","target":"graph","created_at":"2026-05-17T23:41:18Z","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 present an optimization algorithm based on an alternating projection method to solve the large-scale security constraint optimal power flow (SCOPF) problem in power systems. The SCOPF is first partitioned into sub-problems, which share common power components. The proposed algorithm is fundamentally a distributed computing algorithm, which optimizes power flow in each electrical bus. The output of the local optimization problem will be exchanged among neighboring buses for the overall solution for the whole power system. We performed the algorithm against a modified 14-bus po","authors_text":"Tuyen Vu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-07-06T19:30:20Z","title":"Plug-n-Play Alternating Projection Algorithm for Large-scale Security Constraint Optimal Power Flow"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.03173","kind":"arxiv","version":1},"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:da65ce6a9e042d5a9b403ca791b1f9cf478d72802863da4967e856e044f43864","target":"record","created_at":"2026-05-17T23:41:18Z","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":"c2e74c832b110497e1568bddb7e52a4449d91aab64f16431569bf46919e0c1f0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-07-06T19:30:20Z","title_canon_sha256":"d8b33ab87d8cabcbb57a9a1fff199475b7553c4825c70be1ba727191df38643b"},"schema_version":"1.0","source":{"id":"1907.03173","kind":"arxiv","version":1}},"canonical_sha256":"0f518e104387ca17e7d995dade9b4512f3aaaa9b0ab14ec2aa0f71adf7c9784c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0f518e104387ca17e7d995dade9b4512f3aaaa9b0ab14ec2aa0f71adf7c9784c","first_computed_at":"2026-05-17T23:41:18.737330Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:41:18.737330Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cfI4ORIlJwcdRo0RkeTVyKOsx3YKXlfBPMNALbK1rLWcTDgmViTr4+wZaJvl5FY9VX72YIWyOcdLfUMVUcsABA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:41:18.737847Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.03173","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:da65ce6a9e042d5a9b403ca791b1f9cf478d72802863da4967e856e044f43864","sha256:d63c77f661201bd6de663cd26bd6406475d4ded0d3f0e9101b869e82e49693a0"],"state_sha256":"af059df627407d85c29a9e1079fae8a6c895d78445d7e0e3b550d8b790acd908"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PGp8uB37zrqZyU84wpwFlMSwQm9eN/S6SqLl24Y1JE9/lNfLTzFSLL/X0mhLWOC2U0hrFiNGhXQEnkNIIoxZBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T22:31:45.150882Z","bundle_sha256":"18deca3b62314c6517ce9633ca4aaac40b03f4cd9c370765526c1f013c781192"}}