{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:G54ILHII7SOV4TJ7Z5DZJUS6F7","short_pith_number":"pith:G54ILHII","schema_version":"1.0","canonical_sha256":"3778859d08fc9d5e4d3fcf4794d25e2fdd7c7a2bf084df1581fd6b08e43b4d2d","source":{"kind":"arxiv","id":"1607.05428","version":3},"attestation_state":"computed","paper":{"title":"A highly efficient semismooth Newton augmented Lagrangian method for solving 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":"2016-07-19T07:15:09Z","abstract_excerpt":"We develop a fast and robust algorithm for solving large scale convex composite optimization models with an emphasis on the $\\ell_1$-regularized least squares regression (Lasso) problems. Despite the fact that there exist a large number of solvers in the literature for the Lasso problems, we found that no solver can efficiently handle difficult large scale regression problems with real data. By leveraging on available error bound results to realize the asymptotic superlinear convergence property of the augmented Lagrangian algorithm, and by exploiting the second order sparsity of the problem t"},"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":"1607.05428","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-07-19T07:15:09Z","cross_cats_sorted":[],"title_canon_sha256":"0637557060d79ee70deda9dde32dcecd241621a559afbc0e8af1ea8828c087d5","abstract_canon_sha256":"718774be5b54f3ca7e492d37ef97ca1ff510b4ed19dae25d94ec94e3959d1fae"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:45:06.482897Z","signature_b64":"qu3pP9MZXNGEg7m/cp9WGe+ul7DJxRVTAWIx+ozDprOOkDZfsFJyEeIrFktXwueh8C1sV6mtD0N1oYDN53eoDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3778859d08fc9d5e4d3fcf4794d25e2fdd7c7a2bf084df1581fd6b08e43b4d2d","last_reissued_at":"2026-05-18T00:45:06.482544Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:45:06.482544Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A highly efficient semismooth Newton augmented Lagrangian method for solving 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":"2016-07-19T07:15:09Z","abstract_excerpt":"We develop a fast and robust algorithm for solving large scale convex composite optimization models with an emphasis on the $\\ell_1$-regularized least squares regression (Lasso) problems. Despite the fact that there exist a large number of solvers in the literature for the Lasso problems, we found that no solver can efficiently handle difficult large scale regression problems with real data. By leveraging on available error bound results to realize the asymptotic superlinear convergence property of the augmented Lagrangian algorithm, and by exploiting the second order sparsity of the problem t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.05428","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1607.05428","created_at":"2026-05-18T00:45:06.482599+00:00"},{"alias_kind":"arxiv_version","alias_value":"1607.05428v3","created_at":"2026-05-18T00:45:06.482599+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.05428","created_at":"2026-05-18T00:45:06.482599+00:00"},{"alias_kind":"pith_short_12","alias_value":"G54ILHII7SOV","created_at":"2026-05-18T12:30:15.759754+00:00"},{"alias_kind":"pith_short_16","alias_value":"G54ILHII7SOV4TJ7","created_at":"2026-05-18T12:30:15.759754+00:00"},{"alias_kind":"pith_short_8","alias_value":"G54ILHII","created_at":"2026-05-18T12:30:15.759754+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/G54ILHII7SOV4TJ7Z5DZJUS6F7","json":"https://pith.science/pith/G54ILHII7SOV4TJ7Z5DZJUS6F7.json","graph_json":"https://pith.science/api/pith-number/G54ILHII7SOV4TJ7Z5DZJUS6F7/graph.json","events_json":"https://pith.science/api/pith-number/G54ILHII7SOV4TJ7Z5DZJUS6F7/events.json","paper":"https://pith.science/paper/G54ILHII"},"agent_actions":{"view_html":"https://pith.science/pith/G54ILHII7SOV4TJ7Z5DZJUS6F7","download_json":"https://pith.science/pith/G54ILHII7SOV4TJ7Z5DZJUS6F7.json","view_paper":"https://pith.science/paper/G54ILHII","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1607.05428&json=true","fetch_graph":"https://pith.science/api/pith-number/G54ILHII7SOV4TJ7Z5DZJUS6F7/graph.json","fetch_events":"https://pith.science/api/pith-number/G54ILHII7SOV4TJ7Z5DZJUS6F7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/G54ILHII7SOV4TJ7Z5DZJUS6F7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/G54ILHII7SOV4TJ7Z5DZJUS6F7/action/storage_attestation","attest_author":"https://pith.science/pith/G54ILHII7SOV4TJ7Z5DZJUS6F7/action/author_attestation","sign_citation":"https://pith.science/pith/G54ILHII7SOV4TJ7Z5DZJUS6F7/action/citation_signature","submit_replication":"https://pith.science/pith/G54ILHII7SOV4TJ7Z5DZJUS6F7/action/replication_record"}},"created_at":"2026-05-18T00:45:06.482599+00:00","updated_at":"2026-05-18T00:45:06.482599+00:00"}