{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:IXR25Z5UIQGRX6TRSHHZZCOHBI","short_pith_number":"pith:IXR25Z5U","canonical_record":{"source":{"id":"1903.11280","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-03-27T07:48:57Z","cross_cats_sorted":["cs.DC","cs.SY"],"title_canon_sha256":"93e4e83733b42ddb9591869378b8a1a497bf9c03ebe1a0e4c628a281d66ac977","abstract_canon_sha256":"858d61dcbc85a1876380ed934c4ec4da78c3e68f9539e5b6830224a71a982ddb"},"schema_version":"1.0"},"canonical_sha256":"45e3aee7b4440d1bfa7191cf9c89c70a1f35bcffdc3be7f6d576f28d502a93db","source":{"kind":"arxiv","id":"1903.11280","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.11280","created_at":"2026-05-17T23:50:03Z"},{"alias_kind":"arxiv_version","alias_value":"1903.11280v1","created_at":"2026-05-17T23:50:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.11280","created_at":"2026-05-17T23:50:03Z"},{"alias_kind":"pith_short_12","alias_value":"IXR25Z5UIQGR","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"IXR25Z5UIQGRX6TR","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"IXR25Z5U","created_at":"2026-05-18T12:33:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:IXR25Z5UIQGRX6TRSHHZZCOHBI","target":"record","payload":{"canonical_record":{"source":{"id":"1903.11280","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-03-27T07:48:57Z","cross_cats_sorted":["cs.DC","cs.SY"],"title_canon_sha256":"93e4e83733b42ddb9591869378b8a1a497bf9c03ebe1a0e4c628a281d66ac977","abstract_canon_sha256":"858d61dcbc85a1876380ed934c4ec4da78c3e68f9539e5b6830224a71a982ddb"},"schema_version":"1.0"},"canonical_sha256":"45e3aee7b4440d1bfa7191cf9c89c70a1f35bcffdc3be7f6d576f28d502a93db","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:50:03.661447Z","signature_b64":"ZmjxnsJ+GMD2rcYMWO4Y5X5bB2NZtLwSAiVCsgbueLfgpu9mRN7BJMqZGB/kSLCKQJ3qZdoa/VC+U+rNvNyQDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"45e3aee7b4440d1bfa7191cf9c89c70a1f35bcffdc3be7f6d576f28d502a93db","last_reissued_at":"2026-05-17T23:50:03.660829Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:50:03.660829Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1903.11280","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:50:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"W/tn9/tKcnzhtMSCwi95i+v+QvfCAi5AZ/+QOpRNOduufE7XiHOBqT1kjfFHAB5G9QaxqXUiNEbmTx7srvtkAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T10:41:40.696177Z"},"content_sha256":"0406d0d0f3210b2831b525307e3d0333af3805efd8580a0f60fa8e1320a8b96a","schema_version":"1.0","event_id":"sha256:0406d0d0f3210b2831b525307e3d0333af3805efd8580a0f60fa8e1320a8b96a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:IXR25Z5UIQGRX6TRSHHZZCOHBI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Decomposition of non-convex optimization via bi-level distributed ALADIN","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.SY"],"primary_cat":"math.OC","authors_text":"Alexander Engelmann, Boris Houska, Timm Faulwasser, Yuning Jiang","submitted_at":"2019-03-27T07:48:57Z","abstract_excerpt":"Decentralized optimization algorithms are important in different contexts, such as distributed optimal power flow or distributed model predictive control, as they avoid central coordination and enable decomposition of large-scale problems. In case of constrained non-convex optimization only a few algorithms are currently are available; often their performance is limited, or they lack convergence guarantees. This paper proposes a framework for decentralized non-convex optimization via bi-level distribution of the Augmented Lagrangian Alternating Direction Inexact Newton (ALADIN) algorithm. Bi-l"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.11280","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:50:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"t+9Eu4Tu1yJwEHsI5hunJkbUS91NLMEANm+PNgOpJY8ExnBythnWFEU58xCBcYu2LN66D+Ixrsa8MMKZCMbcCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T10:41:40.696896Z"},"content_sha256":"4ef0c95b4e1fa5e6bbbcf99b3ff988d77c3309f631345638f367a8aa5b507ee5","schema_version":"1.0","event_id":"sha256:4ef0c95b4e1fa5e6bbbcf99b3ff988d77c3309f631345638f367a8aa5b507ee5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IXR25Z5UIQGRX6TRSHHZZCOHBI/bundle.json","state_url":"https://pith.science/pith/IXR25Z5UIQGRX6TRSHHZZCOHBI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IXR25Z5UIQGRX6TRSHHZZCOHBI/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-26T10:41:40Z","links":{"resolver":"https://pith.science/pith/IXR25Z5UIQGRX6TRSHHZZCOHBI","bundle":"https://pith.science/pith/IXR25Z5UIQGRX6TRSHHZZCOHBI/bundle.json","state":"https://pith.science/pith/IXR25Z5UIQGRX6TRSHHZZCOHBI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IXR25Z5UIQGRX6TRSHHZZCOHBI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:IXR25Z5UIQGRX6TRSHHZZCOHBI","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":"858d61dcbc85a1876380ed934c4ec4da78c3e68f9539e5b6830224a71a982ddb","cross_cats_sorted":["cs.DC","cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-03-27T07:48:57Z","title_canon_sha256":"93e4e83733b42ddb9591869378b8a1a497bf9c03ebe1a0e4c628a281d66ac977"},"schema_version":"1.0","source":{"id":"1903.11280","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.11280","created_at":"2026-05-17T23:50:03Z"},{"alias_kind":"arxiv_version","alias_value":"1903.11280v1","created_at":"2026-05-17T23:50:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.11280","created_at":"2026-05-17T23:50:03Z"},{"alias_kind":"pith_short_12","alias_value":"IXR25Z5UIQGR","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"IXR25Z5UIQGRX6TR","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"IXR25Z5U","created_at":"2026-05-18T12:33:18Z"}],"graph_snapshots":[{"event_id":"sha256:4ef0c95b4e1fa5e6bbbcf99b3ff988d77c3309f631345638f367a8aa5b507ee5","target":"graph","created_at":"2026-05-17T23:50:03Z","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":"Decentralized optimization algorithms are important in different contexts, such as distributed optimal power flow or distributed model predictive control, as they avoid central coordination and enable decomposition of large-scale problems. In case of constrained non-convex optimization only a few algorithms are currently are available; often their performance is limited, or they lack convergence guarantees. This paper proposes a framework for decentralized non-convex optimization via bi-level distribution of the Augmented Lagrangian Alternating Direction Inexact Newton (ALADIN) algorithm. Bi-l","authors_text":"Alexander Engelmann, Boris Houska, Timm Faulwasser, Yuning Jiang","cross_cats":["cs.DC","cs.SY"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-03-27T07:48:57Z","title":"Decomposition of non-convex optimization via bi-level distributed ALADIN"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.11280","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:0406d0d0f3210b2831b525307e3d0333af3805efd8580a0f60fa8e1320a8b96a","target":"record","created_at":"2026-05-17T23:50:03Z","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":"858d61dcbc85a1876380ed934c4ec4da78c3e68f9539e5b6830224a71a982ddb","cross_cats_sorted":["cs.DC","cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-03-27T07:48:57Z","title_canon_sha256":"93e4e83733b42ddb9591869378b8a1a497bf9c03ebe1a0e4c628a281d66ac977"},"schema_version":"1.0","source":{"id":"1903.11280","kind":"arxiv","version":1}},"canonical_sha256":"45e3aee7b4440d1bfa7191cf9c89c70a1f35bcffdc3be7f6d576f28d502a93db","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"45e3aee7b4440d1bfa7191cf9c89c70a1f35bcffdc3be7f6d576f28d502a93db","first_computed_at":"2026-05-17T23:50:03.660829Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:50:03.660829Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZmjxnsJ+GMD2rcYMWO4Y5X5bB2NZtLwSAiVCsgbueLfgpu9mRN7BJMqZGB/kSLCKQJ3qZdoa/VC+U+rNvNyQDA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:50:03.661447Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.11280","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0406d0d0f3210b2831b525307e3d0333af3805efd8580a0f60fa8e1320a8b96a","sha256:4ef0c95b4e1fa5e6bbbcf99b3ff988d77c3309f631345638f367a8aa5b507ee5"],"state_sha256":"ac1d10538f6dcf20b7c411e8aa5125b680990e7be8fd3405585d1eea504b6544"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EYm51RBdeQQGxiyBXSLsF4RFzLfpo4UNiGMtDmRnLDZEHY246N5ftfI3yvOcN4H2yvRAIMmKYgdTR24OPFzPDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T10:41:40.700812Z","bundle_sha256":"667f32fccf3007f3c0fc7435e0edc30cdf8313e6af0037eb648e35de6536616f"}}