{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:JI5I4S4FJDWRTIXVFY3VZLM4ZW","short_pith_number":"pith:JI5I4S4F","schema_version":"1.0","canonical_sha256":"4a3a8e4b8548ed19a2f52e375cad9ccdbe7f8be46269c313fe34a9976c1876e6","source":{"kind":"arxiv","id":"1706.08732","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1706.08732","created_at":"2026-05-18T00:41:31.179635+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.08732v1","created_at":"2026-05-18T00:41:31.179635+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.08732","created_at":"2026-05-18T00:41:31.179635+00:00"},{"alias_kind":"pith_short_12","alias_value":"JI5I4S4FJDWR","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_16","alias_value":"JI5I4S4FJDWRTIXV","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_8","alias_value":"JI5I4S4F","created_at":"2026-05-18T12:31:24.725408+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JI5I4S4FJDWRTIXVFY3VZLM4ZW","json":"https://pith.science/pith/JI5I4S4FJDWRTIXVFY3VZLM4ZW.json","graph_json":"https://pith.science/api/pith-number/JI5I4S4FJDWRTIXVFY3VZLM4ZW/graph.json","events_json":"https://pith.science/api/pith-number/JI5I4S4FJDWRTIXVFY3VZLM4ZW/events.json","paper":"https://pith.science/paper/JI5I4S4F"},"agent_actions":{"view_html":"https://pith.science/pith/JI5I4S4FJDWRTIXVFY3VZLM4ZW","download_json":"https://pith.science/pith/JI5I4S4FJDWRTIXVFY3VZLM4ZW.json","view_paper":"https://pith.science/paper/JI5I4S4F","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.08732&json=true","fetch_graph":"https://pith.science/api/pith-number/JI5I4S4FJDWRTIXVFY3VZLM4ZW/graph.json","fetch_events":"https://pith.science/api/pith-number/JI5I4S4FJDWRTIXVFY3VZLM4ZW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JI5I4S4FJDWRTIXVFY3VZLM4ZW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JI5I4S4FJDWRTIXVFY3VZLM4ZW/action/storage_attestation","attest_author":"https://pith.science/pith/JI5I4S4FJDWRTIXVFY3VZLM4ZW/action/author_attestation","sign_citation":"https://pith.science/pith/JI5I4S4FJDWRTIXVFY3VZLM4ZW/action/citation_signature","submit_replication":"https://pith.science/pith/JI5I4S4FJDWRTIXVFY3VZLM4ZW/action/replication_record"}},"created_at":"2026-05-18T00:41:31.179635+00:00","updated_at":"2026-05-18T00:41:31.179635+00:00"}