{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:WO5DVQSPX4IKZHEBJDOTF4UKBZ","short_pith_number":"pith:WO5DVQSP","canonical_record":{"source":{"id":"1404.4805","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2014-04-18T15:00:07Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"af9fd4035c64381562f6a4bb89c10b37c71e78162c4418e0070aa287b1e09e13","abstract_canon_sha256":"0cb8882a201d61bbcd393037c4b8cc70756b1a401c0a54e0489fb8fb3c669509"},"schema_version":"1.0"},"canonical_sha256":"b3ba3ac24fbf10ac9c8148dd32f28a0e58ab88a8ab5b25ac3d2239ee13452ead","source":{"kind":"arxiv","id":"1404.4805","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.4805","created_at":"2026-05-18T02:53:54Z"},{"alias_kind":"arxiv_version","alias_value":"1404.4805v1","created_at":"2026-05-18T02:53:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.4805","created_at":"2026-05-18T02:53:54Z"},{"alias_kind":"pith_short_12","alias_value":"WO5DVQSPX4IK","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_16","alias_value":"WO5DVQSPX4IKZHEB","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_8","alias_value":"WO5DVQSP","created_at":"2026-05-18T12:28:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:WO5DVQSPX4IKZHEBJDOTF4UKBZ","target":"record","payload":{"canonical_record":{"source":{"id":"1404.4805","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2014-04-18T15:00:07Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"af9fd4035c64381562f6a4bb89c10b37c71e78162c4418e0070aa287b1e09e13","abstract_canon_sha256":"0cb8882a201d61bbcd393037c4b8cc70756b1a401c0a54e0489fb8fb3c669509"},"schema_version":"1.0"},"canonical_sha256":"b3ba3ac24fbf10ac9c8148dd32f28a0e58ab88a8ab5b25ac3d2239ee13452ead","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:53:54.854335Z","signature_b64":"Ujlm31xQuQwGJjZK8wYV+pJJ/UwBdsyNKMTcIcF4vhHBKWiBVXjnVwbJHT8QLLukAfw7lIunv2DdP675NZKuDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b3ba3ac24fbf10ac9c8148dd32f28a0e58ab88a8ab5b25ac3d2239ee13452ead","last_reissued_at":"2026-05-18T02:53:54.853731Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:53:54.853731Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1404.4805","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-18T02:53:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oxXj2/XyrjZOOmyDA3aCQZFArs3CO/lV1qP22iabK4/gD8IpDo9joBda4DIfTWwh6zdihYu1pGe3entVKSM8AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T00:05:27.365671Z"},"content_sha256":"86ba776adfc4fa888d3b46c8f62ff2ab3774017205f0473fee3a175fd504bfb0","schema_version":"1.0","event_id":"sha256:86ba776adfc4fa888d3b46c8f62ff2ab3774017205f0473fee3a175fd504bfb0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:WO5DVQSPX4IKZHEBJDOTF4UKBZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"iPiano: Inertial Proximal Algorithm for Non-Convex Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.CV","authors_text":"Peter Ochs, Thomas Brox, Thomas Pock, Yunjin Chen","submitted_at":"2014-04-18T15:00:07Z","abstract_excerpt":"In this paper we study an algorithm for solving a minimization problem composed of a differentiable (possibly non-convex) and a convex (possibly non-differentiable) function. The algorithm iPiano combines forward-backward splitting with an inertial force. It can be seen as a non-smooth split version of the Heavy-ball method from Polyak. A rigorous analysis of the algorithm for the proposed class of problems yields global convergence of the function values and the arguments. This makes the algorithm robust for usage on non-convex problems. The convergence result is obtained based on the \\KL ine"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.4805","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-18T02:53:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IwWyKIndXDzO91TR3E2TP8kPXJ4fr+kIhUeEfjU20A/EuzA6lKWbP+/KPYkE3n4IUMBhTzXcTfJKgM6bvLibAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T00:05:27.366241Z"},"content_sha256":"367afed4624620998aa274c21e07ff464192a3d538530d8f75ba4e10a017f1f3","schema_version":"1.0","event_id":"sha256:367afed4624620998aa274c21e07ff464192a3d538530d8f75ba4e10a017f1f3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WO5DVQSPX4IKZHEBJDOTF4UKBZ/bundle.json","state_url":"https://pith.science/pith/WO5DVQSPX4IKZHEBJDOTF4UKBZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WO5DVQSPX4IKZHEBJDOTF4UKBZ/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-11T00:05:27Z","links":{"resolver":"https://pith.science/pith/WO5DVQSPX4IKZHEBJDOTF4UKBZ","bundle":"https://pith.science/pith/WO5DVQSPX4IKZHEBJDOTF4UKBZ/bundle.json","state":"https://pith.science/pith/WO5DVQSPX4IKZHEBJDOTF4UKBZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WO5DVQSPX4IKZHEBJDOTF4UKBZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:WO5DVQSPX4IKZHEBJDOTF4UKBZ","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":"0cb8882a201d61bbcd393037c4b8cc70756b1a401c0a54e0489fb8fb3c669509","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2014-04-18T15:00:07Z","title_canon_sha256":"af9fd4035c64381562f6a4bb89c10b37c71e78162c4418e0070aa287b1e09e13"},"schema_version":"1.0","source":{"id":"1404.4805","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.4805","created_at":"2026-05-18T02:53:54Z"},{"alias_kind":"arxiv_version","alias_value":"1404.4805v1","created_at":"2026-05-18T02:53:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.4805","created_at":"2026-05-18T02:53:54Z"},{"alias_kind":"pith_short_12","alias_value":"WO5DVQSPX4IK","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_16","alias_value":"WO5DVQSPX4IKZHEB","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_8","alias_value":"WO5DVQSP","created_at":"2026-05-18T12:28:54Z"}],"graph_snapshots":[{"event_id":"sha256:367afed4624620998aa274c21e07ff464192a3d538530d8f75ba4e10a017f1f3","target":"graph","created_at":"2026-05-18T02:53:54Z","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":"In this paper we study an algorithm for solving a minimization problem composed of a differentiable (possibly non-convex) and a convex (possibly non-differentiable) function. The algorithm iPiano combines forward-backward splitting with an inertial force. It can be seen as a non-smooth split version of the Heavy-ball method from Polyak. A rigorous analysis of the algorithm for the proposed class of problems yields global convergence of the function values and the arguments. This makes the algorithm robust for usage on non-convex problems. The convergence result is obtained based on the \\KL ine","authors_text":"Peter Ochs, Thomas Brox, Thomas Pock, Yunjin Chen","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2014-04-18T15:00:07Z","title":"iPiano: Inertial Proximal Algorithm for Non-Convex Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.4805","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:86ba776adfc4fa888d3b46c8f62ff2ab3774017205f0473fee3a175fd504bfb0","target":"record","created_at":"2026-05-18T02:53:54Z","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":"0cb8882a201d61bbcd393037c4b8cc70756b1a401c0a54e0489fb8fb3c669509","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2014-04-18T15:00:07Z","title_canon_sha256":"af9fd4035c64381562f6a4bb89c10b37c71e78162c4418e0070aa287b1e09e13"},"schema_version":"1.0","source":{"id":"1404.4805","kind":"arxiv","version":1}},"canonical_sha256":"b3ba3ac24fbf10ac9c8148dd32f28a0e58ab88a8ab5b25ac3d2239ee13452ead","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b3ba3ac24fbf10ac9c8148dd32f28a0e58ab88a8ab5b25ac3d2239ee13452ead","first_computed_at":"2026-05-18T02:53:54.853731Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:53:54.853731Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Ujlm31xQuQwGJjZK8wYV+pJJ/UwBdsyNKMTcIcF4vhHBKWiBVXjnVwbJHT8QLLukAfw7lIunv2DdP675NZKuDw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:53:54.854335Z","signed_message":"canonical_sha256_bytes"},"source_id":"1404.4805","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:86ba776adfc4fa888d3b46c8f62ff2ab3774017205f0473fee3a175fd504bfb0","sha256:367afed4624620998aa274c21e07ff464192a3d538530d8f75ba4e10a017f1f3"],"state_sha256":"ecdd6118707ccbd1722c9c62a16c06a60ad306043166c243e857b0442ff8dac3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Due0oo6UceC2pl4zhA9ykXIhIieoyRcip6tk9MgTy6KXHrueiB5V+s8uiuiYP7IYrtOP+UWvY7YMf+zNdfWbDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T00:05:27.369734Z","bundle_sha256":"ddadc34e8946ff6a33c373a01c29477b1d7817b933b5ebb7b07f8ffefb01347e"}}