{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:CRE2UQ5JTRHJUFRY4ERQ5ZQ25W","short_pith_number":"pith:CRE2UQ5J","canonical_record":{"source":{"id":"1402.6655","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-02-26T19:28:41Z","cross_cats_sorted":[],"title_canon_sha256":"3fb4d8323f656568965fded2b1a7f4dc6bb44e25b9cb0d018dd5c68d69057dab","abstract_canon_sha256":"20e0b5d0434623049f3defa63510e1a588f90ecd8b9b5e764408474245617495"},"schema_version":"1.0"},"canonical_sha256":"1449aa43a99c4e9a1638e1230ee61aedb744c149ff3895376faf09c206a3c877","source":{"kind":"arxiv","id":"1402.6655","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.6655","created_at":"2026-05-18T02:57:35Z"},{"alias_kind":"arxiv_version","alias_value":"1402.6655v2","created_at":"2026-05-18T02:57:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.6655","created_at":"2026-05-18T02:57:35Z"},{"alias_kind":"pith_short_12","alias_value":"CRE2UQ5JTRHJ","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_16","alias_value":"CRE2UQ5JTRHJUFRY","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_8","alias_value":"CRE2UQ5J","created_at":"2026-05-18T12:28:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:CRE2UQ5JTRHJUFRY4ERQ5ZQ25W","target":"record","payload":{"canonical_record":{"source":{"id":"1402.6655","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-02-26T19:28:41Z","cross_cats_sorted":[],"title_canon_sha256":"3fb4d8323f656568965fded2b1a7f4dc6bb44e25b9cb0d018dd5c68d69057dab","abstract_canon_sha256":"20e0b5d0434623049f3defa63510e1a588f90ecd8b9b5e764408474245617495"},"schema_version":"1.0"},"canonical_sha256":"1449aa43a99c4e9a1638e1230ee61aedb744c149ff3895376faf09c206a3c877","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:57:35.149525Z","signature_b64":"BaY8zzllY1sL1VJ9QwAhpIKVx0Htj4EYgj5IV1beT49h5SswqDTa8zp7eGSvCB5pRbqZn1x9CRwwQgPRCuFOBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1449aa43a99c4e9a1638e1230ee61aedb744c149ff3895376faf09c206a3c877","last_reissued_at":"2026-05-18T02:57:35.148973Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:57:35.148973Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1402.6655","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-18T02:57:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F4SsGAD7Wp52k2X9cqX9H73fUb/CN+4ah0zsMnmJwBGrnsC94UahTDEO4JgOIw1DyAq0UKw3i6MxdcbcgEYhCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T01:52:59.849041Z"},"content_sha256":"d5443846eace3f4a2e262a9f5df40c7f6713163dd116b408c670faf1b20bbbcb","schema_version":"1.0","event_id":"sha256:d5443846eace3f4a2e262a9f5df40c7f6713163dd116b408c670faf1b20bbbcb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:CRE2UQ5JTRHJUFRY4ERQ5ZQ25W","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Forward-backward truncated Newton methods for convex composite optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Alberto Bemporad, Lorenzo Stella, Panagiotis Patrinos","submitted_at":"2014-02-26T19:28:41Z","abstract_excerpt":"This paper proposes two proximal Newton-CG methods for convex nonsmooth optimization problems in composite form. The algorithms are based on a a reformulation of the original nonsmooth problem as the unconstrained minimization of a continuously differentiable function, namely the forward-backward envelope (FBE). The first algorithm is based on a standard line search strategy, whereas the second one combines the global efficiency estimates of the corresponding first-order methods, while achieving fast asymptotic convergence rates. Furthermore, they are computationally attractive since each Newt"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.6655","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-18T02:57:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5WSaQ4iE8XVSXqSaizs/nH6jQoiV7jiAGqfNilHCjNsBL6CttpRttAoQcZchNBe304IawL8fIBFYSiBqD+w2Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T01:52:59.849739Z"},"content_sha256":"688403bea5bd0f4ce7129c167d68c1fc6ed74e48eec0407cb7eae50e0ae5431e","schema_version":"1.0","event_id":"sha256:688403bea5bd0f4ce7129c167d68c1fc6ed74e48eec0407cb7eae50e0ae5431e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CRE2UQ5JTRHJUFRY4ERQ5ZQ25W/bundle.json","state_url":"https://pith.science/pith/CRE2UQ5JTRHJUFRY4ERQ5ZQ25W/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CRE2UQ5JTRHJUFRY4ERQ5ZQ25W/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-11T01:52:59Z","links":{"resolver":"https://pith.science/pith/CRE2UQ5JTRHJUFRY4ERQ5ZQ25W","bundle":"https://pith.science/pith/CRE2UQ5JTRHJUFRY4ERQ5ZQ25W/bundle.json","state":"https://pith.science/pith/CRE2UQ5JTRHJUFRY4ERQ5ZQ25W/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CRE2UQ5JTRHJUFRY4ERQ5ZQ25W/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:CRE2UQ5JTRHJUFRY4ERQ5ZQ25W","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":"20e0b5d0434623049f3defa63510e1a588f90ecd8b9b5e764408474245617495","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-02-26T19:28:41Z","title_canon_sha256":"3fb4d8323f656568965fded2b1a7f4dc6bb44e25b9cb0d018dd5c68d69057dab"},"schema_version":"1.0","source":{"id":"1402.6655","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.6655","created_at":"2026-05-18T02:57:35Z"},{"alias_kind":"arxiv_version","alias_value":"1402.6655v2","created_at":"2026-05-18T02:57:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.6655","created_at":"2026-05-18T02:57:35Z"},{"alias_kind":"pith_short_12","alias_value":"CRE2UQ5JTRHJ","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_16","alias_value":"CRE2UQ5JTRHJUFRY","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_8","alias_value":"CRE2UQ5J","created_at":"2026-05-18T12:28:22Z"}],"graph_snapshots":[{"event_id":"sha256:688403bea5bd0f4ce7129c167d68c1fc6ed74e48eec0407cb7eae50e0ae5431e","target":"graph","created_at":"2026-05-18T02:57:35Z","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 paper proposes two proximal Newton-CG methods for convex nonsmooth optimization problems in composite form. The algorithms are based on a a reformulation of the original nonsmooth problem as the unconstrained minimization of a continuously differentiable function, namely the forward-backward envelope (FBE). The first algorithm is based on a standard line search strategy, whereas the second one combines the global efficiency estimates of the corresponding first-order methods, while achieving fast asymptotic convergence rates. Furthermore, they are computationally attractive since each Newt","authors_text":"Alberto Bemporad, Lorenzo Stella, Panagiotis Patrinos","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-02-26T19:28:41Z","title":"Forward-backward truncated Newton methods for convex composite optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.6655","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:d5443846eace3f4a2e262a9f5df40c7f6713163dd116b408c670faf1b20bbbcb","target":"record","created_at":"2026-05-18T02:57:35Z","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":"20e0b5d0434623049f3defa63510e1a588f90ecd8b9b5e764408474245617495","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-02-26T19:28:41Z","title_canon_sha256":"3fb4d8323f656568965fded2b1a7f4dc6bb44e25b9cb0d018dd5c68d69057dab"},"schema_version":"1.0","source":{"id":"1402.6655","kind":"arxiv","version":2}},"canonical_sha256":"1449aa43a99c4e9a1638e1230ee61aedb744c149ff3895376faf09c206a3c877","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1449aa43a99c4e9a1638e1230ee61aedb744c149ff3895376faf09c206a3c877","first_computed_at":"2026-05-18T02:57:35.148973Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:57:35.148973Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BaY8zzllY1sL1VJ9QwAhpIKVx0Htj4EYgj5IV1beT49h5SswqDTa8zp7eGSvCB5pRbqZn1x9CRwwQgPRCuFOBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:57:35.149525Z","signed_message":"canonical_sha256_bytes"},"source_id":"1402.6655","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d5443846eace3f4a2e262a9f5df40c7f6713163dd116b408c670faf1b20bbbcb","sha256:688403bea5bd0f4ce7129c167d68c1fc6ed74e48eec0407cb7eae50e0ae5431e"],"state_sha256":"cc997e7e4c836197cb1d7f96571664cb778c0d8e1be6947749d6d698dea739c2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DLw1Dng+v6QfXh4bKmMlpMl1cVDiZp2/iYtkzlOyuNg7nb/lGfaG0qp3E4b1Hs/SdjRG3Mq6IZTfLM9E1m/LAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T01:52:59.853735Z","bundle_sha256":"0eddd8d3f6c8e5a94fcce528fe23eb80f5cd7e85dd464671f629254bf56c4afb"}}