{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:QRB5E7PVP6HNZF2C43DFHB6GFW","short_pith_number":"pith:QRB5E7PV","schema_version":"1.0","canonical_sha256":"8443d27df57f8edc9742e6c65387c62da26ad0515fee6cd918604be9c4404a49","source":{"kind":"arxiv","id":"2509.15938","version":2},"attestation_state":"computed","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 "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2509.15938","created_at":"2026-05-20T02:05:35.870735+00:00"},{"alias_kind":"arxiv_version","alias_value":"2509.15938v2","created_at":"2026-05-20T02:05:35.870735+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.15938","created_at":"2026-05-20T02:05:35.870735+00:00"},{"alias_kind":"pith_short_12","alias_value":"QRB5E7PVP6HN","created_at":"2026-05-20T02:05:35.870735+00:00"},{"alias_kind":"pith_short_16","alias_value":"QRB5E7PVP6HNZF2C","created_at":"2026-05-20T02:05:35.870735+00:00"},{"alias_kind":"pith_short_8","alias_value":"QRB5E7PV","created_at":"2026-05-20T02:05:35.870735+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QRB5E7PVP6HNZF2C43DFHB6GFW","json":"https://pith.science/pith/QRB5E7PVP6HNZF2C43DFHB6GFW.json","graph_json":"https://pith.science/api/pith-number/QRB5E7PVP6HNZF2C43DFHB6GFW/graph.json","events_json":"https://pith.science/api/pith-number/QRB5E7PVP6HNZF2C43DFHB6GFW/events.json","paper":"https://pith.science/paper/QRB5E7PV"},"agent_actions":{"view_html":"https://pith.science/pith/QRB5E7PVP6HNZF2C43DFHB6GFW","download_json":"https://pith.science/pith/QRB5E7PVP6HNZF2C43DFHB6GFW.json","view_paper":"https://pith.science/paper/QRB5E7PV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2509.15938&json=true","fetch_graph":"https://pith.science/api/pith-number/QRB5E7PVP6HNZF2C43DFHB6GFW/graph.json","fetch_events":"https://pith.science/api/pith-number/QRB5E7PVP6HNZF2C43DFHB6GFW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QRB5E7PVP6HNZF2C43DFHB6GFW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QRB5E7PVP6HNZF2C43DFHB6GFW/action/storage_attestation","attest_author":"https://pith.science/pith/QRB5E7PVP6HNZF2C43DFHB6GFW/action/author_attestation","sign_citation":"https://pith.science/pith/QRB5E7PVP6HNZF2C43DFHB6GFW/action/citation_signature","submit_replication":"https://pith.science/pith/QRB5E7PVP6HNZF2C43DFHB6GFW/action/replication_record"}},"created_at":"2026-05-20T02:05:35.870735+00:00","updated_at":"2026-05-20T02:05:35.870735+00:00"}