{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:DGRZR2GDJDDP4HKFSPFWWKQIEK","short_pith_number":"pith:DGRZR2GD","canonical_record":{"source":{"id":"1506.00385","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2015-06-01T08:36:36Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"ae76ed8af0e44eccb57d52e8a5f4b2553319c12841eb69658d7dc53847e86bff","abstract_canon_sha256":"e89a7b8d0a9f69a944d5a442f821e84c9ed3444549a3aa2fe236509e705ec959"},"schema_version":"1.0"},"canonical_sha256":"19a398e8c348c6fe1d4593cb6b2a08229a2b3be4381ca7e78bed38b2f606dfc7","source":{"kind":"arxiv","id":"1506.00385","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.00385","created_at":"2026-05-18T01:15:00Z"},{"alias_kind":"arxiv_version","alias_value":"1506.00385v1","created_at":"2026-05-18T01:15:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.00385","created_at":"2026-05-18T01:15:00Z"},{"alias_kind":"pith_short_12","alias_value":"DGRZR2GDJDDP","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"DGRZR2GDJDDP4HKF","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"DGRZR2GD","created_at":"2026-05-18T12:29:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:DGRZR2GDJDDP4HKFSPFWWKQIEK","target":"record","payload":{"canonical_record":{"source":{"id":"1506.00385","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2015-06-01T08:36:36Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"ae76ed8af0e44eccb57d52e8a5f4b2553319c12841eb69658d7dc53847e86bff","abstract_canon_sha256":"e89a7b8d0a9f69a944d5a442f821e84c9ed3444549a3aa2fe236509e705ec959"},"schema_version":"1.0"},"canonical_sha256":"19a398e8c348c6fe1d4593cb6b2a08229a2b3be4381ca7e78bed38b2f606dfc7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:15:00.376584Z","signature_b64":"pWrM4avSk0ATX3LYO+eEF1GxmUYUl69l3g8Byl45+yupdp+rAcZcFqgjbCM/wv/NWz/ZwzBGj7Ptm+l0Lo2zDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"19a398e8c348c6fe1d4593cb6b2a08229a2b3be4381ca7e78bed38b2f606dfc7","last_reissued_at":"2026-05-18T01:15:00.376030Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:15:00.376030Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1506.00385","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-18T01:15:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oqgQZj2OhCpH6OJZuUlor5ewY38q2TaI5NliIKF+mN2sT1aMNQ3VKveqibgjjEo5OAj8AG4exjsjRTuncjTPBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T18:28:43.427587Z"},"content_sha256":"1bbb941886f9bfab336a8be20615e4923558a67f2f4273050821d06121d2d087","schema_version":"1.0","event_id":"sha256:1bbb941886f9bfab336a8be20615e4923558a67f2f4273050821d06121d2d087"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:DGRZR2GDJDDP4HKFSPFWWKQIEK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Variable metric inexact line-search based methods for nonsmooth optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"math.NA","authors_text":"Federica Porta, Ignace Loris, Marco Prato, Silvia Bonettini","submitted_at":"2015-06-01T08:36:36Z","abstract_excerpt":"We develop a new proximal-gradient method for minimizing the sum of a differentiable, possibly nonconvex, function plus a convex, possibly non differentiable, function. The key features of the proposed method are the definition of a suitable descent direction, based on the proximal operator associated to the convex part of the objective function, and an Armijo-like rule to determine the step size along this direction ensuring the sufficient decrease of the objective function. In this frame, we especially address the possibility of adopting a metric which may change at each iteration and an ine"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.00385","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-18T01:15:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fSBKogewkEYtJRU7hQe7RDpKl1FtDo7inYsc7SgSFJ6v4oaymoDfqlqJz02oXfu31CPeOeqdC+UtIrSxvHPqDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T18:28:43.428061Z"},"content_sha256":"7bc1ba301508e23bc67aa7b34c3afd56a2fe413eea1310ccbeb4693fffc1eedd","schema_version":"1.0","event_id":"sha256:7bc1ba301508e23bc67aa7b34c3afd56a2fe413eea1310ccbeb4693fffc1eedd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DGRZR2GDJDDP4HKFSPFWWKQIEK/bundle.json","state_url":"https://pith.science/pith/DGRZR2GDJDDP4HKFSPFWWKQIEK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DGRZR2GDJDDP4HKFSPFWWKQIEK/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-27T18:28:43Z","links":{"resolver":"https://pith.science/pith/DGRZR2GDJDDP4HKFSPFWWKQIEK","bundle":"https://pith.science/pith/DGRZR2GDJDDP4HKFSPFWWKQIEK/bundle.json","state":"https://pith.science/pith/DGRZR2GDJDDP4HKFSPFWWKQIEK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DGRZR2GDJDDP4HKFSPFWWKQIEK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:DGRZR2GDJDDP4HKFSPFWWKQIEK","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":"e89a7b8d0a9f69a944d5a442f821e84c9ed3444549a3aa2fe236509e705ec959","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2015-06-01T08:36:36Z","title_canon_sha256":"ae76ed8af0e44eccb57d52e8a5f4b2553319c12841eb69658d7dc53847e86bff"},"schema_version":"1.0","source":{"id":"1506.00385","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.00385","created_at":"2026-05-18T01:15:00Z"},{"alias_kind":"arxiv_version","alias_value":"1506.00385v1","created_at":"2026-05-18T01:15:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.00385","created_at":"2026-05-18T01:15:00Z"},{"alias_kind":"pith_short_12","alias_value":"DGRZR2GDJDDP","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"DGRZR2GDJDDP4HKF","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"DGRZR2GD","created_at":"2026-05-18T12:29:17Z"}],"graph_snapshots":[{"event_id":"sha256:7bc1ba301508e23bc67aa7b34c3afd56a2fe413eea1310ccbeb4693fffc1eedd","target":"graph","created_at":"2026-05-18T01:15:00Z","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":"We develop a new proximal-gradient method for minimizing the sum of a differentiable, possibly nonconvex, function plus a convex, possibly non differentiable, function. The key features of the proposed method are the definition of a suitable descent direction, based on the proximal operator associated to the convex part of the objective function, and an Armijo-like rule to determine the step size along this direction ensuring the sufficient decrease of the objective function. In this frame, we especially address the possibility of adopting a metric which may change at each iteration and an ine","authors_text":"Federica Porta, Ignace Loris, Marco Prato, Silvia Bonettini","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2015-06-01T08:36:36Z","title":"Variable metric inexact line-search based methods for nonsmooth optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.00385","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:1bbb941886f9bfab336a8be20615e4923558a67f2f4273050821d06121d2d087","target":"record","created_at":"2026-05-18T01:15:00Z","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":"e89a7b8d0a9f69a944d5a442f821e84c9ed3444549a3aa2fe236509e705ec959","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2015-06-01T08:36:36Z","title_canon_sha256":"ae76ed8af0e44eccb57d52e8a5f4b2553319c12841eb69658d7dc53847e86bff"},"schema_version":"1.0","source":{"id":"1506.00385","kind":"arxiv","version":1}},"canonical_sha256":"19a398e8c348c6fe1d4593cb6b2a08229a2b3be4381ca7e78bed38b2f606dfc7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"19a398e8c348c6fe1d4593cb6b2a08229a2b3be4381ca7e78bed38b2f606dfc7","first_computed_at":"2026-05-18T01:15:00.376030Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:15:00.376030Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pWrM4avSk0ATX3LYO+eEF1GxmUYUl69l3g8Byl45+yupdp+rAcZcFqgjbCM/wv/NWz/ZwzBGj7Ptm+l0Lo2zDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:15:00.376584Z","signed_message":"canonical_sha256_bytes"},"source_id":"1506.00385","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1bbb941886f9bfab336a8be20615e4923558a67f2f4273050821d06121d2d087","sha256:7bc1ba301508e23bc67aa7b34c3afd56a2fe413eea1310ccbeb4693fffc1eedd"],"state_sha256":"5e9763cd396b0b0c10f9a6101c188303ba0ada1cfa35781428b9c7c6731c4a18"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"X4Ndmqfq3/3ThfBN5NJKAJ8kVmYsmLhluHnHY+KkekBwO3+5atziTNQh4iv/LYLSvGOI6kQITf5H10zkqSHVBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T18:28:43.430431Z","bundle_sha256":"4fb5223d5d35cfd4fba13108d9fbde1e7e54c14c9c6ce4352d5945143a01901e"}}