{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:GITKW4WEGGY476I6N6XVQLXVJI","short_pith_number":"pith:GITKW4WE","canonical_record":{"source":{"id":"1607.03815","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-07-13T16:20:52Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"32ca7e1bfbf38fd300ac85957f16127d51fa455e2ae376faa6c02219a5aac957","abstract_canon_sha256":"3687f61e0aec6f4ab132a81e1358b05fda5fe75eedac0b8c0ead5b0aa9bbd024"},"schema_version":"1.0"},"canonical_sha256":"3226ab72c431b1cff91e6faf582ef54a1de15fd6fada1b47fcbdb08fad10568c","source":{"kind":"arxiv","id":"1607.03815","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.03815","created_at":"2026-05-18T01:00:19Z"},{"alias_kind":"arxiv_version","alias_value":"1607.03815v2","created_at":"2026-05-18T01:00:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.03815","created_at":"2026-05-18T01:00:19Z"},{"alias_kind":"pith_short_12","alias_value":"GITKW4WEGGY4","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"GITKW4WEGGY476I6","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"GITKW4WE","created_at":"2026-05-18T12:30:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:GITKW4WEGGY476I6N6XVQLXVJI","target":"record","payload":{"canonical_record":{"source":{"id":"1607.03815","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-07-13T16:20:52Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"32ca7e1bfbf38fd300ac85957f16127d51fa455e2ae376faa6c02219a5aac957","abstract_canon_sha256":"3687f61e0aec6f4ab132a81e1358b05fda5fe75eedac0b8c0ead5b0aa9bbd024"},"schema_version":"1.0"},"canonical_sha256":"3226ab72c431b1cff91e6faf582ef54a1de15fd6fada1b47fcbdb08fad10568c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:00:19.173170Z","signature_b64":"fO54+QWe4j1ELAudGJptp1huJ3L/WOXP9R4FS1iFuxemjFdPZTzhmVbBesk6J2u4EZrNkul9/LbNj5uw5ForBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3226ab72c431b1cff91e6faf582ef54a1de15fd6fada1b47fcbdb08fad10568c","last_reissued_at":"2026-05-18T01:00:19.172507Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:00:19.172507Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1607.03815","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-18T01:00:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"N5oqTs6rQSXOluKU1LXPcZojCDFcpUi0WUWZzOALZeIgj4StRd6ZLd/ylPVd7x7OI/DsKlTYoiYWzSzHswIDDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T07:01:58.165390Z"},"content_sha256":"f4ce4f26bdf9d9d9b96f0ad1cb5feb8707971e961b840ca9396113f3e6dd47d1","schema_version":"1.0","event_id":"sha256:f4ce4f26bdf9d9d9b96f0ad1cb5feb8707971e961b840ca9396113f3e6dd47d1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:GITKW4WEGGY476I6N6XVQLXVJI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Homotopy Smoothing for Non-Smooth Problems with Lower Complexity than $O(1/\\epsilon)$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"math.OC","authors_text":"Qihang Lin, Tianbao Yang, Yan Yan, Yi Xu","submitted_at":"2016-07-13T16:20:52Z","abstract_excerpt":"In this paper, we develop a novel {\\bf ho}moto{\\bf p}y {\\bf s}moothing (HOPS) algorithm for solving a family of non-smooth problems that is composed of a non-smooth term with an explicit max-structure and a smooth term or a simple non-smooth term whose proximal mapping is easy to compute. The best known iteration complexity for solving such non-smooth optimization problems is $O(1/\\epsilon)$ without any assumption on the strong convexity. In this work, we will show that the proposed HOPS achieved a lower iteration complexity of $\\widetilde O(1/\\epsilon^{1-\\theta})$\\footnote{$\\widetilde O()$ su"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.03815","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-18T01:00:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"V3zssqGYdr12EwrwIBmoiuDar8Znk4lc3s7ZF/QglEcuiA+giHT2JpGLUKKQTZpBIM3tH7LhkK+R+kuhSQEiCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T07:01:58.165822Z"},"content_sha256":"dcfa922739ac30bcc072110261e6b4340f4b9cbc39857556b5b893d142b26cc9","schema_version":"1.0","event_id":"sha256:dcfa922739ac30bcc072110261e6b4340f4b9cbc39857556b5b893d142b26cc9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GITKW4WEGGY476I6N6XVQLXVJI/bundle.json","state_url":"https://pith.science/pith/GITKW4WEGGY476I6N6XVQLXVJI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GITKW4WEGGY476I6N6XVQLXVJI/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-07T07:01:58Z","links":{"resolver":"https://pith.science/pith/GITKW4WEGGY476I6N6XVQLXVJI","bundle":"https://pith.science/pith/GITKW4WEGGY476I6N6XVQLXVJI/bundle.json","state":"https://pith.science/pith/GITKW4WEGGY476I6N6XVQLXVJI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GITKW4WEGGY476I6N6XVQLXVJI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:GITKW4WEGGY476I6N6XVQLXVJI","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":"3687f61e0aec6f4ab132a81e1358b05fda5fe75eedac0b8c0ead5b0aa9bbd024","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-07-13T16:20:52Z","title_canon_sha256":"32ca7e1bfbf38fd300ac85957f16127d51fa455e2ae376faa6c02219a5aac957"},"schema_version":"1.0","source":{"id":"1607.03815","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.03815","created_at":"2026-05-18T01:00:19Z"},{"alias_kind":"arxiv_version","alias_value":"1607.03815v2","created_at":"2026-05-18T01:00:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.03815","created_at":"2026-05-18T01:00:19Z"},{"alias_kind":"pith_short_12","alias_value":"GITKW4WEGGY4","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"GITKW4WEGGY476I6","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"GITKW4WE","created_at":"2026-05-18T12:30:19Z"}],"graph_snapshots":[{"event_id":"sha256:dcfa922739ac30bcc072110261e6b4340f4b9cbc39857556b5b893d142b26cc9","target":"graph","created_at":"2026-05-18T01:00:19Z","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 this paper, we develop a novel {\\bf ho}moto{\\bf p}y {\\bf s}moothing (HOPS) algorithm for solving a family of non-smooth problems that is composed of a non-smooth term with an explicit max-structure and a smooth term or a simple non-smooth term whose proximal mapping is easy to compute. The best known iteration complexity for solving such non-smooth optimization problems is $O(1/\\epsilon)$ without any assumption on the strong convexity. In this work, we will show that the proposed HOPS achieved a lower iteration complexity of $\\widetilde O(1/\\epsilon^{1-\\theta})$\\footnote{$\\widetilde O()$ su","authors_text":"Qihang Lin, Tianbao Yang, Yan Yan, Yi Xu","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-07-13T16:20:52Z","title":"Homotopy Smoothing for Non-Smooth Problems with Lower Complexity than $O(1/\\epsilon)$"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.03815","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:f4ce4f26bdf9d9d9b96f0ad1cb5feb8707971e961b840ca9396113f3e6dd47d1","target":"record","created_at":"2026-05-18T01:00:19Z","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":"3687f61e0aec6f4ab132a81e1358b05fda5fe75eedac0b8c0ead5b0aa9bbd024","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-07-13T16:20:52Z","title_canon_sha256":"32ca7e1bfbf38fd300ac85957f16127d51fa455e2ae376faa6c02219a5aac957"},"schema_version":"1.0","source":{"id":"1607.03815","kind":"arxiv","version":2}},"canonical_sha256":"3226ab72c431b1cff91e6faf582ef54a1de15fd6fada1b47fcbdb08fad10568c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3226ab72c431b1cff91e6faf582ef54a1de15fd6fada1b47fcbdb08fad10568c","first_computed_at":"2026-05-18T01:00:19.172507Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:00:19.172507Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fO54+QWe4j1ELAudGJptp1huJ3L/WOXP9R4FS1iFuxemjFdPZTzhmVbBesk6J2u4EZrNkul9/LbNj5uw5ForBg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:00:19.173170Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.03815","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f4ce4f26bdf9d9d9b96f0ad1cb5feb8707971e961b840ca9396113f3e6dd47d1","sha256:dcfa922739ac30bcc072110261e6b4340f4b9cbc39857556b5b893d142b26cc9"],"state_sha256":"e18298ae527a9a0fb5f4a64f93a8ebb5c6d594b3f3f2f8131c4055d17b95098c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"khISf9ZeHjBFCZTcLrTFEykN/P8PNeYfVMCCI01/hsseQqHzU2wawZqp4Qm979Hgdr1EPYwmK0xPdXnJhMZvDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T07:01:58.167943Z","bundle_sha256":"d9523253ff2e9a9422ce4079605fc9b588a3621ed0e85af46ff4bcf51ad75494"}}