{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:GGRD2R7E7BXGHJBGYZNPHBA4FW","short_pith_number":"pith:GGRD2R7E","canonical_record":{"source":{"id":"1809.01275","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-09-05T00:26:58Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"67b5240ac8c4c4f2a177312ede281431c2e2c4f8756579d715cd7276b4254092","abstract_canon_sha256":"708c925a7a60941f910d8228904948e35053405810a2c9fbad311e56ba487a3c"},"schema_version":"1.0"},"canonical_sha256":"31a23d47e4f86e63a426c65af3841c2da7bd6db33595ba3a38131266d4a7897b","source":{"kind":"arxiv","id":"1809.01275","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.01275","created_at":"2026-05-18T00:02:24Z"},{"alias_kind":"arxiv_version","alias_value":"1809.01275v3","created_at":"2026-05-18T00:02:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.01275","created_at":"2026-05-18T00:02:24Z"},{"alias_kind":"pith_short_12","alias_value":"GGRD2R7E7BXG","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"GGRD2R7E7BXGHJBG","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"GGRD2R7E","created_at":"2026-05-18T12:32:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:GGRD2R7E7BXGHJBGYZNPHBA4FW","target":"record","payload":{"canonical_record":{"source":{"id":"1809.01275","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-09-05T00:26:58Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"67b5240ac8c4c4f2a177312ede281431c2e2c4f8756579d715cd7276b4254092","abstract_canon_sha256":"708c925a7a60941f910d8228904948e35053405810a2c9fbad311e56ba487a3c"},"schema_version":"1.0"},"canonical_sha256":"31a23d47e4f86e63a426c65af3841c2da7bd6db33595ba3a38131266d4a7897b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:24.713678Z","signature_b64":"ta8cYRA+kqjLzVNggqQzR8Wpb4CdxDhxnJlGhiSZJHMxCiS6RenD9vFy9NbQ3uvRnLdAVADxeFaC89KLoyu8DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"31a23d47e4f86e63a426c65af3841c2da7bd6db33595ba3a38131266d4a7897b","last_reissued_at":"2026-05-18T00:02:24.713017Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:24.713017Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1809.01275","source_version":3,"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:02:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b6WCcun7jFBlZRoKC6DHF5VSvNie/TQQLqb1RhqLbmSQ8rUawJNgjUU38ZuWdBt2lD5Ju1uvMyOHE7YE3R8bDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T17:48:34.719455Z"},"content_sha256":"b998dad09c6312b2fa51ba43c73eec7a5f0c963cdd6a995af0519de153bf4434","schema_version":"1.0","event_id":"sha256:b998dad09c6312b2fa51ba43c73eec7a5f0c963cdd6a995af0519de153bf4434"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:GGRD2R7E7BXGHJBGYZNPHBA4FW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Solving Non-smooth Constrained Programs with Lower Complexity than $\\mathcal{O}(1/\\varepsilon)$: A Primal-Dual Homotopy Smoothing Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"math.OC","authors_text":"Hao Yu, Michael J. Neely, Qing Ling, Xiaohan Wei","submitted_at":"2018-09-05T00:26:58Z","abstract_excerpt":"We propose a new primal-dual homotopy smoothing algorithm for a linearly constrained convex program, where neither the primal nor the dual function has to be smooth or strongly convex. The best known iteration complexity solving such a non-smooth problem is $\\mathcal{O}(\\varepsilon^{-1})$. In this paper, we show that by leveraging a local error bound condition on the dual function, the proposed algorithm can achieve a better primal convergence time of $\\mathcal{O}\\left(\\varepsilon^{-2/(2+\\beta)}\\log_2(\\varepsilon^{-1})\\right)$, where $\\beta\\in(0,1]$ is a local error bound parameter. As an exam"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.01275","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"},"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:02:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vLXPAdL8gpg2m77nX8H/zs9weUU11H3KAkAF1wgZWmq3YyMRTv84L8xPk9wY8gaNTWAXJZSsCjXzVERKdM/cAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T17:48:34.719822Z"},"content_sha256":"aa7c8f72d88ccd785826cdb04a9feb156311a53093c1a8c18e071bef4d1f9eb8","schema_version":"1.0","event_id":"sha256:aa7c8f72d88ccd785826cdb04a9feb156311a53093c1a8c18e071bef4d1f9eb8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GGRD2R7E7BXGHJBGYZNPHBA4FW/bundle.json","state_url":"https://pith.science/pith/GGRD2R7E7BXGHJBGYZNPHBA4FW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GGRD2R7E7BXGHJBGYZNPHBA4FW/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-30T17:48:34Z","links":{"resolver":"https://pith.science/pith/GGRD2R7E7BXGHJBGYZNPHBA4FW","bundle":"https://pith.science/pith/GGRD2R7E7BXGHJBGYZNPHBA4FW/bundle.json","state":"https://pith.science/pith/GGRD2R7E7BXGHJBGYZNPHBA4FW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GGRD2R7E7BXGHJBGYZNPHBA4FW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:GGRD2R7E7BXGHJBGYZNPHBA4FW","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":"708c925a7a60941f910d8228904948e35053405810a2c9fbad311e56ba487a3c","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-09-05T00:26:58Z","title_canon_sha256":"67b5240ac8c4c4f2a177312ede281431c2e2c4f8756579d715cd7276b4254092"},"schema_version":"1.0","source":{"id":"1809.01275","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.01275","created_at":"2026-05-18T00:02:24Z"},{"alias_kind":"arxiv_version","alias_value":"1809.01275v3","created_at":"2026-05-18T00:02:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.01275","created_at":"2026-05-18T00:02:24Z"},{"alias_kind":"pith_short_12","alias_value":"GGRD2R7E7BXG","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"GGRD2R7E7BXGHJBG","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"GGRD2R7E","created_at":"2026-05-18T12:32:25Z"}],"graph_snapshots":[{"event_id":"sha256:aa7c8f72d88ccd785826cdb04a9feb156311a53093c1a8c18e071bef4d1f9eb8","target":"graph","created_at":"2026-05-18T00:02:24Z","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":"We propose a new primal-dual homotopy smoothing algorithm for a linearly constrained convex program, where neither the primal nor the dual function has to be smooth or strongly convex. The best known iteration complexity solving such a non-smooth problem is $\\mathcal{O}(\\varepsilon^{-1})$. In this paper, we show that by leveraging a local error bound condition on the dual function, the proposed algorithm can achieve a better primal convergence time of $\\mathcal{O}\\left(\\varepsilon^{-2/(2+\\beta)}\\log_2(\\varepsilon^{-1})\\right)$, where $\\beta\\in(0,1]$ is a local error bound parameter. As an exam","authors_text":"Hao Yu, Michael J. Neely, Qing Ling, Xiaohan Wei","cross_cats":["cs.DC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-09-05T00:26:58Z","title":"Solving Non-smooth Constrained Programs with Lower Complexity than $\\mathcal{O}(1/\\varepsilon)$: A Primal-Dual Homotopy Smoothing Approach"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.01275","kind":"arxiv","version":3},"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:b998dad09c6312b2fa51ba43c73eec7a5f0c963cdd6a995af0519de153bf4434","target":"record","created_at":"2026-05-18T00:02:24Z","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":"708c925a7a60941f910d8228904948e35053405810a2c9fbad311e56ba487a3c","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-09-05T00:26:58Z","title_canon_sha256":"67b5240ac8c4c4f2a177312ede281431c2e2c4f8756579d715cd7276b4254092"},"schema_version":"1.0","source":{"id":"1809.01275","kind":"arxiv","version":3}},"canonical_sha256":"31a23d47e4f86e63a426c65af3841c2da7bd6db33595ba3a38131266d4a7897b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"31a23d47e4f86e63a426c65af3841c2da7bd6db33595ba3a38131266d4a7897b","first_computed_at":"2026-05-18T00:02:24.713017Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:02:24.713017Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ta8cYRA+kqjLzVNggqQzR8Wpb4CdxDhxnJlGhiSZJHMxCiS6RenD9vFy9NbQ3uvRnLdAVADxeFaC89KLoyu8DQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:02:24.713678Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.01275","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b998dad09c6312b2fa51ba43c73eec7a5f0c963cdd6a995af0519de153bf4434","sha256:aa7c8f72d88ccd785826cdb04a9feb156311a53093c1a8c18e071bef4d1f9eb8"],"state_sha256":"9439bec4d080f655c811d2fba4414d6cc2e2768e266b8ab1bcb6541f076844e0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SZrzApoH83f/LRkWJ+3Sy8sdDF8MiojaXudeAEGD41upSkHEqM4hDxoFjNcEXYiHoWs0kVvSHJLkO5PcW1oVAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T17:48:34.722051Z","bundle_sha256":"0f2d5edca528a07b9791c7272c3c47fd1af22c462c0734b05784a9db16576337"}}