{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:26Y2JGJPZCF55JSL5M5JP5CPFB","short_pith_number":"pith:26Y2JGJP","canonical_record":{"source":{"id":"1808.05364","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-08-16T07:28:00Z","cross_cats_sorted":[],"title_canon_sha256":"e6622880aecc435fe89f1f2c1dca5d5db8fba75ec5c012c33bf8e66d51e7099a","abstract_canon_sha256":"ad6a9f36535b2128ec8155f7e7719b709631639b8dcbe18cd21a234ff50e7092"},"schema_version":"1.0"},"canonical_sha256":"d7b1a4992fc88bdea64beb3a97f44f285d8052e57b6b752f1ac3235e1a884bf3","source":{"kind":"arxiv","id":"1808.05364","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.05364","created_at":"2026-05-18T00:07:57Z"},{"alias_kind":"arxiv_version","alias_value":"1808.05364v1","created_at":"2026-05-18T00:07:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.05364","created_at":"2026-05-18T00:07:57Z"},{"alias_kind":"pith_short_12","alias_value":"26Y2JGJPZCF5","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"26Y2JGJPZCF55JSL","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"26Y2JGJP","created_at":"2026-05-18T12:31:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:26Y2JGJPZCF55JSL5M5JP5CPFB","target":"record","payload":{"canonical_record":{"source":{"id":"1808.05364","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-08-16T07:28:00Z","cross_cats_sorted":[],"title_canon_sha256":"e6622880aecc435fe89f1f2c1dca5d5db8fba75ec5c012c33bf8e66d51e7099a","abstract_canon_sha256":"ad6a9f36535b2128ec8155f7e7719b709631639b8dcbe18cd21a234ff50e7092"},"schema_version":"1.0"},"canonical_sha256":"d7b1a4992fc88bdea64beb3a97f44f285d8052e57b6b752f1ac3235e1a884bf3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:07:57.359567Z","signature_b64":"W/KIjIpqZyvEDRY25wn0Z6Mkd+WqeQ14QEE/HkkJLWKQnRXgksXuXdLNe2ozWwJSLurWr3cZcB7Svd1AfKlZBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d7b1a4992fc88bdea64beb3a97f44f285d8052e57b6b752f1ac3235e1a884bf3","last_reissued_at":"2026-05-18T00:07:57.359030Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:07:57.359030Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1808.05364","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-18T00:07:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"j5hj4C/BgBhvUXUDf0wCQ8mkVSXEhxXur+04JnjSuwS7E0EX4YQ6Cs8g7x2paWBx1ZVLBsrxgErINL57+7+MAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T08:11:35.435142Z"},"content_sha256":"1ce422be6c6f5778323250e7536e1684a766978b5db9091e3a6fd143ad61d09a","schema_version":"1.0","event_id":"sha256:1ce422be6c6f5778323250e7536e1684a766978b5db9091e3a6fd143ad61d09a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:26Y2JGJPZCF55JSL5M5JP5CPFB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Smooth Double Proximal Primal-Dual Algorithm for a Class of Distributed Nonsmooth Optimization Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Hao Fang, Jie Chen, Panos M. Pardalos, Xianlin Zeng, Yue Wei","submitted_at":"2018-08-16T07:28:00Z","abstract_excerpt":"This technical note studies a class of distributed nonsmooth convex consensus optimization problem. The cost function is a summation of local cost functions which are convex but nonsmooth. Each of the local cost functions consists of a twice differentiable convex function and two lower semi-continuous convex functions. We call this problem as single-smooth plus double-nonsmooth (SSDN) problem. Under mild conditions, we propose a distributed double proximal primal-dual optimization algorithm. The double proximal operator is designed to deal with the difficulty caused by the unproximable propert"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.05364","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-18T00:07:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bXU9lQCJVNzRONeF2PKfPkJbWLn+0iO5Qz6PNjVrOAh0WNEp3grN6TtMUWq2da7vWRjJx2UuBCXNz7rrA6XsCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T08:11:35.435506Z"},"content_sha256":"df2a09a933b9c32d0c959220974da2eb77be8412a7028e41ab9eb34ebf8db970","schema_version":"1.0","event_id":"sha256:df2a09a933b9c32d0c959220974da2eb77be8412a7028e41ab9eb34ebf8db970"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/26Y2JGJPZCF55JSL5M5JP5CPFB/bundle.json","state_url":"https://pith.science/pith/26Y2JGJPZCF55JSL5M5JP5CPFB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/26Y2JGJPZCF55JSL5M5JP5CPFB/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-02T08:11:35Z","links":{"resolver":"https://pith.science/pith/26Y2JGJPZCF55JSL5M5JP5CPFB","bundle":"https://pith.science/pith/26Y2JGJPZCF55JSL5M5JP5CPFB/bundle.json","state":"https://pith.science/pith/26Y2JGJPZCF55JSL5M5JP5CPFB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/26Y2JGJPZCF55JSL5M5JP5CPFB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:26Y2JGJPZCF55JSL5M5JP5CPFB","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":"ad6a9f36535b2128ec8155f7e7719b709631639b8dcbe18cd21a234ff50e7092","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-08-16T07:28:00Z","title_canon_sha256":"e6622880aecc435fe89f1f2c1dca5d5db8fba75ec5c012c33bf8e66d51e7099a"},"schema_version":"1.0","source":{"id":"1808.05364","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.05364","created_at":"2026-05-18T00:07:57Z"},{"alias_kind":"arxiv_version","alias_value":"1808.05364v1","created_at":"2026-05-18T00:07:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.05364","created_at":"2026-05-18T00:07:57Z"},{"alias_kind":"pith_short_12","alias_value":"26Y2JGJPZCF5","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"26Y2JGJPZCF55JSL","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"26Y2JGJP","created_at":"2026-05-18T12:31:59Z"}],"graph_snapshots":[{"event_id":"sha256:df2a09a933b9c32d0c959220974da2eb77be8412a7028e41ab9eb34ebf8db970","target":"graph","created_at":"2026-05-18T00:07:57Z","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":"This technical note studies a class of distributed nonsmooth convex consensus optimization problem. The cost function is a summation of local cost functions which are convex but nonsmooth. Each of the local cost functions consists of a twice differentiable convex function and two lower semi-continuous convex functions. We call this problem as single-smooth plus double-nonsmooth (SSDN) problem. Under mild conditions, we propose a distributed double proximal primal-dual optimization algorithm. The double proximal operator is designed to deal with the difficulty caused by the unproximable propert","authors_text":"Hao Fang, Jie Chen, Panos M. Pardalos, Xianlin Zeng, Yue Wei","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-08-16T07:28:00Z","title":"A Smooth Double Proximal Primal-Dual Algorithm for a Class of Distributed Nonsmooth Optimization Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.05364","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:1ce422be6c6f5778323250e7536e1684a766978b5db9091e3a6fd143ad61d09a","target":"record","created_at":"2026-05-18T00:07:57Z","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":"ad6a9f36535b2128ec8155f7e7719b709631639b8dcbe18cd21a234ff50e7092","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-08-16T07:28:00Z","title_canon_sha256":"e6622880aecc435fe89f1f2c1dca5d5db8fba75ec5c012c33bf8e66d51e7099a"},"schema_version":"1.0","source":{"id":"1808.05364","kind":"arxiv","version":1}},"canonical_sha256":"d7b1a4992fc88bdea64beb3a97f44f285d8052e57b6b752f1ac3235e1a884bf3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d7b1a4992fc88bdea64beb3a97f44f285d8052e57b6b752f1ac3235e1a884bf3","first_computed_at":"2026-05-18T00:07:57.359030Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:07:57.359030Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"W/KIjIpqZyvEDRY25wn0Z6Mkd+WqeQ14QEE/HkkJLWKQnRXgksXuXdLNe2ozWwJSLurWr3cZcB7Svd1AfKlZBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:07:57.359567Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.05364","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1ce422be6c6f5778323250e7536e1684a766978b5db9091e3a6fd143ad61d09a","sha256:df2a09a933b9c32d0c959220974da2eb77be8412a7028e41ab9eb34ebf8db970"],"state_sha256":"ef50805dab1e9c45466feb11147f3704955f466d9d5de606336f1ea612faa326"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+rAppTZPCRnrV3m38aGu60Vw4SrCCn0RBxBsS3647fIfUcuBfAms1ZUjjZxRlBcpxtZZo9gsN/3gZqNAtUqYDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T08:11:35.437567Z","bundle_sha256":"273c01f23139e7afbb2290df0d74a77458de1a9f44693744cf5919544afad491"}}