{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:BWCJQHNKVP6UWEVN32JH3B2OKT","short_pith_number":"pith:BWCJQHNK","canonical_record":{"source":{"id":"1808.03468","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CE","submitted_at":"2018-08-10T09:48:09Z","cross_cats_sorted":[],"title_canon_sha256":"28b4bead70a5103d6e2ba49686f3f8ce41ca5dbbfdd109a1730edfd15f855363","abstract_canon_sha256":"c303054fa5d54be81a75398f1442860cfef39b61cd330c93f94caa72c78c7482"},"schema_version":"1.0"},"canonical_sha256":"0d84981daaabfd4b12adde927d874e54fc623655d08bde1bedd1343aa4ecb4fc","source":{"kind":"arxiv","id":"1808.03468","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.03468","created_at":"2026-05-18T00:08:20Z"},{"alias_kind":"arxiv_version","alias_value":"1808.03468v2","created_at":"2026-05-18T00:08:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.03468","created_at":"2026-05-18T00:08:20Z"},{"alias_kind":"pith_short_12","alias_value":"BWCJQHNKVP6U","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"BWCJQHNKVP6UWEVN","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"BWCJQHNK","created_at":"2026-05-18T12:32:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:BWCJQHNKVP6UWEVN32JH3B2OKT","target":"record","payload":{"canonical_record":{"source":{"id":"1808.03468","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CE","submitted_at":"2018-08-10T09:48:09Z","cross_cats_sorted":[],"title_canon_sha256":"28b4bead70a5103d6e2ba49686f3f8ce41ca5dbbfdd109a1730edfd15f855363","abstract_canon_sha256":"c303054fa5d54be81a75398f1442860cfef39b61cd330c93f94caa72c78c7482"},"schema_version":"1.0"},"canonical_sha256":"0d84981daaabfd4b12adde927d874e54fc623655d08bde1bedd1343aa4ecb4fc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:08:20.196367Z","signature_b64":"BzAXnUYyQXpJnvd67ezIAxLdx5nAPm/Bvhyvgwdt039Z81PwsCCUKR+jEcQhsn0oEqOeL8uaKC7Lo5erBLuUCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0d84981daaabfd4b12adde927d874e54fc623655d08bde1bedd1343aa4ecb4fc","last_reissued_at":"2026-05-18T00:08:20.195710Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:08:20.195710Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1808.03468","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:08:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wQuw7yV5tOxjEQRfiVH7NHoa+gmHSPtNxpjs87r67+5miEP4Id6e5nzvdVsLrCubJlSSUUIpPIT1auYx4cAaAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T10:43:57.907282Z"},"content_sha256":"d283bbabcf3ebb3cceb507a667895726dfe92787ee12094291b6c3deb27f912f","schema_version":"1.0","event_id":"sha256:d283bbabcf3ebb3cceb507a667895726dfe92787ee12094291b6c3deb27f912f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:BWCJQHNKVP6UWEVN32JH3B2OKT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Accelerated Methods for the SOCP-relaxed Component-based Distributed Optimal Power Flow","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CE","authors_text":"Archie Chapman, Gregor Verbic, Sleiman Mhanna","submitted_at":"2018-08-10T09:48:09Z","abstract_excerpt":"In light of the increased focus on distributed methods, this paper proposes two accelerated subgradient methods and an adaptive penalty parameter scheme to speed-up the convergence of ADMM on the component-based dual decomposition of the second-order cone programming (SOCP) relaxation of the OPF. This work is the first to apply an adaptive penalty parameter method along with an accelerated subgradient method together in one scheme for distributed OPF. This accelerated scheme is demonstrated to reach substantial speed-ups, as high as 87%, on real-world test systems with more than 9000 buses, as"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.03468","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:08:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mgH3caZ9Rj9RghLD0eAUfZ/6NI96c05LP72YTe89kkJ/orhSC3AngK5CLL/pGaJp41HjXRyGLhcPkMFKAEf/CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T10:43:57.907879Z"},"content_sha256":"94ff91bbdb5cb6a25f66b5eaf6f9992c4f9f90ec2223605eab157c79384822ab","schema_version":"1.0","event_id":"sha256:94ff91bbdb5cb6a25f66b5eaf6f9992c4f9f90ec2223605eab157c79384822ab"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BWCJQHNKVP6UWEVN32JH3B2OKT/bundle.json","state_url":"https://pith.science/pith/BWCJQHNKVP6UWEVN32JH3B2OKT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BWCJQHNKVP6UWEVN32JH3B2OKT/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-01T10:43:57Z","links":{"resolver":"https://pith.science/pith/BWCJQHNKVP6UWEVN32JH3B2OKT","bundle":"https://pith.science/pith/BWCJQHNKVP6UWEVN32JH3B2OKT/bundle.json","state":"https://pith.science/pith/BWCJQHNKVP6UWEVN32JH3B2OKT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BWCJQHNKVP6UWEVN32JH3B2OKT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:BWCJQHNKVP6UWEVN32JH3B2OKT","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":"c303054fa5d54be81a75398f1442860cfef39b61cd330c93f94caa72c78c7482","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CE","submitted_at":"2018-08-10T09:48:09Z","title_canon_sha256":"28b4bead70a5103d6e2ba49686f3f8ce41ca5dbbfdd109a1730edfd15f855363"},"schema_version":"1.0","source":{"id":"1808.03468","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.03468","created_at":"2026-05-18T00:08:20Z"},{"alias_kind":"arxiv_version","alias_value":"1808.03468v2","created_at":"2026-05-18T00:08:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.03468","created_at":"2026-05-18T00:08:20Z"},{"alias_kind":"pith_short_12","alias_value":"BWCJQHNKVP6U","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"BWCJQHNKVP6UWEVN","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"BWCJQHNK","created_at":"2026-05-18T12:32:16Z"}],"graph_snapshots":[{"event_id":"sha256:94ff91bbdb5cb6a25f66b5eaf6f9992c4f9f90ec2223605eab157c79384822ab","target":"graph","created_at":"2026-05-18T00:08:20Z","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 light of the increased focus on distributed methods, this paper proposes two accelerated subgradient methods and an adaptive penalty parameter scheme to speed-up the convergence of ADMM on the component-based dual decomposition of the second-order cone programming (SOCP) relaxation of the OPF. This work is the first to apply an adaptive penalty parameter method along with an accelerated subgradient method together in one scheme for distributed OPF. This accelerated scheme is demonstrated to reach substantial speed-ups, as high as 87%, on real-world test systems with more than 9000 buses, as","authors_text":"Archie Chapman, Gregor Verbic, Sleiman Mhanna","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CE","submitted_at":"2018-08-10T09:48:09Z","title":"Accelerated Methods for the SOCP-relaxed Component-based Distributed Optimal Power Flow"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.03468","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:d283bbabcf3ebb3cceb507a667895726dfe92787ee12094291b6c3deb27f912f","target":"record","created_at":"2026-05-18T00:08:20Z","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":"c303054fa5d54be81a75398f1442860cfef39b61cd330c93f94caa72c78c7482","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CE","submitted_at":"2018-08-10T09:48:09Z","title_canon_sha256":"28b4bead70a5103d6e2ba49686f3f8ce41ca5dbbfdd109a1730edfd15f855363"},"schema_version":"1.0","source":{"id":"1808.03468","kind":"arxiv","version":2}},"canonical_sha256":"0d84981daaabfd4b12adde927d874e54fc623655d08bde1bedd1343aa4ecb4fc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0d84981daaabfd4b12adde927d874e54fc623655d08bde1bedd1343aa4ecb4fc","first_computed_at":"2026-05-18T00:08:20.195710Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:08:20.195710Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BzAXnUYyQXpJnvd67ezIAxLdx5nAPm/Bvhyvgwdt039Z81PwsCCUKR+jEcQhsn0oEqOeL8uaKC7Lo5erBLuUCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:08:20.196367Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.03468","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d283bbabcf3ebb3cceb507a667895726dfe92787ee12094291b6c3deb27f912f","sha256:94ff91bbdb5cb6a25f66b5eaf6f9992c4f9f90ec2223605eab157c79384822ab"],"state_sha256":"e137380f7620d9c8dd2a69ced7337fabf9842580999650e684f6fc3f52aad921"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"p9gw7Kvhbyhd8XObU7cR9qD3/5d1OyWr31e+nwB90aYE1/O9PJD9OyS744z3VA26a/DMO1na7HdlVgnRx5nOBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T10:43:57.910566Z","bundle_sha256":"15009a37aa70a67672b6daa3e488ce8ba49f256382cc9e69c5e7935039bdb5dc"}}