{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:ELE2NN2MRUK7PAPPVHJNFZFSHS","short_pith_number":"pith:ELE2NN2M","canonical_record":{"source":{"id":"1712.02623","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-12-07T14:10:04Z","cross_cats_sorted":[],"title_canon_sha256":"d9d0fbe08947d1962f84a3b185a7d1bb8d61b1c1ab0081d308c699ce5a1a8381","abstract_canon_sha256":"6d69e4210bb36634bceb3b31020e8152cd67d4f6366207bc3e292b3a29e174f4"},"schema_version":"1.0"},"canonical_sha256":"22c9a6b74c8d15f781efa9d2d2e4b23ca15d5714b48860f2053e298d67a5a5bd","source":{"kind":"arxiv","id":"1712.02623","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.02623","created_at":"2026-05-17T23:50:38Z"},{"alias_kind":"arxiv_version","alias_value":"1712.02623v3","created_at":"2026-05-17T23:50:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.02623","created_at":"2026-05-17T23:50:38Z"},{"alias_kind":"pith_short_12","alias_value":"ELE2NN2MRUK7","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"ELE2NN2MRUK7PAPP","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"ELE2NN2M","created_at":"2026-05-18T12:31:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:ELE2NN2MRUK7PAPPVHJNFZFSHS","target":"record","payload":{"canonical_record":{"source":{"id":"1712.02623","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-12-07T14:10:04Z","cross_cats_sorted":[],"title_canon_sha256":"d9d0fbe08947d1962f84a3b185a7d1bb8d61b1c1ab0081d308c699ce5a1a8381","abstract_canon_sha256":"6d69e4210bb36634bceb3b31020e8152cd67d4f6366207bc3e292b3a29e174f4"},"schema_version":"1.0"},"canonical_sha256":"22c9a6b74c8d15f781efa9d2d2e4b23ca15d5714b48860f2053e298d67a5a5bd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:50:38.799745Z","signature_b64":"9M98vx3zpuYyaeYx/vac8epbFpjCTq1wyUc4nTkjEAVVT945Ja8gl7J8WnHSptV0z+FGp+hHNSBUahmaV2MnDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"22c9a6b74c8d15f781efa9d2d2e4b23ca15d5714b48860f2053e298d67a5a5bd","last_reissued_at":"2026-05-17T23:50:38.799298Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:50:38.799298Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1712.02623","source_version":3,"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:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6QRyyQqKZ5pLRXPkjp0UX3Wjzhl252tlipuJobFMpe1Ll5Gzve69YpvOp4+DnYt/ukIgzEH11fc6wiPezOOuAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T16:01:13.073057Z"},"content_sha256":"68de836acbb4485bd016ece9569d5ec5d763ee7377659e52da5300cf325940e4","schema_version":"1.0","event_id":"sha256:68de836acbb4485bd016ece9569d5ec5d763ee7377659e52da5300cf325940e4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:ELE2NN2MRUK7PAPPVHJNFZFSHS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The multiproximal linearization method for convex composite problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Edouard Pauwels, J\\'er\\^ome Bolte, Zheng Chen","submitted_at":"2017-12-07T14:10:04Z","abstract_excerpt":"Composite minimization involves a collection of smooth functions which are aggregated in a nonsmooth manner. In the convex setting, we design an algorithm by linearizing each smooth component in accordance with its main curvature. The resulting method, called the Multiprox method, consists in solving successively simple problems (e.g. constrained quadratic problems) which can also feature some proximal operators. To study the complexity and the convergence of this method we are led to study quantitative qualification conditions to understand the impact of multipliers on the complexity bounds. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.02623","kind":"arxiv","version":3},"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:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4KC61GymOSdO8YV8+z57vlyb8eMkx9JlB1maApYLyNM+4CBnq7cl2ssNBgaYIZHtjPYU3AD8TS89+QYKf010Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T16:01:13.073776Z"},"content_sha256":"8efb556b5d9c5c0f24559ca186b261baadf8edd666bcb4fdae5425f857c3443a","schema_version":"1.0","event_id":"sha256:8efb556b5d9c5c0f24559ca186b261baadf8edd666bcb4fdae5425f857c3443a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ELE2NN2MRUK7PAPPVHJNFZFSHS/bundle.json","state_url":"https://pith.science/pith/ELE2NN2MRUK7PAPPVHJNFZFSHS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ELE2NN2MRUK7PAPPVHJNFZFSHS/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-26T16:01:13Z","links":{"resolver":"https://pith.science/pith/ELE2NN2MRUK7PAPPVHJNFZFSHS","bundle":"https://pith.science/pith/ELE2NN2MRUK7PAPPVHJNFZFSHS/bundle.json","state":"https://pith.science/pith/ELE2NN2MRUK7PAPPVHJNFZFSHS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ELE2NN2MRUK7PAPPVHJNFZFSHS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:ELE2NN2MRUK7PAPPVHJNFZFSHS","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":"6d69e4210bb36634bceb3b31020e8152cd67d4f6366207bc3e292b3a29e174f4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-12-07T14:10:04Z","title_canon_sha256":"d9d0fbe08947d1962f84a3b185a7d1bb8d61b1c1ab0081d308c699ce5a1a8381"},"schema_version":"1.0","source":{"id":"1712.02623","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.02623","created_at":"2026-05-17T23:50:38Z"},{"alias_kind":"arxiv_version","alias_value":"1712.02623v3","created_at":"2026-05-17T23:50:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.02623","created_at":"2026-05-17T23:50:38Z"},{"alias_kind":"pith_short_12","alias_value":"ELE2NN2MRUK7","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"ELE2NN2MRUK7PAPP","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"ELE2NN2M","created_at":"2026-05-18T12:31:12Z"}],"graph_snapshots":[{"event_id":"sha256:8efb556b5d9c5c0f24559ca186b261baadf8edd666bcb4fdae5425f857c3443a","target":"graph","created_at":"2026-05-17T23:50:38Z","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":"Composite minimization involves a collection of smooth functions which are aggregated in a nonsmooth manner. In the convex setting, we design an algorithm by linearizing each smooth component in accordance with its main curvature. The resulting method, called the Multiprox method, consists in solving successively simple problems (e.g. constrained quadratic problems) which can also feature some proximal operators. To study the complexity and the convergence of this method we are led to study quantitative qualification conditions to understand the impact of multipliers on the complexity bounds. ","authors_text":"Edouard Pauwels, J\\'er\\^ome Bolte, Zheng Chen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-12-07T14:10:04Z","title":"The multiproximal linearization method for convex composite problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.02623","kind":"arxiv","version":3},"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:68de836acbb4485bd016ece9569d5ec5d763ee7377659e52da5300cf325940e4","target":"record","created_at":"2026-05-17T23:50:38Z","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":"6d69e4210bb36634bceb3b31020e8152cd67d4f6366207bc3e292b3a29e174f4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-12-07T14:10:04Z","title_canon_sha256":"d9d0fbe08947d1962f84a3b185a7d1bb8d61b1c1ab0081d308c699ce5a1a8381"},"schema_version":"1.0","source":{"id":"1712.02623","kind":"arxiv","version":3}},"canonical_sha256":"22c9a6b74c8d15f781efa9d2d2e4b23ca15d5714b48860f2053e298d67a5a5bd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"22c9a6b74c8d15f781efa9d2d2e4b23ca15d5714b48860f2053e298d67a5a5bd","first_computed_at":"2026-05-17T23:50:38.799298Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:50:38.799298Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9M98vx3zpuYyaeYx/vac8epbFpjCTq1wyUc4nTkjEAVVT945Ja8gl7J8WnHSptV0z+FGp+hHNSBUahmaV2MnDA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:50:38.799745Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.02623","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:68de836acbb4485bd016ece9569d5ec5d763ee7377659e52da5300cf325940e4","sha256:8efb556b5d9c5c0f24559ca186b261baadf8edd666bcb4fdae5425f857c3443a"],"state_sha256":"f953e904738a9b257c7f8d4afba975aa32309e64a53cd4a143c883aeb44324a3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8CGm6if0zeB+Ph7pVQtU4h9VeQc2VUXQM/q5mxV5OyeRNQzXo1x5K+VvaaJU1vJ3odnzU6Tk+oYT1sbwXej9Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T16:01:13.077491Z","bundle_sha256":"194c625187030ca91dbe3aa746c855356575ece8d698f38f81e11085049f9b9c"}}