{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:QRB5E7PVP6HNZF2C43DFHB6GFW","short_pith_number":"pith:QRB5E7PV","canonical_record":{"source":{"id":"2509.15938","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-09-19T12:48:12Z","cross_cats_sorted":[],"title_canon_sha256":"0dde56d60982d6aabec1fc81c1c42777df48c04a9246e2bc4fa2cda2fc4a8088","abstract_canon_sha256":"6a757f3522fe6b0017198ed1cb4dcef9961282a571130e33f9f024e4ef4ed5eb"},"schema_version":"1.0"},"canonical_sha256":"8443d27df57f8edc9742e6c65387c62da26ad0515fee6cd918604be9c4404a49","source":{"kind":"arxiv","id":"2509.15938","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2509.15938","created_at":"2026-05-20T02:05:35Z"},{"alias_kind":"arxiv_version","alias_value":"2509.15938v2","created_at":"2026-05-20T02:05:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.15938","created_at":"2026-05-20T02:05:35Z"},{"alias_kind":"pith_short_12","alias_value":"QRB5E7PVP6HN","created_at":"2026-05-20T02:05:35Z"},{"alias_kind":"pith_short_16","alias_value":"QRB5E7PVP6HNZF2C","created_at":"2026-05-20T02:05:35Z"},{"alias_kind":"pith_short_8","alias_value":"QRB5E7PV","created_at":"2026-05-20T02:05:35Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:QRB5E7PVP6HNZF2C43DFHB6GFW","target":"record","payload":{"canonical_record":{"source":{"id":"2509.15938","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-09-19T12:48:12Z","cross_cats_sorted":[],"title_canon_sha256":"0dde56d60982d6aabec1fc81c1c42777df48c04a9246e2bc4fa2cda2fc4a8088","abstract_canon_sha256":"6a757f3522fe6b0017198ed1cb4dcef9961282a571130e33f9f024e4ef4ed5eb"},"schema_version":"1.0"},"canonical_sha256":"8443d27df57f8edc9742e6c65387c62da26ad0515fee6cd918604be9c4404a49","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T02:05:35.871447Z","signature_b64":"XpMQEPebQA3BZ63R/iK1dDNTlsi+98M/658IsPdJAUD16ipU5ypqxd1suCI8WYAgwplI7ZJNA+ZvzQged5QyBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8443d27df57f8edc9742e6c65387c62da26ad0515fee6cd918604be9c4404a49","last_reissued_at":"2026-05-20T02:05:35.870619Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T02:05:35.870619Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2509.15938","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-20T02:05:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9OaH87NjwVtsvTE1Vau6Cb120S7X/r3FkYCm6afxuO/yvPBX96nJ7NoeGyGOlyRDcluibw/DSCKiEqaJUxwiDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T21:55:37.012655Z"},"content_sha256":"97fae7d78ad8a47659295d81ea72db45d8fdd0812010ffa7fb338561a08f6c8b","schema_version":"1.0","event_id":"sha256:97fae7d78ad8a47659295d81ea72db45d8fdd0812010ffa7fb338561a08f6c8b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:QRB5E7PVP6HNZF2C43DFHB6GFW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Enforcing Convergence in Sensitivity-based Distributed Programming via Transformed Primal-Dual Updates","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Andreas V\\\"olz, Knut Graichen, Maximilian Pierer von Esch","submitted_at":"2025-09-19T12:48:12Z","abstract_excerpt":"Sensitivity-based distributed programming (SBDP) is a decomposition method for solving large-scale nonlinear programs over graph-structured networks. However, its convergence depends on the strength and structure of subsystem coupling. To address this limitation, we propose SBDP+, a distributed optimization scheme based on a structured primal-dual operator design. The method employs first-order sensitivities and primal decomposition to construct low-dimensional local subproblems that are solved in parallel using neighbor-to-neighbor communication. In contrast to SBDP, SBDP+ introduces a novel "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.15938","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2509.15938/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-20T02:05:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nQul1Zwr4Ci/7Z+H17NrUA1esVLpknci41crOjNX1zsk3HxN29Sn4zjMPmO3pt34qa1bpCqmHisWuevghiGtDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T21:55:37.013043Z"},"content_sha256":"041e40209e58b73d4344d26754c392e78a6d7df49c20688416b2b252a88b5930","schema_version":"1.0","event_id":"sha256:041e40209e58b73d4344d26754c392e78a6d7df49c20688416b2b252a88b5930"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QRB5E7PVP6HNZF2C43DFHB6GFW/bundle.json","state_url":"https://pith.science/pith/QRB5E7PVP6HNZF2C43DFHB6GFW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QRB5E7PVP6HNZF2C43DFHB6GFW/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-24T21:55:37Z","links":{"resolver":"https://pith.science/pith/QRB5E7PVP6HNZF2C43DFHB6GFW","bundle":"https://pith.science/pith/QRB5E7PVP6HNZF2C43DFHB6GFW/bundle.json","state":"https://pith.science/pith/QRB5E7PVP6HNZF2C43DFHB6GFW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QRB5E7PVP6HNZF2C43DFHB6GFW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:QRB5E7PVP6HNZF2C43DFHB6GFW","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":"6a757f3522fe6b0017198ed1cb4dcef9961282a571130e33f9f024e4ef4ed5eb","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-09-19T12:48:12Z","title_canon_sha256":"0dde56d60982d6aabec1fc81c1c42777df48c04a9246e2bc4fa2cda2fc4a8088"},"schema_version":"1.0","source":{"id":"2509.15938","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2509.15938","created_at":"2026-05-20T02:05:35Z"},{"alias_kind":"arxiv_version","alias_value":"2509.15938v2","created_at":"2026-05-20T02:05:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.15938","created_at":"2026-05-20T02:05:35Z"},{"alias_kind":"pith_short_12","alias_value":"QRB5E7PVP6HN","created_at":"2026-05-20T02:05:35Z"},{"alias_kind":"pith_short_16","alias_value":"QRB5E7PVP6HNZF2C","created_at":"2026-05-20T02:05:35Z"},{"alias_kind":"pith_short_8","alias_value":"QRB5E7PV","created_at":"2026-05-20T02:05:35Z"}],"graph_snapshots":[{"event_id":"sha256:041e40209e58b73d4344d26754c392e78a6d7df49c20688416b2b252a88b5930","target":"graph","created_at":"2026-05-20T02:05:35Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2509.15938/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Sensitivity-based distributed programming (SBDP) is a decomposition method for solving large-scale nonlinear programs over graph-structured networks. However, its convergence depends on the strength and structure of subsystem coupling. To address this limitation, we propose SBDP+, a distributed optimization scheme based on a structured primal-dual operator design. The method employs first-order sensitivities and primal decomposition to construct low-dimensional local subproblems that are solved in parallel using neighbor-to-neighbor communication. In contrast to SBDP, SBDP+ introduces a novel ","authors_text":"Andreas V\\\"olz, Knut Graichen, Maximilian Pierer von Esch","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-09-19T12:48:12Z","title":"Enforcing Convergence in Sensitivity-based Distributed Programming via Transformed Primal-Dual Updates"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.15938","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:97fae7d78ad8a47659295d81ea72db45d8fdd0812010ffa7fb338561a08f6c8b","target":"record","created_at":"2026-05-20T02:05:35Z","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":"6a757f3522fe6b0017198ed1cb4dcef9961282a571130e33f9f024e4ef4ed5eb","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-09-19T12:48:12Z","title_canon_sha256":"0dde56d60982d6aabec1fc81c1c42777df48c04a9246e2bc4fa2cda2fc4a8088"},"schema_version":"1.0","source":{"id":"2509.15938","kind":"arxiv","version":2}},"canonical_sha256":"8443d27df57f8edc9742e6c65387c62da26ad0515fee6cd918604be9c4404a49","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8443d27df57f8edc9742e6c65387c62da26ad0515fee6cd918604be9c4404a49","first_computed_at":"2026-05-20T02:05:35.870619Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T02:05:35.870619Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XpMQEPebQA3BZ63R/iK1dDNTlsi+98M/658IsPdJAUD16ipU5ypqxd1suCI8WYAgwplI7ZJNA+ZvzQged5QyBA==","signature_status":"signed_v1","signed_at":"2026-05-20T02:05:35.871447Z","signed_message":"canonical_sha256_bytes"},"source_id":"2509.15938","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:97fae7d78ad8a47659295d81ea72db45d8fdd0812010ffa7fb338561a08f6c8b","sha256:041e40209e58b73d4344d26754c392e78a6d7df49c20688416b2b252a88b5930"],"state_sha256":"7667be06d1165fbc85efa8700532629f2de50103d35eba62ce7095dbdb80637b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"R8bbtFWa3NatAauQjXnplKEIFuVr0jHdP9LlC9szmxonzZYjmxhaIb4N5o3iBC3uKq4cgIHRRlgBSpfewKQgAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T21:55:37.015177Z","bundle_sha256":"66d16191d7dd3334d0d6e3c61740ffadb177cf07cb46ac151b178f13a0e41aa5"}}