{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:JI5I4S4FJDWRTIXVFY3VZLM4ZW","short_pith_number":"pith:JI5I4S4F","canonical_record":{"source":{"id":"1706.08732","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-06-27T08:58:57Z","cross_cats_sorted":[],"title_canon_sha256":"832c6b377e74abf2a6080361cc967e2a623400f5b104993790e58b7c583edc9e","abstract_canon_sha256":"80b19f399f43c58e67664f109f338c0955c3ca790fa7bd0d5b63fbc806564524"},"schema_version":"1.0"},"canonical_sha256":"4a3a8e4b8548ed19a2f52e375cad9ccdbe7f8be46269c313fe34a9976c1876e6","source":{"kind":"arxiv","id":"1706.08732","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.08732","created_at":"2026-05-18T00:41:31Z"},{"alias_kind":"arxiv_version","alias_value":"1706.08732v1","created_at":"2026-05-18T00:41:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.08732","created_at":"2026-05-18T00:41:31Z"},{"alias_kind":"pith_short_12","alias_value":"JI5I4S4FJDWR","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"JI5I4S4FJDWRTIXV","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"JI5I4S4F","created_at":"2026-05-18T12:31:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:JI5I4S4FJDWRTIXVFY3VZLM4ZW","target":"record","payload":{"canonical_record":{"source":{"id":"1706.08732","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-06-27T08:58:57Z","cross_cats_sorted":[],"title_canon_sha256":"832c6b377e74abf2a6080361cc967e2a623400f5b104993790e58b7c583edc9e","abstract_canon_sha256":"80b19f399f43c58e67664f109f338c0955c3ca790fa7bd0d5b63fbc806564524"},"schema_version":"1.0"},"canonical_sha256":"4a3a8e4b8548ed19a2f52e375cad9ccdbe7f8be46269c313fe34a9976c1876e6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:41:31.180091Z","signature_b64":"HSsjGX+UH6uLNOTBBJOFn6v9I0SbGAxFeB5RA9Ee9zMiYRTblVUDwG1Y5MdwGdiQYBD522hZT1JsSPqhQQHpCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4a3a8e4b8548ed19a2f52e375cad9ccdbe7f8be46269c313fe34a9976c1876e6","last_reissued_at":"2026-05-18T00:41:31.179548Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:41:31.179548Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1706.08732","source_version":1,"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:41:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P8AE3NBU/037WM9/1B0dOWh+wO7M1jxewlifuBx9Y/EV0X75er3XvTKUuVlNvLOF8VxPum92KiTl9XA06xmwDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T22:48:16.175597Z"},"content_sha256":"48b702bf7dce6c8222d8200e3e5bcd770e8663ceb725323da1d9c2236404d2ee","schema_version":"1.0","event_id":"sha256:48b702bf7dce6c8222d8200e3e5bcd770e8663ceb725323da1d9c2236404d2ee"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:JI5I4S4FJDWRTIXVFY3VZLM4ZW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On efficiently solving the subproblems of a level-set method for fused lasso problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Defeng Sun, Kim-Chuan Toh, Xudong Li","submitted_at":"2017-06-27T08:58:57Z","abstract_excerpt":"In applying the level-set method developed in [Van den Berg and Friedlander, SIAM J. on Scientific Computing, 31 (2008), pp.~890--912 and SIAM J. on Optimization, 21 (2011), pp.~1201--1229] to solve the fused lasso problems, one needs to solve a sequence of regularized least squares subproblems. In order to make the level-set method practical, we develop a highly efficient inexact semismooth Newton based augmented Lagrangian method for solving these subproblems. The efficiency of our approach is based on several ingredients that constitute the main contributions of this paper. Firstly, an expl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.08732","kind":"arxiv","version":1},"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:41:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TOz9px2BHe4AIFY3ISm5O58AtPnvZjqCOFj5R1iUUows1pPJONdhz8EDaSJl4Rv17QHT2owjsu20jur1ex0sDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T22:48:16.176044Z"},"content_sha256":"bcca035fea8c275c410a20746844c956a15eab63f549a2380487be7580e1b820","schema_version":"1.0","event_id":"sha256:bcca035fea8c275c410a20746844c956a15eab63f549a2380487be7580e1b820"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JI5I4S4FJDWRTIXVFY3VZLM4ZW/bundle.json","state_url":"https://pith.science/pith/JI5I4S4FJDWRTIXVFY3VZLM4ZW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JI5I4S4FJDWRTIXVFY3VZLM4ZW/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-05-25T22:48:16Z","links":{"resolver":"https://pith.science/pith/JI5I4S4FJDWRTIXVFY3VZLM4ZW","bundle":"https://pith.science/pith/JI5I4S4FJDWRTIXVFY3VZLM4ZW/bundle.json","state":"https://pith.science/pith/JI5I4S4FJDWRTIXVFY3VZLM4ZW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JI5I4S4FJDWRTIXVFY3VZLM4ZW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:JI5I4S4FJDWRTIXVFY3VZLM4ZW","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":"80b19f399f43c58e67664f109f338c0955c3ca790fa7bd0d5b63fbc806564524","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-06-27T08:58:57Z","title_canon_sha256":"832c6b377e74abf2a6080361cc967e2a623400f5b104993790e58b7c583edc9e"},"schema_version":"1.0","source":{"id":"1706.08732","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.08732","created_at":"2026-05-18T00:41:31Z"},{"alias_kind":"arxiv_version","alias_value":"1706.08732v1","created_at":"2026-05-18T00:41:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.08732","created_at":"2026-05-18T00:41:31Z"},{"alias_kind":"pith_short_12","alias_value":"JI5I4S4FJDWR","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"JI5I4S4FJDWRTIXV","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"JI5I4S4F","created_at":"2026-05-18T12:31:24Z"}],"graph_snapshots":[{"event_id":"sha256:bcca035fea8c275c410a20746844c956a15eab63f549a2380487be7580e1b820","target":"graph","created_at":"2026-05-18T00:41:31Z","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 applying the level-set method developed in [Van den Berg and Friedlander, SIAM J. on Scientific Computing, 31 (2008), pp.~890--912 and SIAM J. on Optimization, 21 (2011), pp.~1201--1229] to solve the fused lasso problems, one needs to solve a sequence of regularized least squares subproblems. In order to make the level-set method practical, we develop a highly efficient inexact semismooth Newton based augmented Lagrangian method for solving these subproblems. The efficiency of our approach is based on several ingredients that constitute the main contributions of this paper. Firstly, an expl","authors_text":"Defeng Sun, Kim-Chuan Toh, Xudong Li","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-06-27T08:58:57Z","title":"On efficiently solving the subproblems of a level-set method for fused lasso problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.08732","kind":"arxiv","version":1},"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:48b702bf7dce6c8222d8200e3e5bcd770e8663ceb725323da1d9c2236404d2ee","target":"record","created_at":"2026-05-18T00:41:31Z","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":"80b19f399f43c58e67664f109f338c0955c3ca790fa7bd0d5b63fbc806564524","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-06-27T08:58:57Z","title_canon_sha256":"832c6b377e74abf2a6080361cc967e2a623400f5b104993790e58b7c583edc9e"},"schema_version":"1.0","source":{"id":"1706.08732","kind":"arxiv","version":1}},"canonical_sha256":"4a3a8e4b8548ed19a2f52e375cad9ccdbe7f8be46269c313fe34a9976c1876e6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4a3a8e4b8548ed19a2f52e375cad9ccdbe7f8be46269c313fe34a9976c1876e6","first_computed_at":"2026-05-18T00:41:31.179548Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:41:31.179548Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HSsjGX+UH6uLNOTBBJOFn6v9I0SbGAxFeB5RA9Ee9zMiYRTblVUDwG1Y5MdwGdiQYBD522hZT1JsSPqhQQHpCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:41:31.180091Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.08732","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:48b702bf7dce6c8222d8200e3e5bcd770e8663ceb725323da1d9c2236404d2ee","sha256:bcca035fea8c275c410a20746844c956a15eab63f549a2380487be7580e1b820"],"state_sha256":"ea48cbfd45cc08e692cd21b1d2a6d12a856c65c1d880459d83df23a211cb75bd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1wZIq6fjn9VRNdAC79Z4ZtB6sX3hVmlkoySnz/pl8NSAMY71MMWUpvJLs7FPkpMNgnfuHMvFHYfMXSQCe3R2DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T22:48:16.179114Z","bundle_sha256":"061e8ed253ed07dd18e92a96cce59f01df0aece13c6db948c4f295666e40fe18"}}