{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:KZ6AA63TGVKWXZWPBUQ4NT2MQH","short_pith_number":"pith:KZ6AA63T","canonical_record":{"source":{"id":"1502.03175","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-02-11T02:21:49Z","cross_cats_sorted":["cs.LG","stat.ME"],"title_canon_sha256":"3d0490d2bc91e3b77575d2a8ce21a5ee592803a6e5d20888c7b9ce7edb66e5b1","abstract_canon_sha256":"17cb43820dd78cfec75855437a1df3098925211e032734dffc449ade8443e4b6"},"schema_version":"1.0"},"canonical_sha256":"567c007b7335556be6cf0d21c6cf4c81ed29095fd71ae0ce8e6decffdc5ba13d","source":{"kind":"arxiv","id":"1502.03175","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.03175","created_at":"2026-05-18T01:59:57Z"},{"alias_kind":"arxiv_version","alias_value":"1502.03175v3","created_at":"2026-05-18T01:59:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.03175","created_at":"2026-05-18T01:59:57Z"},{"alias_kind":"pith_short_12","alias_value":"KZ6AA63TGVKW","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"KZ6AA63TGVKWXZWP","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"KZ6AA63T","created_at":"2026-05-18T12:29:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:KZ6AA63TGVKWXZWPBUQ4NT2MQH","target":"record","payload":{"canonical_record":{"source":{"id":"1502.03175","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-02-11T02:21:49Z","cross_cats_sorted":["cs.LG","stat.ME"],"title_canon_sha256":"3d0490d2bc91e3b77575d2a8ce21a5ee592803a6e5d20888c7b9ce7edb66e5b1","abstract_canon_sha256":"17cb43820dd78cfec75855437a1df3098925211e032734dffc449ade8443e4b6"},"schema_version":"1.0"},"canonical_sha256":"567c007b7335556be6cf0d21c6cf4c81ed29095fd71ae0ce8e6decffdc5ba13d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:59:57.769348Z","signature_b64":"ni3iL75em/TuI4OiI5XS22yhAH/h0gYBsz8K5GuLxtE0cYQOazGmlWSa8m3MeKB3MAgcpw+40uaA8p6p2474Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"567c007b7335556be6cf0d21c6cf4c81ed29095fd71ae0ce8e6decffdc5ba13d","last_reissued_at":"2026-05-18T01:59:57.768715Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:59:57.768715Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1502.03175","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-18T01:59:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Z/cI+SvE6BBxvsidyD9mrCS/R+BX6Fww+jOFF22RRFugA4YeBETWrp6z+3qa7Oj/yzx570EHXW2VaQZ02U0MDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T10:31:53.696775Z"},"content_sha256":"89213c312af44575c07328e37372a4dec10fac0fdf6e0656374f3874bb4c74fa","schema_version":"1.0","event_id":"sha256:89213c312af44575c07328e37372a4dec10fac0fdf6e0656374f3874bb4c74fa"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:KZ6AA63TGVKWXZWPBUQ4NT2MQH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Proximal Algorithms in Statistics and Machine Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ME"],"primary_cat":"stat.ML","authors_text":"Brandon T. Willard, James G. Scott, Nicholas G. Polson","submitted_at":"2015-02-11T02:21:49Z","abstract_excerpt":"In this paper we develop proximal methods for statistical learning. Proximal point algorithms are useful in statistics and machine learning for obtaining optimization solutions for composite functions. Our approach exploits closed-form solutions of proximal operators and envelope representations based on the Moreau, Forward-Backward, Douglas-Rachford and Half-Quadratic envelopes. Envelope representations lead to novel proximal algorithms for statistical optimisation of composite objective functions which include both non-smooth and non-convex objectives. We illustrate our methodology with regu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.03175","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-18T01:59:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7eZCX6zqWrFwk9uQjNF3s2HYXy1zpAs8mCCbOVPVnD2uVEbOpKTiPDFxf88eqB0PWJ+Cp6KWW7C71JSHTW5cCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T10:31:53.697487Z"},"content_sha256":"7dcf0ba98bad06891d0fa55c6c1b9c1d00267b5e72165bce720f9aa8a4963873","schema_version":"1.0","event_id":"sha256:7dcf0ba98bad06891d0fa55c6c1b9c1d00267b5e72165bce720f9aa8a4963873"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KZ6AA63TGVKWXZWPBUQ4NT2MQH/bundle.json","state_url":"https://pith.science/pith/KZ6AA63TGVKWXZWPBUQ4NT2MQH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KZ6AA63TGVKWXZWPBUQ4NT2MQH/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-10T10:31:53Z","links":{"resolver":"https://pith.science/pith/KZ6AA63TGVKWXZWPBUQ4NT2MQH","bundle":"https://pith.science/pith/KZ6AA63TGVKWXZWPBUQ4NT2MQH/bundle.json","state":"https://pith.science/pith/KZ6AA63TGVKWXZWPBUQ4NT2MQH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KZ6AA63TGVKWXZWPBUQ4NT2MQH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:KZ6AA63TGVKWXZWPBUQ4NT2MQH","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":"17cb43820dd78cfec75855437a1df3098925211e032734dffc449ade8443e4b6","cross_cats_sorted":["cs.LG","stat.ME"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-02-11T02:21:49Z","title_canon_sha256":"3d0490d2bc91e3b77575d2a8ce21a5ee592803a6e5d20888c7b9ce7edb66e5b1"},"schema_version":"1.0","source":{"id":"1502.03175","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.03175","created_at":"2026-05-18T01:59:57Z"},{"alias_kind":"arxiv_version","alias_value":"1502.03175v3","created_at":"2026-05-18T01:59:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.03175","created_at":"2026-05-18T01:59:57Z"},{"alias_kind":"pith_short_12","alias_value":"KZ6AA63TGVKW","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"KZ6AA63TGVKWXZWP","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"KZ6AA63T","created_at":"2026-05-18T12:29:29Z"}],"graph_snapshots":[{"event_id":"sha256:7dcf0ba98bad06891d0fa55c6c1b9c1d00267b5e72165bce720f9aa8a4963873","target":"graph","created_at":"2026-05-18T01:59:57Z","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":"In this paper we develop proximal methods for statistical learning. Proximal point algorithms are useful in statistics and machine learning for obtaining optimization solutions for composite functions. Our approach exploits closed-form solutions of proximal operators and envelope representations based on the Moreau, Forward-Backward, Douglas-Rachford and Half-Quadratic envelopes. Envelope representations lead to novel proximal algorithms for statistical optimisation of composite objective functions which include both non-smooth and non-convex objectives. We illustrate our methodology with regu","authors_text":"Brandon T. Willard, James G. Scott, Nicholas G. Polson","cross_cats":["cs.LG","stat.ME"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-02-11T02:21:49Z","title":"Proximal Algorithms in Statistics and Machine Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.03175","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:89213c312af44575c07328e37372a4dec10fac0fdf6e0656374f3874bb4c74fa","target":"record","created_at":"2026-05-18T01:59:57Z","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":"17cb43820dd78cfec75855437a1df3098925211e032734dffc449ade8443e4b6","cross_cats_sorted":["cs.LG","stat.ME"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-02-11T02:21:49Z","title_canon_sha256":"3d0490d2bc91e3b77575d2a8ce21a5ee592803a6e5d20888c7b9ce7edb66e5b1"},"schema_version":"1.0","source":{"id":"1502.03175","kind":"arxiv","version":3}},"canonical_sha256":"567c007b7335556be6cf0d21c6cf4c81ed29095fd71ae0ce8e6decffdc5ba13d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"567c007b7335556be6cf0d21c6cf4c81ed29095fd71ae0ce8e6decffdc5ba13d","first_computed_at":"2026-05-18T01:59:57.768715Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:59:57.768715Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ni3iL75em/TuI4OiI5XS22yhAH/h0gYBsz8K5GuLxtE0cYQOazGmlWSa8m3MeKB3MAgcpw+40uaA8p6p2474Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:59:57.769348Z","signed_message":"canonical_sha256_bytes"},"source_id":"1502.03175","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:89213c312af44575c07328e37372a4dec10fac0fdf6e0656374f3874bb4c74fa","sha256:7dcf0ba98bad06891d0fa55c6c1b9c1d00267b5e72165bce720f9aa8a4963873"],"state_sha256":"2eece20f31e9467338fd7fd2c4d0edd0cdfe0707fdd969dcc084508454e0f861"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qBJTnNyYB1ALY5KKRnUsN68FuE4L+JHutJ9iXg7JjWXUMm3wxxsbSwm5v1zFJHgcOxRf2LnYqu2cxwRKnysgDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T10:31:53.701346Z","bundle_sha256":"5fc2af17cde9f20ce19cf7a20262ddeba138005f1537b90fd396f9b31a03eab2"}}