{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:RIKZCM6ENJY7DSZYGPWDFETJLK","short_pith_number":"pith:RIKZCM6E","canonical_record":{"source":{"id":"1803.02487","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-03-07T00:28:07Z","cross_cats_sorted":[],"title_canon_sha256":"2707646d4754bc8e455d718ef4e39cbe931125c25b99a2aee4995a6bde48b222","abstract_canon_sha256":"6c357d45c0ba81951b716fd5f5bc2944e4bf3a4c248a7d901afd5a5591149da6"},"schema_version":"1.0"},"canonical_sha256":"8a159133c46a71f1cb3833ec3292695ab30515b9d4c71ccdd23503b11a964e54","source":{"kind":"arxiv","id":"1803.02487","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.02487","created_at":"2026-05-18T00:20:01Z"},{"alias_kind":"arxiv_version","alias_value":"1803.02487v2","created_at":"2026-05-18T00:20:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.02487","created_at":"2026-05-18T00:20:01Z"},{"alias_kind":"pith_short_12","alias_value":"RIKZCM6ENJY7","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"RIKZCM6ENJY7DSZY","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"RIKZCM6E","created_at":"2026-05-18T12:32:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:RIKZCM6ENJY7DSZYGPWDFETJLK","target":"record","payload":{"canonical_record":{"source":{"id":"1803.02487","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-03-07T00:28:07Z","cross_cats_sorted":[],"title_canon_sha256":"2707646d4754bc8e455d718ef4e39cbe931125c25b99a2aee4995a6bde48b222","abstract_canon_sha256":"6c357d45c0ba81951b716fd5f5bc2944e4bf3a4c248a7d901afd5a5591149da6"},"schema_version":"1.0"},"canonical_sha256":"8a159133c46a71f1cb3833ec3292695ab30515b9d4c71ccdd23503b11a964e54","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:20:01.680185Z","signature_b64":"eu08rDCsWKUPBTuQxWb/8qIamVrRiGUZs4oAgqFJQRmGxYczczZMmATrU0XaCMR+0jrBCkpMSrfoFwKBq2+xBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8a159133c46a71f1cb3833ec3292695ab30515b9d4c71ccdd23503b11a964e54","last_reissued_at":"2026-05-18T00:20:01.679667Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:20:01.679667Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1803.02487","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-18T00:20:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f9eDpKIbG+ZVF3XN0L+Kyv/m0niyYpU444fOP1XJ9oZkTzX20CVwk1JSzLdIZXVqnpk8eAT7a4P7DOEUWhD8AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T17:50:11.509310Z"},"content_sha256":"f86b751a497d88095e62a922e4e1cda72e9933d053a051fe80843c6e4c4a4cdb","schema_version":"1.0","event_id":"sha256:f86b751a497d88095e62a922e4e1cda72e9933d053a051fe80843c6e4c4a4cdb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:RIKZCM6ENJY7DSZYGPWDFETJLK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Nonlinear Bregman Primal-Dual Framework for Optimizing Nonconvex Infimal Convolutions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Daniel Cremers, Emanuel Laude","submitted_at":"2018-03-07T00:28:07Z","abstract_excerpt":"This work is concerned with the optimization of nonconvex, nonsmooth composite optimization problems, whose objective is a composition of a nonlinear mapping and a nonsmooth nonconvex function, that can be written as an infimal convolution (inf-conv). To tackle this problem class we propose to reformulate the problem exploiting its inf-conv structure and derive a block coordinate descent scheme on a Bregman augmented Lagrangian, that can be implemented asynchronously. We prove convergence of our scheme to stationary points of the original model for a specific choice of the penalty parameter. O"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.02487","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":""},"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:20:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K2W19Jd4+769uPvRrTYwwSx3KIliqwwxisv7X1ODJMBmfX4YMuN1ob9eZhHvOi0IYTN6Oi+R6T258xk8UtaUBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T17:50:11.510059Z"},"content_sha256":"15c9bd8832615186c0e904106638ee53b685271928e473580a54e06cb2ca62a0","schema_version":"1.0","event_id":"sha256:15c9bd8832615186c0e904106638ee53b685271928e473580a54e06cb2ca62a0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RIKZCM6ENJY7DSZYGPWDFETJLK/bundle.json","state_url":"https://pith.science/pith/RIKZCM6ENJY7DSZYGPWDFETJLK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RIKZCM6ENJY7DSZYGPWDFETJLK/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-31T17:50:11Z","links":{"resolver":"https://pith.science/pith/RIKZCM6ENJY7DSZYGPWDFETJLK","bundle":"https://pith.science/pith/RIKZCM6ENJY7DSZYGPWDFETJLK/bundle.json","state":"https://pith.science/pith/RIKZCM6ENJY7DSZYGPWDFETJLK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RIKZCM6ENJY7DSZYGPWDFETJLK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:RIKZCM6ENJY7DSZYGPWDFETJLK","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":"6c357d45c0ba81951b716fd5f5bc2944e4bf3a4c248a7d901afd5a5591149da6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-03-07T00:28:07Z","title_canon_sha256":"2707646d4754bc8e455d718ef4e39cbe931125c25b99a2aee4995a6bde48b222"},"schema_version":"1.0","source":{"id":"1803.02487","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.02487","created_at":"2026-05-18T00:20:01Z"},{"alias_kind":"arxiv_version","alias_value":"1803.02487v2","created_at":"2026-05-18T00:20:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.02487","created_at":"2026-05-18T00:20:01Z"},{"alias_kind":"pith_short_12","alias_value":"RIKZCM6ENJY7","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"RIKZCM6ENJY7DSZY","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"RIKZCM6E","created_at":"2026-05-18T12:32:50Z"}],"graph_snapshots":[{"event_id":"sha256:15c9bd8832615186c0e904106638ee53b685271928e473580a54e06cb2ca62a0","target":"graph","created_at":"2026-05-18T00:20:01Z","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 work is concerned with the optimization of nonconvex, nonsmooth composite optimization problems, whose objective is a composition of a nonlinear mapping and a nonsmooth nonconvex function, that can be written as an infimal convolution (inf-conv). To tackle this problem class we propose to reformulate the problem exploiting its inf-conv structure and derive a block coordinate descent scheme on a Bregman augmented Lagrangian, that can be implemented asynchronously. We prove convergence of our scheme to stationary points of the original model for a specific choice of the penalty parameter. O","authors_text":"Daniel Cremers, Emanuel Laude","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-03-07T00:28:07Z","title":"A Nonlinear Bregman Primal-Dual Framework for Optimizing Nonconvex Infimal Convolutions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.02487","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:f86b751a497d88095e62a922e4e1cda72e9933d053a051fe80843c6e4c4a4cdb","target":"record","created_at":"2026-05-18T00:20:01Z","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":"6c357d45c0ba81951b716fd5f5bc2944e4bf3a4c248a7d901afd5a5591149da6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-03-07T00:28:07Z","title_canon_sha256":"2707646d4754bc8e455d718ef4e39cbe931125c25b99a2aee4995a6bde48b222"},"schema_version":"1.0","source":{"id":"1803.02487","kind":"arxiv","version":2}},"canonical_sha256":"8a159133c46a71f1cb3833ec3292695ab30515b9d4c71ccdd23503b11a964e54","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8a159133c46a71f1cb3833ec3292695ab30515b9d4c71ccdd23503b11a964e54","first_computed_at":"2026-05-18T00:20:01.679667Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:20:01.679667Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"eu08rDCsWKUPBTuQxWb/8qIamVrRiGUZs4oAgqFJQRmGxYczczZMmATrU0XaCMR+0jrBCkpMSrfoFwKBq2+xBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:20:01.680185Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.02487","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f86b751a497d88095e62a922e4e1cda72e9933d053a051fe80843c6e4c4a4cdb","sha256:15c9bd8832615186c0e904106638ee53b685271928e473580a54e06cb2ca62a0"],"state_sha256":"3e95bdb8a604733f31db19974459354767e81c02f82e8082f45d17099bbdf4b2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8FW2fAUcNeK/dLktRKWIm3/wVu8eEs+OCMJwhXur65QEdf6GYM+tBUHN4etVGSJCFaZnBbbsODNqioIXOER3Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T17:50:11.515007Z","bundle_sha256":"262025fc6e97628c614ff55d84e10c585a7f8e6b9c3a7bddf69b354db87de681"}}