{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:OUZMQMD4EDPJVW5RWEZDHI7YSA","short_pith_number":"pith:OUZMQMD4","canonical_record":{"source":{"id":"1402.0779","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-02-04T15:58:44Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"10197850cda8e713d92e5df8b4da0a65ba5d44fa026b06afe31f3295ed138268","abstract_canon_sha256":"75510dbc665971782aab34fca60e521a71cb5276f01cca32c5fb79855a76315d"},"schema_version":"1.0"},"canonical_sha256":"7532c8307c20de9adbb1b13233a3f89010c76f592fb5070a370b8939473479eb","source":{"kind":"arxiv","id":"1402.0779","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.0779","created_at":"2026-05-18T00:54:04Z"},{"alias_kind":"arxiv_version","alias_value":"1402.0779v3","created_at":"2026-05-18T00:54:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.0779","created_at":"2026-05-18T00:54:04Z"},{"alias_kind":"pith_short_12","alias_value":"OUZMQMD4EDPJ","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"OUZMQMD4EDPJVW5R","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"OUZMQMD4","created_at":"2026-05-18T12:28:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:OUZMQMD4EDPJVW5RWEZDHI7YSA","target":"record","payload":{"canonical_record":{"source":{"id":"1402.0779","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-02-04T15:58:44Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"10197850cda8e713d92e5df8b4da0a65ba5d44fa026b06afe31f3295ed138268","abstract_canon_sha256":"75510dbc665971782aab34fca60e521a71cb5276f01cca32c5fb79855a76315d"},"schema_version":"1.0"},"canonical_sha256":"7532c8307c20de9adbb1b13233a3f89010c76f592fb5070a370b8939473479eb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:54:04.081587Z","signature_b64":"0RH3G4RRDTV79r278Z+mIiUL+PvOukCHOsecBnblkKHtXdzmR6km6vDsam1YdTNJAKFb9BAy3hGwbkfJAGVtDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7532c8307c20de9adbb1b13233a3f89010c76f592fb5070a370b8939473479eb","last_reissued_at":"2026-05-18T00:54:04.081201Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:54:04.081201Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1402.0779","source_version":3,"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-18T00:54:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lt4AQjvjuq0wqOZZwHc+CvvMsWEILS9UEGSmgGy+vvGJCfUbA+9qsU5nFsNITr9qh75K0+5ZULXQx7VtoVrCBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T05:07:08.165889Z"},"content_sha256":"57c74ff143a0fc76940f559422dd40707f7bf66b0f7bed7b5292d6d7a98dc1c4","schema_version":"1.0","event_id":"sha256:57c74ff143a0fc76940f559422dd40707f7bf66b0f7bed7b5292d6d7a98dc1c4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:OUZMQMD4EDPJVW5RWEZDHI7YSA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"UNLocBoX: A MATLAB convex optimization toolbox for proximal-splitting methods","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"David Shuman, Nathanael Perraudin, Pierre Vandergheynst, Vassilis Kalofolias","submitted_at":"2014-02-04T15:58:44Z","abstract_excerpt":"Convex optimization is an essential tool for machine learning, as many of its problems can be formulated as minimization problems of specific objective functions. While there is a large variety of algorithms available to solve convex problems, we can argue that it becomes more and more important to focus on efficient, scalable methods that can deal with big data. When the objective function can be written as a sum of \"simple\" terms, proximal splitting methods are a good choice. UNLocBoX is a MATLAB library that implements many of these methods, designed to solve convex optimization problems of"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.0779","kind":"arxiv","version":3},"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-18T00:54:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HBHI7dVrPDhNOppO+L3Jzz+IZ8Duchmgaa9AWfPQVN0Oixz7ZQyKXePUA1eq6uKpogsymMOD3RGuCBKcfLPdCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T05:07:08.166236Z"},"content_sha256":"90b087325b78209244f3593906a1a4c2e6065b17f69348fa33bc707e945a406a","schema_version":"1.0","event_id":"sha256:90b087325b78209244f3593906a1a4c2e6065b17f69348fa33bc707e945a406a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OUZMQMD4EDPJVW5RWEZDHI7YSA/bundle.json","state_url":"https://pith.science/pith/OUZMQMD4EDPJVW5RWEZDHI7YSA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OUZMQMD4EDPJVW5RWEZDHI7YSA/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-07-05T05:07:08Z","links":{"resolver":"https://pith.science/pith/OUZMQMD4EDPJVW5RWEZDHI7YSA","bundle":"https://pith.science/pith/OUZMQMD4EDPJVW5RWEZDHI7YSA/bundle.json","state":"https://pith.science/pith/OUZMQMD4EDPJVW5RWEZDHI7YSA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OUZMQMD4EDPJVW5RWEZDHI7YSA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:OUZMQMD4EDPJVW5RWEZDHI7YSA","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":"75510dbc665971782aab34fca60e521a71cb5276f01cca32c5fb79855a76315d","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-02-04T15:58:44Z","title_canon_sha256":"10197850cda8e713d92e5df8b4da0a65ba5d44fa026b06afe31f3295ed138268"},"schema_version":"1.0","source":{"id":"1402.0779","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.0779","created_at":"2026-05-18T00:54:04Z"},{"alias_kind":"arxiv_version","alias_value":"1402.0779v3","created_at":"2026-05-18T00:54:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.0779","created_at":"2026-05-18T00:54:04Z"},{"alias_kind":"pith_short_12","alias_value":"OUZMQMD4EDPJ","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"OUZMQMD4EDPJVW5R","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"OUZMQMD4","created_at":"2026-05-18T12:28:43Z"}],"graph_snapshots":[{"event_id":"sha256:90b087325b78209244f3593906a1a4c2e6065b17f69348fa33bc707e945a406a","target":"graph","created_at":"2026-05-18T00:54:04Z","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":"Convex optimization is an essential tool for machine learning, as many of its problems can be formulated as minimization problems of specific objective functions. While there is a large variety of algorithms available to solve convex problems, we can argue that it becomes more and more important to focus on efficient, scalable methods that can deal with big data. When the objective function can be written as a sum of \"simple\" terms, proximal splitting methods are a good choice. UNLocBoX is a MATLAB library that implements many of these methods, designed to solve convex optimization problems of","authors_text":"David Shuman, Nathanael Perraudin, Pierre Vandergheynst, Vassilis Kalofolias","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-02-04T15:58:44Z","title":"UNLocBoX: A MATLAB convex optimization toolbox for proximal-splitting methods"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.0779","kind":"arxiv","version":3},"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:57c74ff143a0fc76940f559422dd40707f7bf66b0f7bed7b5292d6d7a98dc1c4","target":"record","created_at":"2026-05-18T00:54:04Z","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":"75510dbc665971782aab34fca60e521a71cb5276f01cca32c5fb79855a76315d","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-02-04T15:58:44Z","title_canon_sha256":"10197850cda8e713d92e5df8b4da0a65ba5d44fa026b06afe31f3295ed138268"},"schema_version":"1.0","source":{"id":"1402.0779","kind":"arxiv","version":3}},"canonical_sha256":"7532c8307c20de9adbb1b13233a3f89010c76f592fb5070a370b8939473479eb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7532c8307c20de9adbb1b13233a3f89010c76f592fb5070a370b8939473479eb","first_computed_at":"2026-05-18T00:54:04.081201Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:54:04.081201Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0RH3G4RRDTV79r278Z+mIiUL+PvOukCHOsecBnblkKHtXdzmR6km6vDsam1YdTNJAKFb9BAy3hGwbkfJAGVtDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:54:04.081587Z","signed_message":"canonical_sha256_bytes"},"source_id":"1402.0779","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:57c74ff143a0fc76940f559422dd40707f7bf66b0f7bed7b5292d6d7a98dc1c4","sha256:90b087325b78209244f3593906a1a4c2e6065b17f69348fa33bc707e945a406a"],"state_sha256":"d771747ce429b8689d9d660ec915fadb7b758e3c337f2e6b89fccced93dcdc9f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"e1+oaryo/evJdDZl7oN2a/hsqnziKe9r2SZQOo9QfFwIP3CSFHEK72cXQLrOsQB0ikmXkKH0ZtQjr/gMyvImAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-05T05:07:08.168053Z","bundle_sha256":"b99a5e6e60036039d0653a859e2a03c486e1448321ff4d0eea2c0089fb93eed3"}}