{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:YVAIY5IXRUOW7RCQ2TLRCNUKXX","short_pith_number":"pith:YVAIY5IX","canonical_record":{"source":{"id":"1612.09357","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2016-12-30T00:38:30Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"c8acae151793a45d5627bbda01a19a7183f9b3b275b5ccaf0043e79e247b2aec","abstract_canon_sha256":"155de076e016c82a9a31d5683e4a01d013b291fa7bc9d5523a2eab836fa627de"},"schema_version":"1.0"},"canonical_sha256":"c5408c75178d1d6fc450d4d711368abdc10264c13d949a53f86d0650fa89c088","source":{"kind":"arxiv","id":"1612.09357","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.09357","created_at":"2026-05-18T00:30:22Z"},{"alias_kind":"arxiv_version","alias_value":"1612.09357v2","created_at":"2026-05-18T00:30:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.09357","created_at":"2026-05-18T00:30:22Z"},{"alias_kind":"pith_short_12","alias_value":"YVAIY5IXRUOW","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"YVAIY5IXRUOW7RCQ","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"YVAIY5IX","created_at":"2026-05-18T12:30:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:YVAIY5IXRUOW7RCQ2TLRCNUKXX","target":"record","payload":{"canonical_record":{"source":{"id":"1612.09357","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2016-12-30T00:38:30Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"c8acae151793a45d5627bbda01a19a7183f9b3b275b5ccaf0043e79e247b2aec","abstract_canon_sha256":"155de076e016c82a9a31d5683e4a01d013b291fa7bc9d5523a2eab836fa627de"},"schema_version":"1.0"},"canonical_sha256":"c5408c75178d1d6fc450d4d711368abdc10264c13d949a53f86d0650fa89c088","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:30:22.408674Z","signature_b64":"R2UcpW7SO4ENlVKKZ1b6rN4yJvsw/M+XVupuhJ6R1GLlGH5xfkH0jQy4037sZVPiEfO5Gk6XdfblAiniQpX+BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c5408c75178d1d6fc450d4d711368abdc10264c13d949a53f86d0650fa89c088","last_reissued_at":"2026-05-18T00:30:22.407799Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:30:22.407799Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1612.09357","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-18T00:30:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rck7QJ4oD3NhLuspTlknYNHTeaCWpbQAgaLBHCgyCN5N8tI9jV1FsrcwXw+Qo+XVe6oW1E6t2hALkvKp32vmBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T19:10:30.192390Z"},"content_sha256":"dfcd47d06e33094158789f58da90dac56d9fc71a5f744b25462919c42e87b512","schema_version":"1.0","event_id":"sha256:dfcd47d06e33094158789f58da90dac56d9fc71a5f744b25462919c42e87b512"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:YVAIY5IXRUOW7RCQ2TLRCNUKXX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sparse Learning with Semi-Proximal-Based Strictly Contractive Peaceman-Rachford Splitting Method","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"stat.CO","authors_text":"Cho-Jui Hsieh, Sen Na","submitted_at":"2016-12-30T00:38:30Z","abstract_excerpt":"Minimizing sum of two functions under a linear constraint is what we called splitting problem. This convex optimization has wide applications in machine learning problems, such as Lasso, Group Lasso and Sparse logistic regression. A recent paper by Gu et al (2015) developed a Semi-Proximal-Based Strictly Contractive Peaceman-Rachford Splitting Method (SPB-SPRSM), which is an extension of Strictly Contractive Peaceman-Rachford Splitting Method (SPRSM) proposed by He et al (2014). By introducing semi-proximal terms and using two different relaxation factors, SPB-SPRSM showed a more flexiable app"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.09357","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-18T00:30:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CXlWjuklY1UYedNEdgDh6Yr5zNUtdvC52VBoooDTBsGnw/HO+QWFWPCV8Z5H6MPoqvHSE+ctQtEdyAlQ82//Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T19:10:30.193082Z"},"content_sha256":"2ee1d0b1dba1661404443a2459adbaf57f8f626cf548647cd410aaaef1279db7","schema_version":"1.0","event_id":"sha256:2ee1d0b1dba1661404443a2459adbaf57f8f626cf548647cd410aaaef1279db7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YVAIY5IXRUOW7RCQ2TLRCNUKXX/bundle.json","state_url":"https://pith.science/pith/YVAIY5IXRUOW7RCQ2TLRCNUKXX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YVAIY5IXRUOW7RCQ2TLRCNUKXX/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-08T19:10:30Z","links":{"resolver":"https://pith.science/pith/YVAIY5IXRUOW7RCQ2TLRCNUKXX","bundle":"https://pith.science/pith/YVAIY5IXRUOW7RCQ2TLRCNUKXX/bundle.json","state":"https://pith.science/pith/YVAIY5IXRUOW7RCQ2TLRCNUKXX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YVAIY5IXRUOW7RCQ2TLRCNUKXX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:YVAIY5IXRUOW7RCQ2TLRCNUKXX","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":"155de076e016c82a9a31d5683e4a01d013b291fa7bc9d5523a2eab836fa627de","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2016-12-30T00:38:30Z","title_canon_sha256":"c8acae151793a45d5627bbda01a19a7183f9b3b275b5ccaf0043e79e247b2aec"},"schema_version":"1.0","source":{"id":"1612.09357","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.09357","created_at":"2026-05-18T00:30:22Z"},{"alias_kind":"arxiv_version","alias_value":"1612.09357v2","created_at":"2026-05-18T00:30:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.09357","created_at":"2026-05-18T00:30:22Z"},{"alias_kind":"pith_short_12","alias_value":"YVAIY5IXRUOW","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"YVAIY5IXRUOW7RCQ","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"YVAIY5IX","created_at":"2026-05-18T12:30:53Z"}],"graph_snapshots":[{"event_id":"sha256:2ee1d0b1dba1661404443a2459adbaf57f8f626cf548647cd410aaaef1279db7","target":"graph","created_at":"2026-05-18T00:30:22Z","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":"Minimizing sum of two functions under a linear constraint is what we called splitting problem. This convex optimization has wide applications in machine learning problems, such as Lasso, Group Lasso and Sparse logistic regression. A recent paper by Gu et al (2015) developed a Semi-Proximal-Based Strictly Contractive Peaceman-Rachford Splitting Method (SPB-SPRSM), which is an extension of Strictly Contractive Peaceman-Rachford Splitting Method (SPRSM) proposed by He et al (2014). By introducing semi-proximal terms and using two different relaxation factors, SPB-SPRSM showed a more flexiable app","authors_text":"Cho-Jui Hsieh, Sen Na","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2016-12-30T00:38:30Z","title":"Sparse Learning with Semi-Proximal-Based Strictly Contractive Peaceman-Rachford Splitting Method"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.09357","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:dfcd47d06e33094158789f58da90dac56d9fc71a5f744b25462919c42e87b512","target":"record","created_at":"2026-05-18T00:30:22Z","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":"155de076e016c82a9a31d5683e4a01d013b291fa7bc9d5523a2eab836fa627de","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2016-12-30T00:38:30Z","title_canon_sha256":"c8acae151793a45d5627bbda01a19a7183f9b3b275b5ccaf0043e79e247b2aec"},"schema_version":"1.0","source":{"id":"1612.09357","kind":"arxiv","version":2}},"canonical_sha256":"c5408c75178d1d6fc450d4d711368abdc10264c13d949a53f86d0650fa89c088","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c5408c75178d1d6fc450d4d711368abdc10264c13d949a53f86d0650fa89c088","first_computed_at":"2026-05-18T00:30:22.407799Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:30:22.407799Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"R2UcpW7SO4ENlVKKZ1b6rN4yJvsw/M+XVupuhJ6R1GLlGH5xfkH0jQy4037sZVPiEfO5Gk6XdfblAiniQpX+BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:30:22.408674Z","signed_message":"canonical_sha256_bytes"},"source_id":"1612.09357","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dfcd47d06e33094158789f58da90dac56d9fc71a5f744b25462919c42e87b512","sha256:2ee1d0b1dba1661404443a2459adbaf57f8f626cf548647cd410aaaef1279db7"],"state_sha256":"5095b2a1b3e2f798b764244d9e65be8cb000aee7d29cb14bc2d3ce9386711492"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HIPWZKKqs87GOg9dAk+prLaieLf9vt0Nyi989tz1dHXotD7zjNNtm45+REfPP+hvHDd54pDkrezZT+Cjet8IAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T19:10:30.196806Z","bundle_sha256":"b1194119f8dbe663c95839047471eb3d885162bd9efef0eba437b9a127572b79"}}