{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:TOAZEW3U7YPPXTIXF3W47G2LFI","short_pith_number":"pith:TOAZEW3U","canonical_record":{"source":{"id":"1605.07950","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-05-25T16:08:08Z","cross_cats_sorted":["math.OC","stat.ML"],"title_canon_sha256":"cd49b7a6005015b11db2a6cf81919900a91132e818b33b2f0c95cfda301c2dc4","abstract_canon_sha256":"24c423946388b05d9c38165d2fb002be3d989b3a86836c78c07f25e63c0a0d0e"},"schema_version":"1.0"},"canonical_sha256":"9b81925b74fe1efbcd172eedcf9b4b2a15bba57b0526ccaa6afc657d0076989e","source":{"kind":"arxiv","id":"1605.07950","version":6},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.07950","created_at":"2026-05-17T23:48:41Z"},{"alias_kind":"arxiv_version","alias_value":"1605.07950v6","created_at":"2026-05-17T23:48:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.07950","created_at":"2026-05-17T23:48:41Z"},{"alias_kind":"pith_short_12","alias_value":"TOAZEW3U7YPP","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"TOAZEW3U7YPPXTIX","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"TOAZEW3U","created_at":"2026-05-18T12:30:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:TOAZEW3U7YPPXTIXF3W47G2LFI","target":"record","payload":{"canonical_record":{"source":{"id":"1605.07950","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-05-25T16:08:08Z","cross_cats_sorted":["math.OC","stat.ML"],"title_canon_sha256":"cd49b7a6005015b11db2a6cf81919900a91132e818b33b2f0c95cfda301c2dc4","abstract_canon_sha256":"24c423946388b05d9c38165d2fb002be3d989b3a86836c78c07f25e63c0a0d0e"},"schema_version":"1.0"},"canonical_sha256":"9b81925b74fe1efbcd172eedcf9b4b2a15bba57b0526ccaa6afc657d0076989e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:41.099863Z","signature_b64":"jveRxQ0AlCYMtCwXXZ4nty8FwGLPwSCjVI+JFnKDtu/TJf9UROt651I/2ZVdHGx/0g2cKqMZjzOgkf1D9NK5Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9b81925b74fe1efbcd172eedcf9b4b2a15bba57b0526ccaa6afc657d0076989e","last_reissued_at":"2026-05-17T23:48:41.099437Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:41.099437Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1605.07950","source_version":6,"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-17T23:48:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"t/Ic9pI3yIdk5LlQl1ceg7meXUf3KpeXf6UR6PT8Z1gWT2W2iNK2uQqIWqd1EJZAWkyJdYYmPChJWIHndMWbDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T10:21:33.914953Z"},"content_sha256":"2c00b508579a25fd1d312569bf3fef3345f764634c48e456685216cfbab68a82","schema_version":"1.0","event_id":"sha256:2c00b508579a25fd1d312569bf3fef3345f764634c48e456685216cfbab68a82"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:TOAZEW3U7YPPXTIXF3W47G2LFI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Fast Convergence of Proximal Algorithms for SQRT-Lasso Optimization: Don't Worry About Its Nonsmooth Loss Function","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Han Liu, Haoming Jiang, Jarvis Haupt, Mingyi Hong, Raman Arora, Tuo Zhao, Xingguo Li","submitted_at":"2016-05-25T16:08:08Z","abstract_excerpt":"Many machine learning techniques sacrifice convenient computational structures to gain estimation robustness and modeling flexibility. However, by exploring the modeling structures, we find these \"sacrifices\" do not always require more computational efforts. To shed light on such a \"free-lunch\" phenomenon, we study the square-root-Lasso (SQRT-Lasso) type regression problem. Specifically, we show that the nonsmooth loss functions of SQRT-Lasso type regression ease tuning effort and gain adaptivity to inhomogeneous noise, but is not necessarily more challenging than Lasso in computation. We can "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.07950","kind":"arxiv","version":6},"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-17T23:48:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NOXb5nItS0BW1Gc1FbkVB3vmVcAqAXLV5OUExQBWe2X9yQ8ofG3EdKdbUNyG/LETOAAVPCA32jpsI2L2zC7vDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T10:21:33.915577Z"},"content_sha256":"1004446e0a355ba5c94d300d986df94442e54d6ed404e7cd835a40f31b611119","schema_version":"1.0","event_id":"sha256:1004446e0a355ba5c94d300d986df94442e54d6ed404e7cd835a40f31b611119"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TOAZEW3U7YPPXTIXF3W47G2LFI/bundle.json","state_url":"https://pith.science/pith/TOAZEW3U7YPPXTIXF3W47G2LFI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TOAZEW3U7YPPXTIXF3W47G2LFI/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-25T10:21:33Z","links":{"resolver":"https://pith.science/pith/TOAZEW3U7YPPXTIXF3W47G2LFI","bundle":"https://pith.science/pith/TOAZEW3U7YPPXTIXF3W47G2LFI/bundle.json","state":"https://pith.science/pith/TOAZEW3U7YPPXTIXF3W47G2LFI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TOAZEW3U7YPPXTIXF3W47G2LFI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:TOAZEW3U7YPPXTIXF3W47G2LFI","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":"24c423946388b05d9c38165d2fb002be3d989b3a86836c78c07f25e63c0a0d0e","cross_cats_sorted":["math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-05-25T16:08:08Z","title_canon_sha256":"cd49b7a6005015b11db2a6cf81919900a91132e818b33b2f0c95cfda301c2dc4"},"schema_version":"1.0","source":{"id":"1605.07950","kind":"arxiv","version":6}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.07950","created_at":"2026-05-17T23:48:41Z"},{"alias_kind":"arxiv_version","alias_value":"1605.07950v6","created_at":"2026-05-17T23:48:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.07950","created_at":"2026-05-17T23:48:41Z"},{"alias_kind":"pith_short_12","alias_value":"TOAZEW3U7YPP","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"TOAZEW3U7YPPXTIX","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"TOAZEW3U","created_at":"2026-05-18T12:30:46Z"}],"graph_snapshots":[{"event_id":"sha256:1004446e0a355ba5c94d300d986df94442e54d6ed404e7cd835a40f31b611119","target":"graph","created_at":"2026-05-17T23:48:41Z","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":"Many machine learning techniques sacrifice convenient computational structures to gain estimation robustness and modeling flexibility. However, by exploring the modeling structures, we find these \"sacrifices\" do not always require more computational efforts. To shed light on such a \"free-lunch\" phenomenon, we study the square-root-Lasso (SQRT-Lasso) type regression problem. Specifically, we show that the nonsmooth loss functions of SQRT-Lasso type regression ease tuning effort and gain adaptivity to inhomogeneous noise, but is not necessarily more challenging than Lasso in computation. We can ","authors_text":"Han Liu, Haoming Jiang, Jarvis Haupt, Mingyi Hong, Raman Arora, Tuo Zhao, Xingguo Li","cross_cats":["math.OC","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-05-25T16:08:08Z","title":"On Fast Convergence of Proximal Algorithms for SQRT-Lasso Optimization: Don't Worry About Its Nonsmooth Loss Function"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.07950","kind":"arxiv","version":6},"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:2c00b508579a25fd1d312569bf3fef3345f764634c48e456685216cfbab68a82","target":"record","created_at":"2026-05-17T23:48:41Z","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":"24c423946388b05d9c38165d2fb002be3d989b3a86836c78c07f25e63c0a0d0e","cross_cats_sorted":["math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-05-25T16:08:08Z","title_canon_sha256":"cd49b7a6005015b11db2a6cf81919900a91132e818b33b2f0c95cfda301c2dc4"},"schema_version":"1.0","source":{"id":"1605.07950","kind":"arxiv","version":6}},"canonical_sha256":"9b81925b74fe1efbcd172eedcf9b4b2a15bba57b0526ccaa6afc657d0076989e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9b81925b74fe1efbcd172eedcf9b4b2a15bba57b0526ccaa6afc657d0076989e","first_computed_at":"2026-05-17T23:48:41.099437Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:48:41.099437Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jveRxQ0AlCYMtCwXXZ4nty8FwGLPwSCjVI+JFnKDtu/TJf9UROt651I/2ZVdHGx/0g2cKqMZjzOgkf1D9NK5Ag==","signature_status":"signed_v1","signed_at":"2026-05-17T23:48:41.099863Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.07950","source_kind":"arxiv","source_version":6}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2c00b508579a25fd1d312569bf3fef3345f764634c48e456685216cfbab68a82","sha256:1004446e0a355ba5c94d300d986df94442e54d6ed404e7cd835a40f31b611119"],"state_sha256":"c4b948bc3942ea871d68c8fa8adc93325a8a4f3c422879dce69ce84d26adb362"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VN1bJvUltjnMMziJuyxkvoxv8JnGyvl3iYkm8Zvb9/IlwJgrvdkWKKAeF9ZLOhbRyhy6mlMpru6TR7UrDy8tDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T10:21:33.923510Z","bundle_sha256":"023d0dffd462eceb2a2c4737cd44a5c719f0a6f510915f34ccf3315b56311d84"}}