{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:27UVZ37OKGQ2TWIHVXQCRQAIOR","short_pith_number":"pith:27UVZ37O","canonical_record":{"source":{"id":"1806.07294","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2018-06-19T14:53:44Z","cross_cats_sorted":[],"title_canon_sha256":"6e4dcfc184c0d6e595fed16769cdd92ddcc4169d970751b2efedcd947b4c70f2","abstract_canon_sha256":"c0e7a9d1f55b14112891be3781d537a1879b863f65ac7672b3d5b8357210dcf0"},"schema_version":"1.0"},"canonical_sha256":"d7e95cefee51a1a9d907ade028c00874587c297b813fb374d4d681310462d0b2","source":{"kind":"arxiv","id":"1806.07294","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.07294","created_at":"2026-05-17T23:55:34Z"},{"alias_kind":"arxiv_version","alias_value":"1806.07294v2","created_at":"2026-05-17T23:55:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.07294","created_at":"2026-05-17T23:55:34Z"},{"alias_kind":"pith_short_12","alias_value":"27UVZ37OKGQ2","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"27UVZ37OKGQ2TWIH","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"27UVZ37O","created_at":"2026-05-18T12:31:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:27UVZ37OKGQ2TWIHVXQCRQAIOR","target":"record","payload":{"canonical_record":{"source":{"id":"1806.07294","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2018-06-19T14:53:44Z","cross_cats_sorted":[],"title_canon_sha256":"6e4dcfc184c0d6e595fed16769cdd92ddcc4169d970751b2efedcd947b4c70f2","abstract_canon_sha256":"c0e7a9d1f55b14112891be3781d537a1879b863f65ac7672b3d5b8357210dcf0"},"schema_version":"1.0"},"canonical_sha256":"d7e95cefee51a1a9d907ade028c00874587c297b813fb374d4d681310462d0b2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:55:34.348428Z","signature_b64":"W6//Fet/KpV9FIpNVGKn/9cQs5tcXko/kpG1HCeSbSkyZ0yZO5QjuEkwbRs4bCQ3A8nH0d1P8FLhqyIRYK4RCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d7e95cefee51a1a9d907ade028c00874587c297b813fb374d4d681310462d0b2","last_reissued_at":"2026-05-17T23:55:34.347963Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:55:34.347963Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1806.07294","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-17T23:55:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AsYpRx2SOghkpdPAAdNBKPrH1nXhS344ZagTdFJyoQhHjq1gDZxFMQ5asqfF2GcQarQwTtzv75eUKYshMxsuAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T12:26:54.118509Z"},"content_sha256":"ac055a32e9248a21181afcb6f4a448e7a9cfc5aeba55fc04dbe16fc1c379046d","schema_version":"1.0","event_id":"sha256:ac055a32e9248a21181afcb6f4a448e7a9cfc5aeba55fc04dbe16fc1c379046d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:27UVZ37OKGQ2TWIHVXQCRQAIOR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Proximal Splitting Meets Variance Reduction","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Fabian Pedregosa, Kilian Fatras, Mattia Casotto","submitted_at":"2018-06-19T14:53:44Z","abstract_excerpt":"Despite the rise to fame of incremental variance-reduced methods in recent years, their use in nonsmooth optimization is still limited to few simple cases. This is due to the fact that existing methods require to evaluate the proximity operator for the nonsmooth terms, which can be a costly operation for complex penalties. In this work we introduce two variance-reduced incremental methods based on SAGA and SVRG that can efficiently take into account complex penalties which can be expressed as a sum of proximal terms. This includes penalties such as total variation, group lasso with overlap and"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.07294","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-17T23:55:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ew1dYDnmIggsXMvtb8gM+uvAazTh6vvusv0xmfDaGkANyP6Ki2SB6XSte17Kbv+6JNE9r1/dWnNMmqdXrVEcCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T12:26:54.118897Z"},"content_sha256":"f0b78b8d2c4c5bce0c12b7858b7e53eb516a990fd1a6863c50b7e25119164b32","schema_version":"1.0","event_id":"sha256:f0b78b8d2c4c5bce0c12b7858b7e53eb516a990fd1a6863c50b7e25119164b32"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/27UVZ37OKGQ2TWIHVXQCRQAIOR/bundle.json","state_url":"https://pith.science/pith/27UVZ37OKGQ2TWIHVXQCRQAIOR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/27UVZ37OKGQ2TWIHVXQCRQAIOR/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-02T12:26:54Z","links":{"resolver":"https://pith.science/pith/27UVZ37OKGQ2TWIHVXQCRQAIOR","bundle":"https://pith.science/pith/27UVZ37OKGQ2TWIHVXQCRQAIOR/bundle.json","state":"https://pith.science/pith/27UVZ37OKGQ2TWIHVXQCRQAIOR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/27UVZ37OKGQ2TWIHVXQCRQAIOR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:27UVZ37OKGQ2TWIHVXQCRQAIOR","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":"c0e7a9d1f55b14112891be3781d537a1879b863f65ac7672b3d5b8357210dcf0","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2018-06-19T14:53:44Z","title_canon_sha256":"6e4dcfc184c0d6e595fed16769cdd92ddcc4169d970751b2efedcd947b4c70f2"},"schema_version":"1.0","source":{"id":"1806.07294","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.07294","created_at":"2026-05-17T23:55:34Z"},{"alias_kind":"arxiv_version","alias_value":"1806.07294v2","created_at":"2026-05-17T23:55:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.07294","created_at":"2026-05-17T23:55:34Z"},{"alias_kind":"pith_short_12","alias_value":"27UVZ37OKGQ2","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"27UVZ37OKGQ2TWIH","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"27UVZ37O","created_at":"2026-05-18T12:31:59Z"}],"graph_snapshots":[{"event_id":"sha256:f0b78b8d2c4c5bce0c12b7858b7e53eb516a990fd1a6863c50b7e25119164b32","target":"graph","created_at":"2026-05-17T23:55:34Z","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":"Despite the rise to fame of incremental variance-reduced methods in recent years, their use in nonsmooth optimization is still limited to few simple cases. This is due to the fact that existing methods require to evaluate the proximity operator for the nonsmooth terms, which can be a costly operation for complex penalties. In this work we introduce two variance-reduced incremental methods based on SAGA and SVRG that can efficiently take into account complex penalties which can be expressed as a sum of proximal terms. This includes penalties such as total variation, group lasso with overlap and","authors_text":"Fabian Pedregosa, Kilian Fatras, Mattia Casotto","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2018-06-19T14:53:44Z","title":"Proximal Splitting Meets Variance Reduction"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.07294","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:ac055a32e9248a21181afcb6f4a448e7a9cfc5aeba55fc04dbe16fc1c379046d","target":"record","created_at":"2026-05-17T23:55:34Z","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":"c0e7a9d1f55b14112891be3781d537a1879b863f65ac7672b3d5b8357210dcf0","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2018-06-19T14:53:44Z","title_canon_sha256":"6e4dcfc184c0d6e595fed16769cdd92ddcc4169d970751b2efedcd947b4c70f2"},"schema_version":"1.0","source":{"id":"1806.07294","kind":"arxiv","version":2}},"canonical_sha256":"d7e95cefee51a1a9d907ade028c00874587c297b813fb374d4d681310462d0b2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d7e95cefee51a1a9d907ade028c00874587c297b813fb374d4d681310462d0b2","first_computed_at":"2026-05-17T23:55:34.347963Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:55:34.347963Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"W6//Fet/KpV9FIpNVGKn/9cQs5tcXko/kpG1HCeSbSkyZ0yZO5QjuEkwbRs4bCQ3A8nH0d1P8FLhqyIRYK4RCA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:55:34.348428Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.07294","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ac055a32e9248a21181afcb6f4a448e7a9cfc5aeba55fc04dbe16fc1c379046d","sha256:f0b78b8d2c4c5bce0c12b7858b7e53eb516a990fd1a6863c50b7e25119164b32"],"state_sha256":"d45491c28073a49957e464c9dcf32fbe3af091b6f9d27dd58fadf6dbb6ae060b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5JF3OOfIL7UXV/YcuxXYihVXtdrjUe8x9S4Kai7PSaAaCF5JK3Xqf4BEtb4gcfRNf1RR9rB9bQD7lESWnCxvDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T12:26:54.121015Z","bundle_sha256":"8ce065f58586923ff01283e34ac33a1bb39774e5af9cf11236e6f1b034b18e8b"}}