{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:VNLUVX5Z4Y7246QHBYVJM4GWCG","short_pith_number":"pith:VNLUVX5Z","canonical_record":{"source":{"id":"1203.2070","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-03-09T13:14:24Z","cross_cats_sorted":[],"title_canon_sha256":"b0d01434ffed0656524b9eee08435da8cdf4949b77b6e8c0cada5ece40f76d31","abstract_canon_sha256":"8e4243993668a6b98a977d6403e3327b5e0165ad4d0e00eb42926867ed2458dc"},"schema_version":"1.0"},"canonical_sha256":"ab574adfb9e63fae7a070e2a9670d6118e81727767f4858f8445d42498cb7fe0","source":{"kind":"arxiv","id":"1203.2070","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.2070","created_at":"2026-05-18T04:00:27Z"},{"alias_kind":"arxiv_version","alias_value":"1203.2070v1","created_at":"2026-05-18T04:00:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.2070","created_at":"2026-05-18T04:00:27Z"},{"alias_kind":"pith_short_12","alias_value":"VNLUVX5Z4Y72","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_16","alias_value":"VNLUVX5Z4Y7246QH","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_8","alias_value":"VNLUVX5Z","created_at":"2026-05-18T12:27:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:VNLUVX5Z4Y7246QHBYVJM4GWCG","target":"record","payload":{"canonical_record":{"source":{"id":"1203.2070","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-03-09T13:14:24Z","cross_cats_sorted":[],"title_canon_sha256":"b0d01434ffed0656524b9eee08435da8cdf4949b77b6e8c0cada5ece40f76d31","abstract_canon_sha256":"8e4243993668a6b98a977d6403e3327b5e0165ad4d0e00eb42926867ed2458dc"},"schema_version":"1.0"},"canonical_sha256":"ab574adfb9e63fae7a070e2a9670d6118e81727767f4858f8445d42498cb7fe0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:00:27.569761Z","signature_b64":"jcIbWokNOzgODJprQUqz6BJ+JjEKr61wNfnBCsN8GMjSg612aTwjzGnQ41wktecFDZqNuKbhR1yuNL2ooyKpAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ab574adfb9e63fae7a070e2a9670d6118e81727767f4858f8445d42498cb7fe0","last_reissued_at":"2026-05-18T04:00:27.569298Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:00:27.569298Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1203.2070","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-18T04:00:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dzKRx42Rq7lhUo3MBfGaRlOSWz9+nJa7rws3fOcCJe2rLxv3jqnbEb/gbKpWHfuLRssMeFUBPrZDexoWh8ylCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T06:56:40.466251Z"},"content_sha256":"6aa77a925734a4c48e73d634b6fdcdc3ccd0961c090b513d83acbf07c0e3a2b1","schema_version":"1.0","event_id":"sha256:6aa77a925734a4c48e73d634b6fdcdc3ccd0961c090b513d83acbf07c0e3a2b1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:VNLUVX5Z4Y7246QHBYVJM4GWCG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A double smoothing technique for solving unconstrained nondifferentiable convex optimization problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Christopher Hendrich, Radu Ioan Bot","submitted_at":"2012-03-09T13:14:24Z","abstract_excerpt":"The aim of this paper is to develop an efficient algorithm for solving a class of unconstrained nondifferentiable convex optimization problems in finite dimensional spaces. To this end we formulate first its Fenchel dual problem and regularize it in two steps into a differentiable strongly convex one with Lipschitz continuous gradient. The doubly regularized dual problem is then solved via a fast gradient method with the aim of accelerating the resulting convergence scheme. The theoretical results are finally applied to an l1 regularization problem arising in image processing."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.2070","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-18T04:00:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lab1apD7qQULSFlSIP5VchJFDReaBfAU1zc3KU3vrs4QFo+2JTB94C51g6F98uhPMPeaLXrYNSCWgMI5TRX+Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T06:56:40.466633Z"},"content_sha256":"a5f242fb3b9931d8f1a304f1d7fcbf2e9e11b29878d3d5d8df04b8f34e73acbb","schema_version":"1.0","event_id":"sha256:a5f242fb3b9931d8f1a304f1d7fcbf2e9e11b29878d3d5d8df04b8f34e73acbb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VNLUVX5Z4Y7246QHBYVJM4GWCG/bundle.json","state_url":"https://pith.science/pith/VNLUVX5Z4Y7246QHBYVJM4GWCG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VNLUVX5Z4Y7246QHBYVJM4GWCG/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-20T06:56:40Z","links":{"resolver":"https://pith.science/pith/VNLUVX5Z4Y7246QHBYVJM4GWCG","bundle":"https://pith.science/pith/VNLUVX5Z4Y7246QHBYVJM4GWCG/bundle.json","state":"https://pith.science/pith/VNLUVX5Z4Y7246QHBYVJM4GWCG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VNLUVX5Z4Y7246QHBYVJM4GWCG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:VNLUVX5Z4Y7246QHBYVJM4GWCG","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":"8e4243993668a6b98a977d6403e3327b5e0165ad4d0e00eb42926867ed2458dc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-03-09T13:14:24Z","title_canon_sha256":"b0d01434ffed0656524b9eee08435da8cdf4949b77b6e8c0cada5ece40f76d31"},"schema_version":"1.0","source":{"id":"1203.2070","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.2070","created_at":"2026-05-18T04:00:27Z"},{"alias_kind":"arxiv_version","alias_value":"1203.2070v1","created_at":"2026-05-18T04:00:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.2070","created_at":"2026-05-18T04:00:27Z"},{"alias_kind":"pith_short_12","alias_value":"VNLUVX5Z4Y72","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_16","alias_value":"VNLUVX5Z4Y7246QH","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_8","alias_value":"VNLUVX5Z","created_at":"2026-05-18T12:27:25Z"}],"graph_snapshots":[{"event_id":"sha256:a5f242fb3b9931d8f1a304f1d7fcbf2e9e11b29878d3d5d8df04b8f34e73acbb","target":"graph","created_at":"2026-05-18T04:00:27Z","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":"The aim of this paper is to develop an efficient algorithm for solving a class of unconstrained nondifferentiable convex optimization problems in finite dimensional spaces. To this end we formulate first its Fenchel dual problem and regularize it in two steps into a differentiable strongly convex one with Lipschitz continuous gradient. The doubly regularized dual problem is then solved via a fast gradient method with the aim of accelerating the resulting convergence scheme. The theoretical results are finally applied to an l1 regularization problem arising in image processing.","authors_text":"Christopher Hendrich, Radu Ioan Bot","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-03-09T13:14:24Z","title":"A double smoothing technique for solving unconstrained nondifferentiable convex optimization problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.2070","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:6aa77a925734a4c48e73d634b6fdcdc3ccd0961c090b513d83acbf07c0e3a2b1","target":"record","created_at":"2026-05-18T04:00:27Z","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":"8e4243993668a6b98a977d6403e3327b5e0165ad4d0e00eb42926867ed2458dc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-03-09T13:14:24Z","title_canon_sha256":"b0d01434ffed0656524b9eee08435da8cdf4949b77b6e8c0cada5ece40f76d31"},"schema_version":"1.0","source":{"id":"1203.2070","kind":"arxiv","version":1}},"canonical_sha256":"ab574adfb9e63fae7a070e2a9670d6118e81727767f4858f8445d42498cb7fe0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ab574adfb9e63fae7a070e2a9670d6118e81727767f4858f8445d42498cb7fe0","first_computed_at":"2026-05-18T04:00:27.569298Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:00:27.569298Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jcIbWokNOzgODJprQUqz6BJ+JjEKr61wNfnBCsN8GMjSg612aTwjzGnQ41wktecFDZqNuKbhR1yuNL2ooyKpAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:00:27.569761Z","signed_message":"canonical_sha256_bytes"},"source_id":"1203.2070","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6aa77a925734a4c48e73d634b6fdcdc3ccd0961c090b513d83acbf07c0e3a2b1","sha256:a5f242fb3b9931d8f1a304f1d7fcbf2e9e11b29878d3d5d8df04b8f34e73acbb"],"state_sha256":"266a38aa274d133bce4f09752c4164fca4d263e1827e7e9e6f9172e4d7f73b8b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vlm28D+C2LbHm+XncVrGWq9VWdAE2IKSp62EGt8B+3BSfS5lDJ9H+XCppngPOG7HjpGti7pTba2rIIMeZoxgCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T06:56:40.468530Z","bundle_sha256":"6b15c707028ea75f207d6ba2a585d98f5da970d9ab46d3ad108f0913108013c7"}}